Return
A simple augmented ε-constraint method for multi-objective mathematical integer programming problems
DOI:10.1016/j.ejor.2013.09.001.png)
Abstract
En 中文
A simple augmented epsilon-constraint (SAUGMECON) method is put forward to generate all non-dominated solutions of multi-objective integer programming (MOIP) problems. The SAUGMECON method is a variant of the augmented epsilon-constraint (AUGMECON) method proposed in 2009 and improved in 2013 by Mavrotas et al. However, with the SAUGMECON method, all non-dominated solutions can be found much more efficiently thanks to our innovations to algorithm acceleration. These innovative acceleration mechanisms include: (1) an extension to the acceleration algorithm with early exit and (2) an addition of an acceleration algorithm with bouncing steps. The same numerical example in Lokman and Koksalan (2012) is used to illustrate workings of the method. Then comparisons of computational performance among the method proposed by (Ozlen and Azizoglu (2009), Ozlen et al. (2012), the method developed by Lokman and Koksalan (2012) and the SAUGMECON method are made by solving randomly generated general MOIP problem instances as well as special MOIP problem instances such as the MOKP and MOSP problem instances presented in Table 4 in Lolcman and Koksalan (2012). The experimental results show that the SAUGMECON method performs the best among these methods. More importantly, the advantage of the SAUGMECON method over the method proposed by Lokman and Koksalan (2012) turns out to be increasingly more prominent as the number of objectives increases. (C) 2013 Elsevier B.V. All rights reserved.
Keywords:
Multi-objective programming
epsilon-Constraint method
AUGMECON method
SAUGMECON method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers
Conformational change and protein–protein interactions of the fusion protein of Semliki Forest virus
Nature
IF0
A method for finding the set of non-dominated vectors for multiple objective integer linear programs

