An inventory-routing problem with the objective of travel time minimization
From MaRDI portal
Publication:2514745
DOI10.1016/J.EJOR.2013.07.034zbMATH Open1304.90037OpenAlexW1999391019MaRDI QIDQ2514745FDOQ2514745
Authors: Kunpeng Li, Bin Chen, Yong Wu, Appa Iyer Sivakumar 
Publication date: 3 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.07.034
Recommendations
Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- Future paths for integer programming and links to artificial intelligence
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- A simple and effective evolutionary algorithm for the vehicle routing problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Title not available (Why is that?)
- The inventory-routing problem with transshipment
- Decomposing inventory routing problems with approximate value functions
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- A practical solution approach for the cyclic inventory routing problem
- Heuristics for the multi-depot petrol station replenishment problem with time windows
- The integrated production-inventory-distribution-routing problem
- Industrial aspects and literature survey: Combined inventory management and routing
- A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
- Lagrangian duality applied to the vehicle routing problem with time windows
- Solving a rich vehicle routing and inventory problem using column generation
- Analysis of Direct Shipping Policies in an Inventory-Routing Problem with Discrete Shipping Times
- The exact solution of several classes of inventory-routing problems
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- Vehicle routing with compartments: applications, modelling and heuristics
- Delivery strategies for blood products supplies
- A partition approach to the inventory/routing problem
- Model and algorithm for inventory/routing decision in a three-echelon logistics system
- A heuristic for the multi-period petrol station replenishment problem
- On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
- Solving a fuel delivery problem by heuristic and exact approaches.
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- Performance evaluation of distribution strategies for the inventory routing problem
- Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk I: applications and model
- A hybrid heuristic for an inventory routing problem
- A branch-price-and-cut algorithm for single-product maritime inventory routing
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Deterministic Order-Up-To Level Policies in an Inventory Routing Problem
- A Periodic Inventory Routing Problem at a Supermarket Chain
- Shipment planning at oil refineries using column generation and valid inequalities
- Using scenario trees and progressive hedging for stochastic inventory routing problems
- Scenario tree-based heuristics for stochastic inventory-routing problems
- A column-generation based tactical planning method for inventory routing
- Analysis of the maximum level policy in a production-distribution system
- Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts
- Algorithms for the maximum satisfiability problem
- Indexability and index heuristics for a simple class of inventory routing problems
- A solution approach to the inventory routing problem in a three-level distribution system
- Heuristic and exact algorithms for a min-max selective vehicle routing problem
- An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
- Petrol delivery tanker assignment and routing: a case study in Hong Kong
Cited In (6)
- An assign-and-route matheuristic for the time-dependent inventory routing problem
- Modeling and solving a multi-period inventory fulfilling and routing problem for hazardous materials
- A reactive simheuristic using online data for a real‐life inventory routing problem with stochastic demands
- A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands
- A credibilistic goal programming model for inventory routing problem with hazardous materials
- Inventory policy and heuristic for long-term multi-product perishable inventory routing problem with static demand
This page was built for publication: An inventory-routing problem with the objective of travel time minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2514745)
