Integrated mathematical model based on a heuristic method for loading and routing of vehicles: application in a tobacco company

Jorge Israel Frómeta Moya; Daniel René Tasé Velázquez; Lorena Hernández Mastrapa; Yosvany Orlando Lao León

doi:10.14807/ijmp.v11i6.1209

PDF HTML

Published: Oct 1, 2020

DOI: https://doi.org/10.14807/ijmp.v11i6.1209

Keywords:

Vehicle routing problem Freight-loading problem Heuristic method Goals-based programming Quadratic programming

Jorge Israel Frómeta Moya

University of Oriente (UO)

Daniel René Tasé Velázquez

Methodist University of Piracicaba (UNIMEP)

Lorena Hernández Mastrapa

Methodist University of Piracicaba (UNIMEP)

Yosvany Orlando Lao León

University of Holguín (UHO)

صندلی اداری

Abstract

The vehicle-routing problem (VRP) combined with freight-loading problem is a complex and relatively recent issue studied by the scientific literature. This paper presents the formulation of a mathematical model and a procedure to solve this problem in a Cuban tobacco company aiming to determine the quantity of merchandise to be loaded on vehicles and the best route to be taken. For this purpose, a decomposition’s heuristic method was used and it was integrated with multiobjective programming by-goals and mixed binary quadratic programming. This approach allowed simplifying the problem and offering a satisfactory solution based on the demand fulfillment, the vehicles’ rational use and for searching the local optimums of the traffic load indicator. The model was tested in a case study and its feasibility evaluated based on a real operational situation in a tobacco company. Although the results of the application of the developed model does not imply reaching the optimal solution to the problem studied, it represents an opportunity for company’s performance improvement and it could be adapted and applied to other institutions dedicated to the same activities.

Downloads

Download data is not yet available.

Issue

Vol. 11 No. 6 (2020): Independent Journal of Management & Production

Section

Articles

1. Proposal of Policy for Free Access Periodics

Authors whom publish in this magazine should agree to the following terms:

a. Authors should keep the copyrights and grant to the magazine the right of the first publication, with the work simultaneously permitted under the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 that allows the sharing of the work with recognition of the authorship of the work and initial publication in this magazine.

b. Authors should have authorization for assuming additional contracts separately, for non-exclusive distribution of the version of the work published in this magazine (e.g.: to publish in an institutional repository or as book chapter), with recognition of authorship and initial publication in this magazine.

c. Authors should have permission and should be stimulated to publish and to distribute its work online (e.g.: in institutional repositories or its personal page) to any point before or during the publishing process, since this can generate productive alterations, as well as increasing the impact and the citation of the published work (See The Effect of Free Access).

Proposal of Policy for Periodic that offer Postponed Free Access

Authors whom publish in this magazine should agree to the following terms:

a. Authors should keep the copyrights and grant to the magazine the right of the first publication, with the work simultaneously permitted under the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 [SPECIFY TIME HERE] after the publication, allowing the sharing of the work with recognition of the authorship of the work and initial publication in this magazine.

b. Authors should have authorization for assuming additional contracts separately, for non-exclusive distribution of the version of the work published in this magazine (e.g.: to publish in institutional repository or as book chapter), with recognition of authorship and initial publication in this magazine.

c. Authors should have permission and should be stimulated to publish and to distribute its work online (e.g.: in institutional repositories or its personal page) to any point before or during the publishing process, since this can generate productive alterations, as well as increasing the impact and the citation of the published work (See The Effect of Free Access).

d. They allow some kind of open dissemination. Authors can disseminate their articles in open access, but with specific conditions imposed by the editor that are related to:
   Version of the article that can be deposited in the repository:
   Pre-print: before being reviewed by pairs.
   Post-print: once reviewed by pairs, which can be:
The version of the author that has been accepted for publication.
The editor's version, that is, the article published in the magazine.
   At which point the article can be made accessible in an open manner: before it is published in the magazine, immediately afterwards or if a period of seizure is required, which can range from six months to several years.
Where to leave open: on the author's personal web page, only departmental websites, the repository of the institution, the file of the research funding agency, among others.

Author Biographies

Jorge Israel Frómeta Moya, University of Oriente (UO)

Assistant Professor at University of Oriente (Cuba)

Daniel René Tasé Velázquez, Methodist University of Piracicaba (UNIMEP)

PhD student at the Postgraduation Program in Production Engineering - Methodist University of Piracicaba (UNIMEP)

Lorena Hernández Mastrapa, Methodist University of Piracicaba (UNIMEP)

PhD student at the Postgraduation Program in Production Engineering - Methodist University of Piracicaba (UNIMEP)

Yosvany Orlando Lao León, University of Holguín (UHO)

Auxiliary Professor of University of Holguín (UHO)

References

ADAMS, W.; WADDELL, L. (2014) Linear programming insights into solvable cases of the quadratic assignment problem. Discrete Optimization, v. 14, p. 46-60. http://doi.org/10.1016/j.disopt.2014.07.001

AQUINO, W. J. S. (1980) Uma abordagem do problema de definição de rede interurbana de rotas de ônibus. Dissertação em opção ao título de mestre em Engenharia de Produção. Coordenação do Programa de Pós-Graduação de Engenharia. Universidade Federal do Rio de Janeiro, Rio de Janeiro, Outubro, p.1-88.

BORTFELDT, A.; WÄSCHER, G. (2013) Constraints in container loading–A state-of-the-art review. European Journal of Operational Research, v. 229, n. 1, p. 1-20. http://doi.org/10.1016/j.ejor.2012.12.006

BURKARD, R.; DELL'AMICO, M.; MARTELLO, S. (2012|) Assignment problems (Revised reprint). SIAM - Society of Industrial and Applied Mathematics, 393 p., ISBN 978-1-611972-22-1.

CHOKANAT, P.; PITAKASO, R.; SETHANAN, K. (2019) Methodology to Solve a Special Case of the Vehicle Routing Problem: A Case Study in the Raw Milk Transportation System. AgriEngineering, v. 1, n. 1, p. 75-93. http://doi.org/10.3390/agriengineering1010006

CHOWMALI, W.; SUKTO, S. (2020) A novel two-phase approach for solving the multi-compartment vehicle routing problem with a heterogeneous fleet of vehicles: a case study on fuel delivery. Decision Science Letters, v. 9, n. 1, p. 77–90. http://doi.org/10.5267/j.dsl.2019.7.003

CORSTJENS, J.; DEPAIRE, B.; CARIS, A.; SORENSEN, K. (2019) A multilevel evaluation method for heuristics with an application to the VRPTW. International Transactions in Operational Research, v. 27, p. 168–196. http://doi.org/10.1111/itor.12631

DANTZIG, G. B.; FULKERSON, D. R.; JOHNSON, S. M. (1954) Solution of a Large-Scale Traveling Salesman Problem. Operations Research, n. 2, p. 393–410. http://doi.org/10.1287/opre.2.4.393

DELGADO, J. A. C.; AVALOS, L. C. M.; DELGADO, E. R.; PUYCÁN, L. A. L. (2015) Optimización de programas matemáticos con programación dinámica. Revista Ciencia & Desarrollo, n. 19, p. 77-83. http://doi.org/10.33326/26176033.2015.19.491

DUHAMEL, C.; LACOMME, P.; QUILLIOT, A.; TOUSSAINT, H. (2010) A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem. Computers & Operations Research, v. 38, n. 3, p. 617-640. http://doi.org/10.1016/j.cor.2010.08.017

FUELLERER, G.; DOERNER, K. F.; HARTL, R. F.; IORI, M. (2009) Ant colony optimization for the two-dimensional loading vehicle routing problem. Computers & Operations Research, v. 36, n. 3, p. 655-673. http://doi.org/10.1016/j.cor.2007.10.021

HILLIER, F. S.; LIEBERMAN, G. J. (2004) Introduction to Operations Research. Ed. 8, McGraw-Hill, p. 1088. ISBN 0-07-252744-7

IORI, M.; MARTELLO, S. (2016) An annotated bibliography of combined routing and loading problems. Yugoslav Journal of Operations Research, v. 23, n. 3, p. 311-326. http://doi.org/10.2298/YJOR130315032I

LAURENT, M.; SEMINAROTI, M. (2015) The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure. Operations Research Letters, v. 43, n. 1, p. 103-109. http://doi.org/10.1016/j.orl.2014.12.009

LÜER, A.; BENAVENTE, M.; BUSTOS, J.; VENEGAS, B. (2009) El problema de rutas de vehículos: extensiones y métodos de resolución, estado del arte. Proceedings of 3er Encuentro de Informática y Gestión (EIG 2009), Universidad de la Frontera, Temuco, Chile. Available at: http://www.semanticscholar.org/paper/El-Problema-de-Rutas-de-Veh%C3%ADculos%3A-Extensiones-y-de-L%C3%BCer-Benavente/e47e71d4f7470d69dd987190286cfd48eeabae61

MASTRAPA, L. H. (2017) Melhorias em um método heurístico para a solução do Problema de Desenho de Rede de Transporte Público Urbano. Dissertação de Mestrado-Departamento de Engenharia Industrial. Pontifícia Universidade Católica do Rio de Janeiro, Rio de Janeiro, Agosto, p. 1-114. https://doi.org/10.17771/PUCRio.acad.31654

MASTRAPA, L. H.; LEAL, J. E.; ASSUMPÇÃO, M. R. P. (2018b) Melhorias em um método heurístico para a solução do problema de desenho de rede de transporte público urbano. In: XXXVIII Encontro Nacional de Engenharia de Produção ENEGEP 2018, Maceió, Alagoas, Brasil. Available at: http://www.abepro.org.br/biblioteca/TN_WPG_263_509_36318.pdf

MASTRAPA, L. H.; VELÁZQUEZ, D. R. T.; OLIVEIRA, E. D.; GENNARO, C. K.; BELEM, M. J. X. (2018a) Análise dos modelos matemáticos para o transporte de ajuda humanitária em situações de desastres. In: VIII Congresso Brasileiro de Engenharia de Produção CONBREPRO 2018, Ponta Grossa, Paraná, Brasil. Available at: http://aprepro.org.br/conbrepro/2018/anais.php

MEDINA, L. B. R.; LA ROTTA, E. C. G.; CASTRO, J. A. O. (2011) Una revisión al estado del arte del problema de ruteo de vehículos: Evolución histórica y métodos de solución. Ingeniería, v. 16, n. 2, p. 35-55. Available at: http://dialnet.unirioja.es/servlet/articulo?codigo=4797255

NGUYEN, B.; MORELL, C.; DE BAETS, B. (2016) Un método eficiente para resolver un problema de programación cuadrática derivado del aprendizaje de funciones de distancia. Investigación Operacional, v. 37, n. 2, p. 124-136. Available at: http://go.gale.com/ps/anonymous?id=GALE%7CA458262039&sid=googleScholar&v=2.1&it=r&linkaccess=abs&issn=02574306&p=AONE&sw=w

ONEI - Oficina Nacional de Estadística e Información (2015) Anuario Estadístico de Cuba. La Habana, Cuba, Edición 2016.

ORTIZ-TRIANA, V. K.; CAICEDO-ROLÓN, Á. J. (2014) Programación óptima de la producción en una pequeña empresa de calzado - en Colombia. Ingeniería Industrial, v. 35, n. 2, p. 114-130. Available at: http://scielo.sld.cu/scielo.php?script=sci_arttext&pid=S1815-59362014000200002

PACE, S.; TURKY, A.; MOSER, I.; ALETI, A. (2015) Distributing fibre boards: a practical application of the heterogeneous fleet vehicle routing problem with time windows and three-dimensional loading constraints. Procedia Computer Science, v. 51, p. 2257-2266. http://doi.org/10.1016/j.procs.2015.05.382

PIQUERAS, V. Y. (2002) Optimización heurística económica aplicada a las redes de transporte del tipo VRPTW. [Doctoral Thesis, p. 351], Universidad Politécnica de Valencia, 2002. http://doi.org/10.4995/Thesis/10251/2664

SMITI, M.; DHIAF, M. M.; JARBOUI, B.; HANAFI, S. (2020). Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem. International Transactions in Operational Research, n. 27, p. 651–664. http://doi.org/10.1111/itor.12513

TARANTILIS, C. D.; ZACHARIADIS, E. E.; KIRANOUDIS, C. T. (2009) A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem. IEEE Transactions on Intelligent Transportation Systems, v. 10, n. 2, p. 255-271. http://doi.org/10.1109/TITS.2009.2020187

TELFAR, G. (1994) Generally Applicable Heuristics for Global Optimization: An Investigation of Algorithm Performance for the Euclidean Traveling Salesman Problem. Reading paper - Master of Science in Statistics and Operations Research, p. 150, Victoria University of Wellington.

WICHAPA, N.; KHOKHAJAIKIAT, P. (2018) Solving a multi-objective location routing problem for infectious waste disposal using hybrid goal programming and hybrid genetic algorithm. International Journal of Industrial Engineering Computations, v. 9, n. 1, p. 75-98. http://doi.org/10.5267/j.ijiec.2017.4.003

Article Sidebar

Main Article Content