A new closed–open vehicle routing approach in stochastic environments

References

• N. Aras, D. Aksen, and M.T. Tekin, Selective multi-depot vehicle routing problem with pricing. Transp. Res. Part C 19 (2011), pp. 866–884.
   Web of Science ®Google Scholar
• A. Azadeh, and H. Farrokhi-Asl, The close–open mixed multi depot vehicle routing problem considering internal and external fleet of vehicles. Transp. Lett. 11 (2019), pp. 78–92.
   Web of Science ®Google Scholar
• R. Baldacci, M. Battarra, D. Vigo, Routing a heterogeneous fleet of vehicles, in The Vehicle Routing Problem, Latest Advances and New Challenges, B. L. Golden, S. Raghavan, E. Wasil, ed., Springer, New York, London, 2008, pp. 3–27.
   Google Scholar
• R. Baldacci, P. Toth, and D. Vigo, Recent advances in vehicle routing exact algorithms. 4OR 5 (2007), pp. 269–298.
   Google Scholar
• R. Baldacci, P. Toth, and D. Vigo, Exact algorithms for routing problems under vehicle capacity constraints. Ann. Oper. Res. 175 (2010), pp. 213–245.
   Web of Science ®Google Scholar
• E. Benavent, and A. Martínez, Multi-depot multiple TSP: a polyhedral study and computational results. Ann. Oper. Res. 207 (2013), pp. 7–25.
   Web of Science ®Google Scholar
• L. Bodin, A taxonomic structure for vehicle routing and scheduling problems. Comp. Urban Soc. 1 (1975), pp. 11–29.
   Google Scholar
• N. Boysen, M. Fliedner, A. Scholl, Scheduling inbound and outbound trucks at cross-docking terminals. OR Spectr. 32 (2008), pp. 1–27.
   Web of Science ®Google Scholar
• K. Braekers, A. Caris, and G.K. Jenssens, Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots. Transp. Res. B Methodol. 67 (2014), pp. 166–186.
   Web of Science ®Google Scholar
• G. Carpaneto, M. Dell’amico, M. Fischetti, and P. Toth, A branch and bound algorithm for the multiple depot vehicle scheduling problem. Networks 19 (1989), pp. 531–548.
   Web of Science ®Google Scholar
• F. Chen, and K.L. Song, Minimizing make span in two stage hybrid cross docking scheduling problem. Comp. Oper. Res. 36 (2009), pp. 2066–2073.
   Web of Science ®Google Scholar
• J.F. Cordeau, M. Gendreau, A. Hertz, G. Laporte, J.S. Sormany, New heuristics for the vehicle routing problem, in Logistics Systems: Design and Optimization, A. Langevin, D. Riopel, ed., Springer, Boston, MA, 2005. pp. 279–298.
   Google Scholar
• B. Crevier, J.F. Cordeau, and G. Laporte, The multi-depot vehicle routing problem with inter-depot routes. Eur. J. Oper. Res. 176 (2007), pp. 756–773.
   Web of Science ®Google Scholar
• G. Dantzig, and J. Ramser, The truck dispatching problem. Manage. Sci. 6 (1959), pp. 80–91.
   Web of Science ®Google Scholar
• R. Dondo, and J. Cerdá, A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. Eur. J. Oper. Res. 176 (2007), pp. 1478–1507.
   Web of Science ®Google Scholar
• R. Dondo, C.A. Mendez, and J. Cerdá, An optimal approach to the multiple depot heterogeneous vehicle routing problem with time window and capacity constraints. Latin Am. Appl. Res. 33 (2003), pp. 129–134.
   Web of Science ®Google Scholar
• G. Dong, J. Tang, K.K. Lai, and Y. Kong, An exact algorithm for vehicle routing and scheduling problem of free pickup and delivery service in flight ticket sales companies based on set partitioning model. J. Intell. Manuf. 22 (2011), pp. 789–779.
   Web of Science ®Google Scholar
• D.B. Fogel, Evolutionary Computation: Toward a New Philosophy of Machine Intelligence, IEEE Press and Piscataway. John Wiley & Sons, Hobokon, New Jersey, 2006.
   Google Scholar
• R.K. Goel, S.R. Bansal, Hybrid algorithms for rich vehicle routing problems: a survey. Smart Deliv. Syst. A volume in Intelligent Data-Centric Systems (2020), pp. 157–184.
   Google Scholar
• Q. Jiang, C.H. Wang, D. Mu, and L. Zhou, A hybrid metaheuristic algorithm for the VRPSPD problem. J. Comp. Inf. Syst. 11 (2015), pp. 4845–4856.
   Google Scholar
• T. Jin, S. Guo, F. Wang, and A. Lim, One-stage search for multi-depot vehicle routing problem, in Proceedings of the Information Systems and Control Conference, 2004, pp. 446–129
   Google Scholar
• S. Kitayama, and K. Yasuda, A method for mixed integer programming problems by particle swarm optimization. IEEJ Trans. Electr. Inf. Syst. 125 (2005), pp. 813–820.
   Google Scholar
• R.V. Kulkarni, and P.R. Bhave, Integer programming formulations of vehicle routing problems. Eur. J. Oper. Res. 20 (1985), pp. 58–67.
   Web of Science ®Google Scholar
• G. Laporte, Y. Nobert, and D. Arpin, Optimal solutions to capacitated multidepot vehicle routing problems. Congr. Numer. 44 (1984), pp. 283–292.
   Google Scholar
• G. Laporte, Y. Nobert, and S. Taillefer, Solving a family of multi-depot vehicle routing and location-routing problems. Transp. Sci. 22 (1988), pp. 161–172.
   Web of Science ®Google Scholar
• Y.H. Lee, W.J. Jung, and K.M. Lee, Vehicle routing scheduling for cross-docking in the supply chain. Comp. Indus. Eng. 51 (2006), pp. 247–256.
   Web of Science ®Google Scholar
• J.K. Lenstra, and A.H.G. Rinnooy Kan, Complexity of vehicle routing and scheduling problems. Networks 11 (1981), pp. 221–227.
   Web of Science ®Google Scholar
• A. Lim, and F. Wang, Multi-depot vehicle routing problem: a one-stage approach. IEEE Trans. Autom. Sci. Eng. 2 (2005), pp. 397–402.
   Web of Science ®Google Scholar
• F. Maffioli, The vehicle routing problem: a book review. Quar. J. Oper. Res. 1 (2002), pp. 149–153.
   Web of Science ®Google Scholar
• M. Maischberger, and J.F. Cordeau, Solving variants of the vehicle routing problem with a simple parallel iterated Tabu search. Netw. Optim. Lect. Notes Comp. Sci. 6701 (2011), pp. 395–400.
   Google Scholar
• A. Mor, and M.G. Speranza, Vehicle routing problems over time: a survey. 4OR 18 (2020), pp. 129–149.
   Google Scholar
• M. Mourgaya, and F. Vanderbeck, The periodic vehicle routing problem: classification and heuristic for tactical planning. RAIRO Oper. Res. 40 (2006), pp. 169–194.
   Web of Science ®Google Scholar
• J.M. Mulvey, R.J. Vanderbei, and S.A. Zenios, Robust optimization of large-scale systems. Oper. Res. 43(2) (1995), pp. 264–281.
   Web of Science ®Google Scholar
• K.V. Narashima, E. Kivelevitch, B. Sharma, and M. Kumar, An ant colony optimization technique for solving min-max multi-depot vehicle routing problem. Swarm. Evol. Comput. 13 (2013), pp. 63–73.
   Web of Science ®Google Scholar
• Isaza S. Nieto, Franco J. López, and Padill Herazo, Building infrastructure by fostering engineering collaboration, efficient and effective integration and innovative planning, in Tenth LACCEI Latin American and Caribbean Conference LACCEI’2012), Panama City, 2012, pp. 23–27.
   Google Scholar
• M. Polacek, S. Benkner, K.F. Doerner, and R.F. Hartl, A cooperative and adaptive variable neighborhood search for the multi depot vehicle routing problem with time windows. Bus. Res. 1 (2008), pp. 207–218.
   Google Scholar
• M. Polacek, R.F. Hartl, K. Doerner, and M. Reimann, A variable neighborhood search for the multi depot vehicle routing problem with timewindows. J. Heurist. 10 (2005), pp. 613–627.
   Web of Science ®Google Scholar
• H. Psaraftis, Dynamic vehicle routing: status and prospects. Ann. Oper. Res. 61 (1995), pp. 143–164.
   Web of Science ®Google Scholar
• M. Rabbani, A. Taghi-Molla, H. Farrokhi-Asl, and M. Mobini, Sustainable vehicle-routing problem with time windows by heterogeneous fleet of vehicles and separated compartments: application in waste collection problem. Int. J. Transp. Eng. 7 (2019), pp. 195–216.
   Google Scholar
• A. Rahmani, and S.A. MirHassani, A hybrid firefly-genetic algorithm for the capacitated facility location problem. Inf. Sci. 283 (2014), pp. 70–78.
   Web of Science ®Google Scholar
• J. Renaud, G. Laporte, and F.F. Boctor, A Tabu search heuristic for the multi- depot vehicle routing problem. Comput. Oper. Res. 23 (1996), pp. 229–235.
   Web of Science ®Google Scholar
• D. Sariklis, and S. Powell, A heuristic method for the open vehicle routing problem. J. Oper. Res. Soc. 51 (2000), pp. 564–573.
   Web of Science ®Google Scholar
• A. Sen and K. Bülbül, A survey on multi trip vehicle routing problem, in Proceedings of the VI International Logistics and Supply Chain Congress, Istanbul, Turkey. Available online at: November 6–7, 2008.
   Google Scholar
• M.M. Solomon, and J. Desrosiers, Time window constrained routing and scheduling problems. Transp. Sci. 22 (1988), pp. 1–13.
   Web of Science ®Google Scholar
• R. Tavakkoli-Moghaddam, M. Meskini, H. Nasseri and H. Tavakkoli-Moghaddam, A multi-depot close and open vehicle routing problem with heterogeneous vehicles, 2019 International Conference on Industrial Engineering and Systems Management (IESM), Shanghai, China, 2019, pp. 1–6, doi:10.1109/IESM45758.2019.8948137.
   Google Scholar
• S.R. Thangiah, and S. Salhi, Genetic clustering: An adaptive heuristic for the multidepot vehicle routing problem. Appl. Artif. Intell. 15 (2001), pp. 361–383.
   Web of Science ®Google Scholar
• T. Vidal, T. G. Crainic, M. Gendreau, N. Lahrichi, and W. Rei, A hybrid genetic algorithm for multi-depot and periodic vehicle routing problems, CIRRELT- 2010-34, 2010.
   Google Scholar
• M.A. Waller, C.C. Richard, and J. Ozment, Impact of cross-docking on inventory in a decentralized retail supply chain. Transp. Res. Part E 42 (2006), pp. 359–382.
   Google Scholar
• J.F. Wang, and A. Regan, Real-time trailer scheduling for cross dock operations. Transp. J. 47 (2008), pp. 5–20.
   Web of Science ®Google Scholar
• Z. Wang, J. Zhang, and X. Wang, A modified variable neighborhood search algorithm for the multi depot vehicle routing problem with time windows. Chin. J. Manage. Sci. 19 (2011), pp. 99–109.
   Google Scholar
• T.H. Wu, C. Low, and J.W. Bai, Heuristic solutions to multi-depot location routing problems. Comput. Oper. Res. 29 (2002), pp. 1393–1415.
   Web of Science ®Google Scholar
• X.S. Yang, Nature-inspired metaheuristic algorithm, Luniver Press, United Kingdom, 2008.
   Google Scholar
• W. Yu, and P.J. Egbelu, Scheduling of inbound and outbound trucks in cross docking systems with temporary storage. Eur. J. Oper. Res. 184 (2008), pp. 377–396.
   Web of Science ®Google Scholar
• M.H.F. Zarandi, A. Hemmati, and S. Davari, The multi-depot capacitated location-routing problem with fuzzy travel times. Expert. Syst. Appl. 38 (2011), pp. 10075–10084.
   Web of Science ®Google Scholar