An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows

Balseiro, Santiago; Loiseau, Irène; Ramonet, J.

doi:10.1016/j.cor.2010.10.011

Cited by 153 publications

(101 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In their article, [58] suggested an Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows (TDVRPTW). In the TDVRPTW, es must deliver goods to a set of customers, time window constraints of the customers must be respected and the fact that the travel time between two points depends on the time of departure, has to be taken into account.…”

Section: Meta-heuristicsmentioning

confidence: 99%

A Survey on the Vehicle Routing Problem and Its Variants

Kumar¹,

Panneerselvam²

2012

IIM

242

126

View full text Add to dashboard Cite

In this paper, we have conducted a literature review on the recent developments and publications involving the vehicle routing problem and its variants, namely vehicle routing problem with time windows (VRPTW) and the capacitated vehicle routing problem (CVRP) and also their variants. The VRP is classified as an NP-hard problem. Hence, the use of exact optimization methods may be difficult to solve these problems in acceptable CPU times, when the problem involves real-world data sets that are very large. The vehicle routing problem comes under combinatorial problem. Hence, to get solutions in determining routes which are realistic and very close to the optimal solution, we use heuristics and meta-heuristics. In this paper we discuss the various exact methods and the heuristics and meta-heuristics used to solve the VRP and its variants.

show abstract

Section: Meta-heuristicsmentioning

confidence: 99%

A Survey on the Vehicle Routing Problem and Its Variants

Kumar¹,

Panneerselvam²

2012

IIM

242

126

View full text Add to dashboard Cite

show abstract

“…In order to compare the efficiency of different algorithms to VRPTW, The state-of-the-art method of Goal Programming and Genetic Algorithm (GPGA) [28], Improved Large Neighborhood Search (I-LNS) [22] and Ant Colony Optimization Hybridized with Insertion Heuristics (ACO-IH) [25] are used to compare HPSO. The results of comparison experiments of VRPTW are shown in Tables 6-8.…”

Section: Comparison Results Of Hpso With Other State-of-the-art Methodsmentioning

confidence: 99%

“…(4) ACO combined with other algorithms provided another way to solve VRPTW [25][26][27]. The weakness of ACO for VRPTW is that ants tend to create infeasible solutions with non-routed clients.…”

Section: Related Workmentioning

confidence: 99%

A Hybrid Chaos-Particle Swarm Optimization Algorithm for the Vehicle Routing Problem with Time Window

Liang

Peng

et al. 2013

Entropy

View full text Add to dashboard Cite

State-of-the-art heuristic algorithms to solve the vehicle routing problem with time windows (VRPTW) usually present slow speeds during the early iterations and easily fall into local optimal solutions. Focusing on solving the above problems, this paper analyzes the particle encoding and decoding strategy of the particle swarm optimization algorithm, the construction of the vehicle route and the judgment of the local optimal solution. Based on these, a hybrid chaos-particle swarm optimization algorithm (HPSO) is proposed to solve VRPTW. The chaos algorithm is employed to re-initialize the particle swarm. An efficient insertion heuristic algorithm is also proposed to build the valid vehicle route in the particle decoding process. A particle swarm premature convergence judgment mechanism is formulated and combined with the chaos algorithm and Gaussian mutation into HPSO when the particle swarm falls into the local convergence. Extensive experiments are carried out to test the parameter settings in the insertion heuristic algorithm and to evaluate that they are corresponding to the data's real-distribution in the concrete problem. It is also revealed that the HPSO achieves a better performance than the other state-of-the-art algorithms on solving VRPTW.

show abstract

“…Gambardella [8] proposed the multiple ant colony system, MACS-VRPTW, to improve best known results. Hybridization of ACS and insertion heuristic was presented in Balserio et al [15].X. Hu et al [16] proposed an improved ACS coupled with saving algorithm and disaster operator to overcome the problem of getting in local optimal solution.…”

Section: Introductionmentioning

confidence: 99%

An Enhanced Ant Colony System for Solving Vehicle Routing Problem with Time Window

Sandhya¹,

Katiyar²

2013

IJCA

View full text Add to dashboard Cite

Vehicle Routing Problem with Time Window (VRPTW), an extension of VRP, is a complex combinatorial problem having many real life applications. It can be described as the problem of minimizing the total route cost while satisfying the capacity and time window constraint. Ant Colony System (ACS) is a meta heuristic that is often applied to solve VRPTW. In this paper an attempt has been made to enhance the already existing ant colony system to solve the problem efficiently. Experimentation with the Solomon data sheet is performed and compared with best known results available in literature.

show abstract

An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows

Cited by 153 publications

References 21 publications

A Survey on the Vehicle Routing Problem and Its Variants

A Survey on the Vehicle Routing Problem and Its Variants

A Hybrid Chaos-Particle Swarm Optimization Algorithm for the Vehicle Routing Problem with Time Window

An Enhanced Ant Colony System for Solving Vehicle Routing Problem with Time Window

Contact Info

Product

Resources

About