IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-319-05035-5_6.html
   My bibliography  Save this book chapter

Routing for Urgency Logistics

In: Models for Practical Routing Problems in Logistics

Author

Listed:
  • S. P. Anbuudayasankar

    (Amrita School of Engineering)

  • K. Ganesh

    (McKinsey Knowledge Center India)

  • Sanjay Mohapatra

    (Xavier Institute of Management)

Abstract

Bi-Objective Vehicle Routing Problem with Forced Backhauls (BVFB) can be stated as follows: A set of N nodes with deterministic demands (for delivery and pick-up services) have to be visited by a fleet of homogeneous vehicles where in all the vehicles should start and finish at the same node (depot). A set of pick-up nodes are forced to visit in a sequential manner and it is known a priori for the route planner. The reason for forcing the pickup node in sequential manner is considered because the supervisor in the first pickup node of the sequence will join the vehicle to supervise the forthcoming pickup nodes and he will be dropped off in the last pickup node in the sequence. This is primarily done because few organisations have only one supervisor to supervise his set of pickup nodes. So the pickup nodes are divided into sets based on the organisation and if a vehicle visits the first pickup node in the first set then it is mandatory to complete all the pickup nodes that belong to that set and is the same applicable for the remaining sets. Set of pick-up nodes is an input for the problem. Nevertheless the sequence of visiting those pick-up nodes is not an input and it is considered for routing optimisation. The variant includes the constraints to restrict the inclusion of delivery nodes until that particular set of backhaul nodes are served.

Suggested Citation

  • S. P. Anbuudayasankar & K. Ganesh & Sanjay Mohapatra, 2014. "Routing for Urgency Logistics," Springer Books, in: Models for Practical Routing Problems in Logistics, edition 127, chapter 0, pages 123-142, Springer.
    • Handle: RePEc:spr:sprchp:978-3-319-05035-5_6
    DOI: 10.1007/978-3-319-05035-5_6
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:sprchp:978-3-319-05035-5_6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.