Results 11 to 20 of about 101,682 (286)
The large scale maximal covering location problem
The maximal covering location problem (MCLP) is a challenging problem with numerous applications in practice. Previous publications in the area of MCLP proposed models and presented solution methodologies to solve this problem with up to 900 nodes. Due to the fact that in real-life applications, the number of nodes could be much higher, this paper ...
M.H. Fazel Zarandi +2 more
openaire +3 more sources
A Lagrangean heuristic for the maximal covering location problem
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Galvão, Roberto Diéguez +1 more
openaire +4 more sources
THE MAXIMAL COVERING LOCATION PROBLEM
Richard Church, Charles ReVelle
openaire +3 more sources
Optimizing the Spatial Location of Street Lights in Belle Isle, Michigan
Improved street lighting can provide better use of public space and helps to promote safety while driving or walking. In terms of balancing benefits and impacts, on the basis of cost saving, this research adopts two prominent mathematical models, the ...
Yanqing Xu +4 more
doaj +1 more source
Multi-type maximal covering location problems: Hybridizing discrete and continuous problems
This paper introduces a general modeling framework for a multi-type maximal covering location problem in which the position of facilities in different metric spaces are simultaneously decided to maximize the demand generated by a set of points. From the need of intertwining location decisions in discrete and in continuous sets, a general hybridized ...
Víctor Blanco +2 more
openaire +3 more sources
Modeling and solving the dynamic modular capacitated maximal covering location problem [PDF]
Maximal covering location problem is one of the most important network location problems that is used in various applications. To improve the application of the maximal covering location problem (MCLP), several capacitated MCLP models were proposed ...
Jafar Bagherinejad +2 more
doaj +1 more source
Optimizing Ambulance Allocation in Dynamic Urban Environments: A Historic Data-Driven Approach
In this study, we present a methodology to solve the multi-period ambulance relocation problem based on historical data. We present a methodology to convert historical data in latitude–longitude coordinates into cell-based network data.
Seongho Kang, Taesu Cheong
doaj +1 more source
Continuous maximal covering location problems with interconnected facilities [PDF]
In this paper we analyze a continuous version of the maximal covering location problem, in which the facilities are required to be interconnected by means of a graph structure in which two facilities are allowed to be linked if a given distance is not exceed.
Blanco, Víctor, Gázquez, Ricardo
openaire +3 more sources
A Multi-Objective Model for Location-Routing Problem Considering Minimal Risk and Maximal Demand Covering [PDF]
Location, routing and allocation decisions in supply chain management philosophy is undoubtedly one of the most important issues have very effect on the supply chain cost reduction and customer satisfaction.
alireza alinezhad +2 more
doaj +1 more source
Planning and defining places for the installation of police facilities are fundamental to improving the public security service in the urban space.
Bruno Ferreira da Costa Borba +3 more
doaj +1 more source

