A multicommodity distribution network design in supply chain management | |
| Author | Manavit Vinaipanit |
| Call Number | AIT Thesis no.ISE-06-13 |
| Subject(s) | Business logistics--Mathematical models Genetic algorithms |
| Note | A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology |
| Publisher | Asian Institute of Technology |
| Series Statement | Thesis ; no. ISE-06-13 |
| Abstract | This study describes a multi commodity distribution network design problem in the supply chain that involves locating of plants and distribution centers, and determining the best strategy to distribute the products in a distribution network. The objective of the model is to choose the number and the location of plants and distribution centers in order to minimize the total relevant costs. The additional features which are extended from the generic model are the time-frame limitation constraint and the multiple capacity level availability for plants and distribution centers. The time-frame limitation constraint in term of transported distance or time guarantees the serviceability of the distribution centers for each customer. The use of multiple capacity level availability makes the problem more applicable for the real situation. The mixed-integer linear programming model is developed and verified, and a genetic algorithm is proposed to solve the problem. A genetic algorithm is designed and implemented with the class library from the Genetic Algorithm Library (GALib). The alternative encoding method with real number encoding is applied to the problem. The genetic operators and the GA parameters are examined to find the best combination specified for each problem group. Seventeen randomly generated test problems of various sizes and a real case are tested using the algorithm. The solutions from the algorithm are compared with the results from the commercial software package LINGO. The results show that the proposed algorithm performs well for large problem size. The results from the case study also illustrate the good applicability of the proposed method to the real situation. Moreover, the proposed GA can be easily implemented to consider various scenarios for this specific problem |
| Year | 2006 |
| Corresponding Series Added Entry | Asian Institute of Technology. Thesis ; no. ISE-06-13 |
| Type | Thesis |
| School | School of Engineering and Technology (SET) |
| Department | Department of Industrial Systems Engineering (DISE) |
| Academic Program/FoS | Industrial Systems Engineering (ISE) |
| Chairperson(s) | Voratas Kachitvichyanukul; |
| Examination Committee(s) | Huynh Trung Luong;Yordphol Tanaboriboon; |
| Scholarship Donor(s) | Royal Thai Government Fellowship; |
| Degree | Thesis (M.Eng.) - Asian Institute of Technology, 2006 |