Vehicle routing problem with uniform private fleet and common carrier: a node subset heuristic.
Jan PelikánPetr StouracOndrej SokolPublished in: Central Eur. J. Oper. Res. (2022)
Keyphrases
- vehicle routing problem
- tabu search
- benchmark instances
- multi depot
- test instances
- tree search algorithm
- combinatorial optimization
- metaheuristic
- iterated local search
- variable neighborhood search
- vehicle routing
- routing problem
- simulated annealing
- travel time
- neighborhood search
- hybrid metaheuristic
- benchmark problems
- memetic algorithm
- vehicle routing problem with time windows
- traveling salesman problem
- greedy randomized adaptive search procedure
- np hard
- search strategies
- search algorithm
- scatter search
- timetabling problem
- knapsack problem
- path relinking
- feasible solution
- logistics distribution
- particle swarm optimization
- optimal solution
- heuristic methods
- scheduling problem
- dynamic programming
- job shop scheduling problem
- vehicle routing problem with simultaneous
- search procedure
- exact algorithms
- genetic algorithm
- search methods
- ant colony optimization
- optimization problems
- special case
- objective function