A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem

European Journal of Operational Research

Volumn 175, Issue 3, 2006, Pages 1605-1615

  Coslovich, Luca ^a   Pesenti, Raffaele ^b   Ukovich, Walter ^a  

^a UNIVERSITY OF TRIESTE   (Italy)

^b UNIVERSITY OF PALERMO   (Italy)

Author keywords

Dial a ride; Dynamic vehicle routing; Insertion heuristics; Transportation

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; HEURISTIC METHODS; PERTURBATION TECHNIQUES; PROBLEM SOLVING; REAL TIME SYSTEMS;

DIAL-A-RIDE PROBLEM; DYNAMIC VEHICLE ROUTING; INSERTION HEURISTICS;

OPERATIONS RESEARCH;

EID: 33748922235     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.02.038     Document Type: Article

References (18)

1. G. Ambrosino, P. Sassoli, M. Boero, A. Iacometti, R. Pesenti, W. Ukovich, A project to implement a Demand Responsive Transport Service (DRTS). In: 8th IFAC/IFIP/IFORS Symposium on Transportation Systems, Chania (GR), 1997, pp. 1289-1294.
2. Ball M.O., Magnanti T.L., Monma C.L., and Nemhauser G.L. Handbooks in operations research and management science. Network Routing 8 (1995) 102-116
3. Dial R.B. Autonomous dial-a-ride transit introductory overview. Transportation Research C 3 (1995) 261-275
4. M. Gendreau, J.Y. Potvin, Dynamic vehicle routing and dispatching. In: T.G. Crainic, G. Laporte (Eds.), Fleet Management and Logistics, 1998, pp. 115-126.
5. Glover F. Tabu search: A tutorial. Interfaces 20 (1990) 64-74
6. Healy P., and Moll R. A new extension of local search applied to the dial-a-ride problem. European Journal of Operational Research 83 (1995) 83-104
7. Horn E.T. Fleet scheduling and dispatching for demand-responsive passenger services. Transportation Research C 10 (2002) 35-63
8. Hunsaker B., and Savelsbergh M. Efficient feasibility testing for dial-a-ride problems. Operations Research Letters 30 (2002) 169-173
9. Ichoua S., Gendreau M., and Potvin J.Y. Diversion issues in real-time vehicle dispatching. Transportation Science 34 (2000) 426-438
10. Jaw J., Odoni A.R., Psaraftis H.N., and Wilson N.H.M. A heuristic algorithm for the multi-vehicle advance-request dial-a-ride problem with time windows. Transportation Research B 20 (1986) 243-257
11. Madsen O.B.G., Ravn H.F., and Rygaard J.M. A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Annals of Operations Research 60 (1995) 193-208
12. Psaraftis H. A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science 14 (1980) 130-154
13. 2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem. Transportation Research B 17 (1983) 133-145
14. Renaud J., Boctor F.F., and Laporte G. Perturbation heuristics for the pickup and delivery traveling salesman problem. Computers & Operations Research 29 (2002) 1129-1141
15. Renaud J., Boctor F.F., and Ouenniche J. A heuristic for the pickup and delivery traveling salesman problem. Computers & Operations Research 27 (2000) 905-916
16. Sexton T.R., and Bodin L.D. Optimizing singlevehicle many-to-many operations with desired delivery times: I. Scheduling. Transportation Science 19 (1985) 378-410
17. Sexton T.R., and Bodin L.D. Optimizing single vehicle many-to-many operations with desired delivery times: II. Routing. Transportation Science 19 (1985) 411-435
18. Van der Bruggen L.J.J., Lenstra J.K., and Schuur P.C. Variable-depth search for the single-vehicle pickup and delivery problem with time windows. Transportation Science 27 (1993) 298-311