A column generation heuristic for a dynamic generalized assignment problem

Computers and Operations Research

Volumn 36, Issue 9, 2009, Pages 2670-2681

  Moccia, Luigi ^a,b,c   Cordeau, Jean François ^d   Monaco, Maria Flavia ^b   Sammarra, Marcello ^b  

^a ICAR CNR   (Italy)

^b UNIVERSITY OF CALABRIA   (Italy)

^c Trisaia Research Center   (Italy)

^d HEC MONTRÉAL   (Canada)

Author keywords

Column generation; Dynamic problem; Generalized assignment problem; Warehouse management; Yard management

Indexed keywords

CONTROL THEORY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; INDUSTRIAL MANAGEMENT; PROGRAMMING THEORY; TRAVELING SALESMAN PROBLEM; WAREHOUSES;

COLUMN GENERATION; DYNAMIC PROBLEM; GENERALIZED ASSIGNMENT PROBLEM; WAREHOUSE MANAGEMENT; YARD MANAGEMENT;

INTEGER PROGRAMMING;

EID: 60449088505     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.11.022     Document Type: Article

References (19)

1. Martello S., and Toth P. Generalized assignment problems. Algorithms and computation (1992), Springer, Berlin
2. Goetschalkx M., and Ratliff D.H. Shared storage policies based on the duration stay of unit loads. Management Science 36 9 (1990) 1120-1132
3. Kim K.H., and Park K.T. Dynamic space allocation for temporary storage. International Journal of Systems Science 34 1 (2003) 11-20
4. Barnhart C., Hane C.A., and Vance P.H. Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Operations Research 48 2 (2000) 318-326
5. Desaulniers G, Desrosiers J, Solomon MM, editors. Column generation. Berlin: Springer; 2005.
6. Dumitrescu I., and Boland N. Algorithms for the weight constrained shortest path problem. International Transactions in Operational Research 8 1 (2001) 15-29
7. Dumitrescu I., and Boland N. Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks 42 3 (2003) 135-153
8. Holmberg K., and Yuan D. A multicommodity network-flow problem with side constraints on paths solved by column generation. INFORMS Journal on Computing 15 1 (2003) 42-57
9. Monaco MF, Moccia L, Sammarra M. Operations research for the management of a transhipment container terminal. The Gioia Tauro case, Maritime Economics & Logistics, 2008, in press, doi:10.1057/mel.2008.21.
10. Cordeau J.-F., Laporte G., Legato P., and Moccia L. Models and tabu search heuristics for the berth allocation problem. Transportation Science 39 (2005) 526-538
11. Monaco M.F., and Sammarra M. The berth allocation problem: a strong formulation solved by a Lagrangean approach. Transportation Science 41 2 (2007) 265-280
12. Cordeau J.-F., Gaudioso M., Laporte G., and Moccia L. The service allocation problem at the Gioia Tauro maritime terminal. European Journal of Operational Research 176 (2007) 1167-1184
13. Giallombardo G., Moccia L., Salani M., and Vacca I. The tactical berth allocation problem with quay crane assignment and transshipment-related quadratic yard costs. Proceedings of the European transport conference (ETC) (2008)
14. Monaco M., Sammarra M., and Moccia L. Some observations about the extreme points of the generalized cardinality-constrained shortest path problem polytope. Optimization Letters 2 4 (2008) 577-585
15. Dahl G., and Realfsen B. The cardinality-constrained shortest path problem in 2-graphs. Networks 36 1 (2000) 1-8
16. Garey M.R., and Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness (1979), Freeman, San Francisco
17. Desrochers M., and Soumis F. A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR 26 (1988) 191-212
18. Nemhauser G.L., and Wolsey L.A. Integer and combinatorial optimization (1988), Wiley, New York
19. Geoffrion A.M. Lagrangean relaxation for integer programming. Mathematical Programming Study 2 (1974) 82-113