Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJANSSENS, Gerrit-
dc.contributor.authorSoonpracha, Kusuma-
dc.contributor.authorManisri, Tharinee-
dc.contributor.authorMungwattana, Anan-
dc.identifier.citationVasant, Pandian (Ed.). Handbook of Research on Artificial Intelligence Techniques and Algorithms: Volume II, p. 655-678-
dc.description.abstractThe vehicle routing is a difficult combinatorial optimization problem which has attracted many researchers to apply meta-heuristics to find approximate solutions. In the case of time windows within which goods have to picked-up or delivered it is even more difficult to find good solutions. Of course, congestion makes it hard for planners to find good routes for delivery or pick-up because travel times between customers, or between a depot and a customer are uncertain. In this chapter, the problem is handled by assigning a range of possible travel times between customers to represent the uncertainty. From these ranges, scenarios are built to find near-optimal solutions. But our main goal is that a solution is found which is robust, which means it performs ‘well’ in even bad scenarios. Next to our theoretical development, our experiments show that these robust results can be obtained in a computationally reasonable time, which means that the concept and its computer implementation can be used by practitioners, who are confronted with this type of uncertainty. Most of the applications appear in commercial routing, but also applications in a social environment exist. An earthquake or a flood might lead to road disruptions. Higher traffic delays appear either due to a lower than expected speed on flooded roads, or due to time spent on finding alternative routes in case no throughway is available. This type of routing includes evacuation of wounded or diseased victims or delivery of food and medical supplies. This social type of routing is hardly studied in literature but makes up the topic of this chapter. The 2011 flooding in Thailand has been the major inspiration for this work.-
dc.publisherIGI Global-
dc.relation.ispartofseriesAdvances in Computational Intelligence and Robotics (ACIR) Book Series-
dc.subject.othervehicle routing problem; time windows; uncertainty; robust solution methods-
dc.titleRobust vehicle routing solutions to manage time windows in the case of uncertain travel times-
dc.typeBook Section-
local.bibliographicCitation.authorsVasant, Pandian-
local.publisher.placeHershey, Pennsylvania-
dc.relation.referencesBangkok Post, 2011. Ayutthaya left in chaos, s.l.: s.n. Ben-Tal A., L. El Ghaoui & A. Nemirovski (2009). Robust optimization.:Princeton University Press. Bertsimas D. (1992). A vehicle routing problem with stochastic demand. Operations Research, 40(3):574-585. Bertsimas D. & D. Simchi-Levi (1996). A new generation of vehicle routing research: robust algorithms, addressing uncertainty. Operations Research, 44(2):286-304. Bielli M., A. Bielli & R. Rossi (2011). Trends in models and algorithms for fleet management. Procedia Social and Behavioral Sciences, 20:4-18. Braysi O. & M. Gendreau (2005). The vehicle routing problem with time windows, part 2: metaheuristics. Journal of Transportation Science, 39(1):119-139. Caris A. & G.K. Janssens (2009). A local search heuristic for the pre- and end-haulage of intermodal container terminals. Computers & Operations Research, 36(10),:2763-2772. Caris A. & G.K. Janssens (2013). Container drayage operations at an intermodal terminal: a deterministic annealing approach. In: W. Wang and G. Wets (eds.), Computational Intelligence for Transport and Mobility, Atlantis Computational Intelligence Series vol. 8, pp. 57-70. Chang M., Y. Tseng & J. Chen (2007). A scenario planning approach for flood emergency logistics preparation problem under uncertainty. Transportation Research Part E, 43(6):737-754. Christofides N., Mingozzi & P. Toth (1981a). State space relaxation procedures for the computation of bounds to routing problems. Networks, 11:145-164. Christofides N., Mingozzi & P. Toth (1981b). Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Mathematical Programming, 20(3):255-282. Christofides N. (1985). Vehicle Routing. In: Lawler E.L et al. (1985). Cordeau J.F., M. Gendreau, G. Laporte, J.-Y. Potvin & F. Semet (2002). A guide to vehicle routing heuristics. Journal of the Operational Research Society, 53(5):512-522. Cordeau J.F., G. Laporte, M. Savelsbergh & D. Vigo (2007). Vehicle Routing. In: Barnhart, C., Laporte, G. (eds): Transportation. Handbooks in Operations Research and Management Science 14, Elsevier, Amsterdam, pp.367-428. Desrosiers J., F. Soumis & M. Desrochers (1984). Routing time windows by column generation. Networks, 14:545-565. El Ghaoui L. (2003). Robust optimization and applications. [Online presentation] Available at: Gendreau M., G. Laporte & R. Séguin (1995). An exact algorithm for the vehicle routing problem with stochastic customers and demands. Transportation Science, 29(2):143-155. Glover F. (1989). Tabu Search-Part I. ORSA Journal on Computing, 1:190-206. Glover F. (1990). Tabu Search-Part II. ORSA Journal on Computing, 2: 4-32. Goh C., K. Tan, C. Cheong & Y. Ong (2010). An investigation on noise-induced features in robust evolutionary multi-objective optimization. Expert Systems with Applications, 37:5960–5980. Golden B, S. Raghavan, E. Wasil (eds.) (2008). The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research/Computer Science Interfaces Series 43, Springer, Berlin. Haughton M. (1998). The performance of route modification and demand stabilization strategies in stochastic vehicle routing. Transportation Research D, 32(8):551-566. Homberger J. & H. Gehring (1999). Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR, 37(3):297-318. Hosseini S. & W. Dullaert (2011). Robust optimization of uncertain logistics networks. In: Farahani R.Z., S. Rezapour and L. Karda (eds.), Logistics Operations and Management: Concepts and Models, Elsevier (ISBN 978-0-12-385202-1), chapter 17, pp. 359-370. Janssens G. K., A. Caris & K. Ramaekers (2009). Time Petri nets as an evaluation tool for handling travel time uncertainty in vehicle routing solutions. Expert Systems with Applications, 36:5987–5991. Kouvelis P. & G. Yu (1996). Robust discrete optimization and its applications. Dordrecht: Kluwer Academic Publishers. Lambert V., G. Laporte & F. Louveaux (1993). Designing collection routes through bank branches. Computers and Operations Research, 20(7):783-791. Lawler E.L., J.K. Lenstra, A.H.G Rinnooy Kan, & D.B. Shmoys (eds.) (1985). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley & Sons, Chichester. Laporte G., F. Louveaux & H. Mercure (1992). The vehicle routing problem with stochastic travel times. Transportation Science, 26(3):161-170. Laporte G., M. Gendreau, J.-Y. Potvin & F. Semet (2000). Classical and modern heuristics for the vehicle routing problem. International Transactions in Operations Research, 7:285-300. Laporte G. (2009). Fifty years of vehicle routing. Transportation Science, 43: 408-416. Lin Y., R. Batta, P.A. Rojerson & M. Flaingan (2011). A logistics model for emergency supply of critical items in the aftermath of a disaster. Socio-Economic Planning Sciences, 45(4):132-145. List G. F., B. Wood, L.K. Nozick, M.A. Turnquist, D.A. Jones, E.A. Kjeldgaard & C.R. Lawton (2002). Robust optimization for fleet planning under uncertainty. Transportation Research Part E, 39: 209–227. Manisri T., A. Mungwattana & G.K.Janssens (2011). Minimax optimisation approach for the robust vehicle routing problem with time windows and uncertain travel times. International Journal of Logistics Systems and Management, 10(4):461-477. Moghaddam B. F., S.J. Sadjadi & S.M. Seyedhosseini (2010). Comparing mathematical and heuristic methods. International Journal of Research and Reviews in Applied Sciences, 2(2):108-116. Moghaddam B. F., R. Ruiz & S.J. Sadjadi (2012). Vehicle routing problem with uncertain demands: an advanced particle swarm algorithm. Computers & Industrial Engineering, 62:306–317. Mulvey J. M., R.J. Vanderbei & S.A. Zenios (1995). Robust optimization of large-scale system. Operations Research, 43(2):264-281. Osman I.H. & N. Christofides (1989). Simulated annealing and descent algorithms for capacitated clustering problem. In: Reserach Report. s.l.:University of London, Yugoslavia. Osman I.H. (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41:421-451. Ozguven E.E. & K. Ozbay (2011). A secure and efficient inventory management system for disasters. Transportation Research Part C, 29:171–196. Panichakarn B. (2012). Freight max: Thai Supply Chain and Flood Crisis. [Online] Available at: Potvin J.-Y. & S. Bengio (1996). The vehicle routing problem with time windows: part II: genetic search. INFORMS Journal on Computing, 8(2):165-172. Ralphs T. (2003). Parallel branch and cut for vehicle routing. Parallel Computing, 29(5):607-629. Rawls C. & M. Turnquist (2012). Pre-positioning and dynamic delivery planning for short-term response following a natural disaster. Socio-Economic Planning Sciences, 46(1):46-54. Secomandi N. (2001). A rollout policy for the vehicle routing problem with stochastic demands. Operations Research, 49(5):796-802. Sheu J. (2007). An emergency logistics distribution approach for quick response to urgent relief demand in disasters. Transportation Research Part E , 43(6):687-709. Solomon M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time windows constraints. Operations Research, 35:254-265. Sörensen K. (2003). A framework for robust and flexible optimisation using metaheuristics with applications in supply chain design. Ph.D. thesis, Faculty of Applied Economics, University of Antwerp, Belgium. Sörensen K. & M. Sevaux (2009). A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling. Journal of Mathematical Modeling and Algorithms, 8: 387–407. Sungur I., F. Ordónez & M. Dessouky (2008). A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty. Inst. Ind. Eng. Trans., 40(5):509-523. Taillard E., P. Badeau, M. Gendreau, F. Guertin & J.-Y. Potvin (1997). A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science, 31(2):170-186. Thangiah S., J.-Y. Potvin & T. Sun (1996). Heuristic approaches to vehicle routing with backhauls and time windows. International Journal on Computers and Operations Research, 23(11):1043-1057. Toth P. & D. Vigo (2002). An overview of Vehicle Routing Models. In: Toth P. and Vigo D. (eds.) (2002), pp. 1-23. Toth P. & D. Vigo (eds.) (2002). The Vehicle Routing Problem, SIAM. Wang B. & S. He (2009). Robust optimization model and algorithm for logistics center location and allocation under uncertain environment. Journal of Transportation Systems Engineering and Information Technology, 9(2):69-74. World Bank, 2011. The World Bank supports Thailand's post-floods recovery effort. [Online] Available at: [Accessed 2013]. Yin Y., S.M. Madanat & X.-Y. Lu (2009). Robust improvement schemes for road networks under demand uncertainty. European Journal of Operational Research, 198:470–479. Zhu J., M. Gao & J. Huang (2009). A robust approach to vehicle routing for medical supplies in large-scale emergencies.Scientific Research.-
local.type.specifiedBook Section-
local.bibliographicCitation.btitleHandbook of Research on Artificial Intelligence Techniques and Algorithms: Volume II-
item.fulltextWith Fulltext-
item.accessRightsRestricted Access-
item.contributorJANSSENS, Gerrit-
item.contributorManisri, Tharinee-
item.contributorSoonpracha, Kusuma-
item.contributorMungwattana, Anan-
item.fullcitationJANSSENS, Gerrit; Soonpracha, Kusuma; Manisri, Tharinee & Mungwattana, Anan (2015) Robust vehicle routing solutions to manage time windows in the case of uncertain travel times. In: Vasant, Pandian (Ed.). Handbook of Research on Artificial Intelligence Techniques and Algorithms: Volume II, p. 655-678.-
item.validationvabb 2019-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
  Restricted Access
published version9.43 MBAdobe PDFView/Open    Request a copy
Show simple item record

Page view(s)

checked on May 20, 2022


checked on May 20, 2022

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.