A simulated annealing heuristic for the capacitated location routing problem

被引：202
|
作者：
Yu, Vincent F. [2 ]
Lin, Shih-Wei [1 ]
Lee, Wenyih [3 ]
Ting, Ching-Jung [4 ]
机构：
[1] Chang Gung Univ, Dept Informat Management, Tao Yuan 333, Taiwan
[2] Natl Taiwan Univ Sci & Technol, Dept Ind Management, Sect 4, Taipei 106, Taiwan
[3] Chang Gung Univ, Dept Business Adm, Tao Yuan 333, Taiwan
[4] Yuan Ze Univ, Dept Ind Engn & Management, Chungli 32003, Taiwan
来源：
COMPUTERS & INDUSTRIAL ENGINEERING | 2010年 / 58卷 / 02期
关键词：
Location routing problem; Simulated annealing; Heuristic; DELIVERY SERVICES; DEPOT LOCATION; VEHICLE; ALGORITHM; MODELS; SYSTEM;
D O I：
10.1016/j.cie.2009.10.007
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
The location routing problem (LRP) is a relatively new research direction within location analysis that takes into account vehicle routing aspects. The goal of LRP is to solve a facility location problem and a vehicle routing problem simultaneously. We propose a simulated annealing (SA) based heuristic for solving the LRP. The proposed SALRP heuristic is tested on three sets of well-known benchmark instances and the results are compared with other heuristics in the literature. The computational study indicates that the proposed SALRP heuristic is competitive with other well-known algorithms. (C) 2009 Elsevier Ltd. All rights reserved.
引用
收藏
页码：288 / 299
页数：12
相关论文
共 50 条
  • [1] A Simulated Annealing Heuristic for the Capacitated Green Vehicle Routing Problem
    Normasari, Nur Mayke Eka
    Yu, Vincent F.
    Bachtiyar, Candra
    Sukoyo
    [J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2019, 2019
  • [2] A simulated annealing heuristic for the open location-routing problem
    Yu, Vincent F.
    Lin, Shin-Yu
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2015, 62 : 184 - 196
  • [3] A combination of simulated annealing and ant colony system for the capacitated location-routing problem
    Bouhafs, Lyamine
    hajjam, Amir
    Koukam, Abder
    [J]. KNOWLEDGE-BASED INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, PT 1, PROCEEDINGS, 2006, 4251 : 409 - 416
  • [4] A simulated annealing heuristic for the hybrid vehicle routing problem
    Yu, Vincent F.
    Redi, A. A. N. Perwira
    Hidayat, Yosi Agustina
    Wibowo, Oktaviyanto Jimat
    [J]. APPLIED SOFT COMPUTING, 2017, 53 : 119 - 132
  • [5] A GRASP algorithm based new heuristic for the capacitated location routing problem
    Ferdi, Imene
    Layeb, Abdesslem
    [J]. JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 2018, 30 (03) : 369 - 387
  • [6] Multi-start simulated annealing heuristic for the location routing problem with simultaneous pickup and delivery
    Yu, Vincent F.
    Lin, Shih-Wei
    [J]. APPLIED SOFT COMPUTING, 2014, 24 : 284 - 290
  • [7] A hybrid simulated annealing based heuristic for solving the location-routing problem with fuzzy demands
    Ghaffari-Nasab, N.
    Ahari, S. Ghazanfar
    Ghazanfari, M.
    [J]. SCIENTIA IRANICA, 2013, 20 (03) : 919 - 930
  • [8] A population based simulated annealing algorithm for capacitated vehicle routing problem
    Ilhan, Ilhan
    [J]. TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES, 2020, 28 (03) : 1217 - 1235
  • [9] Heuristic algorithms for the capacitated location-routing problem and the multi-depot vehicle routing problem
    Escobar, John Willmer
    [J]. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2014, 12 (01): : 99 - 100
  • [10] Heuristic algorithms for the capacitated location-routing problem and the multi-depot vehicle routing problem
    John Willmer Escobar
    [J]. 4OR, 2014, 12 : 99 - 100
12345