A Matheuristic for a Bi-objective Covering Problem

Nils-Hassan Quttineh () and Torbjörn Larsson ()
Additional contact information
Nils-Hassan Quttineh: Linköping University
Torbjörn Larsson: Linköping University

Chapter Chapter 66 in Operations Research Proceedings 2023, 2025, pp 519-525 from Springer

Abstract: Abstract We consider a bi-objective covering problem which is a close relative to the set covering problem. It is encountered in an application concerning cost-efficient camera surveillance of a bio-fuel depot. The two objectives are to simultaneously minimize the cost of the solution and to maximize its coverage, measured as the number of fulfilled covering constraints. These objectives are clearly in conflict, and for large scale instances it is very challenging and practically unfeasible to calculate the Pareto frontier. We propose a matheuristic approach to the problem. It aims at finding a near Pareto frontier in practically feasible computation times, and works by gradually constructing this frontier from zero coverage to full coverage. We apply the matheuristic to real-life instances and analyse its performance with respect to frontier quality metrics.

Keywords: Set covering; Multi-objective optimization; Matheuristics; Neighbourhood search (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnopch:978-3-031-58405-3_66

Ordering information: This item can be ordered from
http://www.springer.com/9783031584053

DOI: 10.1007/978-3-031-58405-3_66

Access Statistics for this chapter

More chapters in Lecture Notes in Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().