http://publicationslist.org/data/roberto.roberti/atom.xml Roberto Robertihttp://publicationslist.org/roberto.roberti$basepathfavicon.icoRecent additions to Roberto Roberti's PublicationsList.org pagehttp://publicationslist.org/publications.png2013-08-05T06:35:22Z http://publicationslist.org/roberto.roberti/refid11 2013-04-23T17:17:06Z

The Multi-Trip Vehicle Routing Problem (MTVRP) is a variant of the Capacitated Vehicle Routing Problem (CVRP) where each vehicle can perform a subset of routes, called vehicle schedule, subject to maximum driving time constraints. In spite of its practical importance, the MTVRP has received little attention in the literature. Few heuristics have been proposed, and only an exact algorithm has been ...<br/><br/>A Mingozzi, R Roberti, P Toth (2013) <i>INFORMS Journal on Computing</i> 25: 2 193-207<br/>

http://publicationslist.org/roberto.roberti/refid17 2013-08-05T06:35:17Z

The ng-path relaxation was introduced by Baldacci et al. (2011) for computing tight lower bounds to vehicle routing problems by solving a relaxation of the set partitioning formulation, where routes are not necessarily elementary and can contain predefined subtours. The strength of the achieved lower bounds depends on the subtours that routes can perform. In this paper, we introduce a new gene...<br/><br/>R Roberti, A Mingozzi (2013) <i>Transportation Science</i> : <br/>

http://publicationslist.org/roberto.roberti/refid14 2013-07-30T07:03:17Z

Summary of the PhD Thesis<br/><br/>R Roberti (2013) <i>4OR</i> 11: 2 195-196<br/>

http://publicationslist.org/roberto.roberti/refid16 2013-05-29T07:17:49Z

In this paper, we propose a new method to compute lower bounds for Curriculum-based Course Timetabling (CTT), which calls for the best weekly assignment of university course lectures to rooms and time slots. The lower bound is obtained by splitting the objective function into two parts, considering one separate problem for each part of the objective function, and summing up the corresponding optim...<br/><br/>V Cacchiani, A Caprara, R Roberti, P Toth (2013) <i>Computer & Operations Research</i> 40: 10 2466-2477<br/>

http://publicationslist.org/roberto.roberti/refid15 2013-04-18T14:57:14Z

In the two-echelon capacitated vehicle routing problem (2E-CVRP), the delivery to customers from a depot uses intermediate depots, called satellites. The 2E-CVRP involves two levels of routing problems. The first level requires a design of the routes for a vehicle fleet located at the depot to transport the customer demands to a subset of the satellites. The second level concerns the routing of a ...<br/><br/>R Baldacci, A Mingozzi, R Roberti, R Wolfler Calvo (2013) <i>Operations Research</i> 61: 2 298-314<br/>

http://publicationslist.org/roberto.roberti/refid3 2012-08-09T18:13:43Z

The traveling salesman problem with time windows (TSPTW) is the problem of finding in a weighted digraph a least-cost tour starting from a selected vertex, visiting each vertex of the graph exactly once according to a given time window, and returning to the starting vertex. This NP-hard problem arises in routing and scheduling applications. This paper introduces a new tour relaxation, called ngL-t...<br/><br/>R Baldacci, A Mingozzi, R Roberti (2012) <i>INFORMS Journal on Computing</i> 24: 3 356-371<br/>

http://publicationslist.org/roberto.roberti/refid8 2011-12-16T14:38:44Z

This paper provides a review of the recent developments that had a major impact on the current state-of-the-art exact algorithms for the vehicle routing problem (VRP). The paper reviews mathematical formulations, relaxations and recent exact methods for two of the most important variants of the VRP: the Capacitated VRP (CVRP) and the VRP with Time Windows (VRPTW). The paper also reports a comparis...<br/><br/>R Baldacci, A Mingozzi and R Roberti (2012) <i>European Journal of Operational Research</i> 218: 1 1-6<br/>

http://publicationslist.org/roberto.roberti/refid12 2012-04-18T09:36:10Z

R Roberti (2012) <br/>

http://publicationslist.org/roberto.roberti/refid13 2012-05-31T18:17:36Z

This paper surveys the most effective mathematical models and exact algorithms proposed for finding the optimal solution of the well known Asymmetric Traveling Salesman Problem (ATSP). The fundamental Integer Linear Programming (ILP) model proposed by Dantzig, Fulkerson and Johnson is first presented, its classical (Assignment, Shortest Spanning r-Arborescence, Linear Programming) relaxations are ...<br/><br/>R Roberti, P Toth (2012) <i>EURO Journal on Transportation and Logistics</i> 1: 1-2 113-133<br/>

http://publicationslist.org/roberto.roberti/refid2 2011-11-18T14:06:54Z

In this paper, we describe an effective exact method for solving both the Capacitated Vehicle Routing Problem (CVRP) and the Vehicle Routing Problem with Time Windows (VRPTW) that improves the method proposed by Baldacci et al. (2008) for the CVRP. The proposed algorithm is based on the Set Partitioning (SP) formulation of the problem. We introduce a new route relaxation, called ng-route, used by...<br/><br/>R Baldacci, A Mingozzi, R Roberti (2011) <i>Operations Research</i> 59: 5 1269-1283<br/>

http://publicationslist.org/roberto.roberti/refid1 2011-03-03T16:11:56Z

This paper presents an exact solution framework for solving some variants of the vehicle routing problem (VRP) that can be modeled as set partitioning (SP) problems with additional constraints. The method consists in combining different dual ascent procedures to find a near optimal dual solution of the SP model. Then, a column-and-cut generation algorithm attempts to close the integrality gap lef...<br/><br/>R Baldacci, E Bartolini, A Mingozzi, R Roberti (2010) <i>Computational Management Science</i> 7: 3 229-268<br/>