Algorithms for network design and routing problems

In this thesis we study three combinatorial optimization problems belonging to the classes of Network Design and Vehicle Routing problems that are strongly linked in the context of the design and management of transportation networks: the Non-Bifurcated Capacitated Network Design Problem (NBP), the Period Vehicle Routing Problem (PVRP) and the Pickup and Delivery Problem with Time Windows (PDPTW). These problems are NP-hard and contain as special cases some well known difficult problems such as the Traveling Salesman Problem and the Steiner Tree Problem. Moreover, they model the core structure of many practical problems arising in logistics and telecommunications. The NBP is the problem of designing the optimum network to satisfy a given set of traffic demands. Given a set of nodes, a set of potential links and a set of point-to-point demands called commodities, the objective is to select the links to install and dimension their capacities so that all the demands can be routed between their respective endpoints, and the sum of link fixed costs and commodity routing costs is minimized. The problem is called non- bifurcated because the solution network must allow each demand to follow a single path, i.e., the flow of each demand cannot be splitted. Although this is the case in many real applications, the NBP has received significantly less attention in the literature than other capacitated network design problems that allow bifurcation. We describe an exact algorithm for the NBP that is based on solving by an integer programming solver a formulation of the problem strengthened by simple valid inequalities and four new heuristic algorithms. One of these heuristics is an adaptive memory metaheuristic, based on partial enumeration, that could be applied to a wider class of structured combinatorial optimization problems. In the PVRP a fleet of vehicles of identical capacity must be used to service a set of customers over a planning period of several days. Each customer specifies a service frequency, a set of allowable day-combinations and a quantity of product that the customer must receive every time he is visited. For example, a customer may require to be visited twice during a 5-day period imposing that these visits take place on Monday-Thursday or Monday-Friday or Tuesday-Friday. The problem consists in simultaneously assigning a day- combination to each customer and in designing the vehicle routes for each day so that each customer is visited the required number of times, the number of routes on each day does not exceed the number of vehicles available, and the total cost of the routes over the period is minimized. We also consider a tactical variant of this problem, called Tactical Planning Vehicle Routing Problem, where customers require to be visited on a specific day of the period but a penalty cost, called service cost, can be paid to postpone the visit to a later day than that required. At our knowledge all the algorithms proposed in the literature for the PVRP are heuristics. In this thesis we present for the first time an exact algorithm for the PVRP that is based on different relaxations of a set partitioning-like formulation. The effectiveness of the proposed algorithm is tested on a set of instances from the literature and on a new set of instances. Finally, the PDPTW is to service a set of transportation requests using a fleet of identical vehicles of limited capacity located at a central depot. Each request specifies a pickup location and a delivery location and requires that a given quantity of load is transported from the pickup location to the delivery location. Moreover, each location can be visited only within an associated time window. Each vehicle can perform at most one route and the problem is to satisfy all the requests using the available vehicles so that each request is serviced by a single vehicle, the load on each vehicle does not exceed the capacity, and all locations are visited according to their time window. We formulate the PDPTW as a set partitioning-like problem with additional cuts and we propose an exact algorithm based on different relaxations of the mathematical formulation and a branch-and-cut-and-price algorithm. The new algorithm is tested on two classes of problems from the literature and compared with a recent branch-and-cut-and-price algorithm from the literature.

Integrating Crew Scheduling and Rostering Problems

Crew scheduling and crew rostering are similar and related problems which can be solved by similar procedures. So far, the existing solution methods usually create a model for each one of these problems (scheduling and rostering), and when they are solved together in some cases an interaction between models is considered in order to obtain a better solution. A single set covering model to solve simultaneously both problems is presented here, where the total quantity of drivers needed is directly considered and optimized. This integration allows to optimize all of the depots at the same time, while traditional approaches needed to work depot by depot, and also it allows to see and manage the relationship between scheduling and rostering, which was known in some degree but usually not easy to quantify as this model permits. Recent research in the area of crew scheduling and rostering has stated that one of the current challenges to be achieved is to determine a schedule where crew fatigue, which depends mainly on the quality of the rosters created, is reduced. In this approach rosters are constructed in such way that stable working hours are used in every week of work, and a change to a different shift is done only using free days in between to make easier the adaptation to the new working hours. Computational results for real-world-based instances are presented. Instances are geographically diverse to test the performance of the procedures and the model in different scenarios.

Hybrid Methods for Resource Allocation and Scheduling Problems in Deterministic and Stochastic Environments

This work presents exact, hybrid algorithms for mixed resource Allocation and Scheduling problems; in general terms, those consist into assigning over time finite capacity resources to a set of precedence connected activities. The proposed methods have broad applicability, but are mainly motivated by applications in the field of Embedded System Design. In particular, high-performance embedded computing recently witnessed the shift from single CPU platforms with application-specific accelerators to programmable Multi Processor Systems-on-Chip (MPSoCs). Those allow higher flexibility, real time performance and low energy consumption, but the programmer must be able to effectively exploit the platform parallelism. This raises interest in the development of algorithmic techniques to be embedded in CAD tools; in particular, given a specific application and platform, the objective if to perform optimal allocation of hardware resources and to compute an execution schedule. On this regard, since embedded systems tend to run the same set of applications for their entire lifetime, off-line, exact optimization approaches are particularly appealing. Quite surprisingly, the use of exact algorithms has not been well investigated so far; this is in part motivated by the complexity of integrated allocation and scheduling, setting tough challenges for ``pure'' combinatorial methods. The use of hybrid CP/OR approaches presents the opportunity to exploit mutual advantages of different methods, while compensating for their weaknesses. In this work, we consider in first instance an Allocation and Scheduling problem over the Cell BE processor by Sony, IBM and Toshiba; we propose three different solution methods, leveraging decomposition, cut generation and heuristic guided search. Next, we face Allocation and Scheduling of so-called Conditional Task Graphs, explicitly accounting for branches with outcome not known at design time; we extend the CP scheduling framework to effectively deal with the introduced stochastic elements. Finally, we address Allocation and Scheduling with uncertain, bounded execution times, via conflict based tree search; we introduce a simple and flexible time model to take into account duration variability and provide an efficient conflict detection method. The proposed approaches achieve good results on practical size problem, thus demonstrating the use of exact approaches for system design is feasible. Furthermore, the developed techniques bring significant contributions to combinatorial optimization methods.

Innovation and economic performance of the firms in the service sector: relevant issues and open problems

This thesis is a collection of essays related to the topic of innovation in the service sector. The choice of this structure is functional to the purpose of single out some of the relevant issues and try to tackle them, revising first the state of the literature and then proposing a way forward. Three relevant issues has been therefore selected: (i) the definition of innovation in the service sector and the connected question of measurement of innovation; (ii) the issue of productivity in services; (iii) the classification of innovative firms in the service sector. Facing the first issue, chapter II shows how the initial width of the original Schumpeterian definition of innovation has been narrowed and then passed to the service sector form the manufacturing one in a reduce technological form. Chapter III tackle the issue of productivity in services, discussing the difficulties for measuring productivity in a context where the output is often immaterial. We reconstruct the dispute on the Baumol’s cost disease argument and propose two different ways to go forward in the research on productivity in services: redefining the output along the line of a characteristic approach; and redefining the inputs, particularly analysing which kind of input it’s worth saving. Chapter IV derives an integrated taxonomy of innovative service and manufacturing firms, using data coming from the 2008 CIS survey for Italy. This taxonomy is based on the enlarged definition of “innovative firm” deriving from the Schumpeterian definition of innovation and classify firms using a cluster analysis techniques. The result is the emergence of a four cluster solution, where firms are differentiated by the breadth of the innovation activities in which they are involved. Chapter 5 reports some of the main conclusions of each singular previous chapter and the points worth of further research in the future.

Cognitive and behavioural assessment of parkinsonian syndromes at onset: a longitudinal study

Background: cognitive impairment is one of the non motor features widely descripted in parkinsonian syndrome, it has been related to the motor characteristics of the parkinsonian syndrome, associated with neuropsychiatric dysfunction and the characteristic sleep and autonomic features. It has been shown to be highly prevalent at all disease stages and to contribute significantly to disability. Objectives: aim of this study is to evaluate longitudinally the cognitive and behavioral characteristics of patients with a parkinsonian syndrome at onset; to describe the cognitive and behavioral characteristics of each parkinsonian syndrome; to define in PD patients at onset the presence of MCI or Parkinson disease dementia; to correlate the cognitive and behavioral characteristics with the features of the parkinsonian syndrome and with the associated sleep and autonomic features. Results: we recruited 55 patients, 22 did not present cognitive impairment both at T0 and at T1. 18 patients presented a progression of cognitive impairment. Progressive cognitively impaired patients were older and presented the worst motor phenotype. Progression of cognitive impairment was not associated to sleep and autonomic features. Conclusion: the evaluation of cognitive impairment could not be useful as a predictor of a correct diagnosis but each non motor domain will help to clarify and characterize the motor syndrome. The diagnosis of parkinsonian disorders lies in building a clinical profile in conjunction with other clinical characteristics such as mode of presentation, disease progression, response to medications, sleep and autonomic features.

Models and Algorihtm for the Optimization of Real-World Routing and Logistics Problems

Logistics involves planning, managing, and organizing the flows of goods from the point of origin to the point of destination in order to meet some requirements. Logistics and transportation aspects are very important and represent a relevant costs for producing and shipping companies, but also for public administration and private citizens. The optimization of resources and the improvement in the organization of operations is crucial for all branches of logistics, from the operation management to the transportation. As we will have the chance to see in this work, optimization techniques, models, and algorithms represent important methods to solve the always new and more complex problems arising in different segments of logistics. Many operation management and transportation problems are related to the optimization class of problems called Vehicle Routing Problems (VRPs). In this work, we consider several real-world deterministic and stochastic problems that are included in the wide class of the VRPs, and we solve them by means of exact and heuristic methods. We treat three classes of real-world routing and logistics problems. We deal with one of the most important tactical problems that arises in the managing of the bike sharing systems, that is the Bike sharing Rebalancing Problem (BRP). We propose models and algorithms for real-world earthwork optimization problems. We describe the 3DP process and we highlight several optimization issues in 3DP. Among those, we define the problem related to the tool path definition in the 3DP process, the 3D Routing Problem (3DRP), which is a generalization of the arc routing problem. We present an ILP model and several heuristic algorithms to solve the 3DRP.

Quantitative assessment of physiological and behavioural parameters in healthy dairy cows evoked by transcutaneous electrical nerve stimulation of the udder

The pain and distress associated with transcutaneous electrical nerve stimulation (TENS) of the udder was evaluated by treating 20 healthy dairy cows with an electrical udder stimulator. This generated a sequence of pulses (frequency: 160+/-10% impulses per second, duration 250 mus) and provided voltage ranges from 0 to 10 volts (+/-10%). Trials took place on three consecutive days, twice daily after morning and evening milking. Daily sessions were divided into two periods: (1) control (sham treatment) and (2) treatment (real treatment). Physiological (heart rate, respiratory rate, and plasma cortisol concentration) as well as ethological parameters (kicking, weight shifting, and looking backwards to udder) were defined as pain-indicating parameters and observed. Evaluation of data showed that only one parameter (kicking) was significantly increased during real treatment compared to sham treatment. It is concluded that the TENS therapy tested in this study can evoke changes in behaviour (increased kicking) consistent with an experience of pain in some cows.

Phonological and Syntactic Problems faced by Speakers of Bafoussam-Bamileke as L1 in Learning English as L2

Carrying out this research on the difficulties encountered by Bafoussam-Bamileke's native speakers learning English as their L2 helps to unveil many syntactic and phonological problems that require a great interest no only to teachers but also to learners in order to reach an acceptable level of accuracy and fluency. We have also provided some ways to solve those problems efficiently.

Coping With a Family Member's Death: Parenting, Religiosity, and Parent-Child Communication

The present study had three major aims. First, this study was a basic descriptive exploration of the frequency and nature of parent-child communication about death. Second, this study conducted a quantitative analysis to identify predictors of communication and bereaved children¿s emotional and behavioral problems. Third, this study was also a qualitative analysis of parents¿ descriptions of how religious views shape conversations about death and how conversations are beneficial. Based on prior research, it was predicted that positive child outcomes would be associated with parental warmth, religiosity, adaptive coping, positive religious coping, and frequent parent-child communication about death. Conversely, it was predicted that negative child outcomes would be associated with parental psychological control, maladaptive coping, negative religious coping, and less frequent parent-child communication about death. Additionally, it was hypothesized that parents¿ religious and spiritual views would shape parent-child communication about death, and parents would describe numerous benefits of discussing death with children. Parents completed a series of survey measures assessing their religiosity, coping strategies, parent-child communication about death, and their children¿s emotional and behavioral symptoms. Almost 80% of parent-child dyads discussed death at least once a week, and children initiated approximately half of these conversations. Parent-child communication about death was predicted by parents¿ warmth toward and acceptance of their children and inversely predicted by children¿s hyperactivity and social problem solving. Higher levels of children¿s social problem solving could predict lower frequency of parent-child communication about death if children were holding frequent, meaningful, and comforting conversations with friends and other adults. Higher levels of parents¿ psychological control predicted more emotional and behavioral problems in the child. Parents¿ adaptive coping had significant relationships with all of the dimensions of parent-child communication about death. Qualitative analyses revealed that parents perceived their religious beliefs as shaping conversations about death and grief as an individualized journey. A majority of parents described the emotional, social, and intellectual benefits of holding parent-child conversations about death. This study contributes to the literature by further describing parent-child communication about death, identifying its predictors, and investigating parents¿ religiosity and coping strategies in relation to child well-being. Overall, this study revealed the importance of assessing global parenting characteristics (i.e., warmth/acceptance and psychological control) when examining parent-child relationships and communication about death. Furthermore, this unique study illustrates the value of qualitative data when examining parent-child communication about death and religiosity.

Romany Families in Romania: Intelligence and Personality of Children Cross-cultural and Specific Problems of Development

Psychogenetic research has emphasised the influence of social factors on a child's intellectual development. In her work, Ms. Dumitrascu examines two such factors; family size and order of birth. However, since these formal parameters tend to be unstable, other more informal factors should be taken into consideration. Of these, perhaps the most interesting is the "style" of parental education, which Ms. Dumitrascu regards as an expression of national traditions at the family level. This educational style is culture dependent. Only a comparative, cross-cultural study can reveal the real mechanism through which educational style influences the development of a child's intellect and personality. Ms. Dumitrascu conducted an experimental cross-cultural study aimed at examining the effects of the family environment on a child's intellectual development. Three distinct populations were involved in her investigation, each having quite a distinct status in their geographical area; Romanians, Romanies (Gypsies) from Romania, and Russians from the Republic of Moldova. She presented her research in the form of a series of articles written in English totalling 85 pages, and also on disc. A significant difference was revealed between the intelligence of a child living in a large family, and that of a child with no brothers or sisters. In the case of Romany children, the gap is remarkably large. Ms. Dumitrascu concludes that the simultaneous action of several negative factors (low socio-economic status, large family size, socio-cultural isolation of a population) may delay child development. Subjected to such a precarious environment, Romany children do not seek self-realisation, but rather struggle to survive the hardship. Most of them remain out of civilisation. Unfortunately, adult Romanies seldom express any concern regarding their children's successful social integration. The school as main socialisation tool has no value for most parents. Ms. Dumitrascu argues the need for a major effort aimed at helping Romany's social integration. She hopes this project will be of some help for psychologists, social workers, teachers, and all those who are interested in the integration into society of minority groups.

The Supportive Role of the Family in Solving Real and Projected Problems of Everyday Life

In this research the supportive role of the family in coping with everyday problems was studied using two large data sets. The results show the importance of the structural aspect of social support. Mapping individual preferences to support referents showed the crucial role of spouse and parents in solving everyday problems. The individual choices of particular support referents could be fairly accurately predicted from knowledge of the composition of the family, in both categorical regression and logit models. The far lower predictability of the criterion variable was shown using a wide range of socioeconomic, social and demographic indicators. Residence in small cities and indicators of extreme occupational strata were particularly predictive of the choice of support referent. The supportive role of the family was also traced in the personal projects of young adults, which were seen as ecological, natural and dynamic middle-level units of analysis of personality. Different aspects of personal projects, including reliance on social support referents, turned out to be highly interrelated. One the one hand, expectations of support were determined by the content of the project, and on the other, expected social support also influences the content of the project. Sivuha sees this as one of the ways others can enter self-structures.