Access the full text.
Sign up today, get DeepDyve free for 14 days.
L. Brunetta, M. Conforti, M. Fischetti (2000)
A polyhedral approach to an integer multicommodity flow problemDiscret. Appl. Math., 101
J. Orlin (1993)
A faster strongly polynomial minimum cost flow algorithm
A. Aggarwal, M. Oblak, R. Vemuganti (1995)
A heuristic solution procedure for multicommodity integer flowsComput. Oper. Res., 22
M. Fisher, B. Tang, Zhang Zheng (1995)
A Network Flow Based Heuristic for Bulk Pickup and Delivery RoutingTransp. Sci., 29
J. Gross, L. Phan (2000)
Implications for Earthquake Risk Reduction in the United States From the Kocaeli, Turkey, Earthquake of August 17, 1999 | NIST, 1193
M. Dror, P. Trudeau (1990)
Split delivery routingNaval Research Logistics, 37
M. Fisher (2004)
The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManag. Sci., 50
M. Fisher (1981)
The Lagrangean Relaxation Method for Solving Integer ProblemsManagement Science, 27
C. Barnhart, Y. Sheffi (1993)
A Network Based Primal-Dual Heuristic forMulti-Commodity Network Flow ProblemsTransportation Science, 27
Luisa Equi, G. Gallo, Silvia Marziale, A. Weintraub (1997)
A combined transportation and scheduling problemEuropean Journal of Operational Research, 97
M. Fisher (1995)
Handbooks in OR and MS, Vol. 8
M. Gendreau, F. Guertin, J. Potvin, É. Taillard (1999)
Parallel Tabu Search for Real-Time Vehicle Routing and DispatchingTransp. Sci., 33
B. Golden, A. Assad (1988)
VEHICLE ROUTING: METHODS AND STUDIES
S. Mathies, P. Mevert (1998)
A hybrid algorithm for solving network flow problems with side constraintsComput. Oper. Res., 25
F. Jiménez, J. Verdegay (1999)
Solving fuzzy solid transportation problems by an evolutionary algorithm based parametric approachEur. J. Oper. Res., 117
C. Ribeiro, F. Soumis (1991)
A Column Generation Approach to the Multiple-Depot Vehicle Scheduling ProblemOper. Res., 42
A. Kolen, A. Kan, Harry Trienekens (1987)
Vehicle Routing with Time WindowsOper. Res., 35
A. Ziliaskopoulos, Whitney Wardell (2000)
An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delaysEur. J. Oper. Res., 125
G. Laporte (1992)
The vehicle routing problem: An overview of exact and approximate algorithmsEuropean Journal of Operational Research, 59
M. Venkataramanan, J. Dinkel, John Mote (1989)
A surrogate and Lagrangian approach to constrained network problemsAnnals of Operations Research, 20
B. Awerbuch, F. Leighton (1993)
Multicommodity Flows: A Survey of Recent Research
M. Desrochers, J. Lenstra, M. Savelsbergh (1990)
A classification scheme for vehicle routing and scheduling problems, 8721
J. Kennington, M. Shalaby (1977)
An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow ProblemsManagement Science, 23
C. Barnhart, Y. Sheffi (1993)
A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow ProblemsTransp. Sci., 27
A. Frangioni (1997)
PhD Dissertation TD 5/97
C. Barnhart (1993)
Dual‐ascent methods for large‐scale multicommodity flow problemsNaval Research Logistics, 40
Patricio Rodríguez, M. Nussbaum, Rodrigo Baeza, Gerardo León, M. Sepúlveda, A. Cobián (1998)
Using global search heuristics for the capacity vehicle routing problemComput. Oper. Res., 25
M. Desrochers, Christopher Jones, J. Lenstra, M. Savelsbergh, L. Stougie (1999)
Towards a model and algorithm management system for vehicle routing and scheduling problemsDecis. Support Syst., 25
A. Rathi, R. Church, R. Solanki (1992)
ALLOCATING RESOURCES TO SUPPORT A MULTICOMMODITY FLOW WITH TIME WINDOWSThe Logistics and Transportation Review, 28
C. Barnhart (1993)
Dual Ascent Methods for Large-Scale Multi-Commodity Network Flow ProblemsNaval Research Logistics, 40
M. Held (1974)
Validation of Sub-Gradient OptimizationMathematical Programming, 6
L. Bodin (1990)
Twenty Years of Routing and SchedulingOper. Res., 38
M.A. Venkataramanan, J.J. Dinkel, J. Mote (1989)
A Surrogate and Lagrangean Approach to Constrained Network ProblemsAnnals of OR, 20
K. Jones, I. Lustig, J. Farvolden, Warrren Powell (1993)
Multicommodity network flows: The impact of formulation on decompositionMathematical Programming, 62
Logistics planning in emergency situations involves dispatching commodities (e.g., medical materials and personnel, specialised rescue equipment and rescue teams, food, etc.) to distribution centres in affected areas as soon as possible so that relief operations are accelerated. In this study, a planning model that is to be integrated into a natural disaster logistics Decision Support System is developed. The model addresses the dynamic time-dependent transportation problem that needs to be solved repetitively at given time intervals during ongoing aid delivery. The model regenerates plans incorporating new requests for aid materials, new supplies and transportation means that become available during the current planning time horizon. The plan indicates the optimal mixed pick up and delivery schedules for vehicles within the considered planning time horizon as well as the optimal quantities and types of loads picked up and delivered on these routes.
Annals of Operations Research – Springer Journals
Published: Oct 5, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.