A branch-and-price algorithm for the multiperiod single-sourcing problem

Operations Research

Volumn 51, Issue 6, 2003, Pages 922-939

  Freling, Richard ^a,b   Romeijn, H Edwin ^c   Morales, Dolores Romero ^d   Wagelmans, Albert P M ^a  

^a ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^b ORTEC The Netherlands   (Netherlands)

^c UNIVERSITY OF FLORIDA   (United States)

^d UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Integer programming: branch and price algorithm and penalized knapsack problem; Production distribution: integrating production distribution and inventory

Indexed keywords

BRANCH-AND-PRICE ALGORITHMS; GENERALIZED ASSIGNMENT PROBLEM (GAP); KNAPSACK; OPTIMAL SOLUTIONS;

ALGORITHMS; FUNCTIONS; INTEGRAL EQUATIONS; INVENTORY CONTROL; TRANSPORTATION;

PROBLEM SOLVING;

EID: 4344581636     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.51.6.922.24914     Document Type: Article

References (25)

1. Barnhart, C., E. L. Johnson, G. L. Kemhauser, M. W. P. Savelsbergh, P. H. Vance. 1998. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3) 316-329.
2. Benders, J. F., W. K. M. Keulemans, J. A. E. E. van Nunen, G. Stolk. 1986. A decision support program for planning locations and allocations with the aid of linear programming. C. B. Tilanus, O. B. de Gaus, J. K. Lenstra, eds. Quantitative Methods in Management: Case Studies of Failures and Successes, Ch. 4. John Wiley and Sons, Chichester, U.K., 29-34.
3. Cattrysse, D. G., L. N. Van Wassenhove. 1992. A survey of algorithms for the generalized assignment problem. Eur. J. Oper. Res. 60 260-272.
4. _, M. Salomon, L. N. Van Wassenhove. 1994. A set partitioning heuristic for the generalized assignment problem. Eur. J. Oper. Res. 72 167-174.
5. Chan, L. M. A., A. Muriel, D. Simchi-Levi. 1998. Production/distribution planning problems with piece-wise linear and concave transportation costs. Research report, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL.
6. CPLEX Reference Manual. 1999. ILOG CPLEX 6.6. ILOG, Inc., Incline Village, NV.
7. Duran, F. 1987. A large mixed integer production and distribution program. Eur. J. Oper. Res. 28 207-217.
8. Fleischmann, B. 1993. Designing distribution systems with transport economies of scale. Eur. J. Oper. Res. 70 31-42.
9. Geoffrion, A. M., G. W. Graves. 1974. Multicommodity distribution system design by Benders decomposition. Management Sci. 20(5) 822-844.
10. Gilmore, P. C., R. E. Gomory. 1961. A linear programming approach to the cutting-stock problem. Oper. Res. 9 849-859.
11. Hall, N. G., M. E. Posner. 2001. Generating experimental data for scheduling problems. Oper. Res. 49(6) 854-865.
12. Hiriart-Urruty, J. B., C. Lemaréchal. 1993. Convex Analysis and Minimization Algorithms: Fundamentals, Vol. 1. Springer-Verlag, Berlin, Germany.
13. Martello, S., P. Toth. 1981. An algorithm for the generalized assignment problem. J. P. Brans, ed. Operational Research '81. IFORS, North-Holland, Amsterdam, The Netherlands, 589-603.
14. _, _. 1990. Knapsack Problems, Algorithms and Computer Implementations. John Wiley and Sons, New York.
15. Neebe, A. W., M. R. Rao. 1983. An algorithm for the fixed-charge assigning users to sources problem. J. Oper. Res. Soc. 34(11) 1107-1113.
16. Osman, I. H. 1995. Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches. OR Spektrum 17 211-225.
17. Rinnooy Kan, A. H. G., L. Stougie, C. Vercellis. 1993. A class of generalized greedy algorithms for the multi-knapsack problem. Discrete Appl. Math. 42 279-290.
18. Romeijn, H. E., N. Piersma. 2000. A probabilistic feasibility and value analysis of the generalized assignment problem. J. Combin. Optim. 4(3) 325-355.
19. _, D. Romero Morales. 1999. Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: The acyclic case. Research report 99-13, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL.
20. _, _. 2001. Generating experimental data for the generalized assignment problem. Oper. Res. 49(6) 866-878.
21. _, _. 2003. An asymptotically optimal greedy heuristic for the multi-period single-sourcing problem: The cyclic case. Naval Res. Logist. 50(5) 412-437.
22. Romero Morales, D. 2000. Optimization problems in supply chain management. Ph.D. thesis, TRAIL Thesis Series no. 2000/4 & ERIM Ph.D. Series Research in Management, No. 3. Rotterdam, The Netherlands.
23. Savelsbergh, M. W. P. 1997. A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 45(6) 831-841.
24. Srinivasan, V., G. L. Thompson. 1972. An algorithm for assigning uses to sources in a special class of transportation problems. Oper. Res. 21 284-295.
25. Vanderbeck, F. 2000. On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Oper. Res. 48(1) 111-128.