Repositorio Institucional
Repositorio Institucional
CONICET Digital
  • Inicio
  • EXPLORAR
    • AUTORES
    • DISCIPLINAS
    • COMUNIDADES
  • Estadísticas
  • Novedades
    • Noticias
    • Boletines
  • Ayuda
    • General
    • Datos de investigación
  • Acerca de
    • CONICET Digital
    • Equipo
    • Red Federal
  • Contacto
JavaScript is disabled for your browser. Some features of this site may not work without it.
  • INFORMACIÓN GENERAL
  • RESUMEN
  • ESTADISTICAS
 
Artículo

Managing Distribution in Supply Chain Networks

Dondo, Rodolfo GabrielIcon ; Mendez, Carlos AlbertoIcon ; Cerda, JaimeIcon
Fecha de publicación: 12/2009
Editorial: American Chemical Society
Revista: Industrial & Engineering Chemical Research
ISSN: 0888-5885
Idioma: Inglés
Tipo de recurso: Artículo publicado
Clasificación temática:
Ingeniería Química

Resumen

This paper presents a novel optimization approach to the short-term operational planning of multiechelon multiproduct transportation networks. Distribution activities commonly arising in real-world chemical supply chains involve the shipping of a number of commodities from factories to customers directly and/or via distribution centers and regional warehouses. To optimally manage such complex distribution systems, a more general vehicle routing problem in supply chain management (VRP-SCM) has been defined. The new VRP-SCM problem better resembles the logistics activities to be planned at multisite manufacturing firms by allowing multiple events at every location. In this way, two or more vehicles can visit a given location to perform pickup and/or delivery operations, and vehicle routes may include several stops at the same site, i.e., multiple tours per route. More important, the allocation of customers to suppliers and the quantities of products shipped from each source to a particular client are additional model decisions. Both the capacitated vehicle routing problem (VRP) and the pickup-and-delivery problem (PDP) can be regarded as particular instances of the new VRP-SCM. The proposed MILP mathematical formulation for the VRP-SCM problem relies on a continuous-time representation and applies the general precedence notion to model the sequencing constraints establishing the ordering of vehicle stops on every route. The approach provides a very detailed set of optimal vehicle routes and schedules to meet all product demands at minimum total transportation cost. Several examples involving up to 26 locations, four products, and six vehicles housed in four different depots have been solved to optimality in very short CPU times.
Palabras clave: Supply Chain Networks , Distribution Operations , Vehicle Routing Problems , Routing And Scheduling , Mathematical Model
Ver el registro completo
 
Archivos asociados
Thumbnail
 
Tamaño: 1.483Mb
Formato: PDF
.
Descargar
Licencia
info:eu-repo/semantics/openAccess Excepto donde se diga explícitamente, este item se publica bajo la siguiente descripción: Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Unported (CC BY-NC-SA 2.5)
Identificadores
URI: http://hdl.handle.net/11336/22347
URL: http://pubs.acs.org/doi/abs/10.1021/ie900792s
DOI: http://dx.doi.org/10.1021/ie900792s
Colecciones
Articulos(INTEC)
Articulos de INST.DE DES.TECNOL.PARA LA IND.QUIMICA (I)
Citación
Dondo, Rodolfo Gabriel; Mendez, Carlos Alberto; Cerda, Jaime; Managing Distribution in Supply Chain Networks; American Chemical Society; Industrial & Engineering Chemical Research; 48; 22; 12-2009; 9961-9978
Compartir
Altmétricas
 

Enviar por e-mail
Separar cada destinatario (hasta 5) con punto y coma.
  • Facebook
  • X Conicet Digital
  • Instagram
  • YouTube
  • Sound Cloud
  • LinkedIn

Los contenidos del CONICET están licenciados bajo Creative Commons Reconocimiento 2.5 Argentina License

https://www.conicet.gov.ar/ - CONICET

Inicio

Explorar

  • Autores
  • Disciplinas
  • Comunidades

Estadísticas

Novedades

  • Noticias
  • Boletines

Ayuda

Acerca de

  • CONICET Digital
  • Equipo
  • Red Federal

Contacto

Godoy Cruz 2290 (C1425FQB) CABA – República Argentina – Tel: +5411 4899-5400 repositorio@conicet.gov.ar
TÉRMINOS Y CONDICIONES