Using simulated annealing to solve routing and location problems
From MaRDI portal
Publication:3724091
DOI10.1002/nav.3800330209zbMath0593.90054MaRDI 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 optimization; simulated annealing; traveling salesman; controlled uphill steps; p-median location; statistical mechanics of large multivariate physical systems
68Q25: Analysis of algorithms and problem complexity
65K05: Numerical mathematical programming methods
90C10: Integer programming
90B05: Inventory, storage, reservoirs
Related Items
Optimization of cube-per-order index warehouse layouts with zoning constraints, A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem, Modelling and analysis of wafer fabrication scheduling via generalized stochastic Petri net and simulated annealing, Probabilistic and deterministic local search for solving the binary multiknapsack problem, Comparing descent heuristics and metaheuristics for the vehicle routing problem, A new method for solving capacitated location problems based on a set partitioning approach, Global and local search algorithms for concave cost transshipment problems, Experimentation in optimization, On the convergence of stationary distributions in simulated annealing algorithms, Simulated annealing with noisy or imprecise energy measurements, Boltzmann machines for travelling salesman problems, Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge, 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, Genetic algorithms, function optimization, and facility layout design, Optimizing simulated annealing schedules with genetic programming, A neural network approach to the vessel dispatching problem, Some personal views on the current state and the future of locational analysis, Nearest-neighbour heuristics in accelerated algorithms of optimisation problems, Simulated annealing and tabu search approaches to unidirectional flowpath design for automated guided vehicle systems, Improvement heuristics for the vehicle routing problem based on simulated annealing, A hybrid algorithm for identifying global and local minima when optimizing functions with many minima., Probabilistic local search algorithms for concave cost transportation network problems, Routing problems: A bibliography, Metaheuristics: A bibliography, A two-phased approach to the supply network reconfiguration problem, A parallel heuristic for quadratic assignment problems, Multicriteria facility layout problem: An integrated approach, Genetic algorithm for linear and cyclic assignment problem, Simulated annealing: An introduction, A new simulated annealing algorithm for the facility layout problem
Cites Work
