Name
Title | ||
|---|---|---|
Solving the team orienteering problem with time windows and mandatory visits by multi-start simulated annealing. |
Abstract | ||
|---|---|---|
•The team orienteering problem with time windows and mandatory visits (TOPTW-MV) is introduced.•A mathematical programming model of TOPTW-MV is formulated.•A multi-start simulated annealing (MSA) algorithm is proposed for solving TOPTW-MV.•Computational study shows that the proposed MSA effectively solves TOPTW-MV. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.cie.2017.10.020 | Computers & Industrial Engineering |
Keywords | Field | DocType |
Simulated annealing,Team orienteering problem,Mandatory visit,Time window,Multi-start | Simulated annealing,Artificial bee colony algorithm,Heuristic,Mathematical optimization,Orienteering,Engineering,Operations management | Journal |
Volume | Issue | ISSN |
114 | C | 0360-8352 |
Citations | PageRank | References |
2 | 0.36 | 29 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shih-Wei Lin | 1 | 123 | 8.43 |
| Vincent F. Yu | 2 | 424 | 27.32 |