Adaptive GVNS Heuristics for Solving the Pollution Location Inventory Routing Problem
- 22 January 2020
- book chapter
- Published by Springer Nature
- p. 157-170
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A general variable neighborhood search-based solution approach for the location-inventory-routing problem with distribution outsourcingComputers & Chemical Engineering, 2019
- Basic VNS Algorithms for Solving the Pollution Location Inventory Routing Problem2019
- Order matters – A Variable Neighborhood Search for the Swap-Body Vehicle Routing ProblemEuropean Journal of Operational Research, 2017
- A hybrid CPU-GPU parallelization scheme of variable neighborhood search for inventory optimization problemsElectronic Notes in Discrete Mathematics, 2017
- Modeling a green inventory routing problem with a heterogeneous fleetTransportation Research Part E: Logistics and Transportation Review, 2017
- Variable neighborhood search: basics and variantsEURO Journal on Computational Optimization, 2016
- A two-level self-adaptive variable neighborhood search algorithm for the prize-collecting vehicle routing problemApplied Soft Computing, 2016
- General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chainElectronic Notes in Discrete Mathematics, 2015
- Search Methodologies2014
- Construction heuristics for the asymmetric TSPEuropean Journal of Operational Research, 2001