|
|
|
| A Hybrid Ant Colony Optimization for Bi-Objective VRP with Time Windows |
| DENG Lijuan, ZHANG Jihui
|
| a. Institute of Complexity Science, b. Shandong Key Laboratory of Industrial Control Technology, Qingdao University, Qingdao 266071, China |
|
|
|
|
Abstract With requirements of continuous improvements to customers’ service, Vehicle Routing Problems with Time Windows (VRPTW) attracted more and more attention. Aiming to minimize the total cost and to maximize customers’ satisfaction, a bi-objective integer programming model is established. A Hybrid Ant Colony Optimization (HACO) is designed to solve it. An elitist-ant strategy is set up to explore the bi-objective functions respectively and to get better non-dominant solutions. The evaporation factors are redefined to balance local and global search capabilities of the algorithm and to avoid premature convergence. NSGA-Ⅱ is used to guide the bi-objective optimizing process, a variable neighborhood search algorithm is used to expand the search space, in order to obtain the better Pareto solution set. The optimal parameter combination was determined by an orthogonal experiment, and the Solomon standard instances are used to test the performance of the algorithm. The simulation results show that the HACO can effectively solve the vehicle routing problem with time windows, and the performance of HACO has a significant improvement.
|
|
Received: 08 May 2020
Published: 21 December 2020
|
|
|
|
|
|
| No related articles found! |
|
|
|
|
