scholarly journals The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains

2017 ◽  
Vol 183 ◽  
pp. 570-582 ◽  
Author(s):  
Galina Iassinovskaia ◽  
Sabine Limbourg ◽  
Fouad Riane
Keyword(s):  
Supply Chains ◽  
Closed Loop ◽  
Time Windows ◽  
Pickup And Delivery ◽  
Inventory Routing ◽  
Routing Problem ◽  
Inventory Routing Problem ◽  
Closed Loop Supply Chains ◽  
Simultaneous Pickup And Delivery

scholarly journals Maritime inventory routing problem with multiple time windows

2017 ◽  
Vol 13 (5) ◽  
pp. 1-27
Author(s):  
Nurhadi Siswanto ◽  
◽  
Stefanus Eko Wiratno ◽  
Ahmad Rusdiansyah ◽  
Ruhul Sarker ◽  
...  
Keyword(s):  
Time Windows ◽  
Multiple Time ◽  
Inventory Routing ◽  
Routing Problem ◽  
Inventory Routing Problem ◽  
Multiple Time Windows ◽  
Maritime Inventory Routing

A column generation approach for an inventory routing problem with fuzzy time windows

2020 ◽  
Author(s):  
Amir Saeed Nikkhah Qamsari ◽  
Seyyed-Mahdi Hosseini-Motlagh ◽  
Seyed Farid Ghannadpour
Keyword(s):  
Column Generation ◽  
Time Windows ◽  
Inventory Routing ◽  
Routing Problem ◽  
Inventory Routing Problem

An augmented Tabu search algorithm for the green inventory-routing problem with time windows

2021 ◽  
Vol 60 ◽  
pp. 100802
Author(s):  
Mahdi Alinaghian ◽  
Erfan Babaee Tirkolaee ◽  
Zahra Kaviani Dezaki ◽  
Seyed Reza Hejazi ◽  
Weiping Ding
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Time Windows ◽  
Tabu Search Algorithm ◽  
Inventory Routing ◽  
Routing Problem ◽  
Inventory Routing Problem

Multi-Product Inventory-Routing Problem in the Supermarket Distribution Industry

2015 ◽  
Vol 11 (6) ◽  
pp. 747-766 ◽  
Author(s):  
Demetrio Laganà ◽  
Francesco Longo ◽  
Francesco Santoro
Keyword(s):  
Time Horizon ◽  
Soft Drink ◽  
Time Windows ◽  
Second Phase ◽  
Inventory Routing ◽  
Inventory Policies ◽  
Routing Problem ◽  
Delivery Strategy ◽  
Inventory Routing Problem ◽  
Varying Demand

Abstract The Inventory Routing Problem (IRP) is an integrated logistic problem arising in several industries (e.g. petrochemical, grocery, soft drink and automotive). A vendor decides the optimal delivery strategy for a set of customers, taking into account their inventory policies and avoiding product stock-out in a finite and discrete time horizon. Delivery strategy includes the time and size of deliveries in order to minimize the total delivery cost. Most commonly studied are IRP real cases where a single homogeneous product with deterministic but time-varying demand is delivered over a finite time horizon. This paper is focused on an efficient methodology for industrial problems where a vendor resupplies a set of customers of heterogeneous products (as in the supermarket distribution industry). In this context, the paper reports on an effort facing the inventory routing problem for multi-category products per customer in conjunction with different inventory policies per category. The paper is motivated by real applications arising in the food engineering field. For instance, industries dealing with food’s distribution to stores located in a given geographic area. The planning strategy is formulated as a linear model. The core of the decision problem consists in determining both the delivery route and the corresponding day of activation along the time horizon. A decomposition of the problem into two phases has been proposed. A suitable penalty cost modeled by simulating the possibility of having an early or delayed product delivery on the delivery day returned from the inventory model (e.g. Economic Order Quantity) is the key feature of the first phase. In the second phase, deliveries are scheduled on a daily basis by taking into account the time windows associated to each customer. This is accomplished by using a constructive heuristic algorithm for the vehicle routing problem with time windows. Computational results on some realistic instances are presented and discussed.

scholarly journals DESIGN OF WASTE VEGETABLE OIL COLLECTION NETWORKS APPLYING VEHICLE ROUTING PROBLEM AND SIMULTANEOUS PICKUP AND DELIVERY

2020 ◽  
Vol 7 (4) ◽  
pp. 261-268
Author(s):  
Lisandra Quintana ◽  
Yalexa Herrera-Mena ◽  
José-Luis Martínez-Flores ◽  
Marcos Coronado ◽  
Gisela Montero ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Vegetable Oil ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Capacity Utilization ◽  
Pickup And Delivery ◽  
Routing Problem ◽  
Time Restrictions ◽  
Waste Vegetable Oil ◽  
Simultaneous Pickup And Delivery

The growth of industrialization in Mexico has caused an increase in the demand for materials to satisfy the consumption of goods and services of a growing population. Given this scenario, there is a rise of the residual generation with affectations on the ecosystem and population health. Hence, the objective of this research was to design a network for waste vegetable oil collection based on vehicle routing problem with simultaneous pickup and delivery, starting from a distribution centre to 49 restaurants, as the generation sources of waste vegetable oil. The Vehicle Routing Problem Simultaneous Pickup and Delivery with Time Windows was the variant used as a vehicle routing method to solve the problem. The free software VPRPD was the tool used to solve the vehicle routing problem with simultaneous pickup and delivery that allowed to specify time restrictions. This software uses the simulated annealing metaheuristics in its syntax. As a result, it was obtained a total of 8 networks, for a vehicle capacity utilization of 70 percent in the 6 t vehicle and 46 percent in the 8 t vehicle.

Sign in / Sign up

Export Citation Format

Share Document