DocumentCode :
3072665
Title :
A particle swarm optimization for the dynamic vehicle routing problem
Author :
Demirtas, Yonca Erdem ; Ozdemir, Erhan ; Demirtas, Umut
Author_Institution :
Dept. of Quantitative Methods, Istanbul Univ., Istanbul, Turkey
fYear :
2015
fDate :
27-29 May 2015
Firstpage :
1
Lastpage :
5
Abstract :
Various versions of the Vehicle Routing Problem (VRP) have been studied for many years. VRP is a static problem, while in the real world, many problems have dynamic nature. In the Dynamic VRP (DVRP), not all information about the problem is known at the beginning of the planning horizon, and, in most cases the information can change after the solution process begins. This two characteristics make the DVRP harder than static VRP. In this study the DVRP is examined and a Particle Swarm Optimization algorithm is proposed. The most known benchmarks are solved with the proposed algorithm and the results are compared with the previous employed methods in the literature.
Keywords :
particle swarm optimisation; vehicle routing; DVRP; dynamic VRP; dynamic vehicle routing problem; particle swarm optimization algorithm; planning horizon; Decoding; Heuristic algorithms; Optimization; Particle swarm optimization; Vehicle dynamics; Vehicle routing; Vehicles;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Modeling, Simulation, and Applied Optimization (ICMSAO), 2015 6th International Conference on
Conference_Location :
Istanbul
Type :
conf
DOI :
10.1109/ICMSAO.2015.7152224
Filename :
7152224
Link To Document :
بازگشت