An improved tabu search approach with mixed objective function for one-dimensional cutting stock problems.
Chien-Tung YangTso-Chung SungWei-Chu WengPublished in: Adv. Eng. Softw. (2006)
Keyphrases
- tabu search
- cutting stock problems
- feasible solution
- objective function
- metaheuristic
- hyper heuristics
- multiple objectives
- optimization problems
- simulated annealing
- scheduling problem
- search procedure
- path relinking
- heuristic methods
- optimal solution
- memetic algorithm
- multi objective
- test problems
- vehicle routing problem
- search algorithm
- hybrid algorithm
- tabu search algorithm
- genetic algorithm
- iterated local search
- lower bound
- job shop scheduling problem
- benchmark instances
- search heuristics
- solution quality
- scatter search
- cost function
- solution space
- multi start
- constrained optimization
- quadratic assignment problem
- multidimensional knapsack problem
- tabu list
- search methods
- vehicle routing problem with time windows
- greedy algorithm
- evolutionary algorithm
- combinatorial optimization
- initial solution
- np hard
- state space
- computational complexity
- linear programming
- particle swarm optimization
- ant colony optimization
- neural network