The multi-shift vehicle routing problem with overtime

DOI10.1016/J.COR.2010.01.016MaRDI QIDQ976019zbMATH OpenOpenAlexFDO

Authors Yingtao Ren, Fernando Ordóñez, Maged Dessouky

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

zbMATH Keywords

tabu searchovertimeinsertion heuristicmulti-shiftvehicle routing problem with time windows (VRPTW)

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)

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; zbMATH DE number 6616704
• Open vehicle routing problem with driver nodes and time deadlines

Cites work

• scientific article; zbMATH DE number 1749225 (Why is no real title available?)
• scientific article; zbMATH DE number 1749226 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• A GA based heuristic for the vehicle routing problem with multiple trips
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
• A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
• A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
• A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions
• A variable neighborhood search heuristic for periodic routing problems
• An exact algorithm for a single-vehicle routing problem with time windows and multiple routes
• Computer Solutions of the Traveling Salesman Problem
• Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
• Integrated capacity, demand, and production planning with subcontracting and overtime options
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• The multi-trip vehicle routing problem
• The periodic vehicle routing problem with intermediate facilities
• Vehicle Routeing with Multiple Use of Vehicles

Cited in

(5)

• 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
• The vehicle routing problem with occasional drivers
• A multi-shift vehicle routing problem with windows and cycle times

Describes a project that uses

Uses Software

• VRP

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)