The multi-shift vehicle routing problem with overtime
From MaRDI portal
Publication:976019
DOI10.1016/J.COR.2010.01.016zbMATH Open1188.90038OpenAlexW1965792471MaRDI QIDQ976019FDOQ976019
Yingtao Ren, Maged Dessouky, Fernando Ordóñez
Publication date: 11 June 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.01.016
Recommendations
- Multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints
- A multi-shift vehicle routing problem with windows and cycle times
- The vehicle routing problem with occasional drivers
- scientific article
- Open vehicle routing problem with driver nodes and time deadlines
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
- The multi-trip vehicle routing problem
- A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
- The periodic vehicle routing problem with intermediate facilities
- A variable neighborhood search heuristic for periodic routing problems
- A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions
- Integrated capacity, demand, and production planning with subcontracting and overtime options
- A GA based heuristic for the vehicle routing problem with multiple trips
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
- Computer Solutions of the Traveling Salesman Problem
- Vehicle Routeing with Multiple Use of Vehicles
- An exact algorithm for a single-vehicle routing problem with time windows and multiple routes
- Title not available (Why is that?)
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
Cited In (4)
- A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem
- Multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints
- Routing Courier Delivery Services with Urgent Demand
- A multi-shift vehicle routing problem with windows and cycle times
Uses Software
This page was built for publication: The multi-shift vehicle routing problem with overtime
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976019)