Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems

References

• Aarts E., Lenstra J. K.Local Search in Combinatorial Optimization (1997) (John Wiley & Sons, New York) Google Scholar
• Alvarenga G. B., Matheus G. R., de Tomi G. A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Comput. Oper. Res. (2007) 34(6):1561–1584Crossref, Google Scholar
• Anbil R., Johnson E. L., Tanga R. A global approach to crew-pairing optimization. IBM Systems J. (1992) 31(1):71–78Crossref, Google Scholar
• Archetti C., Speranza M. G., Savelsbergh M. W. P. An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Sci. (2008) 42(1):22–31Link, Google Scholar
• Barnhart C., Johnson E. L., Nemhauser G. L., Savelsbergh M. W. P., Vance P. H. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. (1998) 46(3):316–329Link, Google Scholar
• Blum C., Roli A. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surveys (2003) 35(3):268–308Crossref, Google Scholar
• Caprara A., Fischetti M., Toth P. A heuristic method for the set covering problem. Oper. Res. (1999) 47(5):730–743Link, Google Scholar
• Caprara A., Fischetti M., Toth P. Algorithms for the set covering problem. Ann. Oper. Res. (2000) 98(1–4):353–371Crossref, Google Scholar
• Chu P. C., Beasley J. E. A genetic algorithm for the multidimensional knapsack problem. J. Heuristics (1998) 4(1):63–86Crossref, Google Scholar
• Cordeau J.-F., Laporte G., Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. (2001) 52(8):928–936Crossref, Google Scholar
• Desaulniers G., Desrosiers J., Solomon M. M.Column Generation (2005) (Springer, New York) Crossref, Google Scholar
• Desaulniers G., Lessard F., Hadjar A. Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transportation Sci. (2008) 42(3):387–404Link, Google Scholar
• Desrochers M., Desrosiers J., Solomon M. M. A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. (1992) 40(2):342–354Link, Google Scholar
• Dolan E. D., Moré J. J. Benchmarking optimization software with performance profiles. Math. Programming Ser. A (2002) 91:201–213Crossref, Google Scholar
• Glover F. Tabu search—Part I. ORSA J. Comput. (1989) 1(3):190–206Link, Google Scholar
• Glover F. W., Laguna M.Tabu Search (1997) (Kluwer, Boston) Crossref, Google Scholar
• Hoffman K. L., Padberg M. Solving airline crew scheduling problems by branch-and-cut. Management Sci. (1993) 39(6):657–682Link, Google Scholar
• Huang K., Wu T.-Y. A heuristic based on modified Lagrangian relaxation for the vehicle routing problem. Proc. Eastern Asia Soc. Transportation Stud. (2007) 6(Eastern Asia Society for Transportation Studies, Tokyo) 1056–1069Google Scholar
• Larsen J. Parallelization of the vehicle routing problem with time windows. (1999) . Ph.D. thesis, Department of Mathematical Modelling, Technical University of Denmark, LyngbyGoogle Scholar
• Lin S. Computer solutions of the traveling salesman problem. Bell System Tech. J. (1965) 44:2245–2269Crossref, Google Scholar
• Lübbecke M. E., Desrosiers J. Selected topics in column generation. Oper. Res. (2002) 53(6):1007–1023Link, Google Scholar
• Mester D., Bräysy O., Dullaert W. A multi-parametric evolution strategies algorithm for vehicle routing problems. Expert Systems Appl. (2007) 32(2):508–517Crossref, Google Scholar
• Monaci M., Toth P. A set-covering-based heuristic approach for bin-packing problems. INFORMS J. Comput. (2006) 18(1):71–85Link, Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (Wiley-Interscience, New York) Crossref, Google Scholar
• Or I. Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking. (1976) . Ph.D. thesis, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, ILGoogle Scholar
• Osman I. H., Laporte G. Metaheuristics: A bibliography. Ann. Oper. Res. (1996) 63(5):513–623Crossref, Google Scholar
• Potvin J.-Y., Kervahut T., Garcia B.-L., Rousseau J.-M. The vehicle routing problem with time windows part I: Tabu search. INFORMS J. Comput. (1996) 8(2):158–164Link, Google Scholar
• Puchinger J., Raidl G. R. Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. Proc. First Internat. Work-Conf. Interplay Between Nat. Artificial Comput. (2005) (Springer, Berlin) 41–53Crossref, Google Scholar
• Raidl G. R. An improved genetic algorithm for the multiconstrained 0-1 knapsack problem. Proc. 5th IEEE Internat. Conf. Evolutionary Comput. (1998) (IEEE Press, Anchorage, AK) 207–211Crossref, Google Scholar
• Reeves C. R.Modern Heuristic Techniques for Combinatorial Problems (1995) (McGraw-Hill, New York) Google Scholar
• Rochat Y., Taillard E. D. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics (1995) 1(1):147–167Crossref, Google Scholar
• Savelsbergh M., Sol M. Drive: Dynamic routing of independent vehicles. Oper. Res. (1998) 46(4):474–490Link, Google Scholar
• Shaw P., Maher M., Puget J.-F. Using constraint programming and local search methods to solve vehicle routing problems. Principles and Practice of Constraint Programming—CP98 (1998) 1520Pisa, Italy(Springer, Berlin) 417–431Lecture Notes in Computer ScienceCrossref, Google Scholar
• Solomon M. M. Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. (1987) 35(2):254–265Link, Google Scholar
• Taillard E. D. A heuristic column generation method for the heterogeneous fleet VRP. RAIRO (1999) 33(1):1–14Crossref, Google Scholar
• Vanderbeck F., Desaulniers G., Desrosiers J., Solomon M. M. Implementing mixed integer column generation. Column Generation (2005) (Springer-Verlag, Boston) 331–358Chapter 12Crossref, Google Scholar