An assign-and-route matheuristic for the time-dependent inventory routing problem
From MaRDI portal
Publication:2116930
DOI10.1016/j.ejor.2021.09.025zbMath1506.90060OpenAlexW3204065391MaRDI QIDQ2116930
Khaled Hadj-Hamou, Anne-Laure Ladier, Faycal A. Touzout
Publication date: 18 March 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.09.025
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)
Related Items (3)
Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem ⋮ Exact and anytime approach for solving the time dependent traveling salesman problem with time windows ⋮ A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows
Cites Work
- Time-dependent routing problems: a review
- An integer programming approach for the time-dependent traveling salesman problem with time windows
- The time-dependent capacitated profitable tour problem with time windows and precedence constraints
- Comparing techniques for modelling uncertainty in a maritime inventory routing problem
- A metaheuristic for the time-dependent pollution-routing problem
- A time-dependent fuzzy programming approach for the green multimodal routing problem with rail service capacity uncertainty and road traffic congestion
- Vehicle dispatching with time-dependent travel times
- Multi-trip time-dependent vehicle routing problem with time windows
- Industrial aspects and literature survey: Combined inventory management and routing
- Reoptimization framework and policy analysis for maritime inventory routing under uncertainty
- Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs
- Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm
- An inventory-routing problem with the objective of travel time minimization
- An integer programming approach for the time-dependent TSP
- An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem
- Inventory routing problems: a logistical overview
- A Time-Dependent No-Overlap Constraint: Application to Urban Delivery Problems
This page was built for publication: An assign-and-route matheuristic for the time-dependent inventory routing problem
