How To Understand The Theory Of Network Routing In A Computer Program

Transcription

1 Curriculum Vitae Dr. Enrico Bartolini Department of Science and Methods for Engineering (DISMI) University of Modena and Reggio Emilia Via Amendola 2, Pad. Morselli, 42122, Reggio Emilia, Italy EDUCATION Ph.D. in Computer Science University of Bologna, Department of Computer Science, Bologna, Italy Thesis: Algorithms for network design and routing problems Date: April 2009 Supervisor: Prof. V. Maniezzo M.Sc. in Computer Science University of Bologna, C.d.L. in Scienze dell Informazione, Cesena, Italy (Final mark: 110/110, cum laude) Thesis: Algoritmi Euristici per il Network Design (in Italian) Date: October 2005 RESEARCH POSITIONS 01/2013 present Research fellow DISMI, University of Modena and Reggio Emilia, Italy Supervisor: Prof. M. Dell Amico 01/ /2012 Research fellow Department of Mathematics, University of Bologna, Italy 01/ /2011 Post-doctoral fellow HEC Montréal, and CIRRELT, Montréal, Canada Supervisors: Prof. G. Laporte and Prof. J.-F. Cordeau 02/ /2009 Research fellow Department of Mathematics, University of Bologna, Italy RESEARCH GRANTS & CONTRACTS Research project with Polo scientifico-didattico di Cesena, University of Bologna (11/ /2006). Title of the project: Ottimizzazione di reti tecnologiche ; 1

2 Member of the research project PRIN 2008 of the MIUR (Italian National Research Programme Strategic Projects). Title of the project Models and Algorithms for Combinatorial Optimization Problems in Transportation and Logistic Systems. RESEARCH VISITS 06/ /2008 Visiting Ph.D. student CIRRELT, Montréal, Canada Supervised by Prof. J.-F. Cordeau 22 29/11/2009 Visiting researcher AOC Team, LIPN - Laboratoire d Informatique de Paris-Nord Institut Galilee, Université Paris 13, Villetaneuse, France Supervised by Prof. R. Wolfler Calvo RESEARCH INTERESTS Enrico Bartolini s research is in Operations Research, and Combinatorial Optimization. His main interests are in the study of both exact, and heuristic methods for the solution of structured integer linear programming problems. He is particularly interested in the study and development of lower bounds, and exact solution algorithms that are based on column generation and decomposition methods, and their integration with dynamic programming, and cutting plane methods. From an application viewpoint, he devoted major attention to problems arising in the context of logistics, distribution management, and telecommunications such as capacitated vehicle routing problems (both node routing, and arc routing problems), and network design problems. Enrico Bartolini is author of several scientific papers in international journals including Mathematical Programming and Operations Research. PUBLICATIONS [1] Bartolini E., J.-F. Cordeau, and G. Laporte, An exact algorithm for the capacitated arc routing problem with deadheading demand, Operations Research, 2013, 61: [2] Bartolini E., J.-F. Cordeau, and G. Laporte, Improved lower bounds and exact algorithm for the capacitated arc routing problem, Mathematical Programming, Ser. A, 2013, 137: [3] Baldacci R., E. Bartolini, A. Mingozzi, and A. Valletta, An exact algorithm for the period vehicle routing problem, Operations Research, 2011, 59:

3 [4] Baldacci R., E. Bartolini, and A. Mingozzi, An exact algorithm for the pickup and delivery problem with time windows, Operations Research, 2011, 59: [5] Baldacci R., E. Bartolini, A. Mingozzi, and R. Roberti, An Exact Framework for a Broad Class of Vehicle Routing Problems, Computational Management Science, 2010, 7: [6] Baldacci R., E. Bartolini, and G. Laporte, Some applications of the generalized vehicle routing problem, Journal of the Operational Research Society, 2010, 61: [7] Bartolini E. and A. Mingozzi, Algorithms for the non-bifurcated network design problem, Journal of Heuristics, 2009, 15: [8] Bartolini E., V. Maniezzo, and A. Mingozzi. An adaptive memory-based approach based on partial enumeration. In V. Maniezzo, R. Battiti, and J.-P. Watson, editors, Learning and Intelligent Optimization, Lecture Notes in Computer Science. Springer Berlin / Heidelberg, WORKING PAPERS & TECHNICAL REPORTS [9] Bartolini E., and A. Mingozzi, The Single Vehicle Dial-A-Ride Problem, Submitted for publication. THESES [11] Bartolini E., Algorithms for Network Design and Routing Problems (PhD Thesis), Technical Report UBLCS , Department of Computer Science, University of Bologna, March Available online at [12] Bartolini E., Algoritmi Euristici per il Network Design (MsC Thesis, in Italian), ALMA MATER STUDIORUM, Universitá di Bologna, Sede di Cesena, Facoltá di Scienze Matematiche, Fisiche e Naturali, Corso di Laurea in Scienze dell Informazione, Anno Accademico , II sessione. PARTICIPATION TO CONFERENCES & WORKSHOPS 21st International Symposium on Mathematical Programming, August 2012, Berlin, Germany. The Single Vehicle Dial-A-Ride Problem. 3

4 VEROLOG 2012: The first meeting of the EURO working Group on Vehicle Routing and Logistics Optimization, June 2012, Bologna, Italy. An exact algorithm for the capacitated arc routing problem with deadheading demand. Optimization Days, 2 4 May 2011, HEC Montréal, Canada. Improved lower bounds for the capacitated arc routing problem. XL Annual Conference of the Italian Operational Research Society, 8 11 September 2009, Siena, Italy. The Split Delivery Vehicle Routing Problem. 20th International Symposium on Mathematical Programming, August 2009, Chicago, Illinois. An exact algorithm for the pickup and delivery problem with time windows. 23rd European Conference on Operational Research, 5 8 July 2009, Bonn, Germany. An exact algorithm for the pickup and delivery problem with time windows. XXXIX Annual Conference of Italian Operational Research Society, 8 11 September 2008, Ischia, Italy. An exact algorithm for the pickup and delivery problem with time windows. LION 2007 II, Learning and Intelligent Optimization, 8 12 December 2007, Trento, Italy. An Adaptive Memory-Based Approach Based on Partial Enumeration. Matheuristics 2006, August 2006, Bertinoro, Italy. Heuristic Algorithms for the Non-Bifurcated Network Design Problem. ORGANIZATION ACTIVITIES Member of local organization committee: Matheuristics 2008: 2nd Workshop on Mathematical Contributions to Metaheuristics, June 2008, University of Bologna Residential Center, Bertinoro, Italy. PROFESSIONAL ACTIVITIES Reviewer for Operations Research, Transportation Science, European Journal of Operational Research, Discrete Applied Mathematics, Operations Research Letters, EURO Journal on Transportation and Logistics, International Transactions in Operational Research, Networks. 4

5 TEACHING AY 2009/2010 Module-lecturer for the course Combinatorial Optimization (Prof. A. Mingozzi) University of Bologna, C.d.L. in Scienze dell Informazione, Cesena, Italy. AY 2006/2007 AY 2006/2007 AY 2007/2008 Teaching Assistant for the course Operations Research I (Prof. A. Mingozzi) University of Bologna, C.d.L. in Scienze dell Informazione, Cesena, Italy. Teaching Assistant for the course Algorithms and Data Structures (Prof. V. Maniezzo) University of Bologna, C.d.L. in Informatica, Bologna, Italy. TECHNICAL SKILLS Programming: C, C++, Fortran 77 Optimization Tools: CPLEX Text editing: LATEX LANGUAGES Italian English Mother tongue Fluent 5