Variable neighborhood search for the Location Routing problem with multiple routes

被引：0

作者：

Macedo, Rita ^{[1
]}

Hanafi, Said ^{[1
]}

Jarboui, Bassem ^{[2
]}

Mladenovic, Nenad ^{[1
]}

Alves, Claudio ^{[3
]}

de Carvalho, J. M. Valerio ^{[3
]}

机构：

[1] Univ Valenciennes & Hainaut Cambresis, Famars, France

[2] Fac Sci Econom & Gest Sfax, Sfax, Tunisia

[3] Univ Minho, P-4719 Braga, Portugal

来源：

PROCEEDINGS OF 2013 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IEEE-IESM 2013) | 2013年

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We address a variant of the Location Routing Problem (LRP) where vehicles can perform several routes in the same planning period and both depots and vehicles have capacities. This problem represents a combination of two NP-hard problems: a vehicle routing problem, which determines the optimal set of routes to fulfill the demands of a set of customers, and a location problem, as the depots from which the vehicles performing the routes can be associated must be chosen from a set of possible locations. We propose a Variable Neighborhood Search (VNS) metaheuristic to solve this problem, and report on preliminary computational experiments conducted on a set of instances from the literature. To the best of our knowledge, this is the first time that a VNS based heuristic is proposed for solving this variant of the LRP.

引用

页码：19 / 24

页数：6

共 50 条

[31] A Variable Neighborhood Search Approach for Solving the Generalized Vehicle Routing Problem
Pop, Petricia C.
Fuksz, Levente
Marc, Andrei Horvat
[J]. HYBRID ARTIFICIAL INTELLIGENCE SYSTEMS, HAIS 2014, 2014, 8480 : 13 - 24
[32] Variable neighborhood search for the inventory routing and scheduling problem in a supply chain
Liu, Shu-Chu
Chen, An-Zuo
[J]. EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (04) : 4149 - 4159
[33] A New Hybrid Genetic Variable Neighborhood Search Heuristic for the Vehicle Routing Problem with Multiple Time Windows
Belhaiza, Slim
M'Hallah, Rym
Ben Brahim, Ghassen
[J]. 2017 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2017, : 1319 - 1326
[34] Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows
Pirkwieser, Sandro
Raidl, Guenther R.
[J]. HYBRID METAHEURISTICS, PROCEEDINGS, 2009, 5818 : 45 - 59
[35] Variable Neighborhood Search Algorithms for a Competitive Location Problem with Elastic Demand
Levanova T.V.
Gnusarev A.Y.
[J]. Levanova, T.V. (levanova@ofim.oscsbras.ru); Gnusarev, A. Yu. (alexander.gnussarev@gmail.com), 1600, Pleiades journals (14): : 693 - 705
[36] A Basic Variable Neighborhood Search for the Planar Obnoxious Facility Location Problem
Salazar, Sergio
Duarte, Abraham
Colmenar, J. Manuel
[J]. METAHEURISTICS, MIC 2024, PT I, 2024, 14753 : 359 - 364
[37] A variable neighborhood search algorithm for the location problem of platoon formation center
Xue, Zhaojie
Peng, Wenxiang
Cui, Haipeng
[J]. FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, 2024, 36 (04) : 1292 - 1323
[38] Sequential and parallel large neighborhood search algorithms for the periodic location routing problem
Hemmelmayr, Vera C.
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 243 (01) : 52 - 60
[39] Adaptive variable neighborhood search solution methods for the fleet size and mix pollution location-inventory-routing problem
Karakostas, Panagiotis
Sifaleras, Angelo
Georgiadis, Michael C.
[J]. EXPERT SYSTEMS WITH APPLICATIONS, 2020, 153
[40] A general variable neighborhood search-based solution approach for the location-inventory-routing problem with distribution outsourcing
Karakostas, Panagiotis
Sifaleras, Angelo
Georgiadis, Michael C.
[J]. COMPUTERS & CHEMICAL ENGINEERING, 2019, 126 : 263 - 279

← 1 2 3 4 5 →