Can the agent with limited information solve travelling salesman problem?

DOI10.1155/2017/9562125zbMath1367.90095OpenAlexW2605641102WikidataQ59142967 ScholiaQ59142967MaRDI QIDQ2012868

Tomoko Sakiyama, Ikuo Arizono

Publication date: 3 August 2017

Published in: Complexity (Search for Journal in Brave)

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

zbMATH Keywords

heuristic algorithmsymmetric TSPasymmetric TSP (time-dependent TSP)Travelling Salesman Problem (TSP)

Mathematics Subject Classification ID

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

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
• Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP
• A new rank based version of the ant system. -- A computational study
• Some Simple Applications of the Travelling Salesman Problem
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: Can the agent with limited information solve travelling salesman problem?