scholarly journals Models, solution, methods and their applicability of dynamic location problems (DLPs) (a gap analysis for further research)

2016 ◽  
Vol 12 (3) ◽  
pp. 311-341 ◽  
Author(s):  
Seyed Mohammad Seyedhosseini ◽  
Ahmad Makui ◽  
Kamran Shahanaghi ◽  
Sara Sadat Torkestani
Keyword(s):  
Gap Analysis ◽  
Location Problems ◽  
Solution Methods ◽  
Dynamic Location

scholarly journals Dynamic location problems with limited look-ahead

2001 ◽  
Vol 261 (2) ◽  
pp. 213-226 ◽  
Author(s):  
Fan Chung ◽  
Ronald Graham
Keyword(s):  
Location Problems ◽  
Look Ahead ◽  
Dynamic Location

scholarly journals Finding p-Hub Median Locations: An Empirical Study on Problems and Solution Techniques

2017 ◽  
Vol 2017 ◽  
pp. 1-23 ◽  
Author(s):  
Xiaoqian Sun ◽  
Weibin Dai ◽  
Yu Zhang ◽  
Sebastian Wandelt
Keyword(s):  
Genetic Algorithms ◽  
Empirical Study ◽  
Low Complexity ◽  
Location Problems ◽  
Hub Location ◽  
Allocation Problems ◽  
Solution Methods ◽  
Problem Formulations ◽  
Single Allocation ◽  
Solution Techniques

Hub location problems have been studied by many researchers for almost 30 years, and, accordingly, various solution methods have been proposed. In this paper, we implement and evaluate several widely used methods for solving five standard hub location problems. To assess the scalability and solution qualities of these methods, three well-known datasets are used as case studies: Turkish Postal System, Australia Post, and Civil Aeronautics Board. Classical problems in small networks can be solved efficiently using CPLEX because of their low complexity. Genetic algorithms perform well for solving three types of single allocation problems, since the problem formulations can be neatly encoded with chromosomes of reasonable size. Lagrangian relaxation is the only technique that solves reliable multiple allocation problems in large networks. We believe that our work helps other researchers to get an overview on the best solution techniques for the problems investigated in our study and also stipulates further interest on cross-comparing solution techniques for more expressive problem formulations.

Dynamic location problems

1986 ◽  
Vol 6 (10) ◽  
pp. 311-319 ◽  
Author(s):  
N. Megiddo
Keyword(s):  
Location Problems ◽  
Dynamic Location

scholarly journals Uncapacitated facility location problems: contributions

2004 ◽  
Vol 24 (1) ◽  
pp. 7-38 ◽  
Author(s):  
Roberto Diéguez Galvão
Keyword(s):  
Facility Location ◽  
Academic Career ◽  
Location Problems ◽  
Median Problem ◽  
Facility Location Problems ◽  
Practical Applications ◽  
Location Models ◽  
Dynamic Location ◽  
Hierarchical Location ◽  
Research Students

The objective of the present paper is to review my personal contributions in the field of uncapacitated facility location problems. These contributions took place throughout my academic career, from the time I was a Ph.D. student at Imperial College to the present day. They cover approximately 30 years, from 1973 to 2003; they address: algorithms developed for the p-median problem and for a general formulation of uncapacitated location problems; the study of dynamic location models; covering and hierarchical location problems; queuing-based probabilistic location models. The contributions encompass theoretical developments, computational algorithms and practical applications. All work took place in an academic environment, with the invaluable collaboration of colleagues (both in Brazil and abroad) and research students at COPPE. Each section in the paper is dedicated to a topic that involves a personal contribution. Every one of them is placed within the context of the existing literature.

ON PLANAR MEDIANOID COMPETITIVE LOCATION PROBLEMS WITH MANHATTAN DISTANCE

2013 ◽  
Vol 30 (02) ◽  
pp. 1250050 ◽  
Author(s):  
KE FU ◽  
ZHAOWEI MIAO ◽  
JIAYAN XU
Keyword(s):  
Polynomial Time ◽  
General Problem ◽  
Location Problem ◽  
Location Problems ◽  
Manhattan Distance ◽  
Competitive Location ◽  
Customer Preferences ◽  
Special Cases ◽  
Present Solution ◽  
Solution Methods

A medianoid problem is a competitive location problem that determines the locations of a number of new service facilities that are competing with existing facilities for service to customers. This paper studies the medianoid problem on the plane with Manhattan distance. For the medianoid problem with binary customer preferences, i.e., a case where customers choose the closest facility to satisfy their entire demand, we show that the general problem is NP-hard and present solution methods to solve various special cases in polynomial time. We also show that the problem with partially binary customer preferences can be solved with a similar approach we develop for the model with binary customer preferences.

scholarly journals A memetic algorithm for multi-objective dynamic location problems

2007 ◽  
Vol 42 (2) ◽  
pp. 221-253 ◽  
Author(s):  
Joana Dias ◽  
M. Eugénia Captivo ◽  
João Clímaco
Keyword(s):  
Memetic Algorithm ◽  
Location Problems ◽  
Multi Objective ◽  
Dynamic Location
Sign in / Sign up

Export Citation Format

Share Document