A Variable Neighborhood Search Approach for Solving the Generalized Vehicle Routing Problem.
Petrica C. PopLevente FukszAndrei Horvat MarcPublished in: HAIS (2014)
Keyphrases
- vehicle routing problem
- variable neighborhood search
- combinatorial optimization
- metaheuristic
- hybrid metaheuristic
- tabu search
- routing problem
- benchmark instances
- traveling salesman problem
- neighborhood search
- vehicle routing problem with simultaneous
- particle swarm optimization
- travel time
- benchmark problems
- test instances
- combinatorial optimization problems
- single machine scheduling problem
- simulated annealing
- memetic algorithm
- genetic algorithm
- scatter search
- np hard
- heuristic methods
- optimization problems
- path relinking
- test problems
- combinatorial problems
- hybrid method
- search procedure
- branch and bound
- ant colony optimization
- wireless sensor networks
- cost function