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

Authors:
Yi-Feng Hung;Ching-Ping Chen;Chia-Chung Shih;Ming-Hsiau Hung
Affiliations:
Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu, Taiwan, ROC;Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu, Taiwan, ROC;Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu, Taiwan, ROC;Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu, Taiwan, ROC
Venue:
Computers and Industrial Engineering
Year:
2003

Citing 10
Cited 6

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
Determining lot sizes and resource requirements: A review

Operations Research
Capacitated lot sizing with setup times

Management Science
Tabu search and design optimization

Computer-Aided Design
Applying tabu search to the job-shop scheduling problem

Annals of Operations Research - Special issue on Tabu search
Tabu search

Modern heuristic techniques for combinatorial problems
Solving the single-item, capacitated dynamic lot-sizing problem with startup and reservation costs by tabu search

Computers and Industrial Engineering
Solving mixed integer programming production planning problems with setups by shadow price information

Computers and Operations Research
Material Requirements Planning: The New Way of Life in Production and Inventory Management

Material Requirements Planning: The New Way of Life in Production and Inventory Management
Tabu Search

Tabu Search

Integrating a shrimp-growth function, farming skills information, and a supply allocation algorithm to manage the shrimp supply chain

Computers and Electronics in Agriculture
Original paper: Should feed mills go beyond traditional least cost formulation?

Computers and Electronics in Agriculture
Tabu search to solve the synchronized and integrated two-level lot sizing and scheduling problem

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Annual production budget in the beverage industry

Engineering Applications of Artificial Intelligence
A hybrid VNS approach for the short-term production planning and scheduling: A case study in the pulp and paper industry

Computers and Operations Research
Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms

Discrete Event Dynamic Systems

Quantified Score

Hi-index	0.00

Visualization

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 also 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.