Maximal Covering Location Problems on networks with regional demand
Abstract Covering problems are well studied in the Operations Research literature under the assumption that both the set of users and the set of potential facilities are finite. In this paper, we address the following variant, which leads to a Mixed Integer Nonlinear Program (MINLP): locations of p...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2016
|
| Sorozat: | OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
64 |
| doi: | 10.1016/j.omega.2015.11.004 |
| mtmt: | 2992512 |
| Online Access: | http://publicatio.bibl.u-szeged.hu/18141 |
| LEADER | 01845nab a2200229 i 4500 | ||
|---|---|---|---|
| 001 | publ18141 | ||
| 005 | 20200203121700.0 | ||
| 008 | 200203s2016 hu o 0|| zxx d | ||
| 022 | |a 0305-0483 | ||
| 024 | 7 | |a 10.1016/j.omega.2015.11.004 |2 doi | |
| 024 | 7 | |a 2992512 |2 mtmt | |
| 040 | |a SZTE Publicatio Repozitórium |b hun | ||
| 041 | |a zxx | ||
| 100 | 1 | |a Blanquero Rafael | |
| 245 | 1 | 0 | |a Maximal Covering Location Problems on networks with regional demand |h [elektronikus dokumentum] / |c Blanquero Rafael |
| 260 | |c 2016 | ||
| 300 | |a 77-85 | ||
| 490 | 0 | |a OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE |v 64 | |
| 520 | 3 | |a Abstract Covering problems are well studied in the Operations Research literature under the assumption that both the set of users and the set of potential facilities are finite. In this paper, we address the following variant, which leads to a Mixed Integer Nonlinear Program (MINLP): locations of p facilities are sought along the edges of a network so that the expected demand covered is maximized, where demand is continuously distributed along the edges. This MINLP has a combinatorial part (which edges of the network are chosen to contain facilities) and a continuous global optimization part (once the edges are chosen, which are the optimal locations within such edges). A branch-and-bound algorithm is proposed, which exploits the structure of the problem: specialized data structures are introduced to successfully cope with the combinatorial part, inserted in a geometric branch-and-bound algorithm. Computational results are presented, showing the appropriateness of our procedure to solve covering problems for small (but non-trivial) values of p. | |
| 700 | 0 | 1 | |a Carrizosa Emilio |e aut |
| 700 | 0 | 2 | |a Gazdag-Tóth Boglárka |e aut |
| 856 | 4 | 0 | |u http://publicatio.bibl.u-szeged.hu/18141/1/covering20151014.pdf |z Dokumentum-elérés |