Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem
From MaRDI portal
Publication:2070127
DOI10.1007/S11590-020-01630-YzbMath1483.90138OpenAlexW3081247501MaRDI QIDQ2070127
Angelo Sifaleras, Panagiotis Karakostas, Michael C. Georgiadis
Publication date: 21 January 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-020-01630-y
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
General variable neighborhood search approach to group Steiner tree problem ⋮ A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction
Uses Software
Cites Work
- A review of recent research on green road freight transportation
- A two phase variable neighborhood search for the multi-product inventory routing problem
- Variable neighborhood search for location routing
- Integrated inventory routing and freight consolidation for perishable goods
- Variable neighborhood search: basics and variants
- The green location-routing problem
- A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem
- The role of operational research in green freight transportation
- Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem
- Open problems in green supply chain modeling and optimization with carbon emission targets
- Construction heuristics for the asymmetric TSP.
- Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem
This page was built for publication: Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem
