A GRASP algorithm based new heuristic for the capacitated location routing problem

被引：12
|
作者：
Ferdi, Imene [1 ]
Layeb, Abdesslem [1 ]
机构：
[1] Abdelhamid Mehri Univ Constantine 2, Dept Fundamental Comp & Its Applicat, Constantine, Algeria
来源：
JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE | 2018年 / 30卷 / 03期
关键词：
Optimisation problems; capacitated location-routing problem; constructive heuristics; GRASP; local search; LOCAL SEARCH; SOLVE; MODEL;
D O I：
10.1080/0952813X.2017.1421268
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper, the capacitated location-routing problem (CLRP) is studied. CLRP is composed of two hard optimisation problems: the facility location problem and the vehicle routing problem. The objective of CLRP is to determine the best location of multiple depots with their vehicle routes such that the total cost of the solution is minimal. To solve this problem, we propose a greedy randomised adaptive search procedure. The proposed method is based on a new heuristic to construct a feasible CLRP solution, and then a local search-based simulated annealing is used as improvement phase. We have used a new technique to construct the clusters around the depots. To prove the effectiveness of our algorithm, several LRP instances are used. The results found are very encouraging.
引用
收藏
页码：369 / 387
页数：19
相关论文
共 50 条
  • [31] A memetic algorithm for the capacitated location-routing problem with mixed backhauls
    Karaoglan, Ismail
    Altiparmak, Fulya
    COMPUTERS & OPERATIONS RESEARCH, 2015, 55 : 200 - 216
  • [32] A simple and effective evolutionary algorithm for the capacitated location-routing problem
    Lopes, Rui Borges
    Ferreira, Carlos
    Santos, Beatriz Sousa
    COMPUTERS & OPERATIONS RESEARCH, 2016, 70 : 155 - 162
  • [33] Memetic Algorithm with Heuristic Candidate List Strategy for Capacitated Arc Routing Problem
    Fu, Haobo
    Mei, Yi
    Tang, Ke
    Zhu, Yanbo
    2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2010,
  • [34] Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
    Prins C.
    Prodhon C.
    Calvo R.W.
    4OR, 2006, 4 (3) : 47 - 64
  • [35] A Lagrangean heuristic for a modular capacitated location problem
    Correia, I
    Captivo, ME
    ANNALS OF OPERATIONS RESEARCH, 2003, 122 (1-4) : 141 - 161
  • [36] A Lagrangean Heuristic for a Modular Capacitated Location Problem
    Isabel Correia
    M. Eugénia Captivo
    Annals of Operations Research, 2003, 122 : 141 - 161
  • [37] A Hyper Heuristic Algorithm for Low Carbon Location Routing Problem
    Qian, Zhenyu
    Zhao, Yanwei
    Wang, Shun
    Leng, Longlong
    Wang, Wanliang
    ADVANCES IN NEURAL NETWORKS - ISNN 2018, 2018, 10878 : 173 - 182
  • [38] New heuristic algorithm for capacitated p-median problem
    Li, You-Mei
    Cao, Fei-Long
    ISDA 2006: SIXTH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS, VOL 1, 2006, : 1129 - 1131
  • [39] A districting-based heuristic for the coordinated capacitated arc routing problem
    Wohlk, Sanne
    Laporte, Gilbert
    COMPUTERS & OPERATIONS RESEARCH, 2019, 111 : 271 - 284
  • [40] An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
    Contardo, Claudio
    Cordeau, Jean-Francois
    Gendron, Bernard
    INFORMS JOURNAL ON COMPUTING, 2014, 26 (01) : 88 - 102
12345