Multilevel neighborhood search for solving full truckload routing problems arising in timber transportation
暂无分享,去创建一个
Ulrich Derigs | Patrick Hirsch | Manfred Gronalt | Ulrich Vogel | Markus Pullmann | Marco Oberscheider
[1] Patrick Hirsch,et al. Minimizing driving times and greenhouse gas emissions in timber transport with a near-exact solution approach , 2013 .
[2] Ulrich Derigs,et al. Experience with a framework for developing heuristics for solving rich vehicle routing problems , 2014, J. Heuristics.
[3] Russell Bent,et al. A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows , 2004, Transp. Sci..
[4] George D. Smith,et al. The Attribute Based Hill Climber , 2004, J. Math. Model. Algorithms.
[5] Patrick Hirsch,et al. Minimizing Empty Truck Loads in Round Timber Transport with Tabu Search Strategies , 2011, Int. J. Inf. Syst. Supply Chain Manag..
[6] David Pisinger,et al. An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..
[7] Patrick Hirsch,et al. Log-Truck Scheduling with a Tabu Search Strategy , 2007, Metaheuristics.
[8] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[9] Ulrich Derigs,et al. Applying the attribute based hill climber heuristic to the vehicle routing problem , 2007, Eur. J. Oper. Res..
[10] Ulrich Vogel,et al. A flexible metaheuristic framework for solving rich vehicle routing problems: Formulierung, Implementierung und Anwendung eines kognitionsbasierten Simulationsmodells , 2011 .
[11] Kenneth Sörensen,et al. "Multiple Neighbourhood" Search in Commercial VRP Packages: Evolving Towards Self-Adaptive Methods , 2008, Adaptive and Multilevel Metaheuristics.
[12] G. Dueck. New optimization heuristics , 1993 .