Redirigiendo al acceso original de articulo en 18 segundos...
Inicio  /  Algorithms  /  Vol: 12 Par: 5 (2019)  /  Artículo
ARTÍCULO
TITULO

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

Marco Antonio Juárez Pérez    
Rodolfo Eleazar Pérez Loaiza    
Perfecto Malaquias Quintero Flores    
Oscar Atriano Ponce and Carolina Flores Peralta    

Resumen

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.

 Artículos similares

       
 
Omar Abdulkhaleq Aldabash and Mehmet Fatih Akay    
An IDS (Intrusion Detection System) is essential for network security experts, as it allows one to identify and respond to abnormal traffic present in a network. An IDS can be utilized for evaluating the various types of malicious attacks. Hence, detecti... ver más
Revista: Applied Sciences

 
Xin Liao and Khoi D. Hoang    
Distributed Constraint Optimization Problems (DCOPs) are an efficient framework widely used in multi-agent collaborative modeling. The traditional DCOP framework assumes that variables are discrete and constraint utilities are represented in tabular form... ver más
Revista: Applied Sciences

 
Esra?a Alkafaween, Ahmad Hassanat, Ehab Essa and Samir Elmougy    
The genetic algorithm (GA) is a well-known metaheuristic approach for dealing with complex problems with a wide search space. In genetic algorithms (GAs), the quality of individuals in the initial population is important in determining the final optimal ... ver más
Revista: Applied Sciences

 
Chuanwei Zhang, Xinyue Yang, Rui Zhou and Zhongyu Guo    
In order to solve the problem of low safety and efficiency of underground mine vehicles, a path planning method for underground mine vehicles based on an improved A star (A*) and fuzzy control Dynamic Window Approach (DWA) is proposed. Firstly, the envir... ver más
Revista: Applied Sciences

 
Yawei Ning, Minglei Ren, Shuai Guo, Guohua Liang, Bin He, Xiaoyang Liu and Rong Tang    
Multi-objective reservoir operation of reservoir flood control involves numerous factors and complex model solving, and exploring effective methods for solving the operation models has always been a hot topic in reservoir optimization operation research.... ver más
Revista: Water