Dynamic unsplittable flows with path-change penalties: New formulations and solution schemes for large instances

Lamothe, François; Rachelson, Emmanuel; Haït, Alain; Baudoin, Cédric; Dupé, Jean-Baptiste

doi:10.1016/j.cor.2023.106154

Cited by 2 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It has multiple applications, as for instance in telecommunication networks (e.g. optical networks, telecommunication satellites [18,31]), and logistics [23]. The early work of Belaidouni and Ben-Ameur [5] studied the UFP from a polyhedral perspective, proposing cutting planes to strengthen the linear relaxation of a three-index model that uses variables x ijk for every arc pi, jq in the network and every commodity k to be transported.…”

Section: Application To the Unsplittable Flow Problemmentioning

confidence: 99%

On the integration of Dantzig-Wolfe and Fenchel decompositions via directional normalizations

Lamothe¹,

Haït²,

Rachelson³

et al. 2023

Preprint

View full text Add to dashboard Cite

The strengthening of linear relaxations and bounds of mixed integer linear programs has been an active research topic for decades. Enumerationbased methods for integer programming like linear programming-based branchand-bound exploit strong dual bounds to fathom unpromising regions of the feasible space. In this paper, we consider the strengthening of linear programs via a composite of Dantzig-Wolfe and Fenchel decompositions. We provide geometric interpretations of these two classical methods. Motivated by these geometric interpretations, we introduce a novel approach for solving Fenchel sub-problems and introduce a novel decomposition combining Dantzig-Wolfe and Fenchel decompositions in an original manner. We carry out an extensive computational campaign assessing the performance of the novel decomposition on the unsplittable flow problem. Very promising results are obtained when the new approach is compared to classical decomposition methods.

show abstract

Section: Application To the Unsplittable Flow Problemmentioning

confidence: 99%

On the integration of Dantzig-Wolfe and Fenchel decompositions via directional normalizations

Lamothe¹,

Haït²,

Rachelson³

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…The low-orbit satellite network model is defined as an unsplittable multi-commodity flow problem (UMCF) [15], which is then modeled as an MILP problem.…”

Section: Introductionmentioning

confidence: 99%

A Routing Strategy Based Genetic Algorithm Assisted by Ground Access Optimization for LEO Satellite Constellations

Zhang,

Lv,

et al. 2023

Electronics

View full text Add to dashboard Cite

Large-scale low Earth orbit satellite networks (LSNs) have been attracting increasing attention in recent years. These systems offer advantages such as low latency, high bandwidth communication, and all terrain coverage. However, the main challenges faced by LSNs is the calculation and maintenance of routing strategies. This is primarily due to the large scale and dynamic network topology of LSN constellations. As the number of satellites in constellations continues to rise, the feasibility of the centralized routing strategy, which calculates all shortest routes between every satellite, becomes increasingly limited by space and time constraints. This approach is also not suitable for the Walker Delta formation, which is becoming more popular for giant constellations. In order to find an effective routing strategy, this paper defines the satellite routing problem as a mixed linear integer programming problem (MILP), proposes a routing strategy based on a genetic algorithm (GA), and comprehensively considers the efficiency of source or destination ground stations to access satellite constellations. The routing strategy integrates ground station ingress and exit policies and inter-satellite packet forwarding policies and reduces the cost of routing decisions. The experimental results show that, compared with the traditional satellite routing algorithm, the proposed routing strategy has better link capacity utilization, a lower round trip communication time, and an improved traffic reception rate.

show abstract

Dynamic unsplittable flows with path-change penalties: New formulations and solution schemes for large instances

Cited by 2 publications

References 14 publications

On the integration of Dantzig-Wolfe and Fenchel decompositions via directional normalizations

On the integration of Dantzig-Wolfe and Fenchel decompositions via directional normalizations

A Routing Strategy Based Genetic Algorithm Assisted by Ground Access Optimization for LEO Satellite Constellations

Contact Info

Product

Resources

About