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 条
  • [31] Combining Lagrangian heuristic and Ant Colony System to solve the Single Source Capacitated Facility Location Problem
    Chen, Chia-Ho
    Ting, Ching-Jung
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2008, 44 (06) : 1099 - 1122
  • [32] A population based simulated annealing algorithm for capacitated vehicle routing problem
    Ilhan, Ilhan
    TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES, 2020, 28 (03) : 1217 - 1235
  • [33] Capacitated warehouse location model with risk pooling
    Ozsen, Leyla
    Coullard, Collette R.
    Daskin, Mark S.
    NAVAL RESEARCH LOGISTICS, 2008, 55 (04) : 295 - 312
  • [34] A Hybrid and colony optimization Algorithm with local search strategies to solve Single Source Capacitated Facility Location Problem
    Yang Lina
    Sun Xu
    Chi Tanhe
    2012 INTERNATIONAL CONFERENCE ON INDUSTRIAL CONTROL AND ELECTRONICS ENGINEERING (ICICEE), 2012, : 83 - 85
  • [35] A hybridisation of linear programming and genetic algorithm to solve the capacitated facility location problem
    Ozsoydan, Fehmi Burcin
    Golcuk, Ilker
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2023, 61 (10) : 3331 - 3349
  • [36] A Large Neighbourhood Search to Solve Capacitated Planar Location-Allocation Problem
    Luis, Martino
    Lamsali, Hendrik
    Saputra, Ruswiati Surya
    INTERNATIONAL CONFERENCE ON QUANTITATIVE SCIENCES AND ITS APPLICATIONS (ICOQSIA 2014), 2014, 1635 : 620 - 628
  • [37] A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints
    Massimiliano Caramia
    Renato Mari
    Optimization Letters, 2016, 10 : 997 - 1019
  • [38] Using greedy clustering method to solve capacitated location-routing problem
    Sahraeian, Rashed
    Nadizadeh, Ali
    DIRECCION Y ORGANIZACION, 2009, 39 : 79 - 85
  • [39] Using greedy clustering method to solve capacitated location-routing problem
    Nadizadeh, Ali
    Sahraeian, Rashed
    Zadeh, Ali Sabzevari
    Homayouni, Seyed Mahdi
    AFRICAN JOURNAL OF BUSINESS MANAGEMENT, 2011, 5 (17): : 7499 - 7506
  • [40] A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints
    Caramia, Massimiliano
    Mari, Renato
    OPTIMIZATION LETTERS, 2016, 10 (05) : 997 - 1019