An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot
- 5 March 2015
- journal article
- research article
- Published by Springer Nature in Annals of Operations Research
- Vol. 242 (2) , 303-320
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Shortest Path Finding Problem in Stochastic Time-Dependent Road Networks With Stochastic First-In-First-Out PropertyIEEE Transactions on Intelligent Transportation Systems, 2013
- Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price frameworkAnnals of Operations Research, 2013
- Finding Reliable Shortest Paths in Road Networks Under UncertaintyNetworks and Spatial Economics, 2012
- Reliable shortest path finding in stochastic networks with spatial correlated link travel timesInternational Journal of Geographical Information Science, 2012
- A particle swarm optimization for the vehicle routing problem with simultaneous pickup and deliveryComputers & Operations Research, 2009
- Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimizationComputers & Operations Research, 2006
- Ant colony optimization techniques for the vehicle routing problemAdvanced Engineering Informatics, 2004
- A tabu search heuristic for periodic and multi-depot vehicle routing problemsNetworks, 1997
- A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known SolutionsAmerican Journal of Mathematical and Management Sciences, 1993
- An Algorithm for the Vehicle-dispatching ProblemJournal of the Operational Research Society, 1969