A genetic algorithm for the minimum latency pickup and delivery problem
暂无分享,去创建一个
[1] Zuren Feng,et al. A two-phase metaheuristic for the cumulative capacitated vehicle routing problem , 2013, Comput. Oper. Res..
[2] Xavier Gandibleux,et al. A heuristic two‐phase solution approach for the multi‐objective dial‐a‐ride problem , 2009, Networks.
[3] Christian Prins,et al. An effective memetic algorithm for the cumulative capacitated vehicle routing problem , 2010, Comput. Oper. Res..
[4] Gilbert Laporte,et al. The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..
[5] Yanchao Niu,et al. An Iterated Local Search Algorithm for the Cumulative Capacitated Vehicle Routing Problem , 2012 .
[6] Sophie N. Parragh,et al. A survey on pickup and delivery problems Part I : Transportation between customers and depot , 2007 .
[7] Richard F. Hartl,et al. A survey on pickup and delivery problems , 2008 .
[8] Chuan-Kang Ting,et al. The selective pickup and delivery problem: Formulation and a memetic algorithm , 2013 .
[9] A. E. Eiben,et al. Introduction to Evolutionary Computing , 2003, Natural Computing Series.
[10] Gilbert Laporte,et al. Static pickup and delivery problems: a classification scheme and survey , 2007 .
[11] Sophie N. Parragh,et al. A survey on pickup and delivery models Part II : Transportation between pickup and delivery locations , 2007 .
[12] Luiz Antonio Nogueira Lorena,et al. Customers' satisfaction in a dial-a-ride problem , 2009, IEEE Intelligent Transportation Systems Magazine.
[13] Satish Rao,et al. Paths, trees, and minimum latency tours , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[14] Thibaut Vidal,et al. A simple and effective metaheuristic for the Minimum Latency Problem , 2012, Eur. J. Oper. Res..
[15] Glaydston Mattos Ribeiro,et al. An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem , 2012, Comput. Oper. Res..
[16] Madhu Sudan,et al. The minimum latency problem , 1994, STOC '94.
[17] Harilaos N. Psaraftis,et al. A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .
[18] Richard F. Hartl,et al. A survey on pickup and delivery problems , 2008 .
[19] K. Deb. An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .