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
Crystal Structure Algorithm (CryStAl): A Metaheuristic Optimization Method
TL;DR: In this paper, the authors proposed a novel metaheuristic called CryStAl, which is inspired by the principles underlying the formation of crystal structures from the addition of the basis to the lattice points, which can be seen in the symmetric arrangement of constituents (i.e. atoms, molecules, or ions) in crystalline minerals such as quartz.
Journal ArticleDOI
Availability consideration in the optimal selection of multiple-aspect RMS configurations
TL;DR: In this article, the authors extended a model for optimizing reconfigurable manufacturing systems (RMS) configurations with multiple-aspects to incorporate the effect of machine availability using the universal generating function (UGF), and used two powerful meta-heuristic optimization techniques, namely genetic algorithms (GAs) and tabu search (TS), to optimize the capital cost and system availability of the RMS configurations.
Journal ArticleDOI
The strategies and parameters of tabu search for job-shop scheduling
TL;DR: This paper focussed on the tabu search strategies and parameters such as initial solution, neighborhood structure, tabu list, aspiration criterion, elite solutions list, intensification, diversification and the number of iteration for the job-shop scheduling problem.
Journal ArticleDOI
Tabu search algorithm for chemical process optimization
Bao Lin,Bao Lin,David C. Miller +2 more
TL;DR: This paper presents a meta-heuristic optimization algorithm, Tabu Search, and describes how it can be used to solve a wide variety of chemical engineering problems and guidelines for adjusting these parameters are provided to relieve a significant amount of time-consuming trial-and-error experiments.
Book ChapterDOI
A Taxonomy of Metaheuristics for Bi-level Optimization
TL;DR: A taxonomy of metaheuristics to solve BOPs is presented in an attempt to provide a common terminology and classification mechanisms and is also applicable to most types of heuristics and exact optimization algorithms.
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.