Journal of the Korea Society of Computer and Information (한국컴퓨터정보학회논문지)

Korean Society of Computer Information (한국컴퓨터정보학회)
권호 표지
DOI QR코드

DOI QR Code

Maximum Sugar Loss Lot First Production Algorithm for Cane Sugar Production Problem

사탕수수 설탕 생산 문제의 최대 당분 손실 로트 우선 생산 알고리즘

  • Lee, Sang-Un (Dept. of Multimedia Eng., Gangneung-Wonju National University)
  • 이상운 (강릉원주대학교 멀티미디어공학과)
  • Received : 2014.08.27
  • Accepted : 2014.11.13
  • Published : 2014.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

Gu$\acute{e}$ret et al. tries to obtain the solution using linear programming with $O(m^4)$ time complexity for cane sugar production problem a kind of bin packing problem that is classified as NP-complete problem. On the other hand, this paper suggests the maximum loss of lot first production greedy rule algorithm with O(mlogm) polynomial time complexity underlying assumption of the polynomial time rule to find the solution is exist. The proposed algorithm sorts the lots of sugar loss slope into descending order. Then, we select the lots for each slot production capacity only, and swap the exhausted life span of lots for lastly selected lots. As a result of experiments, this algorithm reduces the $O(m^4)$ of linear programming to O(mlogm) time complexity. Also, this algorithm better result than linear programming.

NP-완전인 상자 포장 문제의 일종인 사탕수수 설탕 생산 문제에 대해, Gu$\acute{e}$ret et al.은 $O(m^4)$ 수행 복잡도의 선형계획법으로 해를 얻고자 하였다. 반면에, 본 논문에서는 사탕수수 설탕 생산 문제는 다항시간으로 해를 찾아가는 규칙이 존재한다는 가정하에, 최대 손실량을 가진 로트를 우선 생산하는 탐욕 규칙인 O(mlogm)의 다항시간 복잡도로 해를 구할 수 있는 알고리즘을 제안하였다. 제안된 방법은 설탕 함유량 손실 기울기를 내림차순으로 정렬한 후, 해당 슬롯 생산능력의 로트들을 선택하는 방법과 해당 슬롯에서 수명을 다하는 로트들과 마지막으로 선택된 로트들과 교환하는 방법을 적용하였다. 실험 결과, 제안된 알고리즘은 사탕수수 설탕 생산 문제에 대해 선형계획법의 $O(m^4)$를 O(mlogm) 으로 단축시키면서도 보다 좋은 결과를 얻었다.

Keywords

References

  1. C. Gueret, X. Prins, and M. Sevaux, "Applications of Optimization with Xpress-MP: 6.4 Cane Sugar Production," Dash Optimization Ltd., pp. 73-75, Feb. 2005.
  2. E. Falkenauer, "A Hybrid Grouping Genetic Algorithm for Bin Packing," Journal of Heuristics, Vol. 2, No. 1, pp 5-30, Aug 1996. https://doi.org/10.1007/BF00226291
  3. A. Lodi, S. Martello, and D. Vigo, "Recent Advances on Two-Dimensional Bin Packing Problems," Discrete Applied Mathematics, Vol. 123, No. 1-3, pp. 379-396, Nov. 2002. https://doi.org/10.1016/S0166-218X(01)00347-X
  4. M. Edvall, "Tank Loading," Tomlab Optimization Inc, http://tomsym.com/examples/tomsym_tankloa- ding.html, Apr. 2009.
  5. G. D. Thompson and P. K. Moberly, "Programme Planning: A Step Towards Improved Sugarcane Production," Proceedings of The South Africa Sugar Technologists' Association, pp. 40-49, Jun. 1976.
  6. H. Heluane, M. Colombo, M. R. Hernandez, M. Graells, and L. Puigjaner, "Enhancing Sugar Cane Process Performance Through Optimal Production Scheduling," Chemical Engineering and Processing: Process Intensification, Vol. 46, No. 3, pp. 198-209, Mar. 2007. https://doi.org/10.1016/j.cep.2006.05.015
  7. J. Kallrath, and A. Schreieck, "Discrete Optimisation and Real World Problems," Europe '95 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking, Lecture Notes in Computer Science, Vol. 919, pp. 351-359, May 1995.
  8. J. J. Hopfield, and D. W. Tank, "Neural Computation of Decisions in Optimization Problems," Biological Cybernetics, Vol. 52, No. 3, pp. 141-152, Jul. 1985.
  9. J. Kallrath, "Mixed Integer Optimization in the Chemical Process Industry: Experience, Potential and Future Perspectives," Chemical Engineering Research and Design, Vol. 78, No. 6, pp. 809-822, Sep. 2000. https://doi.org/10.1205/026387600528012
  10. P. Wright, "Consumer Choice Strategies: Simplifying vs. Optimizing," Journal of Marketing Research, Vol. 12, No. 1, pp. 60-67, Feb. 1975. https://doi.org/10.2307/3150659
  11. S. U. Lee, "A Polynomial Time Optimal Algorithm for Linear Bin Packing Problem," Journal of the Korea Society of Computer and Information, Vol. 11, No. 8, pp. 9-16, Aug. 2013.
  12. G. Bendall and F. Margot, "Greedy Type Resistance of Combinatorial Problems," Discrete Optimization, Vol. 3, No. 4, pp. 288-298, Dec. 2006. https://doi.org/10.1016/j.disopt.2006.03.001

Cited by

  1. A Study on the Health Policy Issues of Telemedicine Problem in Korean vol.20, pp.11, 2014, https://doi.org/10.9708/jksci.2015.20.11.151