ARCHETTI Claudia

Claudia Archetti is Associate Professor in Operations Research. She is member of the Operations Management & Operations Research (OMOR) Research Cluster. She teaches Decision Analysis, Optimal Decision Making, Advanced Optimization and Math Refreshing in ESSEC MSc and PhD programs. Prior to joining ESSEC in 2019, she was appointed at the University of Brescia as Assistant Professor in 2005 and as Associate Professor in 2014.

Research interests of Claudia Archetti include models and algorithms for vehicle routing problems; mixed integer mathematical programming models for the minimization of the sum of inventory and transportation costs in logistic networks; exact and heuristic algorithms for supply-chain management; reoptimization of combinatorial optimization problems.

Claudia Archetti has carried out the scientific activity in collaboration with Italian and foreign colleagues and published joint papers with some of the best researchers at the international level.

She is author of more than 60 papers in international journals. She was Area Editor of Computers and Operations Research. She is Associate Editor of Transportation Science and of Networks and member of the Editorial Board of European Journal of Operational Research. She is currently VIP3 of EURO, the Association of European Operational Research Societies, in charge of publications and communication.

Click here for the full list of publications, seminars, conferences and projects.

Click here for Google Scholar profile.

• 2017 : Habilitation as Full Professor in Operations Research from the Italian Ministry of Education (Italian Ministry of Education, Italy)
• 2002 : PhD Degree in Computational Methods for Economic and Financial Decisions and Forecast (Università degli studi di Bergamo, Italy)

Full-time academic appointments

• 2019 - Present : Associate Professor in Operations Research (ESSEC Business School, France)
• 2014 - 2019 : Associate Professor in Operations Research (Università degli Studi di Brescia, Italy)
• 2005 - 2014 : Assistant Professor in Operations Research (Università degli Studi di Brescia, Italy)

• ARCHETTI, C. and BERTAZZI, L. (2021). Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery. Networks, 77(2), pp. 255-268.
• ARCHETTI, C., GUERRIERO, F. and MACRINA, G. (2021). The Online Vehicle Routing Problem with Occasional Drivers. Computers & Operations Research, 127, pp. 105144.
• ARCHETTI, C., GIANFRANCO GUASTAROBA, G., HUERTA-MUNOZ, D.L. and SPERANZA, M.G. (2021). A Kernel Search Heuristic for the Multi-Vehicle Inventory Routing Problem. International Transactions in Operational Research, In press.
• DIABAT, A., ARCHETTI, C. and NAJY, W. (2021). The Fixed-Partition Policy Inventory Routing Problem. Transportation Science, In press.
• ARCHETTI, C., SPERANZA, M.G., BOCCIA, M., SFORZA, A. and STERLE, C. (2020). A Branch-And-Cut Algorithm for the Inventory Routing Problem with Pickups and Deliveries. European Journal of Operational Research, 282(3), pp. 886-895.
• ARCHETTI, C., FEILLET, D., MOR, A. and SPERANZA, M.G. (2020). Dynamic traveling salesman problem with stochastic release dates. European Journal of Operational Research, 280(3), pp. 832-844.
• ARSLAN, O., ARCHETTI, C., JABALI, O., LAPORTE, G. and SPERANZA, M.G. (2020). Minimum Cost Network Design in Strategic Alliances. Omega, 96.
• ARCHETTI, C. and PEIRANO, L. (2020). Air intermodal freight transportation: the freight forwarder service problem. Omega, 94, pp. 102040.
• ANGELELLI, E., ARCHETTI, C. and PEIRANO, L. (2020). A Matheuristic for the Air Transportation Freight Forwarder Service Problem. Computers & Operations Research, 123.
• ARCHETTI, C., SPERANZA, M.G. and EMIRENA GARRAFA, E. (2020). Managing an automated clinical laboratory: Optimization challenges. EURO Journal on Decision Processes, 8, pp. 41-60.
• ARCHETTI, C., COELHO, L.C. and SPERANZA, M.G. (2019). An Exact Algorithm for the Inventory Routing Problem with Logistic Ratio. Transportation Research - Part E: Logistics and Transportation Review, 131, pp. 96-107.
• LARRAIN, H., COELHO, L.C., ARCHETTI, C. and SPERANZA, M.G. (2019). Exact solution methods for the multi-vehicle multi-period vehicle routing problem with due dates. Computers & Operations Research, 110, pp. 148-158.
• ARCHETTI, C., DARVISH, M., COELHO, L.C. and SPERANZA, M.G. (2019). Flexible two-echelon location routing. European Journal of Operational Research, 277(3), pp. 1124-1136.
• DARVISH, M., ARCHETTI, C. and COELHO, L.C. (2019). Trade-offs between environmental and economic performance in production and inventory-routing problems. International Journal of Production Economics, 217, pp. 269-280.
• ARCHETTI, C., FERNÁNDEZ, E. and HUERTA-MUÑOZ, D.L. (2018). A two-phase solution algorithm for the Flexible Periodic Vehicle Routing Problem. Computers & Operations Research, 99, pp. 27-37.
• ARCHETTI, C., FEILLET, D., MOR, A. and SPERANZA, M.G. (2018). An iterated local search for the Traveling Salesman Problem with release dates and completion time minimization. Computers & Operations Research, 98, pp. 24-37.
• ABSI, N., ARCHETTI, C., DAUZÈRE-PÉRÈS, S., FEILLET, D. and SPERANZA, M.G. (2018). Comparing sequential and integrated approaches for the production routing problem. European Journal of Operational Research, 269(2), pp. 633-646.
• ARCHETTI, C., SPERANZA, M.G. and WEYLAND, D. (2018). A simulation study of an on-demand transportation system. International Transactions in Operational Research, 25(4), pp. 1137-1161.
• ARCHETTI, C., CHRISTIANSEN, M. and GRAZIA SPERANZA, M. (2018). Inventory routing with pickups and deliveries. European Journal of Operational Research, 268(1), pp. 314-324.
• ARCHETTI, C., CARRABS, F. and CERULLI, R. (2018). The Set Orienteering Problem. European Journal of Operational Research, 267(1), pp. 264-272.
• BIANCHETTI, L., SQUAZZONI, F., CASNICI, N., BIANCHINI, D., GARRAFA, E., ARCHETTI, C. ... MARENGONI, A. (2017). Social networks and health status in the elderly: the ‘ANZIANI IN-RETE’ population-based study. Aging Clinical and Experimental Research, 29(6), pp. 1173-1179.
• ARCHETTI, C., DESAULNIERS, G. and SPERANZA, M.G. (2017). Minimizing the logistic ratio in the inventory routing problem. EURO Journal on Transportation and Logistics, 6(4), pp. 289-306.
• ARCHETTI, C., BOLAND, N. and SPERANZA, M.G. (2017). A Matheuristic for the Multivehicle Inventory Routing Problem. INFORMS Journal on Computing, 29(3), pp. 377-387.
• ARCHETTI, C., MONTANELLI, A., FINAZZI, D., CAIMI, L. and GARRAFA, E. (2017). Clinical laboratory automation: a case study. Journal of Public Health Research, 6(1).
• ANGELELLI, E., ARCHETTI, C., FILIPPI, C. and VINDIGNI, M. (2017). The probabilistic orienteering problem. Computers & Operations Research, 81, pp. 269-281.
• ARCHETTI, C., FERNÁNDEZ, E. and HUERTA-MUÑOZ, D.L. (2017). The Flexible Periodic Vehicle Routing Problem. Computers & Operations Research, 85, pp. 58-70.
• ARCHETTI, C., BERTAZZI, L., LAGANÀ, D. and VOCATURO, F. (2017). The Undirected Capacitated General Routing Problem with Profits. European Journal of Operational Research, 257(3), pp. 822-833.
• ARCHETTI, C., CAMPBELL, A.M. and SPERANZA, M.G. (2016). Multicommodity vs. Single-Commodity Routing. Transportation Science, 50(2), pp. 461-472.
• ARCHETTI, C., CORBERÁN, , PLANA, I., SANCHIS, J.M. and SPERANZA, M.G. (2016). A branch-and-cut algorithm for the Orienteering Arc Routing Problem. Computers & Operations Research, 66, pp. 95-104.
• ARCHETTI, C. and SPERANZA, M.G. (2016). The inventory routing problem: the value of integration. International Transactions in Operational Research, 23(3), pp. 393-407.
• ARCHETTI, C., SAVELSBERGH, M. and SPERANZA, M.G. (2016). The Vehicle Routing Problem with Occasional Drivers. European Journal of Operational Research, 254(2), pp. 472-480.
• ARCHETTI, C., BIANCHESSI, N., HERTZ, A., COLOMBET, A. and GAGNON, F. (2015). Directed weighted improper coloring for cellular channel allocation. Discrete Applied Mathematics, 182, pp. 46-60.
• ARCHETTI, C., JABALI, O. and SPERANZA, M.G. (2015). Multi-period Vehicle Routing Problem with Due dates. Computers & Operations Research, 61, pp. 122-134.
• ARCHETTI, C., BIANCHESSI, N. and SPERANZA, M.G. (2015). A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem. Computers & Operations Research, 64, pp. 1-10.
• ARCHETTI, C., CORBERÁN, , PLANA, I., SANCHIS, J.M. and SPERANZA, M.G. (2015). A matheuristic for the Team Orienteering Arc Routing Problem. European Journal of Operational Research, 245(2), pp. 392-401.
• NAGY, G., WASSAN, N.A., SPERANZA, M.G. and ARCHETTI, C. (2015). The Vehicle Routing Problem with Divisible Deliveries and Pickups. Transportation Science, 49(2), pp. 271-294.
• ARCHETTI, C., FEILLET, D. and SPERANZA, M.G. (2015). Complexity of routing problems with release dates. European Journal of Operational Research, 247(3), pp. 797-803.
• ABSI, N., ARCHETTI, C., DAUZÈRE-PÉRÈS, S. and FEILLET, D. (2015). A Two-Phase Iterative Heuristic Approach for the Production Routing Problem. Transportation Science, 49(4), pp. 784-795.
• ARCHETTI, C., GUASTAROBA, G. and SPERANZA, M.G. (2014). An ILP-refined tabu search for the Directed Profitable Rural Postman Problem. Discrete Applied Mathematics, 163, pp. 3-16.
• ARCHETTI, C., BIANCHESSI, N., SPERANZA, M.G. and HERTZ, A. (2014). The split delivery capacitated team orienteering problem. Global Networks, 63(1), pp. 16-33.
• ARCHETTI, C., BIANCHESSI, N. and HERTZ, A. (2014). A branch-and-price algorithm for the robust graph coloring problem. Discrete Applied Mathematics, 165, pp. 49-59.
• ARCHETTI, C., BIANCHESSI, N., SPERANZA, M.G. and HERTZ, A. (2014). Incomplete service and split deliveries in a routing problem with profits. Networks, 63(2), pp. 135-145.
• ARBIB, C., SERVILIO, M., ARCHETTI, C. and SPERANZA, M.G. (2014). The directed profitable location Rural Postman Problem. European Journal of Operational Research, 236(3), pp. 811-819.
• ARCHETTI, C., BERTAZZI, L. and SPERANZA, M.G. (2014). Polynomial cases of the economic lot sizing problem with cost discounts. European Journal of Operational Research, 237(2), pp. 519-527.
• ANGELELLI, E., ARCHETTI, C. and VINDIGNI, M. (2014). The Clustered Orienteering Problem. European Journal of Operational Research, 238(2), pp. 404-414.
• ARCHETTI, C., BIANCHESSI, N. and SPERANZA, M.G. (2014). Branch-and-cut algorithms for the split delivery vehicle routing problem. European Journal of Operational Research, 238(3), pp. 685-698.
• ARCHETTI, C., BIANCHESSI, N., IRNICH, S. and SPERANZA, M.G. (2014). Formulations for an inventory routing problem. International Transactions in Operational Research, 21(3), pp. 353-374.
• ARCHETTI, C., SPERANZA, M.G., CORBERÁN, , SANCHIS, J.M. and PLANA, I. (2014). The Team Orienteering Arc Routing Problem. Transportation Science, 48(3), pp. 442-457.
• ARCHETTI, C. and SPERANZA, M.G. (2014). A survey on matheuristics for routing problems. EURO Journal on Computational Optimization, 2(4), pp. 223-246.
• ARCHETTI, C., PISINGER, D. and SPERANZA, M.G. (2014). Special issue on: “matheuristics”. EURO Journal on Computational Optimization, 2(4), pp. 221-222.
• ARCHETTI, C., GUASTAROBA, G. and SPERANZA, M.G. (2013). Reoptimizing the rural postman problem. Computers & Operations Research, 40(5), pp. 1306-1313.
• ARCHETTI, C., BIANCHESSI, N. and SPERANZA, M.G. (2013). Optimal solutions for routing problems with profits. Discrete Applied Mathematics, 161(4-5), pp. 547-557.
• ARCHETTI, C., BIANCHESSI, N. and SPERANZA, M.G. (2013). The capacitated team orienteering problem with incomplete service. Optimization Letters, 7, pp. 1405-1417.
• ARCHETTI, C., DOERNER, K.F. and TRICOIRE, F. (2013). A heuristic algorithm for the free newspaper delivery problem. European Journal of Operational Research, 230(2), pp. 245-257.
• ARCHETTI, C., BERTAZZI, L., HERTZ, A. and SPERANZA, M.G. (2012). A Hybrid Heuristic for an Inventory Routing Problem. INFORMS Journal on Computing, 24(1), pp. 101-116.
• ARCHETTI, C. and SPERANZA, M.G. (2012). Vehicle routing problems with split deliveries. International Transactions in Operational Research, 19(1-2), pp. 3-22.
• GOEL, A., ARCHETTI, C. and SAVELSBERGH, M. (2012). Truck driver scheduling in Australia. Computers & Operations Research, 39(5), pp. 1122-1132.
• CÔTÉ, J.F., ARCHETTI, C., SPERANZA, M.G., GENDREAU, M. and POTVIN, J.Y. (2012). A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. Networks, 60(4), pp. 212-226.
• ARCHETTI, C., BERTAZZI, L., PALETTA, G. and SPERANZA, M.G. (2011). Analysis of the maximum level policy in a production-distribution system. Computers & Operations Research, 38(12), pp. 1731-1746.
• ARCHETTI, C., BIANCHESSI, N. and SPERANZA, M.G. (2011). A column generation approach for the split delivery vehicle routing problem. Networks, 58(4), pp. 241-254.
• ARCHETTI, C., FEILLET, D., GENDREAU, M. and SPERANZA, M.G. (2011). Complexity of the VRP and SDVRP. Transportation Research Part C: Emerging Technologies, 19(5), pp. 741-750.
• ARCHETTI, C., BOUCHARD, M. and DESAULNIERS, G. (2011). Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows. Transportation Science, 45(3), pp. 285-298.
• ARCHETTI, C., BERTAZZI, L. and SPERANZA, M.G. (2010). Reoptimizing the 0–1 knapsack problem. Discrete Applied Mathematics, 158(17), pp. 1879-1887.
• ARCHETTI, C., FEILLET, D., HERTZ, A. and SPERANZA, M.G. (2010). The undirected capacitated arc routing problem with profits. Computers & Operations Research, 37(11), pp. 1860-1869.
• PETERSEN, H.L., ARCHETTI, C. and SPERANZA, M.G. (2010). Exact solutions to the double travelling salesman problem with multiple stacks. Networks, 56(4), pp. 229-243.
• ARCHETTI, C., FEILLET, D., HERTZ, A. and SPERANZA, M.G. (2009). The capacitated team orienteering and profitable tour problems. Journal of the Operational Research Society, 60(6), pp. 831-842.
• ARCHETTI, C. and SAVELSBERGH, M.W.P. (2009). The Trip Scheduling Problem. Transportation Science, 43(4), pp. 417-431.
• ARCHETTI, C., SAVELSBERGH, M.W.P. and SPERANZA, M.G. (2008). To split or not to split: that is the question. Transportation Research - Part E: Logistics and Transportation Review, 44(1), pp. 114-123.
• ARCHETTI, C., SPERANZA, M.G. and SAVELSBERGH, M.W.P. (2008). An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem. Transportation Science, 42(1), pp. 22-31.
• KE, L., ARCHETTI, C. and FENG, Z. (2008). Ants can solve the team orienteering problem. Computers & Industrial Engineering, 54(3), pp. 648-665.
• ARCHETTI, C., BERTAZZI, L., LAPORTE, G. and SPERANZA, M.G. (2007). A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem. Transportation Science, 41(3), pp. 382-391.
• ARCHETTI, C., HERTZ, A. and SPERANZA, M.G. (2007). Metaheuristics for the team orienteering problem. Journal of Heuristics, 13(1), pp. 49-76.
• ARCHETTI, C., SPERANZA, M.G. and HERTZ, A. (2006). A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem. Transportation Science, 40(1), pp. 64-73.
• ARCHETTI, C., SAVELSBERGH, M.W.P. and SPERANZA, M.G. (2006). Worst-Case Analysis for Split Delivery Vehicle Routing Problems. Transportation Science, 40(2), pp. 226-234.
• ARCHETTI, C., MANSINI, R. and SPERANZA, M.G. (2005). Complexity and Reducibility of the Skip Delivery Problem. Transportation Science, 39(2), pp. 182-187.
• ARCHETTI, C. and SPERANZA, M.G. (2004). Vehicle routing in the 1-skip collection problem. Journal of the Operational Research Society, 55(7), pp. 717-727.
• ARCHETTI, C., BERTAZZI, L. and SPERANZA, M.G. (2003). Reoptimizing the traveling salesman problem. Networks, 42(3), pp. 154-159.

• ARCHETTI, C. and SPERANZA, M.G. (2015). Arc routing problems with profits. In: Ángel Corberán, Gilbert Laporte eds. Arc Routing: Problems, Methods, and Applications. 1st ed. Philadelphia: SIAM, pp. 281-300.
• ARCHETTI, C., SPERANZA, M.G. and VIGO, D. (2014). Vehicle routing problems with profits. In: Paolo Toth, Daniele Vigo eds. Vehicle Routing: Problems, Methods, and Applications. 2nd ed. Philadelphia: SIAM, pp. 273-298.
• ARCHETTI, C. and M. GRAZIA SPERANZA, M.G. (2008). The split delivery vehicle routing problem: a survey. In: Golden B., Raghavan S., Wasil E. eds. The Vehicle Routing Problem: Latest Advances and New Challenges. 1st ed. Boston: Springer, pp. 103-122.
• ARCHETTI, C. and M. GRAZIA SPERANZA, M.G. (2005). Collection of waste with single load trucks: a real case. In: Fleischmann B., Klose A. eds. Distribution Logistics, Lecture Notes in Economics and Mathematical Systems. 1st ed. Berlin: Springer, pp. 105-119.

• ARCHETTI, C. (2020). Routing problems in last-mile delivery services. In: 4th AIROYoung Workshop: New Advances in Optimization, Machine Learning and Data Science. Bolzano.
• ARCHETTI, C. (2019). Emerging problems and challenges in routing. In: SPOC 5. Paris.
• ARCHETTI, C. (2019). Vehicle routing problems and recent business trends. In: 33rd Annual Conference of the Belgian Operational Research Society (ORBEL 33). Hasselt.
• ARCHETTI, C. (2019). A kernel search heuristic for the multi-vehicle inventory routing problem. In: 32nd Conference of the European Chapter on Combinatorial Optimization (ECCO XXXII). St. Julian's.
• ARCHETTI, C. (2019). A kernel search heuristic for the multi-vehicle inventory. In: ODS XXXII. Genova.

• ARCHETTI, C. (2021). `The fixed-partition policy inventory routing problem. In: ROADEF 2021.
• ARCHETTI, C. (2021). The dynamic traveling salesman problem with release dates. In: Workshop `New trends in sustainable last-mile delivery'.
• ARCHETTI, C. (2021). Formulations and exact solution approaches for the inventory routing problem. In: International Conference on Operations Research 2021.
• ARCHETTI, C. (2021). The bi-objective long-haul transportation problem on a road network. In: 27th International Conference on Principles and Practice of Constraint Programming.

• ARCHETTI, C., BERTAZZI, L., MILANIČ, M., SCHINDL, D. and VARONE, S. (2018). Preface: Special Issue on the Ninth International Colloquium on Graphs and Optimization (GO IX), 2014. Discrete Applied Mathematics, 234, pp. 1-2.

• ARCHETTI, C. (2021). The new logistics challenge: E-commerce and last-mile delivery. ESSEC Knowledge.
• ALFANDARI, L., LJUBIC, I. and ARCHETTI, C. (2021). Sustainable city logistics. ESSEC Knowledge.