2010 Second International Conference on Information Technology and Computer Science 2010
DOI: 10.1109/itcs.2010.29
|View full text |Cite|
|
Sign up to set email alerts
|

Notice of Retraction: Vehicle Routing Problem with Time Windows Based on Improved Ant Colony Algorithm

Abstract: The vehicle routing problem with time windows (VRPTW) is based on a vehicle routing problem (VRP) which increased customer access time windows. More and more of the VRPTW research is attention because many real-life problems can be attributed to VRPTW, Consequently, good vehicle routing can not only increase the profit of logistics but also make logistics management more scientific. In view of the characteristic of logistics, an improved ant colony algorithm is proposed. The new algorithm is proposed to fast s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0
1

Year Published

2013
2013
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 3 publications
0
1
0
1
Order By: Relevance
“…• VRPTW-VRP con ventanas de tiempo: en este caso, se especifican intervalos de tiempo para que el cliente reciba sus productos o pedidos, y se penaliza cuando los pedidos se entregan fuera del 33 horario convenido o los vehículos deben esperar, con el consecuente aumento en los costos de operación (Ma, 2010).…”
Section: Descripción De Algunas Variantes Del Problema De Ruteo De Vehículos (Vrp)unclassified
“…• VRPTW-VRP con ventanas de tiempo: en este caso, se especifican intervalos de tiempo para que el cliente reciba sus productos o pedidos, y se penaliza cuando los pedidos se entregan fuera del 33 horario convenido o los vehículos deben esperar, con el consecuente aumento en los costos de operación (Ma, 2010).…”
Section: Descripción De Algunas Variantes Del Problema De Ruteo De Vehículos (Vrp)unclassified
“…Chengming Qi et al [5] presents a RACS-VRPTW, which hybridized ACS with randomized algorithm, only partial customers are randomly chosen to compute the transition probability. In [6] ACS is improved to get fast convergence speed, and used pheromones adjust strategies to prevent falling into local optimization in order to improve search results. This paper is an extension of [18].Here an enhanced ant colony system (EN_ACS) having new pheromone up-dating rule based on link quality is proposed.…”
Section: Introductionmentioning
confidence: 99%