Capacitated Vehicle Routing Problem Based on Multi-Objective Simulated Annealing
BI Zhisheng
CAI Mingqian
Abstract：Vehicle routing problem is a well-known NP problem in operations research. As the most basic vehicle routing prob-lem,the research of capacitated vehicle routing problem has important reference for other types of vehicle routing problems. In this paper,four optimization functions are firstly inspected from the view of logistics enterprise and customer,which extends the capaci-tated vehicle routing problem to many-objective field. Then,the multiobjective simulated annealing using Pareto-domination based acceptance criterion is used to solve this problem under single-array encoding and multi-array encoding. The advantages and disad-vantages of these two methods are analyzed with experiment. The experiments on nine Augerat datasets show that the single-array en-coding method is better than the multi-array encoding method with the measure of IGD and HV. The Pareto set obtained by the sin-gle-array encoding method has better diversity and worse convergence than that obtained by the multi-array encoding method.
Keywords：vehicle routing problemcapacitatedmany-objective optimization
Publication Date：2017-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：6( 1513-1518 )