New approaches for heuristic search: A bilateral linkage with artificial intelligence

DOI10.1016/0377-2217(89)90185-9zbMath0658.90079OpenAlexW2120230601MaRDI QIDQ1111942

Fred Glover, Harvey J. Greenberg

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90185-9

zbMATH Keywords

surveyneural networkssimulated annealingtabu searchartificial intelligencegenetic algorithmheuristic searchdecision support

Mathematics Subject Classification ID

Searching and sorting (68P10) Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Artificial intelligence (68T99) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (37)

Simulated annealing procedures for forming machine cells in group technology ⋮ Tabu search for a class of scheduling problems ⋮ Statistical search methods for lotsizing problems ⋮ État de l'art des méthodes “d'optimisation globale” ⋮ A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits ⋮ Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search ⋮ Scheduling in a sequence dependent setup environment with genetic search ⋮ Lot sizing in capacitated production planning and control systems ⋮ Improving the performance of enumerative search methods. I: Exploiting structure and intelligence ⋮ A unifying approach to heuristic search ⋮ Boolean query optimization and the 0-1 hyperbolic sum problem ⋮ A computer-aided process planning model based on genetic algorithms ⋮ Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue ⋮ Tabu search for graph partitioning ⋮ Metaheuristics: A bibliography ⋮ A comparison of stochastic scheduling rules for maximizing project net present value ⋮ Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization ⋮ Simulated annealing: A tool for operational research ⋮ Heuristics from Nature for Hard Combinatorial Optimization Problems ⋮ An ant colony system for permutation flow-shop sequencing ⋮ Investigating brachistochrone trajectories with a multistage real‐parameter genetic algorithm ⋮ Location and sizing of offshore platforms for oil exploration ⋮ Genetic algorithm for feature selection for parallel classifiers ⋮ Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP ⋮ Konzepte genetischer Algorithmen und ihre Anwendung auf das Frachtoptimierungsproblem im gewerblichen Güterfernverkehr. (Concepts of genetic algorithms and their application to the freight optimization problem of distant commercial goods transportation) ⋮ Determining the number of kanbans and lotsizes in a generic kanban system: a simulated annealing approach ⋮ Optimisation enhancement using self‐organising fuzzy control ⋮ Group technology by an ant system algorithm ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ General local search methods ⋮ Driving tabu search with case-based reasoning ⋮ Using a greedy random adaptative search procedure to solve the cover printing problem ⋮ Deep learning assisted heuristic tree search for the container pre-marshalling problem ⋮ Towards an efficient resolution of printing problems ⋮ A genetic algorithm-based approach to cell composition and layout design problems ⋮ Minimizing flow time variance in a single machine system using genetic algorithms ⋮ Solving zero-one mixed integer programming problems using tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Using tabu search techniques for graph coloring
• Algorithms for the maximum satisfiability problem
• Self-organization and associative memory
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• A network-related nuclear power plant model with an intelligent branch- and-bound solution approach
• ``Neural computation of decisions in optimization problems
• Future paths for integer programming and links to artificial intelligence
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• Diffusions for Global Optimization
• The capacity of the Hopfield associative memory
• Dynamic Programming with Linear Uncertainty
• A logical calculus of the ideas immanent in nervous activity

This page was built for publication: New approaches for heuristic search: A bilateral linkage with artificial intelligence