scientific article; zbMATH DE number 1488089
From MaRDI portal
Publication:4495193
zbMath0970.90083MaRDI QIDQ4495193
Thomas Stützle, Holger H. Hoos
Publication date: 10 August 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
combinatorial optimizationquadratic assignment problemant colony optimizationtraveling salesman problems
Minimax problems in mathematical programming (90C47) Search theory (90B40) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
Solving the minimum common string partition problem with the help of ants, MMAS versus population-based EA on a family of dynamic fitness functions, Environmental and social implications of incorporating carpooling service on a customized bus system, Testing local search move operators on the vehicle routing problem with split deliveries and time windows, A MAX-MIN ant system for unconstrained multi-level lot-sizing problems, Incorporating waiting time in competitive location models, Assigning real-time tasks to heterogeneous processors by applying ant colony optimization, Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW, Evolutionary Computational Technique in Automatic Generation Control of Multi-area Power Systems with Nonlinearity and Energy Storage Unit, On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization, Solution bias in ant colony optimisation: Lessons for selecting pheromone models, Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation, Adaptive memory programming: a unified view of metaheuristics, A new approach for solving set covering problem using jumping particle swarm optimization method, A new multi-agent system to simulate the foraging behaviors of \textit{Physarum}, A Simulated Annealing Genetic Algorithm for Solving Timetable Problems, Combining population-based and exact methods for multi-level capacitated lot-sizing problems, Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
