Biased random-key genetic algorithms with applications in telecommunications

DOI10.1007/S11750-011-0176-XzbMath1267.90126OpenAlexW1996472849MaRDI QIDQ1935883

Mauricio G. C. Resende

Publication date: 20 February 2013

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-011-0176-x

zbMATH Keywords

heuristicscombinatorial optimizationmetaheuristicsgenetic algorithmbiased random-key genetic algorithmrandom keysoptimization in telecommunications

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (8)

A biased random-key genetic algorithm for the tree of hubs location problem ⋮ Model and methods to address urban road network problems with disruptions ⋮ The double traveling salesman problem with partial last‐in‐first‐out loading constraints ⋮ A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm ⋮ Hybrid metaheuristics to solve a multiproduct two‐stage capacitated facility location problem ⋮ A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm ⋮ A biased random-key genetic algorithm for single-round divisible load scheduling ⋮ Vehicle routing problem considering equity of demand satisfaction

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• A biased random-key genetic algorithm for road congestion minimization
• Increasing internet capacity using local search
• Routing and wavelength assignment by partition colouring
• Routing and wavelength assignment in optical networks using bin packing based algorithms
• A random key based genetic algorithm for the resource constrained project scheduling problem
• A genetic algorithm for the weight setting problem in OSPF routing
• A genetic algorithm for the resource constrained multi-project scheduling problem
• Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
• A hybrid genetic algorithm for the job shop scheduling problem
• A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
• The regenerator location problem
• A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
• Survivable IP network design with OSPF routing
• Heuristic solutions for general concave minimum cost network flow problems
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
• A HYBRID GENETIC ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM
• Handbook of metaheuristics

This page was built for publication: Biased random-key genetic algorithms with applications in telecommunications