Hybrid modified ant system with sweep algorithm and path relinking for the capacitated vehicle routing problem
Vehicle routing problem is a widely researched combinatorial optimization problem. We developed a hybrid of three strategies—a modified ant system, a sweep algorithm, and a path relinking—for solving a capacitated vehicle routing optimization problem, a vehicle routing problem with a capacity constr...
Main Authors: | Arit Thammano, Petcharat Rungwachira |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2021-09-01
|
Series: | Heliyon |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2405844021021320 |
Similar Items
-
A Multi-Stage Algorithm for a Capacitated Vehicle Routing Problem with Time Constraints
by: Lucia Cassettari, et al.
Published: (2018-05-01) -
Capacitated vehicle routing problem model for carriers
by: Irma-Delia Rojas-Cuevas, et al.
Published: (2018-07-01) -
Optimasi Capacitated Vehicle Routing Problem with Time Windows dengan Menggunakan Ant Colony Optimization
by: Iwan Aang Soenandi, et al.
Published: (2019-07-01) -
An efficient improvement of ant colony system algorithm for handling capacity vehicle routing problem
by: Modhi Lafta Mutar, et al.
Published: (2020-06-01) -
Coevolution and transfer learning in a point-to-point fleet coordination problem
by: Yliniemi, Logan Michael
Published: (2012)