Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem

[1]  Gilbert Laporte,et al.  The Delivery Man Problem with time windows , 2010, Discret. Optim..

[2]  Matteo Fischetti,et al.  The Delivery Man Problem and Cumulative Matroids , 1993, Oper. Res..

[3]  Panos M. Pardalos,et al.  A 2-phase constructive algorithm for cumulative vehicle routing problems with limited duration , 2016, Expert Syst. Appl..

[4]  James P. Kelly,et al.  The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results , 1998 .

[5]  Christian Prins,et al.  A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..

[6]  George Papageorgiou,et al.  The Complexity of the Travelling Repairman Problem , 1986, RAIRO Theor. Informatics Appl..

[7]  Glaydston Mattos Ribeiro,et al.  An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem , 2012, Comput. Oper. Res..

[8]  Madhu Sudan,et al.  The minimum latency problem , 1994, STOC '94.

[9]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[10]  Pierre Hansen,et al.  Variable neighborhood search: basics and variants , 2017, EURO J. Comput. Optim..

[11]  Ann Melissa Campbell,et al.  Routing for Relief Efforts , 2008, Transp. Sci..

[12]  Wlodzimierz Ogryczak,et al.  Inequality measures and equitable approaches to location problems , 2000, Eur. J. Oper. Res..

[13]  Abilio Lucena,et al.  Time-dependent traveling salesman problem-the deliveryman case , 1990, Networks.

[14]  Christian Prins,et al.  An effective memetic algorithm for the cumulative capacitated vehicle routing problem , 2010, Comput. Oper. Res..

[15]  Maurice Queyranne,et al.  The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..