A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem.
Ivan ZuljSergej KramerMichael SchneiderPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- tabu search
- metaheuristic
- vehicle routing problem
- scheduling problem
- simulated annealing
- job shop scheduling problem
- feasible solution
- initial solution
- heuristic methods
- path relinking
- optimization problems
- search procedure
- ant colony optimization
- combinatorial optimization problems
- test problems
- neural network
- quadratic assignment problem
- search algorithm
- multidimensional knapsack problem
- vehicle routing
- hybrid algorithm
- scatter search
- setup times
- flowshop
- single machine
- particle swarm optimization
- evolutionary algorithm
- search space
- genetic algorithm