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

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

Cites Work

Title not available (Why is that?)
Introduction to algorithms
A genetic algorithm for the resource constrained multi-project scheduling problem
Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
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
Title not available (Why is that?)
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
A parallel multi-population biased random-key genetic algorithm for a container loading problem
Packet reordering in networks with heavy-tailed delays
A hybrid genetic algorithm for the job shop scheduling problem
Multicommodity flow models for spanning trees with hop constraints
The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
Large-Scale Network Topological Optimization
A branch and bound algorithm for the robust spanning tree problem with interval data
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
Heuristic solutions for general concave minimum cost network flow problems
Adjacent extreme flows and application to min concave cost flow problems
Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
Network design techniques using adapted genetic algorithms
Bilinear modeling solution approach for fixed charge network flow problems
A hop constrained min-sum arborescence with outage costs

Cited In (8)

Title not available (Why is that?)
A biased random-key genetic algorithm for the tree of hubs location problem
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
Optimizing job shop scheduling with speed-adjustable machines and peak power constraints: a mathematical model and heuristic solutions
A biased random-key genetic algorithm for the unequal area facility layout 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

Uses Software

OR-Library

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

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