Hybrid adaptive predictive control for a dynamic pickup and delivery problem including traffic congestion

International Journal of Adaptive Control and Signal Processing

Volumn 22, Issue 2, 2008, Pages 103-123

  Cortés, Cristián E ^a   Núñez, Alfredo ^a   Sáez, Doris ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

Dynamic pickup and delivery problem; Fault detection and isolation; Predictive control; Traffic congestion

Indexed keywords

ADAPTIVE CONTROL SYSTEMS; FAULT DETECTION; PREDICTIVE CONTROL SYSTEMS;

DECISION OBJECTIVE FUNCTION; POTENTIAL REROUTING;

TRAFFIC CONGESTION;

EID: 41849103488     PISSN: 08906327     EISSN: 10991115     Source Type: Journal    
DOI: 10.1002/acs.1005     Document Type: Article

References (38)

1. Desrosiers J, Soumis F, Dumas Y. A dynamic programming solution of a large-scale single-vehicle dial-a-ride with time windows. American Journal of Mathematical and Management Sciences 1986; 6:301-325.
2. Savelsbergh M, Sol M. The general pickup and delivery problem. Transportation Science 1995; 29(1):17-29.
3. Psaraftis H. A dynamic programming solution to the single many-to-many immediate request dial-a-ride problem. Transportation Science 1980; 14(2): 130-154.
4. Psaraftis H. Dynamic vehicle routing problems. In Vehicle Routing Methods and Studies, Golden BL, Assad AA (eds), 1988; 223-248.
5. Gendreau M, Guertin F, Potvin J, Taillard E. Parallel Tabu search for real-time vehicle routing and dispatching. Transportation Science 1999; 33:381-390.
6. Kleywegt AJ, Papastavrou JD. The dynamic and stochastic Knapsack problem. Operations Research 1998; 46:17-35.
7. Madsen O, Raven H, Rygaard J. A heuristics algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Annals of Operations Research 1995; 60:193-208.
8. Jaw J, Odoni A, Psaraftis H, Wilson N. A heuristic algorithm for the multivehicle many-to-many advance-request dial-a-ride problem. Working Paper MITUMTA-82-3, MIT, Cambridge, 1986.
9. Dial R. Autonomous dial a ride transit-introductory overview. Transportation Research - Part C 1995; 3:261-275.
10. Bertsimas D, Van Ryzin G. A stochastic and dynamic vehicle routing problem in the Euclidean plane. Operations Research 1991; 39:601-615.
11. Bertsimas D, Howell LH. Further results on the probabilistic traveling salesman problem. European Journal of Operational Research 1993; 65:68-95.
12. Swihart MR, Papastavrou JD. A stochastic and dynamic model for the single-vehicle pick-up and delivery problem. European Journal of Operational Research 1999; 114:447-464.
13. Thomas BW, White III CC. Anticipatory Route selection. Transportation Science 2004; 38(4):473-487.
14. Kleywegt AJ, Papastavrou JD. The dynamic and stochastic Knapsack problem with random sized items. Operations Research 2001; 49(1):26-41.
15. Papastavrou JD, Rajagopalan S, Kleywegt AJ. The dynamic and stochastic Knapsack problem with deadlines. Management Science 1996; 42:1706-1718.
16. Larsen A. The dynamic vehicle routing problem. Ph.D. Thesis, Technical University of Denmark, 2000.
17. Ichoua S, Gendreau M, Potvin JY. Exploiting knowledge about future demands for real-time vehicle dispatching. Transportation Science 2006; 40(2):211-225.
18. Spivey M, Powell WB. The dynamic assignment problem. Transportation Science 2004; 38(4):399-419.
19. Powell WB. A comparative review of alternative algorithms for the dynamic vehicle allocation problem. In Vehicle Routing: Methods and Studies, Golden BL, Assad AA (eds). North-Holland: New York, 1988; 249-292.
20. Godfrey G, Powell WB. An adaptive dynamic programming algorithm for stochastic resource allocation problems I: single period travel times. Transportation Science 2002; 36:21-39.
21. Topaloglu H, Powell W. A distributed decision-making structure for dynamic resource allocation using non-linear functional approximations. Operations Research 2005; 53(2):281-297.
22. Cortés CE. High-coverage point-to-point transit (HCPPT): a new design concept and simulation-evaluation of operational schemes for future technological deployment. Ph.D. Dissertation, University of California at Irvine, U.S.A., 2003.
23. Cortés CE, Sáez D, Murcia F, Núñez A, Control Predictivo Híbrido para un sistema personalizado de transporte público puerta a puerta programado en tiempo real (in Spanish). Proceedings of the XII Chilean Conference in Transport Engineering, Valparaiso, Chile, October 2005; 375-388.
24. Sáez D, Cortés CE, Núñez A. Hybrid adaptive predictive control for the multi-vehicle dynamic pickup and delivery problem based on genetic algorithms and fuzzy clustering. Computers and Operations Research 2007, DOI: 10.1016/j.cor.2007.01.025.
25. Berman O, Simchi-Levi D. The traveler salesman location problem on stochastic networks. Transportation Science 1989; 23:54-57.
26. Kao E. A preference order dynamic problem for a stochastic traveling salesman problem. Operations Research 1978; 26:1033-1045.
27. Sniedovich M. Analysis of the preference order traveling salesman problem. Operations Research 1981; 29: 1234-1237.
28. Carraway RL, Morin TL, Moskowitz H. Generalized dynamic programming for stochastic combinatorial optimization. Operations Research 1989; 37:819-829.
29. Laporte G, Louveaux FV, Mercure H. The vehicle routing problem with stochastic travel times. Transportation Science 1992; 26:161-170.
30. Lambert V, Laporte G, Louveaux F. Designing collection routes through bank branches. Computers and Operations Research 1993;20:783-791.
31. Keyton A, Morton D. Stochastic vehicle routing with random travel times. Transportation Science 2003; 37(1): 69-82.
32. Hill A, Benton W. Modelling intra-city time-dependent travel speeds for vehicle scheduling problems. Journal of the Operation Research Society 1992; 43:343-351.
33. Malandraki C, Daskin MS. Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. Transportation Science 1992; 26:185-200.
34. Fleishmann B, Gietz M, Gnutzmann S. Time-varying travel times in vehicle routing. Transportation Science 2004; 38(2): 160-173.
35. Kim S, Lewis M, White C. Optimal vehicle routing with real time traffic information. IEEE Transactions on Intelligent Transportation Systems 2005; 6:178-188.
36. Capriglione D, Liguori C, Pietrosanto A. Analytical redundancy for sensor fault isolation and accommodation in public transportation vehicles. IEEE Transactions on Instrumentation and Measurement 2004; 53(4):993-999.
37. Aronson LD, van der Krogt RPJ, Zutt J. Automated transport planning using agents. Proceedings of the International Congress on Freight Transport Automation and Multimodality: Organisational and Technological Innoventions (FTAM'02), Delf, The Netherlands, May 2002. Available on http://pds.twi.tudelft.nl/~jonne/pubs.html.
38. Weinstein R. RFID: a technical overview and its application to the enterprise. IT Professional 2005; 7(3):27-33.