 |
English
|
正體中文
|
简体中文
|
Post-Print筆數 : 27 |
Items with full text/Total items : 113648/144635 (79%)
Visitors : 51630706
Online Users : 771
|
|
|
Loading...
|
Please use this identifier to cite or link to this item:
https://nccur.lib.nccu.edu.tw/handle/140.119/10280
|
| Title: | Evaluating A Posteriori Solution Techniques for Bi-criteria Parallel Machine Scheduling Problems |
| Authors: | J. W. Fowler;Kim W. M.;W. M. Carlyle;E. Gel;洪叔民
Fowler, John W.;Kim, Bosun;Carlyle, W. Matthew;Gel, Esma Senturk;Horng, Shwu-Min |
| Keywords: | multiple criteria combinatorial optimization;comparison measures;parallel machine scheduling |
| Date: | 2005-01 |
| Issue Date: | 2008-11-25 10:46:32 (UTC+8) |
| Abstract: | The quality of an approximate solution for combinatorial optimization problems with a single objective can be evaluated relatively easily. However, this becomes more difficult when there are multiple objectives. One potential approach to solving multiple criteria combinatorial optimization problems when at least one of the single objective problems is NP-complete, is to use an a posteriori method that approximates the efficient frontier. A common difficulty in this type of approach, however, is evaluating the quality of approximate solutions, since sets of multiple solutions should be evaluated and compared. This necessitates the use of a comparison measure that is robust and accurate. Furthermore, a robust measure plays an important role in metaheuristic optimization for “tuning” various parameters for evolutionary algorithms, simulated annealing, etc., which are frequently employed for multiple criteria combinatorial optimization problems. In this paper, the performance of a new measure, which we call Integrated Convex Preference (ICP) is compared to that of other measures appearing in the literature through numerical experiments—specifically, we use two a posteriori solution techniques based on genetic algorithms for a bi-criteria parallel machine scheduling problem and evaluate their performance (in terms of solution quality) using different measures. Experimental results show that the ICP measure evaluates the solution quality of approximations robustly (i.e., similar to visual comparison results) while other alternative measures can misjudge the solution quality. We note that the ICP measure can be applied to other non-scheduling multiple objective combinatorial optimization problems, as well. |
| Relation: | Journal of Scheduling, 8(1), 75-96 |
| Data Type: | article |
| DOI 連結: | http://dx.doi.org/10.1007/s10951-005-5316-4 |
| DOI: | 10.1007/s10951-005-5316-4 |
| Appears in Collections: | [企業管理學系] 期刊論文
|
Files in This Item:
| File |
Description |
Size | Format | |
|---|
| 7596.pdf | | 389Kb | Adobe PDF2 | 998 | View/Open |
|
All items in 政大典藏 are protected by copyright, with all rights reserved.
|
著作權政策宣告 Copyright Announcement1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.
2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(
nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(
nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
