Heuristics from Nature for Hard Combinatorial Optimization Problems

DOI10.1111/j.1475-3995.1996.tb00032.xzbMath0863.90120OpenAlexW2088162030WikidataQ59195779 ScholiaQ59195779MaRDI QIDQ5690286

Alberto Colorni, Marco Trubian, Francesco Maffioli, Marco Dorigo, Vittorio Maniezzo, Giovanni Righini

Publication date: 15 January 1997

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.1996.tb00032.x

zbMATH Keywords

samplingheuristicsclusteringsimulated annealingtabu searchgenetic algorithmsneural netsgraph optimizationNP-hard combinatorial optimizationsingle and multiagent search

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

Dual mean field search for large scale linear and quadratic knapsack problems, Combinatorial optimization for an improved transition from fluence optimization to fluence delivery in IMRT treatment planning, Minimizing earliness and tardiness penalties in a single-machine problem with a common due date, Rank‐based ant colony algorithms for truss weight minimization with discrete variables, A survey for the quadratic assignment problem, Vehicle routing problems with alternative paths: an application to on-demand transportation, Thirty years of International Transactions in Operational Research: past, present, and future direction, Systematic reviews as a metaknowledge tool: caveats and a review of available options, Application of two ant colony optimisation algorithms to water distribution system optimisation, A tutorial on the cross-entropy method, Particle swarm optimization applied to the design of water supply systems, Allocation of advertising space by a web service provider using combinatorial auctions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using tabu search techniques for graph coloring
• Self-organization and associative memory
• QAPLIB-A quadratic assignment problem library
• On the power of neural networks for solving hard problems
• A classification scheme for vehicle routing and scheduling problems
• Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem
• New approaches for heuristic search: A bilateral linkage with artificial intelligence
• An interactive system for constructing timetables on a PC
• Tabu search techniques. A tutorial and an application to neural networks
• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• An additive bounding procedure for the asymmetric travelling salesman problem
• Finding approximate solutions to NP-hard problems by neural networks is hard
• The vehicle routing problem: An overview of exact and approximate algorithms
• Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
• Semi-greedy heuristics: An empirical study
• Applying tabu search to the job-shop scheduling problem
• A stochastic method for global optimization
• Some experience in applying a stochastic method to location problems
• A note on finding optimum branchings
• The convergence of symmetric threshold automata
• Some Convergence Results for Probabilistic Tabu Search
• Tabu Search—Part I
• Tabu Search—Part II
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Neurons with graded response have collective computational properties like those of two-state neurons.