Articles & Issues
- Language
- korean
- Conflict of Interest
- In relation to this article, we declare that there is no conflict of interest.
- Publication history
-
Received September 28, 2018
Accepted November 13, 2018
-
This is an Open-Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/bync/3.0) which permits
unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright © KIChE. All rights reserved.
All issues
중소 바이오연료 기업의 물류 문제 해결을 위한 진화적 알고리즘 기반 배송 방법론
An Evolutionary Algorithm based Distribution Methodology for Small-scale Biofuel Energy Companies
동국대학교 경주캠퍼스 창의융합공학부, 38066 경상북도 경주시 동대로 123
Department of Creative Conversion Engineering, Dongguk University, 123, Dongdae-ro, Gyeongju-si, Gyeongsangbuk-do, 38066, Korea
Korean Chemical Engineering Research, December 2018, 56(6), 804-810(7), 10.9713/kcer.2018.56.6.804 Epub 4 December 2018
Download PDF
Abstract
본 논문은 중소 바이오 연료 기업의 공급 사슬 망이 기존 화석연료업체와 경쟁하기 위해, 최소의 비용으로 수요에 대응할 수 있는 공급 계획을 수립할 수 있는방법론을 제안한다. 최소비용으로 공급하기 위해 수요처들 사이의 최적 경로와 공급량을 동시에 고려하여 공급 계획을 수립하였다. 이렇게 수립된 모델의 해를계산하기 위해 진화론적 방법을 이용하였다. 제안된 방법론을 이용할 때 중소기업의 어려움을 고려하여 과도한 투자비의 부담이 큰 상용 소프트웨어 대신 문제고유의 특성을 고려하여 최적 경로를 계산할 수 있다. 서울의 각 지역별로 바이오 연료를 공급하는 사례를 통해 제안된 방법을 수치적으로 설명하였다.
Most biofuel companies are in a small scale with short experience of operating the entire supply chain. In order to compete with existing fossil fuel competitors, renewable companies should be more responsive to demand. It is financially important to reflect this in the decision supporting system of the company. This paper addresses an evolutionary algorithm based methodology for the distribution problem of renewable energies. A numerical example was presented to illustrate the applicability of the proposed methodology with some remarks.
References
IEA, “Technology Roadmap : Biofuels for Transport,” (2011).
Kim JK, Ind. Eng. Chem, 16(2) (2013)
Oh YT, Trans. Korean Soc. Mech. Eng. B, 22(4), 481 (1998)
Kim SW, “An Analysis on the Actual Status of SMEs and Supply Chain in Renewable Energy Sectors,” KOSBI(2010).
Park JY, “Operations and Supply Chain Management,” Aidbook(2012).
Kang KH, Lee BK, Lee YH, JKIIE, 30(3), 224 (2004)
Danzig GB, Ramser JH, MANAGE SCI, 6(1), 80 (1959)
Schrijver A, Handbooks Oper. Res. Management Sci., 12, 1 (2005)
Gilmore PC, Gomory RE, Oper. Res., 9(6), 849 (1961)
Garey MR, Johnson DS, Computers and Intractability, San Francisco(1979).
Lenstra JK, Rinnooy Kan AHG, Networks, 11(2), 221 (1981)
Savelsbergh MWP, “Vehicle Routing and Computer Graphics,” CEMC, Amsterdam(1984).
Bullnheimer B, Hartl RF, Strauss C, Ann. Oper. Res., 89, 319 (1999)
Baker BM, Ayechew MA, Comput. Oper. Res., 30, 787 (2003)
Gendreau M, Hertz A, Laporte G, Management Sci., 40(10), 1276 (1994)
Gendreau M, Oper. Res., 40(3), 469 (1996)
Magnanti TL, Networks, 11(2), 179 (1981)
Laporte G, Eur. J. Oper. Res., 59(3), 345 (1992)
Lenstra JK, Rinnooy Kan AHG, Networks, 11(2), 221 (1981)
Clark G, Wright JW, Oper. Res., 12(4), 568 (1964)
Reimann M, Doerner K, Hartl RF, Comput. Oper. Res., 31(4), 563 (2004)
Goldberg D, Lingle R, “Alleles, Loci, and The Traveling Salesman Problem,” ICGA, 154-159(1985).
Bullnheimer B, Hartl RF, Strauss C, “Applying the Ant System to the Vehicle Routing Problem,” Meta-Heuristics(1997).
Donati, Alberto V, et al., Eur. J. Oper. Res., 185(3), 1174 (2008)
Hong MD, Yu YH, Jo GS, “An Ant Colony Optimization Heuristic to solve the VRP with Time Window,” The KIPS Transcation partB 17B, 5(2010).
Ko JT, Yu YH, Jo GS, J. Intell. Inform. Syst., 15(1), 1 (2009)
Colorni A, Dorigo M, Maniezzo B, Distributed Optimization by Ant Colonies, 134-142(1991).
Dorigo M, Gambardella LM, IEEE Trans. Evol. Comput., 1(1), 53 (1997)
Bullnheimer B, Hartl RF, Strauss C, "Applying the Ant System to the Vehicle Routing Problem,” MIC97, 1-12(1997).
Gambardella LM, Taillard E, Agazzi G, MACS-VRPTW, London, UK, 63-76(1999).
Colorni A, Dorigo M, Maniezzo V, “Ant System for Job-shop Scheduling,” Belgian Journal of Operations Research, 1-14(1994).
Garcia, Oscar C, Fernandez de Viana I, Herrera F, Mathware Soft Comput, 9(3), 177 (2002)
Stutzle T, Hoos H, IEEE Conf. Evol. Comput. 308-313(1997).
Gambardella LM, Taillard E, Agazzi G, MACS-VRPTW, London, UK, pp.63-76(1999).
Geem ZW, Sim KB, Appl. Math Comput., 217(8), 3881 (2010)
Johnson DS, Demers A, Ullman JD, Garey MR, Graham RL, Siam. J. Comput., 3(4), 299 (1974)
Vester J, “A Tabu Search Heuristic for the Vehicle Routing Problem with Two-Dimensional Loading Constraints,” Erasmus University, Rotterdam(2015).
Kim JK, Ind. Eng. Chem, 16(2) (2013)
Oh YT, Trans. Korean Soc. Mech. Eng. B, 22(4), 481 (1998)
Kim SW, “An Analysis on the Actual Status of SMEs and Supply Chain in Renewable Energy Sectors,” KOSBI(2010).
Park JY, “Operations and Supply Chain Management,” Aidbook(2012).
Kang KH, Lee BK, Lee YH, JKIIE, 30(3), 224 (2004)
Danzig GB, Ramser JH, MANAGE SCI, 6(1), 80 (1959)
Schrijver A, Handbooks Oper. Res. Management Sci., 12, 1 (2005)
Gilmore PC, Gomory RE, Oper. Res., 9(6), 849 (1961)
Garey MR, Johnson DS, Computers and Intractability, San Francisco(1979).
Lenstra JK, Rinnooy Kan AHG, Networks, 11(2), 221 (1981)
Savelsbergh MWP, “Vehicle Routing and Computer Graphics,” CEMC, Amsterdam(1984).
Bullnheimer B, Hartl RF, Strauss C, Ann. Oper. Res., 89, 319 (1999)
Baker BM, Ayechew MA, Comput. Oper. Res., 30, 787 (2003)
Gendreau M, Hertz A, Laporte G, Management Sci., 40(10), 1276 (1994)
Gendreau M, Oper. Res., 40(3), 469 (1996)
Magnanti TL, Networks, 11(2), 179 (1981)
Laporte G, Eur. J. Oper. Res., 59(3), 345 (1992)
Lenstra JK, Rinnooy Kan AHG, Networks, 11(2), 221 (1981)
Clark G, Wright JW, Oper. Res., 12(4), 568 (1964)
Reimann M, Doerner K, Hartl RF, Comput. Oper. Res., 31(4), 563 (2004)
Goldberg D, Lingle R, “Alleles, Loci, and The Traveling Salesman Problem,” ICGA, 154-159(1985).
Bullnheimer B, Hartl RF, Strauss C, “Applying the Ant System to the Vehicle Routing Problem,” Meta-Heuristics(1997).
Donati, Alberto V, et al., Eur. J. Oper. Res., 185(3), 1174 (2008)
Hong MD, Yu YH, Jo GS, “An Ant Colony Optimization Heuristic to solve the VRP with Time Window,” The KIPS Transcation partB 17B, 5(2010).
Ko JT, Yu YH, Jo GS, J. Intell. Inform. Syst., 15(1), 1 (2009)
Colorni A, Dorigo M, Maniezzo B, Distributed Optimization by Ant Colonies, 134-142(1991).
Dorigo M, Gambardella LM, IEEE Trans. Evol. Comput., 1(1), 53 (1997)
Bullnheimer B, Hartl RF, Strauss C, "Applying the Ant System to the Vehicle Routing Problem,” MIC97, 1-12(1997).
Gambardella LM, Taillard E, Agazzi G, MACS-VRPTW, London, UK, 63-76(1999).
Colorni A, Dorigo M, Maniezzo V, “Ant System for Job-shop Scheduling,” Belgian Journal of Operations Research, 1-14(1994).
Garcia, Oscar C, Fernandez de Viana I, Herrera F, Mathware Soft Comput, 9(3), 177 (2002)
Stutzle T, Hoos H, IEEE Conf. Evol. Comput. 308-313(1997).
Gambardella LM, Taillard E, Agazzi G, MACS-VRPTW, London, UK, pp.63-76(1999).
Geem ZW, Sim KB, Appl. Math Comput., 217(8), 3881 (2010)
Johnson DS, Demers A, Ullman JD, Garey MR, Graham RL, Siam. J. Comput., 3(4), 299 (1974)
Vester J, “A Tabu Search Heuristic for the Vehicle Routing Problem with Two-Dimensional Loading Constraints,” Erasmus University, Rotterdam(2015).
