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

An exact solution approach for vehicle routing and scheduling problems with soft time windows

Author

Listed:
  • Qureshi, A.G.
  • Taniguchi, E.
  • Yamada, T.

Abstract

A new column generation based exact optimization approach for the vehicle routing and scheduling problem with semi soft time windows (VRPSSTW) is presented. Elementary shortest path problem with resource constraints and late arrival penalties is solved as a subproblem, which rises from the Dantzig-Wolfe decomposition method. Exact solutions of VRPSSTW and hard time windows variant are compared on Solomon's benchmark instances as well as on an instance based on Tokyo road network. It was found that the VRPSSTW solution results in fewer routes thus overall costs are reduced and late arrival penalties contribute only a small fraction to total cost.

Suggested Citation

  • Qureshi, A.G. & Taniguchi, E. & Yamada, T., 2009. "An exact solution approach for vehicle routing and scheduling problems with soft time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(6), pages 960-977, November.
  • Handle: RePEc:eee:transe:v:45:y:2009:i:6:p:960-977
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554509000428
    Download Restriction: Full text for ScienceDirect subscribers only

    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. Bhusiri, Narath & Qureshi, Ali Gul & Taniguchi, Eiichi, 2014. "The trade-off between fixed vehicle costs and time-dependent arrival penalties in a routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 1-22.
    2. Ponboon, Sattrawut & Qureshi, Ali Gul & Taniguchi, Eiichi, 2016. "Branch-and-price algorithm for the location-routing problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 86(C), pages 1-19.
    3. repec:eee:transb:v:99:y:2017:i:c:p:62-82 is not listed on IDEAS
    4. repec:eee:transe:v:104:y:2017:i:c:p:165-188 is not listed on IDEAS
    5. Holguín-Veras, José & Amaya Leal, Johanna & Seruya, Barbara B., 2017. "Urban freight policymaking: The role of qualitative and quantitative research," Transport Policy, Elsevier, vol. 56(C), pages 75-85.
    6. Tang, Jiafu & Yu, Yang & Li, Jia, 2015. "An exact algorithm for the multi-trip vehicle routing and scheduling problem of pickup and delivery of customers to the airport," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 73(C), pages 114-132.
    7. Lau, Kwok Hung, 2013. "Measuring distribution efficiency of a retail network through data envelopment analysis," International Journal of Production Economics, Elsevier, vol. 146(2), pages 598-611.
    8. N. Norouzi & R. Tavakkoli-Moghaddam & M. Ghazanfari & M. Alinaghian & A. Salamatbakhsh, 2012. "A New Multi-objective Competitive Open Vehicle Routing Problem Solved by Particle Swarm Optimization," Networks and Spatial Economics, Springer, vol. 12(4), pages 609-633, December.
    9. repec:kap:netspa:v:17:y:2017:i:4:d:10.1007_s11067-017-9364-z is not listed on IDEAS

    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:45:y:2009:i:6:p:960-977. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.