2 articles for “DQAP”

Set a search alert

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