Exact Algorithms for Different Classes of Vehicle Routing Problems

We deal with five problems arising in the field of logistics: the Asymmetric TSP (ATSP), the TSP with Time Windows (TSPTW), the VRP with Time Windows (VRPTW), the Multi-Trip VRP (MTVRP), and the Two-Echelon Capacitated VRP (2E-CVRP). The ATSP requires finding a lest-cost Hamiltonian tour in a digraph. We survey models and classical relaxations, and describe the most effective exact algorithms from the literature. A survey and analysis of the polynomial formulations is provided. The considered algorithms and formulations are experimentally compared on benchmark instances. The TSPTW requires finding, in a weighted digraph, a least-cost Hamiltonian tour visiting each vertex within a given time window. We propose a new exact method, based on new tour relaxations and dynamic programming. Computational results on benchmark instances show that the proposed algorithm outperforms the state-of-the-art exact methods. In the VRPTW, a fleet of identical capacitated vehicles located at a depot must be optimally routed to supply customers with known demands and time window constraints. Different column generation bounding procedures and an exact algorithm are developed. The new exact method closed four of the five open Solomon instances. The MTVRP is the problem of optimally routing capacitated vehicles located at a depot to supply customers without exceeding maximum driving time constraints. Two set-partitioning-like formulations of the problem are introduced. Lower bounds are derived and embedded into an exact solution method, that can solve benchmark instances with up to 120 customers. The 2E-CVRP requires designing the optimal routing plan to deliver goods from a depot to customers by using intermediate depots. The objective is to minimize the sum of routing and handling costs. A new mathematical formulation is introduced. Valid lower bounds and an exact method are derived. Computational results on benchmark instances show that the new exact algorithm outperforms the state-of-the-art exact methods.

Metaheuristics for Search Problems in Genomics - New Algorithms and Applications

In this thesis we made the first steps towards the systematic application of a methodology for automatically building formal models of complex biological systems. Such a methodology could be useful also to design artificial systems possessing desirable properties such as robustness and evolvability. The approach we follow in this thesis is to manipulate formal models by means of adaptive search methods called metaheuristics. In the first part of the thesis we develop state-of-the-art hybrid metaheuristic algorithms to tackle two important problems in genomics, namely, the Haplotype Inference by parsimony and the Founder Sequence Reconstruction Problem. We compare our algorithms with other effective techniques in the literature, we show strength and limitations of our approaches to various problem formulations and, finally, we propose further enhancements that could possibly improve the performance of our algorithms and widen their applicability. In the second part, we concentrate on Boolean network (BN) models of gene regulatory networks (GRNs). We detail our automatic design methodology and apply it to four use cases which correspond to different design criteria and address some limitations of GRN modeling by BNs. Finally, we tackle the Density Classification Problem with the aim of showing the learning capabilities of BNs. Experimental evaluation of this methodology shows its efficacy in producing network that meet our design criteria. Our results, coherently to what has been found in other works, also suggest that networks manipulated by a search process exhibit a mixture of characteristics typical of different dynamical regimes.

L'azione risarcitoria ex art. 2497 c.c.

Scopo della presente trattazione è quello di andare ad osservare in che modo il legislatore della riforma abbia cercato di offrire una disciplina ad un fenomeno sempre più in espansione nell’economia italiana: i gruppi di impresa. In particolare, l’elaborato è composto da 3 nuclei. Il primo analizza la disciplina, introdotta nel 2003, relativa all’attività di direzione e coordinamento (art. 2497 c.c. e ss) rintracciandone le regole generali e il rapporto con le norme del codice civile. Una seconda parte approfondisce gli elementi costitutivi dell'attivita' di direzione e coordinamento, i presupposti affinche' si possa configurare una responsabilita' da parte della societa' capogruppo e i soggetti conivolti all'interno di un gruppo. La terza parte e' invece dedicata allo studio delle problematiche legate all’azione risarcitoria introdotta con la disposizione di cui all’art. 2497 c.c., soprattutto confrontando la posizione dei soci di minoranza con quella dei creditori sociali. In particolare, vengono descritte le modalità con le quali i soci e i creditori sociali possono esercitare l’azione a tutela dei propri interessi e dunque tentare di trovare pieno ristoro ai danni sofferti; danni che in qualche modo risultano legati alle scelte operate dal gruppo di comando e, più tecnicamente, dalla società che esercita l’attività di direzione e coordinamento, la c.d. capogruppo.