Approximating the Pareto frontier for a challenging real-world bi-objective covering problem

Quttineh, Nils-Hassan,1979-Linköpings universitet,Tillämpad matematik,Tekniska fakulteten (författare)

We study a bi-objective covering problem stemming from a real-world application concerning the design of camera surveillance systems for large-scale outdoor areas. It is in this application prohibitively costly to surveil the entire area, and therefore necessary to be able to present a decision-maker with trade-offs between total cost and the portion of the area that is surveilled. The problem can be stated as a set covering problem with two objectives, describing cost and portion of covering constraints that are fulfilled. Finding the Pareto frontier for these objectives is very computationally demanding and we therefore derive a method for finding a good approximate frontier in a practically feasible computing time. The method is based on the epsilon-constraint reformulation, an established heuristic for set covering problems, and subgradient optimization.

NATURVETENSKAP Matematik Beräkningsmatematik hsv//swe
NATURAL SCIENCES Mathematics Computational Mathematics hsv//eng
Discrete optimization; set covering problem; multi-objective optimization; Lagrangian duality; heuristic

Ngulo, Uledi,1983-Linköpings universitet,Tillämpad matematik,Tekniska fakulteten(Swepub:liu)uleng44 (författare)
Larsson, Torbjörn,1957-Linköpings universitet,Tillämpad matematik,Tekniska fakulteten(Swepub:liu)torla64 (författare)
Linköpings universitetTillämpad matematik (creator_code:org_t)

Ingår i:INFOR. Information systems and operational research: Taylor & Francis Inc60:3, s. 342-3580315-59861916-0615

Av författaren/redakt...: Quttineh, Nils-H ...; Ngulo, Uledi, 19 ...; Larsson, Torbjör ...

Om ämnet

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.