DOI QR코드

DOI QR Code

중소 바이오연료 기업의 물류 문제 해결을 위한 진화적 알고리즘 기반 배송 방법론

An Evolutionary Algorithm based Distribution Methodology for Small-scale Biofuel Energy Companies

  • 김수환 (동국대학교 경주캠퍼스 창의융합공학부) ;
  • 류준형 (동국대학교 경주캠퍼스 창의융합공학부)
  • Kim, Soo whan (Department of Creative Conversion Engineering, Dongguk University) ;
  • Ryu, Jun-Hyung (Department of Creative Conversion Engineering, Dongguk University)
  • 투고 : 2018.09.28
  • 심사 : 2018.11.13
  • 발행 : 2018.12.01

초록

본 논문은 중소 바이오 연료 기업의 공급 사슬 망이 기존 화석연료업체와 경쟁하기 위해, 최소의 비용으로 수요에 대응할 수 있는 공급 계획을 수립할 수 있는방법론을 제안한다. 최소비용으로 공급하기 위해 수요처들 사이의 최적 경로와 공급량을 동시에 고려하여 공급 계획을 수립하였다. 이렇게 수립된 모델의 해를계산하기 위해 진화론적 방법을 이용하였다. 제안된 방법론을 이용할 때 중소기업의 어려움을 고려하여 과도한 투자비의 부담이 큰 상용 소프트웨어 대신 문제고유의 특성을 고려하여 최적 경로를 계산할 수 있다. 서울의 각 지역별로 바이오 연료를 공급하는 사례를 통해 제안된 방법을 수치적으로 설명하였다.

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.

키워드

HHGHHL_2018_v56n6_804_f0001.png 이미지

Fig. 1. Example illustration of Renewable Energy Distribution Problem.

HHGHHL_2018_v56n6_804_f0002.png 이미지

Fig. 2. The proposed computation decision flow.

HHGHHL_2018_v56n6_804_f0003.png 이미지

Fig. 3. CVRP starting on Jung-gu Office.

HHGHHL_2018_v56n6_804_f0004.png 이미지

Fig. 4. CVRP Result of best route in iteration.

Table 1. Geographical location lists of demands

HHGHHL_2018_v56n6_804_t0001.png 이미지

Table 2. Route of CVRP on seven trucks

HHGHHL_2018_v56n6_804_t0002.png 이미지

Table 3. The optimal distance for each customer, the number of trucks needed, and the MATLAB calculation time calculated by CVRP

HHGHHL_2018_v56n6_804_t0003.png 이미지

참고문헌

  1. IEA, "Technology Roadmap : Biofuels for Transport," (2011).
  2. Kim, J. K., "The Status of Sustainable Biofuels Policy and Development," Ind. Eng. Chem, 16(2), (2013).
  3. Oh, Y. T., "A Study on the Usability of Used Vegetable oil as a Diesel Substitute in Diesel Engine," Trans. Korean Soc. Mech. Eng. B., 22(4), 481-488(1998). https://doi.org/10.22634/KSME-B.1998.22.4.481
  4. Kim, S. W., "An Analysis on the Actual Status of SMEs and Supply Chain in Renewable Energy Sectors," KOSBI(2010).
  5. Park, J. Y., "Operations and Supply Chain Management," Aidbook(2012).
  6. Kang, K. H., Lee, B. K. and Lee, Y. H., "A Review of Current Status and Analysis in Supply Chain Modeling," JKIIE, 30(3), 224-240(2004).
  7. Danzig, G. B. and Ramser, J. H., "The Truck Dispatching Problem," MANAGE SCI, 6(1), 80-91(1959). https://doi.org/10.1287/mnsc.6.1.80
  8. Schrijver, A., "On the History of Combinatorial Optimization (Till 1960)," Handbooks Oper. Res. Management Sci., 12, 1-68 (2005).
  9. Gilmore, P. C. and Gomory, R. E., "A Linear Programming Approach to the Cutting-Stock Problem," Oper. Res., 9(6), 849-859(1961). https://doi.org/10.1287/opre.9.6.849
  10. Garey, M. R. and Johnson, D. S., "Computers and Intractability; A Guide to the Theory of NP-Completeness," W. H. Freeamn and Company, San Francisco(1979).
  11. Lenstra, J. K. and Rinnooy Kan, A. H. G., "Complexity of Vehicle Routing and Scheduling Problems," Networks, 11(2), 221-227(1981). https://doi.org/10.1002/net.3230110211
  12. Savelsbergh, M. W. P., "Vehicle Routing and Computer Graphics," CEMC, Amsterdam(1984).
  13. Bullnheimer, B., Hartl, R. F. and Strauss, C., "An Improved Ant System Algorithm for the Vehicle Routing Problem," Ann. Oper. Res., 89, 319-328(1999). https://doi.org/10.1023/A:1018940026670
  14. Baker, B. M. and Ayechew, M. A., "A Genetic Algorithm for the Vehicle Routing Problem," Comput. Oper. Res., 30, 787-800(2003). https://doi.org/10.1016/S0305-0548(02)00051-5
  15. Gendreau, M., Hertz, A. and Laporte, G., "A Tabu Search Heuristics for the Vehicle Routing Problem," Management Sci., 40(10), l276-1290(1994). https://doi.org/10.1287/mnsc.40.10.1276
  16. Gendreau, M., "A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers," Oper. Res., 40(3), 469-477(1996).
  17. Magnanti, T. L., "Combinatorial Optimization and Vehicle Fleet Planning: Perspectives and Prospects," Networks, 11(2), 179-213 (1981). https://doi.org/10.1002/net.3230110209
  18. Laporte, G., "The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms," Eur. J. Oper. Res., 59(3), 345-358(1992). https://doi.org/10.1016/0377-2217(92)90192-C
  19. Lenstra, J. K. and Rinnooy Kan, A. H. G., "Complexity of Vehicle Routing and Scheduling Problems," Networks, 11(2), 221-227 (1981). https://doi.org/10.1002/net.3230110211
  20. Clark, G. and Wright, J. W., "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Oper. Res., 12(4), 568-581(1964). https://doi.org/10.1287/opre.12.4.568
  21. Reimann, M., Doerner, K. and Hartl, R. F., "D-ants: Savings Based Ants Divide and Conquer the Vehicle Routing Problem," Comput. Oper. Res., 31(4), 563-591(2004). https://doi.org/10.1016/S0305-0548(03)00014-5
  22. Goldberg, D. and Lingle, R., "Alleles, Loci, and The Traveling Salesman Problem," ICGA, 154-159(1985).
  23. Bullnheimer, B., Hartl, R. F. and Strauss, C., "Applying the Ant System to the Vehicle Routing Problem," Meta-Heuristics(1997).
  24. Donati, Alberto V., et al., "Time Dependent Vehicle Routing Problem with a Multi Ant Colony System," Eur. J. Oper. Res., 185(3), 1174-1191(2008). https://doi.org/10.1016/j.ejor.2006.06.047
  25. Hong, M. D., Yu, Y. H. and Jo, G. S., "An Ant Colony Optimization Heuristic to solve the VRP with Time Window," The KIPS Transcation partB 17B, 5(2010).
  26. Ko, J. T., Yu, Y. H. and Jo, G. S., "The Bisection Seed Detection Heuristic for Solving the Capacitated Vehicle Routing Problem," J. Intell. Inform. Syst., 15(1), 1-14(2009).
  27. Colorni, A., Dorigo, M. and Maniezzo, V., "Distributed Optimization by Ant Colonies," ECAL, MIT Press Bradford Books, Cambridge, 134-142(1991).
  28. Dorigo, M. and Gambardella, L. M., "Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem," IEEE Trans. Evol. Comput., 1(1), 53-66(1997). https://doi.org/10.1109/4235.585892
  29. Bullnheimer, B., Hartl, R. F. and Strauss, C., "Applying the Ant System to the Vehicle Routing Problem," MIC97, 1-12(1997).
  30. Gambardella, L. M., Taillard, E. and Agazzi, G., "MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows," New Ideas in Optimization. McGraw-Hill, London, UK, 63-76(1999).
  31. Colorni, A., Dorigo, M. and Maniezzo, V., "Ant System for Job-shop Scheduling," Belgian Journal of Operations Research, 1-14(1994).
  32. Garcia, Oscar Cordon, I. Fernandez de Viana, Francisco Herrera, "Analysis of the Best-worst Ant System and its Variants on the TSP," Mathware Soft Comput, 9(3), 177-192(2002).
  33. Stützle, T. and Hoos, H., "The Ant System and Local Search for the Traveling Salesman Problem," IEEE Conf. Evol. Comput., 308-313(1997).
  34. Gambardella, L. M., Taillard, E. and Agazzi, G., "MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows," New Ideas in Optimization. McGraw-Hill, London, UK, pp.63-76(1999).
  35. Geem, Z.-W. and Sim, K.-B., "Parameter-setting-free Harmony Search Algorithm," Appl. Math Comput., 217(8), 3881-3889(2010). https://doi.org/10.1016/j.amc.2010.09.049
  36. Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R. and Graham, R. L., "Worst-case Performance Bounds for Simple One-Dimensional Packing Algorithms," Siam. J. Comput., 3(4), 299-325(1974). https://doi.org/10.1137/0203025
  37. Vester, J., "A Tabu Search Heuristic for the Vehicle Routing Problem with Two-Dimensional Loading Constraints," Erasmus University, Rotterdam(2015).