Using tabu search with ranking candidate list to solve production planning problems with setups

Using tabu search with ranking candidate list to solve production planning problems with setups

0.00 Avg rating0 Votes
Article ID: iaor20041995
Country: Netherlands
Volume: 45
Issue: 4
Start Page Number: 615
End Page Number: 634
Publication Date: Dec 2003
Journal: CIE
Authors: , , ,
Keywords: programming: integer
Abstract:

This study considers production planning problems involving multiple products, multiple resources, multiple periods, setup times, and setup costs. It can be formulated as a mixed integer program (MIP). Solving a realistic MIP production planning problem is NP-hard; therefore, we use tabu search methods to solve such a difficult problem, Furthermore, we improve tabu search by a new candidate list strategy, which sorts the neighbor solutions using post-optimization information provided by the final tableau of the linear programming simplex algorithm. A neighbor solution with higher priority in the ranking sequence has a higher probability of being the best neighbor solution of a current solution. According to our experiments, the proposed candidate list strategy tabu search produces a good solution faster than the traditional simple tabu search. This study suggests that if the evaluation of the entire neighborhood space in a tabu search algorithm takes too much computation and if an efficient and effective heuristic to rank the neighbor solutions can be developed, the speed of tabu search algorithm could be significantly increased by using the proposed candidate list strategy.

Reviews

Required fields are marked *. Your email address will not be published.