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.
| Original language | English |
|---|---|
| Pages (from-to) | 84-92 |
| Number of pages | 9 |
| Journal | Computers and Operations Research |
| Volume | 56 |
| DOIs | |
| Publication status | Published - Apr 2015 |
Funding
This work was partly supported by the Canadian Natural Sciences and Engineering Research Council under Grant No. 39682-10 , by the Chinese National Natural Science Foundation under Grant Nos. 71201170 and 71371181 , and by the Hunan Provincial Natural Science Foundation of China under Grant No. 13JJ4010 , and by the Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No. 20124307120024 . This support is gratefully acknowledged. Thanks are due to the referees for their valuable comments.
Keywords
- Adaptive large neighbourhood search
- Districting
- Traveling salesman
ASJC Scopus subject areas
- General Computer Science
- Modelling and Simulation
- Management Science and Operations Research