Aczel, Amir D., 1999: Complete Business Statistics, 4th edition, Irwin/McGraw-Hill.
Attanasio, Andrea et al., 2004: Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem,Parallel Computing 30 (2004) p. 377-387.
Baugh Jr., John W., Gopala Krishna Reddy Kakivaya, and John R. Stone., 1998:
Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing, Engineering Optimization, 30(2): 91-123.
Bergvinsdottir, Kristin Berg, 2004: The Genetic Algorithm for solving the Dial-a-Ride Problem, IMM/ Informatik og Matematisk Modellering, DTU Thesis-2004-37, Kgs. Lyngby DK.
Bergvinsdottir, Kristin Berg & Larsen, Jesper & Jørgensen, Rene Munk, 2004: Solving the Dial-a-Ride Problme using Genetic algorithms, IMM/ Informatik og Matematisk Modellering, DTU – bygning 321, 2800 Kgs. Lyngby DK.
Campbell, T. Colin, Ph.D. with Thomas M. Campbell II, 2005: The China Study, Benbella Books, Dallas, Texas.
Chan, Sook-yee Edna, 2004: Metaheuristics for solving the dial-a-ride problem, a dissertation submitted to the Graduate Faculty of North Carolina State University in partial fulfillment of the requirements for the Degree of Doctor of Philosophy, Operations Research, Raleigh.
Christiansen, Christian H., 2006: A practical application of the dynamic Dial-A-Ride problem, Department of Business Studies, Aarhus School of Business, Fuglesangs Allé 4, DK-8210 Aarhus V, Denmark.
Cordeau, J.F. and Laporte, G., 2003: A tabu search heuristic for the static multi-vehicle dial-a-ride problem, Transportation Research B, 37: 579-594.
Diana, Marco & Dessouky, Maged M., 2004: A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows, Transportation Research Part B 28 (2004) 539-557.
Ghiani, Gianpaolo & Guerriero, Francesca & Laporte, Gilbert & Musmanno, Roberto, 2003: Real-Time Vehicle Routing: Solution Concepts, Algorithms and Parallel Computing Strategies, European Journal of Operations Research 151. 2003.
Jørgensen, René Munk, 2002: Dial-a-Ride, Weber og Poulsen, DK-2800 Kongens Lyngby.
Madsen, Oli B.G. & Ravn, Hans F. & Rygaard Jens Moberg, 1995: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives, IMM, Institute of Mathematical Modelling, Building 321, The Technical University of Denmark, Annals of Operations Research 60(1995)193-208.
Mauri, G.R. et al., 2006: Multiobjective Model and Simulated Annealing Approach for a Dial-a-Ride Problem, Federal University of Espirito Santo - UFES
Alegre - ES – BRAZIL, Laboratory for Computing and Applied Mathematics - LAC
National Institute for Space Research (http://www.inpe.br/ingles/) – INPE Sao Jose dos Campos - SP – BRAZIL, INPE ePrint: sid.inpe.br/ePrint@80/2006/10.09.16.10 v1 2006-10-10.
Mitrovic-Minic, S. et al., 2004: Double-horizon based heuristics for dynamic pickup and delivery problem with time windows, Transportation Research Part B 38 (2004) 669-685.
More, Jeffrey H. et al., 2001: Decision Modeling With Microsoft Excel, sixth edition, Prentice Hall, New Jersey 07458 USA.
Psaraftis, Harilaos N., 1983: Analysis of an O(N*) heuristic for the single vehicle many-to-many euclidean dial-a-ride problem, TranspnR es: B Vol.1 7B.No. 2 pp. 133-145, 1983, Massachusetts Institue of Technology, Cambridge, MA 02139, U.S.A.
Winston, Wayne L. et al., 2003: Introduction to Mathematical Programming, Operations Research: Volume One, Thomson Brooks/Cole CA 93950 USA.
Forums
- Log in to post comments