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 条
  • [41] 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 (21): : 8470 - 8477
  • [42] On solution of the capacitated single allocation hub location problem
    Chen, Jeng-Fung
    IMECS 2007: International Multiconference of Engineers and Computer Scientists, Vols I and II, 2007, : 2353 - 2356
  • [43] Genetic algorithms for the single source capacitated location problem
    Cortinhal, MJ
    Captivo, ME
    METAHEURISTICS: COMPUTER DECISION-MAKING, 2004, 86 : 187 - 216
  • [44] A Comparison of Simulated Annealing Cooling Strategies for Redesigning a Warehouse Network Problem
    Khairuddin, Rozieana
    Zainuddin, Zaitul Marlizawati
    2ND INTERNATIONAL CONFERENCE ON APPLIED & INDUSTRIAL MATHEMATICS AND STATISTICS, 2019, 1366
  • [45] Hybrid Particle Swarm Optimization and Simulated Annealing for Capacitated Vehicle Routing Problem
    Mar'i, Farhanna
    Mahmudy, Wayan Firdaus
    Santoso, Purnomo Budi
    PROCEEDINGS OF 2019 4TH INTERNATIONAL CONFERENCE ON SUSTAINABLE INFORMATION ENGINEERING AND TECHNOLOGY (SIET 2019), 2019, : 66 - 71
  • [46] An improved simulated annealing algorithm with crossover operator for capacitated vehicle routing problem
    Ilhan, Ilhan
    SWARM AND EVOLUTIONARY COMPUTATION, 2021, 64
  • [47] Adaptive temperature control of simulated annealing for solving capacitated vehicle routing problem
    Turky, Ayad M.
    COMPUTER COMMUNICATION AND MANAGEMENT, 2011, 5 : 80 - 82
  • [48] Empirical-type simulated annealing for solving the capacitated vehicle routing problem
    Rabbouch, Bochra
    Saadaoui, Foued
    Mraihi, Rafaa
    JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 2020, 32 (03) : 437 - 452
  • [49] Self-Organizing Map and Sweep algorithm to Solve the Capacitated Location Routing Problem
    Oudouar, Fadoua
    Lazaar, Mohamed
    El Fallahi, Abdellah
    PROCEEDINGS OF 2019 IEEE 4TH WORLD CONFERENCE ON COMPLEX SYSTEMS (WCCS' 19), 2019, : 272 - 276
  • [50] A novel approach based on heuristics and a neural network to solve a capacitated location routing problem
    Oudouar, Fadoua
    Lazaar, Mohamed
    El Miloud, Zaoui
    SIMULATION MODELLING PRACTICE AND THEORY, 2020, 100