Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/inderscience-publishers/efficient-approximation-of-melting-temperature-in-simulated-annealing-hz3g20BCHg
References (26)
-
Zicheng Wang, Xiutang Geng, Z. Shao (2009)
An Effective Simulated Annealing Algorithm for Solving the Traveling Salesman ProblemJournal of Computational and Theoretical Nanoscience, 6
-
B. Hajek (1988)
Cooling Schedules for Optimal AnnealingMath. Oper. Res., 13
-
M. Fielding (2000)
Simulated Annealing With An Optimal Fixed TemperatureSIAM J. Optim., 11
-
I. Choi, Seong-in Kim, Hak-so Kim (2003)
A genetic algorithm with a mixed region search for the asymmetric traveling salesman problemComput. Oper. Res., 30
-
K. Dowsland, Jonathan Thompson (1993)
Simulated Annealing -
Y. Gajpal, P. Abad (2010)
Checking the feasibility of a vehicle route in integrated supply chain transportation modelInt. J. Bus. Perform. Supply Chain Model., 2
-
E. Cochrane, J. Beasley (2003)
The co-adaptive neural network approach to the Euclidean Travelling Salesman ProblemNeural networks : the official journal of the International Neural Network Society, 16 10
-
H. Cohn, M. Fielding (1999)
Simulated Annealing: Searching for an Optimal Temperature ScheduleSIAM J. Optim., 9
-
O. Al-Araidah, C. Malmborg, A. Krishnamurthy (2007)
Simultaneous Facility Layout and Materials- Handling System Design -
L. Chwif, M. Barretto, L. Moscato (1998)
A solution to the facility layout problem using simulated annealingComputers in Industry, 36
-
S. Rajasekaran, J. Reif (1988)
Nested Annealing: A Provable Improvement to Simulated Annealing -
O. Al-Araidah, A. Krishnamurthy, C. Malmborg (2007)
A comparative study of single-phase and two-phase approaches for the layout problem with material handling costsInternational Journal of Production Research, 45
-
J. Varanelli, J. Cohoon (1999)
A fast method for generalized starting temperature determination in homogeneous two-stage simulated annealing systemsComput. Oper. Res., 26
-
O. Al-Araidah, A. Krishnamurthy, C. Malmborg (2006)
A two-stage simulated annealing procedure for block layout problemsInternational Journal of Production Research, 44
-
R. Otten, L. Ginneken (1988)
Stop criteria in simulated annealingProceedings 1988 IEEE International Conference on Computer Design: VLSI
-
E. Aarts, Van Laarhoven (1985)
A new polynomial time cooling schedule -
K. Roodbergen, I. Vis (2009)
A survey of literature on automated storage and retrieval systemsEur. J. Oper. Res., 194
-
F. Romeo, A. Vincentelli, Huang (1986)
AN EFFICIENT GENERAL COOLING SCHEDULE FOR SIMULATED ANNEALING -
R. Haji, Hamed Tayebi, Babak Haji (2011)
Applying a new ordering policy in a two-echelon inventory system with Poisson demand rate for retailers and transportation costInt. J. Bus. Perform. Supply Chain Model., 3
-
F. Chan, Prof Kumar (2009)
Hybrid TSSA algorithm-based approach to solve warehouse-scheduling problemsInternational Journal of Production Research, 47
-
Jonathan Rose, W. Klebsch, Jürgen Wolf (1990)
Temperature measurement and equilibrium dynamics of simulated annealing placementsIEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 9
-
V. Rayward-Smith, C. Osman, C. Reeves, George Smith (1996)
Modern Heuristic Search Methods -
J. Varanelli, J. Cohoon (1994)
A two-stage simulated annealing methodologyProceedings. Fifth Great Lakes Symposium on VLSI
-
M. Mateo, E. Aghezzaf, Pau Vinyes (2012)
A combined inventory routing and game theory approach to solve a real-life distribution problemInt. J. Bus. Perform. Supply Chain Model., 4
-
E. Aarts, J. Korst, P. Laarhoven (1988)
A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problemJournal of Statistical Physics, 50
-
Shyi-Ming Chen, Chih-Yao Chien (2011)
Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniquesExpert Syst. Appl., 38
- Publisher
- Inderscience Publishers
- Copyright
- Copyright © Inderscience Enterprises Ltd. All rights reserved
- ISSN
- 1758-9401
- eISSN
- 1758-941X
- DOI
- 10.1504/IJBPSCM.2012.048304
- Publisher site
- See Article on Publisher Site
Abstract
Simulated annealing algorithms are widely used for solving NP-hard combinatorial optimisation problems including the travelling salesman problem (TSP). This article presents results of an empirical investigation for estimating the melting temperature for the simulated annealing algorithm based on the objective function value. We limit our search to Chebyshev order-picking systems with unequal horizontal and vertical speeds. The article utilises 90 randomly generated order-picking problems with densities ranging from 10 to 800 stops per tour. For each investigated problem, we utilise different seed values to generate and to solve ten replicates of the problem. Results show that quality melting temperature values can be estimated based on the statistical characteristics of the search space. This study helps to arrive at quality solutions with significantly fewer re-evaluations of the objective function.
Journal
International Journal of Business Performance and Supply Chain Modelling – Inderscience Publishers
Published: Jan 1, 2012