Peerayuth Charnsethikul

Learn More
We 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 determined without(More)
In 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(More)
This paper presents an algorithm combining dynamic programming (DP), benders decomposition and metaheuristics for solving a dynamic facility layout problem. The problem is proposed as an extended model of quadratic assignment problem (QAP) called the dynamic quadratic assignment problem (DQAP). Solving for an optimal solution is extremely difficult since(More)
It is well known that Data Envelopment Analysis (DEA) is a relative efficiency measurement tool, which uses optimization techniques to automatically calculate the weights assigned to the crisp deterministic multiple inputs and outputs of a set of the Decision Making Units (DMUs) being assessed. However, crisp deterministic data requirement delimits an(More)
1 This work suggests ordering alternatives under fuzzy multiple criteria decision making (MCDM) via a fuzzy number dominance based ranking approach, where the ratings of alternatives versus qualitative criteria and the importance weights of all criteria are assessed in linguistic values represented by fuzzy numbers. The difference of one final fuzzy(More)
Problem 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(More)
In this paper, a single-source capacitated multi-facility location problem with rectilinear distance under unbalanced transportation constraints is studied. The problem is formulated as a mixed integer linear programming problem of which the objective function is the sum of nonlinear functions. An algorithm under decomposition approach combining with logic(More)
Problem 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(More)
The feed-mix problem is primarily transformed into a mixing situation applying a mathematic formulation with uncertainties. These uncertainties generate the numerous expansions of alternative constraint equations. The given problem has been formulated as mathematic models which correspond to a large-scale Stochastic Programming that cannot be solved by the(More)