Next Article in Journal
Convolution Accelerator Designs Using Fast Algorithms
Previous Article in Journal
Counter-Terrorism Video Analysis Using Hash-Based Algorithms
Article Menu
Issue 5 (May) cover image

Export Article

Open AccessArticle

A Heuristic Algorithm for the Routing and Scheduling Problem with Time Windows: A Case Study of the Automotive Industry in Mexico

1
Tecnológico Nacional de México, Instituto Tecnológico de Apizaco, Apizaco 90300, Mexico
2
Smartsoft America BA, Chiautempan 90802, Mexico
*
Author to whom correspondence should be addressed.
Algorithms 2019, 12(5), 111; https://doi.org/10.3390/a12050111
Received: 3 May 2019 / Revised: 22 May 2019 / Accepted: 22 May 2019 / Published: 25 May 2019
(This article belongs to the Special Issue Exact and Heuristic Scheduling Algorithms)
  |  
PDF [1537 KB, uploaded 25 May 2019]
  |     |  

Abstract

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. View Full-Text
Keywords: heuristic; time windows; feasible loading; auto-carrier transportation problem (ACTP) heuristic; time windows; feasible loading; auto-carrier transportation problem (ACTP)
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Juárez Pérez, M.A.; Pérez Loaiza, R.E.; Quintero Flores, P.M.; Atriano Ponce, O.; Flores Peralta, C. A Heuristic Algorithm for the Routing and Scheduling Problem with Time Windows: A Case Study of the Automotive Industry in Mexico. Algorithms 2019, 12, 111.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top