A metaheuristic for the min-max windy rural postman problem with K vehicles.
Enrique BenaventÁngel CorberánJosé M. SanchisPublished in: Comput. Manag. Sci. (2010)
Keyphrases
- min max
- routing problem
- metaheuristic
- vehicle routing problem
- travel time
- scatter search
- tabu search
- simulated annealing
- ant colony optimization
- variable neighborhood search
- vehicle routing problem with time windows
- multiobjective optimization
- search space
- path relinking
- guided local search
- hybrid metaheuristic
- traveling salesman problem
- optimization problems
- combinatorial optimization
- iterated local search
- particle swarm optimization
- max min
- benchmark instances
- greedy randomized adaptive search procedure
- combinatorial problems
- optimal solution
- multi start
- genetic algorithm
- memetic algorithm
- harmony search
- nature inspired
- routing algorithm
- solution space
- traffic flow
- shortest path
- heuristic methods
- swarm intelligence
- multi objective