An assign-and-route matheuristic for the time-dependent inventory routing problem
From MaRDI portal
(Redirected from Publication:2116930)
Recommendations
- An improved formulation for the inventory routing problem with time-varying demands
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Time dependent vehicle routing problem with a multi ant colony system
- An exact solution approach for the inventory routing problem with time windows
- scientific article; zbMATH DE number 6129109
Cites work
- 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
- A time-dependent no-overlap constraint: application to urban delivery problems
- An efficient two-phase metaheuristic algorithm for the time dependent traveling salesman problem
- An integer programming approach for the time-dependent TSP
- An integer programming approach for the time-dependent traveling salesman problem with time windows
- An inventory-routing problem with the objective of travel time minimization
- Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs
- Comparing techniques for modelling uncertainty in a maritime inventory routing problem
- Industrial aspects and literature survey: Combined inventory management and routing
- Inventory routing problems: a logistical overview
- Multi-trip time-dependent vehicle routing problem with time windows
- Reoptimization framework and policy analysis for maritime inventory routing under uncertainty
- The time-dependent capacitated profitable tour problem with time windows and precedence constraints
- Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm
- Time-dependent routing problems: a review
- Vehicle dispatching with time-dependent travel times
Cited in
(5)- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
- Integrated inventory routing problem with quality time windows and loading cost for deteriorating items under discrete time
- A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
- Nested column generation for split pickup vehicle routing problem with time windows and time-dependent demand
This page was built for publication: An assign-and-route matheuristic for the time-dependent inventory routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2116930)