Search results for "Abstract data type"

Partially hyperbolic diffeomorphisms on Heisenberg nilmanifolds and holonomy maps

2014

Abstract In this note we show that all partially hyperbolic automorphisms on a 3-dimensional non-Abelian nilmanifold can be C 1 -approximated by structurally stable C ∞ -diffeomorphisms, whose chain recurrent set consists of one attractor and one repeller. In particular, all these partially hyperbolic automorphisms are not robustly transitive. As a corollary, the holonomy maps of the stable and unstable foliations of the approximating diffeomorphisms are twisted quasiperiodically forced circle homeomorphisms, which are transitive but non-minimal and satisfy certain fiberwise regularity properties.

Toward an urban transport sustainability index: an European comparison

2011

Introduction The aim of paper is to cluster policies of sustainable mobility in order to define an essential set of specific Transport Performance Indicators (TPI). TPIs are standardized measures suitable for analysis in order to appraise the feasibility of a transport policy or an infrastructural project. Data collection of TPIs is a crucial phase, but data detection and monitoring are not standardized at the city level. Thus, there is no a standard for data collection and storing, this aspect makes much difficult to compare different city contexts. This issue is critical and bounds the analysis of built scenarios. A standardized set of transport performance indicators becomes, hence, esse…

Improved heuristics for the regenerator location problem

2014

Telecommunication systems use optical signals to transmit information. The strength of a signal in an optical network deteriorates and loses power as it goes farther from the source, mainly due to attenuation. Therefore, to enable the signal to arrive its intended destination with good quality, it is necessary to regenerate the signal periodically using regenerators. These components are relatively expensive and therefore it is desirable to deploy as few of them as possible in the network. In the regenerator location problem (RLP), we are given an undirected graph, positive edge lengths, and a parameter specifying the maximum length that a signal can travel before its quality deteriorates a…

New insights into the OCST problem

2009

This paper considers the Euclidean variant of the optimal communciation spanning tree (OCST) problem. Researches have analyzed the structure of the problem and found that high quality solutions prefer edges of low cost. Further, edges pointing to the center of the network are more likely to be included in good solutions. We add to the literature and provide additional insights into the structure of the OCST problem. Therefore, we investigate properies of the whole tree, such as node degrees and the Wiener index. The results reveal that optimal solutions are structured in a star-like manner. There are few nodes with high node degrees, these nodes are located next to the graph's center. The m…

Application of graph grammars in music composing systems

1987

Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm

2020

In 1996, Bodlaender showed the celebrated result that an optimal tree decomposition of a graph of bounded treewidth can be found in linear time. The algorithm is based on an algorithm of Bodlaender and Kloks that computes an optimal tree decomposition given a non-optimal tree decomposition of bounded width. Both algorithms, in particular the second, are hardly accessible. We present the second algorithm in a much simpler way in this paper and refer to an extended version for the first. In our description of the second algorithm, we start by explaining how all tree decompositions of subtrees defined by the nodes of the given tree decomposition can be enumerated. We group tree decompositions …

Solving a large multicontainer loading problem in the car manufacturing industry

2017

Abstract Renault, a large car manufacturer with factories all over the world, has a production system in which not every factory produces all the parts required to assemble a vehicle. Every day, large quantities of car parts are sent from one factory to another, defining very large truck/container transportation problems. The main challenge faced by the Renault logistics platforms is to load the items into trucks and containers as efficiently as possible so as to minimize the number of vehicles sent. Therefore, the problem to be solved is a multicontainer loading problem in which, besides the usual geometric constraints preventing items from overlapping and exceeding the dimensions of the c…

Mathematical models for Multi Container Loading Problems with practical constraints

2019

Abstract We address the multi container loading problem of a company that serves its customers’ orders by building pallets with the required products and loading them into trucks. The problem is solved by using integer linear models. To be useful in practice, our models consider three types of constraints: geometric constraints, so that pallets lie completely inside the trucks and do not overlap; weight constraints, defining the maximum weights supported by a truck and by each axle, as well as the position of the centre of gravity of the cargo; and dynamic stability constraints. These last constraints forbid empty spaces between pallets to avoid cargo displacement when the truck is moving, …

The Multi-period Multi-trip Container Drayage Problem with Release and Due Dates

2021

Abstract The Container Drayage Problem (CDP) aims at routing a fleet of trucks, based at a common terminal, to serve customers while minimizing the total travel distance. Each trip starts from and ends at the terminal, and handles a subset of customers. Each customer requires either that a container is picked up or delivered. We introduce a more realistic variant, i.e., the Multi-trip Multi-period CDP with Release and Due Dates (MM-CDP-RDD), in which the planning horizon is composed of several periods (days). On each day, each truck may perform more than one trip respecting the Release and Due Dates (RDD) associated with customer services, corresponding to the first and the last day on whic…

JSSPrediction: a Framework to Predict Protein Secondary Structures Using Integration

2006

Identifying protein secondary structures is a difficult task. Recently, a lot of software tools for protein secondary structure prediction have been produced and made available on-line, mostly with good performances. However, prediction tools work correctly for families of proteins, such that users have to know which predictor to use for a given unknown protein. We propose a framework to improve secondary structure prediction by integrating results obtained from a set of available predictors. Our contribution consists in the definition of a two phase approach: (i) select a set of predictors which have good performances with the unknown protein family, and (ii) integrate the prediction resul…