A multi-agent deep reinforcement learning approach for solving the multi-depot vehicle routing problem

被引:11
作者
Arishi, Ali [1 ,2 ]
Krishnan, Krishna [2 ]
机构
[1] King Khalid Univ, Dept Ind Engn, Abha, Saudi Arabia
[2] Wichita State Univ, Dept Ind Syst & Mfg Engn, Wichita, KS 67260 USA
关键词
artificial intelligence; supply chain management; combinatorial optimization; multi-depot vehicle routing problem; multi-agent deep reinforcement learning; COMBINATORIAL OPTIMIZATION; ARTIFICIAL-INTELLIGENCE; ALGORITHM; HEURISTICS; FLEET;
D O I
10.1080/23270012.2023.2229842
中图分类号
F [经济];
学科分类号
02 ;
摘要
The multi-depot vehicle routing problem (MDVRP) is one of the most essential and useful variants of the traditional vehicle routing problem (VRP) in supply chain management (SCM) and logistics studies. Many supply chains (SC) choose the joint distribution of multiple depots to cut transportation costs and delivery times. However, the ability to deliver quality and fast solutions for MDVRP remains a challenging task. Traditional optimization approaches in operation research (OR) may not be practical to solve MDVRP in real-time. With the latest developments in artificial intelligence (AI), it becomes feasible to apply deep reinforcement learning (DRL) for solving combinatorial routing problems. This paper proposes a new multi-agent deep reinforcement learning (MADRL) model to solve MDVRP. Extensive experiments are conducted to evaluate the performance of the proposed approach. Results show that the developed MADRL model can rapidly capture relative information embedded in graphs and effectively produce quality solutions in real-time.
引用
收藏
页码:493 / 515
页数:23
相关论文
共 60 条
[1]  
Aarts EH, 2003, Local Search in Combinatorial Optimization
[2]   A two-stage metaheuristic algorithm for the dynamic vehicle routing problem in Industry 4.0 approach [J].
Abdirad, Maryam ;
Krishnan, Krishna ;
Gupta, Deepak .
JOURNAL OF MANAGEMENT ANALYTICS, 2021, 8 (01) :69-83
[3]   Hybridized ant colony algorithm for the Multi Compartment Vehicle Routing Problem [J].
Abdulkader, Mohamed M. S. ;
Gajpal, Yuvraj ;
ElMekkawy, Tarek Y. .
APPLIED SOFT COMPUTING, 2015, 37 :196-203
[4]   Discrete crow-inspired algorithms for traveling salesman problem [J].
Al-Gaphari, Ghaleb H. ;
Al-Amry, Rowaida ;
Al-Nuzaili, Afrah S. .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2021, 97
[5]   Dynamic energy scheduling and routing of a large fleet of electric vehicles using multi-agent reinforcement learning [J].
Alqahtani, Mohammed ;
Scott, Michael J. ;
Hu, Mengqi .
COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 169
[6]   Deep Reinforcement Learning A brief survey [J].
Arulkumaran, Kai ;
Deisenroth, Marc Peter ;
Brundage, Miles ;
Bharath, Anil Anthony .
IEEE SIGNAL PROCESSING MAGAZINE, 2017, 34 (06) :26-38
[7]  
Bello I., 2017, 5 INT C LEARN REPR I
[8]   Machine learning for combinatorial optimization: A methodological tour d'horizon [J].
Bengio, Yoshua ;
Lodi, Andrea ;
Prouvost, Antoine .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 290 (02) :405-421
[9]   Solving Multi-Agent Routing Problems Using Deep Attention Mechanisms [J].
Bono, Guillaume ;
Dibangoye, Jilles S. ;
Simonin, Olivier ;
Matignon, Laetitia ;
Pereyron, Florian .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2021, 22 (12) :7804-7813
[10]   The vehicle routing problem: State of the art classification and review [J].
Braekers, Kris ;
Ramaekers, Katrien ;
Van Nieuwenhuyse, Inneke .
COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 99 :300-313