Vehicle Routing Problem with Simultaneous Delivery and Pick-up with an Improved Genetic Algorithm

DOI

10.2991/ammsa-18.2018.23How to use a DOI?

Keywords

vehicle routing problem; genetic algorithm; pick-up and delivery; transportation cost

Abstract

Based on the traditional theory and algorithms of vehicle routing problem, the multi-objective VRPSDP model is established in considering the minimum of the number of vehicles and the transportation costs. The genetic algorithm is used as the solving algorithm of the model in this paper, in order to ensure the effectiveness of the chromosomes in the iterative process, the chromosome encoding and the genetic arithmetic operators, which are more suitable for solving the problem of the vehicle operating route are devised. Simulation experiments are done in the application of the modified Solomon R101 case, the optimal objective function value and the optimal program of arranging the vehicle routes are respectively obtained by the basic GA and the improved GA. According to the comparative analysis the convergence process of the optimal solution on two genetic algorithms, it is validated that the model is reasonable and the solving algorithm is effective.

Copyright

© 2018, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Nuo Zhu
PY  - 2018/05
DA  - 2018/05
TI  - Vehicle Routing Problem with Simultaneous Delivery and Pick-up with an Improved Genetic Algorithm
BT  - Proceedings of the 2018 2nd International Conference on Applied Mathematics, Modelling and Statistics Application (AMMSA 2018)
PB  - Atlantis Press
SP  - 105
EP  - 109
SN  - 1951-6851
UR  - https://doi.org/10.2991/ammsa-18.2018.23
DO  - 10.2991/ammsa-18.2018.23
ID  - Zhu2018/05
ER  -