03529nam a2200433 a 4500 20260817162132.0 140625s2012 th ad ||| |000 0 eng d .b12135483 AIT Thesis no.ISE-12-13 Saowanit Lekhavat Allocation methods for a multicommodity distribution network design problem Pathum Thani : Asian Institute of Technology, 2012 72 p. : col. ill., charts Thesis ; no. ISE-12-13 A thesis submitted in partial fulfillment of the requirements for thedegree of Master of Engineering inIndustrial and Manufacturing Engineering, School of Engineering and Technology Thesis (M. Eng.) - Asian Institute of Technology, 2012 This research presents new allocation schemes which are 2highest-total-demand customer to nearest DC3 and 2nearest all types of facilities3 to solve multicommodity distribution network design problem (MDNP). This is a strategic planning model where the important decisions to select of the locations of suppliers, plants and distribution centers (DCs), and to make allocation decisions about the number of raw materials and products from suppliers to plants, plant to DCs and DCs to customers so as to minimize the total costs. A mathematical model is formulated for the 3-stage MDNP (suppliers, plants, DCs) and also includes the bill of material so that a product can be made from several raw materials. The comparisons between two metaheuristics which are Differential Evaluation (DE) algorithm and Particle Swarm Optimization with multiple social learning terms (GLNPSO) are made to find which method is better in solving MDNP. A new way of finding parameter setting of GLNPSO is proposed based on self adapted parameters.The proposed allocation methods are then compared using the GLNPSO version of the MDNP algorithm.The 2highest-total-demand customer to nearest DC3 approach is then compared with2nearest all types of facilities3 algorithm on the 3-stage cases except the largest case. Business logistics Materials management Voratas Kachitvichyanukul, Chairperson Huynh, Trung Luong, Examination Committee Pisut Koomsap, Examination Committee Royal Thai Government Fellowship, Scholarship donor Asian Institute of Technology. Thesis ; no. ISE-12-13 Full-Text http://203.159.5.9/ait-thesis/detail.php?q=B03342 .b12135483 mnait j 240404 0 140625 m a j 0 000:001:PDF:b1213548:001715:0:0:0:0:0:0 Abstract--AIT Thesis no.ISE-12-13 n mnait mnait mnarc 20 40 Barcode : 30050120803514 CREATED : 2014-07-22 RECORD # : i12818793 LPATRON : 1026326 LCHKIN : 2017-10-02 # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 1 TOT CHKOUT : 2 TOT RENEW : 2 Barcode : 30050120803522 CREATED : 2014-07-22 RECORD # : i1281880x LPATRON : 1027806 LCHKIN : 2018-08-06 # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 1 TOT CHKOUT : 1 TOT RENEW : 0 Barcode : 30050160029442 CREATED : 2016-03-17 RECORD # : i12893481 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 4003 4003 0 0 0 0 MAIN MAIN mnait 2026-08-17 50.00 0 AIT Thesis no.ISE-12-13 30050120803514 2026-08-17 16:21:32 1 2026-08-17 20 0 0 0 0 MAIN MAIN mnait 2026-08-17 50.00 0 AIT Thesis no.ISE-12-13 30050120803522 2026-08-17 16:21:32 2 2026-08-17 20 0 0 0 0 MAIN MAIN mnarc 2026-08-17 0 AIT Thesis no.ISE-12-13 30050160029442 2026-08-17 16:21:32 1 2026-08-17 40