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 条

[21] Research on Hybrid Genetic Algorithm for Min-Max Vehicle Routing Problem
Ren, Chunyu
ADVANCED RESEARCH ON COMPUTER SCIENCE AND INFORMATION ENGINEERING, 2011, 153 : 177 - 182
[22] DNA Sequencing by Max-Min Ant System and Genetic Algorithm
Liu, Tao
Maeda, Michiharu
PROCEEDINGS OF THE SEVENTEENTH INTERNATIONAL SYMPOSIUM ON ARTIFICIAL LIFE AND ROBOTICS (AROB 17TH '12), 2012, : 820 - 823
[23] Transmembrane Helix Assembly by Max-Min Ant System Algorithm
Sujaree, Kanon
Kitjaruwankul, Sunan
Boonamnaj, Panisak
Supunyabut, Chirayut
Sompornpisut, Pornthep
CHEMICAL BIOLOGY & DRUG DESIGN, 2015, 86 (06) : 1360 - 1372
[24] A hybrid ant colony optimization with fireworks algorithm to solve capacitated vehicle routing problem
Yuelin Gao
Hongguang Wu
Wanting Wang
Applied Intelligence, 2023, 53 : 7326 - 7342
[25] A hybrid ant colony optimization with fireworks algorithm to solve capacitated vehicle routing problem
Gao, Yuelin
Wu, Hongguang
Wang, Wanting
APPLIED INTELLIGENCE, 2023, 53 (06) : 7326 - 7342
[26] Solving the capacitated vehicle routing problem by cellular ant algorithm
Geography Department, Dezhou University, Dezhou, Shandong 253023, China
J. Inf. Comput. Sci., 2012, 8 (2295-2304):
[27] Beam Search Combined With MAX-MIN Ant Systems and Benchmarking Data Tests for Weighted Vehicle Routing Problem
Tang, Jiafu
Guan, Jing
Yu, Yang
Chen, Jinyu
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2014, 11 (04) : 1097 - 1109
[28] A hybrid genetic algorithm for the capacitated vehicle routing problem
Berger, J
Barkaoui, M
GENETIC AND EVOLUTIONARY COMPUTATION - GECCO 2003, PT I, PROCEEDINGS, 2003, 2723 : 646 - 656
[29] Solving the Uncapacitated Traveling Purchaser Problem with the MAX-MIN Ant System
Skinderowicz, Rafal
COMPUTATIONAL COLLECTIVE INTELLIGENCE, ICCCI 2018, PT II, 2018, 11056 : 257 - 267
[30] A max-min ant system for the finance-based scheduling problem
Al-Shihabi, Sameh T.
AlDurgam, Mohammad M.
COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 110 : 264 - 276

← 1 2 3 4 5 →