scholarly journals The ring/κ-rings network design problem: Model and branch-and-cut algorithm

Networks ◽  
2016 ◽  
Vol 68 (2) ◽  
pp. 130-140 ◽  
Author(s):  
Inmaculada Rodríguez-Martín ◽  
Juan-José Salazar-González ◽  
Hande Yaman
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Branch And Cut ◽  
Network Design Problem ◽  
Problem Model

The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut

Networks ◽  
2006 ◽  
Vol 49 (1) ◽  
pp. 116-133 ◽  
Author(s):  
David Huygens ◽  
Martine Labbé ◽  
A. Ridha Mahjoub ◽  
Pierre Pesneau
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Valid Inequalities ◽  
Branch And Cut ◽  
Network Design Problem

Tabu Search Algorithm for Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows

2010 ◽  
Vol 56 (1) ◽  
pp. 41-48 ◽  
Author(s):  
Jakub Gładysz ◽  
Krzysztof Walkowiak
Keyword(s):  
Tabu Search ◽  
Network Design ◽  
Design Problem ◽  
Search Algorithm ◽  
Branch And Cut ◽  
Network Design Problem ◽  
Tabu Search Algorithm ◽  
Survivable Network Design ◽  
Network Cost ◽  
Survivable Network

Tabu Search Algorithm for Survivable Network Design Problem with Simultaneous Unicast and Anycast FlowsIn this work we focus on the problem of survivable network design for simultaneous unicast and anycast flows. This problem follows from the growing popularity of network services applying the anycast paradigm. The anycasting is defined as one-to-one-of-many transmission and is applied in Domain Name Service (DNS), peer-to-peer (P2P) systems, Content Delivery Networks (CDN). In this work we formulate two models that enables joint optimization of network capacity, working and backup connections for both unicast and anycast flows. The goal is to minimize the network cost required to protect the network against failures using the single backup path approach. In the first model we consider modular link cost, in the second we are given a set of link proposal and we must select only one of them. Because these problems are NP-hard, therefore optimal solutions of branch-and-bounds or branch-and-cut methods can be generated for relatively small networks. Consequently, we propose a new heuristic algorithm based on Tabu Search method. We present results showing the effectiveness the proposed heuristic compared against optimal results. Moreover, we report results showing that the use of anycast paradigm can reduce the network cost.

Electric Transit Route Network Design Problem: Model and Application

2019 ◽  
Vol 2673 (8) ◽  
pp. 264-274 ◽  
Author(s):  
Christina Iliopoulou ◽  
Ioannis Tassopoulos ◽  
Konstantinos Kepaptsoglou ◽  
Grigorios Beligiannis
Keyword(s):  
Network Design ◽  
Public Transportation ◽  
Design Problem ◽  
Network Design Problem ◽  
Test Bed ◽  
Problem Model ◽  
Charging Infrastructure ◽  
Route Network ◽  
Proposed Model ◽  
Transit Route

Electric buses have long been recognized as a promising direction for offering sustainable public transportation services. While range and battery performance constraints have hindered the widespread adoption of electric buses in the past, technological advances make them a prominent and attractive option for public transportation in the future. Still, operational constraints and the need for additional (charging) infrastructure highlight the need for introducing appropriate decision-making tools, tailor-made for supporting the design of transit networks operated by electric buses. This paper focuses on developing and testing a comprehensive route design model for the case of a transit network, operated exclusively by an electric bus fleet (Electric Transit Route Network Design Problem—E-TRNDP). The model is formulated as a bi-level optimization problem, which attempts to jointly design efficient transit routes and locate required charging infrastructure. A multi-objective, particle swarm optimization algorithm, coupled with a mixed linear—integer programming model is used to solve the model. An existing benchmark network is used as a test-bed for the proposed model and solution process; results illustrate that the proposed model and solution method yield realistic design outcomes in an acceptable time frame.

A branch and cut algorithm for the hierarchical network design problem

2010 ◽  
Vol 200 (1) ◽  
pp. 28-35 ◽  
Author(s):  
Carlos Obreque ◽  
Macarena Donoso ◽  
Gabriel Gutiérrez ◽  
Vladimir Marianov
Keyword(s):  
Network Design ◽  
Design Problem ◽  
Branch And Cut ◽  
Network Design Problem ◽  
Hierarchical Network
Sign in / Sign up

Export Citation Format

Share Document