A post-improvement procedure for the mixed load school bus routing problem
Authors:
- Junhyuk ParkJPJunhyuk Park
- Hyunchul TaeHTHyunchul Tae
- Byung-In KimBKByung-In Kim
- 1 February 2012
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 217 (1) , 204-213
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A hybrid evolution strategy for the open vehicle routing problemComputers & Operations Research, 2010
- The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution methodEuropean Journal of Operational Research, 2010
- Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in BrazilEuropean Journal of Operational Research, 2009
- A variable neighbourhood search algorithm for the open vehicle routing problemEuropean Journal of Operational Research, 2009
- Solving a school bus scheduling problem with integer programmingEuropean Journal of Operational Research, 2009
- The multiple TSP with time windows: vehicle bounds based on precedence graphsOperations Research Letters, 2006
- A computerized approach to the New York City school bus routing problemIIE Transactions, 1997
- The pickup and delivery problem with time windowsEuropean Journal of Operational Research, 1991
- School bus routing and scheduling: An expert system approachComputers & Industrial Engineering, 1988
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955