Metaheuristics for optimization problems in computer communications

Ribeiro, Celso C.; Martins, Simone L.; Rosseti, Isabel

doi:10.1016/j.comcom.2006.08.027

Cited by 38 publications

(15 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Introducing this idea for nonlinear delay in multi-commodity problem and also the imprecise version of multi-commodity flow problem are our future works. Also implementing a decision support system including a variety of meta-heuristic algorithms [20] for the problem addressed by this paper will be pursued in next research. Table 12 The computational time of some algorithms for transmission of 11 pairs of commodities in network depicted in Fig.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

QoS-based cooperative algorithm for integral multi-commodity flow problem

Ghatee

2011

Computer Communications

View full text Add to dashboard Cite

Section: Resultsmentioning

confidence: 99%

“…The demands between each couple of nodes are assumed as random numbers between 0 and 2000. The number of commodities are chosen as 2,5,7,9,10,15,20,25,30, 40 and 50. The couples of origin-destination nodes are chosen randomly.…”

Section: Numerical Testsmentioning

confidence: 99%

QoS-based cooperative algorithm for integral multi-commodity flow problem

Ghatee

2011

Computer Communications

View full text Add to dashboard Cite

“…Tagawa et al (2007) deal with the robust design of Surface Acoustic Wave (SAW) filters. Ribeiro et al (2007) consider VNS and other metaheuristics for optimization problems in computer communications.…”

Section: Industrial Applicationsmentioning

confidence: 99%

Variable neighbourhood search: methods and applications

2009

View full text Add to dashboard Cite

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building heuristics, based upon systematic changes of neighbourhoods both in descent phase, to find a local minimum, and in perturbation phase to emerge from the corresponding valley. It was first proposed in 1997 and has since then rapidly developed both in its methods and its applications. In the present paper, these two aspects are thoroughly reviewed and an extensive bibliography is provided. Moreover, one section is devoted to newcomers. It consists of steps for developing a heuristic for any particular problem. Those steps are common to the implementation of other metaheuristics.

show abstract

“…The method to find a feasible BS assignment under a given snapshot is realized using the simulated annealing (SA) technique [16]. The algorithm aims to maximize the system M N utility U =LLuijbij while it searches for a feasible BS i=1 j=1 assignment.…”

Section: Algorithm Descriptionmentioning

confidence: 99%

Performance analysis of transport and radio load balancing strategies for BS assignment in mobile access networks

Novillo

Galeana

Lainz

et al. 2008

2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications

View full text Add to dashboard Cite

In mobile access networks, base station (BS) assignment mecbanisms are mainly driven by radio conditions since it is generally assumed tbat tbe limiting factor is tbe air interface. Tbis assumption bas been proven to be very reasonable wben circuit voice was tbe dominant service and backbaul capacity provisioning accounting for tbe peak rate at tbe BSs was an economically feasible option. However, as more efficient air interface tecbnologies are introduced along witb bigber data rate services, a growing concern is tbat tbe transport part of tbe mobile network can also represent a bottleneck. In tbis paper we analyze a BS assignment strategy tbat simultaneously exploits load balancing in botb tbe radio interface and tbe transport backbaullinks. Tbe BS assignment problem is solved by means of Simulated Annealing beuristics under different deployment scenarios comprising partially-limited backbaul Radio Access Networks (RANs) and tbe presence of traffic botspots. Results acbieved for tbe proposed BS assignment strategy are compared to tbose obtained by common strategies sucb as minimum patb loss (MPL) and load balancing radio (LBR).

show abstract

Metaheuristics for optimization problems in computer communications

Cited by 38 publications

References 45 publications

QoS-based cooperative algorithm for integral multi-commodity flow problem

QoS-based cooperative algorithm for integral multi-commodity flow problem

Variable neighbourhood search: methods and applications

Performance analysis of transport and radio load balancing strategies for BS assignment in mobile access networks

Contact Info

Product

Resources

About