Skip to main content
SpringerLink
Log in
Book cover

International Conference on Web Information Systems Engineering

WISE 2013: Web Information Systems Engineering – WISE 2013 Workshops pp 280–283Cite as

How to Decide Upon Stopping a Heuristic Algorithm in Facility-Location Problems?

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8182))

Abstract

Solutions to combinatorial optimization, such as p-median problems of locating facilities, frequently rely on heuristics to minimize the objective function. The minimum is sought iteratively and a criterion is needed to decide when the procedure (almost) attains it. However, pre-setting the number of iterations dominates in OR applications, which implies that the quality of the solution cannot be ascertained. In this paper we compare the methods proposed previous literate of estimating minimum, and propose some thought of it.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beasley, J.E.: OR library: Distributing test problems by electronic mail. Journal of Operational Research Society, 41 41(11), 1067–1072 (1990)

    Google Scholar 

  2. Chiyoshi, F.Y., Galvão, R.D.: A statistical analysis of simulated annealing applied to the p-median problem. Annals of Operations Research 96, 61–74 (2000)

    Article  MATH  Google Scholar 

  3. Dannenbring, D.G.: Procedures for estimating optimal solution values for large combinatorial problems. Management Science 23(12), 1273–1283 (1977)

    Article  MATH  Google Scholar 

  4. Hakimi, S.L.: Optimum locations of switching centers and the absolute centers and medians of a graph. Operations Research 12(3), 450–459 (1964)

    Article  MATH  Google Scholar 

  5. Hakimi, S.L.: Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems. Operations Research 13(3), 462–475 (1965)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kotz, S., Nadarajah, S.: Extreme value distributions, theory and applications. Imperial College Press (2000)

    Google Scholar 

  7. Levanova, T., Loresh, M.A.: Algorithm of ant system and simulated annealing for the p-median problem. Automation and Remote Control 65, 431–438 (2004)

    Article  MATH  Google Scholar 

  8. Quenouille, M.H.: Notes on bias in estimation. Biometrika 43, 353–360 (1956)

    MATH  MathSciNet  Google Scholar 

  9. Robson, D.S., Whitlock, J.H.: Estimation of a truncation point. Biometrika 51, 33–39 (1964)

    MATH  MathSciNet  Google Scholar 

  10. Wilson, A.D., King, R.E., Wilson, J.R.: Case study on statistically estimating minimum makespan for flow line scheduling problems. European Journal of Operational Research 155, 439–454 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  11. Zhigljavsky, A., Hamilton, E.: Stopping rules in k-adaptive global random search algorithms. Journal of Global Optimization 48(1), 87–97 (2010)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Technology and Business Studies, Dalarna university, SE-791 88, Falun, Sweden

    Xiangli Meng & Kenneth Carling

Authors
  1. Xiangli Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kenneth Carling
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Vrije University of Amsterdam, De Boelelaan 1081, 1081, Amsterdam, The Netherlands

    Zhisheng Huang

  2. Faculty of Information and Communication Technologies, Swinburne University of Technology, PO Box 218, 3122, Melbourne, VIC, Australia

    Chengfei Liu

  3. College of Engineering and Science, Victoria University, PO Box 14428, 8001, Melbourne, VIC, Australia

    Jing He

  4. Centre for Applied Informatics, Victoria University, PO Box 14428, 8001, Melbourne, VIC, Australia

    Guangyan Huang

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meng, X., Carling, K. (2014). How to Decide Upon Stopping a Heuristic Algorithm in Facility-Location Problems?. In: Huang, Z., Liu, C., He, J., Huang, G. (eds) Web Information Systems Engineering – WISE 2013 Workshops. WISE 2013. Lecture Notes in Computer Science, vol 8182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54370-8_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-54370-8_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-54369-2

  • Online ISBN: 978-3-642-54370-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation