Journal
OPTIMIZATION LETTERS
Volume 16, Issue 1, Pages 211-235Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s11590-020-01630-y
Keywords
Fuel consumption; Location; Inventory; Routing; Variable neighborhood search
Ask authors/readers for more resources
This work presents efficient solution approaches for the Pollution Location Inventory Routing problem, which considers both economic and environmental issues, using mixed-integer linear programming and General Variable Neighborhood Search-based metaheuristic algorithms.
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 model is proposed and first, small problem instances are solved using the CPLEX solver. Due to its computational complexity, General Variable Neighborhood Search-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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available