Constrained Probability Collectives: A Heuristic Approach

This chapter discusses an approach of handling the constraints in which the problem specific information is explicitly used.

[1]  Luca Maria Gambardella,et al.  MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .

[2]  G. Pawley,et al.  On the stability of the Travelling Salesman Problem algorithm of Hopfield and Tank , 2004, Biological Cybernetics.

[3]  Paolo Toth,et al.  Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..

[4]  Lixin Tang,et al.  A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex , 2000, Eur. J. Oper. Res..

[5]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[6]  L. Dubins.  On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

[7]  Jean-Yves Potvin,et al.  A Review of Bio-inspired Algorithms for Vehicle Routing , 2009, Bio-inspired Algorithms for the Vehicle Routing Problem.

[8]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

[9]  Bruce L. Golden,et al.  Two generalizations of the traveling salesman problem , 1981 .

[10]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[11]  Lawrence Bodin,et al.  PLANNING FOR TRUCK FLEET SIZE IN THE PRESENCE OF A COMMON‐CARRIER OPTION , 1983 .

[12]  Gilbert Laporte,et al.  The multi-depot vehicle routing problem with inter-depot routes , 2007, Eur. J. Oper. Res..

[13]  P.T. Kabamba,et al.  Path planning for cooperative time-optimal information collection , 2008, 2008 American Control Conference.

[14]  Kang Tai,et al.  Probability Collectives: A distributed optimization approach for constrained problems , 2010, IEEE Congress on Evolutionary Computation.

[15]  G. Laporte.  The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[16]  Mandell Bellmore,et al.  Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem , 1974, JACM.

[17]  Gilbert Laporte,et al.  A Cutting Planes Algorithm for the m-Salesmen Problem , 1980 .

[18]  David E. Goldberg,et al.  AllelesLociand the Traveling Salesman Problem , 1985, ICGA.

[19]  John Pooley,et al.  Integrated Production and Distribution Facility Planning at Ault Foods , 1994 .

[20]  Bruce L. Golden,et al.  Solving vehicle routing problems using elastic nets , 1994, Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94).

[21]  Raja Sengupta,et al.  A Resource Allocation Algorithm for Multivehicle Systems With Nonholonomic Constraints , 2007, IEEE Transactions on Automation Science and Engineering.

[22]  Richard F. Hartl,et al.  Applying the ANT System to the Vehicle Routing Problem , 1999 .

[23]  Martin W. P. Savelsbergh,et al.  The General Pickup and Delivery Problem , 1995, Transp. Sci..

[24]  Donald D. Eisenstein,et al.  Garbage Collection in Chicago: A Dynamic Scheduling Model , 1997 .

[25]  Ibrahim H. Osman,et al.  Self-organizing feature maps for the vehicle routing problem with backhauls , 2006, J. Sched..

[26]  Louis M. Dalberto,et al.  Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer , 1983 .

[27]  Jan Karel Lenstra,et al.  Some Simple Applications of the Travelling Salesman Problem , 1975 .

[28]  Gilbert Laporte,et al.  A tabu search heuristic for the multi-depot vehicle routing problem , 1996, Comput. Oper. Res..

[29]  Takao Enkawa,et al.  Competition-based neural network for the multiple travelling salesmen problem with minmax objective , 1999, Comput. Oper. Res..

[30]  P. J. Cassidy,et al.  TRAMP-A MULTI-DEPOT VEHICLE SCHEDULING SYSTEM , 1972 .

[31]  Beatrice M. Ombuki-Berman,et al.  Using Genetic Algorithms for Multi-depot Vehicle Routing , 2009, Bio-inspired Algorithms for the Vehicle Routing Problem.

[32]  Michel Gendreau,et al.  Vehicle Routeing with Multiple Use of Vehicles , 1996 .

[33]  S. Darbha,et al.  A lagrangian-based algorithm for a combinatorial motion planning problem , 2007, CDC 2007.

[34]  Tal Shima,et al.  Assigning Micro UAVs to Task Tours in an Urban Terrain , 2006, IEEE Transactions on Control Systems Technology.

[35]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.

[36]  Pan Junjie,et al.  An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem , 2006, First International Conference on Innovative Computing, Information and Control - Volume I (ICICIC'06).

[37]  Kang Tai,et al.  Probability Collectives: A multi-agent approach for solving combinatorial optimization problems , 2010, Appl. Soft Comput..

[38]  Marc Reimann,et al.  Comparing backhauling strategies in vehicle routing using Ant Colony Optimization , 2006, Central Eur. J. Oper. Res..

[39]  Jean-François Cordeau,et al.  VRP with Time Windows , 1999, The Vehicle Routing Problem.

[40]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[41]  J. Svestka,et al.  Computational Experience with an M-Salesman Traveling Salesman Algorithm , 1973 .

[42]  Saïd Salhi,et al.  Genetic clustering: An adaptive heuristic for the multidepot vehicle routing problem , 2001 .

[43]  Cliff T. Ragsdale,et al.  Scheduling pre-printed newspaper advertising inserts using genetic algorithms , 2002 .

[44]  Gen-ke Yang,et al.  Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem , 2006 .

[45]  Rakesh Nagi,et al.  Priority-based assignment and routing of a fleet of unmanned combat aerial vehicles , 2008, Comput. Oper. Res..

[46]  Dang Vu Tung,et al.  Vehicle routing-scheduling for waste collection in Hanoi , 2000, Eur. J. Oper. Res..

[47]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[48]  Richard Durbin,et al.  An analogue approach to the travelling salesman problem using an elastic net method , 1987, Nature.

[49]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[50]  Christos H. Papadimitriou,et al.  The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..

[51]  Qing Zhu,et al.  An Improved Particle Swarm Optimization Algorithm for Vehicle Routing Problem with Time Windows , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[52]  Hussain Aziz Saleh,et al.  The design of the global navigation satellite system surveying networks using genetic algorithms , 2004, Eng. Appl. Artif. Intell..

[53]  Roberto Cordone,et al.  A heuristic approach to the overnight security service problem , 2003, Comput. Oper. Res..

[54]  R. C. Mann,et al.  An extension of the Hopfield-Tank model for solution of the multiple traveling salesmen problem , 1988, IEEE 1988 International Conference on Neural Networks.

[55]  P. Miliotis,et al.  Using cutting planes to solve the symmetric Travelling Salesman problem , 1978, Math. Program..

[56]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.