Skip to main content
SpringerLink
Log in

Simulated Jumping

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

This paper describes a novel approach for solving combinatorial optimisation problemscalled Simulated Jumping. It is based on ideas from spin‐glasses, simulated annealing andself‐organisation. We start from a low temperature, and the system is then subjected to arapid heating and cooling process (a shaking process). This process is controlled by thesystem's energy in a self‐organised manner. The heating and cooling process will continuouslymelt and freeze local regions: this process pushes the system out of local minimaand hence minimises the energy function. Application of the Simulated Jumping method tothe Quadratic Assignment and Asymmetric Travelling Salesman problems gives promisingresults.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. N. Metropolis, A. Rosenbluth, M. Rosenbluth, M. Teller and E. Teller, Equation of steady-state calculation by fast computing machines, J. Chem. Phys. 21(1956)1087-1092.

    Google Scholar 

  2. S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimisation by simulated annealing, Science 220 (1983)671-680.

    Google Scholar 

  3. V. Maniezzo, M. Dorigo and A. Colorni, Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem, European Journal of Operational Research 81(1995)188-204.

    Google Scholar 

  4. D.T. Connolly, An improved annealing scheme for the QAP, European Journal of Operational Research 46(1990)93-100.

    Google Scholar 

  5. E. Aarts and J. Korst, Simulated Annealing and Boltzmann Machines, Wiley, 1990.

  6. D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Operations Research 37(1989)865-892.

    Google Scholar 

  7. C. Koulmas, S.R. Antony and R. Jaen, A survey of simulated annealing applications to operations research problems, Omega 22(1994)41.

    Google Scholar 

  8. J.R.A. Allwright and D.B. Carpenter, A distributed implementation of simulated annealing for the travelling salesman problem, Parallel Computing 10(1989)335-338.

    Google Scholar 

  9. P.K. Kouvelis et al., Simulated annealing for machine layout problems in the presence of zoning constraints, European Journal of Operational Research 57(1992)203-223.

    Google Scholar 

  10. N.E. Collins, R.W. Eglese and B.L. Golden, Simulated annealing — an annotated bibliography, American Journal of Mathematical and Management Science 9(1988)209-307.

    Google Scholar 

  11. I.H. Osman and N. Christofides, Capacitated clustering problem by hybrid simulated annealing and taby search, International Transactions in Operational Research 1(1994)317-336.

    Google Scholar 

  12. S. Amin, Studies of competing interactions in hydrogen bonded systems, Ph.D. Thesis, The University of Edinburgh, UK, 1988.

    Google Scholar 

  13. S. Amin and J.L. Fernández-Villacañas, Simulated jumping in genetic algorithms and DLS for a set of constraint problems, 3rd Nordic Workshop on Genetic Algorithms, Helsinki, Finland, 1997.

  14. J.L. Fernández-Villacañas and S. Amin, Simulated jumping in genetic algorithms for a set of test functions, IASTED International Conference on Intelligent Information Systems, Bahamas, 1997.

  15. G.D. Lochtie, C.A. van Eijl and M.J. Mehler, Comparison of energy minimising algorithms for channel assignment in mobile radio networks, to appear in: Proceedings of the 8th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC '97), Helsinki, Finland, 1997.

  16. P.C. Kanellaskis and C.H. Papadimitriou, Local search for the asymmetric travelling salesmann problem, Operations Research 28(1980)1086-1099.

    Google Scholar 

  17. QAPLIB, A quadratic assignment problem library, ftp: ftp.tu-graz.ac.at in directory /pup/papers/qaplib.

  18. TSPLIB, A library of travelling salesman and related problem instances, http:/www.iwr.uniheidelberg.de/iwr/compt/soft/TSPLIB95.

  19. E.D. Taillard, Robust taboo search for the quadratic assignment problem, Parallel Computing 17 (1991)443-445.

    Google Scholar 

  20. E.D. Taillard, Comparison of iterative searches for the quadratic assignment problem, Location Science 3(2)(1995)87-105.

    Google Scholar 

  21. A.N. Elshafei, Hospital lay-out as a quadratic assignment problem, Operational Research Quarterly 28(1977)167-179.

    Google Scholar 

  22. R.E. Burkard and J. Offermann, Von Schreibmaschinentasturen mittels quadratisches Zuordnungs Probleme, Zeitschrift für Operations Research 21(1977)B121-132.

    Google Scholar 

  23. E.L. Lawler et al., The Travelling Salesman Problem. A Guided Tour of Combinatorial Optimization, Wiley, 1985.

  24. K. Anderson, Applied Simulated Annealing, Springer, 1993, pp. 61-83.

  25. S. Amin, A self-organised travelling salesman, Neural Computing and Applications 2(1994)129-133.

    Google Scholar 

Download references

Authors
  1. S. Amin
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Amin, S. Simulated Jumping. Annals of Operations Research 86, 23–38 (1999). https://doi.org/10.1023/A:1018954718550

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018954718550

Keywords

Search

Navigation