Large Neighborhoods with Implicit Customer Selection for Vehicle Routing Problems with Profits

References

• Aksen D, Kaya O, Salman FS, Akça Y (2012) Selective and periodic inventory routing problem for waste vegetable oil collection. Optim. Lett. 6(6):1063–1080.Crossref, Google Scholar
• Aras N, Aksen D, Tugrul Tekin M (2011) Selective multi-depot vehicle routing problem with pricing. Transportation Res. Part C: Emerging Tech. 19(5):866–884.Crossref, Google Scholar
• Archetti C, Bianchessi N, Speranza MG (2013a) Optimal solutions for routing problems with profits. Discrete Appl. Math. 161(4–5):547–557.Crossref, Google Scholar
• Archetti C, Hertz A, Speranza MG (2007) Metaheuristics for the team orienteering problem. J. Heuristics 13(1):49–76.Crossref, Google Scholar
• Archetti C, Speranza MG, Vigo D (2013b) Vehicle routing problems with profits. Technical report, Department of Economics and Management, University of Brescia, Brescia, Italy.Google Scholar
• Archetti C, Feillet D, Hertz A, Speranza MG (2009) The capacitated team orienteering and profitable tour problems. J. Oper. Res. Soc. 60(6):831–842.Crossref, Google Scholar
• Beasley JE (1983) Route first-cluster second methods for vehicle routing. Omega 11(4):403–408.Crossref, Google Scholar
• Bolduc M-C, Renaud J, Boctor F (2007) A heuristic for the routing and carrier selection problem. Eur. J. Oper. Res. 183(2):926–932.Crossref, Google Scholar
• Bolduc M-C, Renaud J, Boctor F, Laporte G (2008) A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers. J. Oper. Res. Soc. 59(6):776–787.Crossref, Google Scholar
• Bouly H, Dang D-C, Moukrim A (2009) A memetic algorithm for the team orienteering problem. 4OR 8(1):49–70.Crossref, Google Scholar
• Boussier S, Feillet D, Gendreau M (2007) An exact algorithm for team orienteering problems. 4OR 5(3):211–230.Crossref, Google Scholar
• Butt SE, Ryan DM (1999) An optimal solution procedure for the multiple tour maximum collection problem using column generation. Comput. Oper. Res. 26(4):427–441.Crossref, Google Scholar
• Campbell AM, Vandenbussche D, Hermann W (2008) Routing for relief efforts. Transportation Sci. 42(2):127–145.Link, Google Scholar
• Chao I, Golden B, Wasil EA (1996) The team orienteering problem. Eur. J. Oper. Res. 88(3):464–474.Crossref, Google Scholar
• Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. Christofides N, Mingozzi A, Toth P, Sandi C, eds. Combinatorial Optimization (Wiley, Chichester, UK), 315–338.Google Scholar
• Chu C-W (2005) A heuristic algorithm for the truckload and less-than-truckload problem. Eur. J. Oper. Res. 165(3):657–667.Crossref, Google Scholar
• Côté J-F, Potvin J-Y (2009) A tabu search heuristic for the vehicle routing problem with private fleet and common carrier. Eur. J. Oper. Res. 198(2):464–469.Crossref, Google Scholar
• Dang D-C, Guibadj R, Moukrim A (2011) A PSO-based memetic algorithm for the team orienteering problem. Applications of Evolutionary Computation, Lecture Notes Comput. Sci., Vol. 6625 (Springer, Berlin), 471–480.Crossref, Google Scholar
• Duhamel C, Santos AC, Aloise DJ (2009) Multicommodity formulations for the prize collecting vehicle routing problem in the petrol industry. Technical report LIMOS/RR-09-05, Clermont-Ferrand, France.Google Scholar
• Feillet D, Dejax P, Gendreau M (2005) Traveling salesman problems with profits. Transportation Sci. 39(2):188–205.Link, Google Scholar
• Glover F (1996) Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Appl. Math. 65(1–3):223–253.Crossref, Google Scholar
• Golden BL, Wasil EA, Kelly JP, Chao I (1998) The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets, and computational results. Crainic TG, Laporte G, eds. Fleet Management and Logistics (Kluwer, Boston), 33–56.Crossref, Google Scholar
• Hemmelmayr V, Doerner KF, Hartl RF, Savelsbergh MWP (2009) Delivery strategies for blood products supplies. OR Spectrum 31(4):707–725.Crossref, Google Scholar
• Johnson DS, McGeoch LA (1997) The traveling salesman problem: A case study in local optimization. Aarts EHL, Lenstra JK, eds. Local Search in Combinatorial Optimization (Princeton University Press, Princeton, NJ), 215–310.Google Scholar
• Ke L, Archetti C, Feng Z (2008) Ants can solve the team orienteering problem. Comput. Indust. Engrg. 54(3):648–665.Crossref, Google Scholar
• Labadie N, Melechovský J, Wolfler Calvo R (2010) Hybridized evolutionary local search algorithm for the team orienteering problem with time windows. J. Heuristics 17(6):729–753.Crossref, Google Scholar
• Labadie N, Mansini R, Melechovský J, Wolfler Calvo R (2012) The team orienteering problem with time windows: An LP-based granular variable neighborhood search. Eur. J. Oper. Res. 220(1):15–27.Crossref, Google Scholar
• Lin S-W (2013) Solving the team orienteering problem using effective multi-start simulated annealing. Appl. Soft Comput. 13(2):1064–1073.Crossref, Google Scholar
• Lin S-W, Yu VF (2012) A simulated annealing heuristic for the team orienteering problem with time windows. Eur. J. Oper. Res. 217(1):94–107.Crossref, Google Scholar
• Lopez L, Carter MW, Gendreau M (1998) The hot strip mill production scheduling problem: A tabu search approach. Eur. J. Oper. Res. 106(2–3):317–335.Crossref, Google Scholar
• Mufalli F, Batta R, Nagi R (2012) Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans. Comput. Oper. Res. 39(11):2787–2799.Crossref, Google Scholar
• Potvin J-Y, Naud M-A (2011) Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier. J. Oper. Res. Soc. 62(2):326–336.Crossref, Google Scholar
• Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31(12):1985–2002.Crossref, Google Scholar
• Prins C (2009) A GRASP—evolutionary local search hybrid for the vehicle routing problem. Pereira FB, Tavares J, eds. Bio-Inspired Algorithms for the Vehicle Routing Problem (Springer, Berlin, Heidelberg), 35–53.Crossref, Google Scholar
• Souffriau W, Vansteenwegen P, Vanden Berghe G, Van Oudheusden D (2010) A path relinking approach for the team orienteering problem. Comput. Oper. Res. 37(11):1853–1859.Crossref, Google Scholar
• Stenger A, Schneider M, Goeke D (2013) The prize-collecting vehicle routing problem with single and multiple depots and non-linear cost. EURO J. Transportation Logist. 2(1–2):57–87.Crossref, Google Scholar
• Stenger A, Vigo D, Enz S, Schwind M (2012) An adaptive variable neighborhood search algorithm for a vehicle routing problem arising in small package shipping. Transportation Sci. 47(1):64–80.Link, Google Scholar
• Tang H, Miller-Hooks E (2005) A tabu search heuristic for the team orienteering problem. Comput. Oper. Res. 32(6):1379–1407.Crossref, Google Scholar
• Tang L, Wang X (2006) Iterated local search algorithm based on very large-scale neighborhood for prize-collecting vehicle routing problem. Internat. J. Advanced Manufacturing Tech. 29(11–12):1246–1258.Crossref, Google Scholar
• Toth P, Vigo D (2003) The granular tabu search and its application to the vehicle-routing problem. INFORMS J. Comput. 15(4):333–346.Link, Google Scholar
• Tricoire F, Romauch M, Doerner KF, Hartl RF (2010) Heuristics for the multi-period orienteering problem with multiple time windows. Comput. Oper. Res. 37(2):351–367.Crossref, Google Scholar
• Vansteenwegen P, Souffriau W (2009) Metaheuristics for tourist trip planning. Sörensen K, Sevaux M, Habenicht W, Geiger MJ, eds. Metaheuristics in the Service Industry, Lecture Notes Econom. Math. Systems (Springer, Berlin Heidelberg), 15–31.Crossref, Google Scholar
• Vansteenwegen P, Souffriau W, Oudheusden DV (2010) The orienteering problem: A survey. Eur. J. Oper. Res. 209(1):1–10.Crossref, Google Scholar
• Vansteenwegen P, Souffriau W, Berghe GV, Oudheusden DV (2009a) A guided local search metaheuristic for the team orienteering problem. Eur. J. Oper. Res. 196(1):118–127.Crossref, Google Scholar
• Vansteenwegen P, Souffriau W, Vanden Berghe G, Van Oudheusden D (2009b) Iterated local search for the team orienteering problem with time windows. Comput. Oper. Res. 36(12):3281–3290.Crossref, Google Scholar
• Vidal T, Crainic TG, Gendreau M, Prins C (2013) Heuristics for multi-attribute vehicle routing problems: A survey and synthesis. Eur. J. Oper. Res. 231(1):1–21.Crossref, Google Scholar
• Vidal T, Crainic TG, Gendreau M, Prins C (2014) A unified solution framework for multi-attribute vehicle routing problems. Eur. J. Oper. Res. 234(3):658–673.Crossref, Google Scholar
• Vidal T, Crainic TG, Gendreau M, Prins C (2015) Timing problems and algorithms: Time decisions for sequences of activities. Networks 65(2):102–128.Crossref, Google Scholar
• Zhang Z, Che O, Cheang B, Lim A, Qin H (2013) A memetic algorithm for the multiperiod vehicle routing problem with profit. Eur. J. Oper. Res. 229(3):573–584.Crossref, Google Scholar