Branch-and-Price algorithm for CLSP

Dongbei Daxue Xuebao/Journal of Northeastern University

Volumn 24, Issue 1, 2003, Pages 11-14

  Gao, Zhen ^a   Tang, Li Xin ^a  

^a NORTHEASTERN UNIVERSITY   (China)

Author keywords

Branch and bound; CLSP; Column generation; Heuristic; Production plan; Schedule

Indexed keywords

PRODUCTION CONTROL; SCHEDULING;

BRANCH AND BOUND; COLUMN GENERATION; PRODUCTION PLAN; THE CAPACITATED SINGLE LEVEL MULTI ITEM DYNAMIC LOT SIZING PROBLEM;

ALGORITHMS;

EID: 0037866802     PISSN: 10053026     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. Florian M, Lenstra J K, Rinnooy Kan A H G. Deterministic production planning: Algorithms and complexity[J]. Mgmt Sci, 1980, 26: 12-20.
2. Maes J, Van Wassenhove L N. Multi-item single - level capacitated dynamic lot-sizing heuristics; a general review[J]. Journal of Operational Research Society, 1988,39(11): 991-1004.
3. Hindi K S. Solving the CLSP by a tabu search heuristics[J]. Journal of the Operational Research Society, 1996, 47: 151-161.
4. Dellaert D, Jeunet J, Jonard N. A genetic algorithm to solve the general multi-level lot-sizing problem with time-varying costs[J]. International Journal of Production Economics, 2000, 68: 241-257.
5. Ozdamar L, Barbarosoglu G. Hybrid heuristics for the multistage capacitated lot-sizing and loading problem[J]. Journal of the Operational Research Society, 1999, 50: 810-825.
6. Desrochers M, Soumis F. A column generation approach to the urban transit crew scheduling problern[J]. Transp Sci, 1989, 23: 1-13.
7. Desrochers M, Desrosiers J, Soloman M. A new optimization algorithm for the vehicle routing problem with time windows [J], Opns Res, 1992, 40(2): 342-354.
8. Savelsbergh M W P. A Branch-and-Price algorithm for the generalized assignment problem [J]. Opns Res, 1997, 45(6): 831-841.
9. Vance P H. Branch-and-Price algorithms for the one-dimensional cutting stock problem[J]. Computational Optimization and Applications, 1998, 9: 211-228.
10. Barnhart C, Hane C A, Vance P H. Using Branch-and-Price-and-Cut to solve origin-destination integer multi-commodity flow problems[J]. Opns Res, 2000, 48(2): 318-326.
11. Cattrysse D, Maes J, Van Wassenhove L N. Set partition and column generation heuristics for capacitated dynamic lot-sizing [J]. European Journal of Operational Research, 1990, 46: 38-47.
12. Manne A S. Programming of economic lot sizes [J], Management Science, 1958, 4: 115-135.
13. Lasdon L S, Terjung R C. An efficient algorithm for multi-item scheduling[J]. Opns Res, 1971, 19(4): 946-969.
14. Dantzig G B, Wolfe P. Decomposition principle for linear programming[J]. Opns Res, 1960, 8: 108-111.
15. Barnhart C, Johnson E L, Nemhauser G L, et al. Branch-and-Price: Column generation for solving huge integer programs[J]. Opns Res, 1998, 46(3): 316-329.
16. Wagner H M, Whitin T M. A dynamic version of the economic lot size model[J], Mgmt Sci, 1958, 5: 89-96.
17. Vance P H, Barnhart C, Johnson E L, et al. Solving binary cutting stock problem by column generation and branch-and-bound[J]. Computational Optimization and Application, 1994, 3: 111-130.
18. Wren A. Computer scheduling of public transport urban passenger vehicle and crew scheduling[M]. North-Holland, Amsterdam: North-Holland Publishing Company, 1981. 269-280.
19. Nemhauser G L, Wolsey L A. Integer and combinatorial optimization[M], UK, Chichester: Wiley, 1988. 173-189.
20. Vanderbeck F. On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a Branch-and-Price algorithm[J]. Opns Res, 2000, 48(1): 111-128.