KURNIASARI, IKA ESTYRAHAYU (2008) APLIKASI ANT COLONY ALGORITHM DALAM PENGOPTIMALAN JALUR DISTRIBUSI DARI VENDOR KE RETAILER. Undergraduate thesis, Diponegoro University.
Full text not available from this repository.
As the industrial world develops, companies are pushed to be sensitive in reflex of customers’ demand which usually demand good qualities and fast deliveries. In delivering goods to the customers, a company has to determine supply chain routing and distribution routing precisely. This research is a development of distribution and transportation planning especially for determining distribution routing of goods delivery. The approach used in this research is Ant Colony System (ACS). Many previous researchs claimed ACS as a new methodology which can be used for determining optimal solution of Travelling Salesman Problem (TSP). The determining of the optimal solution is about how to obtain the shortest route in a graf (a group of city) with most minimum time. Having n cities, TSP can be defined as a problem which has to be solved with the shortest route by visiting every city only one time. The writer choose ACS for solving the TSP problem and also for proving its optimality . This research is done by implementing the ACS as the Matlab codes. By comparing between the strategy of solving TSP in Nurul’s research and ACS, the result is that there is a more optimal minimizing of transportation cost in ACS method
|Item Type:||Thesis (Undergraduate)|
|Uncontrolled Keywords:||distribution, Travelling Salesman Problem (TSP), shortest route, Ant Colony System (ACS), Coding Matlab for Ant Colony System|
|Subjects:||T Technology > T Technology (General)|
|Divisions:||Faculty of Engineering > Department of Industrial Engineering|
Faculty of Engineering > Department of Industrial Engineering
|Deposited By:||Mr/Ms teknik industri|
|Deposited On:||06 May 2013 20:48|
|Last Modified:||06 May 2013 20:48|
Repository Staff Only: item control page