A Hybrid Max-Min Ant System Algorithm for Electric Capacitated Vehicle Routing Problem

被引：0
|
作者：
Hou, Yan-e [1 ]
Wang, Congran [2 ]
Zhang, Chunyang [3 ]
Dang, Lanxue [4 ]
Xiao, Chunjing [5 ]
机构：
[1] Henan Key Laboratory of Big Data Analysis and Processing, Henan University, Kaifeng,475004, China
[2] College of Computer and Information Engineering, Henan University, Kaifeng,475004, China
[3] College of Computer and Information Engineering, Henan University, Kaifeng,475004, China
[4] College of Computer and Information Engineering, Henan University, Kaifeng,475004, China
[5] School of Computer and Information Engineering, Henan University, Kaifeng,475004, China
来源：
IAENG International Journal of Computer Science | 2024年 / 51卷 / 03期
关键词：
Electric vehicles have become the first choice for products delivery in logistics; due to their environmental friendliness and low cost compared to the traditional fuel vehicles. This paper deals with an electric capacitated vehicle routing problem with variable energy consumption rate (E-CVRP); which aims to minimize the total cost including vehicle fixed cost; traveled distance cost and energy cost. First; a mixed integer linear programming model is constructed based on the fact that the energy consumption is affected by the vehicle load. Second; a hybrid Max-Min Ant System (HMMAS) algorithm is proposed to solve this problem. Three neighborhood structures are introduced and executed in a Variable Neighborhood Descent (VND) algorithm to improve the current solution. In addition; an effective charging station adjustment strategy is adopted to further improve the solution obtained by the local search process. Finally; some experiments have been conducted on public instances; and the results demonstrate the effectiveness and stability of the algorithm. © (2024); (International Association of Engineers). All Rights Reserved;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：195 / 203
相关论文
共 50 条
  • [41] Adaptive Hybrid Ant Colony Optimization for Capacitated Vehicle Routing Problem
    Gu Y.
    Liu D.
    Dongbei Daxue Xuebao/Journal of Northeastern University, 2023, 44 (12): : 1686 - 1695and1704
  • [42] Using the Ant Colony Optimization Algorithm for the Capacitated Vehicle Routing Problem
    Stodola, Petr
    Mazal, Jan
    Podhorec, Milan
    Litvaj, Ondrej
    PROCEEDINGS OF THE 2014 16TH INTERNATIONAL CONFERENCE ON MECHATRONICS (MECHATRONIKA 2014), 2014, : 503 - 510
  • [43] Convergence analysis of a Max-Min ant colony algorithm
    Wang, Honghao
    Liu, Qing
    DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2006, 13E : 3901 - 3904
  • [44] Hybrid Max-Min ant system with four vertices and three lines inequality for traveling salesman problem
    Yong, Wang
    SOFT COMPUTING, 2015, 19 (03) : 585 - 596
  • [45] Pareto max-min ant system algorithm and its application to hot rolling batch planning problem
    Jia, Shu-Jin
    Zhu, Jun
    Du, Bin
    Yue, Heng
    Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 2012, 29 (02): : 137 - 144
  • [46] Analyzing the effects of instance features and algorithm parameters for max-min ant system and the traveling salesperson problem
    Nallaperuma, Samadhi
    Wagner, Markus
    Neumann, Frank
    FRONTIERS IN ROBOTICS AND AI, 2015,
  • [47] An Effective Hybrid Optimization Algorithm for Capacitated Vehicle Routing Problem
    陈爱玲
    杨根科
    吴智铭
    Journal of Shanghai Jiaotong University(Science), 2006, (01) : 50 - 55
  • [48] An improved hybrid firefly algorithm for capacitated vehicle routing problem
    Altabeeb, Asma M.
    Mohsen, Abdulqader M.
    Ghallab, Abdullatif
    APPLIED SOFT COMPUTING, 2019, 84
  • [49] Study on Hybrid Genetic Algorithm for Capacitated Vehicle Routing Problem
    Ren, Chunyu
    SUSTAINABLE ENVIRONMENT AND TRANSPORTATION, PTS 1-4, 2012, 178-181 : 1769 - 1772
  • [50] A new hybrid genetic algorithm for the capacitated vehicle routing problem
    Berger, J
    Barkaoui, M
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2003, 54 (12) : 1254 - 1262
12345