4 articles for “Quadratic integer programming Problem”

Set a search alert

Research ArticleOpen accessIn the keywordsLayout Optimization in a Fitness Industry: An Application of QAP Formulation and Heuristic Approachesİbrahim Miraç Eligüzel, Eren Özceylan, Yakup AtasagunThe Quadratic Assignment Problem (QAP) is the problem of determining a one-to-one and onto assignment between two sets, each consisting of n objects (e.g., n facilities and n locations) so as to minimize the sum of the distance × flow associated with pairs of assignments. In this study, QAP formulation is applied to a fitness center to assign the sports … …Journal of Computer Science, Vol. 17, Issue 4 · 3 May 2021 · 6,681 accessesView PDF Cite

Research ArticleOpen accessIn the keywordsAn 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 abstractCalculation of Total Cost, Tolerance Based on Taguchi's, Asymmetric Quality Loss Function ApproachR. Sampath Kumar, N. Alagumurthi, R. RameshProblem statement: Current world market force the manufacturing sectors to develop high quality product and process design with minimum possible cost. About 80% of problems in production units may be attributed to 20% of design tolerance causes. While design typically represents the smallest actual cost elements in products (around 5%), it leverages the largest cost influence (around 70%). So design … …American Journal of Engineering and Applied Sciences, Vol. 2, Issue 4 · 31 Dec 2009 · 8,045 accessesView PDF Cite

Research ArticleOpen accessIn the abstractBenders' 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