Periodic Vehicle Routing problem and tabu search algorithm
- DOI
- 10.2991/meic-15.2015.118How to use a DOI?
- Keywords
- periodic vehicle routing problem; vehicle routing problem; optimizing; tabu search; algorithm desigining
- Abstract
Periodic vehicle routing problem and its solution algorithms are being deeply studied by scholars, the outputs of them are helpful to solve problems such as time setting for waste household appliances, bulky waste discarded in reality, etc. Through the literatures review of PVRP, it can be seen that PVRP solution is still difficult. Taking the reverse recovery system as an example and aiming at the shortest distance, this paper builds the periodic vehicle routing optimization model which can fully embody the characteristics and requirement of recycling of waste household appliances, designs an improved tabu search algorithm, and develops a program by Matlab to solve the established model. Example analysis shows the validity of the model and algorithm. This work can enrich related theory of PVRP and reverse logistics, and provide reference for government to make decisions of relevant management policies.
- Copyright
- © 2015, 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/).
Cite this article
TY - CONF AU - Wenhua Wen AU - Houming Fan AU - Xiang Yang AU - Tongxuan Qi PY - 2015/04 DA - 2015/04 TI - Periodic Vehicle Routing problem and tabu search algorithm BT - Proceedings of the 2015 International Conference on Mechatronics, Electronic, Industrial and Control Engineering PB - Atlantis Press SP - 511 EP - 514 SN - 2352-5401 UR - https://doi.org/10.2991/meic-15.2015.118 DO - 10.2991/meic-15.2015.118 ID - Wen2015/04 ER -