A methodology based on evolutionary algorithms to solve a dynamic pickup and delivery problem under a hybrid predictive control approach

Transportation Science

Volumn 49, Issue 2, 2015, Pages 239-253

  Muñoz Carpintero, Diego ^a   Sáez, Doris ^a   Cortés, Cristián E ^a   Núñez, Alfredo ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Dynamic pickup and delivery problem; Evolutionary algorithms; Predictive control

Indexed keywords

ALGORITHMS; ECONOMIC AND SOCIAL EFFECTS; GENETIC ALGORITHMS; INTEGER PROGRAMMING; MULTIOBJECTIVE OPTIMIZATION; OPTIMIZATION; PARTICLE SWARM OPTIMIZATION (PSO); PICKUPS; REPAIR;

COMPUTATIONAL EFFORT; MIXED INTEGER OPTIMIZATION; MULTI OBJECTIVE; OPERATIONAL CONSTRAINTS; PARAMETER-TUNING; PICKUP AND DELIVERY PROBLEMS; PREDICTIVE CONTROL; REAL TIME SOLUTION;

EVOLUTIONARY ALGORITHMS;

EID: 84929581123     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.2014.0569     Document Type: Article

References (40)

1. Ackley DH, Littman ML (1994) A case for Lamarckian evolution. Langton CG, ed. Artificial Life III (Addison-Wesley, Reading, MA), 3-10.
2. Bemporad A, Morari M (1999) Control of systems integrating logic, dynamics and constraints. Automatica 35:407-427.
3. Berbeglia G, Cordeau JF, Laporte G (2010) Dynamic pickup and delivery problems. Eur. J. Oper. Res. 202(1):8-15.
4. Bertsimas D, Van Ryzin G (1991) A stochastic and dynamic vehicle routing problem in the Euclidean plane. Oper. Res. 39(4): 601-615.
5. Bertsimas D, Van Ryzin G (1993a) Stochastic and dynamic vehicle routing problem in the Euclidean plane with multiple capacitated vehicles. Oper. Res. 41(1):60-76.
6. Bertsimas D, Van Ryzin G (1993b) Stochastic and dynamic vehicle routing with general demand and interarrival time distributions. Appl. Probability 25:947-978.
7. Cortés CE, Sáez D, Núñez A (2008) Hybrid adaptive predictive control for a dynamic pickup and delivery problem including traffic congestion. Internat. J. Adapt. Control Signal Processing 22(2):103-123.
8. Cortés CE, Sáez D, Núñez A, Muñoz-Carpintero D (2009) Hybrid adaptive predictive control for a dynamic pickup and delivery problem. Transportation Sci. 43(1):27-42.
9. Dial R (1995) Autonomous dial-a-ride transit-Introductory overview. Transportation Res. Part C 3:261-275.
10. Dréo J, Pétrowski A, Siarry P, Taillard E (2006) Metaheuristics for Hard Optimization Methods and Case Studies (Springer-Verlag, Berlin).
11. Eksioglu B, Volkan A, Reisman A (2009) The vehicle routing problem: A taxonomic review. Computers Indust. Engrg. 57(4): 1472-1483.
12. Gendreau M, Guertin F, Potvin J, Taillard E (1999) Parallel tabu search for real-time vehicle routing and dispatching. Transportation Sci. 33(4):381-390.
13. Haghani A, Jung S (2005) A dynamic vehicle routing problem with time-dependent travel times. Comput. Oper. Res. 32: 2959-2986.
14. Hegyi A, De Schutter B, Hellendoorn H (2005) Model predictive control for optimal coordination of ramp metering and variable speed limits. Transportation Res. Part C 13:185-209.
15. Hinton G, Nowlan S (1987) How learning can guide evolution. Complex Systems 1:495-502.
16. Jaw J, Odoni A, Psaraftis H, Wilson N (1986) A heuristic algorithm for the multivehicle many-to-many advance-request dial-a-ride problem. Transportation Res. Part B 20:243-257.
17. Jih W-R, Hsu JYJ (1999) Dynamic vehicle routing using hybrid genetic algorithms. Proc. 1999 IEEE Internat. Conf. Robotics and Automation (IEEE, Detroit), 453-458.
18. Karer G, Mušič G, Škrjanc I, Zupančič B (2007a) Hybrid fuzzy modeling for model predictive control. J. Intelligent Robotic Systems 50:297-319.
19. Karer G, Škrjanc I, Mušič G, Zupančič B (2007b) Hybrid fuzzy model-based predictive control of temperature in a batch reactor. Comput. Chemical Engrg. 31:1552-1564.
20. Kennedy J, Eberhart R (2001) Swarm Intelligence (Morgan Kaufmann Publishers, Burlington, MA).
21. Kleywegt A, Papastavrou J (1998) The dynamic and stochastic knapsack problem. Oper. Res. 46(1):17-35.
22. Larsen A (2000) The dynamic vehicle routing problem. Unpublished doctoral thesis, Technical University of Denmark, Lyngby, Denmark.
23. Madsen O, Raven H, Rygaard J (1995) A heuristics algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Ann. Oper. Res. 60:193-208.
24. Man K, Tang K, Kwong S (1998) Genetic Algorithms, Concepts and Designs (Springer-Verlag, Berlin).
25. Mitrovic-Minic S, Laporte G (2004) Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Res. Part B 38:635-655.
26. Mitrovic-Minic S, Krishnamurti R, Laporte G (2004) Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transportation Res. Part B 38:669-685.
27. Montemanni R, Gambardella L, Rizzoli A, Donati A (2005) Ant colony system for a dynamic vehicle routing problem. J. Combinatorial Optim. 10(4):327-343.
28. Nedjah N, Macedo-Mourelle L (2006) Swarm Intelligent Systems (Springer-Verlag, Berlin).
29. Núñez A, Sáez D, Oblak S, Škrjanc I (2009) Fuzzy-model-based hybrid predictive control. ISA Transactions 48(1):24-31.
30. Osman M, Abo-Sinna M, Mousa A (2005) An effective genetic algorithm approach to multiobjective routing problems (MORPs). Appl. Math. Computation 163:769-781.
31. Psaraftis H (1980) A dynamic programming solution to the single many-to-many immediate request dial-a-ride problem. Transportation Sci. 14(2):130-154.
32. Psaraftis H (1988) Dynamic vehicle routing problems. Golden BL, Assad AA, eds. Vehicle Routing Methods and Studies (North Holland, Amsterdam), 223-248.
33. Sáez D, Cortés CE, Núñez A (2008) Hybrid adaptive predictive control for the multi-vehicle dynamic pickup and delivery problem based on genetic algorithms and fuzzy clustering. Comput. Oper. Res. 35:3412-3438.
34. Skrlec D, Filipec M, Krajcar S (1997) A heuristic modification of genetic algorithm used for solving the single depot capacitated vehicle routing problem. Proc. Intelligent Inform. Systems (IEEE, Los Alamitos, CA), 184-188.
35. Swihart M, Papastavrou J (1999) A stochastic and dynamic model for the single-vehicle pick-up and delivery problem. Eur. J. Oper. Res. 114:447-464.
36. Tarantilis C (2005) Solving the vehicle routing problem with adaptive memory programming methodology. Comput. Oper. Res. 32:2309-2327.
37. Thomas B, White C III (2004) Anticipatory route selection. Transportation Sci. 38(4):473-487.
38. Toth P, Vigo D (2003) The granular tabu search and its application to the vehicle-routing problem. INFORMS J. Comput. 15(4): 333-346.
39. Xiang Z, Chu C, Chen H (2008) The study of a dynamic dial a ride problem under time-dependent and stochastic environments. Eur. J. Oper. Res. 185:534-551.
40. Zhu Q, Qian L, Li Y, Zhu S (2006) An improved particle swarm optimization algorithm for vehicle routing problem with time windows. Proc. IEEE Congress on Evolutionary Comput. Internat. (IEEE, Vancouver), 1386-1390.