The prisoner transportation problem
暂无分享,去创建一个
Greet Van den Berghe | Tony Wauters | Jan Christiaens | Hatice Calik | Reshma Chirayil Chandrasekharan
[1] Abdellah El-Fallahi,et al. A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem , 2008, Comput. Oper. Res..
[2] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[3] Maria Grazia Speranza,et al. A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes , 2015, Annals of Operations Research.
[4] Guy Desaulniers,et al. Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows , 2008, Oper. Res..
[5] Jean-François Cordeau,et al. Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints , 2012, OR Spectr..
[6] Matteo Salani,et al. Branch and price for the vehicle routing problem with discrete split deliveries and time windows , 2011, Eur. J. Oper. Res..
[7] Kris Braekers,et al. Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation , 2017, Comput. Oper. Res..
[8] Gilbert Laporte,et al. Dynamic transportation of patients in hospitals , 2010, OR Spectr..
[9] G. Dueck,et al. Record Breaking Optimization Results Using the Ruin and Recreate Principle , 2000 .
[10] M. Savelsbergh. An efficient implementation of local search algorithms for constrained routing problems , 1990 .
[11] Gilbert Laporte,et al. The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..
[12] Gilbert Laporte,et al. A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia☆ , 2015 .
[13] Pierre Hansen,et al. Bounded vertex colorings of graphs , 1990, Discret. Math..
[14] Chris N. Potts,et al. Scheduling with batching: A review , 2000, Eur. J. Oper. Res..
[15] Hussein Al-Omari,et al. New Graph Coloring Algorithms , 2006 .
[16] Jorge Pinho de Sousa,et al. The Dial-a-Ride Problem with Split Requests and Profits , 2015, Transp. Sci..
[17] Martin W. P. Savelsbergh,et al. The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..
[18] Paolo Toth,et al. Heuristic Algorithms for the Handicapped Persons Transportation Problem , 1997, Transp. Sci..
[19] Temel Öncan,et al. A comparative analysis of several asymmetric traveling salesman problem formulations , 2009, Comput. Oper. Res..
[20] Gilbert Laporte,et al. Fifty Years of Vehicle Routing , 2009, Transp. Sci..
[21] Franz Rothlauf,et al. Vehicle routing with compartments: applications, modelling and heuristics , 2011, OR Spectr..
[22] Burak Eksioglu,et al. The vehicle routing problem: A taxonomic review , 2009, Comput. Ind. Eng..
[23] Maria Sameiro Carvalho,et al. New mixed integer-programming model for the pickup-and-delivery problem with transshipment , 2014, Eur. J. Oper. Res..
[24] Arne Løkketangen,et al. A tabu search approach for the livestock collection problem , 2008, Comput. Oper. Res..
[25] Christos D. Tarantilis,et al. Resource constrained routing and scheduling: Review and research prospects , 2017, Eur. J. Oper. Res..
[26] Jacques Desrosiers,et al. Solving a rich vehicle routing and inventory problem using column generation , 2010, Comput. Oper. Res..