A Variable Neighborhood Search Branching for the Electric Vehicle Routing Problem with Time Windows.
Maurizio BruglieriFerdinando PezzellaOrnella PisacaneStefano SuraciPublished in: Electron. Notes Discret. Math. (2015)
Keyphrases
- vehicle routing problem with time windows
- variable neighborhood search
- vehicle routing problem
- routing problem
- metaheuristic
- tabu search
- branch and bound
- traveling salesman problem
- heuristic methods
- benchmark problems
- combinatorial optimization
- exact algorithms
- column generation
- hyper heuristics
- optimal solution
- memetic algorithm
- path relinking
- simulated annealing
- travel time
- particle swarm optimization
- combinatorial optimization problems
- optimization problems
- scatter search
- np hard
- integer programming
- ant colony optimization
- upper bound
- minimum spanning tree
- search strategies
- shortest path
- search space