The selective pickup and delivery problem: Formulation and a memetic algorithm
暂无分享,去创建一个
[1] Ismail Karaoglan,et al. A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery , 2013, Comput. Ind. Eng..
[2] Jean-François Cordeau,et al. Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows , 2009, Transp. Sci..
[3] Michel Gendreau,et al. The preemptive swapping problem on a tree , 2011, Networks.
[4] Gilbert Laporte,et al. One-to-Many-to-One Single Vehicle Pickup and Delivery Problems , 2008 .
[5] Shoshana Anily,et al. Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries , 1999 .
[6] Andrew Lim,et al. The Tree Representation of Feasible Solutions for the TSP with Pickup and Delivery and LIFO Loading , 2010, AAAI.
[7] Paolo Toth,et al. An Exact Algorithm for the Vehicle Routing Problem with Backhauls , 1997, Transp. Sci..
[8] K. Deb. An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .
[9] Kevin Kok Wai Wong,et al. Classification of adaptive memetic algorithms: a comparative study , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).
[10] Juan José Salazar González,et al. The multi-commodity one-to-one pickup-and-delivery traveling salesman problem , 2009, Eur. J. Oper. Res..
[11] Gilbert Laporte,et al. A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows , 2009, Eur. J. Oper. Res..
[12] Fanggeng Zhao,et al. Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem , 2009, Comput. Ind. Eng..
[13] Gilbert Laporte,et al. An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays , 2011, Discret. Appl. Math..
[14] Ruiyou Zhang,et al. A reactive tabu search algorithm for the multi-depot container truck transportation problem , 2009 .
[15] Yew-Soon Ong,et al. A proposition on memes and meta-memes in computing for higher-order learning , 2009, Memetic Comput..
[16] Anand Subramanian,et al. Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery , 2011, Oper. Res. Lett..
[17] Gilbert Laporte,et al. General solutions to the single vehicle routing problem with pickups and deliveries , 2007, Eur. J. Oper. Res..
[18] Michel Gendreau,et al. A branch‐and‐cut algorithm for the nonpreemptive swapping problem , 2009 .
[19] Juan José Salazar González,et al. A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery , 2004, Discret. Appl. Math..
[20] Belarmino Adenso-Díaz,et al. Environmental and reverse logistics policies in European bottling and packaging firms , 2004 .
[21] Juan José Salazar González,et al. On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands , 2009, Math. Program..
[22] Mauro Dell'Amico,et al. Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading , 2010, Comput. Oper. Res..
[23] Michel Gendreau,et al. Heuristics for the mixed swapping problem , 2010, Comput. Oper. Res..
[24] Gilbert Laporte,et al. Static pickup and delivery problems: a classification scheme and survey , 2007 .
[25] Michel Gendreau,et al. The Traveling Salesman Problem with Backhauls , 1996, Comput. Oper. Res..
[26] Rajeev Motwani,et al. Approximating Capacitated Routing and Delivery Problems , 1999, SIAM J. Comput..
[27] Gilbert Laporte,et al. The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm , 2009, Math. Program..
[28] Gilbert Laporte,et al. The single vehicle routing problem with deliveries and selective pickups , 2008, Comput. Oper. Res..
[29] Juan José Salazar González,et al. Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem , 2004, Transp. Sci..
[30] Richard F. Hartl,et al. A survey on pickup and delivery problems , 2008 .
[31] Abel García-Nájera. The Vehicle Routing Problem with Backhauls: A Multi-objective Evolutionary Approach , 2012, EvoCOP.
[32] G. Laporte,et al. A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading , 2010 .
[33] Gilbert Laporte,et al. Perturbation heuristics for the pickup and delivery traveling salesman problem , 2002, Comput. Oper. Res..
[34] Ruiyou Zhang,et al. Modeling and optimization of a container drayage problem with resource constraints , 2011 .
[35] William E. Hart,et al. Recent Advances in Memetic Algorithms , 2008 .
[36] Lawrence Davis,et al. Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.
[37] Daniele Vigo,et al. Heuristics for the traveling salesman problem with pickup and delivery , 1999, Comput. Oper. Res..
[38] Gilbert Laporte,et al. Rejoinder on: Static pickup and delivery problems: a classification scheme and survey , 2007 .
[39] Roberto Baldacci,et al. An Exact Algorithm for the Pickup and Delivery Problem with Time Windows , 2011, Oper. Res..
[40] Zhou Xu,et al. Ship routing problem with berthing time clash avoidance constraints , 2011 .
[41] Hsiao-Fan Wang,et al. A coevolutionary algorithm for the flexible delivery and pickup problem with time windows , 2013 .
[42] Yew-Soon Ong,et al. Memetic Computation—Past, Present & Future [Research Frontier] , 2010, IEEE Computational Intelligence Magazine.
[43] Juan José Salazar González,et al. The One-Commodity Pickup-and-Delivery Travelling Salesman Problem , 2001, Combinatorial Optimization.
[44] Shaligram Pokharel,et al. Strategic network design for reverse logistics and remanufacturing using new and old product modules , 2009, Comput. Ind. Eng..
[45] Gilbert Laporte,et al. The pickup and delivery traveling salesman problem with first-in-first-out loading , 2009, Comput. Oper. Res..
[46] Voratas Kachitvichyanukul,et al. A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery , 2009, Comput. Oper. Res..
[47] Gilbert Laporte,et al. A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem , 2010, Discret. Appl. Math..
[48] David E. Goldberg,et al. Designing Efficient Genetic and Evolutionary Algorithm Hybrids , 2005 .
[49] Refael Hassin,et al. The swapping problem , 1992, Networks.
[50] Harilaos N. Psaraftis,et al. A multi-commodity, capacitated pickup and delivery problem: The single and two-vehicle cases , 2011, Eur. J. Oper. Res..
[51] Gilbert Laporte,et al. Recent Models and Algorithms for One-to-One Pickup and Delivery Problems , 2008 .
[52] Zbigniew Michalewicz,et al. Handbook of Evolutionary Computation , 1997 .
[53] Jacques Renaud,et al. A heuristic for the pickup and delivery traveling salesman problem , 2000, Comput. Oper. Res..
[54] Martín Matamala,et al. The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method , 2010, Eur. J. Oper. Res..
[55] 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..
[56] Gena Hahn,et al. Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P-complete , 2009, Discret. Appl. Math..
[57] Gilbert Laporte,et al. Lasso solution strategies for the vehicle routing problem with pickups and deliveries , 2009, Eur. J. Oper. Res..
[58] Bernhard Sendhoff,et al. Lamarckian memetic algorithms: local optimum and connectivity structure analysis , 2009, Memetic Comput..
[59] Ivan Stojmenovic,et al. The one-commodity traveling salesman problem with selective pickup and delivery: An ant colony approach , 2010, IEEE Congress on Evolutionary Computation.
[60] Chung-Lun Li,et al. Dynamic Routing Model and Solution Methods for Fleet Management with Mobile Technologies , 2008 .
[61] Hisao Ishibuchi,et al. Special Issue on Memetic Algorithms , 2007, IEEE Trans. Syst. Man Cybern. Part B.
[62] Jean-Yves Potvin,et al. A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows , 1997, Transp. Sci..
[63] Jen S. Shang,et al. Multicriteria pickup and delivery problem with transfer opportunity , 1996 .
[64] Lúcia Maria de A. Drummond,et al. A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery , 2010, Comput. Oper. Res..
[65] Bülent Çatay,et al. A new saving-based ant algorithm for the Vehicle Routing Problem with Simultaneous Pickup and Delivery , 2010, Expert Syst. Appl..
[66] Richard F. Hartl,et al. A survey on pickup and delivery problems , 2008 .