Loading...
Please wait, while we are loading the content...
Similar Documents
AUGMECON 2 : A novel version of the ε-constraint method for finding the exact Pareto set in Multi-Objective Integer Programming problems
| Content Provider | Semantic Scholar |
|---|---|
| Author | Mavrotas, George Florios, Kostas |
| Copyright Year | 2012 |
| Abstract | Generation (or a posteriori) methods in Multi-Objective Mathematical Programming (MOMP) is the most computationally demanding category among the MOMP approaches. Due to the dramatic increase in computational speed and the improvement of Mathematical Programming algorithms the generation methods become all the more attractive among today’s decision makers. In the current paper we present the generation method AUGMECON2 which is an improvement of our development, AUGMECON. Although AUGMECON2 is a general purpose method, we will demonstrate that AUGMECON2 is especially suitable for Multi-Objective Integer Programming (MOIP) problems. Specifically, AUGMECON2 is capable of producing the exact Pareto set in MOIP problems by appropriately tuning its running parameters. In this context, we compare the previous and the new version in a series of new and old benchmarks found in the literature. We also compare AUGMECON2’s performance in the generation of the exact Pareto sets with established methods and algorithms based on a specific MOIP problem (knapsack) and on published results. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.gams.com/modlib/adddocs/epscmmip.pdf |
| Alternate Webpage(s) | https://www.gams.com/modlib/adddocs/epscmmip.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
