Abstract
This paper addresses the allocation problem of the concrete mixing plants (APCMP). We present a memetic algorithm with the combination of ant colony optimization and greedy algorithm to solve the problem. Ant colony optimization is used to achieve the global search, and greedy algorithm based on the shortest distance of the sites is introduced to proceed the local search. It can be obtained the optimization solution to guarantee minimum the total transport distances. In the end, through the experiment, the results show that memetic algorithm is better to solve the APCMP problem than the single greedy algorithm based on the shortest distance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Sudholt, D.: The impact of parameterization in memetic evolutionary algorithms. Theoretical Computer Science 410, 2511–2528 (2009)
Yang, L., Yu, S.-H., Zhang, N., Lu, Y.-C.: Study on the location of concrete mixing plants. Mathematics Practice and Theory 24(29), 239–244 (2009)
Ferentinos, K.P., Tsiligiridis, T.A.: A memetic algorithm for optimal dynamic design of wireless sensor networks. Computer Communications 33, 250–258 (2010)
Banos, R., Gil, C., Reca, J., Montoya, F.G.: A memetic algorithm applied to the design of water distribution networks. Applied Soft Computing 10, 261–266 (2010)
Ngueveu, S.U., Prins, C., Calvo, R.W.: An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Computers & Operations Research 37, 1877–1885 (2010)
Krasnogor, N., Gustafson, S.: Toward truly memetic algorithms: discussion and proof of concepts. In: Proc. PPSN VII (2002)
Chan, F.T.S., Kumar, N.: Effective allocation of customers to distribution centres:A multiple ant colony optimization approach. Robotics and Computer-Integrated Manufacturing 25, 1–12 (2009)
Hajiaghaei-Keshteli, M.: The allocation of customers to potential distribution centers in supply chain networks: GA and AIA approaches. Applied Soft Computing 11, 2069–2078 (2011)
Musa, R., Arnaout, J.-P., Jung, H.: Ant colony optimization algorithm to solve for the transportation problem of cross-docking network. Computers & Industrial Engineering 59, 85–92 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhi-feng, H., Ai-Jing, W., Han, H. (2012). A Memetic Algorithm Applied to Allocation Problem of the Concrete Mixing Plants. In: Liu, C., Wang, L., Yang, A. (eds) Information Computing and Applications. ICICA 2012. Communications in Computer and Information Science, vol 308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34041-3_96
Download citation
DOI: https://doi.org/10.1007/978-3-642-34041-3_96
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34040-6
Online ISBN: 978-3-642-34041-3
eBook Packages: Computer ScienceComputer Science (R0)