A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem

2000 ◽  
Vol 34 (4) ◽  
pp. 364-380 ◽  
Author(s):  
Klaus Büdenbender ◽  
Tore Grünert ◽  
Hans-Jürgen Sebastian
Keyword(s):  
Tabu Search ◽  
Network Design ◽  
Branch And Bound ◽  
Design Problem ◽  
Branch And Bound Algorithm ◽  
Network Design Problem ◽  
Direct Flight

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.

APPLYING METAHEURISTICS TO FEEDER BUS NETWORK DESIGN PROBLEM

2004 ◽  
Vol 21 (04) ◽  
pp. 543-560 ◽  
Author(s):  
S. N. KUAN ◽  
H. L. ONG ◽  
K. M. NG
Keyword(s):  
Simulated Annealing ◽  
Tabu Search ◽  
Network Design ◽  
Computational Efficiency ◽  
Design Problem ◽  
Network Design Problem ◽  
Test Problems ◽  
Solution Quality ◽  
Feeder Bus ◽  
Bus Network

This paper proposes the design and analysis of two metaheuristics, simulated annealing (SA) and tabu search (TS), for solving the feeder bus network design problem. The results are compared to those published in the literature. A comparative study is also carried out on several test problems generated at random to evaluate the performance of these heuristics in terms of their computational efficiency and solution quality. Computational experiments have shown that TS is a more effective metaheuristic in solving the problem than SA.

Sign in / Sign up

Export Citation Format

Share Document