An exact algorithm for a vehicle-and-driver scheduling problem

DOI10.1016/j.cor.2016.12.022zbMath1391.90254OpenAlexW2564179995WikidataQ56524179 ScholiaQ56524179MaRDI QIDQ1652246

Juan-José Salazar-González, Inmaculada Rodríguez-Martín, Bencomo Domínguez-Martín

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.12.022

zbMATH Keywords

vehicle routingbranch-and-cuttask schedulingmulti-depot

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (2)

The driver and vehicle routing problem ⋮ An efficient multistart heuristic for the driver and vehicle routing problem

Uses Software

• Concorde
• VRP
• CVRPSEP
• CVRPSP
• Cvrplib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch-and-cut algorithm for vehicle routing problems
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Models and algorithms for integration of vehicle and crew scheduling
• Vehicle Routing
• Integer Programming Formulation of Traveling Salesman Problems
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• Cvrplib

This page was built for publication: An exact algorithm for a vehicle-and-driver scheduling problem