Heuristics from Nature for Hard Combinatorial Optimization Problems
DOI10.1111/J.1475-3995.1996.TB00032.XzbMATH Open0863.90120OpenAlexW2088162030WikidataQ59195779 ScholiaQ59195779MaRDI QIDQ5690286FDOQ5690286
Authors: Alberto Colorni, Marco Dorigo, Francesco Maffioli, Vittorio Maniezzo, Marco Trubian, 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
Recommendations
samplingclusteringsimulated annealingheuristicsgenetic algorithmsgraph optimizationneural netstabu searchNP-hard combinatorial optimizationsingle and multiagent search
Cites Work
- QAPLIB-A quadratic assignment problem library
- Title not available (Why is that?)
- Self-organization and associative memory
- Title not available (Why is that?)
- Tabu Search—Part I
- The vehicle routing problem: An overview of exact and approximate algorithms
- Neurons with graded response have collective computational properties like those of two-state neurons
- Applying tabu search to the job-shop scheduling problem
- Title not available (Why is that?)
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Tabu Search—Part II
- A classification scheme for vehicle routing and scheduling problems
- Using tabu search techniques for graph coloring
- Semi-greedy heuristics: An empirical study
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- A stochastic method for global optimization
- Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem
- Title not available (Why is that?)
- The convergence of symmetric threshold automata
- Tabu search techniques. A tutorial and an application to neural networks
- An additive bounding procedure for the asymmetric travelling salesman problem
- Some Convergence Results for Probabilistic Tabu Search
- A note on finding optimum branchings
- Finding approximate solutions to NP-hard problems by neural networks is hard
- On the power of neural networks for solving hard problems
- New approaches for heuristic search: A bilateral linkage with artificial intelligence
- Title not available (Why is that?)
- Some experience in applying a stochastic method to location problems
- An interactive system for constructing timetables on a PC
- Title not available (Why is that?)
Cited In (15)
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- Deep clustering of the traveling salesman problem to parallelize its solution
- Particle swarm optimization applied to the design of water supply systems
- Combinatorial optimization for an improved transition from fluence optimization to fluence delivery in IMRT treatment planning
- Rank‐based ant colony algorithms for truss weight minimization with discrete variables
- Using River Formation Dynamics to Design Heuristic Algorithms
- A survey for the quadratic assignment problem
- Allocation of advertising space by a web service provider using combinatorial auctions
- Systematic reviews as a metaknowledge tool: caveats and a review of available options
- Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
- Application of two ant colony optimisation algorithms to water distribution system optimisation
- Thirty years of International Transactions in Operational Research: past, present, and future direction
- Dual mean field search for large scale linear and quadratic knapsack problems
- Viral systems: A new bio-inspired optimisation approach
- A tutorial on the cross-entropy method
This page was built for publication: Heuristics from Nature for Hard Combinatorial Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5690286)
