Research Article Open Access

Optimization Based Heuristic Approaches for Solving an Integrated One-dimensional Cutting Stock-Transportation Problem

Sirirat Wongprakornkul and Peerayuth Charnsethikul

Abstract

In this work, the integration of the one-dimensional cutting stock problem with multiple cutting facilities and the transportation problem was formulated mathematically as a large-scale discrete optimization problem. Benders partitioning approach and the column-generation technique with the direct method and the proposed heuristic method for solving corresponding integer programming (IP) were developed into three approaches and were used to solve a set of various sizes test problems within a controllable computation time. The computation time and the relative-difference percentage between the lower and upper bounds are criterions. The results indicated that the approach based on the column-generation technique with the proposed heuristic method is the most efficient method for solving this studied large-scale problems. Hence, this approach could be used in practical manners; to manage both production and transportation plans simultaneously.

Journal of Mathematics and Statistics
Volume 3 No. 3, 2007, 142-150

DOI: https://doi.org/10.3844/jmssp.2007.142.150

Published On: 30 September 2007

How to Cite: Wongprakornkul, S. & Charnsethikul, P. (2007). Optimization Based Heuristic Approaches for Solving an Integrated One-dimensional Cutting Stock-Transportation Problem. Journal of Mathematics and Statistics, 3(3), 142-150. https://doi.org/10.3844/jmssp.2007.142.150

  • 2,704 Views
  • 2,032 Downloads
  • 0 Citations

Download

Keywords

  • Large-scale linear programming
  • column-generation technique
  • one-dimensional cutting stock problem
  • transportation problem
  • Benders decomposition