File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Hybrid tabu-simulated annealing based approach to solve multi-constraint product mix decision problem

TitleHybrid tabu-simulated annealing based approach to solve multi-constraint product mix decision problem
Authors
KeywordsManufacturing systems
Multi-constraint product mix decision
Simulated annealing
Tabu search
Theory of constraints
Issue Date2005
PublisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/eswa
Citation
Expert Systems With Applications, 2005, v. 29 n. 2, p. 446-454 How to Cite?
AbstractIn the recent years, theory of constraints (TOC) has emerged as an effective management philosophy for solving decision making problems with the aim of profit maximization by considering the bottleneck in traditional as well as modern manufacturing plants. One of the key components of TOC application is to enumerate quantity of the various products to be manufactured keeping in view the system constraints. Problem of this kind is termed as TOC product mix decision problem. It is a well-known computationally complex problem and thus warrants the application of heuristics techniques or AI based optimization tools to achieve optimal or near optimal solution in real time. In this research, a hybrid algorithm named tabu-simulated annealing is proposed. It exploits the beauty of tabu search and simulated annealing (SA) to ensure the convergence at faster rate. It is found that the performance of hybrid tabu-SA algorithm on a well known data set of product mix optimization problem is superior as compared to tabu search, SA, TOC heuristic, Revised-TOC (R-TOC) heuristic, and Integer Linear Programming (ILP) based approaches. © 2005 Elsevier Ltd. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/74257
ISSN
2015 Impact Factor: 2.981
2015 SCImago Journal Rankings: 1.839
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorMishra, Nen_HK
dc.contributor.authorPrakashen_HK
dc.contributor.authorTiwari, MKen_HK
dc.contributor.authorShankar, Ren_HK
dc.contributor.authorChan, FTSen_HK
dc.date.accessioned2010-09-06T06:59:30Z-
dc.date.available2010-09-06T06:59:30Z-
dc.date.issued2005en_HK
dc.identifier.citationExpert Systems With Applications, 2005, v. 29 n. 2, p. 446-454en_HK
dc.identifier.issn0957-4174en_HK
dc.identifier.urihttp://hdl.handle.net/10722/74257-
dc.description.abstractIn the recent years, theory of constraints (TOC) has emerged as an effective management philosophy for solving decision making problems with the aim of profit maximization by considering the bottleneck in traditional as well as modern manufacturing plants. One of the key components of TOC application is to enumerate quantity of the various products to be manufactured keeping in view the system constraints. Problem of this kind is termed as TOC product mix decision problem. It is a well-known computationally complex problem and thus warrants the application of heuristics techniques or AI based optimization tools to achieve optimal or near optimal solution in real time. In this research, a hybrid algorithm named tabu-simulated annealing is proposed. It exploits the beauty of tabu search and simulated annealing (SA) to ensure the convergence at faster rate. It is found that the performance of hybrid tabu-SA algorithm on a well known data set of product mix optimization problem is superior as compared to tabu search, SA, TOC heuristic, Revised-TOC (R-TOC) heuristic, and Integer Linear Programming (ILP) based approaches. © 2005 Elsevier Ltd. All rights reserved.en_HK
dc.languageengen_HK
dc.publisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/eswaen_HK
dc.relation.ispartofExpert Systems with Applicationsen_HK
dc.subjectManufacturing systemsen_HK
dc.subjectMulti-constraint product mix decisionen_HK
dc.subjectSimulated annealingen_HK
dc.subjectTabu searchen_HK
dc.subjectTheory of constraintsen_HK
dc.titleHybrid tabu-simulated annealing based approach to solve multi-constraint product mix decision problemen_HK
dc.typeArticleen_HK
dc.identifier.emailChan, FTS: ftschan@hkucc.hku.hken_HK
dc.identifier.authorityChan, FTS=rp00090en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/j.eswa.2005.04.044en_HK
dc.identifier.scopuseid_2-s2.0-22144443848en_HK
dc.identifier.hkuros100492en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-22144443848&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume29en_HK
dc.identifier.issue2en_HK
dc.identifier.spage446en_HK
dc.identifier.epage454en_HK
dc.identifier.isiWOS:000230947400022-
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridMishra, N=24167016200en_HK
dc.identifier.scopusauthoridPrakash=12646439600en_HK
dc.identifier.scopusauthoridTiwari, MK=35427952100en_HK
dc.identifier.scopusauthoridShankar, R=10638891800en_HK
dc.identifier.scopusauthoridChan, FTS=7202586517en_HK
dc.identifier.citeulike715952-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats