Research on location selection based on genetic and simulated annealing algorithm

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Tao, W., & Liu, J. (2013). Research on location selection based on genetic and simulated annealing algorithm. Communications in Computer and Information Science, 332, 271–281. https://doi.org/10.1007/978-3-642-34447-3_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free