IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v52y2018i4p739-755.html
   My bibliography  Save this article

Path and Speed Optimization for Conflict-Free Pickup and Delivery Under Time Windows

Author

Listed:
  • Tommaso Adamo

    (Department of Engineering for Innovation, Università del Salento, 73100 Lecce, Italy)

  • Tolga Bektaş

    (Centre for Operational Research, Management Science and Information Systems, Southampton Business School, University of Southampton, Southampton, Highfield SO17 1BJ, United Kingdom)

  • Gianpaolo Ghiani

    (Department of Engineering for Innovation, Università del Salento, 73100 Lecce, Italy)

  • Emanuela Guerriero

    (Department of Engineering for Innovation, Università del Salento, 73100 Lecce, Italy)

  • Emanuele Manni

    (Department of Engineering for Innovation, Università del Salento, 73100 Lecce, Italy)

Abstract

This article introduces a variant of the conflict-free pickup and delivery problem with time windows in which speeds can be regulated. The problem arises in several areas of transportation and logistics including routing and scheduling of automated guided vehicles in port terminals and coordination of unmanned aerial vehicles in controlled airspace. A particular aspect of this problem is that at most one vehicle can traverse an arc of the transportation network at any time. The problem studied in this paper is to determine the vehicle paths and speeds on each arc of the path in such a way that no conflicts arise, the time windows are met, and the total energy consumption is minimized. A branch-and-bound algorithm is described in which a lower bound is obtained by solving a separable nonlinear problem in quadratic time. If the solution of the relaxation is not conflict free, a set of space-based and time-based branching constraints are generated to resolve the detected conflicts. Computational experiments show that, when compared with a state-of-the-art approach, the proposed method is able to generate a larger number of feasible solutions (42% on average) and reduce the computation time by an order of magnitude. Moreover, the approach results in an average energy savings of around 70%.

Suggested Citation

  • Tommaso Adamo & Tolga Bektaş & Gianpaolo Ghiani & Emanuela Guerriero & Emanuele Manni, 2018. "Path and Speed Optimization for Conflict-Free Pickup and Delivery Under Time Windows," Transportation Science, INFORMS, vol. 52(4), pages 739-755, August.
    • Handle: RePEc:inm:ortrsc:v:52:y:2018:i:4:p:739-755
    DOI: 10.1287/trsc.2017.0816
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/trsc.2017.0816
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2017.0816?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Dumas, Yvan & Desrosiers, Jacques & Soumis, Francois, 1991. "The pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 54(1), pages 7-22, September.
    2. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Rejoinder on: Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 45-47, July.
    3. Nirup N. Krishnamurthy & Rajan Batta & Mark H. Karwan, 1993. "Developing Conflict-Free Routes for Automated Guided Vehicles," Operations Research, INFORMS, vol. 41(6), pages 1077-1090, December.
    4. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 1-31, July.
    5. Fiori, Chiara & Ahn, Kyoungho & Rakha, Hesham A., 2016. "Power-based electric vehicle energy consumption model: Model development and validation," Applied Energy, Elsevier, vol. 168(C), pages 257-268.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Cheng Hong & Yufang Guo & Yuhong Wang & Tingting Li, 2023. "The Integrated Scheduling Optimization for Container Handling by Using Driverless Electric Truck in Automated Container Terminal," Sustainability, MDPI, vol. 15(6), pages 1-22, March.
    2. Wang, Zehao & Zeng, Qingcheng & Li, Xingchun & Qu, Chenrui, 2024. "A branch-and-price heuristic algorithm for the ART and external truck scheduling problem in an automated container terminal with a parallel layout," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 184(C).
    3. Xing, Zheng & Liu, Haitao & Wang, Tingsong & Chew, Ek Peng & Lee, Loo Hay & Tan, Kok Choon, 2023. "Integrated automated guided vehicle dispatching and equipment scheduling with speed optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 169(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Capelle, Thomas & Cortés, Cristián E. & Gendreau, Michel & Rey, Pablo A. & Rousseau, Louis-Martin, 2019. "A column generation approach for location-routing problems with pickup and delivery," European Journal of Operational Research, Elsevier, vol. 272(1), pages 121-131.
    2. Regnier-Coudert, Olivier & McCall, John & Ayodele, Mayowa & Anderson, Steven, 2016. "Truck and trailer scheduling in a real world, dynamic and heterogeneous context," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 389-408.
    3. Wang, Zheng, 2018. "Delivering meals for multiple suppliers: Exclusive or sharing logistics service," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 496-512.
    4. Byungjun Ju & Minsu Kim & Ilkyeong Moon, 2021. "Vehicle Routing Problem Considering Reconnaissance and Transportation," Sustainability, MDPI, vol. 13(6), pages 1-19, March.
    5. Sharif Azadeh, Sh. & Atasoy, Bilge & Ben-Akiva, Moshe E. & Bierlaire, M. & Maknoon, M.Y., 2022. "Choice-driven dial-a-ride problem for demand responsive mobility service," Transportation Research Part B: Methodological, Elsevier, vol. 161(C), pages 128-149.
    6. Cherkesly, Marilène & Gschwind, Timo, 2022. "The pickup and delivery problem with time windows, multiple stacks, and handling operations," European Journal of Operational Research, Elsevier, vol. 301(2), pages 647-666.
    7. Dai, Rongjian & Ding, Chuan & Gao, Jian & Wu, Xinkai & Yu, Bin, 2022. "Optimization and evaluation for autonomous taxi ride-sharing schedule and depot location from the perspective of energy consumption," Applied Energy, Elsevier, vol. 308(C).
    8. Lu Zhen & Wenya Lv & Zheyi Tan & Bin Dong, 2022. "Container Transportation Scheduling Between Port Yards and the Hinterland in Yunfeng," Interfaces, INFORMS, vol. 52(3), pages 250-266, May.
    9. Margaretha Gansterer & Richard F. Hartl & Philipp E. H. Salzmann, 2018. "Exact solutions for the collaborative pickup and delivery problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(2), pages 357-371, June.
    10. Pang, King-Wah & Xu, Zhou & Li, Chung-Lun, 2011. "Ship routing problem with berthing time clash avoidance constraints," International Journal of Production Economics, Elsevier, vol. 131(2), pages 752-762, June.
    11. Bustos-Coral, Daniel & Costa, Alysson M., 2022. "Drayage routing with heterogeneous fleet, compatibility constraints, and truck load configurations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    12. Cortés, Cristián E. & Matamala, Martín & Contardo, Claudio, 2010. "The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method," European Journal of Operational Research, Elsevier, vol. 200(3), pages 711-724, February.
    13. Irawan, Chandra Ade & Ouelhadj, Djamila & Jones, Dylan & Stålhane, Magnus & Sperstad, Iver Bakken, 2017. "Optimisation of maintenance routing and scheduling for offshore wind farms," European Journal of Operational Research, Elsevier, vol. 256(1), pages 76-89.
    14. Timothy Curtois & Dario Landa-Silva & Yi Qu & Wasakorn Laesanklang, 2018. "Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(2), pages 151-192, June.
    15. Albert H. Schrotenboer & Evrim Ursavas & Iris F. A. Vis, 2019. "A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 53(4), pages 1001-1022, July.
    16. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    17. Neves-Moreira, F. & Amorim, P. & Guimarães, L. & Almada-Lobo, B., 2016. "A long-haul freight transportation problem: Synchronizing resources to deliver requests passing through multiple transshipment locations," European Journal of Operational Research, Elsevier, vol. 248(2), pages 487-506.
    18. Tzur, Michal & Drezner, Ehud, 2011. "A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system," European Journal of Operational Research, Elsevier, vol. 215(2), pages 325-336, December.
    19. Ali Mehsin Alyasiry & Michael Forbes & Michael Bulmer, 2019. "An Exact Algorithm for the Pickup and Delivery Problem with Time Windows and Last-in-First-out Loading," Transportation Science, INFORMS, vol. 53(6), pages 1695-1705, November.
    20. Du, Jianhui & Zhang, Zhiqin & Wang, Xu & Lau, Hoong Chuin, 2023. "A hierarchical optimization approach for dynamic pickup and delivery problem with LIFO constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:52:y:2018:i:4:p:739-755. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.