Multi-vehicle selective pickup and delivery using metaheuristic algorithms
暂无分享,去创建一个
[1] Dr. Zbigniew Michalewicz,et al. How to Solve It: Modern Heuristics , 2004 .
[2] Gilbert Laporte,et al. A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem , 2010, Discret. Appl. Math..
[3] G. Clarke,et al. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .
[4] Kay Chen Tan,et al. A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems , 2006, Eur. J. Oper. Res..
[5] I H Osman,et al. Meta-Heuristics Theory and Applications , 2011 .
[6] Lawrence Davis,et al. Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.
[7] Michel Gendreau,et al. Heuristics for the mixed swapping problem , 2010, Comput. Oper. Res..
[8] Gilbert Laporte,et al. Lasso solution strategies for the vehicle routing problem with pickups and deliveries , 2009, Eur. J. Oper. Res..
[9] Kay Chen Tan,et al. Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation , 2007, Eur. J. Oper. Res..
[10] Sophie N. Parragh,et al. A survey on pickup and delivery problems Part I : Transportation between customers and depot , 2007 .
[11] Munther A. Dahleh,et al. A Dynamic Pickup and Delivery Problem in Mobile Networks Under Information Constraints , 2008, IEEE Transactions on Automatic Control.
[12] Jun Zhang,et al. Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm Optimization Approach , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).
[13] Xia Li,et al. A novel hybrid shuffled frog leaping algorithm for vehicle routing problem with time windows , 2015, Inf. Sci..
[14] F. Glover. HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .
[15] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.
[16] Gilbert Laporte,et al. The single vehicle routing problem with deliveries and selective pickups , 2008, Comput. Oper. Res..
[17] Seyed Reza Hejazi,et al. A novel hybrid column generation-metaheuristic approach for the vehicle routing problem with general soft time window , 2015, Inf. Sci..
[18] Ismail Karaoglan,et al. A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery , 2013, Comput. Ind. Eng..
[19] Xavier Gandibleux,et al. A heuristic two‐phase solution approach for the multi‐objective dial‐a‐ride problem , 2009, Networks.
[20] Houkuan Huang,et al. An Ant Colony System Based Heuristic Algorithm for the Vehicle Routing Problem with Simultaneous Delivery and Pickup , 2007, 2007 2nd IEEE Conference on Industrial Electronics and Applications.
[21] Paolo Toth,et al. VRP with Backhauls , 2002, The Vehicle Routing Problem.
[22] Roberto Baldacci,et al. An Exact Algorithm for the Pickup and Delivery Problem with Time Windows , 2011, Oper. Res..
[23] Michel Gendreau,et al. A branch‐and‐cut algorithm for the preemptive swapping problem , 2012, Networks.
[24] Nubia Velasco,et al. A non-dominated sorting genetic algorithm for a bi-objective pick-up and delivery problem , 2012 .
[25] Zbigniew Michalewicz,et al. Variants of Evolutionary Algorithms for Real-World Applications , 2011, Variants of Evolutionary Algorithms for Real-World Applications.
[26] Gilbert Laporte,et al. A tabu search heuristic and adaptive memory procedure for political districting , 2003, Eur. J. Oper. Res..
[27] Burak Eksioglu,et al. The vehicle routing problem: A taxonomic review , 2009, Comput. Ind. Eng..
[28] Gilbert Laporte,et al. Static pickup and delivery problems: a classification scheme and survey , 2007 .
[29] Zhen Ji,et al. A multi-objective memetic algorithm based on locality-sensitive hashing for one-to-many-to-one dynamic pickup-and-delivery problem , 2016, Inf. Sci..
[30] Christian Artigues,et al. Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation , 2011, Comput. Oper. Res..
[31] Paolo Toth,et al. The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.
[32] Richard F. Hartl,et al. A survey on pickup and delivery problems , 2008 .
[33] Chuan-Kang Ting,et al. The selective pickup and delivery problem: Formulation and a memetic algorithm , 2013 .
[34] Jorge Valenzuela,et al. Scheduling a log transport system using simulated annealing , 2014, Inf. Sci..
[35] Gilbert Laporte,et al. One-to-Many-to-One Single Vehicle Pickup and Delivery Problems , 2008 .
[36] Shoshana Anily,et al. Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries , 1999 .
[37] Govindan Kannan,et al. Issues in reverse supply chain, part III: classification and simple analysis , 2009 .
[38] Manuel Laguna,et al. Tabu Search , 1997 .
[39] 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.
[40] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.
[41] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[42] David Naso,et al. Multicriteria meta-heuristics for AGV dispatching control based on computational intelligence , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).
[43] Daniele Vigo,et al. Chapter 6 Vehicle Routing , 2007, Transportation.
[44] 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..
[45] Kay Chen Tan,et al. A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows , 2003, Comput. Optim. Appl..
[46] Barrie M. Baker,et al. A genetic algorithm for the vehicle routing problem , 2003, Comput. Oper. Res..
[47] F. Glover,et al. Fundamentals of Scatter Search and Path Relinking , 2000 .
[48] Paolo Toth,et al. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..
[49] Che-Fu Hsueh,et al. The Linehaul-Feeder Vehicle Routing Problem With Virtual Depots , 2011, IEEE Transactions on Automation Science and Engineering.
[50] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[51] Shengxiang Yang,et al. Ant algorithms with immigrants schemes for the dynamic vehicle routing problem , 2015, Inf. Sci..
[52] Daniele Vigo,et al. The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs , 2010, Transp. Sci..
[53] Govindan Kannan,et al. Issues in reverse supply chains, part II: reverse distribution issues – an overview , 2008 .
[54] Haiyan Cao,et al. A dynamic vehicle routing problem with backhaul and time window , 2008, 2008 IEEE International Conference on Service Operations and Logistics, and Informatics.
[55] Juan José Salazar González,et al. The One-Commodity Pickup-and-Delivery Travelling Salesman Problem , 2001, Combinatorial Optimization.
[56] Shigenobu Kobayashi,et al. Guided Ejection Search for the Pickup and Delivery Problem with Time Windows , 2010, EvoCOP.
[57] Nasser R. Sabar,et al. Meta-harmony search algorithm for the vehicle routing problem with time windows , 2015, Inf. Sci..
[58] Henry C. W. Lau,et al. Application of Genetic Algorithms to Solve the Multidepot Vehicle Routing Problem , 2010, IEEE Transactions on Automation Science and Engineering.
[59] Yew-Soon Ong,et al. A Conceptual Modeling of Meme Complexes in Stochastic Search , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).
[60] John B. Shoven,et al. I , Edinburgh Medical and Surgical Journal.
[61] Gilbert Laporte,et al. Recent Models and Algorithms for One-to-One Pickup and Delivery Problems , 2008 .
[62] Sophie N. Parragh,et al. A heuristic two-phase solution approach for the multi-objective dial-a-ride problem , 2009 .
[63] Goran Martinović,et al. Single-Commodity Vehicle Routing Problem with Pickup and Delivery Service , 2008 .
[64] Vahid Kayvanfar,et al. Enhanced intelligent water drops and cuckoo search algorithms for solving the capacitated vehicle routing problem , 2016, Inf. Sci..
[65] Richard F. Hartl,et al. A survey on pickup and delivery problems , 2008 .
[66] Billy E. Gillett,et al. A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..
[67] 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..
[68] A. E. Eiben,et al. Introduction to Evolutionary Computing , 2003, Natural Computing Series.
[69] P. N. Suganthan,et al. Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization , 2009, IEEE Transactions on Evolutionary Computation.
[70] Stefan Ropke,et al. The Pickup and Delivery Problem with Cross-Docking Opportunity , 2011, ICCL.