We consider a class of optimization problems having a distinctive feature: both discrete and continuous decisions need to be taken simultaneously. These problems arise in many practical applications, for example broadband telecommunications and green transportation problems, where resources are available, that can be fractionally consumed or assigned. These problems are proven of being harder than their purely discrete counterpart. We propose effective methodologies to tackle them. Our approach is to consider variants of classical combinatorial optimization problems belonging to three domains: packing, routing and integrated routing/packing. Our results suggest that indeed effective approaches exist, reducing the computational effort required for solving the problem. Mostly, they are based on exploiting the structure of optimal solutions to reduce the search space.
ALGORITHMS FOR OPTIMIZATION PROBLEMS WITH FRACTIONAL RESOURCES / M. Casazza ; tutor: A. Ceselli, R. Wolfler Calvo ; coordinator: E. Damiani. Università degli Studi di Milano, 2016 Feb 26. 28. ciclo, Anno Accademico 2015. [10.13130/casazza-marco_phd2016-02-26].
ALGORITHMS FOR OPTIMIZATION PROBLEMS WITH FRACTIONAL RESOURCES
M. Casazza
2016
Abstract
We consider a class of optimization problems having a distinctive feature: both discrete and continuous decisions need to be taken simultaneously. These problems arise in many practical applications, for example broadband telecommunications and green transportation problems, where resources are available, that can be fractionally consumed or assigned. These problems are proven of being harder than their purely discrete counterpart. We propose effective methodologies to tackle them. Our approach is to consider variants of classical combinatorial optimization problems belonging to three domains: packing, routing and integrated routing/packing. Our results suggest that indeed effective approaches exist, reducing the computational effort required for solving the problem. Mostly, they are based on exploiting the structure of optimal solutions to reduce the search space.File | Dimensione | Formato | |
---|---|---|---|
phd_unimi_R10011.pdf
accesso aperto
Descrizione: Tesi di dottorato
Tipologia:
Tesi di dottorato completa
Dimensione
961.02 kB
Formato
Adobe PDF
|
961.02 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.