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

DOI10.1007/S11590-014-0762-6MaRDI QIDQ2018861zbMATH OpenOpenAlexFDO

Authors Marta S. R. Monteiro, Dalila B. M. M. Fontes, Fernando Fontes

Publication date 25 March 2015

Published in Optimization Letters (Search for Journal in Brave)

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

zbMATH Keywords

ant colony optimizationhop-constraintslocal searchminimum spanning treenetwork flowsnonlinear costs

Mathematics Subject Classification ID

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

Recommendations

• A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
• Optimal flow trees for networks with general nonlinear arc costs
• Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem
• New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints
• On formulations and methods for the hop-constrained minimum spanning tree problem

Cites work

• A deterministic annealing algorithm for the minimum concave cost network flow problem
• A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
• A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
• A novel hybrid algorithm based on particle swarm and ant colony optimization for finding the global minimum
• A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP
• An improved ant colony optimization for vehicle routing problem
• Ant colony optimization for the nonlinear resource allocation problem
• Ant colony optimization.
• Assignment Problems
• Heuristic solutions for general concave minimum cost network flow problems
• scientific article; zbMATH DE number 1960694 (Why is no real title available?)
• Hybrid ant colony optimization algorithms for mixed discrete-continuous optimization problems
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
• Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks
• Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem
• The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
• Upper bounds for single-source uncapacitated concave minimum-cost network flow problems

Cited in

(3)

• A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
• Artificial Intelligence and Soft Computing - ICAISC 2004
• Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks

Describes a project that uses

Uses Software

• OR-Library
• CPLEX

This page was built for publication: The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach

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