Please use this identifier to cite or link to this item: https://ruomo.lib.uom.gr/handle/7000/214
Title: A general variable neighborhood search-based solution approach for the location-inventory-routing problem with distribution outsourcing
Authors: Karakostas, Panagiotis
Sifaleras, Angelo
Georgiadis, Michael C.
Type: Article
Subjects: FRASCATI::Natural sciences::Mathematics::Applied Mathematics
FRASCATI::Natural sciences::Computer and information sciences
Keywords: Logistics Optimization
Metaheuristics
Location
Inventory
Routing
Issue Date: 2019
Publisher: Elsevier
Source: Computers & Chemical Engineering
Volume: 126
First Page: 263
Last Page: 279
Abstract: This work presents a Mixed Integer Programing (MIP) formulation for a new complex NP-hard combinatorial optimization problem, the Location Inventory Routing with Distribution Outsourcing (LIRPDO). Due to its computational complexity, only small problem instances can be solved by exact solvers. Therefore, a General Variable Neighborhood Search (GVNS)-based metaheuristic algorithm for solving large LIRPDO instances is presented. The proposed approach has been tested on 20 new randomly generated LIRPDO instances, 20 existing benchmark LIRP instances from the literature and 30 new large-scale random generated LIRP instances. An extended numerical analysis illustrates the efficiency of the underlying method, leading to acceptable solutions requiring limited computational effort.
URI: https://doi.org/10.1016/j.compchemeng.2019.04.015
https://ruomo.lib.uom.gr/handle/7000/214
ISSN: 00981354
Other Identifiers: 10.1016/j.compchemeng.2019.04.015
Appears in Collections:Department of Applied Informatics

Files in This Item:
File Description SizeFormat 
A_GVNS_based_solution_approach_for_the_LIRP_with_distribution_outsourcing.pdf
  Until 2021-07-12
850,51 kBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.