TY - JOUR

T1 - Simulated Annealing to Solve Single Stage Capacitated Warehouse Location Problem

AU - Santosa, Budi

AU - Kresna, I. Gusti Ngurah Agung

N1 - Publisher Copyright:
© 2015 The Authors

PY - 2015

Y1 - 2015

N2 - Facility Location Problem (FLP) is a critical aspect in supply chain that is difficult to be solved in order to design an efficient supply chain. The terms of location problem refers to modeling, formulating, and solving problem, which is determining the location of facilities in certain area. Warehouse Location Problem is one model of Facility Location Problem which aims to locate the set of warehouses as one of distribution facility. In this study, a mathematical model of Single Stage Capacitated Warehouse Location Problem (SSCWLP) has been developed to determine the optimal warehouse location in fertilizer distribution of PT. Petrokimia Gresik in Sumatera Island, Indonesia. Basically, SSCWLP is an NP-Hard problem that requires long computing time to be solved by using exact methods. The weakness is resolved by using metaheuristics algorithm, namely Simulated Annealing (SA). The next step is testing the performance of SA by comparing the results of SA with those of branch & bound (BB). The algorithm provides results which are better to the existing solutions and have small gaps with those of exact method.

AB - Facility Location Problem (FLP) is a critical aspect in supply chain that is difficult to be solved in order to design an efficient supply chain. The terms of location problem refers to modeling, formulating, and solving problem, which is determining the location of facilities in certain area. Warehouse Location Problem is one model of Facility Location Problem which aims to locate the set of warehouses as one of distribution facility. In this study, a mathematical model of Single Stage Capacitated Warehouse Location Problem (SSCWLP) has been developed to determine the optimal warehouse location in fertilizer distribution of PT. Petrokimia Gresik in Sumatera Island, Indonesia. Basically, SSCWLP is an NP-Hard problem that requires long computing time to be solved by using exact methods. The weakness is resolved by using metaheuristics algorithm, namely Simulated Annealing (SA). The next step is testing the performance of SA by comparing the results of SA with those of branch & bound (BB). The algorithm provides results which are better to the existing solutions and have small gaps with those of exact method.

KW - Capacitated Warehouse location problem

KW - Metaheuristics

KW - Simulated Annealing

UR - http://www.scopus.com/inward/record.url?scp=85019643310&partnerID=8YFLogxK

U2 - 10.1016/j.promfg.2015.11.015

DO - 10.1016/j.promfg.2015.11.015

M3 - Article

AN - SCOPUS:85019643310

SN - 2351-9789

VL - 4

SP - 62

EP - 70

JO - Procedia Manufacturing

JF - Procedia Manufacturing

ER -