Future paths for integer programming and links to artificial intelligence
TLDR
Four key areas of Integer programming are examined from a framework that links the perspectives of artificial intelligence and operations research, and each has characteristics that appear usefully relevant to developments on the horizon.About:
This article is published in Computers & Operations Research.The article was published on 1986-05-01 and is currently open access. It has received 3985 citations till now. The article focuses on the topics: Integer programming & Tabu search.read more
Citations
More filters
Journal ArticleDOI
Research Article: Hybrid particle swarm optimization and tabu search approach for selecting genes for tumor classification using gene expression data
Qi Shen,Weimin Shi,Wei Kong +2 more
TL;DR: The incorporation of tabu search (TS) as a local improvement procedure enables the algorithm HPSOTS to overleap local optima and show satisfactory performance in gene selection and mining high dimension data.
Journal ArticleDOI
Lane-based evacuation network optimization: An integrated Lagrangian relaxation and tabu search approach
Chi Xie,Mark A. Turnquist +1 more
TL;DR: In this paper, an integrated Lagrangian relaxation and tabu search solution method was developed to tackle the combinatorial complexity arising from this combined treatment of discrete network capacity and connectivity settings, and the results from optimizing a regional evacuation network for a nuclear power plant illustrate the validness and usefulness of the modeling and solution methodology in evacuation planning practice.
Proceedings ArticleDOI
Identifying sets of key players in a network
TL;DR: Two problems are considered: finding a set of nodes that is maximally connected to all other nodes (KPP-Pos) and finding aSet of nodes whose removal would result in a residual network of minimum cohesion (K PP-Pos).
Journal ArticleDOI
Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem
TL;DR: Five rather different multistart tabu search strategies for the unconstrained binary quadratic optimization problem are described and experimentally compared: a random restart procedure, an application of a deterministic heuristic to specially constructed subproblems, anApplication of a randomized procedure to the full problem, a constructive procedure usingtabu search adaptive memory, and an approach based on solving perturbed problems.
Journal ArticleDOI
Optimal configuration selection for Reconfigurable Manufacturing Systems
TL;DR: In this paper, a reconfigurable manufacturing system (RMS) configuration selection approach based on real-coded genetic algorithms (GAs) and Tabu Search (TS) is presented.
References
More filters
Journal ArticleDOI
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Journal ArticleDOI
Equation of state calculations by fast computing machines
TL;DR: In this article, a modified Monte Carlo integration over configuration space is used to investigate the properties of a two-dimensional rigid-sphere system with a set of interacting individual molecules, and the results are compared to free volume equations of state and a four-term virial coefficient expansion.
Book
The Sciences of the Artificial
TL;DR: A new edition of Simon's classic work on artificial intelligence as mentioned in this paper adds a chapter that sorts out the current themes and tools for analyzing complexity and complex systems, taking into account important advances in cognitive psychology and the science of design while confirming and extending Simon's basic thesis that a physical symbol system has the necessary and sufficient means for intelligent action.
Journal ArticleDOI
Combinatorial optimization: algorithms and complexity
TL;DR: This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NPcomplete problems, more.
Book
The Architecture of Cognition
TL;DR: Adaptive Control of Thought (ACT*) as mentioned in this paper is a theory of the basic principles of operation built into the cognitive system and is the main focus of Anderson's theory of cognitive architecture.