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

DOI10.1007/S11590-014-0762-6zbMATH Open1317.90307OpenAlexW2053832189MaRDI QIDQ2018861FDOQ2018861

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 optimizationminimum spanning treelocal searchnetwork flowshop-constraintsnonlinear costs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Artificial Intelligence and Soft Computing - ICAISC 2004

Uses Software

• CPLEX
• OR-Library

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)