02550nam a2200253 a 450000500170000000800410001703500150005810000220007324500800009526000570017530000310023249000280026350001860029150200590047752013950053665000230193165000250195470000440197970000470202370000420207071000580211281000600217085600660223020260817162132.0140625s2012    th ad  |||   |000 0 eng d  a.b121354830 aSaowanit Lekhavat10aAllocation methods for a multicommodity distribution network design problem  aPathum Thani :bAsian Institute of Technology,c2012  a72 p. :bcol. ill., charts1 aThesis ;vno. ISE-12-13  aA thesis submitted in partial fulfillment of the requirements for thedegree of Master of Engineering inIndustrial and Manufacturing Engineering, School of Engineering and Technology  aThesis (M. Eng.) - Asian Institute of Technology, 2012  aThis  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. 0aBusiness logistics 0aMaterials management0 aVoratas Kachitvichyanukul,eChairperson1 aHuynh, Trung Luong,eExamination Committee0 aPisut Koomsap,eExamination Committee2 aRoyal Thai Government Fellowship, eScholarship donor2 aAsian Institute of Technology.tThesis ;vno. ISE-12-13  3Full-Textuhttp://203.159.5.9/ait-thesis/detail.php?q=B03342