A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
暂无分享,去创建一个
[1] Yves Rochat,et al. Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.
[2] Brian Kallehauge,et al. The Vehicle Routing Problem with Time Windows , 2006, Vehicle Routing.
[3] Michel Gendreau,et al. On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem , 1999, Eur. J. Oper. Res..
[4] Dirk Van Oudheusden,et al. The Multiconstraint Team Orienteering Problem with Multiple Time Windows , 2010, Transp. Sci..
[5] Richard F. Hartl,et al. Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows , 2008, Comput. Oper. Res..
[6] P. Hansen,et al. Variable Neighborhood Search for Extremal Graphs. XI. Bounds on Algebraic Connectivity , 2004 .
[7] Pierre Hansen,et al. Variable Neighborhood Search for Extremal Graphs: IV: Chemical Trees with Extremal Connectivity Index , 1998, Comput. Chem..
[8] Gilbert Laporte,et al. Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows , 2004, J. Oper. Res. Soc..
[9] Richard F. Hartl,et al. Heuristics for the multi-period orienteering problem with multiple time windows , 2010, Comput. Oper. Res..
[10] Martin W. P. Savelsbergh,et al. The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..
[11] Marius M. Solomon,et al. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..
[12] Gilbert Laporte,et al. Long-Haul Vehicle Routing and Scheduling with Working Hour Rules , 2013, Transp. Sci..
[13] Richard F. Hartl,et al. A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows , 2004, J. Heuristics.
[14] Nenad Mladenovic,et al. Variable neighborhood search for location routing , 2013, Comput. Oper. Res..
[15] Marshall L. Fisher,et al. Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..
[16] Daniela Favaretto,et al. Ant colony system for a VRP with multiple time windows and multiple visits , 2007 .
[17] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[18] Alain Hertz,et al. Metaheuristics for the team orienteering problem , 2005, J. Heuristics.
[19] Gilbert Laporte,et al. A tabu search heuristic and adaptive memory procedure for political districting , 2003, Eur. J. Oper. Res..
[20] Michel Gendreau,et al. An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows , 1998, Transp. Sci..
[21] D. M. Deighton,et al. Computers in Operations Research , 1977, Aust. Comput. J..
[22] Rym M'Hallah,et al. Packing unit spheres into the smallest sphere using VNS and NLP , 2013, Comput. Oper. Res..
[23] Olli Bräysy. Fast Local Searches For The Vehicle Routing Problem With Time Windows , 2002 .
[24] Michel Gendreau,et al. A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..