We develop an aerodynamic loading assignment model for intermodal freight trains based on an integer-programming framework to help terminal managers make up more fuel-efficient trains. This is the first use of optimization modeling to address the aerodynamics and energy efficiency of railroad intermodal trains. Several recommendations regarding railway equipment use, operations, and policy are ...

In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V,E) (e.g. the railroad network) and a set H of paths in G (e.g. the train lines), we want to draw the paths along the edges of G such that they cross each other as few times as possible. For aesthetic reasons we insist that the relative order of the paths that traverse a ve...

Subject of research: mixed-integer 0-1 linear programming problem for choosing optimal structures non-elementary regression models.
 Purpose integrate into the additional constraints that will guarantee construction quite interpretable regressions.
 Methods analysis, mathematical programming, method successive increase absolute contributions variables to general determination.
 O...

in this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. the steps of this algorithm are designed very efficient. for generating an initial solution, we develop an efficient constructive heuristic by modifying the best known neh algorithm. effectiveness of the proposed iterated greedy algorithm is t...

The dark channel prior (DCP) technique is an effective method to enhance hazy images. Dark channel is an image with the same size as the hazy image which represents the haze severity in different places of the image. The DCP method suffers from two problems: it is incapable for removing haze from smooth regions, causing blocking effects on these areas; it cannot properly reduce a haze with a no...

We study the problem of computing schematized versions of network maps, like railroad or highway maps. Every path of the schematized map has two or three links with restricted orientations, and the schematized map must be topologically equivalent to the input map. Our approach can handle several types of schematizations, and certain additional constraints can be added, such as a minimum vertica...

This chapter describes a timed process algebra, called ACSR, which supports time-consuming actions and instantaneous events. Actions model the usage of shared resources and the passage of time, whereas events allow synchronization between processes. To be able to specify real-time systems accurately, ACSR supports static priorities that can be used to arbitrate between actions competing for sha...