A heuristic algorithm for the routing and scheduling problem with time windows: a case study of the automotive industry in Mexico
From MaRDI portal
Publication:2004887
DOI10.3390/a12050111zbMath1461.90068OpenAlexW2945065020MaRDI QIDQ2004887
Marco Antonio Juárez Pérez, Perfecto Malaquias Quintero Flores, Oscar Atriano Ponce, Carolina Flores Peralta, Rodolfo Eleazar Pérez Loaiza
Publication date: 7 October 2020
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a12050111
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)
Cites Work
- Unnamed Item
- Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises
- A monarch butterfly optimization for the dynamic vehicle routing problem
- On the use of learnheuristics in vehicle routing optimization problems with dynamic inputs
- An efficient heuristic algorithm for the alternative-fuel station location problem
- A multi-stage algorithm for a capacitated vehicle routing problem with time constraints
- Using metaheuristics on the multi-depot vehicle routing problem with modified optimization criterion
- Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem
- A heuristic approach for a real-world electric vehicle routing problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A Heuristic Algorithm for the Auto-Carrier Transportation Problem
- Solution of a Large-Scale Traveling-Salesman Problem
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
