A scheme for determining vehicle routes based on Arc-based service network design

References

• Ahuja RK, Magnanti TL, Orlin JB. 1993. Network flows: theory, algorithms, and applications. Upper Saddle River (NJ): Prentice-Hall.
   Google Scholar
• Andersen J, Christiansen M, Crainic TG, Gronhaug R. 2011. Branch and price for service network design with asset management constraints. Transp Sci. 45:33–49.
   Web of Science ®Google Scholar
• Andersen J, Crainic TG, Christiansen M. 2009. Service network design with management and coordination of multiple fleets. Transp Res. 17:197–207.
   Google Scholar
• Azadeha A, Farahani MH, Eivazy H, Shirkouhi SN, Asadipour G. 2013. A hybrid meta-heuristic algorithm for optimization of crew scheduling. Appl Soft Comput. 13:158–164.
   Web of Science ®Google Scholar
• Bai R, Kendall G, Li J. 2010. An efficient guided local search approach for service network design problem with asset balancing. In: Proceedings of the International Conference on Logistics Systems and Intelligent Management; 2010 Jan 9–10; Harbin (China): IEEE; p. 110–115.
   Google Scholar
• Bai R, Kendall G, Qu R, Atkin J. 2012. Tabu assisted guided local search approaches for freight service network design. Inform Sci. 189:266–281.
   Web of Science ®Google Scholar
• Bai R, Wallace SW, Li J, Chong AY-L. 2014. Stochastic service network design with rerouting. Transp Res. 60:50–65.
   Google Scholar
• Bai R, Xue N, Chen J, Roberts GW. 2015. A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem. Transp Res. 79:134–148.
   Google Scholar
• Barcos L, Rodriguez V, Alvarez M, Robuste F. 2010. Routing design for less-than-truckload motor carriers using ant colony optimization. Transp Res. 46:367–383.
   Google Scholar
• Benslimane MT, Benadada Y. 2013. Ant colony algorithm for the multi-depot vehicle routing problem in large quantities by a heterogeneous fleet of vehicles. INFOR. 51:31–40.
   Web of Science ®Google Scholar
• Berbeglia G, Cordeau J-F, Gribkovskaia I, Laporte G. 2007. Static pickup and delivery problems: a classification scheme and survey. TOP. 15:1–31.
   Web of Science ®Google Scholar
• Caprara A, Fischetti M, Toth P. 1999. A heuristic method for the set covering problem. Oper Res. 47:730–743.
   Web of Science ®Google Scholar
• Cordeau J-F, Laporte G. 2003. The dial-a-ride problem (DARP): variants, modeling issues and algorithms. 4OR-Q J Oper Res. 1:89–101.
   Web of Science ®Google Scholar
• Cordeau J-F, Laporte G, Ropke S. 2008. Recent models and algorithms for one-to-one pickup and delivery problems. In: Golden B, Raghavan S, Wasil E, editors. The vehicle routing problem: latest advances and new challenges. New York (NY): Springer; p. 327–357.
   Google Scholar
• Costa AM. 2005. A survey on benders decomposition applied to fixed-charge network design problems. Comput Oper Res. 32:1429–1450.
   Web of Science ®Google Scholar
• Crainic TG. 2000. Service network design in freight transportation. Eur J Oper Res. 122:272–288.
   Web of Science ®Google Scholar
• Crainic TG, Gendreau M, Farvolden JM. 2000. A simplex-based tabu search method for capacitated network design. INFORMS J Comput. 12:223–236.
   Web of Science ®Google Scholar
• Crainic TG, Hewitt M, Toulouse M, Vu DM. 2016. Service network design with resource constraints. Transp Sci. 50:1380–1393.
   Web of Science ®Google Scholar
• Crainic TG, Li Y. 2006. A first multilevel cooperative algorithm for capacitated multicommodity network design. Comput Oper Res. 33:2602–2622.
   Web of Science ®Google Scholar
• Erera A, Karacık B, Savelsbergh M. 2008. A dynamic driver management scheme for less-than-truckload carriers. Comput Oper Res. 35:3397–3411.
   Web of Science ®Google Scholar
• Ghamlouche I, Crainic TG, Gendreau M. 2004. Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design. Ann Oper Res. 131:109–133.
   Web of Science ®Google Scholar
• Goel A, Gruhn V. 2006. Drivers’ working hours in vehicle routing and scheduling. In: Proceedings of the IEEE Intelligent Transportation Systems Conference; 2006 Sept 17–20; Toronto (Canada): IEEE; p. 1280–1285.
   Google Scholar
• Groiez M, Desaulniers G, Marcotte O. 2014. Valid inequalities and separation algorithms for the set partitioning problem. INFOR. 52:185–196.
   Web of Science ®Google Scholar
• Kok AL, Meyer CM, Kopfer H, Schutten JMJ. 2010. A dynamic programming heuristic for the vehicle routing problem with time windows and European community social legislation. Transp Sci. 44:442–454.
   Web of Science ®Google Scholar
• Laporte G. 1992. The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res. 59:345–358.
   Web of Science ®Google Scholar
• Pederson MB, Crainic TG, Madsen OBG. 2008. Models and tabu search metaheuristics for service network design with asset-balance requirements. Transp Sci. 43:158–177.
   Web of Science ®Google Scholar
• Rancourt M-E, Cordeau J-F, Laporte G. 2012. Long-haul vehicle routing and scheduling with working hour rules. Transp Sci. 47:81–107.
   Web of Science ®Google Scholar
• Smilowitz KR, Atamtürk A, Daganzo CF. 2003. Deferred item and vehicle routing within integrated networks. Transp Res. 39:305–323.
   Google Scholar
• Spoorendonk S, Desaulniers G. 2010. Clique inequalities applied to the vehicle routing problem with time windows. INFOR. 48:53–67.
   Web of Science ®Google Scholar
• Sundar S, Singh A. 2012. A hybrid heuristic for the set covering problem. Oper Res. 12:345–365.
   Web of Science ®Google Scholar
• Tarjan RE. 1972. Depth-first search and linear graph algorithms. SIAM J Comput. 1:146–160.
   Google Scholar
• Teypaz N, Schrenk S, Cung VD. 2010. A decomposition scheme for large-scale service network design with asset management. Transp Res. 46:156–170.
   Google Scholar
• Thapalia BK, Crainic TG, Kaut M, Wallace SW. 2011. Single-commodity stochastic network design with multiple sources and sinks. INFOR. 49:193–211.
   Web of Science ®Google Scholar
• Vu DM, Crainic TG, Toulouse M. 2013. A three-phase matheuristic for capacitated multi-commodity fixed-cost network design with design-balance constraints. J Heuristics. 19:757–795.
   Web of Science ®Google Scholar
• Weiss MA. 2013. Data structures and algorithm analysis in C++. 4th ed. Upper Saddle River (NJ): Pearson Education.
   Google Scholar
• Wieberneit N. 2008. Service network design for freight transportation: a review. OR Spectr. 30:77–112.
   Web of Science ®Google Scholar