Please use this identifier to cite or link to this item:
|Title:||A general variable neighborhood search-based solution approach for the location-inventory-routing problem with distribution outsourcing|
Georgiadis, Michael C.
|Subjects:||FRASCATI::Natural sciences::Mathematics::Applied Mathematics|
FRASCATI::Natural sciences::Computer and information sciences
|Source:||Computers & Chemical Engineering|
|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.|
|Appears in Collections:||Department of Applied Informatics |
Files in This Item:
|850,51 kB||Adobe PDF||View/Open Request a copy|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.