A hybrid algorithm for time-dependent vehicle routing problem with soft time windows and stochastic factors.
Ke Wei JieSan-Yang LiuXiao Jun SunPublished in: Eng. Appl. Artif. Intell. (2022)
Keyphrases
- vehicle routing problem
- hybrid algorithm
- tabu search
- travel time
- particle swarm optimization
- metaheuristic
- simulated annealing
- vehicle routing
- ant colony optimization
- memetic algorithm
- routing problem
- benchmark problems
- test instances
- vehicle routing problem with time windows
- hybrid method
- benchmark instances
- genetic algorithm
- scheduling problem
- traveling salesman problem
- search algorithm
- combinatorial optimization
- optimal solution
- hybrid metaheuristic
- path relinking
- test problems
- particle swarm optimization pso
- optimization method
- artificial bee colony algorithm
- standard test problems
- search procedure
- np hard
- pso algorithm
- differential evolution
- scatter search
- hybrid optimization algorithm
- multi depot
- job shop scheduling problem
- global optimization
- particle swarm optimization algorithm
- imperialist competitive algorithm
- multi objective
- ant colony optimization algorithm
- artificial neural networks
- computational complexity
- search space
- initial population
- search methods
- swarm intelligence