The multiagent planning problem

DOI10.1155/2017/3813912zbMath1376.90049OpenAlexW2585469234WikidataQ59142891 ScholiaQ59142891MaRDI QIDQ2012788

Tamás Kalmár-Nagy, Bendegúz Dezso Bak, Giovanni Giardini

Publication date: 3 August 2017

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2017/3813912

zbMATH Keywords

ant colony optimizationmodified genetic algorithmgenetic algorithm inspired descent (GAID) methodmultiagent planning problemmultiple traveling salesmen problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

GAID

Uses Software

• Matlab
• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The increasing cost tree search for optimal multi-agent pathfinding
• Genetic algorithm for combinatorial path planning: the subtour problem
• The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
• A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
• The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem.
• The traveling salesman problem and its variations
• A new approach to solving the multiple traveling salesperson problem using genetic algorithms
• Integer linear programming formulations of multiple salesman problems and its variations
• A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM
• An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
• A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem
• TSPLIB—A Traveling Salesman Problem Library
• Technical Note—A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges
• Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem