A tabu search algorithm for solving economic lot scheduling problem

S. A. Raza; A. Akgunduz; M. Y. Chen

doi:10.1007/s10732-006-6017-7

A tabu search algorithm for solving economic lot scheduling problem

S. A. Raza, A. Akgunduz^*, M. Y. Chen

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

21 Citations (Scopus)

Abstract

The economic lot scheduling problem has driven considerable amount of research. The problem is NP-hard and recent research is focused on finding heuristic solutions rather than searching for optimal solutions. This paper introduces a heuristic method using a tabu search algorithm to solve the economic lot scheduling problem. Diversification and intensification schemes are employed to improve the efficiency of the proposed Tabu search algorithm. Experimental design is conducted to determine the best operating parameters for the Tabu search. Results show that the tabu search algorithm proposed in this paper outperforms two well known benchmark algorithms.

Original language	English
Pages (from-to)	413-426
Number of pages	14
Journal	Journal of Heuristics
Volume	12
Issue number	6
DOIs	https://doi.org/10.1007/s10732-006-6017-7
Publication status	Published - Dec 2006
Externally published	Yes

Keywords

Economic lot scheduling problem
Neighborhood search and design of experiment
Tabu search

ASJC Scopus subject areas

Software
Information Systems
Computer Networks and Communications
Control and Optimization
Management Science and Operations Research
Artificial Intelligence

Access to Document

10.1007/s10732-006-6017-7

Cite this

@article{8694717683e3418c902bf9d7637a79c8,

title = "A tabu search algorithm for solving economic lot scheduling problem",

abstract = "The economic lot scheduling problem has driven considerable amount of research. The problem is NP-hard and recent research is focused on finding heuristic solutions rather than searching for optimal solutions. This paper introduces a heuristic method using a tabu search algorithm to solve the economic lot scheduling problem. Diversification and intensification schemes are employed to improve the efficiency of the proposed Tabu search algorithm. Experimental design is conducted to determine the best operating parameters for the Tabu search. Results show that the tabu search algorithm proposed in this paper outperforms two well known benchmark algorithms.",

keywords = "Economic lot scheduling problem, Neighborhood search and design of experiment, Tabu search",

author = "Raza, {S. A.} and A. Akgunduz and Chen, {M. Y.}",

year = "2006",

month = dec,

doi = "10.1007/s10732-006-6017-7",

language = "English",

volume = "12",

pages = "413--426",

journal = "Journal of Heuristics",

issn = "1381-1231",

publisher = "Springer Netherlands",

number = "6",

}

TY - JOUR

T1 - A tabu search algorithm for solving economic lot scheduling problem

AU - Raza, S. A.

AU - Akgunduz, A.

AU - Chen, M. Y.

PY - 2006/12

Y1 - 2006/12

N2 - The economic lot scheduling problem has driven considerable amount of research. The problem is NP-hard and recent research is focused on finding heuristic solutions rather than searching for optimal solutions. This paper introduces a heuristic method using a tabu search algorithm to solve the economic lot scheduling problem. Diversification and intensification schemes are employed to improve the efficiency of the proposed Tabu search algorithm. Experimental design is conducted to determine the best operating parameters for the Tabu search. Results show that the tabu search algorithm proposed in this paper outperforms two well known benchmark algorithms.

AB - The economic lot scheduling problem has driven considerable amount of research. The problem is NP-hard and recent research is focused on finding heuristic solutions rather than searching for optimal solutions. This paper introduces a heuristic method using a tabu search algorithm to solve the economic lot scheduling problem. Diversification and intensification schemes are employed to improve the efficiency of the proposed Tabu search algorithm. Experimental design is conducted to determine the best operating parameters for the Tabu search. Results show that the tabu search algorithm proposed in this paper outperforms two well known benchmark algorithms.

KW - Economic lot scheduling problem

KW - Neighborhood search and design of experiment

KW - Tabu search

UR - http://www.scopus.com/inward/record.url?scp=33750380884&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33750380884&partnerID=8YFLogxK

U2 - 10.1007/s10732-006-6017-7

DO - 10.1007/s10732-006-6017-7

M3 - Article

AN - SCOPUS:33750380884

SN - 1381-1231

VL - 12

SP - 413

EP - 426

JO - Journal of Heuristics

JF - Journal of Heuristics

IS - 6

ER -

A tabu search algorithm for solving economic lot scheduling problem

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this