返回
A simple augmented ε-constraint method for multi-objective mathematical integer programming problems
DOI:10.1016/j.ejor.2013.09.001.png)
摘要
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.
Keyword:
Multi-objective programming
epsilon-Constraint method
AUGMECON method
SAUGMECON method
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Conformational change and protein–protein interactions of the fusion protein of Semliki Forest virusSemliki森林病毒融合蛋白的构象变化和蛋白-蛋白相互作用
Nature
IF0
A method for finding the set of non-dominated vectors for multiple objective integer linear programs一种求多目标整数线性规划非支配向量集的方法
A review of interactive methods for multiobjective integer and mixed-integer programming多目标整数和混合整数规划的交互式方法综述
A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs一种多目标混合整数线性规划非支配向量分散良好子集的寻找方法

