IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v141y2020ics1366554520306918.html
   My bibliography  Save this article

Efficient loading and unloading operations via a booking system

Author

Listed:
  • Mor, A.
  • Speranza, M.G.
  • Viegas, J.M.

Abstract

Urban distribution of parcels and goods usually requires vehicles to temporarily stop at roadside to allow for the driver to perform the last leg of the delivery by foot. The stops take place in designated areas, called loading/unloading (L/U) areas, composed of one or more parking spots. In this paper the introduction of a booking system for the management of the L/U areas in a city center is studied as a way to eliminate, or at least substantially reduce, double parking. A booking management system and the related routing problem are presented. In this system, distributors book in sequence according to their preferences and routing constraints, but subject to the bookings that have already been placed. The solution provided by the booking system is discussed and compared with the current use of the L/U areas, where the distributors do not consider the availability of a parking spot and resort to double parking if none is available.

Suggested Citation

  • Mor, A. & Speranza, M.G. & Viegas, J.M., 2020. "Efficient loading and unloading operations via a booking system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    • Handle: RePEc:eee:transe:v:141:y:2020:i:c:s1366554520306918
    DOI: 10.1016/j.tre.2020.102040
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554520306918
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2020.102040?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Letnik, Tomislav & Farina, Alessandro & Mencinger, Matej & Lupi, Marino & Božičnik, Stane, 2018. "Dynamic management of loading bays for energy efficient urban freight deliveries," Energy, Elsevier, vol. 159(C), pages 916-928.
    2. Gilles Pesant & Michel Gendreau & Jean-Yves Potvin & Jean-Marc Rousseau, 1998. "An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows," Transportation Science, INFORMS, vol. 32(1), pages 12-29, February.
    3. Roberto Pinto & Alexandra Lagorio & Ruggero Golini, 2019. "The location and sizing of urban freight loading/unloading lay-by areas," International Journal of Production Research, Taylor & Francis Journals, vol. 57(1), pages 83-99, January.
    4. Roca-Riu, Mireia & Fernández, Elena & Estrada, Miquel, 2015. "Parking slot assignment for urban distribution: Models and formulations," Omega, Elsevier, vol. 57(PB), pages 157-175.
    5. Yang, Kaidi & Roca-Riu, Mireia & Menéndez, Mónica, 2019. "An auction-based approach for prebooked urban logistics facilities," Omega, Elsevier, vol. 89(C), pages 193-211.
    6. S. Lin & B. W. Kernighan, 1973. "An Effective Heuristic Algorithm for the Traveling-Salesman Problem," Operations Research, INFORMS, vol. 21(2), pages 498-516, April.
    7. Nourinejad, Mehdi & Wenneman, Adam & Habib, Khandker Nurul & Roorda, Matthew J., 2014. "Truck parking in urban areas: Application of choice modelling within traffic microsimulation," Transportation Research Part A: Policy and Practice, Elsevier, vol. 64(C), pages 54-64.
    8. Helsgaun, Keld, 2000. "An effective implementation of the Lin-Kernighan traveling salesman heuristic," European Journal of Operational Research, Elsevier, vol. 126(1), pages 106-130, October.
    9. Martin Savelsbergh & Tom Van Woensel, 2016. "50th Anniversary Invited Article—City Logistics: Challenges and Opportunities," Transportation Science, INFORMS, vol. 50(2), pages 579-590, May.
    10. Pesant, Gilles & Gendreau, Michel & Potvin, Jean-Yves & Rousseau, Jean-Marc, 1999. "On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 117(2), pages 253-263, September.
    11. Muñuzuri, Jesús & Cuberos, Manuel & Abaurrea, Fátima & Escudero, Alejandro, 2017. "Improving the design of urban loading zone systems," Journal of Transport Geography, Elsevier, vol. 59(C), pages 1-13.
    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. Legros, Benjamin & Fransoo, Jan C., 2024. "Admission and pricing optimization of on-street parking with delivery bays," European Journal of Operational Research, Elsevier, vol. 312(1), pages 138-149.

    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. Legros, Benjamin & Fransoo, Jan C., 2023. "Admission and pricing optimization of on-street parking with delivery bays," Other publications TiSEM 6d41ee5c-27dc-4d34-aff1-4, Tilburg University, School of Economics and Management.
    2. Legros, Benjamin & Fransoo, Jan C., 2024. "Admission and pricing optimization of on-street parking with delivery bays," European Journal of Operational Research, Elsevier, vol. 312(1), pages 138-149.
    3. Jorge Luiz dos Santos Junior & Leise Kelli de Oliveira, 2020. "Analysis of the Level of Service of Unloading Zones Using Diversity Measures in a Multiplex Network," Sustainability, MDPI, vol. 12(10), pages 1-16, May.
    4. Fransoo, Jan C. & Cedillo-Campos, M. Gastón & Gámez-Pérez, Karla M., 2022. "Estimating the benefits of dedicated unloading bays by field experimentation," Transportation Research Part A: Policy and Practice, Elsevier, vol. 160(C), pages 348-354.
    5. Fransoo, Jan C. & Cedillo-Campos, M. Gaston & Gamez-Perez, Karla M., 2022. "Estimating the benefits of dedicated unloading bays by field experimentation," Other publications TiSEM 2a1a802f-012c-4d11-93de-e, Tilburg University, School of Economics and Management.
    6. Filippo Focacci & Andrea Lodi & Michela Milano, 2002. "A Hybrid Exact Algorithm for the TSPTW," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 403-417, November.
    7. Anurag Agarwal, 2009. "Theoretical insights into the augmented-neural-network approach for combinatorial optimization," Annals of Operations Research, Springer, vol. 168(1), pages 101-117, April.
    8. Ghosh, Diptesh, 2016. "Exploring Lin Kernighan neighborhoods for the indexing problem," IIMA Working Papers WP2016-02-13, Indian Institute of Management Ahmedabad, Research and Publication Department.
    9. Abhishek, & Legros, Benjamin & Fransoo, Jan C., 2021. "Performance evaluation of stochastic systems with dedicated delivery bays and general on-street parking," Other publications TiSEM 09ed9572-d59c-4f28-a9c4-b, Tilburg University, School of Economics and Management.
    10. Ann M. Campbell & Barrett W. Thomas, 2008. "Probabilistic Traveling Salesman Problem with Deadlines," Transportation Science, INFORMS, vol. 42(1), pages 1-21, February.
    11. Majed G. Alharbi & Ahmed Stohy & Mohammed Elhenawy & Mahmoud Masoud & Hamiden Abd El-Wahed Khalifa, 2021. "Solving Traveling Salesman Problem with Time Windows Using Hybrid Pointer Networks with Time Features," Sustainability, MDPI, vol. 13(22), pages 1-12, November.
    12. Jiang, Zhongzhou & Liu, Jing & Wang, Shuai, 2016. "Traveling salesman problems with PageRank Distance on complex networks reveal community structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 463(C), pages 293-302.
    13. Clélia Lopez & Chuan-Lin Zhao & Stéphane Magniol & Nicolas Chiabaut & Ludovic Leclercq, 2019. "Microscopic Simulation of Cruising for Parking of Trucks as a Measure to Manage Freight Loading Zone," Sustainability, MDPI, vol. 11(5), pages 1-14, February.
    14. Snežana Tadić & Mladen Krstić & Milovan Kovač, 2023. "Assessment of city logistics initiative categories sustainability: case of Belgrade," Environment, Development and Sustainability: A Multidisciplinary Approach to the Theory and Practice of Sustainable Development, Springer, vol. 25(2), pages 1383-1419, February.
    15. Henke, Tino & Speranza, M. Grazia & Wäscher, Gerhard, 2015. "The multi-compartment vehicle routing problem with flexible compartment sizes," European Journal of Operational Research, Elsevier, vol. 246(3), pages 730-743.
    16. Lamb, John D., 2012. "Variable neighbourhood structures for cycle location problems," European Journal of Operational Research, Elsevier, vol. 223(1), pages 15-26.
    17. Nikolakopoulos, Athanassios & Sarimveis, Haralambos, 2007. "A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1911-1929, March.
    18. Escobar, John Willmer & Linfati, Rodrigo & Baldoquin, Maria G. & Toth, Paolo, 2014. "A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 344-356.
    19. Sara Ezquerro & José Luis Moura & Borja Alonso, 2020. "Illegal Use of Loading Bays and Its Impact on the Use of Public Space," Sustainability, MDPI, vol. 12(15), pages 1-16, July.
    20. Jeffrey W. Ohlmann & Barrett W. Thomas, 2007. "A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 80-90, February.

    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:eee:transe:v:141:y:2020:i:c:s1366554520306918. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.