A Improved Pareto of Ant Colony Algorithm to Solve the Vehicle Routing Problem with Time Windows

Zhang, Hong Dou; Guo, Ning; Mao, Jian; Wang, Hai Feng

doi:10.4028/www.scientific.net/amr.1030-1032.1941

Search citation statements

Order By: Relevance

Paper Sections

Select...

Solving Vrptw Using Aco1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2018

2023

Publication Types

Select...

Article1

Other1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A new algorithm for VRPTW was introduced by Zhang et al [42] which is known as Improved Pareto Ant Colony Algorithm(IPACA). The algorithm improved the global search strategy of the ACO and helped prevent ACO from falling into the local optima.…”

Section: Solving Vrptw Using Acomentioning

confidence: 99%

A Comprehensive Study of Vehicle Routing Problem With Time Windows Using Ant Colony Optimization Techniques

Neogi¹,

Mounika²,

Kalyani³

et al. 2018

IJET

View full text Add to dashboard Cite

Ant Colony Optimization (ACO) is a nature-inspired swarm intelligence technique and a metaheuristic approach which is inspired by the foraging behavior of the real ants, where ants release pheromones to find the best and shortest route from their nest to the food source. ACO is being applied to various optimization problems till date and has been giving good quality results in the field. One such popular problem is known as Vehicle Routing Problem(VRP). Among many variants of VRP, this paper presents a comprehensive survey on VRP with Time Window constraints(VRPTW). The survey is presented in a chronological order discussing which of the variants of ACO is used in each paper followed by the advantages and limitations of the same.

show abstract

Section: Solving Vrptw Using Acomentioning

confidence: 99%