Please use this identifier to cite or link to this item:
Title: Basic VNS Algorithms for Solving the Pollution Location Inventory Routing Problem
Authors: Karakostas, Panagiotis
Sifaleras, Angelo
Georgiadis, Michael C.
Editors: Sifaleras, Angelo
Salhi, Said
Brimberg, Jack
Type: Book chapter
Subjects: FRASCATI::Natural sciences::Mathematics::Applied Mathematics
FRASCATI::Natural sciences::Computer and information sciences
Keywords: Variable Neighborhood Search
Location Inventory Routing Problem
Green logistics
Issue Date: 2019
Publisher: Springer
Volume: 11328
First Page: 64
Last Page: 76
Volume Title: Variable Neighborhood Search
Part of Series: Lecture Notes in Computer Science
Part of Series: Lecture Notes in Computer Science
Abstract: This work presents a new variant of the Location Inventory Routing Problem (LIRP), called Pollution LIRP (PLIRP). The PLIRP considers both economic and environmental impacts. A Mixed Integer Programming (MIP) formulation is employed and experimental results on ten randomly generated small-sized instances using CPLEX are reported. Furthermore, it is shown that, CPLEX could not compute any feasible solution on another set of ten randomly generated medium-sized instances, with a time limit of five hours. Therefore, for solving more computationally challenging instances, two Basic Variable Neighborhood Search (BVNS) metaheuristic approaches are proposed. A comparative analysis between CPLEX and BVNS on these 20 problem instances is reported.
ISBN: 978-3-030-15842-2
ISSN: 0302-9743
Other Identifiers: 10.1007/978-3-030-15843-9_6
Appears in Collections:Department of Applied Informatics

Files in This Item:
File Description SizeFormat 
Basic_VNS_algorithms_for_solving_the_Pollution_Location_Inventory_Routing_Problem.pdf263,46 kBAdobe PDFView/Open

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