Skip to main content

Research on Location Selection Based on Genetic and Simulated Annealing Algorithm

  • Conference paper
Contemporary Research on E-business Technology and Strategy (iCETS 2012)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 332))

Included in the following conference series:

  • 2726 Accesses

Abstract

When dealing with the problem of location selection, one must optimize multiple objective functions. The combination of genetic algorithms and simulated annealing algorithm can improve the solution efficiency and solve the premature convergence problem caused by the genetic algorithm. Using the logistics distribution system as an example, we established a terminal distribution model according to the characteristics and requirements. Based on the mathematic model and the analysis on influencing factors of the transportation costs, we conducted a study on the location selection of distribution center, and subsequently designed and implemented the corresponding genetic and simulated annealing algorithm, which could reduce delivery cost and optimize distribution models.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Srinivas, N., Deb, K.: Multi-Objective function optimization using non-dominated sorting genetic algorithms. Evolutionary Computation 2(3), 221–248 (1995)

    Article  Google Scholar 

  2. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  3. Zhang, P., Wei, Q.: Logistics distribution center allocation model and elicitation algorithm. Traffic and Transportation Engineering 3(2), 65–68 (2003)

    Google Scholar 

  4. Lin, F.T., Kao, C.Y., Hsu, C.C.: Applying the genetic approach to simulated annealing in solving some NP hard. IEEE Trans. on SMC 23(6), 1752–1767 (1993)

    Google Scholar 

  5. Tian, Q., Pan, Q., Wang, F., Zhang, H.: Research on Learning Algorithm of BP Neural Network Based on the Metropolis Criterion. Techniques of Automation and Applications 22(5), 15 (2003)

    Google Scholar 

  6. Zhang, H., Wu, B., Yu, Z.: Research of New Genetic Algorithms Involving Mechanism of Simulated Annealing. Journal of University of Electronic of Science and Technology of China 32(1), 39–42 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tao, W., Liu, J. (2012). Research on Location Selection Based on Genetic and Simulated Annealing Algorithm. In: Khachidze, V., Wang, T., Siddiqui, S., Liu, V., Cappuccio, S., Lim, A. (eds) Contemporary Research on E-business Technology and Strategy. iCETS 2012. Communications in Computer and Information Science, vol 332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34447-3_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34447-3_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34446-6

  • Online ISBN: 978-3-642-34447-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics