Solving the biobjective selective pickup and delivery problem with memetic algorithm
暂无分享,去创建一个
[1] Gilbert Laporte,et al. Static pickup and delivery problems: a classification scheme and survey , 2007 .
[2] Kalyanmoy Deb,et al. A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..
[3] Xavier Gandibleux,et al. A heuristic two‐phase solution approach for the multi‐objective dial‐a‐ride problem , 2009, Networks.
[4] Mary E. Kurz. Heuristics for the Traveling Salesman Problem , 2011 .
[5] Chuan-Kang Ting,et al. An evolutionary approach for the selective pickup and delivery problem , 2010, IEEE Congress on Evolutionary Computation.
[6] J. Wesley Barnes,et al. Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search Transportation , 2000 .
[7] Refael Hassin,et al. The swapping problem , 1992, Networks.
[8] Hokey Min,et al. A dial-a-ride problem for client transportation in a health-care organization , 2007, Comput. Oper. Res..
[9] R M Jorgensen,et al. Solving the Dial-a-Ride problem using genetic algorithms , 2007, J. Oper. Res. Soc..
[10] Shoshana Anily,et al. Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries , 1999 .
[11] Abel García-Nájera. The Vehicle Routing Problem with Backhauls: A Multi-objective Evolutionary Approach , 2012, EvoCOP.
[12] Michael H. Cole,et al. A VEHICLE ROUTING PROBLEM WITH BACKHAULS AND TIME WINDOWS: A GUIDED LOCAL SEARCH SOLUTION , 2005 .
[13] Michel Gendreau,et al. The preemptive swapping problem on a tree , 2011, Networks.
[14] Maged Dessouky,et al. A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows , 2004 .
[15] Michel Gendreau,et al. Heuristics for the mixed swapping problem , 2010, Comput. Oper. Res..
[16] Inmaculada Rodríguez Martín,et al. A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem , 2009, Comput. Oper. Res..
[17] Russell Bent,et al. A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows , 2003, Comput. Oper. Res..
[18] Juan José Salazar González,et al. Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem , 2004, Transp. Sci..
[19] Sophie N. Parragh,et al. A survey on pickup and delivery models Part II : Transportation between pickup and delivery locations , 2007 .
[20] Abder Koukam,et al. An Evolutionary Approach to Pickup and Delivery Problem with Time Windows , 2004, International Conference on Computational Science.
[21] Saïd Salhi,et al. Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries , 2005, Eur. J. Oper. Res..
[22] Kaisa Miettinen,et al. Nonlinear multiobjective optimization , 1998, International series in operations research and management science.
[23] Qingfu Zhang,et al. Multiobjective evolutionary algorithms: A survey of the state of the art , 2011, Swarm Evol. Comput..
[24] Jean-Yves Potvin,et al. Heuristic approaches to vehicle routing with backhauls and time windows , 1996, Comput. Oper. Res..
[25] Andrew Lim,et al. A Metaheuristic for the Pickup and Delivery Problem with Time Windows , 2003, Int. J. Artif. Intell. Tools.
[26] Richard F. Hartl,et al. A survey on pickup and delivery problems , 2008 .
[27] Lothar Thiele,et al. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..
[28] David Pisinger,et al. A unified heuristic for a large class of Vehicle Routing Problems with Backhauls , 2006, Eur. J. Oper. Res..
[29] Sophie N. Parragh,et al. A survey on pickup and delivery problems Part I : Transportation between customers and depot , 2007 .
[30] Richard F. Hartl,et al. A survey on pickup and delivery problems , 2008 .
[31] Chuan-Kang Ting,et al. The selective pickup and delivery problem: Formulation and a memetic algorithm , 2013 .