The multidepot drone general routing problem with duration and capacity constraints

被引:3
|
作者
Corberan, Teresa [1 ]
Plana, Isaac [2 ]
Sanchis, Jose M. [3 ]
Segura, Paula [3 ]
机构
[1] Univ Valencia, Dept Estadist & Invest Operat, Avda Dr Moliner 50, Burjassot 46100, Spain
[2] Univ Valencia, Dept Matemat Econ & Empresa, Avda Tarongers S-N, Valencia 46022, Spain
[3] Univ Politecn Valencia, Dept Matemat Aplicada, Camino Vera S-N, Valencia 46022, Spain
关键词
drones; general routing problem; multi-depot; length constraints; capacity constraints; matheuristic; branch-and-cut; CUT ALGORITHM; ARC; BRANCH; NODE;
D O I
10.1111/itor.13457
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper studies the multidepot drone general routing problem with duration and capacity constraints (MDdGRP), an extension of the classical general routing problem with several depots. A fleet of drones with limited flight time and payload, each one located in a different depot, must jointly perform the service. In this continuous optimization problem, a set of lines of a network has to be serviced and a set of nodes has to be visited to deliver a given commodity. The aim is to find a set of drone routes performing the complete service with the shortest total duration. Aerial drones can enter a line at any point, service a portion of that line, and exit through another point, without following the lines of the network. While this flexibility allows for potentially better solutions, it also adds complexity to the problem. To deal with this, we digitize the MDdGRP instances by approximating each line with a polygonal chain containing a finite number of points that can be used to enter and exit each line. Thus, an instance of a discrete multidepot general routing problem (MDGRP) is obtained. This paper proposes an integer formulation for the MDGRP, some families of valid inequalities, and a branch-and-cut algorithm based on the strengthened formulation. Two matheuristic algorithms are presented, focused on sequentially selecting (and adding) some promising intermediate points to enter and exit a line. Instances involving up to six depots, 22 delivery points, and 88 original lines have been generated to test the performance of the methods proposed.
引用
收藏
页数:24
相关论文
共 50 条
  • [41] Collaborative multidepot electric vehicle routing problem with time windows and shared charging stations
    Wang, Yong
    Zhou, Jingxin
    Sun, Yaoyao
    Fan, Jianxin
    Wang, Zheng
    Wang, Haizhong
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 219
  • [42] Vehicle routing with probabilistic capacity constraints
    Noorizadegan, Mandi
    Chen, Bo
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 270 (02) : 544 - 555
  • [43] Atomic Routing Game with Capacity Constraints
    Pal'tseva, D. A.
    Parfenov, A. P.
    AUTOMATION AND REMOTE CONTROL, 2019, 80 (10) : 1901 - 1911
  • [44] The drone latency location routing problem under uncertainty
    Bruni, Maria Elena
    Khodaparasti, Sara
    Perboli, Guido
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2023, 156
  • [45] On a Pickup to Delivery Drone Routing Problem: Models and algorithms
    Gomez-Lagos, Javier
    Rojas-Espinoza, Benjamin
    Candia-Vejar, Alfredo
    COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 172
  • [46] Capacitated Multi Drone Assisted Vehicle Routing Problem
    Kavlak, Hasan
    Isleyen, Selcuk Kursat
    Toklu, Bilal
    GAZI UNIVERSITY JOURNAL OF SCIENCE, 2024, 37 (03): : 1386 - 1415
  • [47] Optimizing Drone Delivery Paths from Shared Bases: A Location-Routing Problem with Realistic Energy Constraints
    Meskar, Mahla
    Ahmadi-Javid, Amir
    JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS, 2024, 110 (04)
  • [48] Drone routing problem with truck: Optimization and quantitative analysis
    Jeong, Ho Young
    Lee, Seokcheon
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 227
  • [49] The vehicle routing problem with drones and drone speed selection
    Tamke, Felix
    Buscher, Udo
    COMPUTERS & OPERATIONS RESEARCH, 2023, 152
  • [50] Truck-drone routing problem with stochastic demand
    Wang, Feilong
    Li, Hongqi
    Xiong, Hanxi
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2025, 322 (03) : 854 - 869