scientific article; zbMATH DE number 915580

MaRDI QIDQ4889095zbMATH OpenFDO

Authors Aristide Mingozzi, Salvatore Ricciardelli, Lucio Bianco

Publication date 6 January 1997

zbMATH Keywords

branch-and-boundset partitioninglinear relaxationvehicle schedulingvehicle fleetfreight transportmultiple depot vehicle scheduling problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Recommendations

• Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
• Multi-depot vehicle scheduling problems with time windows and waiting costs
• A branch and bound algorithm for the multiple depot vehicle scheduling problem
• A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
• Vehicle routing and scheduling with time windows

Cited in

(7)

• An exact algorithm for the simplified multiple depot crew scheduling problem
• Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
• Multi-depot vehicle scheduling problems with time windows and waiting costs
• An exact algorithm for a vehicle-and-driver scheduling problem
• Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows
• Integrated planning of loaded and empty container movements
• A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem

This page was built for publication:

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