Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
From MaRDI portal
Publication:3476605
DOI10.1287/opre.37.6.865zbMath0698.90065MaRDI QIDQ3476605
Catherine A. Schevon, David S. Johnson, L. A. McGeoch, Cecilia R. Aragon
Publication date: 1989
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.37.6.865
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
90C27: Combinatorial optimization
Related Items
Modelling and analysis of wafer fabrication scheduling via generalized stochastic Petri net and simulated annealing, Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée, LAND USE OPTIMIZATION USING SELF-ORGANIZING ALGORITHMS, Minimizing L max for large-scale, job-shop scheduling problems, An integrated approach for the concurrent determination of the block layout and the input and output point locations based on the contour distance, COMBINING HELPFUL SETS AND PARALLEL SIMULATED ANNEALING FOR THE GRAPH-PARTITIONING PROBLEM∗, A simulated annealing algorithm for the maximum planar subgraph problem, Experiments on the minimum linear arrangement problem, Unnamed Item, Comparing descent heuristics and metaheuristics for the vehicle routing problem, On solving complex multi-period location models using simulated annealing., Multiagent cooperative search for portfolio selection, On the landscape ruggedness of the quadratic assignment problem, Heuristic unidirectional flowpath design approaches for automated guided vehicle systems, Performance of a genetic algorithm for the graph partitioning problem, Good solutions to discrete noxious location problems via metaheuristics, Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP, Comparison of the performance of modern heuristics for combinatorial optimization on real data, On the heuristic solution of the permutation flow shop problem by path algorithms, Negotiation-based collaborative planning between supply chains partners, Autocorrelation coefficient for the graph bipartitioning problem, A simulated annealing channel routing algorithm, A note on the effect of neighborhood structure in simulated annealing, Nested annealing: A provable improvement to simulated annealing, Experimental analysis of simulated annealing based algorithms for the layout problem, Optimal design of LAN-WAN internetworks: An approach using simulated annealing, Large-step Markov chains for the TSP incorporating local search heuristics, Simulated annealing applied to the process allocation problem, Mechanisms for local search, An SA/TS mixture algorithm for the scheduling tardiness problem, A simulated annealing heuristic for the one-dimensional cutting stock problem, General local search methods, The life span method -- a new variant of local search, Path optimization for graph partitioning problems, Scheduling jobs on parallel machines with sequence-dependent setup times, An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling, Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process, Scheduling projects to maximize net present value -- the case of time-dependent, contingent cash flows, The node capacitated graph partitioning problem: A computational study, Heuristics for unrelated machine scheduling with precedence constraints, An optimal tree search method for the manufacturing systems cell formation problem, Simulated annealing for resource-constrained scheduling, Routeing winter gritting vehicles, Simulated annealing and the mapping problem: A computational study, Best-so-far vs. where-you-are: Implications for optimal finite-time annealing, The noising method: A new method for combinatorial optimization, Simulated annealing: Practice versus theory, Parallel physical optimization algorithms for allocating data to multicomputer nodes, Heuristics for laying out information graphs, Simulated annealing procedures for forming machine cells in group technology, Multiple-type, two-dimensional bin packing problems: Applications and algorithms, Vertex packing problem application to the design of electronic testing fixtures, Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search, A computational study of graph partitioning, Optimization by ghost image processes in neural networks, Simulated annealing and tabu search: Lessons from a line search, New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation, A new adaptive multi-start technique for combinatorial global optimizations, A molecular structure matching problem, Partitioning of sequentially ordered systems using linear programming, An experimental evaluation of local search heuristics for graph partitioning, The Metropolis algorithm for graph bisection, A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems, Job-shop scheduling: Computational study of local search and large-step optimization methods, Stochastic annealing for synthesis under uncertainty, Simulated annealing for manufacturing systems layout design, A new extension of local search applied to the Dial-A-Ride problem, A systematic procedure for setting parameters in simulated annealing algorithms, Improvement heuristics for the vehicle routing problem based on simulated annealing, Simulated annealing for complex portfolio selection problems., A composite heuristic for the single machine early/tardy job scheduling problem., Solving the continuous flow-shop scheduling problem by metaheuristics., Heuristic methods for gang-rip saw arbor design., Nature's way of optimizing, Generating irregular partitionable data structures, Method to solve the travelling salesman problem using the inverse of diffusion process, Solution of large weighted equicut problems, Extended neighborhood: Definition and characterization, Solution quality of random search methods for discrete stochastic optimization, Parallel simulation today, Local search for the Steiner tree problem in the Euclidean plane, Formulating and solving production planning problems, A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs, Routing heuristics for automated pick and place machines, Deterministic job-shop scheduling: Past, present and future, Guided local search and its application to the traveling salesman problem, Solving the medium newspaper production/distribution problem, Determination of optimal path under approach and exit constraints, Heuristic optimization of experimental designs., Vertex ordering and partitioning problems for random spatial graphs., An improved simulated annealing simulation optimization method for discrete parameter stochastic systems, Joint determination of machine cells and linear intercell layout, Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue, Efficient heuristics for robot acquisition planning for a CIM system, Solving the damper placement problem via local search heuristics, A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs, A new approach to minimising the frontwidth in finite element calculations, Simulated annealing metaheuristics for the vehicle routing problem with time windows, Combining simulated annealing with local search heuristics, Focused simulated annealing search: An application to job shop scheduling, Tabu search for graph partitioning, Metaheuristics: A bibliography, On the classification of NP-complete problems in terms of their correlation coefficient, Stochastic comparison algorithm for discrete optimization with estimation of time-varying objective functions, Integrating and accelerating tabu search, simulated annealing, and genetic algorithms, Multi-way graph partition by stochastic probe, Layout design for flexible manufacturing systems considering single-loop directional flow patterns, Simulated annealing and genetic algorithms for scheduling products with multi-level product structure, Stochastic comparison algorithm for continuous optimization with estimation, A simulated annealing algorithm for determining the thickness of a graph, Heuristics for the maximum outerplanar subgraph problem, Unnamed Item, A new simulated annealing algorithm for the facility layout problem, A simulated annealing approach for optimization of multi-pass turning operations
