Publications of Marco Chiarandini

Journals

M. Chiarandini, L. Di Gaspero, S. Gualandi, A. Schaerf (2012). The balanced academic curriculum problem revisited. Journal of Heuristics, vol. 18, no. 1, pp. 119-148. [ bib | DOI ]

N. H. Kjeldsen, M. Chiarandini (2012). Heuristic solutions to the long-term unit commitment problem with cogeneration plants. Computers & Operations Research, vol. 39, no. 2, pp. 269-282. [ bib | DOI ]

J. Bang-Jensen, M. Chiarandini, P. Morling (2010). A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation. Networks, vol. 55, no. 4, pp. 299 - 325. Supplementary material available at http://www.imada.sdu.dk/~marco/e12aug/. Preliminary version available as Tech. Rep. DMF-2007-07-005 at The Danish Mathematical Society. [ bib | DOI | .pdf ]

M. Chiarandini, I. S. Kotsireas, C. Koukouvinos, L. Paquete (2008). Heuristic algorithms for Hadamard matrices with two circulant cores. Theoretical Computer Science, vol. 407, pp. 274-277. Code http://www.imada.sdu.dk/~marco/Hadamards/ts.c. [ bib | DOI ]

M. Chiarandini, T. Stützle (2007). Stochastic local search algorithms for graph set T-colouring and frequency assignment. Constraints, vol. 12, no. 3, pp. 371-403. [ bib | DOI ]

D. Basso, M. Chiarandini, L. Salmaso (2007). Synchronized permutation tests in IxJ designs. Journal of Statistical Planning and Inference, vol. 137, no. 8, pp. 2564-2578. [ bib | DOI ]

M. Chiarandini, M. Birattari, K. Socha, O. Rossi-Doria (2006). An effective hybrid algorithm for university course timetabling. Journal of Scheduling, vol. 9, no. 5, pp. 403-432. [ bib | DOI ]

L. Bianchi, M. Birattari, M. Chiarandini, M. Manfrin, M. Mastrolilli, L. Paquete, O. Rossi-Doria, T. Schiavinotto (2006). Hybrid metaheuristics for the vehicle routing problem with stochastic demand. Journal of Mathematical Modelling and Algorithms, vol. 5, no. 1, pp. 91-110. [ bib | DOI ]

Book Chapters and Post-Conference Proceedings

T. Bartz-Beielstein, M. Chiarandini, L. Paquete, M. Preuss (2010). Introduction. In T. Bartz-Beielstein, M. Chiarandini, L. Paquete, M. Preuss (Eds.), Experimental Methods for the Analysis of Optimization Algorithms, pp. 1-14, Springer, Germany. [ bib | DOI ]

M. Chiarandini, Y. Goegebeur (2010). Mixed models for the analysis of optimization algorithms. In T. Bartz-Beielstein, M. Chiarandini, L. Paquete, M. Preuss (Eds.), Experimental Methods for the Analysis of Optimization Algorithms, pp. 225-264, Springer, Germany. Preliminary version available as Tech. Rep. DMF-2009-07-001 at the The Danish Mathematical Society. [ bib | DOI | http ]

M. Chiarandini, I. Dumitrescu, T. Stützle (2008). Very large-scale neighborhood search: Overview and case studies on coloring problems. In C. Blum, M. J. Blesa, A. Roli, M. Sampels (Eds.), Hybrid Metaheuristics, vol. 114 of Studies in Computational Intelligence, pp. 117-150, Springer. [ bib | DOI ]

M. Chiarandini, I. Dumitrescu, T. Stützle (2007). Stochastic local search algorithms for the graph colouring problem. In T. F. Gonzalez (Ed.), Handbook of Approximation Algorithms and Metaheuristics, Computer & Information Science Series, pp. 63.1-63.17, Chapman & Hall/CRC, Boca Raton, FL, USA. Preliminary version available as Tech. Rep. AIDA-05-03 at Intellectics Group, Computer Science Department, Darmstadt University of Technology, Darmstadt, Germany. [ bib | .pdf ]

L. Paquete, M. Chiarandini, T. Stützle (2004). Pareto local optimum sets in the biobjective traveling salesman problem: An experimental study. In X. Gandibleux, M. Sevaux, K. Sörensen, V. T'kindt (Eds.), Metaheuristics for Multiobjective Optimisation, vol. 535 of Lecture Notes in Economics and Mathematical Systems, pp. 177-200, Springer Verlag, Berlin, Germany. [ bib ]

O. Rossi-Doria, M. Samples, M. Birattari, M. Chiarandini, M. Dorigo, L. Gambardella, J. Knowles, M. Manfrin, M. Mastrolilli, B. Paechter, L. Paquete, T. Stützle (2003). A comparison of the performance of different metaheuristics on the timetabling problem. In E. Burke, P. Causmaecker (Eds.), Practice and Theory of Automated Timetabling, vol. 2740 of Lecture Notes in Computer Science, pp. 329-351, Springer. [ bib | DOI ]

Editorial Work

L. D. Andersen, J. Bang-Jensen, J. Bárat, M. Chiarandini, T. R. Jensen, L. K. Jørgensen, M. Kriesell, A. S. Pedersen, B. Toft (Eds.) (2010). Special issue dedicated to Carsten Thomassen on his 60th birthday, vol. 310 of Discrete Mathematics. [ bib | DOI ]

T. Bartz-Beielstein, M. Chiarandini, L. Paquete, M. Preuss (Eds.) (2010). Experimental Methods for the Analysis of Optimization Algorithms. Springer, Germany. [ bib | DOI | http ]

T. Bartz-Beielstein, M. Chiarandini, L. Paquete, M. Preuss (Eds.) (2010). Proceedings of the Workshop on Experimental Methods for the Assessment of Computational Systems, Krakow, Poland. Algorithm Engineering Reports, TR10-2-007, Technische Universität Dortmund, Germany. [ bib | http ]

L. Paquete, M. Chiarandini, D. Basso (Eds.) (2006). Empirical Methods for the Analysis of Algorithms, Workshop EMAA 2006, Online Proceedings, Reykjavik, Iceland. (47 pp). [ bib | .html ]

Theses

M. Chiarandini (2005). Stochastic local search methods for highly constrained combinatorial optimisation problems. Ph.D. thesis, Computer Science Department, Darmstadt University of Technology, Darmstadt, Germany. [ bib | .pdf ]

M. Chiarandini (2000). Un sistema per la pianificazione dei turni del personale di un'azienda mediante tecniche di ricerca locale. Master's thesis, Università degli Studi di Udine, Dipartimento di Ingegneria Elettrica, Gestionale e Meccanica. Supervisors: Prof. Andrea Schaerf and Dr. Fabio Tiozzo. (In Italian). [ bib ]

Conference Proceedings

M. Chiarandini, R. Fagerberg, S. Gualandi (2012). Towards fair and efficient assignments of students to projects. In Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling (PATAT2012), pp. 388-390. Extended abstract. [ bib | .pdf ]

M. Chiarandini, G. Galbiati, S. Gualandi (2011). Efficiency issues in the RLF heuristic for graph coloring. In L. D. Gaspero, A. Schaerf, T. Stützle (Eds.), Proceedings of the 9th Metaheuristics International Conference, MIC 2011, pp. 461-469, Dipartimento di Ingegneria Elettrica, Gestionale e Meccanica, Università di Udine, Udine, Italy. Source code available at http://www.imada.sdu.dk/~marco/gcp/rlf. [ bib | .pdf ]

A. Helmar, M. Chiarandini (2011). A local search heuristic for chromatic sum. In L. D. Gaspero, A. Schaerf, T. Stützle (Eds.), Proceedings of the 9th Metaheuristics International Conference, MIC 2011, pp. 161-170, Dipartimento di Ingegneria Elettrica, Gestionale e Meccanica, Università di Udine, Udine, Italy. [ bib | .pdf ]

A. Schaerf, M. Chiarandini, L. Di Gaspero (2010). Modelling and solving the generalised balanced academic curriculum problem with heterogeneous classes. In Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling (PATAT2010), pp. 547-550. Extended abstract. [ bib | .pdf ]

M. Chiarandini, T. Stützle (2010). An analysis of heuristics for vertex colouring. In P. Festa (Ed.), Experimental Algorithms, Proceedings of the 9th International Symposium, (SEA 2010), vol. 6049 of Lecture Notes in Computer Science, pp. 326-337, Springer. Supplementary material and source code available at http://www.imada.sdu.dk/~marco/gcp-study/. [ bib | DOI ]

M. Chiarandini (2010). Learning decision trees for the analysis of optimization heuristics. In C. Blum, R. Battiti (Eds.), Proceedings of Learning and Intelligent Optimization (LION 2010), vol. 6073 of Lecture Notes in Computer Science, pp. 208-211, Springer. [ bib | DOI ]

C. Fawcett, H. H. Hoos, M. Chiarandini (2009). An automatically configured modular algorithm for post enrollment course timetabling. In F. Hutter, M. A. M. de Oca (Eds.), Doctoral Symposium on Engineering Stochastic Local Search Algorithms, Technical Report Series, pp. 16-20, IRIDIA, Université Libre de Bruxelles, Brussels, Belgium. [ bib | .pdf ]

M. Chiarandini, C. Fawcett, H. H. Hoos (2008). A modular multiphase heuristic solver for post enrolment course timetabling. In Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling, pp. 1-6, Montréal. [ bib | .pdf ]

J. Bang-Jensen, M. Chiarandini, Y. Goegebeur, B. Jørgensen (2007). Mixed models for the analysis of local search components. In T. Stützle, M. Birattari, H. Hoos (Eds.), Proceedings of the first International Workshop on Engineering Stochastic Local Search Algorithms (SLS 2007), vol. 4638 of Lecture Notes in Computer Science, pp. 91-105, Springer. [ bib | DOI ]

M. Chiarandini, T. Stützle, K. Larsen (2006). Colour reassignment in tabu search for the graph set T-colouring problem. In F. Almeida, J. M. Moreno, M. Pérez (Eds.), Proceedings of the third International Workshop on Hybrid Metaheuristics (HM 2006), vol. 4030 of Lecture Notes in Computer Science, pp. 162-177, Springer Verlag, Berlin, Germany. [ bib | DOI ]

L. Di Gaspero, M. Chiarandini, A. Schaerf (2006). A study on the short-term prohibition mechanisms in tabu search. In G. Brewka, S. Coradeschi, A. Perini, P. Traverso (Eds.), Proc. of the 17th European Conference on Artificial Intelligence (ECAI2006), pp. 83-87, IOS Press. [ bib | .pdf ]

M. Chiarandini, D. Basso, T. Stützle (2005). Statistical methods for the comparison of stochastic optimizers. In K. D. et al. (Ed.), MIC2005: The Sixth Metaheuristics International Conference, pp. 189-196, Vienna, Austria. [ bib | .pdf ]

L. Bianchi, M. Birattari, M. Chiarandini, M. Manfrin, M. Mastrolilli, L. Paquete, O. Rossi-Doria, T. Schiavinotto (2004). Metaheuristics for the vehicle routing problem with stochastic demand. In Y. X. et al. (Ed.), Parallel Problem Solving from Nature - PPSN VIII, vol. 3242 of Lecture Notes in Computer Science, pp. 450-460, Springer, Berlin, Germany. [ bib | DOI ]

M. Chiarandini, T. Stützle (2002). An application of iterated local search to graph coloring. In D. S. Johnson, A. Mehrotra, M. Trick (Eds.), Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, pp. 112-125, Ithaca, New York, USA. [ bib | .pdf ]

M. Chiarandini, A. Schaerf, F. Tiozzo (2000). Solving employee timetabling problems with flexible workload using tabu search. In E. Burke, W. Erben (Eds.), Proceedings of the 3th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2000, pp. 298-302, Konstanz, Germany. [ bib | .pdf ]

Technical Reports

M. Birattari, M. Chiarandini, M. Saerens, T. Stützle (2011). Learning graphical models for parameter tuning. Tech. Rep. TR/IRIDIA/2011-002, IRIDIA, Université Libre de Bruxelles, Brussels, Belgium. [ bib | .pdf ]

M. Chiarandini, F. Mascia (2010). A hash function breaking symmetry in partitioning problems and its application to tabu search for graph coloring. Tech. Rep. TR/IRIDIA/2010-025, IRIDIA, Université Libre de Bruxelles, Brussels, Belgium. [ bib | .pdf ]

M. Chiarandini, L. Paquete, M. Preuss, E. Ridge (2007). Experiments on metaheuristics: Methodological overview and open issues. Tech. Rep. DMF-2007-03-003, The Danish Mathematical Society, Denmark. [ bib | .pdf ]

L. Bianchi, M. Birattari, M. Chiarandini, M. Manfrin, M. Mastrolilli, L. Paquete, O. Rossi-Doria (2004). Research on the vehicle routing problem with stochastic demand. Tech. Rep. IDSIA-07-04, Istituto Dalle Molle di Studi sull'Intelligenza Artificiale, Lugano, Switzerland. [ bib | .pdf ]

M. Risler, M. Chiarandini, L. Paquete, T. Schiavinotto, T. Stützle (2004). An algorithm for the car sequencing problem of the ROADEF 2005 challenge. Tech. Rep. AIDA-04-06, Intellectics Group, Computer Science Department, Darmstadt University of Technology. [ bib | .pdf ]

M. Chiarandini, K. Socha, M. Birattari, O. Rossi-Doria (2003). International timetabling competition. A hybrid approach. Tech. Rep. AIDA-03-04, Intellectics Group, Computer Science Department, Darmstadt University of Technology, Darmstadt, Germany. [ bib | .pdf ]

M. Chiarandini, I. Dumitrescu, T. Stützle (2003). Local search for the graph colouring problem. A computational study. Tech. Rep. AIDA-03-01, Intellectics Group, Computer Science Department, Darmstadt University of Technology, Darmstadt, Germany. [ bib | .pdf ]

M. Chiarandini, T. Stützle (2002). Experimental evaluation of course timetabling algorithms. Tech. Rep. AIDA-02-05, Intellectics Group, Computer Science Department, Darmstadt University of Technology, Darmstadt, Germany. [ bib | .pdf ]

Abstracts

M. Chiarandini (2012). Planning in education: Some challenging scheduling problems. In EU/MEeting 2012: Metaheuristics for global challenges, Technical University of Denmark (DTU), Copenhagen. Slides ./Files/eume2012.pdf. [ bib | .pdf ]

M. Chiarandini, N. Kjeldsen, N. Nepomuceno (2012). Benders decomposition for an integrated biomass logistics problem. In Third International Conference on Computational Sustainability (CompSust'12). [ bib | .pdf ]