Please use this identifier to cite or link to this item:
|Title:||Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem|
Georgiadis, Michael C.
|Subjects:||FRASCATI::Natural sciences::Mathematics::Applied Mathematics|
FRASCATI::Natural sciences::Computer and information sciences
|Keywords:||Variable Neighborhood Search|
Vehicle Routing Problem
|Abstract:||This work presents efficient solution approaches for a new complex NP-hard combinatorial optimization problem, the Pollution Location Inventory Routing problem (PLIRP), which considers both economic and environmental issues. A mixed-integer linear programming (MILP) model is proposed and first, small problem instances are solved using the CPLEX solver. Due to its computational complexity, General Variable Neighborhood Search (GVNS)-based metaheuristic algorithms are developed for the solution of medium and large instances. The proposed approaches are tested on 30 new randomly generated PLIRP instances. Parameter estimation has been performed for determining the most suitable perturbation strength. An extended numerical analysis illustrates the effectiveness and efficiency of the underlying methods, leading to high-quality solutions with limited computational effort. Furthermore, the impact of holding cost variations to the total cost is studied.|
|Appears in Collections:||Department of Applied Informatics |
Files in This Item:
|VNS_based_solution_methods_for_the_pollution_location_inventory_routing_problem.pdf||539,42 kB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.