Solve VRPPD with Improved Bacteria Optimization Algorithm

DOI

10.2991/msmee-17.2017.314How to use a DOI?

Keywords

vehicle routing problem with pickup and delivery, improved bacteria foraging optimization algorithm, non dominate sorting

Abstract

In this paper, an improved bacteria foraging optimization algorithm based on different constraint conditions is proposed to solve the vehicle routing problem with pickup and delivery (VRPPD). At first, the mathematical model is established aiming at minimizing the dispatching time and the total cost. Secondly, the paper proposes the method with dynamic variable step factor, as well as propagation threshold and death threshold to copy the excellent individuals and eliminate the inferior individuals. Finally, the improved method is applied to the CMTnX and CMTnY, and its effectiveness is verified from the result of comparison with some existing algorithms.

Copyright

© 2017, 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  - Bo Li
AU  - Chen Guo
AU  - Tao Ning
AU  - Yingqi Wei
PY  - 2017/05
DA  - 2017/05
TI  - Solve VRPPD with Improved Bacteria Optimization Algorithm
BT  - Proceedings of the 2017 2nd International Conference on Materials Science, Machinery and Energy Engineering (MSMEE 2017)
PB  - Atlantis Press
SP  - 1732
EP  - 1736
SN  - 2352-5401
UR  - https://doi.org/10.2991/msmee-17.2017.314
DO  - 10.2991/msmee-17.2017.314
ID  - Li2017/05
ER  -