A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks

DOI10.1007/s11590-012-0505-5zbMath1276.90077OpenAlexW2054006251MaRDI QIDQ360513

Dalila B. M. M. Fontes, José Fernando Gonçalves

Publication date: 27 August 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: http://repositorio.inesctec.pt/handle/123456789/5267

zbMATH Keywords

genetic algorithmslocal searchnetwork flowsgeneral nonlinear costshop-constrained treesmulti-population

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

A biased random-key genetic algorithm for the unequal area facility layout problem ⋮ A biased random-key genetic algorithm for the tree of hubs location problem ⋮ A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects ⋮ A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation ⋮ The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach ⋮ A Genetic Algorithm for Scheduling Alternative Tasks Subject to Technical Failure

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch and bound algorithm for the robust spanning tree problem with interval data
• Bilinear modeling solution approach for fixed charge network flow problems
• A hop constrained min-sum arborescence with outage costs
• Multicommodity flow models for spanning trees with hop constraints
• A parallel multi-population biased random-key genetic algorithm for a container loading problem
• The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
• Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
• A genetic algorithm for the resource constrained multi-project scheduling problem
• Packet reordering in networks with heavy-tailed delays
• A hybrid genetic algorithm for the job shop scheduling problem
• A branch-and-bound algorithm for concave network flow problems
• A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
• A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
• Heuristic solutions for general concave minimum cost network flow problems
• Adjacent extreme flows and application to min concave cost flow problems
• Large-Scale Network Topological Optimization
• Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
• A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
• Network design techniques using adapted genetic algorithms
• Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem

This page was built for publication: A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks