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 条

[41] A hybrid approach based on genetic algorithm and nearest neighbor heuristic for solving the capacitated vehicle routing problem
de Araujo Lima, Stanley Jefferson
de Araujo, Sidnei Alves
Triguis Schimit, Pedro Henrique
ACTA SCIENTIARUM-TECHNOLOGY, 2018, 40
[42] Efficient GRASP Based Heuristics for the Capacitated Continuous Location-Allocation Problem
Luis, Martino
Ramli, Mohammad Fadzli
Saputra, Ruswiati Surya
INTERNATIONAL CONFERENCE ON MATHEMATICS, ENGINEERING AND INDUSTRIAL APPLICATIONS 2014 (ICOMEIA 2014), 2015, 1660
[43] Two-Layer Location-Routing Problem Based on Heuristic Hybrid Algorithm
Ma, Yinpei
Geng, Liyan
Zhu, Meihong
Mathematical Problems in Engineering, 2023, 2023
[44] Solving the capacitated location-routing problem
Prodhon, Caroline
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2007, 5 (04): : 339 - 342
[45] The capacitated location routing problem: review of literature
Willmer Escobar, John
Linfati, Rodrigo
Adarme Jaimes, Wilson
REVISTA FACULTAD DE INGENIERIA, UNIVERSIDAD PEDAGOGICA Y TECNOLOGICA DE COLOMBIA, 2015, 24 (39): : 85 - 98
[46] A tabu search heuristic for the capacitated arc routing problem
Hertz, A
Laporte, G
Mittaz, M
OPERATIONS RESEARCH, 2000, 48 (01) : 129 - 135
[47] Parallel Version of Local Search Heuristic Algorithm to Solve Capacitated Vehicle Routing Problem
Yelmewad, Pramod
Talawar, Basavaraj
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2021, 24 (04): : 3671 - 3692
[48] An Evolutionary Algorithm with Heuristic Longest Cycle Crossover for Solving the Capacitated Vehicle Routing Problem
Visutarrom, Thammarsat
Chiang, Tsung-Che
2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2019, : 673 - 680
[49] A hybrid adaptive large neighbourhood search algorithm for the capacitated location routing problem
Akpunar, Ozge Satir
Akpinar, Sener
EXPERT SYSTEMS WITH APPLICATIONS, 2021, 168
[50] Capacitated depot location for the vehicle routing problem
Mingozzi, Aristide
Prins, Christian
Wolfier Calvo, Roberto
2006 INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1 AND 2, PROCEEDINGS, 2006, : 1547 - 1551

← 1 2 3 4 5 →