A BRKGA with Implicit Path-Relinking for the Vehicle Routing Problem with Occasional Drivers and Time Windows.
Paola FestaFrancesca GuerrieroMauricio G. C. ResendeEdoardo ScalzoPublished in: MIC (2022)
Keyphrases
- vehicle routing problem
- path relinking
- tabu search
- metaheuristic
- traveling salesman problem
- scatter search
- vehicle routing
- simulated annealing
- combinatorial optimization
- greedy randomized adaptive search procedure
- test instances
- routing problem
- ant colony optimization
- multi start
- neighborhood search
- optimization problems
- benchmark instances
- search procedure
- hybrid metaheuristic
- memetic algorithm
- iterated local search
- scheduling problem
- nature inspired
- vehicle routing problem with time windows
- feasible solution
- search algorithm
- travel time
- variable neighborhood search
- optimal solution
- genetic algorithm
- search space
- heuristic methods
- test problems
- particle swarm optimization
- search methods
- solution space
- swarm intelligence
- benchmark problems
- constraint satisfaction
- computational efficiency
- pick up and delivery
- np hard