IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/697981.html
   My bibliography  Save this article

Single-Commodity Vehicle Routing Problem with Pickup and Delivery Service

Author

Listed:
  • Goran Martinovic
  • Ivan Aleksi
  • Alfonzo Baumgartner

Abstract

We present a novel variation of the vehicle routing problem (VRP). Single commodity cargo with pickup and delivery service is considered. Customers are labeled as either cargo sink or cargo source, depending on their pickup or delivery demand. This problem is called a single commodity vehicle routing problem with pickup and delivery service (1-VRPPD). 1-VRPPD deals with multiple vehicles and is the same as the single-commodity traveling salesman problem (1-PDTSP) when the number of vehicles is equal to 1. Since 1-VRPPD specializes VRP, it is ð ’© ð ’« hard in the strong sense. Iterative modified simulated annealing (IMSA) is presented along with greedy random-based initial solution algorithm. IMSA provides a good approximation to the global optimum in a large search space. Experiment is done for the instances with different number of customers and their demands. With respect to average values of IMSA execution times, proposed method is appropriate for practical applications.

Suggested Citation

  • Goran Martinovic & Ivan Aleksi & Alfonzo Baumgartner, 2008. "Single-Commodity Vehicle Routing Problem with Pickup and Delivery Service," Mathematical Problems in Engineering, Hindawi, vol. 2008, pages 1-17, March.
    • Handle: RePEc:hin:jnlmpe:697981
    DOI: 10.1155/2008/697981
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2008/697981.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2008/697981.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2008/697981?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:697981. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.