A biased random-key genetic algorithm for the capacitated minimum spanning tree problem

DOI10.1016/j.cor.2014.11.011zbMath1348.90553OpenAlexW2008778291MaRDI QIDQ337493

Maria Albareda-Sambola, Elena Fernández, Mauricio G. C. Resende, Efrain Ruiz

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/27676

zbMATH Keywords

optimizationheuristicscombinatorial optimizationnetworksgraphstreesspanning treesbiased random-key genetic algorithmcapacitated minimum spanning tree

Mathematics Subject Classification ID

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

Related Items

A new way to produce key streams based on chaotic sequences, A C++ application programming interface for co-evolutionary biased random-key genetic algorithms for solution and scenario generation, A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem, A biased random-key genetic algorithm for the maximum quasi-clique problem, A biased random-key genetic algorithm for the container pre-marshalling problem, A biased random-key genetic algorithm for the project scheduling problem with flexible resources, A biased random-key genetic algorithm for the tree of hubs location problem, A diversity-based genetic algorithm for scenario generation, To improve the performance of genetic algorithms by using a novel selection operator, A new selection operator for genetic algorithms that balances between premature convergence and population diversity, Bi-objective scheduling on a restricted batching machine, A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants, A genetic algorithm applied to optimal allocation in stratified sampling

Uses Software

• Tabu search

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• A biased random-key genetic algorithm for road congestion minimization
• A biased random-key genetic algorithm for the Steiner triple covering problem
• Enhanced second order algorithm applied to the capacitated minimum spanning tree problem
• A random key based genetic algorithm for the resource constrained project scheduling problem
• Dynamic programming based heuristics for the topological design of local access networks
• Multicommodity flow models for spanning trees with hop constraints
• Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
• A parallel multi-population biased random-key genetic algorithm for a container loading problem
• The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
• A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
• Representations for genetic and evolutionary algorithms. With a foreword by David E. Goldberg.
• The capacitated minimum spanning tree problem: On improved multistar constraints
• RAMP for the capacitated minimum spanning tree problem
• Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
• Savings based ant colony optimization for the capacitated minimum spanning tree problem
• A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
• Topological design of centralized computer networks—formulations and algorithms
• The complexity of the capacitated tree problem
• Approximation Algorithms for Some Postman Problems
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• Multistars and directed flow formulations
• A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
• A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
• Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
• Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
• Unnamed Item
• Unnamed Item
• Unnamed Item