{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:18:59Z","timestamp":1761293939399,"version":"build-2065373602"},"reference-count":31,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T00:00:00Z","timestamp":1558742400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>This paper investigates a real-world distribution problem arising in the vehicle production industry, particularly in a logistics company, in which cars and vans must be loaded on auto-carriers and then delivered to dealerships. A solution to the problem involves the loading and optimal routing, without violating the capacity and time window constraints for each auto-carrier. A two-phase heuristic algorithm was implemented to solve the problem. In the first phase the heuristic builds a route with an optimal insertion procedure, and in the second phase the determination of a feasible loading. The experimental results show that the purposed algorithm can be used to tackle the transportation problem in terms of minimizing total traveling distance, loading\/unloading operations and transportation costs, facilitating a decision-making process for the logistics company.<\/jats:p>","DOI":"10.3390\/a12050111","type":"journal-article","created":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T23:07:27Z","timestamp":1558912047000},"page":"111","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Heuristic Algorithm for the Routing and Scheduling Problem with Time Windows: A Case Study of the Automotive Industry in Mexico"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4819-1478","authenticated-orcid":false,"given":"Marco Antonio","family":"Ju\u00e1rez P\u00e9rez","sequence":"first","affiliation":[{"name":"Tecnol\u00f3gico Nacional de M\u00e9xico, Instituto Tecnol\u00f3gico de Apizaco, Apizaco 90300, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6500-258X","authenticated-orcid":false,"given":"Rodolfo Eleazar","family":"P\u00e9rez Loaiza","sequence":"additional","affiliation":[{"name":"Tecnol\u00f3gico Nacional de M\u00e9xico, Instituto Tecnol\u00f3gico de Apizaco, Apizaco 90300, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Perfecto Malaquias","family":"Quintero Flores","sequence":"additional","affiliation":[{"name":"Tecnol\u00f3gico Nacional de M\u00e9xico, Instituto Tecnol\u00f3gico de Apizaco, Apizaco 90300, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar","family":"Atriano Ponce","sequence":"additional","affiliation":[{"name":"Smartsoft America BA, Chiautempan 90802, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carolina","family":"Flores Peralta","sequence":"additional","affiliation":[{"name":"Tecnol\u00f3gico Nacional de M\u00e9xico, Instituto Tecnol\u00f3gico de Apizaco, Apizaco 90300, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,5,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.cie.2019.01.028","article-title":"An exact formulation for the multi-period auto-carrier loading and transportation problem in Brazil","volume":"129","author":"Bonassa","year":"2019","journal-title":"Comput. Ind. Eng."},{"key":"ref_2","unstructured":"Asociaci\u00f3n Mexicana de la Industria Automotriz (2018). AMIA-BOLETIN DE PRENSA\/HISTORICO\/BOLETIN HISTORICO\/2005 2018, AMIA. Available online: http:\/\/www.amia.com.mx\/descargarb.html."},{"key":"ref_3","unstructured":"Secretar\u00eda de Comunicaciones y Transportes (2017). PROYECTO de Norma Oficial Mexicana PROY-NOM-012-SCT-2-2017, DOF\u2014Diario Oficial de la Federaci\u00f3n\/SCT. Available online: https:\/\/www.dof.gob.mx\/nota_detalle.php?codigo=5508944&fecha=26\/12\/2017."},{"key":"ref_4","unstructured":"Ghiani, G., Laporte, G., and Musmanno, R. (2004). Introduction to Logistics Systems Planning and Control, John Wiley & Sons Ltd. Online Edition."},{"key":"ref_5","first-page":"393","article-title":"Solution of a large-scale traveling-salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"J. Op. Res. Soc. Am."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/j.asoc.2019.04.006","article-title":"Bio-inspired voice evaluation mechanism","volume":"80","year":"2019","journal-title":"Appl. Soft Comput."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Arnau, Q., Juan, A.A., and Serra, I. (2018). On the Use of Learnheuristics in Vehicle Routing Optimization Problems with Dynamic Inputs. Algorithms, 11.","DOI":"10.3390\/a11120208"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Cassettari, L., Demartini, M., Mosca, R., Revetria, R., and Tonelli, F. (2018). A Multi-Stage Algorithm for a Capacitated Vehicle Routing Problem with Time Constraints. Algorithms, 11.","DOI":"10.3390\/a11050069"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Zhao, M., and Lu, Y. (2019). A Heuristic Approach for a Real-World Electric Vehicle Routing Problem. Algorithms, 12.","DOI":"10.3390\/a12020045"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Stodola, P. (2018). Using Metaheuristics on the Multi-Depot Vehicle Routing Problem with Modified Optimization Criterion. Algorithms, 11.","DOI":"10.3390\/a11050074"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Po\u0142ap, D., and Wo\u017aniak, M. (2017). Polar Bear Optimization Algorithm: Meta-Heuristic with Fast Population Movement and Dynamic Birth and Death Mechanism. Symmetry, 9.","DOI":"10.3390\/sym9100203"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Chen, S., Chen, R., and Gao, J. (2017). A Monarch Butterfly Optimization for the Dynamic Vehicle Routing Problem. Algorithms, 10.","DOI":"10.3390\/a10030107"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Ahmed, A.K.M.F., and Sun, J.U. (2018). Bilayer Local Search Enhanced Particle Swarm Optimization for the Capacitated Vehicle Routing Problem. Algorithms, 11.","DOI":"10.3390\/a11030031"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","article-title":"A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows","volume":"40","author":"Desrochers","year":"1992","journal-title":"Oper. Res."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0954-1810(01)00005-X","article-title":"Heuristic methods for vehicle routing problem with time windows","volume":"15","author":"Tan","year":"2001","journal-title":"Artif. Intell. Eng."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/j.eswa.2010.06.082","article-title":"A hybrid algorithm for vehicle routing problem with time windows","volume":"38","author":"Yu","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"343","DOI":"10.7307\/ptt.v24i4.443","article-title":"Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms","volume":"24","author":"Taner","year":"2012","journal-title":"Promet-Traffic Transp."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Sripriya, J., Ramalingam, A., and Rajeswari, K. (2015, January 19\u201320). A hybrid genetic algorithm for vehicle routing problem with time windows. Proceedings of the 2015 International Conference on Innovations in Information, Embedded and Communication Systems (ICIIECS), Coimbatore, India.","DOI":"10.1109\/ICIIECS.2015.7193072"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1287\/trsc.36.1.55.567","article-title":"A Heuristic Algorithm for the Auto-Carrier Transportation Problem","volume":"36","author":"Tadei","year":"2002","journal-title":"Transp. Sci."},{"key":"ref_20","unstructured":"Miller, B.M. (2003). Auto Carrier Transporter Loading and Unloading Improvement. [Master\u2019s Thesis, Air Force Institute of Technology, Air University]. Available online: https:\/\/apps.dtic.mil\/dtic\/tr\/fulltext\/u2\/a413017.pdf."},{"key":"ref_21","first-page":"402","article-title":"Optimization of a Real-World Auto-Carrier Transportation Problem","volume":"49","author":"Falavigna","year":"2014","journal-title":"Transp. Sci."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.ejor.2017.10.012","article-title":"An efficient heuristic algorithm for the alternative-fuel station location problem","volume":"269","author":"Tran","year":"2018","journal-title":"Eur. J. Op. Res."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10479-014-1770-8","article-title":"Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in Small and Medium Enterprises","volume":"229","author":"Hosseinabadi","year":"2015","journal-title":"Ann. Op. Res."},{"key":"ref_24","unstructured":"Instituto Nacional de Estad\u00edstica y Geograf\u00eda, Asociaci\u00f3n Mexicana de la Industria Automotriz (2016). Estad\u00edsticas a Prop\u00f3sito de...la Industria Automotriz, INEGI. Available online: http:\/\/www.dapesa.com.mx\/dan-a-conocer-inegi-y-la-amia-libro-estadistico-de-la-industria-automotriz\/."},{"key":"ref_25","unstructured":"Morawska, L., Moore, M.R., and Ristovski, Z.D. (2018, July 17). Desktop Literature Review and Analysis: Health Impacts of Ultrafine Particles, Available online: http:\/\/www.environment.gov.au\/system\/files\/resources\/00dbec61-f911-494b-bbc1-adc1038aa8c5\/files\/health-impacts.pdf."},{"key":"ref_26","first-page":"1","article-title":"Wastes to Reduce Emissions from Automotive Diesel Engines","volume":"2014","year":"2014","journal-title":"J. Waste Manag."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2013\/589382","article-title":"Diesel Engine Emission Reduction Using Catalytic Nanoparticles: An Experimental Investigation","volume":"2013","author":"Sajeevan","year":"2013","journal-title":"J. Eng."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/S0927-0507(06)14006-2","article-title":"Chapter 6. Vehicle Routing","volume":"Volume 14","author":"Cordeau","year":"2007","journal-title":"Handbooks in Operations Research and Management Science"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1287\/trsc.1030.0056","article-title":"Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms","volume":"39","author":"Gendreau","year":"2005","journal-title":"Transp. Sci."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Op. Res."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.jksus.2010.03.002","article-title":"Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods","volume":"22","year":"2010","journal-title":"J. King Saud Univ. Sci."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/5\/111\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:55:00Z","timestamp":1760187300000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/5\/111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,25]]},"references-count":31,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2019,5]]}},"alternative-id":["a12050111"],"URL":"https:\/\/doi.org\/10.3390\/a12050111","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2019,5,25]]}}}