English

Francesco Carrabs
Curriculum Vitæ
Í
Department of Mathematics, University of Salerno
Via Giovanni Paolo II 132, 84084, Fisciano
T +39 089963326
u +39 089963303
B [email protected]
http://www.dipmat2.unisa.it/people/carrabs/www/
Orcid ID: http://orcid.org/0000-0003-2187-8624
Personal Information
Name: Francesco Carrabs
Born: Atripalda in 1976
Nationality: Italian
Languages: Italian, English
Current Assistant Professor in Operations Research, from December 2008, at the Department
Position: of Mathematics, University of Salerno.
Professional Experience
From December Researcher in Operations Research at the Department of Mathematics and Computer
2008 Science, University of Salerno.
2007-2008 Postdoctoral fellow at the Department of Mathematics and Computer Science,
University of Salerno. Research and teaching related to Operations Research.
March 2006 - Cooperation agreement with the Department of Statistics, Probability, and Applied
July 2006 Statistics of University of Rome “Sapienza”. Supervisor: Paolo Dell’Olmo.
October 2006 - Postdoctoral internship at the HEC Montréal (Canada Research Chair in Logistics
March 2007 and Transportation). Supervisor: Jean-François Cordeau.
October 2005 - Visiting scholar at the CRT (Centre de recherche sur les transports), University of
December 2005 Montréal, Canada. Supervisors: Gilbert Laporte and Jean-François Cordeau.
October 2004 - Visiting scholar at the CRT, University of Montréal, Canada. Supervisors: Gilbert
May 2005 Laporte and Jean-François Cordeau.
Education
2002-2005 Ph.D. in Computer Science at the DIA, University of Salerno. Supervisor R.Cerulli.
Thesis: Heuristics and exact approaches for transportation problems with pickup
and delivery.
25 July 2002 Laurea cum laude in Computer Science, University of Salerno. Supervisor R.Cerulli.
Thesis: Shortest Path Tree problem: new data structures and caliber heuristic.
Conferences and Seminaries
Conferences and Seminaries Talks Given
{ 46th Annual Conference of the Italian Operations Research Society
(AIRO 2016), Trieste, Italy.
- “A Compact Formulation for the Orderly Colored Longest Path Problem”
{ 8th IFAC Conference on Manufacturing Modelling, Management &
Control (MIM 2016), Troyes, France.
- “Extending Lifetime Through Partial Coverage And Roles Allocation in
Connectivity-Constrained Sensor Networks”
{ 4th International Symposium on Combinatorial Optimization (ISCO
2016), Vietri sul Mare, Italy.
- “Exact and heuristic approaches for the maximum lifetime problem in sensor
networks with coverage and connectivity constraints”
{ III Workshop Unical 2015, Cosenza, Italy.
- “A new Discretization Schema for the Close-Enough Traveling Salesman
Problem”
{ 45th Annual Conference of the Italian Operations Research Society
(AIRO 2015), Pisa, Italy.
- “Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem”
{ 8th Winter Conference of the Italian Operations Research Society (AIRO Winter 2015), Champoluc, Italy.
- “A Column Generation Approach for the Maximum Lifetime Wireless Sensor
Network Problems (MLP and α-MLP)”
{ II Workshop Unical 2014, Cosenza, Italy.
“A hybrid exact approach for maximizing lifetime in wireless sensor networks”.
{ I Workshop Unical 2013, Cosenza, Italy.
“Monochromatic Tree Partitioning Problem”.
{ 42th Annual Conference of the Italian Operations Research Society
(AIRO 2011), Brescia. Italy.
- “A genetic algorithm for the weighted feedback vertex set problem”
- “A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback
Vertex Set Problem”.
{ 10th Cologne-Twente Workshop on graphs and combinatorial optimization (CTW2011), Frosinone, Italy.
- “The maximum labeled clique problem”.
{ 41th Annual Conference of the Italian Operations Research Society
(AIRO 2010), Villa San Giovanni, Italy
- “The Monochromatic Set Partitioning problem”.
{ 40th Annual Conference of the Italian Operations Research Society
(AIRO 2009), Siena, Italy.
- “A Branch and Bound algorithm to solve the Double Traveling Salesman problem
with Multiple Stacks”.
{ 38th Annual Conference of the Italian Operations Research Society
(AIRO 2007), Genova, Italy.
- “A Branch and Bound approach for the Minimum Colors Maximum Matching
Problem”.
{ 21th European Conference on Operational Research (EURO 2006), Reykjavik, Iceland.
- “A Cluster-Lightening Route Reduction Strategy for the Vehicle Routing Problem
with Time Windows ”.
{ 37th Annual Conference of the Italian Operations Research Society
(AIRO 2006), Cesena, Italy.
- “A Branch and Bound approach for the Pickup and Delivery Traveling Salesman
Problem with LIFO Loading”
- “Reoptimization and Critical Request Individuation for the VRPTW ”.
{ 2005 Ottobre Seminario presso il Centre de recherche sur les transports, Universitá di Montréal. Canada.
- “Variable Neighborhood Search for the pickup and delivery TSP with LIFO
loading constraint”.
{ 36th Annual Conference of the Italian Operations Research Society
(AIRO 2005), Camerino, Italy.
-“Metaheuristics for the pickup and delivery TSP with LIFO loading constraint”.
{ Optimization Days 2005, Montréal. Canada.
-“Metaheuristics for the pickup and delivery TSP with LIFO loading constraint”.
{ 35th Annual Conference of the Italian Operations Research Society
(AIRO 2004), Lecce, Italy.
-“Efficient Visiting Strategy and Data Structure for SPT Algorithms”.
{ 3th Cologne-Twente Workshop on graphs and combinatorial optimization (CTW 2004), Loveno di Menaggio. Italy.
- “Minimum Weighted Feedback Vertex Set on Diamonds”.
Conferences Attended
{ 44th Annual Conference of the Italian Operations Research Society
(AIRO 2014), Como, Italy.
{ (School) Graph Theory, Algorithms and Applications 2014, Erice, Italy.
{ International Colloquium on Graphs and Optimization (GO IX 2014),
Sirmione, Italy.
{ European Conference on Operational Research (EURO 2013), Roma,
Italy.
{ 43th Annual Conference of the Italian Operations Research Society
(AIRO 2012), Vietri sul Mare, Italy.
{ (School) Graph Theory, Algorithms and Applications 2011, Erice, Italy.
{ (School) Optimization, Machine Learning and Bioinformatics 2010,
Erice, Italy.
{ 13th Combinatorial Optimization Workshop 2009, Aussois, Francia.
{ (School) Graph Theory, Algorithms and Applications 2008, Erice, Italy.
Membership of Organizing Committees
{ Soft Computing Days: a bilateral China-Italy Workshop (2016)
{ 4th International Symposium on Combinatorial Optimization (ISCO 2016)
{ 3rd International School on Mathematics "Guido Stampacchia": Graph Theory,
Algorithms and Applications (2014).
{ 43rd Annual Conference of the Italian Operational Research Society (AIRO 2012).
Membership of Scientific Committees
{ 10th International Workshop on Hybrid Metaheuristics (HM 2016)
{ 4th International Symposium on Combinatorial Optimization (ISCO 2016)
Research Funding
{ ORSA150459 2015, “Euristiche costruttive e sensors networks.”
{ PON01_02705 2014, FIBAC (Fruizione Innovativa dei Beni Artistici e Culturali)
“Progettazione Servizi ed applicazioni per il prototipo Museo Reale.”
{ ORSA142082 2014, “Reti di sensori eterogenee e sottostrutture eterogenee di un
grafo.”
{ POR Campania FESR 2007/2013, WISCH (Work Into Shaping Campania’s
Home) “Strategie di ottimizzazione topologica per la realizzazione di componenti
in additive manifacturing”.
{ ORSA131490 2013, “Problemi di wireless sensor networks.”
{ ORSA128040 2012, “Ottimizzazione su reti di traffico e social network.”
{ Programma Vigoni 2011 (Programma di scambio di ricercatori tra le Istituzioni
universitarie italiane e tedesche), “Sostenibilitá e pianificazione della supply chain
ecologica. Modelli di flusso su grafi e metodi di soluzione.”
{ ORSA114421 2011, “Reti di flusso con capacità variabile nel tempo e problemi di
wireless sensor networks.”
{ ORSA109444 2010, “Problemi di localizzazione e nuovi approcci metaeuristici.”
{ POR Campania, EBuild “Ricerca Industriale e sviluppo competitivo - Metadistretto
ICT ”.
{ ORSA098140 2009, “Problemi di copertura su grafi.”
{ PRIN 2007-2009, “Modelli per il monitoraggio e l’instradamento efficiente del
flusso di merci su reti di trasporto multimodale.”
Educational Financed Projects
A.A. 2015/2016: Teacher of the “Operations Research” course within the Piano Lauree Scientifiche
(PLS). Department of Mathematics, University of Salerno (RS: Prof. Antonio De
Crescenzo)
A.A. 2013/2014: Teacher of the “Operations Research” course within the Piano Lauree Scientifiche
(PLS). Department of Mathematics, University of Salerno (RS: Prof. Antonio De
Crescenzo)
A.A. 2012/2013: Teacher of the “Operations Research” course within the Piano Lauree Scientifiche
(PLS). Department of Mathematics, University of Salerno (RS: Prof. Antonio De
Crescenzo)
A.A. 2011/2012: Teacher of the “Operations Research” course within the Piano Lauree Scientifiche
(PLS). Department of Mathematics, University of Salerno (RS: Prof. Antonio De
Crescenzo)
Institutional Activities
{ From 2014 he is member of the “Monitoraggio e Analisi” committee of the
Department of Mathematics of the University of Salerno.
{ From 2013 he is member of the “Riesame AVA-ANVUR” committee of the
Department of Mathematics of the University of Salerno.
{ From March 2013 he is member of the Board of the Department of Mathematics
of the University of Salerno.
{ A.A. 2013/2014: member of the Ph.D School Board in “Mathematics, Physic and
Applications”, University of Salerno, Cycle: XXIX.
{ A.A. 2012/2013: member of the Ph.D School Board in “Computer Science”,
University of Salerno, Cycle: XXVIII.
{ A.A. 2011/2012: member of the Ph.D School Board in “Computer Science”,
University of Salerno, Cycle: XXVII.
{ A.A. 2009/2010: member of the Ph.D School Board in “Biologia dei Sistemi”,
University of Salerno, Cycle: XXV.
Teaching
Teacher of the following courses at the faculty of SS.MM.FF.NN. of University of
Salerno (1 CFU = 8 hours):
A.A. 2015/2016: { Operations Research, Computer Science (6 CFU);
{ Operations Research, Mathematics, (3 CFU);
{ Optimization, Mathematics, (3 CFU);
A.A. 2014/2015: { Operations Research, Computer Science (6 CFU);
{ Operations Research, Mathematics, (3 CFU);
{ Optimization, Mathematics, (3 CFU);
A.A. 2013/2014: { Operations Research, Computer Science (6 CFU);
{ Operations Research, Mathematics, (3 CFU);
{ Optimization, Mathematics, (3 CFU);
A.A. 2012/2013: { Operations Research, Computer Science (6 CFU);
{ Operations Research, Mathematics, (3 CFU);
{ Operations Research e Logistic, Computer Science, (3 CFU);
A.A. 2011/2012: { Operations Research, Computer Science, (6 CFU);
{ Operations Research, Mathematics, (3 CFU);
{ Operations Research e Logistic, Computer Science, (3 CFU);
A.A. 2010/2011: { Operations Research, Computer Science, (6 CFU);
A.A. 2009/2010: { n◦ 2 courses of Operations Research, Computer Science, (8 CFU);
{ Operations Research 2, Computer Science, (1.5 CFU);
A.A. 2008/2009: { Tutor of the course Operations Research, Computer Science, (6 CFU);
Editorial activity
{ He is guest editor of the special issue “Application-motivated Nonlinear
Programming”, of the Journal of Optimization Theory and Applications.
He acts as referee for various international journals like:
{ 4OR.
{ Computers & Operations Research.
{ Computational Optimization and Applications.
{ European Journal of Operational Research.
{ International Journal of Distributed Sensor Networks.
{ Journal of Ambient Intelligence and Humanized Computing.
{ Journal of Optimization Theory and Applications.
{ Networks.
{ Procedia - Social and Behavioral Sciences.
{ Soft Computing.
{ Transportation Science.
Research
The research activities are focalized on graph problems, with practical applications,
like:
{ Circle Packing: [6];
{ Feedback Vertex Set: [7], [10], [14], [15];
{ Offsetting Inventory Cycle Problem: [25];
{ Labeled Graph Problems: [8], [11], [19], [21], [22];
{ Variants of the Minimum Spanning Tree Problem: [9];[24];
{ Shortest Path Problems: [27], [28], [29];
{ Smart City: [17], [1];
{ Vehicle Routing Problems: [12], [13], [16], [20], [26];
{ Wireless Sensor Network: [3], [4], [5], [18];
Publications
[1] F.Carrabs, R.Cerulli, and A.Sciomachen, “An exact approach for the grocery
delivery problem in urban areas,” Soft Computing, 2016.
[2] F. Carrabs, C. Cerrone, R. Cerulli, and M. Gaudioso, “A novel discretization
scheme for the close enough traveling salesman problem,” Computers & Operations
Research, vol. 78, pp. 163–171, 2017.
[3] F. Carrabs, R. Cerulli, C. D’Ambrosio, and A. Raiconi, “An exact algorithm
to extend lifetime through roles allocation in sensor networks with connectivity
constraints,” Optimization Letters, 2016.
[4] F. Carrabs, R. Cerulli, C. D’Ambrosio, and A. Raiconi, “A hybrid exact approach
for maximizing lifetime in sensor networks with complete and partial coverage
constraints,” Journal of Network and Computer Applications, vol. 58, pp. 12 – 22,
2015.
[5] F. Carrabs, R. Cerulli, C. D’Ambrosio, M. Gentili, and A. Raiconi, “Maximizing
lifetime in wireless sensor networks with multiple sensor families,” Computers &
Operations Research, vol. 60, pp. 121–137, 2015.
[6] F. Carrabs, C. Cerrone, and R. Cerulli, “A tabu search approach for the circle
packing problem,” in 17th International Conference on Network-Based Information
Systems, NBiS 2014, pp. 165–171, 2014.
[7] F. Carrabs, C. Cerrone, and R. Cerulli, “A memetic algorithm for the weighted
feedback vertex set problem,” Networks, vol. 64, no. 4, pp. 339–356, 2014.
[8] F. Carrabs, R. Cerulli, and P. Dell’Olmo, “A mathematical programming approach
for the maximum labeled clique problem,” Procedia - Social and Behavioral Sciences,
vol. 108, pp. 69–78, 2014.
[9] F. Carrabs, R. Cerulli, M. Gaudioso, and M. Gentili, “Lower and upper bounds
for the spanning tree with minimum branch vertices,” Computational Optimization
and Applications, vol. 56, no. 2, pp. 4052–438, 2013.
[10] F. Carrabs, R. Cerulli, M. Gentili, and G. Parlato, “A tabu search heuristic based
on k-diamonds for the weighted feedback vertex set problem,” Lecture Notes in
Computer Science (INOC 2011), vol. 6701, pp. 589–602, 2011.
[11] F. Carrabs, R. Cerulli, and M. Gentili, “The labeled maximum matching problem,”
Computers & Operations Research, vol. 36, pp. 1859–1871, 2009.
[12] F. Carrabs, R. Cerulli, and J.-F. Cordeau, “An additive branch-and-bound algorithm
for the pickup and delivery traveling salesman problem with lifo or fifo loading,”
INFOR, vol. 45(4), pp. 223–238, 2007.
[13] F. Carrabs, J.-F. Cordeau, and G. Laporte, “Variable neighborhood search for
the pickup and delivery traveling salesman problem with lifo loading,” INFORMS
Journal On Computing, vol. 19(4), pp. 618–632, 2007.
[14] F. Carrabs, R. Cerulli, M. Gentili, and G. Parlato, “A linear time algorithm for
the minimum weighted feedback vertex set on diamonds,” Information Processing
Letters, vol. 94(1), pp. 29–35, 2005.
[15] F. Carrabs, R. Cerulli, M. Gentili, and G. Parlato, “Minimum weighted feedback
vertex set on diamonds,” Electronic Notes in Discrete Mathematics, vol. 17, pp. 87–
91, 2004.
[16] F. Carrabs, R. Cerulli, and M. Speranza, “A branch-and-bound algorithm for the
double tsp with two stacks,” Networks, vol. 61, no. 1, pp. 58–75, 2013.
[17] F. Carrabs, R. Cerulli, and A. Sciomachen, “Environmental sustainable fleet planning in b2c e-commerce urban distribution networks,” in Smart City (R. P. Dameri
and C. Rosenthal-Sabroux, eds.), Progress in IS, pp. 183–192, 2014.
Proceeding of Refereed Conferences
[18] F. Carrabs, R. Cerulli, C. D’Ambrosio, and A. Raiconi, “Extending lifetime through
partial coverage and roles allocation in connectivity-constrained sensor networks,”
IFAC-PapersOnLine, vol. 49, no. 12, pp. 973 – 978, 2016. 8th {IFAC} Conference
on Manufacturing Modelling, Management and Control {MIM} 2016,Troyes, France,
28—30 June 2016.
[19] F.Carrabs, R.Cerulli, and P.Dell’Olmo, “The maximum labeled clique problem,” in 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2011), Proceedings of the Conference, pp. 145–149, 2011.
http://ctw2011.dia.uniroma3.it/ctw_proceedings.pdf.
[20] F.Carrabs, R.Cerulli, and M.Gentili, “Random neighborhood selection for the
vehicle routine problem with time windows,” in Proceedings of the Fifth Triennial
Symposium on Transportation Analysis (Tristan V) (M. Gendreau and F. Semet,
eds.), 2004. Guadalupe.
Works Submitted for Publication
[21] C.Cerrone, F.Carrabs, R.Cerulli, and S.Silvestri, “On the complexity of rainbow
spanning forest problem.”.
[22] C.Cerrone, F.Carrabs, R.Cerulli, and S.Silvestri, “The rainbow spanning forest
problem.”.
[23] F.Carrabs, R.Cerulli, C.D’Ambrosio, and A.Raiconi, “Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and
connectivity constraints.”.
[24] F.Carrabs, R.Cerulli, and R.Pentangelo, “A genetic algorithm for minimum spanning
trees problem with conflicting edge pairs.”.
[25] C.Franciosi, F.Carrabs, R.Cerulli, and S.Miranda, “A genetic algorithm for the
offsetting inventory cycle problem to minimize the warehouse space.”.
Technical Reports
[26] F.Carrabs, R.Cerulli, and M.Gentili, “Two improving strategies for the vehicle
routing problem with time windows,” tech. rep., Dept. of Mathematics and
Computer Science, University of Salerno, 2006.
[27] F.Carrabs and R.Cerulli, “Graph generators for spt algorithms,” Tech. Rep. n◦ 15,
Dept. of Mathematics and Computer Science, University of Salerno, 2003.
[28] F.Carrabs and R.Cerulli, “Shortest path tree problem: algorihms and data structures,” Tech. Rep. n◦ 16, Dept. of Mathematics and Computer Science, University of
Salerno, 2003.
[29] F.Carrabs, R.Cerulli, M.Gentili, and F.Maione, “A new genetic algorithm for
multi-source shortest path problem,” Tech. Rep. n◦ 3232, Dept. of Mathematics,
University of Salerno, 2011.
PhD Thesis
[30] F.Carrabs, Heuristics and exact approaches for transportation problems with pickup
and delivery. PhD thesis, Dept. of Mathematics and Computer Science, University
of Salerno, 2006.
Fisciano, 22 novembre 2016
......................................