An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot
Published 2015 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot
Authors
Keywords
Carton, Heterogeneous vehicle routing problem with a collection depot, Particle swarm optimization, Local search, Self-adaptive inertia weight
Journal
ANNALS OF OPERATIONS RESEARCH
Volume 242, Issue 2, Pages 303-320
Publisher
Springer Nature
Online
2015-03-04
DOI
10.1007/s10479-015-1792-x
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Transit network design based on travel time reliability
- (2014) Baozhen Yao et al. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES
- Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework
- (2013) Theodore Athanasopoulos et al. ANNALS OF OPERATIONS RESEARCH
- Shortest Path Finding Problem in Stochastic Time-Dependent Road Networks With Stochastic First-In-First-Out Property
- (2013) Bi Yu Chen et al. IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS
- Artificial bee colony algorithm with scanning strategy for the periodic vehicle routing problem
- (2013) Baozhen Yao et al. SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL
- A Birnbaum-importance based genetic local search algorithm for component assignment problems
- (2012) Qingzhu Yao et al. ANNALS OF OPERATIONS RESEARCH
- Finding Reliable Shortest Paths in Road Networks Under Uncertainty
- (2012) Bi Yu Chen et al. NETWORKS & SPATIAL ECONOMICS
- Disrupted capacitated vehicle routing problem with order release delay
- (2011) Qianxin Mu et al. ANNALS OF OPERATIONS RESEARCH
- An improved decomposition-based heuristic to design a water distribution network for an irrigation system
- (2011) Graça Marques Gonçalves et al. ANNALS OF OPERATIONS RESEARCH
- A novel particle swarm optimization algorithm with adaptive inertia weight
- (2011) Ahmad Nickabadi et al. APPLIED SOFT COMPUTING
- Parallel genetic algorithm in bus route headway optimization
- (2011) Bin Yu et al. APPLIED SOFT COMPUTING
- Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries
- (2011) Tao Zhang et al. COMPUTERS & OPERATIONS RESEARCH
- Reliable shortest path finding in stochastic networks with spatial correlated link travel times
- (2011) Bi Yu Chen et al. INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE
- A parallel improved ant colony optimization for multi-depot vehicle routing problem
- (2010) B Yu et al. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- An ant colony optimization model: The period vehicle routing problem with time windows
- (2010) Bin Yu et al. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
- (2009) Emmanouil E. Zachariadis et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- An efficient job-shop scheduling algorithm based on particle swarm optimization☆
- (2009) Tsung-Lieh Lin et al. EXPERT SYSTEMS WITH APPLICATIONS
- Solving shortest path problem using particle swarm optimization
- (2008) Ammar W. Mohemmed et al. APPLIED SOFT COMPUTING
- A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
- (2008) The Jin Ai et al. COMPUTERS & OPERATIONS RESEARCH
- An improved ant colony optimization for vehicle routing problem
- (2008) Bin Yu et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- (2008) Arif Imran et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Publish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn MoreAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started