Path planning for cooperative routing of air-ground vehicles
SG Manyam, DW Casbeer… - 2016 American Control …, 2016 - ieeexplore.ieee.org
We consider a cooperative vehicle routing problem for surveillance and reconnaissance
missions with communication constraints between the vehicles. We propose a framework …
missions with communication constraints between the vehicles. We propose a framework …
Cooperative routing for an air–ground vehicle team—exact algorithm, transformation method, and heuristics
This paper considers a cooperative vehicle routing problem for an intelligence, surveillance,
and reconnaissance mission in the presence of communication constraints between the …
and reconnaissance mission in the presence of communication constraints between the …
A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours
CC De Freitas, DJ Aloise, FF Da Costa Fontes… - OR Spectrum, 2023 - Springer
In this article, a solution is proposed through a population-based metaheuristic for the Two-
level Hub Location Routing Problem with Directed Tours (THLRP-DT). Hubs are facilities …
level Hub Location Routing Problem with Directed Tours (THLRP-DT). Hubs are facilities …
A variable neighbourhood decomposition search approach applied to a global liner shipping network using a hub-and-spoke with sub-hub structure
FFC Fontes, G Goncalves - International Journal of Production …, 2021 - Taylor & Francis
This paper presents a new concept for a hub-and-spoke network structure, called “sub-hub”,
applied to global operations of liner shipping. Hub-and-spoke networks are widely used in …
applied to global operations of liner shipping. Hub-and-spoke networks are widely used in …
Modeling and solving the two-level generalized median tour problem
C Obreque, G Paredes-Belmar… - Computers & Operations …, 2024 - Elsevier
In many real-world situations, the beneficiaries of a distribution system may be grouped into
clusters, requiring a transportation structure to serve each cluster of beneficiaries efficiently …
clusters, requiring a transportation structure to serve each cluster of beneficiaries efficiently …
A branch-and-cut algorithm for two-level survivable network design problems
I Rodríguez-Martín, JJ Salazar-González… - Computers & Operations …, 2016 - Elsevier
This paper approaches the problem of designing a two-level network protected against
single-edge failures. The problem simultaneously decides on the partition of the set of nodes …
single-edge failures. The problem simultaneously decides on the partition of the set of nodes …
The ring/κ‐rings network design problem: Model and branch‐and‐cut algorithm
This article considers the problem of designing a two‐level network where the upper level
consists of a backbone ring network connecting the so‐called hub nodes, and the lower …
consists of a backbone ring network connecting the so‐called hub nodes, and the lower …
Using metaheuristic algorithms for solving a hub location problem: application in passive optical network planning
M Rabbani, M Ravanbakhsh, H Farrokhi-Asl… - International Journal of …, 2017 - ijsom.com
Nowadays, fiber-optic due to having greater bandwidth and being more efficient compared
with other similar technologies, are counted as one the most important tools for data transfer …
with other similar technologies, are counted as one the most important tools for data transfer …
Survivability in hierarchical telecommunications networks under dual homing
OYAE Karaşan, AR Mahjoub… - INFORMS Journal …, 2014 - pubsonline.informs.org
The motivation behind this study is the essential need for survivability in the
telecommunications networks. An optical signal should find its destination even if the …
telecommunications networks. An optical signal should find its destination even if the …
Hierarchical survivable network design problems
I Rodríguez-Martín, JJ Salazar-González… - Electronic Notes in …, 2016 - Elsevier
We address the problem of designing two-level networks protected against single edge
failures. A set of nodes must be partitioned into terminals and hubs, hubs must be connected …
failures. A set of nodes must be partitioned into terminals and hubs, hubs must be connected …