A genetic algorithm for solving the inventory routing problem with time windows

DOI10.1007/978-3-030-71115-3_20zbMath1500.90005OpenAlexW3168115897MaRDI QIDQ2086696

Julian Andres Zapata-Cortes, Hermenegildo Gil-Gómez, Conrado Augusto Serna-Úran, Martin Darío Arango-Serna

Publication date: 25 October 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-71115-3_20

zbMATH Keywords

transportationgenetic algorithminventory routing probleminventory allocationlogistics costs

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Cites Work

• A maritime inventory routing problem: practical approach
• The exact solution of several classes of inventory-routing problems
• Tri-level decision-making for decentralized vendor-managed inventory
• Flexible solutions to maritime inventory routing problems with delivery time windows
• Integrated inventory routing problem with quality time windows and loading cost for deteriorating items under discrete time
• Vendor managed inventory contracts -- coordinating the supply chain while looking from the vendor's perspective
• Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
• Genetic algorithms for modelling and optimisation
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Formulations for an inventory routing problem
• Robust Inventory Ship Routing by Column Generation

This page was built for publication: A genetic algorithm for solving the inventory routing problem with time windows