A new rank based version of the ant system. -- A computational study

zbMath0941.90063MaRDI QIDQ1806777

Bernd Bullnheimer, Christine Strauss, Richard F. Hartl

Publication date: 8 November 1999

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationmetaheuristicstraveling salesman problemant system

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (33)

Rank‐based ant colony algorithms for truss weight minimization with discrete variables ⋮ Environmental and social implications of incorporating carpooling service on a customized bus system ⋮ Multi satellites scheduling algorithm based on task merging mechanism ⋮ An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes ⋮ Multicriteria tour planning for mobile healthcare facilities in a developing country ⋮ Combination of Genetic Algorithm and Ant Colony Optimization for QoS Multicast Routing ⋮ A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP ⋮ Reliability-based topology optimization of double layer grids using a two-stage optimization method ⋮ Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem ⋮ Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery ⋮ A Parallel Ant Colony Optimization Algorithm Based on Crossover Operation ⋮ Ant algorithms: theory and applications ⋮ On the finite-time dynamics of ant colony optimization ⋮ An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria ⋮ D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. ⋮ Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations ⋮ A modified ant colony system for solving the travelling salesman problem with time windows ⋮ Ant algorithms and simulated annealing for multicriteria dynamic programming ⋮ Ant colony optimization for the two-dimensional loading vehicle routing problem ⋮ First steps to the runtime complexity analysis of ant colony optimization ⋮ Learning cooperative linguistic fuzzy rules using the best-worst ant system algorithm ⋮ Association rule mining through the ant colony system for national health insurance research database in Taiwan ⋮ A time-based pheromone approach for the ant system ⋮ Can the agent with limited information solve travelling salesman problem? ⋮ Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems ⋮ An improved feature selection method based on ant colony optimization (ACO) evaluated on face recognition system ⋮ An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms ⋮ Ant Colony Optimization with a Genetic Restart Approach toward Global Optimization ⋮ Optimization of the keyboard arrangement problem using an ant colony algorithm. ⋮ Metaheuristics for vehicle routing problems with three-dimensional loading constraints ⋮ MOAQ and ant-Q algorithm for multiple objective optimization problems ⋮ Savings based ant colony optimization for the capacitated minimum spanning tree problem ⋮ ACO algorithms with guaranteed convergence to the optimal solution

This page was built for publication: A new rank based version of the ant system. -- A computational study