| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 475071 | Computers & Operations Research | 2015 | 9 Pages |
Abstract
We introduce the Multiple Traveling Salesmen and Districting Problem with Multi-periods and Multi-depots. In this problem, the compactness of the subdistricts, the dissimilarity measure of districts and an equity measure of salesmen profit are considered as part of the objective function, and the salesman travel cost on each subdistrict is approximated by the Beardwood–Halton–Hammersley formula. An adaptive large neighbourhood search metaheuristic is developed for the problem. It was tested on modified Solomon and Gehring & Homberger instances. Computational results confirm the effectiveness of the proposed metaheuristic.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Hongtao Lei, Gilbert Laporte, Yajie Liu, Tao Zhang,