A heuristic algorithm for the routing and scheduling problem with time windows: a case study of the automotive industry in Mexico

DOI10.3390/A12050111MaRDI QIDQ2004887zbMATH OpenOpenAlexFDO

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

Publication date 7 October 2020

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/a12050111

zbMATH Keywords

auto-carrier transportation problem (ACTP)feasible loadingheuristictime windows

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Case-oriented studies in operations research (90B90) Approximation methods and heuristics in mathematical programming (90C59)

Review text

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.

Recommendations

• A Heuristic Algorithm for the Auto-Carrier Transportation Problem
• Research on the logistics transportation problem of vehicle based on heuristic algorithm
• Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles
• An optimization analysis on a vehicle scheduling problem of logistics and distribution with time windows
• The Distribution Problem with Carrier Service: A Dual Based Penalty Approach

Cites work

• A Heuristic Algorithm for the Auto-Carrier Transportation Problem
• A heuristic approach for a real-world electric vehicle routing problem
• A monarch butterfly optimization for the dynamic vehicle routing problem
• A multi-stage algorithm for a capacitated vehicle routing problem with time constraints
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An efficient heuristic algorithm for the alternative-fuel station location problem
• Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem
• Handbooks in operations Research \& management science: Transportation
• On the use of learnheuristics in vehicle routing optimization problems with dynamic inputs
• Solution of a Large-Scale Traveling-Salesman Problem
• Using metaheuristics on the multi-depot vehicle routing problem with modified optimization criterion
• Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises

Cited in

(5)

• Integrating multi-product production and distribution in newspaper logistics
• Research on the logistics transportation problem of vehicle based on heuristic algorithm
• A Heuristic Algorithm for the Auto-Carrier Transportation Problem
• The Distribution Problem with Carrier Service: A Dual Based Penalty Approach
• Competitiveness based on logistic management: a real case study

This page was built for publication: A heuristic algorithm for the routing and scheduling problem with time windows: a case study of the automotive industry in Mexico

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2004887)