A Tabu Search algorithm for the optimisation of telecommunication networks

Costamagna, E.; Fanni, Alessandra; Giacinto, Giorgio

doi:10.1016/s0377-2217(97)00279-8

Cited by 25 publications

(9 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Costamagna, Fanni and Giacinto (1995) develop a tabu search algorithm for topological optimization of broad band communication networks whose structure is based on a single exchange and on a number of multiplexing centers.…”

Section: Optimization Of A-isdn Telecommunication Networkmentioning

confidence: 99%

Tabu Search

Glover¹,

Laguna²

1997

3,305

1,610

View full text Add to dashboard Cite

Section: Optimization Of A-isdn Telecommunication Networkmentioning

confidence: 99%

Tabu Search

Glover¹,

Laguna²

1997

3,305

1,610

View full text Add to dashboard Cite

“…Short tabu tenures allow close examination of a region, while long tabu tenures help moving to different parts of the solution space [10]. To provide a balance between intensification and diversification, this paper uses dynamic tabu tenure.…”

Section: Dynamic Tabu Tenurementioning

confidence: 99%

Bi-objective scheduling of flexible flow lines: a gradual transition tabu search approach

Zandieh

Abiri

Rahmati

2016

Prod. Eng. Res. Devel.

View full text Add to dashboard Cite

This paper deals with flexible flow line scheduling problem. Studied researches of the literature assumed that either no setup has to be performed or that setup times are sequence-independent, chiefly. Besides, they are mostly conducted in single objective environment. Therefore, in this study, these two real world concepts are mimicked in the flow line model. The considered objectives of the proposed model are minimizing makespan and total tardiness. Due to the hard solvability of the problem, this research proposes a new multi-objective algorithm based on the single objective tabu search, called gradual transition tabu search (GTTS). GTTS is implemented in two phases and in each phase it tries to gradually modify one objective to the other objective. The neighborhood search efficiency is also improved by defining new candidate list strategies and implementing new dynamic tabu tenure. In addition, the results of the proposed algorithm are compared with two popular existing algorithms, called fast non-dominated sort genetic algorithm (NSGA-II) and multi-objective genetic algorithm, on a number of randomly generated test problems. The suitability of GTTS is demonstrated through different multi-objective evaluation metrics.

show abstract

“…Given a probabilistic network G with a specified node set K ⊂ V , K-terminal reliability is defined as the probability that every node in K can communicate with every other node in K; i.e., there exists at least one path between every pair of nodes in K. For backbone networks, all-terminal reliability, the probability that all network nodes are directly or indirectly connected (i.e., K = V , is the predominant reliability measure because these networks are expected to provide connectivity service for all possible node pairs. Several papers have addressed the network design problem considering all-terminal reliability (Jan 1993;Jan et al 1993;Kumar et al 1995;Dengiz et al 1997a, b;Costamagna et al 1998;Deeter and Smith 1998;AboElFotoh and Al-Sumait 2001;Srivaree-ratana et al 2002;Kroese et al 2007;Ramirez-Marquez and Rocco 2008;Watcharasitthiwat and Wardkein 2009). …”

Section: Introductionmentioning

confidence: 99%

“…However, the majority of work in network reliability focuses on the reliability analysis of a given network. A minority of them (Taka and Abe 1994;Costamagna et al 1998;Deeter and Smith 1998;Dengiz et al 1997a, b;Jan 1993a;Jan et al 1993b;Kumar et al 1995;Liu and Iwamura 2000;AboElFotoh and Al-Sumait 2001;Soni et al 2004;Kroese et al 2007;Ramirez-Marquez and Rocco 2008;Watcharasitthiwat and Wardkein 2009) address the design problem.…”

Section: Introductionmentioning

confidence: 99%

Efficient Optimization of Reliable Two-Node Connected Networks: A Biobjective Approach

Konak¹,

Smith

2011

INFORMS Journal on Computing

View full text Add to dashboard Cite

T his paper presents a biobjective genetic algorithm (GA) to design reliable two-node connected telecommunication networks. Because the exact calculation of the reliability of a network is NP-hard, network designers have been reluctant to use network reliability as a design criterion; however, it is clearly an important aspect. Herein, three methods of reliability assessment are developed: an exact reliability calculation method using factoring, an efficient Monte Carlo estimation procedure using the sequential construction technique and network reductions, and an upper bound for the all-terminal reliability of networks with arbitrary arc reliabilities. These three methods of reliability assessment are used collectively in a biobjective GA with specialized mutation operators that perturb solutions without disturbing two-node connectivity. Computational experiments show that the proposed approach is tractable and significantly improves upon the results found by single-objective heuristics.

show abstract

A Tabu Search algorithm for the optimisation of telecommunication networks

Cited by 25 publications

References 18 publications

Tabu Search

Tabu Search

Bi-objective scheduling of flexible flow lines: a gradual transition tabu search approach

Efficient Optimization of Reliable Two-Node Connected Networks: A Biobjective Approach

Contact Info

Product

Resources

About