DocumentCode
525770
Title
Notice of Retraction
An effective meta-heuristics for the vehicle routing problem with time windows
Author
Shan-liang Hu
Author_Institution
Econ. & Trade Coll., Hunan Univ., Changsha, China
Volume
3
fYear
2010
fDate
12-13 June 2010
Firstpage
156
Lastpage
159
Abstract
Notice of Retraction
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
The vehicle routing problem with time windows (VRPTW) is a well-known and complex combinatorial problem, which has received considerable attention in recent years. In this paper, an effective meta-heuristics for VRPTW was designed to minimize the vehicle number and total travel distance. Performances are compared with other heuristics appeared in the literature recently by the bench-mark data sets. The computational results show that the proposed approaches produce high quality results within a reasonable computing time.
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
The vehicle routing problem with time windows (VRPTW) is a well-known and complex combinatorial problem, which has received considerable attention in recent years. In this paper, an effective meta-heuristics for VRPTW was designed to minimize the vehicle number and total travel distance. Performances are compared with other heuristics appeared in the literature recently by the bench-mark data sets. The computational results show that the proposed approaches produce high quality results within a reasonable computing time.
Keywords
combinatorial mathematics; optimisation; transportation; combinatorial problem; metaheuristics algorithm; time windows problem; vehicle routing problem; Artificial neural networks; Navigation; meta-heuristics; optimization; vehicle routing problem with time windows;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Communication Technologies in Agriculture Engineering (CCTAE), 2010 International Conference On
Conference_Location
Chengdu
Print_ISBN
978-1-4244-6944-4
Type
conf
DOI
10.1109/CCTAE.2010.5543303
Filename
5543303
Link To Document