Randomized local search for the discrete competitive facility location problem

Consider a finite set of consumers that two competing companies are willing to service. The companies open facilities one by one. The set of locations available to open facilities is finite. The problem is to find a facility location for the first company that maximizes its profit given that the sec...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Automation and remote control Ročník 75; číslo 4; s. 700 - 714
Hlavní autor: Mel’nikov, A. A.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Moscow Pleiades Publishing 01.04.2014
Témata:
Algorithms
Approximation
CAE) and Design
Calculus of Variations and Optimal Control; Optimization
Computer-Aided Engineering (CAD
Control
Mathematical analysis
Mathematical models
Mathematics
Mathematics and Statistics
Mechanical Engineering
Mechatronics
Operations research
Remote control
Robotics
Searching
Site selection
Systems Theory
Two-Level Programming Problems
Admissible Solution
Facility Location Problem
Local Search
Remote Control
Facility Location
ISSN:0005-1179, 1608-3032
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Consider a finite set of consumers that two competing companies are willing to service. The companies open facilities one by one. The set of locations available to open facilities is finite. The problem is to find a facility location for the first company that maximizes its profit given that the second company also makes its decision by maximizing the profit. We propose a randomized local search scheme that employs an internal local search procedure to estimate the solutions being enumerated. Numerical experiments with random input data show that the scheme is able to find high quality approximate solutions for examples with dimension that has not been amenable to previously known algorithms.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0005-1179
1608-3032
DOI:10.1134/S0005117914040109