Simulated Annealing to solve single stage capacitated warehouse location problem

被引:8
|
作者
Santosa, Budi [1 ]
Kresna, I. Gusti Ngurah Agung [1 ]
机构
[1] Inst Teknol Sepuluh Nopember, Dept Ind Engn, Kampus ITS, Surabaya 60111, Indonesia
关键词
Capacitated Warehouse location problem; Simulated Annealing; Metaheuristics; BOUND ALGORITHM; PLANT-LOCATION;
D O I
10.1016/j.promfg.2015.11.015
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
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. (C) 2015 The Authors. Published Elsevier B.V.
引用
收藏
页码:62 / 70
页数:9
相关论文
共 50 条
  • [21] Applying multiple ant colony system to solve single source capacitated facility location problem
    Chen, Chia-Ho
    Ting, Ching-Jung
    ANT COLONY OPTIMIZATION AND SWARM INTELLIGENCE, PROCEEDINGS, 2006, 4150 : 508 - 509
  • [22] A simulated annealing approach for redesigning a warehouse network problem
    Khairuddin, Rozieana
    Zainuddin, Zaitul Marlizawati
    Jiun, Gan Jia
    1ST INTERNATIONAL CONFERENCE ON APPLIED & INDUSTRIAL MATHEMATICS AND STATISTICS 2017 (ICOAIMS 2017), 2017, 890
  • [23] Using a personal computer to solve a warehouse location/consolidation problem
    Watts, C.A.
    Production and Inventory Management Journal, 2000, 41 (04): : 23 - 28
  • [24] Multi-Neighborhood Simulated Annealing for the Capacitated Dispersion Problem
    Rosati, Roberto Maria
    Schaerf, Andrea
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 255
  • [25] Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): Empirical investigation for assessing relative strengths and computational effort
    Sharma, R. R. K.
    Berry, V.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 177 (02) : 803 - 812
  • [26] CAPACITATED WAREHOUSE LOCATION WITH CONCAVE COSTS
    KELLY, DL
    KHUMAWALA, BM
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1982, 33 (09) : 817 - 826
  • [27] A Simulated Annealing Heuristic for the Capacitated Green Vehicle Routing Problem
    Normasari, Nur Mayke Eka
    Yu, Vincent F.
    Bachtiyar, Candra
    Sukoyo
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2019, 2019
  • [28] Improved simulated annealing algorithm for capacitated vehicle routing problem
    Shang Z.
    Gu J.
    Wang J.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2021, 27 (08): : 2260 - 2269
  • [29] Using simulated annealing to solve the classroom assignment problem
    MartinezAlfaro, H
    Minero, J
    Alanis, GE
    Leal, NA
    Avila, IG
    PROCEEDINGS ISAI/IFIS 1996 - MEXICO - USA COLLABORATION IN INTELLIGENT SYSTEMS TECHNOLOGIES, 1996, : 370 - 377
  • [30] USING SIMULATED ANNEALING TO SOLVE ROUTING AND LOCATION-PROBLEMS
    GOLDEN, BL
    SKISCIM, CC
    NAVAL RESEARCH LOGISTICS, 1986, 33 (02) : 261 - 279