Abstract
Manufacturers and service providers often encounter stochastic demand scenarios. Researchers have, thus far, considered that the deterministic truck and trailer routing problem (TTRP) cannot address the prevailing demand uncertainties and/or other complexities. The purpose of this study is to expand the deterministic TTRP model by introducing stochastic demand and time window constraints to bring the TTRP model closer to reality and solve the model in a reasonable timeframe by administering the memetic algorithm (MA). This paper presents a model that can be applied in stochastic demand conditions. To employ the MA, various crossovers, mutations and local search approaches were applied. First, two experimental tests were carried out to show the validity and consistency of the MA for solving stochastic TTRPs. The results can be compared with the VRPSDTW (vehicle routing problem with stochastic demands (VRSPD) with time windows) solution obtained using large neighbourhood search (LNS) of earlier research. The average results from Tests 1 and 2 achieved by MA are 514.927 and 516.451. However, the average result obtained by LNS is 516.877. Therefore, the MA can generate results. Thus, MA is found to be suitable for solving truck and trailer routing problem(s) under stochastic demand with a time window (TTRPSDTW). Moreover, 54 benchmark instances were modified for this case and the initial feasible solutions were generated for this purpose. The solutions were significantly improved by the MA. Also, the problems were tested using sensitivity analysis to understand the effects of the parameters and to make a comparison between the best results obtained by MA and sensitivity analysis. Since the differences between the results are small, the MA was found to be appropriate and better for solving TTRPSDTW. The paper also gives some suggestions for further research.
Similar content being viewed by others
References
Ando N, Taniguchi E (2006) Travel time reliability in vehicle routing and scheduling with time windows. Netw Spat Econ 6:293–311
Baker BM, Ayechew MA (2003) A genetic algorithm for the vehicle routing problem. Comput Oper Res 30:787–800
Beasley JE (1983) Route first—cluster second methods for vehicle routing. Omega 11:403–408
Bertsimas DJ (1992) A vehicle routing problem with stochastic demand. Oper Res: 574–585
Chao IM (2002) A tabu search method for the truck and trailer routing problem. Comput Oper Res 29:33–51
Cordone R, Calvo RW (2001) A heuristic for the vehicle routing problem with time windows. J Heuristics 7(2):107–129. doi:10.1023/a:1011301019184
Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6:80–91
Derigs U, Pullmann M, Vogel U (2013) Truck and trailer routing—problems, heuristics and computational experience. Comput Oper Res 40:536–546
Eksioglu B, Vural AV, Reisman A (2009) The vehicle routing problem: a taxonomic review. Comput Ind Eng 57:1472–1483
Escuín D, Millán C, Larrodé E (2012) Modelization of time-dependent urban freight problems by using a multiple number of distribution centers. Netw Spat Econ 12:321–336
Fisher ML, Jaikumar R (1981) A generalized assignment heuristic for vehicle routing. Networks 11:109–124
Gendreau M, Laporte G, Seguin R (1996a) A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Oper Res 44:469–477
Gendreau M, Laporte G, Séguin R (1996b). A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Oper Res: 469–477
Gerdessen JC (1996) Vehicle routing problem with trailers. Eur J Oper Res 93:135–147
Ghaderi A, Jabalameli M, Barzinpour F, Rahmaniani R (2012) An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem. Netw Spat Econ 12:421–439
Goldberg D, Lingle R (1985) Alleles, loci and the traveling salesman problem. In Proceedings of the Second International Conference on Genetic Algorithms, Mahwah, NJ. Lawrence Eribaum Associate
Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59:345–358
Laporte G, Louveaux F, Mercure H (1989) Models and exact solutions for a class of stochastic location-routing problems. Eur J Oper Res 39:71–78
Laporte G, Louveaux F, van Hamme L (2002) An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Oper Res 50:415–423
Lei H, Laporte G, Guo B (2011) The capacitated vehicle routing problem with stochastic demands and time windows. Comput Oper Res 38:1775–1783
LI X, Tian P, Leung SCH (2010) Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm. Int J Prod Econ 125:137–145
Lin SW, YU VF, Chou SY (2009) Solving the truck and trailer routing problem based on a simulated annealing heuristic. Comput Oper Res 36:1683–1692
Lin SW, YU VF, Chou SY (2010) A note on the truck and trailer routing problem. Expert Syst Appl 37:899–903
Lin SW, Yu VF, Chou SY (2011) A simulated annealing heuristic for the truck and trailer routing problem with time windows. Expert Syst Appl 38:15244–15252
Mendoza JE, Castanier B, Guéret C, Medaglia AL, Velasco N (2010) A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands. Comput Oper Res 37:1886–1898
Norouzi N, Tavakkoli-Moghaddam R, Ghazanfari M, Alinaghian M, Salamatbakhsh A (2012) A New multi-objective competitive open vehicle routing problem solved by particle swarm optimization. Expert Syst Appl 12:609–633
Oliver IM, Smith DJ, Holland JRC (1987) A study of permutation crossover operators on the traveling salesman problem. Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application. Cambridge, Massachusetts, USA: L. Erlbaum Associates Inc
Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31:1985–2002
Prins C (2009) Two memetic algorithms for heterogeneous fleet vehicle routing problems. Eng Appl Artif Intell 22:916–928
Psaraftis HN (1995) Dynamic vehicle routing: status and prospects. Ann Oper Res 61:143–164
Scheuerer S (2006) A tabu search heuristic for the truck and trailer routing problem. Comput Oper Res 33:894–909
Secomandi N, Margot F (2009) Reoptimization approaches for the vehicle-routing problem with stochastic demands. Oper Res 57:214–230
Stewart WR Jr, Golden BL (1983) Stochastic vehicle routing: a comprehensive approach. Eur J Oper Res 14:371–385
Tan KC, Cheong CY, Goh CK (2007) Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation. Eur J Oper Res 177:813–839
Tavakkoli-Moghaddam R, Saremi AR, Ziaee MS (2006) A memetic algorithm for a vehicle routing problem with backhauls. Appl Math Comput 181:1049–1060
Tillman FA (1969) The multiple terminal delivery problem with probabilistic demands. Transp Sci 3:192–204
Velasco N, Castagliola P, Dejax P, Guéret C, Prins C (2009) A memetic algorithm for a pick-up and delivery problem by helicopter. Bio-inspired algorithms for the vehicle routing problem. Springer Berlin Heidelberg
Vidal T, Crainic TG, Gendreau M, Prins C (2013). Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur J Oper Res
Villegas JG, Prins C, Prodhon C, Medaglia AL, Velasco N (2011) A GRASP with evolutionary path relinking for the truck and trailer routing problem. Comput Oper Res 38(9):1319–1334. doi:10.1016/j.cor.2010.11.011
Villegas JG, Prins C, Prodhon C, Medaglia AL, Velasco N (2010) GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots. Eng Appl Artif Intell 23:780–794
Villegas JG, Prins C, Prodhon C, Medaglia AL, Velasco N (2013) A matheuristic for the truck and trailer routing problem. Eur J Oper Res 230:231–244
Zhang J, Lam WK, Chen B (2013) A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service. Netw Spat Econ 13:471–496
Acknowledgment
The authors would like to thank the editor and the reviewers for their valuable comments. The authors also thankfully acknowledge the financial support from University of Malaya through the research projects RG139-12AET and UM.C/HIR/MOHE/ENG/31 for this research.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Mirmohammadsadeghi, S., Ahmed, S. Memetic Heuristic Approach for Solving Truck and Trailer Routing Problems with Stochastic Demands and Time Windows. Netw Spat Econ 15, 1093–1115 (2015). https://doi.org/10.1007/s11067-014-9282-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11067-014-9282-2