15 results for “Peerayuth Charnsethikul”

Set a search alert

Research ArticleOpen accessIn the author namesOptimization Based Heuristic Approaches for Solving an Integrated One-dimensional Cutting Stock-Transportation ProblemSirirat Wongprakornkul, Peerayuth CharnsethikulIn 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 … …Journal of Mathematics and Statistics, Vol. 3, Issue 3 · 30 Sep 2007 · 6,741 accessesView PDF Cite

Research ArticleOpen accessIn the author namesAn Efficient Algorithm for Capacitated Multifacility Location ProblemsChansiri Singhtaun, Peerayuth CharnsethikulIn this paper, a squared-Euclidean distance multifacility location problem with inseparable demands under balanced transportation constraints is analyzed. Using calculus to project the problem onto the space of allocation variables, the problem becomes minimizing concave quadratic integer programming problem. The algorithm based on extreme point ranking method combining with logical techniques is developed. The numerical experiments are randomly generated to … …Journal of Computer Science, Vol. 3, Issue 8 · 31 Aug 2007 · 6,441 accessesView PDF Cite

Research ArticleOpen accessIn the author namesParallel Approaches for Intervals Analysis of Variable Statistics in Large and Sparse Linear Equations with RHS RangesPeerayuth CharnsethikulThis study proposes an algorithm capable of working in parallel for solving large and sparse linear equations under given right hand side (RHS) ranges. A comparative study to the direct linear programming method is reported theoretically, computationally and discussed. Moreover, the approach can be adapted for the system under domain decompositions structure leading to a better efficiency experimentally. …American Journal of Applied Sciences, Vol. 4, Issue 5 · 31 May 2007 · 6,823 accessesView PDF Cite

Research ArticleOpen accessIn the author namesThe Constrained Bottleneck Transportation ProblemPeerayuth Charnsethikul, Saeree SvetasreniTwo classes of the bottleneck transportation problem with an additional budget constraint are introduced. An exact approach was proposed to solve both problem classes with proofs of correctness and complexity. Moreover, the approach was extended to solve a class of multi-commodity transportation network with a special case of the multi-period constrained bottleneck assignment problem. …Journal of Mathematics and Statistics, Vol. 3, Issue 1 · 31 Mar 2007 · 7,030 accessesView PDF Cite

Research ArticleOpen accessIn the author namesAn Exact Algorithm for the Unbounded Knapsack Problem with Minimizing Maximum Processing TimeChanin Srisuwannapa, Peerayuth CharnsethikulWe address a variant of the unbounded knapsack problem (UKP) into which the processing time of each item is also put and considered, referred as MMPTUKP. The MMPTUKP is a decision problem of allocating amount of n items, such that the maximum processing time of the selected items is minimized and the total profit is gained as at least as … …Journal of Computer Science, Vol. 3, Issue 3 · 31 Mar 2007 · 7,595 accessesView PDF Cite