A Decomposition-Based Local Search for Large-Scale Many-Objective Vehicle Routing Problems With Simultaneous Delivery and Pickup and Time Windows.
Ying ZhouLingjing KongYiqiao CaiZiyan WuShaopeng LiuJiaming HongKeke WuPublished in: IEEE Syst. J. (2020)
Keyphrases
- vehicle routing problem
- tabu search
- memetic algorithm
- vehicle routing problem with simultaneous
- combinatorial optimization
- neighborhood search
- vehicle routing
- metaheuristic
- greedy randomized adaptive search procedure
- simulated annealing
- vehicle routing problem with time windows
- test instances
- routing problem
- travel time
- benchmark instances
- traveling salesman problem
- benchmark problems
- search strategies
- search algorithm
- multi depot
- genetic algorithm
- waste collection
- guided local search
- job shop scheduling problem
- variable neighborhood search
- np hard
- search space
- particle swarm optimization
- global search
- knapsack problem
- path relinking
- pick up and delivery
- feasible solution
- optimization problems
- neural network
- heuristic methods
- search procedure
- branch and bound
- shortest path
- genetic programming
- evolutionary algorithm