Agile optimization for a real‐time facility location problem in Internet of Vehicles networks

The uncapacitated facility location problem (UFLP) is a popular NP‐hard optimization problem that has been traditionally applied to logistics and supply networks, where decisions are difficult to reverse. However, over the years, many new application domains have emerged, in which real‐time optimiza...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Networks Ročník 79; číslo 4; s. 501 - 514
Hlavní autoři: Martins, Leandro do C., Tarchi, Daniele, Juan, Angel A., Fusco, Alessandro
Médium: Journal Article
Jazyk:angličtina
Vydáno: Hoboken, USA John Wiley & Sons, Inc 01.06.2022
Wiley Subscription Services, Inc
Témata:
agile optimization
Algorithms
biased‐randomized heuristics
Internet of Vehicles
Logistics
Operations research
Optimization
real‐time optimization
Roadsides
Site selection
smart cities
uncapacitated facility location problem
Vehicles
Virtual networks
ISSN:0028-3045, 1097-0037
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í:The uncapacitated facility location problem (UFLP) is a popular NP‐hard optimization problem that has been traditionally applied to logistics and supply networks, where decisions are difficult to reverse. However, over the years, many new application domains have emerged, in which real‐time optimization is needed, such as Internet of Vehicles (IoV), virtual network functions placement, and network controller placement. IoV scenarios take into account the presence of multiple roadside units (RSUs) that should be frequently assigned to operating vehicles. To ensure the desired quality of service level, the allocation process needs to be carried out frequently and efficiently, as vehicles' demands change. In this dynamic environment, the mapping of vehicles to RSUs needs to be reoptimized periodically over time. Thus, this article proposes an agile optimization algorithm, which is tested using existing benchmark instances. The experiments show that it can efficiently generate high‐quality and real‐time results in dynamic IoV scenarios.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0028-3045
1097-0037
DOI:10.1002/net.22067