Variable Neighborhood Descent Branching Applied to the Green Electric Vehicle Routing Problem with Time Window and Mixed Fleet.
Thiago Muniz StehlingMarcone Jamilson Freitas SouzaSérgio Ricado D. E. de SouzaPublished in: ICVNS (2021)
Keyphrases
- vehicle routing problem
- iterated local search
- metaheuristic
- vehicle routing problem with time windows
- tabu search
- routing problem
- benchmark problems
- vehicle routing
- benchmark instances
- combinatorial optimization
- memetic algorithm
- logistics distribution
- particle swarm optimization
- path relinking
- variable neighborhood descent
- test instances
- travel time
- traveling salesman problem
- np hard
- multi start
- search algorithm
- search strategies