A metaheuristic for the min–max windy rural postman problem with K vehicles
Year of publication: |
2010
|
---|---|
Authors: | Benavent, Enrique ; Corberán, Ángel ; Sanchis, José |
Published in: |
Computational Management Science. - Springer. - Vol. 7.2010, 3, p. 269-287
|
Publisher: |
Springer |
Subject: | Rural postman problem | Windy rural postman problem | Metaheuristics | Multivehicles |
-
A branch-and-cut algorithm for the profitable windy rural postman problem
Ávila, Thais, (2016)
-
A hybrid heuristic procedure for the Windy Rural Postman Problem with Zigzag Time Windows
Lum, Oliver, (2017)
-
The windy rural postman problem with a time-dependent zigzag option
Nossack, Jenny, (2017)
- More ...
-
Profitable mixed capacitated arc routing and related problems
Benavent, Enrique, (2015)
-
Profitable mixed capacited arc routing and related problems
Benavent, Enrique, (2015)
-
The periodic rural postman problem with irregular services on mixed graphs
Benavent, Enrique, (2019)
- More ...