Models and methods for merge-in-transit operations

Transportation Science

Volumn 37, Issue 1, 2003, Pages 1-22

  Croxton, Keely L ^a   Gendron, Bernard ^b   Magnanti, Thomas L ^c  

^a OHIO STATE UNIVERSITY   (United States)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c Massachusetts Institute of Technology Cambridge   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; TRANSPORTATION;

COMPUTER INDUSTRY;

DISTRIBUTION OF GOODS;

EID: 0037294066     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.37.1.1.12822     Document Type: Article

References (26)

1. Ahuja, R. K. 1998. Flows and paths. M. Dell'Amico, F. Maffioli, S. Martello, eds. Annotated Bibliographies in Combinatorial Optimization. John Wiley and Sons, New York, 283-309.
2. _, T. L. Magnanti, J. B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Upper Saddle River, NJ.
3. Balakrishnan, A., S. C. Graves. 1989. A composite algorithm for a concave-cost network flow problem. Networks 19 175-202.
4. _, T. L. Magnanti, P. Mirchandani. 1998. Network design. M. Dell'Amico, F. Maffioli, S. Martello, eds. Annotated Bibliographies in Combinatorial Optimization. John Wiley and Sons, New York, 311-334.
5. _, R. T. Wong. 1989. A dual-ascent procedure for large-scale uncapacitated network design problems. Oper. Res. 37 716-740.
6. Bell, G. J., B. W. Lamar, C. A. Wallace. 1998. Capacity improvement, penalties, and the fixed charge transportation problem. Working paper, The MITRE Corporation, Bedford, MA.
7. Bramel, J., D. Simchi-Levi. 1997. The Logic of Logictics. Springer-Verlag, New York.
8. Chan, L., A. Muriel, D. Simchi-Levi. 1997. Supply-chain management: Integrated inventory and transportation. Working paper, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL.
9. Cole, M. H., M. Parthasarathy. 1998. Optimal design of merge-in-transit distribution networks. Working paper, Mack-Blackwell National Rural Transportation Study Center, University of Arkansas, Fayetteville, AR.
10. Cominetti, R., F. Ortega. 1997. A branch-and-bound method for minimum concave cost network flows based on sensitivity analysis. Working paper, Departamento de Ingenieria Matematica, Universidad de Chile, Santiago, Chile.
11. Crainic, T. G. 1999. Long-haul freight transportation. R. W. Hall, ed. Handbook of Transportation Science. Kluwer, Norwell, MA, 433-491.
12. _, G. Laporte. 1997. Planning models for freight transportation. Eur. J. Oper. Res. 97 409-438.
13. _, A. Frangioni, B. Gendron. 2001. Bundle-based relaxation methods for multicommodity capacitated fixed-charge network design problems. Discrete Appl. Math. 112 73-99.
14. Croxton, K. L. 1999. Modeling and solving network flow problems with piecewise linear costs, with applications in supply chain management. Ph.D. thesis, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA.
15. _, B. Gendron, T. L. Magnanti. 2000. A comparison of mixed-integer programming models for non-convex piecewise linear cost minimization problems. Publication CRT-2000-31, Centre de recherche sur les transports, Université de Montréal, Montreal, Quebec, Canada.
16. _. 2002. Variable disaggregation in network flow problems with piecewise linear costs. Working paper, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA.
17. Gendron, B., T. G. Crainic, A. Frangioni. 1998. Multicommodity capacitated network design. B. Sansò, P. Soriano, eds. Telecommunications Network Planning. Kluwer Academic Publishers, Norwell, MA, 1-19.
18. Holmberg, K. 1994. Solving the staircase cost facility location problem with decomposition and piecewise linearization. Eur. J. Oper. Res. 75 41-61.
19. _, J. Ling. 1997. A Lagrangean heuristic for the facility location problem with staircase costs. Eur. J. Oper. Res. 97 63-74.
20. ILOG, Inc. 1998. CPLEX 6.0 Reference Manual. Incline Village, Nevada.
21. Magnanti, T. L., R. T. Wong. 1984. Network design and transportation planning: Models and algorithms. Transportation Sci. 18 1-55.
22. Mirchandani, P. B., R. L. Francis. 1990. Discrete Location Theory. John Wiley and Sons, New York.
23. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. John Wiley and Sons, New York.
24. Popken, D. 1994. An algorithm for the multiattribute, multicommodity flow problems with freight consolidation and inventory costs. Oper. Res. 42 274-286.
25. Shapiro, J. F. 1993. Large-scale assembly systems. S. C. Graves, A. H. G. Rinnooy Kan, P. H. Zipkin, eds. Handbooks in Operations Research and Management Science, Volume 4: Logistics of Production and Inventory. Elsevier Science Publishers, Amsterdam, The Netherlands.
26. Vidal, C. J., M. Goetschalckx. 1997. Strategic production-distribution models: A critical review with emphasis on global supply chain models. Eur. J. Oper. Res. 98 1-18.