A separation based optimization approach to Dynamic Maximal Covering Location Problems with switched structure Article Swipe
Vadim Azhmyakov
,
Juan Pablo Fernández-Gutiérrez
,
Erik I. Verriest
,
Stefan Pickl
·
YOU?
·
· 2019
· Open Access
·
· DOI: https://doi.org/10.3934/jimo.2019128
YOU?
·
· 2019
· Open Access
·
· DOI: https://doi.org/10.3934/jimo.2019128
This paper extends a newly developed computational optimization approach to a specific class of Maximal Covering Location Problems (MCLPs) with a switched dynamic structure. Most of the results obtained for the conventional MCLP address the "static" case where an optimal decision is determined on a fixed time-period. In our contribution we consider a dynamic MCLP based optimal decision making and propose an effective computational method for the numerical treatment of the switched-type Dynamic Maximal Covering Location Problem (DMCLP). A generic geometrical structure of the constraints under consideration makes it possible to separate the originally given dynamic optimization problem and reduce it to a specific family of relative simple auxiliary problems. The generalized Separation Method (SM) for the DMCLP with a switched structure finally leads to a computational solution scheme. The resulting numerical algorithm also includes the classic Lagrange relaxation. We present a rigorous formal analysis of the DMCLP optimization methodology and also discuss computational aspects. The proposed SM based algorithm is finally applied to a practically oriented example, namely, to an optimal design of a (dynamic) mobile network configuration.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.3934/jimo.2019128
- OA Status
- diamond
- References
- 10
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W2981753061
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2981753061Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.3934/jimo.2019128Digital Object Identifier
- Title
-
A separation based optimization approach to Dynamic Maximal Covering Location Problems with switched structureWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2019Year of publication
- Publication date
-
2019-11-21Full publication date if available
- Authors
-
Vadim Azhmyakov, Juan Pablo Fernández-Gutiérrez, Erik I. Verriest, Stefan PicklList of authors in order
- Landing page
-
https://doi.org/10.3934/jimo.2019128Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
diamondOpen access status per OpenAlex
- OA URL
-
https://doi.org/10.3934/jimo.2019128Direct OA link when available
- Concepts
-
Mathematical optimization, Computer science, Simple (philosophy), Relaxation (psychology), Computational complexity theory, Optimization problem, Algorithm, Mathematics, Epistemology, Social psychology, Psychology, PhilosophyTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- References (count)
-
10Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2981753061 |
|---|---|
| doi | https://doi.org/10.3934/jimo.2019128 |
| ids.doi | https://doi.org/10.3934/jimo.2019128 |
| ids.mag | 2981753061 |
| ids.openalex | https://openalex.org/W2981753061 |
| fwci | 0.0 |
| type | article |
| title | A separation based optimization approach to Dynamic Maximal Covering Location Problems with switched structure |
| biblio.issue | 2 |
| biblio.volume | 17 |
| biblio.last_page | 686 |
| biblio.first_page | 669 |
| topics[0].id | https://openalex.org/T11502 |
| topics[0].field.id | https://openalex.org/fields/14 |
| topics[0].field.display_name | Business, Management and Accounting |
| topics[0].score | 0.9979000091552734 |
| topics[0].domain.id | https://openalex.org/domains/2 |
| topics[0].domain.display_name | Social Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1407 |
| topics[0].subfield.display_name | Organizational Behavior and Human Resource Management |
| topics[0].display_name | Facility Location and Emergency Management |
| topics[1].id | https://openalex.org/T10567 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9965999722480774 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2209 |
| topics[1].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[1].display_name | Vehicle Routing Optimization Methods |
| topics[2].id | https://openalex.org/T10698 |
| topics[2].field.id | https://openalex.org/fields/33 |
| topics[2].field.display_name | Social Sciences |
| topics[2].score | 0.9537000060081482 |
| topics[2].domain.id | https://openalex.org/domains/2 |
| topics[2].domain.display_name | Social Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/3313 |
| topics[2].subfield.display_name | Transportation |
| topics[2].display_name | Transportation Planning and Optimization |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C126255220 |
| concepts[0].level | 1 |
| concepts[0].score | 0.6734410524368286 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[0].display_name | Mathematical optimization |
| concepts[1].id | https://openalex.org/C41008148 |
| concepts[1].level | 0 |
| concepts[1].score | 0.6168165802955627 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[1].display_name | Computer science |
| concepts[2].id | https://openalex.org/C2780586882 |
| concepts[2].level | 2 |
| concepts[2].score | 0.6060768365859985 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q7520643 |
| concepts[2].display_name | Simple (philosophy) |
| concepts[3].id | https://openalex.org/C2776029896 |
| concepts[3].level | 2 |
| concepts[3].score | 0.5285345911979675 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q3935810 |
| concepts[3].display_name | Relaxation (psychology) |
| concepts[4].id | https://openalex.org/C179799912 |
| concepts[4].level | 2 |
| concepts[4].score | 0.4825562834739685 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q205084 |
| concepts[4].display_name | Computational complexity theory |
| concepts[5].id | https://openalex.org/C137836250 |
| concepts[5].level | 2 |
| concepts[5].score | 0.4710046350955963 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q984063 |
| concepts[5].display_name | Optimization problem |
| concepts[6].id | https://openalex.org/C11413529 |
| concepts[6].level | 1 |
| concepts[6].score | 0.40634381771087646 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[6].display_name | Algorithm |
| concepts[7].id | https://openalex.org/C33923547 |
| concepts[7].level | 0 |
| concepts[7].score | 0.35324016213417053 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[7].display_name | Mathematics |
| concepts[8].id | https://openalex.org/C111472728 |
| concepts[8].level | 1 |
| concepts[8].score | 0.0 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q9471 |
| concepts[8].display_name | Epistemology |
| concepts[9].id | https://openalex.org/C77805123 |
| concepts[9].level | 1 |
| concepts[9].score | 0.0 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q161272 |
| concepts[9].display_name | Social psychology |
| concepts[10].id | https://openalex.org/C15744967 |
| concepts[10].level | 0 |
| concepts[10].score | 0.0 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q9418 |
| concepts[10].display_name | Psychology |
| concepts[11].id | https://openalex.org/C138885662 |
| concepts[11].level | 0 |
| concepts[11].score | 0.0 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q5891 |
| concepts[11].display_name | Philosophy |
| keywords[0].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[0].score | 0.6734410524368286 |
| keywords[0].display_name | Mathematical optimization |
| keywords[1].id | https://openalex.org/keywords/computer-science |
| keywords[1].score | 0.6168165802955627 |
| keywords[1].display_name | Computer science |
| keywords[2].id | https://openalex.org/keywords/simple |
| keywords[2].score | 0.6060768365859985 |
| keywords[2].display_name | Simple (philosophy) |
| keywords[3].id | https://openalex.org/keywords/relaxation |
| keywords[3].score | 0.5285345911979675 |
| keywords[3].display_name | Relaxation (psychology) |
| keywords[4].id | https://openalex.org/keywords/computational-complexity-theory |
| keywords[4].score | 0.4825562834739685 |
| keywords[4].display_name | Computational complexity theory |
| keywords[5].id | https://openalex.org/keywords/optimization-problem |
| keywords[5].score | 0.4710046350955963 |
| keywords[5].display_name | Optimization problem |
| keywords[6].id | https://openalex.org/keywords/algorithm |
| keywords[6].score | 0.40634381771087646 |
| keywords[6].display_name | Algorithm |
| keywords[7].id | https://openalex.org/keywords/mathematics |
| keywords[7].score | 0.35324016213417053 |
| keywords[7].display_name | Mathematics |
| language | en |
| locations[0].id | doi:10.3934/jimo.2019128 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S114365116 |
| locations[0].source.issn | 1547-5816, 1553-166X |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 1547-5816 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Journal of Industrial and Management Optimization |
| locations[0].source.host_organization | https://openalex.org/P4310315844 |
| locations[0].source.host_organization_name | American Institute of Mathematical Sciences |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310315844 |
| locations[0].source.host_organization_lineage_names | American Institute of Mathematical Sciences |
| locations[0].license | |
| locations[0].pdf_url | |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Journal of Industrial & Management Optimization |
| locations[0].landing_page_url | https://doi.org/10.3934/jimo.2019128 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5021937615 |
| authorships[0].author.orcid | https://orcid.org/0000-0003-3634-6786 |
| authorships[0].author.display_name | Vadim Azhmyakov |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Vadim Azhmyakov |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5048583436 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-0697-0257 |
| authorships[1].author.display_name | Juan Pablo Fernández-Gutiérrez |
| authorships[1].affiliations[0].raw_affiliation_string | Grupo de Investigación en Modelación y Computación Científica |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Juan P. Fernández-Gutiérrez |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Grupo de Investigación en Modelación y Computación Científica |
| authorships[2].author.id | https://openalex.org/A5026871182 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-0071-8763 |
| authorships[2].author.display_name | Erik I. Verriest |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Erik I. Verriest |
| authorships[2].is_corresponding | False |
| authorships[3].author.id | https://openalex.org/A5069985968 |
| authorships[3].author.orcid | https://orcid.org/0000-0001-5549-6259 |
| authorships[3].author.display_name | Stefan Pickl |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Stefan W. Pickl |
| authorships[3].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://doi.org/10.3934/jimo.2019128 |
| open_access.oa_status | diamond |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | A separation based optimization approach to Dynamic Maximal Covering Location Problems with switched structure |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T11502 |
| primary_topic.field.id | https://openalex.org/fields/14 |
| primary_topic.field.display_name | Business, Management and Accounting |
| primary_topic.score | 0.9979000091552734 |
| primary_topic.domain.id | https://openalex.org/domains/2 |
| primary_topic.domain.display_name | Social Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1407 |
| primary_topic.subfield.display_name | Organizational Behavior and Human Resource Management |
| primary_topic.display_name | Facility Location and Emergency Management |
| related_works | https://openalex.org/W1585007175, https://openalex.org/W3217415483, https://openalex.org/W4285677055, https://openalex.org/W3104770499, https://openalex.org/W1992731528, https://openalex.org/W2007843488, https://openalex.org/W1994436307, https://openalex.org/W1987021796, https://openalex.org/W2795565301, https://openalex.org/W4387886124 |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | doi:10.3934/jimo.2019128 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S114365116 |
| best_oa_location.source.issn | 1547-5816, 1553-166X |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 1547-5816 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | Journal of Industrial and Management Optimization |
| best_oa_location.source.host_organization | https://openalex.org/P4310315844 |
| best_oa_location.source.host_organization_name | American Institute of Mathematical Sciences |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310315844 |
| best_oa_location.source.host_organization_lineage_names | American Institute of Mathematical Sciences |
| best_oa_location.license | |
| best_oa_location.pdf_url | |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Journal of Industrial & Management Optimization |
| best_oa_location.landing_page_url | https://doi.org/10.3934/jimo.2019128 |
| primary_location.id | doi:10.3934/jimo.2019128 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S114365116 |
| primary_location.source.issn | 1547-5816, 1553-166X |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 1547-5816 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Journal of Industrial and Management Optimization |
| primary_location.source.host_organization | https://openalex.org/P4310315844 |
| primary_location.source.host_organization_name | American Institute of Mathematical Sciences |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310315844 |
| primary_location.source.host_organization_lineage_names | American Institute of Mathematical Sciences |
| primary_location.license | |
| primary_location.pdf_url | |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Journal of Industrial & Management Optimization |
| primary_location.landing_page_url | https://doi.org/10.3934/jimo.2019128 |
| publication_date | 2019-11-21 |
| publication_year | 2019 |
| referenced_works | https://openalex.org/W2048339046, https://openalex.org/W2505920944, https://openalex.org/W2791180494, https://openalex.org/W2013797831, https://openalex.org/W1553373771, https://openalex.org/W2044596392, https://openalex.org/W138419198, https://openalex.org/W2103051596, https://openalex.org/W2029076288, https://openalex.org/W2603214442 |
| referenced_works_count | 10 |
| abstract_inverted_index.A | 79 |
| abstract_inverted_index.a | 4, 11, 21, 45, 53, 103, 120, 126, 142, 165, 175 |
| abstract_inverted_index.<p | 0 |
| abstract_inverted_index.In | 48 |
| abstract_inverted_index.SM | 158 |
| abstract_inverted_index.We | 140 |
| abstract_inverted_index.an | 39, 62, 171 |
| abstract_inverted_index.is | 42, 161 |
| abstract_inverted_index.it | 89, 101 |
| abstract_inverted_index.of | 14, 26, 70, 83, 106, 146, 174 |
| abstract_inverted_index.on | 44 |
| abstract_inverted_index.to | 10, 91, 102, 125, 164, 170 |
| abstract_inverted_index.we | 51 |
| abstract_inverted_index.The | 111, 130, 156 |
| abstract_inverted_index.and | 60, 99, 151 |
| abstract_inverted_index.for | 30, 66, 116 |
| abstract_inverted_index.our | 49 |
| abstract_inverted_index.the | 27, 31, 35, 67, 71, 84, 93, 117, 136, 147 |
| abstract_inverted_index.(SM) | 115 |
| abstract_inverted_index.MCLP | 33, 55 |
| abstract_inverted_index.Most | 25 |
| abstract_inverted_index.also | 134, 152 |
| abstract_inverted_index.case | 37 |
| abstract_inverted_index.with | 20, 119 |
| abstract_inverted_index.DMCLP | 118, 148 |
| abstract_inverted_index.based | 56, 159 |
| abstract_inverted_index.class | 13 |
| abstract_inverted_index.fixed | 46 |
| abstract_inverted_index.given | 95 |
| abstract_inverted_index.leads | 124 |
| abstract_inverted_index.makes | 88 |
| abstract_inverted_index.newly | 5 |
| abstract_inverted_index.paper | 2 |
| abstract_inverted_index.under | 86 |
| abstract_inverted_index.where | 38 |
| abstract_inverted_index.Method | 114 |
| abstract_inverted_index.design | 173 |
| abstract_inverted_index.family | 105 |
| abstract_inverted_index.formal | 144 |
| abstract_inverted_index.making | 59 |
| abstract_inverted_index.method | 65 |
| abstract_inverted_index.mobile | 177 |
| abstract_inverted_index.reduce | 100 |
| abstract_inverted_index.simple | 108 |
| abstract_inverted_index.(MCLPs) | 19 |
| abstract_inverted_index.Dynamic | 73 |
| abstract_inverted_index.Maximal | 15, 74 |
| abstract_inverted_index.Problem | 77 |
| abstract_inverted_index.address | 34 |
| abstract_inverted_index.applied | 163 |
| abstract_inverted_index.classic | 137 |
| abstract_inverted_index.discuss | 153 |
| abstract_inverted_index.dynamic | 23, 54, 96 |
| abstract_inverted_index.extends | 3 |
| abstract_inverted_index.finally | 123, 162 |
| abstract_inverted_index.generic | 80 |
| abstract_inverted_index.namely, | 169 |
| abstract_inverted_index.network | 178 |
| abstract_inverted_index.optimal | 40, 57, 172 |
| abstract_inverted_index.present | 141 |
| abstract_inverted_index.problem | 98 |
| abstract_inverted_index.propose | 61 |
| abstract_inverted_index.results | 28 |
| abstract_inverted_index.scheme. | 129 |
| abstract_inverted_index."static" | 36 |
| abstract_inverted_index.(DMCLP). | 78 |
| abstract_inverted_index.Covering | 16, 75 |
| abstract_inverted_index.Lagrange | 138 |
| abstract_inverted_index.Location | 17, 76 |
| abstract_inverted_index.Problems | 18 |
| abstract_inverted_index.analysis | 145 |
| abstract_inverted_index.approach | 9 |
| abstract_inverted_index.aspects. | 155 |
| abstract_inverted_index.consider | 52 |
| abstract_inverted_index.decision | 41, 58 |
| abstract_inverted_index.example, | 168 |
| abstract_inverted_index.includes | 135 |
| abstract_inverted_index.obtained | 29 |
| abstract_inverted_index.oriented | 167 |
| abstract_inverted_index.possible | 90 |
| abstract_inverted_index.proposed | 157 |
| abstract_inverted_index.relative | 107 |
| abstract_inverted_index.rigorous | 143 |
| abstract_inverted_index.separate | 92 |
| abstract_inverted_index.solution | 128 |
| abstract_inverted_index.specific | 12, 104 |
| abstract_inverted_index.switched | 22, 121 |
| abstract_inverted_index.(dynamic) | 176 |
| abstract_inverted_index.algorithm | 133, 160 |
| abstract_inverted_index.auxiliary | 109 |
| abstract_inverted_index.developed | 6 |
| abstract_inverted_index.effective | 63 |
| abstract_inverted_index.numerical | 68, 132 |
| abstract_inverted_index.problems. | 110 |
| abstract_inverted_index.resulting | 131 |
| abstract_inverted_index.structure | 82, 122 |
| abstract_inverted_index.treatment | 69 |
| abstract_inverted_index.Separation | 113 |
| abstract_inverted_index.determined | 43 |
| abstract_inverted_index.originally | 94 |
| abstract_inverted_index.structure. | 24 |
| abstract_inverted_index.constraints | 85 |
| abstract_inverted_index.generalized | 112 |
| abstract_inverted_index.geometrical | 81 |
| abstract_inverted_index.methodology | 150 |
| abstract_inverted_index.practically | 166 |
| abstract_inverted_index.relaxation. | 139 |
| abstract_inverted_index.contribution | 50 |
| abstract_inverted_index.conventional | 32 |
| abstract_inverted_index.optimization | 8, 97, 149 |
| abstract_inverted_index.time-period. | 47 |
| abstract_inverted_index.computational | 7, 64, 127, 154 |
| abstract_inverted_index.consideration | 87 |
| abstract_inverted_index.switched-type | 72 |
| abstract_inverted_index.configuration. | 179 |
| abstract_inverted_index.style='text-indent:20px;'>This | 1 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 4 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/16 |
| sustainable_development_goals[0].score | 0.7900000214576721 |
| sustainable_development_goals[0].display_name | Peace, Justice and strong institutions |
| citation_normalized_percentile.value | 0.18100565 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |