Hybrid Adaptive Predictive Control for a Dynamic Pickup and Delivery Problem

References

• Bemporad A., Morari M. Control of systems integrating logic, dynamics and constraints. Automatica (1999) 35:407–427Crossref, Google Scholar
• Bemporad A., Borrelli F., Morari M. Model predictive control based on linear programing. The explicit solution. IEEE Trans. Automatic Control (2002) 47(12):1974–1985Crossref, Google Scholar
• Bertsimas D., van Ryzin G. A stochastic and dynamic vehicle routing problem in the Euclidean plane. Oper. Res. (1991) 39:601–615Link, Google Scholar
• Bertsimas D., van Ryzin G. Stochastic and dynamic vehicle routing problem in the Euclidean plane with multiple capacitated vehicles. Oper. Res. (1993a) 41:60–76Link, Google Scholar
• Bertsimas D., van Ryzin G. Stochastic and dynamic vehicle routing with general demand and interarrival time distributions. Appl. Probab. (1993b) 25:947–978Crossref, Google Scholar
• Coelho J. P., de Moura Oliveira P. B., Cunha J. B. Greenhouse air temperature predictive control using the particle swarm optimisation algorithm. Comput. Electronics in Agriculture (2005) 49:330–344Crossref, Google Scholar
• Cortés C. E., Jayakrishnan R. Analytical modeling of stochastic rerouting delays for dynamic multi-vehicle pickup and delivery problems. The Fifth Triennial Symposium on Transportation Analysis, TRISTAN V (2004) 13–18 JuneLe Gosier, GuadalupeGoogle Scholar
• Desrosiers J., Soumis F., Dumas Y. A dynamic programming solution of a large-scale single-vehicle dial-a-ride with time windows. Amer. J. Math. Management Sci. (1986) 6:301–325Crossref, Google Scholar
• Dial R. Autonomous dial a ride transit—Introductory overview. Transportation Res.—Part C (1995) 3:261–275Crossref, Google Scholar
• Dréo J., Pétrowski A., Siarry P., Taillard E.Metaheuristics for Hard Optimization Methods and Case Studies (2006) (Springer-Verlag, Berlin) Google Scholar
• Figliozzi M., Mahmassani H., Jaillet P. Pricing in dynamic vehicle routing problems. Transportation Sci. (2007) 41(3):302–318Link, Google Scholar
• Gendreau M., Guertin F., Potvin J., Taillard E. Parallel tabu search for real-time vehicle routing and dispatching. Transportation Sci. (1999) 33:381–390Link, Google Scholar
• George A., Powell W. Adaptive stepsizes for recursive estimation with applications in approximate dynamic programming. (2005) . http://www.castlelab.princeton.edu/Google Scholar
• Godfrey G., Powell W. B. An adaptive dynamic programming algorithm for stochastic resource allocation problems I: Single period travel times. Transportation Sci. (2002) 36:21–39Link, Google Scholar
• Haghani A., Jung S. A dynamic vehicle routing problem with time-dependent travel times. Comput. Oper. Res. (2005) 32:2959–2986Crossref, Google Scholar
• Ichoua S., Gendreau M., Potvin J. Y. Exploiting knowledge about future demands for real-time vehicle dispatching. Transportation Sci. (2006) 40(2):211–225Link, Google Scholar
• Jaw J., Odoni A., Psaraftis H., Wilson N. A heuristic algorithm for the multivehicle many-to-many advance-request dial-a-ride problem. Transportation Res. B: Methodological (1986) 20(3):243–257Crossref, Google Scholar
• Jih W., Yung-Jen J. Dynamic vehicle routing using hybrid genetic algorithms. Proc. IEEE Internat. Conf. Robotics & Automation (1999) MayDetroit, MI:453–458Google Scholar
• Kennedy J., Eberhart R.Swarm Intelligence (2001) (Morgan Kaufmann Publishers, San Francisco) Google Scholar
• Larsen A. The dynamic vehicle routing problem. (2000) . Ph.D. thesis, Technical University of Denmark, DenmarkGoogle Scholar
• Madsen O., Raven H., Rygaard J. A Heuristics algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Ann. Oper. Res. (1995) 60:193–208Crossref, Google Scholar
• Malandraki C., Daskin M. S. Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms. Transportation Sci. (1992) 26:185–200Link, Google Scholar
• Montemanni R., Gambardella L. M., Rizzoli A. E., Donati A. Ant colony system for a dynamic vehicle routing problem. J. Combin. Optim. (2005) 10(4):327–343Crossref, Google Scholar
• Osman M., Abo-Sinna M., Mousa A. An effective genetic algorithm approach to multiobjective routing problems (MORPs). Appl. Math. Comput. (2005) 163:769–781Crossref, Google Scholar
• Powell W. B., Golden B. L., Assad A. A. A comparative review of alternative algorithms for the dynamic vehicle allocation problem. Vehicle Routing Methods and Studies (1988) (North-Holland, Amsterdam) Google Scholar
• Powell W. B., Jaillet P., Odoni A., Ball M., Magnanti T., Monma C., Nemhauser G. Stochastic and dynamic networks and routing. Network Routing. A Handbook in Operations Research and Management Science (1995) 8(North-Holland, Amsterdam) 141–296Google Scholar
• Psaraftis H. A dynamic programming solution to the single many-to-many immediate request dial-a-ride problem. Transportation Sci. (1980) 14(2):130–154Link, Google Scholar
• Psaraftis H., Golden B. L., Assad A. A. Dynamic vehicle routing problems. Vehicle Routing Methods and Studies (1988) (North-Holland, Amsterdam) 223–248Google Scholar
• Savelsbergh M., Sol M. The general pickup and delivery problem. Transportation Sci. (1995) 29(1):17–29Link, Google Scholar
• Skrlec D., Filipec M., Krajcar S. A heuristic modification of genetic algorithm used for solving the single depot capacitated vehicle routing problem. Proc. Intelligent Inform. Systems, IIS '97 (1997) (IEEE, Washington, D.C.) 184–188Crossref, Google Scholar
• Spivey M., Powell W. B. The dynamic assignment problem. Transportation Sci. (2004) 38(4):399–419Link, Google Scholar
• Swihart M. R., Papastavrou J. D. A stochastic and dynamic model for the single-vehicle pick-up and delivery problem. Eur. J. Oper. Res. (1999) 114:447–464Crossref, Google Scholar
• Tarantilis C. Solving the vehicle routing problem with adaptive memory programming methodology. Comput. Oper. Res. (2005) 32:2309–2327Crossref, Google Scholar
• Thomas B., White C. Anticipatory route selection. Transportation Sci. (2004) 38(4):473–487Link, Google Scholar
• Tighe A., Smith F., Lyons G. Priority based solver for a real-time dynamic vehicle routing. IEEE Internat. Conf. Systems, Man and Cybernetics (2004) (IEEE)6237–6242Crossref, Google Scholar
• Topaloglu H., Powell W. A distributed decision-making structure for dynamic resource allocation using non linear functional approximations. Oper. Res. (2005) 53(2):281–297Link, Google Scholar
• Topaloglu H., Powell W. Incorporating pricing decisions into the stochastic dynamic fleet management problem. Transportation Sci. (2007) 41(3):281–301Link, Google Scholar
• Toth P., Vigo D. The granular tabu search and its application to the vehicle-routing problem. INFORMS J. Comput. (2003) 15(4):0333–0346Link, Google Scholar
• Wang X., Xiao J. PSO-based model predictive control for nonlinear processes. Lecture Notes in Computer Science (2005) 3611(Springer-Verlag, Berlin) 196–203Google Scholar
• Wilson N., Colvin N. Computer control of Rochester dial-a-ride system. (1977) . Report R77-31, Department of Civil Engineering, M.I.T., Cambridge, MAGoogle Scholar
• Wilson N., Weissberg H. Advanced dial-a-ride algorithms research project: Final report. (1976) . Report R76-20, Department of Civil Engineering, M.I.T., Cambridge, MAGoogle Scholar
• Zhu Q., Qian L., Li Y., Zhu S. An improved particle swarm optimization algorithm for vehicle routing problem with time windows. (2006) IEEE Congress on Evolutionary ComputationJuly 16–21VancouverGoogle Scholar