Ant colony optimization for disaster relief operations

Belenguer, 2000, A lower bound for the split delivery vehicle routing problem, Operations Research, 48, 801, 10.1287/opre.48.5.801.12407

Bell, 2004, Ant colony optimization techniques for the vehicle routing problem, Advanced Engineering Informatics, 18, 41, 10.1016/j.aei.2004.07.001

Bent, 2006, A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows, Computers and Operations Research, 33, 875, 10.1016/j.cor.2004.08.001

Bullnheimer, 1999, An improved ant system for the vehicle routing problem, Annals of Operations Research, 89, 319, 10.1023/A:1018940026670

Castro, 2003, Solving difficult multicommodity problems with a specialized interior-point algorithm, Annals of Operations Research, 124, 35, 10.1023/B:ANOR.0000004761.99649.a5

Cherkassky, 1997, On implementing the push-relabel method for the maximum flow problem, Algorithmica, 19, 390, 10.1007/PL00009180

Cordeau, 2003, A tabu search heuristic for the static multi-vehicle dial-a-ride problem, Transportation Research, 37, 579, 10.1016/S0191-2615(02)00045-0

Deif, I., Bodin, L., 1984. Extension of clarke and wright algorithm for solving the vehicle routing problem with backhauling. In: Kidder, A. (Ed.) Proceedings of the Babson Conference on Software Uses in Transportation and Logistics Management, Babson Park, 75–96.

Diana, 2004, A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows, Transportation Research, 38, 539, 10.1016/j.trb.2003.07.001

Dorigo, 2005, Ant colony optimization theory: A survey, Theoretical Computer Science, 344, 243, 10.1016/j.tcs.2005.05.020

Dorigo, 2002, The ant colony optimization metaheuristic: Algorithms, applications and advances

Dror, 1989, Savings by split delivery routing, Transportation Science, 23, 141, 10.1287/trsc.23.2.141

Frizzell, 1995, The split delivery vehicle scheduling problem with time windows and grid network distances, Computers and Operational Research, 22, 655, 10.1016/0305-0548(94)00040-F

Gendreau, 1998, Dynamic vehicle routing and dispatching, 115

Gendreau, 1999, Heuristics for the traveling salesman problem with pickup and delivery, Computers and Operations Research, 26, 699, 10.1016/S0305-0548(98)00085-9

Gendreau, 1999, Parallel tabu search for real-time vehicle routing and dispatching, Transportation Science, 33, 381, 10.1287/trsc.33.4.381

Goetschalckx, 1989, The vehicle routing problem with backhauls, European Journal of Operational Research, 42, 39, 10.1016/0377-2217(89)90057-X

Golden, B.L., Baker, E.K., Alfaro, J.L., Schaffer, J.R, 1985. The vehicle routing problem with backhauling: two approaches. In: Proceedings of the Twenty-First Annual Meeting of the S.E. TIMS, Myrtle Beach, SC, USA.

Haghani, 1996, Formulation and solution of a multi-commodity, multi-modal network flow model for disaster relief operations, Transportation Research, 30, 231

Hart, 1996, The modeling and solution of a class of dial-a-ride problems using simulated annealing, Control and Cybernetics, 25, 131

Healy, 1995, A new extension of local search applied to the dial-a-ride problem, European Journal of Operational Research, 83, 83, 10.1016/0377-2217(93)E0292-6

Ho, 2004, A tabu search heuristic for the vehicle routing problem with time windows and split deliveries, Computers and Operations Research, 31, 1947, 10.1016/S0305-0548(03)00155-2

Ioachim, 1995, A request clustering algorithm for door-to-door handicapped transportation, Transportation Science, 29, 63, 10.1287/trsc.29.1.63

Kontoravdis, 1995, A GRASP for the vehicle routing problem with time windows, ORSA Journal on Computing, 7, 10, 10.1287/ijoc.7.1.10

Lu, 2004, An exact algorithm for the multiple vehicle pickup and delivery problem, Transportation Science, 38, 503, 10.1287/trsc.1030.0040

Madsen, 1995, A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives, Annals of Operations Research, 60, 193, 10.1007/BF02031946

Maniezzo, 1999, Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem, INFORMS Journal on Computing, 11, 358, 10.1287/ijoc.11.4.358

Merkle, 2000, Ant colony optimization for resource-constrained project scheduling, 893

Min, 1989, The multiple vehicle routing problem with simultaneous delivery and pickup points, International Journal of Management Science, 3, 1

Mullaseril, 1997, Split delivery routing heuristics in livestock feed distribution, Journal of the Operational Research Society, 48, 107, 10.1057/palgrave.jors.2600338

Nagy, 2005, Heuristic algorithms for single and multi-depot vehicle routing problems with pickups and deliveries, European Journal of Operational Research, 162, 126, 10.1016/j.ejor.2002.11.003

Osman, 2002, A reactive tabu search metaheuristic for the vehicle routing problem with backhauls, Journal of Scheduling, 5, 263, 10.1002/jos.122

Özdamar, 2004, Emergency logistics planning in natural disasters, Annals of Operations Research, 129, 217, 10.1023/B:ANOR.0000030690.27939.39

Ropke, 2006, A unified heuristic for a large class of vehicle routing problems with backhauls, European Journal of Operational Research, 171, 750, 10.1016/j.ejor.2004.09.004

Salhi, 1999, A cluster insertion heuristic for single and multi depot vehicle routing problem with backhauling, Journal of the Operational Research Society, 50, 1034, 10.1057/palgrave.jors.2600808

Savelsbergh, 1995, The general pickup and delivery problem, Transportation Science, 29, 17, 10.1287/trsc.29.1.17

Savelsbergh, 1998, Drive: dynamic routing of independent vehicles, Operations Research, 46, 474, 10.1287/opre.46.4.474

Toth, 1997, An exact algorithm for the vehicle routing problem with backhauls, Transportation Science, 31, 372, 10.1287/trsc.31.4.372

Yano, 1987, Vehicle routing at quality stores, Interfaces, 17, 52, 10.1287/inte.17.2.52

Yi, 2007, A dynamic logistics coordination model for evacuation and support in disaster response activities, European Journal of Operational Research, 179, 1177, 10.1016/j.ejor.2005.03.077