Author

Peerayuth Charnsethikul

Kasetsart University, Thailand

14 articles in our journals

Articles where this person is an author, newest first. People are matched by their name as printed (no ORCID iD is recorded for them), not by name alone; search the name as text to find namesakes too.

Research ArticleOpen accessA Successive Admissible Cell Method for Solving Large Scale Linear Assignment Problem with Dense Cost MatrixWarut Boonphakdee, Peerayuth CharnsethikulNormally, the Linear Assignment Problem (LAP) has been solved by successful algorithms such as Lapjv and Munkres programmed as MATLAB codes. This study presented an improved algorithm for solving large scale LAP. A preprocessing (PP) algorithm was proposed to apply for constructing the kth transferred reduced cost matrix then this matrix was solved by Lapjvalgorithm. Performances of PP-Lapjvalgorithm were faster … …Journal of Computer Science, Vol. 12, Issue 8 · 16 Nov 2016 · 6,948 accessesView PDF Cite

Research ArticleOpen accessUSING COLUMN GENERATION TECHNIQUE TO ESTIMATE PROBABILITY STATISTICS IN TRANSITION MATRIX OF LARGE SCALE MARKOV CHAIN WITH LEAST ABSOLUTE DEVIATION CRITERIAWanida Lerspipatthananon, Peerayuth CharnsethikulThe Least Absolute Deviation (LAD) method is the one of many methods used to estimate transition probability matrix of Markov Chain. It can be formulated as a Linear Programming Problem (LP) and solved using its regular state of the art software. However, when the Markov Chain has a large number of states and historical state probabilities data, the corresponding LP … …Journal of Mathematics and Statistics, Vol. 10, Issue 3 · 23 Sep 2014 · 7,116 accessesView PDF Cite

Research ArticleOpen accessTwo Reformulations for the Dynamic Quadratic Assignment ProblemSirirat Muenvanichakul, Peerayuth CharnsethikulProblem statement: The Dynamic Quadratic Assignment Problem (DQAP), an NP-hard problem, is outlined and reformulated in two alternative models: Linearized model and logic-based model. Approach: The solution methods for both models based on combinatorial methods (Benders’ Decomposition and Approximate Dynamic Programming) and constraint logic programming, respectively, are proposed. Results: Proofs of model equivalence and solution methodology are presented. Conclusion: Both … …Journal of Mathematics and Statistics, Vol. 6, Issue 4 · 31 Dec 2010 · 7,947 accessesView PDF Cite

Research ArticleOpen accessSolving One-Dimensional Cutting Stock Problem with Discrete Demands and Capacitated Planning ObjectiveSirirat Wongprakornkul, Peerayuth CharnsethikulProblem statement: One-dimensional cutting stock problem with discrete demands and capacitated planning objective is an NP hard problem. Approach: The mathematical model with column-generation technique by a branch-and-bound procedure and the heuristic based on the first fit decreasing method are proposed. Then, both approaches were compared and some characteristics were investigated such as upper-bound value, percentage above lower-bound value, computation … …Journal of Mathematics and Statistics, Vol. 6, Issue 2 · 30 Jun 2010 · 7,947 accessesView PDF Cite

Research ArticleOpen accessComparison of Exact Algorithms for Rectilinear Distance Single-Source Capacitated Multi-Facility Weber ProblemsChansiri Singhtaun, Peerayuth CharnsethikulProblem statement: The objective of this study is to develop efficient exact algorithms for a single source capacitated multi-facility location problem with rectilinear distance. This problem is concerned with locating m capacitated facilities in the two dimensional plane to satisfy the demand of n customers with minimum total transportation cost which is proportional to the rectilinear distance between the facilities … …Journal of Computer Science, Vol. 6, Issue 2 · 28 Feb 2010 · 7,524 accessesView PDF Cite

Research ArticleOpen accessBenders' Decomposition Based Heuristics for Large-Scale Dynamic Quadratic Assignment ProblemsSirirat Muenvanichakul, Peerayuth CharnsethikulProblem statement: Dynamic Quadratic Assignment Problem (DQAP) is NP hard problem. Benders decomposition based heuristics method is applied to the equivalent mixed-integer linear programming problem of the original DQAP. Approach: Approximate Benders Decomposition (ABD) generates the ensemble of a subset of feasible layout for Approximate Dynamic Programming (ADP) to determine the sub-optimal optimal solution. A Trust-Region Constraint (TRC) for the … …Journal of Computer Science, Vol. 5, Issue 1 · 31 Jan 2009 · 7,681 accessesView PDF Cite

Research ArticleOpen accessA Stochastic Knapsack Problem with Continuous Random CapacitySuwitchporn Witchakul, Prapaisri Sudas Na Ayudhaya, Peerayuth CharnsethikulProblem Statement: The problem of allocating a set of items in order to maximize the toal linear profit under uncertain capacity referred as a stochastic knapsack problem with continuous random capacity was studied theoretically and computationally. Approach: Two optimization based heuristic algorithms were proposed and developed for solving the problem and both efficiency and effectiveness are compared with the general … …Journal of Mathematics and Statistics, Vol. 4, Issue 4 · 31 Dec 2008 · 6,946 accessesView PDF Cite

Research ArticleOpen accessComputational Discrete Time Markov Chain with Correlated Transition ProbabilitiesPeerayuth CharnsethikulThis study presents a computational procedure for analyzing statistics of steady state probabilities in a discrete time Markov chain with correlations among their transition probabilities. The proposed model simply uses the first order Taylor’s series expansion and statistical expected value properties to obtain the resulting linear matrix equations system. Computationally, the bottleneck is O(n4) but can be improved by distributed … …Journal of Mathematics and Statistics, Vol. 2, Issue 4 · 31 Dec 2007 · 6,648 accessesView PDF Cite

Research ArticleOpen accessA Graphical Based Method for a Class of One-Stage Bounded Variables and Single Constrained Linear Programming ProblemsSuwitchaporn Witchakul, Prapaisri Sudasna-na-Ayudthya, Peerayuth Charnsethikul, Kamlesh MathurAn efficient and effective special purpose method is proposed for solving a class of one-stage single constrained linear programming problems with a finite number of right hand side scenarios and bounded variables. We compare our proposed method with a general purpose method using CPLEX interactive optimizer. For various m and n, by using elapsed computational time as the criteria, our … …American Journal of Applied Sciences, Vol. 4, Issue 12 · 31 Dec 2007 · 6,919 accessesView PDF Cite

Research ArticleOpen accessOptimization 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