A Multi-Objective Approach to the Competitive Facility Location Problem

Research output: Contribution to journalConference article

1 Citation (Scopus)

Abstract

In this paper, a new modeling approach is introduced for a competitive facility location problem in which multiple competitors aim to maximize their market shares. The problem is called the Competitive Maximal Covering Location Problem (CMCLP) based on the classical Maximal Covering Location Problem. Typically, the CMCLP is modeled as a Stackelberg game in which the first player and then the other one locate a fixed number of facilities. On the other hand, the present work considers multiple competitors, and the objective is on discovering a set of the competitors' decision tuples that are not dominated by any other decision tuples in the solution space. Thereby, the proposed modeling approach aims to help competing firms understand tradeoffs when they engage in negotiations. A mathematical formulation for the CMCLP with two competitors is presented. A multi-objective genetic algorithm is used to solve the problems with multiple competitors. Computational experiments demonstrate that the genetic algorithm is able to approximate the true Pareto front.

Original languageEnglish (US)
Pages (from-to)1434-1442
Number of pages9
JournalProcedia Computer Science
Volume108
DOIs
StatePublished - Jan 1 2017
EventInternational Conference on Computational Science ICCS 2017 - Zurich, Switzerland
Duration: Jun 12 2017Jun 14 2017

Fingerprint

Genetic algorithms
Experiments

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

@article{69df2a2a93414e0aa2c869ab8d5758bc,
title = "A Multi-Objective Approach to the Competitive Facility Location Problem",
abstract = "In this paper, a new modeling approach is introduced for a competitive facility location problem in which multiple competitors aim to maximize their market shares. The problem is called the Competitive Maximal Covering Location Problem (CMCLP) based on the classical Maximal Covering Location Problem. Typically, the CMCLP is modeled as a Stackelberg game in which the first player and then the other one locate a fixed number of facilities. On the other hand, the present work considers multiple competitors, and the objective is on discovering a set of the competitors' decision tuples that are not dominated by any other decision tuples in the solution space. Thereby, the proposed modeling approach aims to help competing firms understand tradeoffs when they engage in negotiations. A mathematical formulation for the CMCLP with two competitors is presented. A multi-objective genetic algorithm is used to solve the problems with multiple competitors. Computational experiments demonstrate that the genetic algorithm is able to approximate the true Pareto front.",
author = "Abdullah Konak and Sadan Kulturel-Konak and Lawrence Snyder",
year = "2017",
month = "1",
day = "1",
doi = "10.1016/j.procs.2017.05.035",
language = "English (US)",
volume = "108",
pages = "1434--1442",
journal = "Procedia Computer Science",
issn = "1877-0509",
publisher = "Elsevier BV",

}

A Multi-Objective Approach to the Competitive Facility Location Problem. / Konak, Abdullah; Kulturel-Konak, Sadan; Snyder, Lawrence.

In: Procedia Computer Science, Vol. 108, 01.01.2017, p. 1434-1442.

Research output: Contribution to journalConference article

TY - JOUR

T1 - A Multi-Objective Approach to the Competitive Facility Location Problem

AU - Konak, Abdullah

AU - Kulturel-Konak, Sadan

AU - Snyder, Lawrence

PY - 2017/1/1

Y1 - 2017/1/1

N2 - In this paper, a new modeling approach is introduced for a competitive facility location problem in which multiple competitors aim to maximize their market shares. The problem is called the Competitive Maximal Covering Location Problem (CMCLP) based on the classical Maximal Covering Location Problem. Typically, the CMCLP is modeled as a Stackelberg game in which the first player and then the other one locate a fixed number of facilities. On the other hand, the present work considers multiple competitors, and the objective is on discovering a set of the competitors' decision tuples that are not dominated by any other decision tuples in the solution space. Thereby, the proposed modeling approach aims to help competing firms understand tradeoffs when they engage in negotiations. A mathematical formulation for the CMCLP with two competitors is presented. A multi-objective genetic algorithm is used to solve the problems with multiple competitors. Computational experiments demonstrate that the genetic algorithm is able to approximate the true Pareto front.

AB - In this paper, a new modeling approach is introduced for a competitive facility location problem in which multiple competitors aim to maximize their market shares. The problem is called the Competitive Maximal Covering Location Problem (CMCLP) based on the classical Maximal Covering Location Problem. Typically, the CMCLP is modeled as a Stackelberg game in which the first player and then the other one locate a fixed number of facilities. On the other hand, the present work considers multiple competitors, and the objective is on discovering a set of the competitors' decision tuples that are not dominated by any other decision tuples in the solution space. Thereby, the proposed modeling approach aims to help competing firms understand tradeoffs when they engage in negotiations. A mathematical formulation for the CMCLP with two competitors is presented. A multi-objective genetic algorithm is used to solve the problems with multiple competitors. Computational experiments demonstrate that the genetic algorithm is able to approximate the true Pareto front.

UR - http://www.scopus.com/inward/record.url?scp=85027335688&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85027335688&partnerID=8YFLogxK

U2 - 10.1016/j.procs.2017.05.035

DO - 10.1016/j.procs.2017.05.035

M3 - Conference article

AN - SCOPUS:85027335688

VL - 108

SP - 1434

EP - 1442

JO - Procedia Computer Science

JF - Procedia Computer Science

SN - 1877-0509

ER -