Corpus ID: 210859476

Closed form distance formula for the balanced multiple travelling salesmen

  title={Closed form distance formula for the balanced multiple travelling salesmen},
  author={W. Garn},
  • W. Garn
  • Published 2020
  • Mathematics, Computer Science
  • ArXiv
As a first contribution the mTSP is solved using an exact method and two heuristics, where the number of nodes per route is balanced. The first heuristic uses a nearest node approach and the second assigns the closest vehicle (salesman). A comparison of heuristics with test-instances being in the Euclidean plane showed similar solution quality and runtime. On average, the nearest node solutions are approximately one percent better. The closest vehicle heuristic is especially important when the… Expand
1 Citations
Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations
  • W. Garn
  • Computer Science, Mathematics
  • ArXiv
  • 2020
  • PDF


Two metaheuristic approaches for the multiple traveling salesperson problem
  • 56
The multiple traveling salesman problem: an overview of formulations and solution procedures
  • 824
  • PDF
A Cutting Planes Algorithm for the m-Salesmen Problem
  • 120
Exact Solution of Multiple Traveling Salesman Problem
  • 29
A Grouping Genetic Algorithm for the Multiple Traveling Salesperson Problem
  • 43
Research on MTSP Problem based on Simulated Annealing
  • 1
A comparative study of improved GA and PSO in solving multiple traveling salesmen problem
  • 47
An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
  • 115
Integer linear programming formulations of multiple salesman problems and its variations
  • 140
  • PDF