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

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, wit...

Full description

Saved in:
Bibliographic Details
Published in:Algorithms 2019-05, Vol.12 (5), p.111
Main Authors: Juárez Pérez, Marco Antonio, Pérez Loaiza, Rodolfo Eleazar, Quintero Flores, Perfecto Malaquias, Atriano Ponce, Oscar, Flores Peralta, Carolina
Format: Article
Language:English
Subjects:
Air pollution
Algorithms
auto-carrier transportation problem (ACTP)
Automobile dealers
Automobile industry
Decision making
Design
Economic activity
Emissions
Engines
feasible loading
GDP
Gross Domestic Product
Heuristic
Heuristic methods
Integer programming
Logistics
Natural gas distribution
North American Free Trade Agreement
Operations research
Optimization algorithms
Outdoor air quality
Software
time windows
Transportation problem
Traveling salesman problem
Vans
Vehicles
Windows (intervals)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1999-4893
1999-4893
DOI:10.3390/a12050111