Finding robust pareto-optimal solutions using geometric angle-based pruning algorithm
บทความในวารสาร
ผู้เขียน/บรรณาธิการ
กลุ่มสาขาการวิจัยเชิงกลยุทธ์
ไม่พบข้อมูลที่เกี่ยวข้อง
รายละเอียดสำหรับงานพิมพ์
รายชื่อผู้แต่ง: Sudeng S., Wattanapongsakorn N.
ผู้เผยแพร่: Springer Verlag
ปีที่เผยแพร่ (ค.ศ.): 2014
Volume number: 542
หน้าแรก: 277
หน้าสุดท้าย: 295
จำนวนหน้า: 19
ISBN: 9783319047010
นอก: 1860-949X
eISSN: 1860-949X
ภาษา: English-Great Britain (EN-GB)
บทคัดย่อ
Evolutionary multi-objective optimization algorithms have been developed to find a representative set of Pareto-optimal solutions in the past decades. However, researchers have pointed out that finding a representative set of Pareto-optimal solutions is not sufficient; the task of choosing a single preferred Pareto-optimal solution is also another important task which has received a widespread attention so far. In this paper, we propose an algorithm to help the decision maker (DM) choose the final preferred solution based on his/her preferred objectives. Our algorithm is called an adaptive angle based pruning algorithm with independent bias intensity tuning parameter (ADA-τ). The method begins by calculating the angle between a pair of solutions by using a simple arctangent function. The bias intensity parameter of each objective is introduced independently in order to approximate the portions of desirable solutions based on the DM's preferred objectives. We consider several benchmark problems including two and three-objective problems. The experimental results have shown that our pruning algorithm provides a robust sub-set of Pareto-optimal solutions for the benchmark problems. © 2014 Springer International Publishing Switzerland.
คำสำคัญ
Multi-Objective Optimization, Pareto-optimal solutions, Pruning algorithm
ติดต่อสอบถามเพิ่มเติมได้ที่