Dynamic vehicle routing with anticipation in disaster relief
AbstractPickup and delivery problems (PDP), where locations may both receive and send goods, are an extension of the classical vehicle routing problem. This paper considers the application of a routing and scheduling problem for forwarding agencies handling less-than-truckload freight in disasters. The approach evaluates the benefits of dynamic optimization anticipating varying travel times (i.e., the availability of connections in this case) as well as unknown orders (i.e., the integration of demand regions on short-notice) in the specific environment of emergencies. The objective is to avoid delays and increase equipment utilization. We model a multi-stage mixed integer problem which is able to operate under variable demand and transport conditions.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Socio-Economic Planning Sciences.
Volume (Year): 46 (2012)
Issue (Month): 4 ()
Contact details of provider:
Web page: http://www.elsevier.com/locate/seps
Disaster planning; Disaster logistics; Vehicle routing; Pickup and delivery; Dynamic; Varying travel times; Discrete optimization; Disaster relief;
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Mete, Huseyin Onur & Zabinsky, Zelda B., 2010. "Stochastic optimization of medical supply location and distribution in disaster management," International Journal of Production Economics, Elsevier, vol. 126(1), pages 76-84, July.
- Ichoua, Soumia & Gendreau, Michel & Potvin, Jean-Yves, 2003. "Vehicle dispatching with time-dependent travel times," European Journal of Operational Research, Elsevier, vol. 144(2), pages 379-396, January.
- Thomas, Barrett W. & White III, Chelsea C., 2007. "The dynamic shortest path problem with anticipation," European Journal of Operational Research, Elsevier, vol. 176(2), pages 836-854, January.
- Nagy, Gabor & Salhi, Said, 2005. "Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries," European Journal of Operational Research, Elsevier, vol. 162(1), pages 126-141, April.
- Barbarosoglu, Gulay & Ozdamar, Linet & Cevik, Ahmet, 2002. "An interactive approach for hierarchical analysis of helicopter logistics in disaster relief operations," European Journal of Operational Research, Elsevier, vol. 140(1), pages 118-133, July.
- Haghani, Ali & Oh, Sei-Chang, 1996. "Formulation and solution of a multi-commodity, multi-modal network flow model for disaster relief operations," Transportation Research Part A: Policy and Practice, Elsevier, vol. 30(3), pages 231-250, May.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 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.