A two-phase local search with a discrete-event heuristic for the omnichannel vehicle routing problem.
Christopher BaylissLeandro do C. MartinsAngel A. JuanPublished in: Comput. Ind. Eng. (2020)
Keyphrases
- vehicle routing problem
- discrete event
- tabu search
- iterated local search
- combinatorial optimization
- metaheuristic
- dynamic systems
- neighborhood search
- simulated annealing
- benchmark instances
- memetic algorithm
- simulation model
- greedy randomized adaptive search procedure
- vehicle routing problem with time windows
- multi depot
- feasible solution
- multi start
- variable neighborhood search
- routing problem
- tree search algorithm
- test instances
- job shop scheduling problem
- discrete event simulation
- heuristic methods
- search procedure
- genetic algorithm
- vehicle routing
- hybrid metaheuristic
- traveling salesman problem
- search algorithm
- scheduling problem
- dynamical systems
- benchmark problems
- scatter search
- optimal solution
- search strategies
- timetabling problem
- travel time
- path relinking
- np hard
- search heuristics
- branch and bound
- information retrieval
- search space
- knapsack problem
- solution quality
- complex systems
- optimization problems
- special case
- hill climbing
- pick up and delivery