An algorithm for approximating the Pareto set of the multiobjective set covering problem
- 255 Downloads
The multiobjective set covering problem (MOSCP), a challenging combinatorial optimization problem, has received limited attention in the literature. This paper presents a heuristic algorithm to approximate the Pareto set of the MOSCP. The proposed algorithm applies a local branching approach on a tree structure and is enhanced with a node exploration strategy specially developed for the MOSCP. The main idea is to partition the search region into smaller subregions based on the neighbors of a reference solution and then to explore each subregion for the Pareto points of the MOSCP. Numerical experiments for instances with two, three and four objectives set covering problems are reported. Results on a performance comparison with benchmark algorithms from the literature are also included and show that the new algorithm is competitive and performs best on some instances.
KeywordsMultiobjective set covering problem Heuristics Local branching Tree-based search
The support from the Scientific and Technological Research Council of Turkey (TUBITAK) for B. Soylu, who was a visiting assistant professor for a year at the Department of Mathematical Sciences, Clemson University, Clemson, SC, when working on this paper, is gratefully acknowledged.
- Daskin, M. S., & Stern, E. H. (1981). A hierarchical objective set covering model for emergency medical service vehicle deployment. Operations Research Society of America, 15(2), 137–151.Google Scholar
- Ehrgott, M. (2005). Multicriteria optimization (2nd ed.). Berlin: Springer.Google Scholar
- Hansen, M. P., & Jaszkiewicz, A. (1998). Evaluating the quality of approximations to the non-dominated set, Institute of Mathematical Modeling. Technical Report, vol. 7Google Scholar
- Hooker, J. (2011). Logic-based methods for optimization: Combining optimization and constraint satisfaction (Vol. 2). London: Wiley.Google Scholar
- IBM-ILOG CPLEX, 2014, 12.6 User’s Manuel. IBM.Google Scholar
- Lust, T., Teghem, J., & Tuyttens D., (2011). Very large-scale neighborhood search for solving multiobjective combinatorial optimization problems. In Evolutionary multi-criterion optimization: 6th international conference (Vol. 6576, pp. 254–268)Google Scholar
- MOCOlib. (2001). http://xgandibleux.free.fr/MOCOlib/MOSCP.html.
- Steuer, R. E. (1986). Multiple criteria optimization: Theory, computation, and application. New York: Wiley.Google Scholar
- Zitzler, E. (1999). Evolutionary algorithms for multiobjective optimization: Methods and applications. Ph.D. dissertation, Computer Engineering and Networks Laboratory (TIK), ETH, Zurich, Switzerland.Google Scholar