Determining departure times in dynamic and stochastic maritime routing and scheduling problem

In maritime transportation, decisions are made in a dynamic setting where many aspects of the future are uncertain. However, most academic literature on maritime transportation considers static and deterministic routing and scheduling problems. This work addresses a gap in the literature on dynamic and stochastic maritime routing and scheduling problems, by focusing on the scheduling of departure times. Five simple strategies for setting departure times are considered, as well as a more advanced strategy which involves solving a mixed integer mathematical programming problem. The latter strategy is significantly better than the other methods, while adding only a small computational effort.

The State of the art in the routing and scheduling of vehicles and crews /

Mode of access: Internet.

Scheduling of track inspection and maintenance activities in railroad networks

The U.S. railroad companies spend billions of dollars every year on railroad track maintenance in order to ensure safety and operational efficiency of their railroad networks. Besides maintenance costs, other costs such as train accident costs, train and shipment delay costs and rolling stock maintenance costs are also closely related to track maintenance activities. Optimizing the track maintenance process on the extensive railroad networks is a very complex problem with major cost implications. Currently, the decision making process for track maintenance planning is largely manual and primarily relies on the knowledge and judgment of experts. There is considerable potential to improve the process by using operations research techniques to develop solutions to the optimization problems on track maintenance. In this dissertation study, we propose a range of mathematical models and solution algorithms for three network-level scheduling problems on track maintenance: track inspection scheduling problem (TISP), production team scheduling problem (PTSP) and job-to-project clustering problem (JTPCP). TISP involves a set of inspection teams which travel over the railroad network to identify track defects. It is a large-scale routing and scheduling problem where thousands of tasks are to be scheduled subject to many difficult side constraints such as periodicity constraints and discrete working time constraints. A vehicle routing problem formulation was proposed for TISP, and a customized heuristic algorithm was developed to solve the model. The algorithm iteratively applies a constructive heuristic and a local search algorithm in an incremental scheduling horizon framework. The proposed model and algorithm have been adopted by a Class I railroad in its decision making process. Real-world case studies show the proposed approach outperforms the manual approach in short-term scheduling and can be used to conduct long-term what-if analyses to yield managerial insights. PTSP schedules capital track maintenance projects, which are the largest track maintenance activities and account for the majority of railroad capital spending. A time-space network model was proposed to formulate PTSP. More than ten types of side constraints were considered in the model, including very complex constraints such as mutual exclusion constraints and consecution constraints. A multiple neighborhood search algorithm, including a decomposition and restriction search and a block-interchange search, was developed to solve the model. Various performance enhancement techniques, such as data reduction, augmented cost function and subproblem prioritization, were developed to improve the algorithm. The proposed approach has been adopted by a Class I railroad for two years. Our numerical results show the model solutions are able to satisfy all hard constraints and most soft constraints. Compared with the existing manual procedure, the proposed approach is able to bring significant cost savings and operational efficiency improvement. JTPCP is an intermediate problem between TISP and PTSP. It focuses on clustering thousands of capital track maintenance jobs (based on the defects identified in track inspection) into projects so that the projects can be scheduled in PTSP. A vehicle routing problem based model and a multiple-step heuristic algorithm were developed to solve this problem. Various side constraints such as mutual exclusion constraints and rounding constraints were considered. The proposed approach has been applied in practice and has shown good performance in both solution quality and efficiency.

Epidemiology of leisure, transportation, occupational, and household physical activity: prevalence and associated factors

Background: To estimate the prevalence of and identify factors associated with physical activity in leisure, transportation, occupational, and household settings. Methods: This was a cross-sectional study aimed at investigating living and health conditions among the population of São Paulo, Brazil. Data on 1318 adults aged 18 to 65 years were used. To assess physical activity, the long version of the International Physical Activity Questionnaire was applied. Multivariate analysis was conducted using a hierarchical model. Results: The greatest prevalence of insufficient activity related to transportation (91.7%), followed by leisure (77.5%), occupational (68.9%), and household settings (56.7%). The variables associated with insufficient levels of physical activity in leisure were female sex, older age, low education level, nonwhite skin color, smoking, and self-reported poor health; in occupational settings were female sex, white skin color, high education level, self-reported poor health, nonsmoking, and obesity; in transportation settings were female sex; and in household settings, with male sex, separated, or widowed status and high education level. Conclusion: Physical activity in transportation and leisure settings should be encouraged. This study will serve as a reference point in monitoring different types of physical activities and implementing public physical activity policies in developing countries

Epidemiology of Leisure, Transportation, Occupational, and Household Physical Activity: Prevalence and Associated Factors

Background: To estimate the prevalence of and identify factors associated with physical activity in leisure, transportation, occupational, and household settings. Methods: This was a cross-sectional study aimed at investigating living and health conditions among the population of So Paulo, Brazil. Data on 1318 adults aged 18 to 65 years were used. To assess physical activity, the long version of the International Physical Activity Questionnaire was applied. Multivariate analysis was conducted using a hierarchical model. Results: The greatest prevalence of insufficient activity related to transportation (91.7%), followed by leisure (77.5%), occupational (68.9%), and household settings (56.7%). The variables associated with insufficient levels of physical activity in leisure were female sex, older age, low education level, nonwhite skin color, smoking, and self-reported poor health; in occupational settings were female sex, white skin color, high education level, self-reported poor health, nonsmoking, and obesity; in transportation settings were female sex; and in household settings, with male sex, separated, or widowed status and high education level. Conclusion: Physical activity in transportation and leisure settings should be encouraged. This study will serve as a reference point in monitoring different types of physical activities and implementing public physical activity policies in developing countries.

A Constructive Genetic Algorithm for permutation flowshop scheduling

The general flowshop scheduling problem is a production problem where a set of n jobs have to be processed with identical flow pattern on in machines. In permutation flowshops the sequence of jobs is the same on all machines. A significant research effort has been devoted for sequencing jobs in a flowshop minimizing the makespan. This paper describes the application of a Constructive Genetic Algorithm (CGA) to makespan minimization on flowshop scheduling. The CGA was proposed recently as an alternative to traditional GA approaches, particularly, for evaluating schemata directly. The population initially formed only by schemata, evolves controlled by recombination to a population of well-adapted structures (schemata instantiation). The CGA implemented is based on the NEH classic heuristic and a local search heuristic used to define the fitness functions. The parameters of the CGA are calibrated using a Design of Experiments (DOE) approach. The computational results are compared against some other successful algorithms from the literature on Taillard`s well-known standard benchmark. The computational experience shows that this innovative CGA approach provides competitive results for flowshop scheduling; problems. (C) 2007 Elsevier Ltd. All rights reserved.

A novel continuous time representation for the scheduling of pipeline systems with pumping yield rate constraints

Pipeline systems play a key role in the petroleum business. These operational systems provide connection between ports and/or oil fields and refineries (upstream), as well as between these and consumer markets (downstream). The purpose of this work is to propose a novel MINLP formulation based on a continuous time representation for the scheduling of multiproduct pipeline systems that must supply multiple consumer markets. Moreover, it also considers that the pipeline operates intermittently and that the pumping costs depend on the booster stations yield rates, which in turn may generate different flow rates. The proposed continuous time representation is compared with a previously developed discrete time representation [Rejowski, R., Jr., & Pinto, J. M. (2004). Efficient MILP formulations and valid cuts for multiproduct pipeline scheduling. Computers and Chemical Engineering, 28, 1511] in terms of solution quality and computational performance. The influence of the number of time intervals that represents the transfer operation is studied and several configurations for the booster stations are tested. Finally, the proposed formulation is applied to a larger case, in which several booster configurations with different numbers of stages are tested. (C) 2007 Elsevier Ltd. All rights reserved.

Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date

This paper addresses the minimization of the mean absolute deviation from a common due date in a two-machine flowshop scheduling problem. We present heuristics that use an algorithm, based on proposed properties, which obtains an optimal schedule fora given job sequence. A new set of benchmark problems is presented with the purpose of evaluating the heuristics. Computational experiments show that the developed heuristics outperform results found in the literature for problems up to 500 jobs. (C) 2007 Elsevier Ltd. All rights reserved.

Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming

This paper addresses the non-preemptive single machine scheduling problem to minimize total tardiness. We are interested in the online version of this problem, where orders arrive at the system at random times. Jobs have to be scheduled without knowledge of what jobs will come afterwards. The processing times and the due dates become known when the order is placed. The order release date occurs only at the beginning of periodic intervals. A customized approximate dynamic programming method is introduced for this problem. The authors also present numerical experiments that assess the reliability of the new approach and show that it performs better than a myopic policy.

The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm

This paper addresses the single machine scheduling problem with a common due date aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the previous studies in the literature deal with this problem using heuristics and metaheuristics approaches. With the intention of contributing to the study of this problem, a branch-and-bound algorithm is proposed. Lower bounds and pruning rules that exploit properties of the problem are introduced. The proposed approach is examined through a computational comparative study with 280 problems involving different due date scenarios. In addition, the values of optimal solutions for small problems from a known benchmark are provided.

Optimized harvest scheduling in eucalyptus plantations under operational, spatial and climatic constraints

The representation of sustainability concerns in industrial forests management plans, in relation to environmental, social and economic aspects, involve a great amount of details when analyzing and understanding the interaction among these aspects to reduce possible future impacts. At the tactical and operational planning levels, methods based on generic assumptions usually provide non-realistic solutions, impairing the decision making process. This study is aimed at improving current operational harvesting planning techniques, through the development of a mixed integer goal programming model. This allows the evaluation of different scenarios, subject to environmental and supply constraints, increase of operational capacity, and the spatial consequences of dispatching harvest crews to certain distances over the evaluation period. As a result, a set of performance indicators was selected to evaluate all optimal solutions provided to different possible scenarios and combinations of these scenarios, and to compare these outcomes with the real results observed by the mill in the study case area. Results showed that it is possible to elaborate a linear programming model that adequately represents harvesting limitations, production aspects and environmental and supply constraints. The comparison involving the evaluated scenarios and the real observed results showed the advantage of using more holistic approaches and that it is possible to improve the quality of the planning recommendations using linear programming techniques.

Assessing the ex ante economic impacts of transportation infrastructure policies in Brazil

This paper uses a fully operational inter-regional computable general equilibrium (CGE) model implemented for the Brazilian economy, based on previous work by Haddad and Hewings, in order to assess the likely economic effects of road transportation policy changes in Brazil. Among the features embedded in this framework, modelling of external scale economies and transportation costs provides an innovative way of dealing explicitly with theoretical issues related to integrated regional systems. The model is calibrated for 109 regions. The explicit modelling of transportation costs built into the inter-regional CGE model, based on origin-destination flows, which takes into account the spatial structure of the Brazilian economy, creates the capability of integrating the inter-regional CGE model with a geo-coded transportation network model enhancing the potential of the framework in understanding the role of infrastructure on regional development. The transportation model used is the so-called Highway Development and Management, developed by the World Bank, implemented using the software TransCAD. Further extensions of the current model specification for integrating other features of transport planning in a continental industrialising country like Brazil are discussed, with the goal of building a bridge between conventional transport planning practices and the innovative use of CGE models. In order to illustrate the analytical power of the integrated system, the authors present a set of simulations, which evaluate the ex ante economic impacts of physical/qualitative changes in the Brazilian road network (for example, a highway improvement), in accordance with recent policy developments in Brazil. Rather than providing a critical evaluation of this debate, they intend to emphasise the likely structural impacts of such policies. They expect that the results will reinforce the need to better specifying spatial interactions in inter-regional CGE models.

Effects of time delay and transportation on isolation of pathogenic fungi from skin biopsies

BACKGROUND - It is not clear how culture media used during transport and the interval between the biopsy procedure and final processing can affect the successful isolation of fungi. OBJECTIVE - The aim of this study was to investigate the effects of late inoculation of skin biopsies, transported in different sterile fluids, on the isolation rate of pathogenic fungi. METHODS -A total of 278 punch biopsy specimens were collected from 47 patients with suspected lesions of invasive mycoses. Each biopsy was transported in vials with Sabouraud medium with chloramphenicol or saline solution and finally inoculated on Sabouraud agar and 2% chloramphenicol after a 48-72-hour (early) or after 72-hour-7-day (late) interval, comprising four groups of study. RESULTS - The medians of isolation rate of the four sporotrichosis groups were 100%. For paracoccidioidomycosis, the medians ranged from 50% to 84%, with no statistically significant difference among the groups (p=0.88). CONCLUSION - It was concluded that skin biopsies can be transported in Sabouraud medium or saline solution within a 7-day interval from specimen collection up to final inoculation, at room temperature, maintaining viability and growth rate of fungus in culture.

Analysis of Apical Root Transportation Associated with Protaper Universal F3 and F4 Instruments by Using Digital Subtraction Radiography

Introduction: The aim of this study was to assess the occurrence of apical root transportation after the use of Pro Taper Universal rotary files sizes 3 (F3) and 4 (F4). Methods: Instruments were worked to the apex of the original canal, always by the same operator. Digital subtraction radiography images were produced in buccolingual and mesiodistal projections. A total of 25 radiographs were taken from root canals of human maxillary first molars with curvatures varying from 23-31 degrees. Quantitative data were analyzed by intraclass correlation coefficient and Wilcoxon nonparametric test (P = .05). Results: Buccolingual images revealed a significantly higher degree of apical transportation associated with F4 instruments when compared with F3 instruments in relation to the original canal (Wilcoxon test, P = .007). No significant difference was observed in mesiodistal images (P = .492). Conclusions: F3 instruments should be used with care in curved canals, and F4 instruments should be avoided in apical third preparation of curved canals. (J Endod 2010;36:1052-1055)