It is the cache of ${baseHref}. It is a snapshot of the page. The current page could have changed in the meantime.
Tip: To quickly find your search term on this page, press Ctrl+F or ⌘-F (Mac) and use the find bar.

A new Approach based on Ant Colony Optimization (ACO) to Determine the Supply Chain (SC) Design for a Product Mix | Zhao | Journal of Computers
Journal of Computers, Vol 7, No 3 (2012), 736-742, Mar 2012
doi:10.4304/jcp.7.3.736-742

A new Approach based on Ant Colony Optimization (ACO) to Determine the Supply Chain (SC) Design for a Product Mix

FuQing Zhao, JianXin Tang, YaHong Yang

Abstract


Manufacturing supply chain(SC) faces changing business environment and various customer demands. Pareto Ant Colony Optimisation (P-ACO) in order to obtain the non-dominated set of different SC designs was utilized as the guidance for designing manufacturing SC. P-ACO explores the solution space on the basis of applying the Ant Colony Optimisation algorithm and implementing more than one pheromone matrix, one for every objective. The SC design problem has been addressed by using Pareto Ant Colony Optimisation in which two objectives are minimised simultaneously. There were tested two ways in which the quantity of pheromones in the PM is incremented. In the SPM, the pheromone increment is a function of the two objectives, cost and time, while in MPM the pheromone matrix is divided into two pheromones, one for the cost and another one for the time. It could be concluded that the number of solutions do not depend on if the pheromone is split or is a function of the two variables because both method explore the same solution space. Although both methods explore the same solution space, the POS generated by every one is different. The POS that is generated when the pheromone matrix is split got solutions with lower time and cost than SMP because in the probabilistic decision rule a value of λ = 0.2 is used. It means that the ants preferred solution with a low cost instead of solutions with low time. The strategy of letting the best-so-far ant deposit pheromone over the PM accelerates the algorithm to get the optimal POS although the number of ants in the colony is small.

An experimental example is used to test the algorithm and show the benefits of utilising two pheromone matrices and multiple ant colonies in SC optimisation problem.



Keywords


supply chain design, multi-objective optimisation, ant colony, meta-heuristics

References


[1] F. Altiparmak, M. Gen, L. Lin and I. Karaoglan, “A steady-state genetic algorithm for multi-product supply chain network design, ” Computers and Industrial Engineering, vol. 56, pp. 521-537, March 2009.
http://dx.doi.org/10.1016/j.cie.2007.05.012

[2] H. Zhou, and W.C. Benton Jr, “Supply chain practice and information sharing, ” Journal of Operations Management, vol. 25, pp. 1348-1365, November 2007.
http://dx.doi.org/10.1016/j.jom.2007.01.009

[3] F. Galasso, C. Merce, and B. Grabot, Decision support framework for supply chain planning with flexible demand. in Cutting Edge Production Research of the French Community. 4 Park Square, Milton Park, Abingdon, Oxfordshire, OX14 4RN, United Kingdom: Taylor and Francis Ltd, 2009.

[4] E. Bottani, and R. Montanari, “Supply chain design and cost analysis through simulation, ” International Journal of Production Research, vol. 48, pp. 2859-2886, 2010.
http://dx.doi.org/10.1080/00207540902960299

[5] M. Bashiri, and M.M. Tabrizi, “Supply chain design: A holistic approach, ” Expert Systems with Applications, vol. 37, pp. 688-693, January 2010.
http://dx.doi.org/10.1016/j.eswa.2009.06.006

[6] W. Liao, E. Pan, and L. Xi, “A heuristics method based on ant colony optimisation for redundancy allocation problems, ” International Journal of Computer Applications in Technology, vol. 40, pp. 71-78, 2011.
http://dx.doi.org/10.1504/IJCAT.2011.038552

[7] M. Seo, and D. Kim, “Ant colony optimisation with parameterised search space for the job shop scheduling problem, ” International Journal of Production Research, vol. 48, pp. 1143-1154, 2010.
http://dx.doi.org/10.1080/00207540802538021

[8] N. Nariman-Zadeh, M. Salehpour, A. Jamali and E. Haghgoo, “Pareto optimization of a five-degree of freedom vehicle vibration model using a multi-objective uniform-diversity genetic algorithm (MUGA), ” Engineering Applications of Artificial Intelligence, vol. 23, pp. 543-551, 2010.
http://dx.doi.org/10.1016/j.engappai.2009.08.008

[9] H. Trautmann and J. Mehnen, “Preference-based Pareto optimization in certain and noisy environments, ” Engineering Optimization, vol. 41, pp. 23-38, 2009.
http://dx.doi.org/10.1080/03052150802347926

[10] S.K. Chaharsooghi and A.H. Meimand Kermani, “An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP), ” Applied Mathematics and Computation, vol. 200, pp. 167-177, 2008.
http://dx.doi.org/10.1016/j.amc.2007.09.070

[11] Sheu, D.D. and P.K. Hung, “An integrated new product introduction performance measurement system: An example in notebook computer industry, ” International Journal of Manufacturing Technology and Management, vol. 16, pp. 3-21, 2009.
http://dx.doi.org/10.1504/IJMTM.2009.021500

[12] L. Li, F. Qiao, and Q. D. Wu, “ACO-based multi-objective scheduling of parallel batch processing machines with advanced process control constraints Internationa, ” l Journal of Advanced Manufacturing Technology, vol. 44, pp. 985-994, 2009.


Full Text: PDF


Journal of Computers (JCP, ISSN 1796-203X)

Copyright @ 2006-2014 by ACADEMY PUBLISHER – All rights reserved.