Biased random-key genetic algorithms with applications in telecommunications

DOI10.1007/S11750-011-0176-XMaRDI QIDQ1935883zbMATH OpenOpenAlexFDO

Authors 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) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Recommendations

• A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
• A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm
• A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
• A biased random-key genetic algorithm for the minimization of open stacks problem

Cites work

• scientific article; zbMATH DE number 5070513 (Why is no real title available?)
• A HYBRID GENETIC ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM
• A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
• A biased random-key genetic algorithm for road congestion minimization
• A genetic algorithm for the resource constrained multi-project scheduling problem
• A genetic algorithm for the weight setting problem in OSPF routing
• A hybrid genetic algorithm for the job shop scheduling problem
• A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
• A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
• A note on two problems in connexion with graphs
• A random key based genetic algorithm for the resource constrained project scheduling problem
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Handbook of metaheuristics
• Heuristic solutions for general concave minimum cost network flow problems
• Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
• 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
• Survivable IP network design with OSPF routing
• The regenerator location problem

Cited in

(12)

• A biased random-key genetic algorithm for single-round divisible load scheduling
• A biased random-key genetic algorithm for the tree of hubs location problem
• Hybrid metaheuristics to solve a multiproduct two‐stage capacitated facility location problem
• Vehicle routing problem considering equity of demand satisfaction
• The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications
• Model and methods to address urban road network problems with disruptions
• A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm
• A biased random-key genetic algorithm for the minimization of open stacks problem
• A biased random-key genetic algorithm for the Steiner triple covering problem
• The double traveling salesman problem with partial last‐in‐first‐out loading constraints
• A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm
• A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935883)