A tabu search approach to solving the picking routing problem for large- and medium-size distribution centres considering the availability of inventory and K heterogeneous material handling equipment.
Pablo CortésRodrigo Andrés Gómez MontoyaJesús MuñuzuriAlexander Alberto Correa EspinalPublished in: Appl. Soft Comput. (2017)
Keyphrases
- material handling
- routing problem
- tabu search
- vehicle routing problem
- medium size
- scatter search
- metaheuristic
- variable neighborhood search
- path relinking
- simulated annealing
- vehicle routing problem with time windows
- combinatorial optimization
- scheduling problem
- feasible solution
- production line
- memetic algorithm
- search algorithm
- search procedure
- genetic algorithm
- search algorithm for solving
- production system
- heuristic methods
- tabu search algorithm
- travel time
- job shop scheduling problem
- timetabling problem
- traveling salesman problem
- special case
- shortest path
- max sat
- ant colony optimization
- optimization problems
- np hard
- job shop
- exact solution
- search space
- candidate list
- neural network