IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v27y2010i03ns0217595910002715.html
   My bibliography  Save this article

Efficient Neighborhood Search For The Probabilistic Multi-Vehicle Pickup And Delivery Problem

Author

Listed:
  • PATRIZIA BERALDI

    (Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria, 87036 Arcavacata di Rende (CS), Italy)

  • GIANPAOLO GHIANI

    (Dipartimento di Ingegneria dell'Innovazione, Università del Salento, 73100 Lecce, Italy)

  • ROBERTO MUSMANNO

    (Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria, 87036 Arcavacata di Rende (CS), Italy)

  • FRANCESCA VOCATURO

    (Dipartimento di Economia e Statistica, Università della Calabria, 87036 Arcavacata di Rende (CS), Italy)

Abstract

This paper deals with the probabilistic multi-vehicle pickup and delivery problem. We develop an efficient neighborhood evaluation procedure which allows to reduce the computational complexity by two orders of magnitude with respect to a straightforward approach. The numerical experiments indicate that, if incorporated in a local search strategy, our neighborhood evaluation technique, provides very good results in terms of computation time reduction and equity of the workload distribution among the available vehicles.

Suggested Citation

  • Patrizia Beraldi & Gianpaolo Ghiani & Roberto Musmanno & Francesca Vocaturo, 2010. "Efficient Neighborhood Search For The Probabilistic Multi-Vehicle Pickup And Delivery Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 27(03), pages 301-314.
    • Handle: RePEc:wsi:apjorx:v:27:y:2010:i:03:n:s0217595910002715
    DOI: 10.1142/S0217595910002715
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595910002715
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595910002715?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.

    Citations

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


    Cited by:

    1. Karsu, Özlem & Morton, Alec, 2015. "Inequity averse optimization in operational research," European Journal of Operational Research, Elsevier, vol. 245(2), pages 343-359.
    2. Maskooki, Alaleh & Kallio, Markku, 2023. "A bi-criteria moving-target travelling salesman problem under uncertainty," European Journal of Operational Research, Elsevier, vol. 309(1), pages 271-285.
    3. Benavent, Enrique & Corberán, Ángel & Laganà, Demetrio & Vocaturo, Francesca, 2023. "A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs," European Journal of Operational Research, Elsevier, vol. 307(1), pages 64-81.
    4. Karels, Vincent C.G. & Rei, Walter & Veelenturf, Lucas P. & Van Woensel, Tom, 2024. "A vehicle routing problem with multiple service agreements," European Journal of Operational Research, Elsevier, vol. 313(1), pages 129-145.
    5. Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2018. "The stochastic vehicle routing problem, a literature review, part I: models," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(3), pages 193-221, September.
    6. Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2017. "The stochastic vehicle routing problem, a literature review, Part II: solution methods," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 349-388, December.

    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:wsi:apjorx:v:27:y:2010:i:03:n:s0217595910002715. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.