Variable Neighborhood Descent for Multi-Compartment and Multi-Objective Vehicle Routing Problem in Refined Product Distribution.
Xuping WangWenping FanHongxin ZhanZilai SunPublished in: Asia Pac. J. Oper. Res. (2022)
Keyphrases
- vehicle routing problem
- multi objective
- iterated local search
- variable neighborhood descent
- metaheuristic
- particle swarm optimization
- tabu search
- multi start
- path relinking
- vehicle routing problem with time windows
- discrete particle swarm optimization
- evolutionary algorithm
- variable neighborhood search
- routing problem
- optimization algorithm
- benchmark problems
- benchmark instances
- genetic algorithm
- optimization problems
- multi objective optimization
- travel time
- traveling salesman problem
- np hard
- ant colony optimization
- memetic algorithm
- test instances
- scatter search
- knapsack problem
- simulated annealing
- objective function
- combinatorial optimization
- search strategies
- nsga ii
- heuristic methods
- search procedures
- reinforcement learning
- optimal solution
- search space
- job shop scheduling problem
- search procedure
- solution space