Full Professor

Professor of Operations Research at the University of Calabria (Unical), Italy. He was Assistant Professor of Operations Research at Unical from 1995 to 1998 and Associate Professor of Operations Research at the University of Lecce from 1998 to 2001; Post-doctoral Research Associate, at the Operations Research Department of Stanford University, USA (6-8/1992) and Visiting Scientist at the Laboratory for Information and Decision Systems, MIT, Cambridge, USA. His major research interests are in logistics and network optimization. He has published more than 50 papers in a variety of journals. He is coauthor of six books on logistics and operations research. He has been involved in several international research projects.

Beraldi, P., Bruni, M.E., Laganà, D., Musmanno, R. - The risk-averse traveling repairman problem with profits, Soft Computing, 2019, 23(9), pp. 2979-2993
An integrated algorithm for shift scheduling problems for local public transport companies, Ciancio, C., Laganà, D., Musmanno, R., Santoro, F. 2018 Omega, United Kingdom, 75, pp. 1339-1351
F. Longo, A. Chiurco, R. Musmanno, L. Nicoletti, Operative and procedural cooperative training in marine ports, Journal of Computational Science, 10 (2015) 97-107
J-F. Cordeau, D. Laganà, R. Musmanno, F. Vocaturo, A decomposition-based heuristic for the multiple-product inventory-routing problem, Computers and Operations Research, 55 (2015) 53–166
C. Ciancio, C. Varrese, G. Ambrogio, L. Filice, R. Musmanno, A multi-ob ective op-timization of a porthole die extrusion for quality and sustainability issues, Key Engineering Materials Vols. 622-623 (2014), 79- 86 - Trans Tech Publications, Switzerland

• Arc Routing Problems
Combinatorial optimization problems in which a fl eet of vehicles must be routed over a logistics network, where required links must be serviced while minimizing the total transportation cost.
• General Routing Problems
Combinatorial optimization problems in which a fl eet of vehicles must be routed over a logistics network, where required links and vertices must be serviced while minimizing the total transportation cost.
• Inventory Routing Problems
Combinatorial problems arising in the context of the Vendor Managed Inventory (VMI) system, in which the vendor decides on the best replenishment policy of the customers by avoiding stock-out, while respecting their maximum inventory capacity and minimizing the total transportation and inventory cost.

Several topics are currently available. Interested students are suggested to drop by during office hours.