Tabu search and lower bounds for a combined production-transportation problem.
Alessandro CondottaSigrid KnustDimitri MeierNatalia V. ShakhlevichPublished in: Comput. Oper. Res. (2013)
Keyphrases
- tabu search
- transportation problem
- lower bound
- quadratic assignment problem
- max sat
- metaheuristic
- simulated annealing
- fixed charge
- scheduling problem
- memetic algorithm
- path relinking
- feasible solution
- upper bound
- heuristic methods
- search algorithm
- genetic algorithm
- search procedure
- integer programming
- vehicle routing problem
- optimal solution
- hybrid algorithm
- multi start
- tabu search algorithm
- iterated local search
- job shop scheduling problem
- np hard
- scatter search
- benchmark instances
- initial solution
- search algorithm for solving
- branch and bound algorithm
- branch and bound
- candidate list
- production planning
- lower and upper bounds
- neural network
- flowshop
- combinatorial optimization
- cutting plane
- approximation algorithms