An ant colony algorithm for the multi-compartment vehicle routing problem

被引:168
|
作者
Reed, Martin [1 ]
Yiannakou, Aliki [1 ]
Evering, Roxanne [1 ]
机构
[1] Univ Bath, Dept Math Sci, Bath BA2 7AY, Avon, England
关键词
Ant colony optimization; Capacitated vehicle routing problem; Clustering; Multi-compartment vehicles; Waste collection; GENETIC ALGORITHM; OPTIMIZATION; SEARCH;
D O I
10.1016/j.asoc.2013.10.017
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We demonstrate the use of Ant Colony System (ACS) to solve the capacitated vehicle routing problem associated with collection of recycling waste from households, treated as nodes in a spatial network. For networks where the nodes are concentrated in separate clusters, the use of k-means clustering can greatly improve the efficiency of the solution. The ACS algorithm is extended to model the use of multi-compartment vehicles with kerbside sorting of waste into separate compartments for glass, paper, etc. The algorithm produces high-quality solutions for two-compartment test problems. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:169 / 176
页数:8
相关论文
共 50 条
  • [31] Multi-compartment waste collection vehicle routing problem with bin washer
    Masmoudi, M. Amine
    Baldacci, Roberto
    Mancini, Simona
    Kuo, Yong-Hong
    [J]. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2024, 189
  • [32] A dynamic approach for the multi-compartment vehicle routing problem in waste management
    Mohammadi, Mostafa
    Rahmanifar, Golman
    Hajiaghaei-Keshteli, Mostafa
    Fusco, Gaetano
    Colombaroni, Chiara
    Sherafat, Ali
    [J]. RENEWABLE & SUSTAINABLE ENERGY REVIEWS, 2023, 184
  • [33] Solving the vehicle routing problem with multi-compartment vehicles for city logistics
    Eshtehadi, Reza
    Demir, Emrah
    Huang, Yuan
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2020, 115
  • [34] Two metaheuristic approaches for solving the multi-compartment vehicle routing problem
    Yahyaoui, Hiba
    Kaabachi, Islem
    Krichen, Saoussen
    Dekdouk, Abdulkader
    [J]. OPERATIONAL RESEARCH, 2020, 20 (04) : 2085 - 2108
  • [35] Dynamic Multi-Compartment Vehicle Routing Problem for Smart Waste Collection
    Bouleft, Yousra
    Elhilali Alaoui, Ahmed
    [J]. APPLIED SYSTEM INNOVATION, 2023, 6 (01)
  • [36] Improved particle swarm optimization for multi-compartment vehicle routing problem
    Chen, Jiumei
    Zhang, Songyi
    Dan, Bin
    [J]. Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2019, 25 (11): : 2952 - 2962
  • [37] Two metaheuristic approaches for solving the multi-compartment vehicle routing problem
    Hiba Yahyaoui
    Islem Kaabachi
    Saoussen Krichen
    Abdulkader Dekdouk
    [J]. Operational Research, 2020, 20 : 2085 - 2108
  • [38] A Hybrid Ant Colony Algorithm for the Capacitated Vehicle Routing Problem
    Zhen, Tong
    Zhu, Yuhua
    Zhang, Qiuwen
    [J]. 2008 IEEE INTERNATIONAL SYMPOSIUM ON IT IN MEDICINE AND EDUCATION, VOLS 1 AND 2, PROCEEDINGS, 2008, : 935 - 939
  • [39] An improved ant colony algorithm based on Vehicle Routing Problem
    Pan, Tinglei
    Pan, Haipeng
    Gao, Jingfei
    [J]. 2015 34TH CHINESE CONTROL CONFERENCE (CCC), 2015, : 2747 - 2752
  • [40] A Novel Ant Colony Optimization Algorithm for the Vehicle Routing Problem
    Ganguly, Srinjoy
    Das, Swagatam
    [J]. SWARM, EVOLUTIONARY, AND MEMETIC COMPUTING, PT I (SEMCCO 2013), 2013, 8297 : 401 - 412