Mathematical Optimization for Routing and Logistic Problems

Gambella, Claudio (2016) Mathematical Optimization for Routing and Logistic Problems, [Dissertation thesis], Alma Mater Studiorum Università di Bologna. Dottorato di ricerca in Automatica e ricerca operativa, 28 Ciclo. DOI 10.6092/unibo/amsdottorato/7607.
Documenti full-text disponibili:
Documento PDF (English) - Richiede un lettore di PDF come Xpdf o Adobe Acrobat Reader
Download (9MB) | Anteprima


In this thesis, we focus on mathematical optimization models and algorithms for solving routing and logistic problems. The first contribution regards a path and mission planning problem, called Carrier-Vehicle Traveling Salesman Problem (CVTSP), for a system of heterogeneous vehicles. A Mixed-Integer Second Order Conic Programming (MISOCP) model and a Benders-like enumeration algorithm are presented for solving CVTSP. The second work concerns a class of routing problems, referred to as Interceptor Vehicle Routing Problems (IVRPs). They generalize VRPs in the sense that target points are allowed to move from their initial location according to a known motion. We present a novel MISOCP formulation and a Branch-and-Price algorithm based on a Lagrangian Relaxation of the vehicle-assignment constraints. Other two contributions focus on waste flow management problems: the former considers a deterministic setting in which a Mixed-Integer Linear Programming (MILP) formulation is used as a Decision Support System for a real-world waste operator, whereas the latter deals with the uncertainty of the waste generation amounts by means of Two-Stage Multiperiod Stochastic Mixed-Integer Programming formulations. Finally, we give an overview on the optimization challenges arising in electric car-sharing systems, both at strategic and tactical planning level.

Tipologia del documento
Tesi di dottorato
Gambella, Claudio
Dottorato di ricerca
Scuola di dottorato
Scienze e ingegneria dell'informazione
Settore disciplinare
Settore concorsuale
Parole chiave
Mathematical Optimization, Mixed-Integer Second-Order Conic Programming, Path Planning, Mission Planning, Traveling Salesman Problem, Vehicle Routing Problem, Branch-and-Price, Lagrangian Decomposition, Waste Management, Stochastic Programming, Electric Car-Sharing.
Data di discussione
27 Maggio 2016

Altri metadati

Statistica sui download

Gestione del documento: Visualizza la tesi