scholarly journals Discrete time and continuous time formulations for a short sea inventory routing problem

2016 ◽  
Vol 18 (1) ◽  
pp. 269-297 ◽  
Author(s):  
Agostinho Agra ◽  
Marielle Christiansen ◽  
Alexandrino Delgado
Keyword(s):  
Discrete Time ◽  
Continuous Time ◽  
Inventory Routing ◽  
Routing Problem ◽  
Inventory Routing Problem

The Continuous-Time Inventory-Routing Problem

2020 ◽  
Author(s):  
Felipe Lagos ◽  
Natashia Boland ◽  
Martin Savelsbergh
Keyword(s):  
Continuous Time ◽  
Inventory Routing ◽  
Routing Problem ◽  
Inventory Routing Problem

scholarly journals Integrated Inventory Routing Problem with Quality Time Windows and Loading Cost for Deteriorating Items under Discrete Time

2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Tao Jia ◽  
Xiaofan Li ◽  
Nengmin Wang ◽  
Ran Li
Keyword(s):  
Discrete Time ◽  
Production Scheduling ◽  
Time Window ◽  
Mixed Integer ◽  
Time Interval ◽  
Second Phase ◽  
Inventory Routing ◽  
Routing Problem ◽  
Inventory Routing Problem ◽  
Integrated Inventory

We investigate an integrated inventory routing problem (IRP) in which one supplier with limited production capacity distributes a single item to a set of retailers using homogeneous vehicles. In the objective function we consider a loading cost which is often neglected in previous research. Considering the deterioration in the products, we set a soft time window during the transportation stage and a hard time window during the sales stage, and to prevent jams and waiting cost, the time interval of two successive vehicles returning to the supplier’s facilities is required not to be overly short. Combining all of these factors, a two-echelon supply chain mixed integer programming model under discrete time is proposed, and a two-phase algorithm is developed. The first phase uses tabu search to obtain the retailers’ ordering matrix. The second phase is to generate production scheduling and distribution routing, adopting a saving algorithm and a neighbourhood search, respectively. Computational experiments are conducted to illustrate the effectiveness of the proposed model and algorithm.

scholarly journals A maritime inventory routing problem: Discrete time formulations and valid inequalities

Networks ◽  
2013 ◽  
Vol 62 (4) ◽  
pp. 297-314 ◽  
Author(s):  
Agostinho Agra ◽  
Henrik Andersson ◽  
Marielle Christiansen ◽  
Laurence Wolsey
Keyword(s):  
Discrete Time ◽  
Valid Inequalities ◽  
Inventory Routing ◽  
Routing Problem ◽  
Inventory Routing Problem ◽  
Maritime Inventory Routing

scholarly journals The Inventory Routing Problem with Demand Moves

2021 ◽  
Vol 2 (1) ◽  
Author(s):  
Annelieke C. Baller ◽  
Said Dabia ◽  
Guy Desaulniers ◽  
Wout E. H. Dullaert
Keyword(s):  
Urban Areas ◽  
Research Literature ◽  
Inventory Routing ◽  
Routing Problem ◽  
Inventory Routing Problem ◽  
Solution Approach ◽  
Holding Cost ◽  
Inventory Holding Cost ◽  
Problem Instances ◽  
Inventory Holding

AbstractIn the Inventory Routing Problem, customer demand is satisfied from inventory which is replenished with capacitated vehicles. The objective is to minimize total routing and inventory holding cost over a time horizon. If the customers are located relatively close to each other, one has the opportunity to satisfy the demand of a customer by inventory stored at another nearby customer. In the optimization of the customer replenishments, this option can be included to lower total costs. This is for example the case for ATMs in urban areas where an ATM-user that wants to withdraw money could be redirected to another ATM. To the best of our knowledge, the possibility of redirecting end-users is new to the operations research literature and has not been implemented, but is being considered, in the industry. We formulate the Inventory Routing Problem with Demand Moves in which demand of a customer can (partially) be satisfied by the inventory of a nearby customer at a service cost depending on the quantity and the distance. We propose a branch-price-and-cut solution approach which is evaluated on problem instances from the literature. Cost improvements over the classical IRP of up to 10% are observed with average savings around 3%.

Sign in / Sign up

Export Citation Format

Share Document