A Metaheuristic to Solve a Location-Routing Problem with Non-Linear Costs

被引：0
|
作者：
Jan Melechovský
Christian Prins
Roberto Wolfler Calvo
机构：
[1] Czech Technical University,Department of Logistics and Transportation Processes, Faculty of Transportation Sciences
[2] Université de Technologie de Troyes,Institut des Sciences et Technologies de l'Information de Troyes (ISTIT)
来源：
Journal of Heuristics | 2005年 / 11卷
关键词：
location; location-routing; tabu search; Variable Neighborhood Search;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The paper deals with a location-routing problem with non-linear cost functions. To the best of our knowledge, a mixed integer linear programming formulation for the addressed problem is proposed here for the first time. Since the problem is NP-hard exact algorithms are able to solve only particular cases, thus to solve more general versions heuristics are needed. The algorithm proposed in this paper is a combination of a p-median approach to find an initial feasible solution and a metaheuristic to improve the solution. It is a hybrid metaheuristic merging Variable Neighborhood Search (VNS) and Tabu Search (TS) principles and exploiting the synergies between the two. Computational results and conclusions close the paper.
引用
收藏
页码：375 / 391
页数：16
相关论文
共 50 条
  • [1] A metaheuristic to solve a location-routing problem with non-linear costs
    Melechovsky, J
    Prins, C
    Calvo, R
    [J]. JOURNAL OF HEURISTICS, 2005, 11 (5-6) : 375 - 391
  • [2] A Metaheuristic for the Periodic Location-Routing Problem
    Prodhon, Caroline
    [J]. OPERATIONS RESEARCH PROCEEDINGS 2007, 2008, : 159 - 164
  • [3] A Metaheuristic for a Two Echelon Location-Routing Problem
    Boccia, Maurizio
    Crainic, Teodor G.
    Sforza, Antonio
    Sterle, Claudio
    [J]. EXPERIMENTAL ALGORITHMS, PROCEEDINGS, 2010, 6049 : 288 - +
  • [4] A GRASP + ILP-based metaheuristic for the capacitated location-routing problem
    Claudio Contardo
    Jean-François Cordeau
    Bernard Gendron
    [J]. Journal of Heuristics, 2014, 20 : 1 - 38
  • [5] A GRASP + ILP-based metaheuristic for the capacitated location-routing problem
    Contardo, Claudio
    Cordeau, Jean-Francois
    Gendron, Bernard
    [J]. JOURNAL OF HEURISTICS, 2014, 20 (01) : 1 - 38
  • [6] Location-Routing Problems: Characteristics and Metaheuristic Algorithms
    Toth, Paolo
    Mahjoub, Ridha
    Gregoire, Amphitheatre A.
    [J]. 2019 6TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT 2019), 2019,
  • [7] Using greedy clustering method to solve capacitated location-routing problem
    Nadizadeh, Ali
    Sahraeian, Rashed
    Zadeh, Ali Sabzevari
    Homayouni, Seyed Mahdi
    [J]. AFRICAN JOURNAL OF BUSINESS MANAGEMENT, 2011, 5 (21): : 8470 - 8477
  • [8] Using greedy clustering method to solve capacitated location-routing problem
    Sahraeian, Rashed
    Nadizadeh, Ali
    [J]. DIRECCION Y ORGANIZACION, 2009, 39 : 79 - 85
  • [9] Using greedy clustering method to solve capacitated location-routing problem
    Nadizadeh, Ali
    Sahraeian, Rashed
    Zadeh, Ali Sabzevari
    Homayouni, Seyed Mahdi
    [J]. AFRICAN JOURNAL OF BUSINESS MANAGEMENT, 2011, 5 (17): : 7499 - 7506
  • [10] The green location-routing problem
    Dukkanci, Okan
    Kara, Bahar Y.
    Bektas, Tolga
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2019, 105 : 187 - 202
12345