Scribd
Upload
305 views34 pages

Lecture 3-Covering Problems

This document summarizes covering problems in facility location models. It discusses the set covering problem (SCP) and maximal covering location problem (MCLP), which aim to locate facilities to cover demand within a given distance. Solution methods for SCP and MCLP are also presented, including exact methods like branch and bound, and approximate methods like heuristics and metaheuristics. The document provides examples of variants like capacitated, probabilistic, and stochastic versions of these problems.

Uploaded by

Fandi Afrizal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
305 views34 pages

Lecture 3-Covering Problems

This document summarizes covering problems in facility location models. It discusses the set covering problem (SCP) and maximal covering location problem (MCLP), which aim to locate facilities to cover demand within a given distance. Solution methods for SCP and MCLP are also presented, including exact methods like branch and bound, and approximate methods like heuristics and metaheuristics. The document provides examples of variants like capacitated, probabilistic, and stochastic versions of these problems.

Uploaded by

Fandi Afrizal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 34

SISTEM TRANSPORTASI

DAN DISTRIBUSI

MINGGU 3
Covering Problems

Fandi Afrizal, S.T., M.T.


Covering Problem
Outline
• Introduction
• Facility Location Models
• The Set Covering Problem (SCP)
• The Maximal Covering Location Problem (MCLP)
• Solution Methods
• Summary
Facility Location Model
• In a basic formulation, the Facility Location problem consists of a set of
potential facility sites L where a facility can be opened, and a set of
demand points D that must be serviced. The goal is to pick a subset F of
facilities to open, to minimize the sum of distances from each demand
point to its nearest facility, plus the sum of opening costs of the facilities.
(Wikipedia)
• Facility location is a critical component of strategic planning for a broad
spectrum of public and private firms (Owen and Daskin 1998).
Influence Factors
• Resource, e.g. Land, Energy, Materials, Labor.
• Infrastructure, e.g. Financial Institutions, Government (stability, tax, …),
Transportation
• Proximity to market
Facility Location Model
• Many analytical techniques: Factor Rating; Cost-Profit-Volume analysis:
etc
• One of the most popular models among facility location models is
covering problem (Farahani et al 2012)
• The set covering problem (SCP)
• The maximal covering location problem (MCLP)
Covering Problems
• Facility Location Covering Model
• Sejauh Mana Fasilitas dapat mengcover demand (Ni)
• Coverage problem depends on :
• Demand node
• Facility
• Both of them
Set Covering Problem
• Menentukan jumlah fasilitas yang dapat mengcover semua demand
 To find minimum cost of facilities
Obj Function

Constraint

Jika DC = Coverage Distance maka dij <= DC


Example of Set Covering Problem
DC = 11
Location Set Covering Problem (SCP)
Implisit and Explisit
• LSCP-Implicit model assumes that each demand area can be covered not
only by one facility but also by two or more so that each facility covers a
percentage of demand.
• LSCP-Explicit model considers the coverage provided to a demand area
by a specific set of facilities (facility combination).
Capacitated SCP
• In the above models, no limitation for the capacity of a new located
facility.
• Current and Storbeck (1988): capacitated version of SCP formulations
Multiple Optimal SCP
• The optimal number of the new facilities needed for total coverage.
• A secondary criterion minimizes maximum time (or distance) for all the
demand points to their nearest facility.
Covering Tour Problem
• The goal is determining a
minimum length Hamiltonian
cycle on a sub-set of V such
that every vertex of W is
within a prespecified distance
from the cycle.
• Routing of a mobile medical
facility.
Probabilistic SCP
• Consider dynamic aspect of location problems.
• In emergency facilities sometimes vehicles are not available when they
are called.
• The covering constraint must be satisfied with some prescribed
probability.
Stochastic SCP
• Stochasticity in demand, travel time, etc.
• Hwang (2002) applied Stochastic SCP in design a supply chain system
with random travel time (Assume the located facilities are always
available). The probability of each demand point being covered is not less
than a critical level.
Other Variant of SCP
• Multiple Coverage SCP: each demand must be covered by a number of
facilities (Kolen and Tamir 1990).
• Backup Coverage SCP: air ambulance and ground ambulance
combination (Erdemir et al 2010).
• Fuzzy SCP
• Multi-Criteria SCP
• …
Maximum Covering Problem
• Locate P facilities to maximize total demand covered; full coverage not
required
• Extensions:
• Can we use less than P facilities?
• Each facility can have a fixed cost
• Main decision variable remains whether to locate at node j or not
Max Covering Problem
• To locate a fixed number of facilities to maximize the number of demand
that are covered at least once
Obj Function

Constraint
MCLP Implisit and Explisit
• Each demand area can be covered not only by one facility but also by two
or more so that each facility covers a percentage of demand (Implisit)
• Or have to be covered by a specific set of facilities (Explicit).
MCLP on the plane
• The potential sites for locating the new facilities are not on the network or
discrete (and finite).
Capacitated MCLP
• Facility capacity restriction.
MCLP with a critically index analysis metric

• Oztekin et al (2010): RFID network design methodology for asset tracking


in healthcare.
• The objective function maximizes the total covered criticality indices of
demand squares and also minimizes the reader collision.
MCLP with mandatory closeness constraints

• Multiple optimal solutions.


• The objective is to seek location for P facilities to maximize population
covered within a desired time or distance.
Probabilistic MCLP
• ReVelle and Hogan (1989): locate P facilities so that with the probability α
it maximizes the covered population that can find an available server.
Other Variants of MCLP
• Maximal Covering Tour Problem
• Partial Coverage Problem
• Backup Coverage Location Problem
• …
• Both the SCP and the MCLP are hard to solve.
• NP-Complete.
Solution methods for the SCP
• Exact Method.
• Approximate algorithm (Heuristics or meta-heuristics).
Exact Method
• Branch and bound algorithm
• Linear programming (LP) relaxation: Church and ReVelle (1974) and Fisher and
Kedia (1990).
• Lagrangian relaxation: Etcheberry (1977) and Balas and Carrera (1996).
Approximate Method
• Heuristics
• Lagrangian heuristics: Beasley (1990), Beasley and Jornsten (1992), Haddadi
(1997), Caprara et al (1999), etc.
• Greedy heuristics: Chavtal (1979) and Grossman and Wool (1997).
• Local search heuristics: Yagiura, Kishida, and Ibaraki (2006).
• Others.
Approximate Methods
• Meta-heuristics
• Simulated annealing, e.g. Jacobs and Brusco (1995)
• Genetic algorithm, e.g. Solar, Parada, and Uttutia (2002)
• Tabu search, e.g. Kinney, Barnes and Colleti (2004)1
• Greedy Randomized Adaptive Search Procedure (GRASP), e.g. Bautista and Pereira
(2007)
• Others
Solution Method for the MCLP
• Exact Method: branch and bound, e.g. Downs and Camm (1996)
• Heuristics: Lagrangian heuristics, e.g. Galvão and ReVelle (1996)
• Meta-heuristics: GRASP, e.g. Resende (1998)
• Others
Summary
• Facility Location Problem
• Models (SCP and MCLP)
• Solution Methods
Tugas
• Kerjakan Soal 4.8 dan 4.10 menggunakan solver dan sitation

You might also like