We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
MÉTODOS DE OPTIMIZACIÓN PARA EL PROBLEMA DE RUTEO DE VEHÍCULOS CON INVENTARIOS Y VENTANAS DE TIEMPO DURAS.
- Authors
Pérez Kaligari, Eliseo; Guerrero Rueda, William Javier
- Abstract
The studied problem considers the inventory routing problem with time windows (IRPTW) in a supply chain that consists of a single warehouse and multiple retailers. The considered planning horizon is discrete and finite, and the decisions to optimize are: the quantities to supply to retailers, and simultaneously the sequence of retailers to visit in each time period. The system has a single vehicle with limited capacity, storage capacity constraints at retailers and a limited production rate at the depot is considered. It is required to meet the retailer's demand. It is assumed that retailers have deterministic demand and not homogeneous. It is proposed a mathematical formulation based on mixed integer programming, and it is studied the impact of the time windows configuration on inventory routing decisions through two optimization methods. The first method optimizes decisions simultaneously, while the second proposed method considers sequential decisions, making it a heuristic method. A computational study with 80 instances adapted from the literature is presented. The results show that the method of simultaneous optimization has outperformed the heuristic optimization method generating potential savings in logistics costs of at least 6%.
- Subjects
VEHICLE routing problem; SUPPLY chain management; SUPPLY chains; INVENTORY control; COMPUTERS in inventory control; VENDOR-managed inventory
- Publication
Revista Ingeniería Industrial, 2015, Vol 14, Issue 3, p31
- ISSN
0717-9103
- Publication type
Article