Name
Abstract | ||
|---|---|---|
We present the multi-period orienteering problem with multiple time windows (MuPOPTW), a new routing problem combining objective and constraints of the orienteering problem (OP) and team orienteering problem (TOP), constraints from standard vehicle routing problems, and original constraints from a real-world application. The problem itself comes from a real industrial case. Specific route duration constraints result in a route feasibility subproblem. We propose an exact algorithm for this subproblem, and we embed it in a variable neighborhood search method to solve the whole routing problem. We then provide experimental results for this method. We compare them to a commercial solver. We also adapt our method to standard benchmark OP and TOP instances, and provide comparative tables with state-of-the-art algorithms. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.cor.2009.05.012 | Computers & OR |
Keywords | DocType | Volume |
standard benchmark OP,standard vehicle,variable neighborhood search method,whole routing problem,multi-period orienteering problem,new routing problem,orienteering problem,multiple time windows,TOP instance,route feasibility subproblem,specific route duration constraint | Journal | 37 |
Issue | ISSN | Citations |
2 | Computers and Operations Research | 62 |
PageRank | References | Authors |
2.07 | 17 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fabien Tricoire | 1 | 216 | 12.45 |
| Martin Romauch | 2 | 72 | 5.42 |
| Karl F Doerner | 3 | 1235 | 62.24 |
| Richard F. Hartl | 4 | 1863 | 137.30 |