1
Evolutionary algorithms for multi-commodity distribution network design problem | |
Author | Benyaphorn Chiamchit |
Note | A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering in Industrial and Manufacturing Engineering, School of Engineering and Technology |
Publisher | Asian Institute of Technology |
Abstract | The Goal of Multi-commodity Distribution Network Design Problem (MDNP) is to determine the best locations for potential DCs, plants and suppliers and to allocate customer demands to various levels of the supply chain. The limitations of such resources as number of opening facilities; capacity of facilities for raw material, production, and storage; and variety of products have large impact on allocation strategies. The purpose of this thesis is to develop efficient solution method for solving Multi-commodity Distribution Network Design Problem (MDNP). New allocation methods are proposed and tested with Differential Evolution (DE) algorithm. The first section of the study focuses on the single objective MDNP that minimizes total cost. Three allocation strategies are proposed and implemented with DE algorithm. The first method is to allocate based on the highest total demand of product type to the nearest DC. This method works well in almost all problems. However, when the optimal solution need just a few facilities, the method is easily trapped at some local optimum. The second method is to allocate based on priority of product types generated from DE vector. This method is proposed to improve the first method. The third allocation method is based on randomly selected product types. The three allocation methods are implemented and tested with DE algorithm. The second part focuses on evolution algorithm for solving multiple objective MDNP. Two conflicting objectives are considered which are the minimization of total cost and the maximization of fill rate. The evolution algorithms which are considered in this section are multi-objective DE and multi-objective GLN-PSO algorithms. The Pareto solutions found by each method are compared and the PSO solutions dominate the DE solutions in all the test problems. |
Year | 2015 |
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 ;Kanokporn Rienkhemaniyom; |
Scholarship Donor(s) | Royal Thai Government Fellowship; |