Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

110 articles for “Peer-to-peer”
Set a search alert
Research ArticleOpen accessIn the author namesComparison 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,529 accessesView PDFCite
Research ArticleOpen accessIn the author namesBenders' 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,684 accessesView PDFCite
Research ArticleOpen accessIn the author namesA 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,951 accessesView PDFCite
Research ArticleOpen accessIn the author namesComputational 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,650 accessesView PDFCite
Research ArticleOpen accessIn the author namesA 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,922 accessesView PDFCite
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,744 accessesView PDFCite
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,443 accessesView PDFCite
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,826 accessesView PDFCite
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,033 accessesView PDFCite
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,597 accessesView PDFCite