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

@article{Fontes2013AMH,
  title={A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks},
  author={Dalila B.M.M. Fontes and Jos{\'e} Fernando Gonçalves},
  journal={Optimization Letters},
  year={2013},
  volume={7},
  pages={1303-1324}
}
Genetic algorithms and other evolutionary algorithms have been successfully applied to solve constrained minimum spanning tree problems in a variety of communication network design problems. In this paper, we enlarge the application of these types of algorithms by presenting a multi-population hybrid genetic algorithm to another communication design problem. This new problem is modeled through a hop-constrained minimum spanning tree also exhibiting the characteristic of flows. All nodes, except… 

Hop-constrained Minimum Spanning Tree Problems in Nonlinear Cost Network Flows : an Ant Colony Optimization Approach

This work proposes a hybrid heuristic, based on Ant Colony Optimization and on Local Search, to solve this class of problems given its combinatorial nature and also that the total costs are nonlinearly flow dependent with a fixed-charge component.

The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach

This work proposes a hybrid heuristic, based on ant colony optimization and on local search, to solve the Hop-Constrained Minimum cost Flow Spanning Tree problem with nonlinear costs, and proves to be able to find an optimum solution in more than 75 % of the runs.

Solving Hop-constrained MST problems with ACO

The proposed heuristic is a hybrid metaheuristic based on Ant Colony Optimization and Local Search and improves upon the computational time used by CPLEX and was always lower than that of the MPGA.

A hybrid biased random key genetic algorithm approach for the unit commitment problem

The algorithm developed is a hybrid biased random key genetic algorithm (HBRKGA) that uses random keys to encode the solutions and introduces bias both in the parent selection procedure and in the crossover strategy.

A biased random-key genetic algorithm for the tree of hubs location problem

This paper proposes a biased random key genetic algorithm for solving the tree of hubs location problem, in which hubs are connected by means of a tree and the overall network infrastructure relies on a spanning tree.

Survey on applications of biased-random key genetic algorithms for solving optimization problems

From the survey, a number of findings include: number of studies tends to increase over the last five years dealing with various combinatorial optimization problems, however limited research deals with continuous variables, and local search procedure is the typical hybridization method used to enhance the performance of the algorithms.

A Metaheuristic Approach to the Multi-Objective Unit Commitment Problem Combining Economic and Environmental Criteria

This work proposes to address the UCP with environmental concerns as a multi-objective problem and use a metaheuristic approach combined with a non-dominated sorting procedure to solve it and shows that the method proposed compares favourably against alternative approaches in most cases analysed.

Optimization Methods for the Unit Commitment Problem in Electric Power Systems

The algorithm proposed is a variant of the random key genetic algorithm, since bias is introduced in the parent selection procedure, as well as in the crossover strategy, which has shown the proposed methodology to be an effective and effective combinatorial optimization method.

Random-Key Genetic Algorithms

This chapter reviews random-key genetic algorithms and describes an effective variant called biased random-keys genetic algorithms, an evolutionary metaheuristic for discrete and global optimization.

References

SHOWING 1-10 OF 48 REFERENCES

A new genetic algorithm for the degree-constrained minimum spanning tree problem

The proposed genetic algorithm for the degree-constrained minimum spanning tree (d-MST) is a novel genetic algorithm that is very easy to execute, and the offspring generated by them always represent feasible spanning trees.

Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks

  • D. Fontes
  • Computer Science
    INFOR Inf. Syst. Oper. Res.
  • 2010
A dynamic programming approach is developed, which extends the scope of application of a previous work, to solve to optimality such problems as hop-constrained minimum cost flow spanning tree problem.

Recent network design techniques using evolutionary algorithms

A genetic algorithm for the capacitated minimum spanning tree problem

A new crossover operator is suggested, applied directly to the tree (phenotype) instead of to the chromosome, which proved to be effective when compared with the genetic algorithm of Raidl and Drexel (on benchmark data sets) in which presented better performance than various classical methods of the literature.

Heuristic solutions for general concave minimum cost network flow problems

From the results reported, it can be shown that the hybrid methodology improves upon previous approaches in terms of efficiency and also on the pure genetic algorithm, i.e., without using the local search procedure.

A new genetic algorithm with local search method for degree-constrained minimum spanning tree problem

  • Yong ZengYu-Ping Wang
  • Computer Science
    Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003
  • 2003
A new evolutionary algorithm for degree-constrained minimum spanning tree problem, which is an NP-complete problem, is proposed, and Prufer encoding method is adopted to encode the solutions of the

Network design techniques using adapted genetic algorithms

A Benders decomposition approach for the robust spanning tree problem with interval data

A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem

This paper presents a biased random-key genetic algorithm for the resource constrained project scheduling problem that is based on random keys and tested on a set of standard problems taken from the literature and compared with other approaches.