Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem

DOI10.1007/S11590-020-01630-YMaRDI QIDQ2070127zbMATH OpenOpenAlexFDO

Authors Panagiotis Karakostas, Angelo Sifaleras, 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

zbMATH Keywords

locationinventoryroutingvariable neighborhood searchfuel consumption

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Recommendations

• An adaptive large neighborhood search heuristic for the pollution-routing problem
• A variable neighborhood search for the multi-product inventory routing problem
• Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study
• A variable neighborhood search approach for the two-echelon location-routing problem
• A general variable neighbourhood search for the multi-product inventory routing problem
• Using cost change estimates in a local search heuristic for the pollution routing problem
• A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands
• Variable neighborhood search for the stochastic and dynamic vehicle routing problem

Cites work

• A review of recent research on green road freight transportation
• A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem
• A two phase variable neighborhood search for the multi-product inventory routing problem
• Construction heuristics for the asymmetric TSP.
• Integrated inventory routing and freight consolidation for perishable goods
• Open problems in green supply chain modeling and optimization with carbon emission targets
• Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem
• The green location-routing problem
• The role of operational research in green freight transportation
• Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem
• Variable neighborhood search for location routing
• Variable neighborhood search: basics and variants

Cited in

(9)

• Using cost change estimates in a local search heuristic for the pollution routing 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
• The pollution traveling salesman problem with refueling
• Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study
• New mathematical model for the bi-objective inventory routing problem with a step cost function: a multi-objective particle swarm optimization solution approach
• General variable neighborhood search approach to group Steiner tree problem
• A novel two-echelon hierarchical location-allocation-routing optimization for green energy-efficient logistics systems
• An optimization model with a Lagrangian relaxation algorithm for artificial Internet of things-enabled sustainable circular supply chain networks
• Self-adaptive general variable neighborhood search algorithm for parallel machine scheduling with unrelated servers

Describes a project that uses

Uses Software

• GAMS
• CPLEX

This page was built for publication: Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2070127)