Scheduling Transportation of Live Animals to Avoid the Spread of Diseases

Published Online:https://doi.org/10.1287/trsc.1030.0053

References

  • Barnhart C., Johnson E. L., Nemhauser G. L., Savelsbergh M. W. P., Vance P. H. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. (1988) 46:316–329LinkGoogle Scholar
  • Linear Programming (1983) (Freeman, New York) Google Scholar
  • Desaulniers G., Lavigne J., Soumis F. Multi-depot vehicle scheduling problems with time windows and waiting costs. Eur. J. Oper. Res. (1998) 111:479–494CrossrefGoogle Scholar
  • Desaulniers G., Desrosiers J., Erdmann A., Solomon M. M., Soumis F., Toth P., Vigo D. VRP with pickup and delivery. The Vehicle Routing Problem (2002) (SIAM, Philadelphia, PA) CrossrefGoogle Scholar
  • Desrochers M., Soumis F. A generalized permanent labelling algorithm for the shortest path problem with time windows. INFOR (1988) 26:191–212Google Scholar
  • Desrosiers J., Dumas Y., Solomon M. M., Soumis F., Ball M. O., Magnanti T. L., Momma C. L., Nemhauser G. L. Time constrained routing and scheduling. Network Routing. Handbooks in Operations Research and Management Science (1995) Vol. 8(North-Holland, Amsterdam, The Netherlands)35–139Google Scholar
  • Dumas Y., Desrosiers J., Soumis F. The pickup and delivery problem with time windows. Eur. J. Oper. Res. (1991) 54:7–22CrossrefGoogle Scholar
  • ILOGILOG CPLEX 7.0, Reference Manual (2000) (ILOG, S.A., France) Google Scholar
  • Lagrange dualitet og ikke-differentiabel optimering anvendt i rutelægning (Danish) (2000) . Technical Report IMM-EKS-2000-13, DTU, Lyngby, DenmarkGoogle Scholar
  • Exact methods for time constrained routing and related scheduling problems (1995) (Department of Mathematics Modelling, Technical University of Denmark, Lyngby, Denmark) . Ph.D. thesisGoogle Scholar
  • Savelsbergh M. W. P., Sol M. The general pickup and delivery problem. Transportation Sci. (1995) 29:17–29LinkGoogle Scholar
  • A branch-and-price algorithm for the pickup and delivery problem with time windows (1994) ( The Netherlands). COSOR Memorandum 94-22, Eindhoven University of Technology, EindhovenGoogle Scholar
  • Solomon M. Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper. Res. (1987) 35:254–265LinkGoogle Scholar
  • ABACUS—A branch-and-cut system (1995) (Universität zu Köln, Köln, Germany) . Ph.D. thesisGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.