General local search methods
From MaRDI portal
Publication:1268283
DOI10.1016/0377-2217(96)00007-0zbMath0914.90227OpenAlexW2121928248MaRDI QIDQ1268283
Publication date: 3 December 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(96)00007-0
Related Items
Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming ⋮ On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study ⋮ Heuristics for exact nonnegative matrix factorization ⋮ A queueing framework for routing problems with time-dependent travel times ⋮ A survey of search methodologies and automated system development for examination timetabling ⋮ Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems ⋮ Learning monotone preferences using a majority rule sorting model ⋮ Vehicle routing with dynamic travel times: a queueing approach ⋮ Product line selection and pricing under a share-of-surplus choice model. ⋮ Heuristics for urban road network design: lane layout and signal settings ⋮ Parameter-free filled function method for nonlinear integer program ⋮ Pareto simulated annealing for the design of experiments: illustrated by a gene expression study ⋮ Using penalty function and tabu search to solve cell formation problems with fixed cell cost. ⋮ Scheduling batch processing machine using max-min ant system algorithm improved by a local search method ⋮ Solving a novel inventory location model with stochastic constraints and \((R,s,S)\) inventory control policy ⋮ A two-phased approach to the supply network reconfiguration problem ⋮ Lot sizing and furnace scheduling in small foundries ⋮ Parameter tuning for local-search-based matheuristic methods ⋮ A discrete dynamic convexized method for nonlinear integer programming ⋮ A columnar competitive model for solving multi-traveling salesman problem ⋮ Optimization and analysis of the profitability of tariff structures with two-part tariffs ⋮ Vehicle routing with stochastic time-dependent travel times ⋮ Hierarchical minimization of completion time variance and makespan in jobshops ⋮ Comparing simulated annealing and genetic algorithm in learning FCM ⋮ The noising methods: A generalization of some metaheuristics ⋮ Nature-Inspired Particle Mechanics Algorithm for Multi-Objective Optimization ⋮ A genetic-based framework for solving (multi-criteria) weighted matching problems. ⋮ Job shop scheduling optimization through multiple independent particle swarms ⋮ Self-tuning of the noising methods ⋮ The Non Dominated Set in Bayesian Decision Problems with Convex Loss Functions ⋮ An interactive heuristic method for multi-objective combinatorial optimization ⋮ Parallel flowshop scheduling using Tabu search ⋮ Heuristic concentration and tabu search: A head to head comparison ⋮ Application of heuristic methods for conformance test selection ⋮ Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works ⋮ Handling flexibility in a ``generalised job shop with a fuzzy approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Some experiments with simulated annealing for coloring graphs
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Nonstationary Markov chains and convergence of the annealing algorithm
- New approaches for heuristic search: A bilateral linkage with artificial intelligence
- Parallel problem solving from nature. 1st workshop, PPSN 1, Dortmund, Germany, October 1-3, 1990. Proceedings
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- Applied simulated annealing
- Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search
- A decision support system for the resource constrained project scheduling problem
- Future paths for integer programming and links to artificial intelligence
- Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem
- Probabilistic diversification and intensification in local search for vehicle routing
- A user's guide to tabu search
- An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Cooling Schedules for Optimal Annealing
- Simulated Annealing – An Annotated Bibliography
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Some Convergence Results for Probabilistic Tabu Search
- Tabu Search—Part I
- Tabu Search—Part II
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- A Fast Taboo Search Algorithm for the Job Shop Problem
