Vehicle Routing and Staffing for Sedan Service

References

• Barahona F., Anbil R. On some difficult linear programs coming from set partitioning. Discrete Appl. Math. (2002) 118:3–11Crossref, Google Scholar
• Barahona F., Jensen D. Plant location with minimum inventory. Math. Programming (1998) 83:101–111Crossref, Google Scholar
• Barnhart C., Johnson E. L., Nemhauser G. L., Savelsbergh M. W. F., Vance P. H. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. (1998b) 46:316–329Link, Google Scholar
• Barnhart C., Boland N. L., Clarke L. W., Johnson E. L., Nemhauser G. L., Shenoi R. G. Flight string models for aircraft, fleeting and routing. Transportation Sci. (1998a) 32:208–220Link, Google Scholar
• Bramel J., Simchi-Levi D. On the effectiveness of set covering formulations for the vehicle routing problem with time windows. Oper. Res. (1997) 45(2):295–301Link, Google Scholar
• Desrosiers J., Soumis F., Desrochers M. Routing with time windows by column generation. Networks (1984) 14:545–565Crossref, Google Scholar
• Desrosiers J., Dumas Y., Solomon M. M., Soumis F., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Time constrained routing and scheduling. Network Routing (1995) (North-Holland, Amsterdam) 35–139Crossref, Google Scholar
• Fisher M. L., Ball M., Magnanti T., Monma C., Nemhauser G. Vehicle routing. Handbooks in Operations Research and Management Science: Network Routing (1995) (Amsterdam)1–33Google Scholar
• Forrest J. Personal communication. (2002) Google Scholar
• Gilmore P., Gomory R. A linear programming approach to the cutting stock problem—Part II. Oper. Res. (1963) 11:863–888Link, Google Scholar
• Kirkpatrick S., Gelatt C. D., Vecchi M. Optimization by simulated annealing. Science (1983) 220(4598):671–680Crossref, Google Scholar
• Krumke S. O., Rambau J., Torres L. M. Real-time dispatching of guided and unguided automobile service units with soft time windows. Proc. 10th Ann. Eur. Sympos. Algorithms. Lecture Notes in Computer Science (2002) Vol. 2461(Springer, Berlin, Germany) Crossref, Google Scholar
• Lasdon L.Optimization Theory for Large Systems (1970) (McMillan, London, UK) Google Scholar
• Lubbecke M., Desrosiers J. Selected topics in column generation. (2002) . Technical report, Les Cahiers du GERAD G-2002-6, Gerad, MontrealGoogle Scholar
• Nazareth J.Computer Solution of Linear Programs (1987) (Oxford University Press, Oxford, UK) Google Scholar
• Rexing B., Barnhart C., Kniker T., Jarrah A., Krishnamurthy N. Airline fleet assignment with time windows. Transportation Sci. (2000) 34(1):1–20Link, Google Scholar
• Ryan D., Foster B., Wren A. An integer programming approach to scheduling. Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling (1981) (North-Holland, Amsterdam) 269–280Google Scholar
• Solomon M. M. On the worst case performance of some heuristics for the vehicle routing and scheduling problem with time windows constraints. Networks (1986) 16:161–174Crossref, Google Scholar
• Solomon M. M., Desrosiers J. Time window constrained routing and scheduling problems. Transportation Sci. (1988) 22:1–13Link, Google Scholar
• Stojkovic M., Soumis F. An optimization model for the simultaneous operational flight and pilot scheduling problem. Management Sci. (2001) 47:1290–1305Link, Google Scholar