13.05.2018 Views

merged

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Comparison between Weighted Sum Method and ε-Constraint Method in<br />

Multi-objective Optimization Problems<br />

Nurul Fatin Nabila Binti Muhamad<br />

Supervisor: Dr. Nur Fadhilah Binti Ibrahim<br />

Bachelor of Science (Computational Mathematics)<br />

School of Informatics And Applied Mathematics<br />

The purpose of this research is to compare between weighted sum method and ε-<br />

constraint method to find an optimal solution in multi-objective optimization problem<br />

(MOPs). MOPs is a problem that having infinite numbers of Pareto optimal and there are<br />

conflicts among objectives. The decision maker (DM) need to choose a solution that<br />

satisfied his/her requirement and preference. These two methods are converting MOPs<br />

into a single objective where weighted sum method multiplying each objective function<br />

by a weighting factor meanwhile ε-constraint method transforming one of the objective<br />

functions into a constraint. From the result, we conclude that ε-constraint method is more<br />

preferable method compare to the weighted sum method because a lot of runs are<br />

redundant that there can be a lot of combination of weights that result the same efficient<br />

extreme solution while ε-constraint method able to produce a different efficient solution<br />

almost at every run.<br />

992 | UMT UNDERGRADUATE RESEARCH DAY 2018

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!