Spatial organization of public services: models and applications

Location decisions are crucial in the spatial organization in both public and private sectors as they can have a long term impact on operational performances and on service levels. Social cost minimization, universality of services and equity, expressed in terms of users' accessibility, are the main objectives in public services contexts. Nevertheless, the enduring trend of public expenditures revision poses, also in the public sectors, the need to pursue objectives of economic efficiency. In the literature, two families of optimization problems are typically used to address these problems, namely Facility Location Problems (FLPs) and Districting Problems (DPs). The aim of this thesis is to show how FLPs and DPs can be used to underpin spatial organization processes of public services, providing analytical models able to assist the decision making. To this end, novel mathematical models are developed with application to the healthcare and postal service sectors. In particular, a hierarchical facility location model is formulated to reorganize an existing regional Blood Management System (BMS) while an integrated location-districting model is proposed for the organization of postal collection operations in urban areas. A constructive heuristic procedure is also devised to solve the latter problem. Extensive computational experiments are realized to validate the proposed models and to show their capability to provide insightful managerial implications. Finally, the thesis aims at filling another existing gap in the literature due to the absence of stochastic models for DPs. Hence, a two-stage stochastic program for districting is introduced and tested on real georgaphic data. Several extensions of the proposed modeling framework are also discussed

A GRASP-Tabu Heuristic Approach to Territory Design for Pickup and Delivery Operations for Large-Scale Instances

Weaddressalogisticsdistrictingproblemfacedbyaparcelcompanywhoseoperationsconsistofpickingupanddeliveringpackages overaserviceregion.Thedistrictingprocessaimstofindapartitionoftheserviceregionintodeliveryandcollectionzonesthat may be served by a single vehicle that departs from a central depot. Criteria to be optimized are to balance workload content among the districts and to create districts of compact shape. A solution approach based on a hybrid procedure that combines elements of GRASP and Tabu Search (TS) is proposed to solve large-scale instances. Numerical experimentation is performed consideringdifferentinstancesizesandtypes.Resultsshowthattheproposedsolutionapproachisabletosolvelarge-scaleinstances inreasonablecomputationaltimeswithgoodqualityofthesolutionsobtained.Todeterminethequalityofthesolutions,resultsare comparedwithCPLEXsolutionsandwiththecurrentrealsolutiontohighlightthebenefitsoftheproposedapproach.Conclusions andrecommendationsforfurtherresearchareprovided

Stochastic Dynamic Vehicle Routing in the Euclidean Plane: The Multiple-Server, Capacitated Vehicle Case

In a previous paper [12], we introduced a new model for stochastic and dynamic vehicle routing called the dynamic traveling repairman problem (DTRP), in which a vehicle traveling at constant velocity in a Euclidean region must service demands whose time of arrival, location and on-site service are stochastic. The objective is to find a policy to service demands over an infinite horizon that minimizes the expected system time (wait plus service) of the demands. We showed that the stability condition did not depend on the geometry of the service region (i.e. size, shape, etc.). In addition, we established bounds on the optimal system time and proposed an optimal policy in light traffic and several policies that have system times within a constant factor of the lower bounds in heavy traffic. We showed that the leading behavior of the optimal system time had a particularly simple form which increases much more rapidly with traffic intensity than the system time in traditional queues (e.g. M/G/1). In this paper, we extend these results in several directions. First, we propose new bounds and policies for the problem of m identical vehicles with unlimited capacity and show that in heavy traffic the system time is reduced by a factor of 1/m2 over the single server case. Policies based on dividing the service region into m equal subregion

A concise guide to existing and emerging vehicle routing problem variants

Vehicle routing problems have been the focus of extensive research over the past sixty years, driven by their economic importance and their theoretical interest. The diversity of applications has motivated the study of a myriad of problem variants with different attributes. In this article, we provide a concise overview of existing and emerging problem variants. Models are typically refined along three lines: considering more relevant objectives and performance metrics, integrating vehicle routing evaluations with other tactical decisions, and capturing fine-grained yet essential aspects of modern supply chains. We organize the main problem attributes within this structured framework. We discuss recent research directions and pinpoint current shortcomings, recent successes, and emerging challenges

A concise guide to existing and emerging vehicle routing problem variants

Vehicle routing problems have been the focus of extensive research over the past sixty years, driven by their economic importance and their theoretical interest. The diversity of applications has motivated the study of a myriad of problem variants with different attributes. In this article, we provide a concise overview of existing and emerging problem variants. Models are typically refined along three lines: considering more relevant objectives and performance metrics, integrating vehicle routing evaluations with other tactical decisions, and capturing fine-grained yet essential aspects of modern supply chains. We organize the main problem attributes within this structured framework. We discuss recent research directions and pinpoint current shortcomings, recent successes, and emerging challenges.</p

Districting Problems - New Geometrically Motivated Approaches

This thesis focuses on districting problems were the basic areas are represented by points or lines. In the context of points, it presents approaches that utilize the problem\u27s underlying geometrical information. For lines it introduces an algorithm combining features of geometric approaches, tabu search, and adaptive randomized neighborhood search that includes the routing distances explicitly. Moreover, this thesis summarizes, compares and enhances existing compactness measures