00000ctm a22000004a 4500 UP-99796217607596508 Buklod 20230503092542.0 m |o d | ta 010926s2000 xx r |||| u|eng d (iLib)UPD-00000484862 DML eng DMLUC LG 995 2000 A64 N47 Neri, Marrick C. Decomposition-metaheuristic method applied to a capacitated facility location problem by Marrick C. Neri. 2000. [v], 86 leaves Research project funded by the University through the Office of the Vice-Chancellor for Research and Development (OVCRD). "October 2000." Thesis (M.S. Applied Methematics)--University of the Philippines Diliman. A capacitated facility location problem (CFLP) with simulated random data is formulated as a mixed integer linear program. Benders decomposition is used to generate an optimal solution for this problem. Instead of the usual branch and bound method, Simulated Annealing and some of its variants are used to generate binary integer solutions for the relaxed master problem of the decomposition. Objective function value results are comparable, if not sometimes better than GAMS's using the branch and bound method. Decomposition method. Heuristic programming. Simulated annealing (Mathematics). Integer programming. Thesis FI UP Thesis UPD DARCHIVES LG 995 2000 A64 N47 Thesis