Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach
- 1 February 2012
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 39 (2) , 391-404
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- The school bus routing problem: A reviewEuropean Journal of Operational Research, 2010
- A branch-and-cut algorithm for the capacitated open vehicle routing problemJournal of the Operational Research Society, 2007
- The Capacitated m-Ring-Star ProblemOperations Research, 2007
- A mathematical formulation for a school bus routing problem2006
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser ProblemOperations Research, 2003
- The Vehicle Routing-Allocation Problem: A unifying frameworkTOP, 1996
- Clustering for routing in densely populated areasEuropean Journal of Operational Research, 1985
- School bus routes generator in urban surroundingsComputers & Operations Research, 1980
- Routing and Scheduling of School Buses by ComputerTransportation Science, 1979
- Design of school bus routes by computerSocio-Economic Planning Sciences, 1969