Generating applicable synthetic instances for branch problems

Operations Research

Volumn 61, Issue 3, 2013, Pages 563-577

  Lopes, Leo ^a   Smith Miles, Kate ^b  

^a SAS INSTITUTE INC   (United States)

^b MONASH UNIVERSITY   (Australia)

Author keywords

Data mining; Instance generation; Optimization; Timetabling

Indexed keywords

COMPUTATIONAL INFRASTRUCTURE; CORE PROBLEMS; CYBER INFRASTRUCTURES; GRAPH COLORINGS; INSTANCE GENERATION; INSTANCE GENERATOR; TIMETABLING; TIMETABLING PROBLEM;

DATA MINING; OPERATIONS RESEARCH; OPTIMIZATION;

SCHEDULING;

EID: 84880072694     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.2013.1169     Document Type: Article

References (46)

1. Achlioptas D, Naor A, Peres Y (2005) Rigorous location of phase transitions in hard optimization problems. Nature 435(7043):759-764. (Pubitemid 40839720)
2. Anderson R (2002) The role of experiment in the theory of algorithms. Goldwasser MH, Johnson DS, McGeoch CC, eds. Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, Vol. 59 (American Mathematical Society, Providence, RI), 191-196.
3. Ariyawansa KA, Felt AJ (2004) On a new collection of stochastic linear programming test problems. INFORMS J. Comput. 16(3):291-299. (Pubitemid 39253172)
4. Bartz-Beielstein T, Parsopoulos KE, Vrahatis MN (2004) Design and analysis of optimization algorithms using computational statistics. Appl. Numer. Anal. Comput. Math. 1(2):413-433.
5. Bartz-Beielstein T, Chiarandini M, Paquete L, Preuss M, eds. (2010) Experimental Methods for the Analysis of Optimization Algorithms (Springer, Berlin).
6. Beasley JE (1990) OR-Library: Distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11):1069-1072.
7. Beyrouthy C, Burke EK, McCollum B, McMullan P, Parkes AJ (2008) Enrollment generators, clustering and chromatic numbers. Proc. 7th Internat. Conf. Practice and Theory of Automated Timetabling (PATAT 2008) (University of Nottingham, Nottingham, UK).
8. Breiman L (1984) Classification and Regression Trees (Chapman & Hall/CRC, Boca Raton, FL).
9. Brélaz D (1979) New methods to color the vertices of a graph. Commun. ACM 22:251-256. (Pubitemid 9452014)
10. Burke EK, Marecek J, Parkes AJ, Rudová H (2010a) Decomposition, reformulation, and diving in university course timetabling. Comput. Oper. Res. 37(3):582-597.
11. Burke EK, Marecek J, Parkes AJ, Rudová H (2010b) A supernodal formulation of vertex colouring with applications in course timetabling. Ann. Oper. Res. 179(1):105-130.
12. Corne D, Reynolds A (2011) Optimisation and generalisation: Footprints in instance space. Parallel Problem Solving from Nature-PPSN XI. Lecture Notes in Computer Science, Vol. 6239 (Springer, Berlin), 22-31.
13. Culberson J (2001) Hidden solutions, tell-tales, heuristics and antiheuristics. Hoos H, Stuëtzle T, eds. IJCAI-01 Workshop on Empirical Methods in Artificial Intelligence (Morgan Kaufmann Publishers, Palo Alto, CA), 9-14.
14. Erdos P, Rényi A, Sós VT (1966) On a problem of graph theory. Studia Sci. Math. Hungarica 1(215-235).
15. Gaspero LD, McCollum B, Schaerf A (2007) The Second International Timetabling Competition (ITC-2007): Curriculum-based course timetabling (Track 3). Technical report, University of Udine, Udine, Italy. http://www.cs.qub.ac. uk/itc2007/curriculmcourse/report/curriculumtechreport.pdf.
16. Gehrke J (2003) The Handbook of Data Mining (Lawrence Erlbaum, Hillsdale, NJ), 3-24.
17. Hall N, Posner M (2010) The generation of experimental data for computational testing in optimization. Bartz-Beielstein T, Chiarandini M, Paquete L, Preuss M, eds. Experimental Methods for the Analysis of Optimization Algorithms (Springer, Berlin), 73-101.
18. Hall NG, Posner ME (2001) Generating experimental data for computational testing with machine scheduling applications. Oper. Res. 49(6):854-865. (Pubitemid 34271873)
19. Hall NG, Posner ME (2007) Performance prediction and preselection for optimization and heuristic solution procedures. Oper. Res. 55(4):703-716. (Pubitemid 351159551)
20. Hill RR, Reilly CH (2000) The effects of coefficient correlation structure in two-dimensional knapsack problems on solution procedure performance. Management Sci. 46(2):302-317. (Pubitemid 30594354)
21. Hooker JN (1995) Testing heuristics: We have it all wrong. J. Heuristics 1(1):33-42.
22. Johnson DS (2002) A theoretician's guide to the experimental analysis of algorithms. Goldwasser MH, Johnson DS, McGeoch CC, eds. Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, Vol. 59 (American Mathematical Society, Providence, RI), 215-250.
23. Koehler GJ (2007) Conditions that obviate the no-free-lunch theorems for optimization. INFORMS J. Comput. 19(2):273-279.
24. Kohonen T (2002) The self-organizing map. Proc. IEEE 78(9):1464-1480.
25. Kostuch P, Socha K (2004) Hardness prediction for the university course timetabling problem. Gottlieb J, Raidl GR, eds. Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science, Vol. 3004 (Springer, Berlin), 135-144.
26. Leyton-Brown K, Nudelman E, Shoham Y (2009) Empirical hardness models: Methodology and a case study on combinatorial auctions. J. ACM 56(4):1-52.
27. Lopes L (2010) The O.R. tree. OR/MS Today 37(5):18-20.
28. Lougee-Heimer R (2000) The common optimization interface for operations research. IBM J. Res. Development 47(1):57-66.
29. McGeoch CC, Amherst MA (2002) A bibliography of algorithm experimentation. Goldwasser MH, Johnson DS, McGeoch CC, eds. Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, Vol. 59 (American Mathematical Society, Providence, RI), 251-257.
30. Monasson R, Zecchina R, Kirkpatrick S, Selman B, Troyansky L (1999) Determining computational complexity from characteristic "phase transitions." Nature 400(6740):133-137. (Pubitemid 29327535)
31. Moret BME (2002) Towards a discipline of experimental algorithmics. Goldwasser MH, Johnson DS, McGeoch CC, eds. Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, Vol. 59 (American Mathematical Society, Providence, RI), 197-214.
32. Müller T (2009) ITC2007 solver description: A hybrid approach. Ann. Oper. Res. 172(1):429-446.
33. Nonobe K, Ibaraki T (2001) An improved tabu search method for the weighted constraint satisfaction problem. INFOR: Inform. Systems Oper. Res. 39(2):131-151. (Pubitemid 32496035)
34. Quinlan JR (2003) C4.5: Programs for Machine Learning (Morgan Kaufmann, San Francisco).
35. R Development Core Team (2010) R: A language and environment for statistical computing. R Foundation for Statistical Computing. http://www.R-project.org.
36. Reilly CH (2009) Synthetic optimization problem generation: Show us the correlations! INFORMS J. Comput. 21(3):458-467.
37. Shawe-Taylor J, Cristianini N (2000) Support Vector Machines (Cambridge University Press, Cambridge, UK).
38. Smith-Miles K, Lopes L (2011) Generalising algorithm performance in instance space: A timetabling case study. Coello Coello CA, ed. Learning and Intelligent Optimization, Lecture Notes in Computer Science, Vol. 6683 (Springer, Berlin), 524-539.
39. Smith-Miles K, Lopes L (2012) Measuring instance difficulty for combinatorial optimization problems. Comput. Oper. Res. 39(5): 875-889.
40. Smith-Miles K, Tan TT (2012) Measuring algorithm footprints in instance space. Conf. Evolutionary Comput. (IEEE Press, Piscataway, NJ), 1-8.
41. Smith-Miles KA, van Hemert J (2011) Discovering the suitability of optimisation algorithms by learning from evolved instances. Ann. Math. Artificial Intelligence 61(2):87-104.
42. Taillard ED (1995) Comparison of iterative searches for the quadratic assignment problem. Location Sci. 3(2):87-105.
43. Thain D, Tannenbaum T, Livny M (2005) Distributed computing in practice: The Condor experience. Concurrency-Practice and Experience 17(2-4):323-356. (Pubitemid 40285781)
44. Tuson AL, Harrison SA (2005) Problem difficulty of real instances of convoy planning. J. Oper. Res. Soc. 56:763-775. (Pubitemid 40819933)
45. Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans. Evolutionary Comput. 1(1):67-82. (Pubitemid 127771019)
46. Wood DR (1997) An algorithm for finding a maximum clique in a graph. Oper. Res. Lett. 21(5):211-217. (Pubitemid 127437871)