Variants of the \( \varepsilon \)-constraint method for biobjective integer programming problems: application to p-median-cover problems
- 100 Downloads
We conduct an in-depth analysis of the \(\varepsilon \)-constraint method (ECM) for finding the exact Pareto front for biobjective integer programming problems. We have found up to six possible different variants of the ECM. We first discuss the complexity of each of these variants and their relationship with other exact methods for solving biobjective integer programming problems. By extending some results of Neumayer and Schweigert (OR Spektrum 16:267–276, 1994), we develop two variants of the ECM, both including an augmentation term and requiring \(N+1\) integer programs to be solved, where N is the number of nondominated points. In addition, we present another variant of the ECM, based on the use of elastic constraints and also including an augmentation term. This variant has the same complexity, namely \(N+1\), which is the minimum reached for any exact method. A comparison of the different variants is carried out on a set of biobjective location problems which we call p-median-cover problems; these include the objectives of the p-median and the maximal covering problems. As computational results show, for this class of problems, the augmented ECM with elastic constraint is the most effective variant for finding the Pareto front in an exact manner.
KeywordsBiobjective integer programming Epsilon-constraint method p-Median-cover problem
The authors wish to thank the anonymous referees for their useful suggestions and comments that improved the paper, and to FICO for providing the Xpress Optimizer application, which has been used to obtain the computational results.
- Ehrgott M, Gandibleux X (2003) Multiobjective combinatorial optimization. Theory, methodology and applications. In: Ehrgott M, Gandibleux X (eds) Multiple criteria optimization: state of the art annotated bibliographic surveys. Surveys international series in operations research and management science, vol 52. Kluwer Academic Publishers, Dordrecht, pp 369–444Google Scholar
- FICO Xpress Optimization Suite (2016) XPRESS-MP optimizer reference manual. Fair Isaac Corporation, Leamington SpaGoogle Scholar
- Grandinetti L, Guerriero F, Lagana D, Pisacane O (2010) An approximate \(\varepsilon \)-constraint method for the multi-objective undirected capacitated arc routing problem. In: Paola F (ed) 9th International symposium on experimental algorithms SEA 2010. Springer, BerlinGoogle Scholar
- Laumanns M, Thiele L, Zitzler E (2006) An efficient, adaptive parameter scheme for metaheuristic based on the \(\varepsilon \)-constraint method. Eur J Oper Res 169:932–942Google Scholar