2021
DOI: 10.1504/ijlsm.2021.117687
|View full text |Cite
|
Sign up to set email alerts
|

A multiple ant colony system with random variable neighbourhood descent for the vehicle routing problem with time windows

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…12/17 (4) Although the time window deviation of perturbation management is slightly higher than that of global rescheduling, the time window deviation of global management negatively affects the number of additional vehicles; therefore, overall, the perturbation management approach is more optimal than global management.…”
Section: Empirical Conclusionmentioning
confidence: 99%
See 1 more Smart Citation
“…12/17 (4) Although the time window deviation of perturbation management is slightly higher than that of global rescheduling, the time window deviation of global management negatively affects the number of additional vehicles; therefore, overall, the perturbation management approach is more optimal than global management.…”
Section: Empirical Conclusionmentioning
confidence: 99%
“…Belmecheri et al 3 improved the particle swarm optimization algorithm for solving the VRPTW for mixed round-trip customers. To solve the VRPTW, Júnior and Leal 4 proposed a hybrid heuristic algorithm using a multiple ant colony system; thus, they reduced the number of vehicles and the total distance traveled, while incorporating a stochastic variable neighborhood-descent algorithm for local search to obtain delivery paths with more optimal results. Bouchra et al 5 combined GA and variable neighborhood search to form a hybrid optimization method for solving a vehicle path problem with a soft time window and utilized GA to obtain an initial solution, which is obtained using a GA; thus, the study obtains the initial solution and optimizes the initial solution using two different neighborhood structures.…”
Section: Introductionmentioning
confidence: 99%
“…This ability dealt with the nonlinear global optimization problem and was initially developed for finding the shortest path of the travelling salesman problem [22]. Other combinatorial optimization problems that have been tackled using ACS, including vehicle routing [23], job scheduling [24], network communication [19], [25] and image processing [26]. However, the ACS's exploring mechanism is ineffective.…”
Section: Introductionmentioning
confidence: 99%