DocumentCode :
2605197
Title :
Analysis of the Degree of Difficulty in Solving Vehicle Routing Problem with Time Windows
Author :
Tian, Lin
Author_Institution :
Bus. Sch., Zhengzhou Univ., Zhengzhou, China
fYear :
2012
fDate :
21-23 April 2012
Firstpage :
51
Lastpage :
54
Abstract :
Vehicle routing problem with time windows (VRPTW) is a well-known NP-complete problem in operational research and computer science. In the literature, a great amount of research has been focused on various genetic algorithms (GAs) to solve VRPTW. However, little attention is made to measure to what degree a particular instance of VRPTW is difficult when GA is used. In this paper, fitness distance correlation (FDC) analysis is adopted to predict the problem difficulty of a given instance of VRPTW, being able to guide the design of well-suited GAs. Solomon´s R1 instances are used as test instances and the FDC results shows all the instances are classified as deceptive and misleading problems where fitness increases with distances decreasing.
Keywords :
combinatorial mathematics; computational complexity; correlation methods; genetic algorithms; logistics; FDC; GA; NP-complete problem; Solomon R1 instances; VRPTW; computer science; deceptive problems; difficulty degree analysis; fitness distance correlation analysis; genetic algorithms; misleading problems; operational research; vehicle routing problem with time windows; Biological cells; Correlation; Educational institutions; Genetic algorithms; Routing; Time factors; Vehicles; fitness distance correlation; vehicle routing problem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Internet Computing for Science and Engineering (ICICSE), 2012 Sixth International Conference on
Conference_Location :
Henan
Print_ISBN :
978-1-4673-1683-5
Type :
conf
DOI :
10.1109/ICICSE.2012.14
Filename :
6239718
Link To Document :
بازگشت