A multi-agent approach for solving traveling salesman problem
From MaRDI portal
Publication:3445983
DOI10.1007/BF02829218zbMATH Open1127.90058MaRDI QIDQ3445983FDOQ3445983
Authors: Tiejun Zhou, Yihong Tan, Lining Xing
Publication date: 8 June 2007
Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)
Recommendations
- Distributed multi-agent system for solving traveling salesman problem using ant colony optimization
- Solving TSP with improved multi-Agent genetic algorithm
- scientific article; zbMATH DE number 2092224
- Solving travelling salesman problem using multiagent simulated annealing algorithm with instance-based sampling
- scientific article; zbMATH DE number 4104744
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
Cited In (8)
- Solving travelling salesman problem using multiagent simulated annealing algorithm with instance-based sampling
- Solving TSP with improved multi-Agent genetic algorithm
- Can the agent with limited information solve travelling salesman problem?
- Distributed multi-agent system for solving traveling salesman problem using ant colony optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The multiagent planning problem
This page was built for publication: A multi-agent approach for solving traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3445983)