Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations

References

• Ahuja RK, Ergun O, Orlin JB, Punnen AP (2002) A survey of very large-scale neighborhood search techniques. Discrete Appl. Math. 123(1–3):75–102.Crossref, Google Scholar
• Cattrysse D, Van Wassenhove L (1992) A survey of algorithms for the generalized assignment problem. Eur. J. Oper. Res. 60(3):260–272.Crossref, Google Scholar
• Cheeseman P, Kanefsky B, Taylor WM (1991) Where the really hard problems are. Proc. 12th Internat. Joint Conf. Artificial Intelligence, Sydney, Australia, 331–337.Google Scholar
• Chu PC, Beasley JE (1997) A genetic algorithm for the generalized assignment problem. Comput. Oper. Res. 24(1):17–23.Crossref, Google Scholar
• de Farias IR, Johnson EL, Nemhauser GL (2000) A generalized assignment problem with special ordered sets: A polyhedral approach. Math. Programming 89(1):187–203.Crossref, Google Scholar
• Denton BT, Miller AJ, Balasubramanian HJ, Huschka TR (2010) Optimal allocation of surgery blocks to operating rooms under uncertainty. Oper. Res. 58(4, Pt. 1):802–816.Link, Google Scholar
• Lopes L, Smith-Miles K (2013) Generating applicable synthetic instances for branch problems. Oper. Res. 61(3):563–577.Link, Google Scholar
• Martello S, Toth P (1990) Knapsack Problems, Algorithms, and Computer Implementations (John Wiley & Sons, New York).Google Scholar
• McCormick ST, Pinedo ML, Shenker S, Wolf B (1989) Sequencing in an assembly line with blocking to minimize cycle time. Oper. Res. 37(6):925–935.Link, Google Scholar
• Mitrović-Minić S, Punnen AP (2009) Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem. Discrete Optim. 6(4):370–377.Crossref, Google Scholar
• Mladenović N, Hansen P (1997) Variable neighbourhood search. Comput. Oper. Res. 24(11):1097–1100.Crossref, Google Scholar
• Nauss RM (2003) Solving the generalized assignment problem: An optimizing and heuristic approach. INFORMS J. Comput. 15(3):249–266.Link, Google Scholar
• Öncan T (2007) A survey of the generalized assignment problem and its applications. INFOR 45(3):123–141.Google Scholar
• Osman IH (1995) Heuristics for the generalized assignment problem: Simulated annealing and Tabu search approaches. OR Spektrum 17(4):211–225.Crossref, Google Scholar
• Pentico D (2007) Assignment problems: A golden anniversary survey. Eur. J. Oper. Res. 176(2):774–793.Crossref, Google Scholar
• Ross GT, Soland RM (1975) A branch and bound algorithm for the generalized assignment problem. Math. Programming 8(1):91–103.Crossref, Google Scholar
• Smith-Miles K, Lopes L (2012) Measuring instance difficulty for combinatorial optimization problems. Comput. Oper. Res. 39(5):875–889.Crossref, Google Scholar
• Yagiura M, Ibaraki T, Glover F (2004a) An ejection chain approach for the generalized assignment problem. INFORMS J. Comput. 16(2):133–151.Link, Google Scholar
• Yagiura M, Ibaraki T, Glover F (2006) A path relinking approach with ejection chains for the generalized assignment problem. Eur. J. Oper. Res. 169(2):548–569.Crossref, Google Scholar
• Yagiura M, Iwasaki S, Ibaraki T, Glover F (2004b) A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem. Discrete Optim. 1(1):87–98.Crossref, Google Scholar