多目标系统冗余分配问题的修剪Pareto集的确定

2007 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making Pub Date : 2007-04-01 DOI:10.1109/MCDM.2007.369118

S. Kulturel-Konak, D. Coit

{"title":"多目标系统冗余分配问题的修剪Pareto集的确定","authors":"S. Kulturel-Konak, D. Coit","doi":"10.1109/MCDM.2007.369118","DOIUrl":null,"url":null,"abstract":"In this paper, a new methodology is presented to solve multi-objective system redundancy allocation problems. A tabu search meta-heuristic approach is used to initially find the entire Pareto set, and then a Monte-Carlo simulation provides a decision maker with a pruned set of Pareto solutions based on decision maker's predefined objective function preferences. We are aiming to create a bridge between Pareto optimality and single solution approaches","PeriodicalId":306422,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Determination of Pruned Pareto Sets for the Multi-Objective System Redundancy Allocation Problem\",\"authors\":\"S. Kulturel-Konak, D. Coit\",\"doi\":\"10.1109/MCDM.2007.369118\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a new methodology is presented to solve multi-objective system redundancy allocation problems. A tabu search meta-heuristic approach is used to initially find the entire Pareto set, and then a Monte-Carlo simulation provides a decision maker with a pruned set of Pareto solutions based on decision maker's predefined objective function preferences. We are aiming to create a bridge between Pareto optimality and single solution approaches\",\"PeriodicalId\":306422,\"journal\":{\"name\":\"2007 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making\",\"volume\":\"92 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MCDM.2007.369118\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MCDM.2007.369118","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

提出了一种解决多目标系统冗余分配问题的新方法。首先采用禁忌搜索元启发式方法寻找整个Pareto集，然后通过蒙特卡罗模拟，根据决策者预先设定的目标函数偏好，为决策者提供一个经过删减的Pareto解集。我们的目标是在帕累托最优和单一解决方案之间建立一座桥梁

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Determination of Pruned Pareto Sets for the Multi-Objective System Redundancy Allocation Problem

In this paper, a new methodology is presented to solve multi-objective system redundancy allocation problems. A tabu search meta-heuristic approach is used to initially find the entire Pareto set, and then a Monte-Carlo simulation provides a decision maker with a pruned set of Pareto solutions based on decision maker's predefined objective function preferences. We are aiming to create a bridge between Pareto optimality and single solution approaches

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2007 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making

自引率

0.00%

发文量