A Multi-Start Split based Path Relinking (MSSPR) approach for the vehicle routing problem with route balancing.
Philippe LacommeChristian PrinsCaroline ProdhonLibo RenPublished in: Eng. Appl. Artif. Intell. (2015)
Keyphrases
- multi start
- path relinking
- vehicle routing problem
- tabu search
- metaheuristic
- travel time
- pick up and delivery
- vehicle routing problem with simultaneous
- traveling salesman problem
- vehicle routing problem with time windows
- scatter search
- greedy randomized adaptive search procedure
- iterated local search
- simulated annealing
- nature inspired
- routing problem
- combinatorial optimization
- hybrid metaheuristic
- memetic algorithm
- ant colony optimization
- feasible solution
- optimization problems
- search procedure
- search space
- optimal solution
- genetic algorithm
- search algorithm
- solution space
- heuristic methods
- test problems
- scheduling problem
- variable neighborhood search
- search methods
- max min
- reinforcement learning
- hyper heuristics
- evolutionary algorithm
- road network
- shortest path
- particle swarm optimization