Using simulated annealing to solve routing and location problems
From MaRDI portal
Publication:3724091
DOI10.1002/nav.3800330209zbMath0593.90054OpenAlexW1978554753MaRDI QIDQ3724091
Christopher C. Skiscim, Bruce L. Golden
Publication date: 1986
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800330209
combinatorial optimizationsimulated annealingtraveling salesmancontrolled uphill stepsp-median locationstatistical mechanics of large multivariate physical systems
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Inventory, storage, reservoirs (90B05)
Related Items
Nearest-neighbour heuristics in accelerated algorithms of optimisation problems, Experimentation in optimization, Multicriteria facility layout problem: An integrated approach, Genetic algorithm for linear and cyclic assignment problem, Simulated annealing and tabu search approaches to unidirectional flowpath design for automated guided vehicle systems, Solving a location problem of a Stackelberg firm competing with Cournot-Nash firms, On the convergence of stationary distributions in simulated annealing algorithms, Simulated annealing with noisy or imprecise energy measurements, Routing problems: A bibliography, A variable neighborhood search algorithm for human resource selection and optimization problem in the home appliance manufacturing industry, Boltzmann machines for travelling salesman problems, Probabilistic and deterministic local search for solving the binary multiknapsack problem, Metaheuristics: A bibliography, Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge, On using learning automata for fast graph partitioning, Improvement heuristics for the vehicle routing problem based on simulated annealing, Parameter estimation for chaotic systems using a hybrid adaptive cuckoo search with simulated annealing algorithm, A guarantee rate optimization model for wastewater treatment system design under uncertainty, Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times, A hybrid algorithm for identifying global and local minima when optimizing functions with many minima., A two-phased approach to the supply network reconfiguration problem, A note on the effect of neighborhood structure in simulated annealing, Nested annealing: A provable improvement to simulated annealing, The traveling salesman problem: An overview of exact and approximate algorithms, Experimental analysis of simulated annealing based algorithms for the layout problem, Simulated annealing applied to the process allocation problem, Simulated annealing: An introduction, Comparing descent heuristics and metaheuristics for the vehicle routing problem, Genetic algorithms, function optimization, and facility layout design, Optimization of cube-per-order index warehouse layouts with zoning constraints, A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem, A parallel heuristic for quadratic assignment problems, A new method for solving capacitated location problems based on a set partitioning approach, Probabilistic local search algorithms for concave cost transportation network problems, Optimizing simulated annealing schedules with genetic programming, Modelling and analysis of wafer fabrication scheduling via generalized stochastic Petri net and simulated annealing, Unified heuristics to solve routing problem of reverse logistics in sustainable supply chain, A neural network approach to the vessel dispatching problem, Some personal views on the current state and the future of locational analysis, A new simulated annealing algorithm for the facility layout problem, Global and local search algorithms for concave cost transshipment problems
Cites Work
