Pickup and Delivery Problem with Cooperative Robots
Authors: 
Chi Thao Nguyen, Jean-Philippe Gayon, Viet Hung Nguyen, Alain Quilliot, Anh Son TaAuthors Info & Claims
Chi Thao Nguyen, Jean-Philippe Gayon, Viet Hung Nguyen, Alain Quilliot, Anh Son TaAuthors Info & ClaimsPages 695 - 700
Abstract
This paper explores the Pickup and Delivery Problem with Cooperative Robots (PDP-CR), a new interest that has emerged in warehouse settings with automated vehicles where multiple robots must cooperate to complete a task. i.e. when a task requires more than one robot. In PDP-CR, a fleet of identical robots has to handle a set of tasks. Each task consists of a pickup point, a destination, processing time, and the number of robots required. The primary objective is to complete all tasks using the initial robots while minimizing the makespan, representing the time until the last robot returns to the depot. PDP-CR is an NP-hard problem. In this paper, we will propose two MILP formulations that are solved using CPLEX. The primary goal of this paper is to introduce PDPC-CR, develop, test, and compare the mathematical models proposed for it.
References
[1]
Gerardo Berbeglia, Jean-François Cordeau, and Gilbert Laporte. 2010. Dynamic pickup and delivery problems. European Journal of Operational Research 202, 1 (April 2010), 8–15. https://doi.org/10.1016/j.ejor.2009.04.024
[2]
David Bredström and Mikael Rönnqvist. 2008. Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. European Journal of Operational Research 191, 1 (Nov. 2008), 19–31. https://doi.org/10.1016/j.ejor.2007.07.033
[3]
Michael Drexl. 2012. Synchronization in Vehicle Routing—A Survey of VRPs with Multiple Synchronization Constraints. Transportation Science 46, 3 (Aug. 2012), 297–316. https://doi.org/10.1287/trsc.1110.0400
[4]
S.R. Ait Haddadene, N. Labadie, and C. Prodhon. 2016. NSGAII Enhanced with a Local Search for the Vehicle Routing Problem with Time Windows and Synchronization Constraints. IFAC-PapersOnLine 49, 12 (2016), 1198–1203. https://doi.org/10.1016/j.ifacol.2016.07.671
[5]
B. L. Hollis, M. A. Forbes, and B. E. Douglas. 2006. Vehicle routing and crew scheduling for metropolitan mail distribution at Australia Post. European Journal of Operational Research 173, 1 (Aug. 2006), 133–150. https://doi.org/10.1016/j.ejor.2005.01.005
[6]
Byung-In Kim, Jeongin Koo, and Junhyuk Park. 2010. The combined manpower-vehicle routing problem for multi-staged services. Expert Systems with Applications 37, 12 (Dec. 2010), 8424–8431. https://doi.org/10.1016/j.eswa.2010.05.036
[7]
Gilbert Laporte. 1992. The traveling salesman problem: An overview of exact and approximate algorithms. European Journal of Operational Research 59, 2 (June 1992), 231–247. https://doi.org/10.1016/0377-2217(92)90138-Y
[8]
Ran Liu, Yangyi Tao, and Xiaolei Xie. 2019. An Adaptive Large Neighborhood Search Heuristic for the Vehicle Routing Problem with Time Windows and Synchronized Visits. Computers & Operations Research 101 (Jan. 2019), 250–262. https://doi.org/10.1016/j.cor.2018.08.002
[9]
Sophie N. Parragh, Karl F. Doerner, and Richard F. Hartl. 2008. A survey on pickup and delivery problems. Journal für Betriebswirtschaft 58, 1 (April 2008), 21–51. https://doi.org/10.1007/s11301-008-0033-7
[10]
Sophie N. Parragh, Karl F. Doerner, and Richard F. Hartl. 2008. A survey on pickup and delivery problems: Part II: Transportation between pickup and delivery locations. Journal für Betriebswirtschaft 58, 2 (June 2008), 81–117. https://doi.org/10.1007/s11301-008-0036-4
[11]
Paolo Toth and Daniele Vigo (Eds.). 2002. The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia, Pa.
Index Terms
- Pickup and Delivery Problem with Cooperative Robots
Index terms have been assigned to the content through auto-classification.
Recommendations
Model formulations for pickup and delivery problems in designated driver services
AbstractDesignated driver services use company vehicles to deliver drivers to customers. The drivers then drive the customers from their origins to their destinations in the customers’ own cars; at the destinations, the drivers are picked up by a company ...
Highlights- Introduce the designated driver pickup and delivery problem.
- Consider fixed and flexible driver vehicle assignment strategies.
- Propose and assess an efficient two-index formulation.
- Flexible driver assignment strategy leads to ...
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
The fourth international colloquium on graphs and optimisation (GO-IV)We study a generalization of the well-known traveling salesman problem (TSP) where each customer provides or requires a given non-zero amount of product, and the vehicle in a depot has a given capacity. Each customer and the depot must be visited ...
A Compact Arc-Based ILP Formulation for the Pickup and Delivery Problem with Divisible Pickups and Deliveries
We consider the capacitated single vehicle one-to-one pickup and delivery problem with divisible pickups and deliveries (PDPDPD). In this problem, we do not make the standard assumption of one-to-one pickup and delivery problems (PDPs) that each location ...
Comments
Information & Contributors
Information
Published In
December 2023
1058 pages
ISBN:9798400708916
DOI:10.1145/3628797
Copyright © 2023 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 07 December 2023
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
SOICT 2023
SOICT 2023: The 12th International Symposium on Information and Communication Technology
December 7 - 8, 2023
Ho Chi Minh, Vietnam
Acceptance Rates
Overall Acceptance Rate 147 of 318 submissions, 46%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 25Total Downloads
- Downloads (Last 12 months)14
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format