Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem

- C. Archetti, L. Bertazzi, G. Laporte, M. Speranza
- Computer Science, Mathematics
- Transp. Sci.
- 1 August 2007

We consider a distribution problem in which a product has to be shipped from a supplier to several retailers over a given time horizon. Each retailer defines a maximum inventory level. The supplier… Expand

A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem

- C. Archetti, M. Speranza, A. Hertz
- Computer Science, Mathematics
- Transp. Sci.
- 1 March 2003

We describe a tabu search algorithm for the vehicle routing problem with split deliveries. At each iteration, a neighbor solution is obtained by removing a customer from a set of routes where it is… Expand

The periodic vehicle routing problem with intermediate facilities

- E. Angelelli, M. Speranza
- Mathematics, Computer Science
- Eur. J. Oper. Res.
- 1 March 2002

Abstract In this paper, we study an extension of the PVRP where the vehicles can renew their capacity at some intermediate facilities. Each vehicle returns to the depot only when its work shift is… Expand

Metaheuristics for the team orienteering problem

- C. Archetti, A. Hertz, M. Speranza
- Mathematics, Computer Science
- J. Heuristics
- 1 May 2005

The Team Orienteering Problem (TOP) is the generalization to the case of multiple tours of the Orienteering Problem, known also as Selective Traveling Salesman Problem. A set of potential customers… Expand

Worst-Case Analysis for Split Delivery Vehicle Routing Problems

- C. Archetti, M. Savelsbergh, M. Speranza
- Mathematics, Computer Science
- Transp. Sci.
- 1 May 2006

In the vehicle routing problem (VRP) the objective is to construct a minimum cost set of routes serving all customers where the demand of each customer is less than or equal to the vehicle capacity… Expand

The capacitated team orienteering and profitable tour problems

- C. Archetti, D. Feillet, A. Hertz, M. Speranza
- Computer Science
- J. Oper. Res. Soc.
- 1 May 2007

In this paper, we study the capacitated team orienteering and profitable tour problems (CTOP and CPTP). The interest in these problems comes from recent developments in the use of the Internet for a… Expand

A survey on two-echelon routing problems

- R. Cuda, G. Guastaroba, M. Speranza
- Mathematics, Computer Science
- Comput. Oper. Res.
- 1 March 2015

The delivery of freight from its origin to its destination is often managed through one or more intermediate facilities where storing, merging and consolidation activities are performed. This type of… Expand

Analysis of the maximum level policy in a production-distribution system

- C. Archetti, L. Bertazzi, G. Paletta, M. Speranza
- Mathematics, Computer Science
- Comput. Oper. Res.
- 1 December 2011

We consider a production-distribution system, where a facility produces one commodity which is distributed to a set of retailers by a fleet of vehicles. Each retailer defines a maximum level of the… Expand

Deterministic Order-Up-To Level Policies in an Inventory Routing Problem

- L. Bertazzi, G. Paletta, M. Speranza
- Mathematics, Computer Science
- Transp. Sci.
- 1 February 2002

We consider a distribution problem in which a set of products has to be shipped from a supplier to several retailers in a given time horizon. Shipments from the supplier to the retailers are… Expand

The application of a vehicle routing model to a waste-collection problem: two case studies

- E. Angelelli, M. Speranza
- Computer Science
- J. Oper. Res. Soc.
- 9 August 2002

In this paper we suggest a unique model for estimating the operating cost of each of three waste-collection systems. Under the traditional system, which is widely used, waste is typically collected… Expand