dor_id: 45485

506.#.#.a: Público

590.#.#.d: Los artículos enviados a la revista "Journal of Applied Research and Technology", se juzgan por medio de un proceso de revisión por pares

510.0.#.a: Scopus, Directory of Open Access Journals (DOAJ); Sistema Regional de Información en Línea para Revistas Científicas de América Latina, el Caribe, España y Portugal (Latindex); Indice de Revistas Latinoamericanas en Ciencias (Periódica); La Red de Revistas Científicas de América Latina y el Caribe, España y Portugal (Redalyc); Consejo Nacional de Ciencia y Tecnología (CONACyT); Google Scholar Citation

561.#.#.u: https://www.icat.unam.mx/

650.#.4.x: Ingenierías

336.#.#.b: article

336.#.#.3: Artículo de Investigación

336.#.#.a: Artículo

351.#.#.6: https://jart.icat.unam.mx/index.php/jart

351.#.#.b: Journal of Applied Research and Technology

351.#.#.a: Artículos

harvesting_group: RevistasUNAM

270.1.#.p: Revistas UNAM. Dirección General de Publicaciones y Fomento Editorial, UNAM en revistas@unam.mx

590.#.#.c: Open Journal Systems (OJS)

270.#.#.d: MX

270.1.#.d: México

590.#.#.b: Concentrador

883.#.#.u: https://revistas.unam.mx/catalogo/

883.#.#.a: Revistas UNAM

590.#.#.a: Coordinación de Difusión Cultural

883.#.#.1: https://www.publicaciones.unam.mx/

883.#.#.q: Dirección General de Publicaciones y Fomento Editorial

850.#.#.a: Universidad Nacional Autónoma de México

856.4.0.u: https://jart.icat.unam.mx/index.php/jart/article/view/555/551

100.1.#.a: Elizondo Cortés, M.; Aceves García, R.

524.#.#.a: Elizondo Cortés, M., et al. (2005). STRATEGY OF SOLUTION FOR THE INVENTORY ROUTING PROBLEM BASED ON SEPARABLE CROSS DECOMPOSITION. Journal of Applied Research and Technology; Vol. 3 Núm. 02. Recuperado de https://repositorio.unam.mx/contenidos/45485

245.1.0.a: STRATEGY OF SOLUTION FOR THE INVENTORY ROUTING PROBLEM BASED ON SEPARABLE CROSS DECOMPOSITION

502.#.#.c: Universidad Nacional Autónoma de México

561.1.#.a: Instituto de Ciencias Aplicadas y Tecnología, UNAM

264.#.0.c: 2005

264.#.1.c: 2005-08-01

653.#.#.a: Inventory; Routing; Cross Decomposition

506.1.#.a: La titularidad de los derechos patrimoniales de esta obra pertenece a las instituciones editoras. Su uso se rige por una licencia Creative Commons BY-NC-SA 4.0 Internacional, https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode.es, para un uso diferente consultar al responsable jurídico del repositorio por medio del correo electrónico gabriel.ascanio@icat.unam.mx

884.#.#.k: https://jart.icat.unam.mx/index.php/jart/article/view/555

001.#.#.#: 074.oai:ojs2.localhost:article/555

041.#.7.h: eng

520.3.#.a: The Inventory-Routing Problem (IRP) involves a central warehouse, a fleet of trucks wlth finlte capacity, a set of customers, and a known storage capacity. The objective is to determine when to serve each customer, as well as what route each truck should take, with the lowest expense. IRP is a NP-hard problem, this means that searching for solutions can take a very long time. A three-phase strategy is used to solve the problem. This strategy is constructedn by answering the key questions Which customers should be attended in a planned period? What volume of n products should be delivered to each customer? And, which route should be followed by each truck? The second phase uses Cross Separable Decomposition to solve an Allocation Problem, in order to answer questions two and three, solving a location problem. The result is a very efficient ranking algorithm O(n3) for large cases of the lRP.

773.1.#.t: Journal of Applied Research and Technology; Vol. 3 Núm. 02

773.1.#.o: https://jart.icat.unam.mx/index.php/jart

022.#.#.a: ISSN electrónico: 2448-6736; ISSN: 1665-6423

310.#.#.a: Bimestral

264.#.1.b: Instituto de Ciencias Aplicadas y Tecnología, UNAM

doi: https://doi.org/10.22201/icat.16656423.2005.3.02.555

harvesting_date: 2023-11-08 13:10:00.0

856.#.0.q: application/pdf

last_modified: 2024-03-19 14:00:00

license_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode.es

license_type: by-nc-sa

_deleted_conflicts: 2-82f35fd0ca98d65a60faf832ead9e4ce

No entro en nada

No entro en nada 2

Artículo

STRATEGY OF SOLUTION FOR THE INVENTORY ROUTING PROBLEM BASED ON SEPARABLE CROSS DECOMPOSITION

Elizondo Cortés, M.; Aceves García, R.

Instituto de Ciencias Aplicadas y Tecnología, UNAM, publicado en Journal of Applied Research and Technology, y cosechado de Revistas UNAM

Licencia de uso

Procedencia del contenido

Cita

Elizondo Cortés, M., et al. (2005). STRATEGY OF SOLUTION FOR THE INVENTORY ROUTING PROBLEM BASED ON SEPARABLE CROSS DECOMPOSITION. Journal of Applied Research and Technology; Vol. 3 Núm. 02. Recuperado de https://repositorio.unam.mx/contenidos/45485

Descripción del recurso

Autor(es)
Elizondo Cortés, M.; Aceves García, R.
Tipo
Artículo de Investigación
Área del conocimiento
Ingenierías
Título
STRATEGY OF SOLUTION FOR THE INVENTORY ROUTING PROBLEM BASED ON SEPARABLE CROSS DECOMPOSITION
Fecha
2005-08-01
Resumen
The Inventory-Routing Problem (IRP) involves a central warehouse, a fleet of trucks wlth finlte capacity, a set of customers, and a known storage capacity. The objective is to determine when to serve each customer, as well as what route each truck should take, with the lowest expense. IRP is a NP-hard problem, this means that searching for solutions can take a very long time. A three-phase strategy is used to solve the problem. This strategy is constructedn by answering the key questions Which customers should be attended in a planned period? What volume of n products should be delivered to each customer? And, which route should be followed by each truck? The second phase uses Cross Separable Decomposition to solve an Allocation Problem, in order to answer questions two and three, solving a location problem. The result is a very efficient ranking algorithm O(n3) for large cases of the lRP.
Tema
Inventory; Routing; Cross Decomposition
Idioma
eng
ISSN
ISSN electrónico: 2448-6736; ISSN: 1665-6423

Enlaces