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
Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
TL;DR: In this paper, the most promising parallelization approaches for tabu search were identified and compared by using a tabu-search algorithm for multicommodity location allocation problems with balancing requirements, and the impact on performance and solution quality of some important algorithmic design parameters: length of the synchronization steps, number of processors, handling of exchanged information, etc.
Book ChapterDOI
Physician scheduling in emergency rooms
Michel Gendreau,Jacques A. Ferland,Bernard Gendron,Noureddine Hail,Brigitte Jaumard,Sophie D. Lapierre,Gilles Pesant,Patrick Soriano +7 more
TL;DR: Several possible solution techniques that can be applied to physician scheduling problems, namely tabu search, column generation, mathematical programming and constraint programming, are reviewed, and their suitability for application depending on the specifics of the situation at hand are examined.
Journal ArticleDOI
The undirected capacitated arc routing problem with profits
TL;DR: A branch-and-price algorithm and several heuristics are proposed that can solve exactly instances with up to 97 profitable edges and find the optimal solution on most of instances where it is available.
Journal ArticleDOI
An inventory–routing problem with the objective of travel time minimization
TL;DR: A tabu search algorithm is presented to tackle an inventory–routing problem in a large petroleum and petrochemical enterprise group and lower bounds of reasonable sized problems, which are intractable in the formulated mathematical model by existing optimization software, are obtained via Lagrangian relaxation technique.
Journal ArticleDOI
Heuristic concentration and Tabu search: A head to head comparison
TL;DR: In this paper, the authors apply the method of HC to some of the data sets which were used for computational experience in the paper on Tabu search (TS) and show that HC discovers the superior solution (superior to TS) in about 95% of the cases, and, where the optimal solution is known, the optimal solutions in about 80% of cases.
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.