You are currently offline. Some features of the site may not work correctly.

Corpus ID: 210859476

Closed form distance formula for the balanced multiple travelling salesmen

@article{Garn2020ClosedFD,
title={Closed form distance formula for the balanced multiple travelling salesmen},
author={W. Garn},
journal={ArXiv},
year={2020},
volume={abs/2001.07749}
}

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