Please use this identifier to cite or link to this item: https://ruomo.lib.uom.gr/handle/7000/260
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKarakostas, Panagiotis-
dc.contributor.authorSifaleras, Angelo-
dc.contributor.authorGeorgiadis, Michael C.-
dc.contributor.editorSifaleras, Angelo-
dc.contributor.editorSalhi, Said-
dc.contributor.editorBrimberg, Jack-
dc.date.accessioned2019-10-29T10:17:56Z-
dc.date.available2019-10-29T10:17:56Z-
dc.date.issued2019-
dc.identifier10.1007/978-3-030-15843-9_6en_US
dc.identifier.isbn978-3-030-15842-2en_US
dc.identifier.isbn978-3-030-15843-9en_US
dc.identifier.issn0302-9743en_US
dc.identifier.issn1611-3349en_US
dc.identifier.urihttps://doi.org/10.1007/978-3-030-15843-9_6en_US
dc.identifier.urihttps://ruomo.lib.uom.gr/handle/7000/260-
dc.description.abstractThis 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.en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.relation.ispartofseriesLecture Notes in Computer Scienceen_US
dc.subjectFRASCATI::Natural sciences::Mathematics::Applied Mathematicsen_US
dc.subjectFRASCATI::Natural sciences::Computer and information sciencesen_US
dc.subject.otherVariable Neighborhood Searchen_US
dc.subject.otherLocation Inventory Routing Problemen_US
dc.subject.otherGreen logisticsen_US
dc.titleBasic VNS Algorithms for Solving the Pollution Location Inventory Routing Problemen_US
dc.typeBook chapteren_US
dc.contributor.departmentΤμήμα Εφαρμοσμένης Πληροφορικήςen_US
local.identifier.volume11328en_US
local.identifier.firstpage64en_US
local.identifier.lastpage76en_US
local.identifier.volumetitleVariable Neighborhood Searchen_US
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.