Development of a tabu search heuristic for solving multi-objective combinatorial problems with applications to constructing discrete optimal designs
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | 정주성 | ko |
| dc.contributor.author | 염봉진 | ko |
| dc.date.accessioned | 2013-03-02T20:23:35Z | - |
| dc.date.available | 2013-03-02T20:23:35Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 1997-06 | - |
| dc.identifier.citation | INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, v.3, no.1, pp.75 - 88 | - |
| dc.identifier.issn | 1226-0797 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/75369 | - |
| dc.description.abstract | Tabu search (TS) has been successfully applied for solving many complex combinatorial optimization problems in the areas of operations research and production control. However, TS is for single-objective problems in its present form. In this article, a TS-based heuristic is developed to determine Pareto-efficient solutions to a multi-objective combinatorial optimization problem. The developed algorithm is then applied to the discrete optimal design problem in statistics to demonstrate its usefulness. | - |
| dc.language | English | - |
| dc.publisher | 한국경영과학회 | - |
| dc.title | Development of a tabu search heuristic for solving multi-objective combinatorial problems with applications to constructing discrete optimal designs | - |
| dc.type | Article | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 3 | - |
| dc.citation.issue | 1 | - |
| dc.citation.beginningpage | 75 | - |
| dc.citation.endingpage | 88 | - |
| dc.citation.publicationname | INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE | - |
| dc.contributor.localauthor | 염봉진 | - |
| dc.contributor.nonIdAuthor | 정주성 | - |
- Appears in Collection
- IE-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.