The Vehicle Routing Problem with Cross-Docking and Scheduling at the Docking Station: Compact formulation and a General Variable Neighborhood Search metaheuristic.
Vitor A. A. SouzaRafael A. MeloGeraldo R. MateusPublished in: Appl. Soft Comput. (2024)
Keyphrases
- vehicle routing problem
- metaheuristic
- variable neighborhood search
- hybrid metaheuristic
- tabu search
- benchmark instances
- routing problem
- simulated annealing
- special case
- ant colony optimization
- optimization problems
- combinatorial optimization problems
- scatter search
- metaheuristic algorithms
- path relinking
- optimal solution
- travel time
- particle swarm optimization
- vehicle routing problem with time windows
- iterated local search
- benchmark problems
- combinatorial optimization
- scheduling problem
- search space
- memetic algorithm
- traveling salesman problem
- genetic algorithm
- search methods
- combinatorial problems
- test instances
- np hard
- heuristic methods
- solution space
- hybrid method
- nature inspired
- greedy randomized adaptive search procedure
- search procedure
- feasible solution
- single machine scheduling problem
- test problems
- flowshop
- hybrid algorithm
- knapsack problem
- multi objective
- computational complexity
- objective function