A two-stage model for a day-ahead paratransit planning problem

Mathematical Methods of Operations Research

Volumn 69, Issue 2, 2009, Pages 323-341

  Cremers, Maria L A G ^a   Klein Haneveld, Willem K ^a   Van Der Vlerk, Maarten H ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

Genetic algorithm; Paratransit transport; Stochastic programming

Indexed keywords

GENETIC ALGORITHMS; RANDOM PROCESSES; STOCHASTIC PROGRAMMING;

COMPUTATIONAL RESULTS; DATA SETS; DEVELOPED MODELS; DYNAMIC PLANNING; GENETIC ALGORITHM APPROACHES; INTEGER RECOURSE; OPTIMIZATION PROBLEMS; PARATRANSIT TRANSPORT; PLANNING PROBLEMS; TWO STAGES; TWO-STAGE MODELS;

HIGHWAY SYSTEMS;

EID: 63049104826     PISSN: 14322994     EISSN: 14325217     Source Type: Journal    
DOI: 10.1007/s00186-008-0262-5     Document Type: Article

References (23)

1. A Attanasio JF Cordeau G Ghiani G Laporte 2004 Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem Parallel Comput 30 377 387
2. B Baker M Ayechew 2003 A genetic algorithm for the vehicle routing problem Comput Oper Res 30 5 787 800
3. Birge J, Louveaux F (1997) Introduction to stochastic programming. Springer, New York
4. Borndörfer R, Grötschel M, Klostermeier F, Küttner C (1997) Telebus Berlin: vehicle scheduling in a dial-a-ride system. ZIB Report 97-23
5. P Chu J Beasley 1997 A genetic algorithm for the generalized assignment problem Comput Oper Res 24 1 17 23
6. P Chu J Beasley 1998 A genetic algorithm for the multidimensional knapsack problem J Heurist 4 1 63 86
7. JF Cordeau G Laporte 2003 The dial-a-ride problem (DARP): variants, modeling issues and algorithms Q J Belgian French Ital Oper Res Soc 1 89 101
8. JF Cordeau G Laporte 2003 A tabu search heuristic for the static multi-vehicle dial-a-ride problem Transport Res Part B 37 6 579 594
9. M Dawande J Kalagnanam P Keskinocak P Ravi F Salman 2000 Approximation algorithnms for the multiple knapsack problem with assignment restrictions J Combin Optim 4 171 186
10. Desrosiers J, Dumas Y, Soumis F, Taillefer S, Villeneuve D (1991) An algorithm for mini-clustering in handicapped transport. Les Cahiers du GERAD, G-91-02, École des Hautes Études Commerciales, Montréal
11. Feltl H, Raidl G (2004) An improved hybrid genetic algorithm for the generalized assignment problem. In: Proceedings of the 2004 ACM symposium on applied computing, pp 990-995
12. B Gavish H Pirkul 1991 Algorithms for the multi-resource generalized assignment problem Manage Sci 37 6 695 713
13. Goldberg D (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading
14. Holland J (1975) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. University of Michigan Press
15. I Ioachim J Desrosiers Y Dumas M Solomon D Villeneuve 1995 A request clustering algorithm for door-to-door handicapped transportation Transport Sci 29 63 78
16. JJ Jaw A Odoni H Psaraftis N Wilson 1986 A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows Transport Res Part B 20 3 243 257
17. R Jørgensen J Larsen K Bergvinsdottir 2007 Solving the dial-a-ride problem using genetic algorithms J Oper Res Soc 58 1321 1331
18. Kall P, Mayer J (2005) Stochastic linear programming: models, theory, and computation. Kluwer, New York
19. O Madsen H Ravn J Rygaard 1995 A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives Ann Oper Res 60 193 208
20. J Mazzola S Wilcox 2001 Heuristics for the multi-resource generalized assignment problem Naval Res Logist 48 468 483
21. Reeves C (1993) Modern heuristic techniques for combinatorial problems. Blackwell, New York
22. Ruszczynski A, Shapiro A (eds) (2003) Stochastic programming, handbooks in operations research and management science, vol 10. North-Holland, Amsterdam
23. P Toth D Vigo 1997 Heuristic algorithms for the handicapped persons transportation problem Transport Sci 31 1 60 71