Cooling schedules for optimal annealing
Mathematics of Operations Research
New performance-driven FPGA routing algorithms
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
An efficient multicast approach in an ATM switching network for multimedia applications
Journal of Network and Computer Applications
A new approximation algorithm for the Steiner tree problem with performance ratio 5/3
Journal of Algorithms
A hybrid genetic algorithm for the point to multipoint routing problem with single split paths
Proceedings of the 2001 ACM symposium on Applied computing
Theoretical Computer Science
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
A note on distributed multicast routing in point-to-point networks
Computers and Operations Research
SIAM Review
Fast parallel heuristics for the job shop scheduling problem
Computers and Operations Research
A performance study of multicast routing algorithms for ATM networks
LCN '96 Proceedings of the 21st Annual IEEE Conference on Local Computer Networks
A framework for multicast video streaming over IP networks
Journal of Network and Computer Applications
TSDLMRA: an efficient multicast routing algorithm based on tabu search
Journal of Network and Computer Applications
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
Applying tabu search to backup path planning for multicast networks
Computers and Operations Research
Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning
Evolutionary Computation
IEEE Transactions on Mobile Computing
OMNI: an efficient overlay multicast infrastructure for real-time applications
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
Genetic local search for multicast routing
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Multicast algorithms in service overlay networks
Computer Communications
Research challenges in QoS routing
Computer Communications
An orthogonal genetic algorithm for multimedia multicast routing
IEEE Transactions on Evolutionary Computation
Short Survey: A survey of application level multicast techniques
Computer Communications
Multipoint communication: a survey of protocols, functions, and mechanisms
IEEE Journal on Selected Areas in Communications
Evaluation of multicast routing algorithms for real-time communication on high-speed networks
IEEE Journal on Selected Areas in Communications
Convergence analysis of canonical genetic algorithms
IEEE Transactions on Neural Networks
Computational Biology and Chemistry
MOEAQ: A QoS-Aware Multicast Routing algorithm for MANET
Expert Systems with Applications: An International Journal
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.01 |
Over the past few years, several local search algorithms have been proposed for various problems related to multicast routing in the off-line mode. We describe a population-based search algorithm for cost minimisation of multicast routing. The algorithm utilises the partially mixed crossover operation (PMX) under the elitist model: for each element of the current population, the local search is based upon the results of a landscape analysis that is executed only once in a pre-processing step; the best solution found so far is always part of the population. The aim of the landscape analysis is to estimate the depth of the deepest local minima in the landscape generated by the routing tasks and the objective function. The analysis employs simulated annealing with a logarithmic cooling schedule (logarithmic simulated annealing-LSA). The local search then performs alternating sequences of descending and ascending steps for each individual of the population, where the length of a sequence with uniform direction is controlled by the estimated value of the maximum depth of local minima. We present results from computational experiments on three different routing tasks, and we provide experimental evidence that our genetic local search procedure that combines LSA and PMX performs better than algorithms using either LSA or PMX only.