A multi-criteria decision method for the analysis of the Motorways of the Sea: the application to the case of France and Spain on the Atlantic Coast

Despite European Union (EU) political support to identify the most feasible Motorways of the Sea, the final decision can only be made by Private Shipping Companies, which are operators of a unique stretch of the intermodal chain. This paper provides a multi-criteria decision method to identify the most suitable Motorways of the Sea taking into account the competitiveness of whole intermodal routes versus the alternative of road transport from the loader’s perspective. The analysis is carried out assuming a ‘many-to-many’ transport model. Firstly indexes of time and cost were defined and evaluated for every available route in the model in accordance with a multi-criteria decision matrix. Secondly, through a Monte Carlo simulation a sensitivity analysis was carried out in order to evaluate the influence on the results of the forecast assumed to construct the matrix. The results obtained are not only quantitative, but also qualitative. The development of intermodal routes via Motorways of the Sea is especially relevant for the peripheral EU countries. Due to the relevance of the freight flow between France and Spain and the congestion of their connections through the Pyrenees, the method proposed was applied to the analysis of this particular case     

Optimal Age Replacement Policy with Replacement Occurrence While the Warranty is in Effect

This study considers an age replacement policy(ARP) for a repairable product with an increasing failure rate with and without a product warranty. As for the warranty policy to consider in association with such an age replacement policy, we adapt a renewable minimal repair-replacement warrant(MRRW) policy with 2D factors of failure time of the product and its corresponding repair time. The expected cost rate during the life cycle of the product is utilized as a criterion to find the optimal policies for both with and without the product warranty. We determine the optimal replacement age that minimizes the objective function which evaluates the expected cost rate during the product cycle and investigate the impact of several factors on the optimal replacement age. The main objective of this study lies on the generalization of the classical age replacement policy to the situation where a renewable warranty depending on 2D factors is in effect. We present some interesting observations regarding the effect of relevant factors based on numerical analysis.     

Sharing piping CAD models of ocean plants based on international standards

In the shipbuilding industry, different computer-aided design (CAD) systems are used for different design domains, structure, and outfitting. We need to exchange data among different CAD systems such as Tribon, AutoCAD, Intergraph or PDMS to complete the whole design and production process. There are two approaches to data exchange. One is direct translation; the other is indirect translation, which is based on a neutral format. If we use a neutral format, the data specification is open to the public and the design model can be used by other CAD systems, including next-generation CAD systems. In this paper, we propose an indirect method that uses ISO 10303 (STandard for the Exchange of Product model data) AP227 and ISO 15926 to define neutral formats. A separate ShapeDB is constructed to manage the geometry information, referenced to the catalogue data defined by ISO 15926. An experimental implementation for data exchange between Tribon and PDMS is described.     

Method to simplify ship outfitting and offshore plant equipment three-dimensional (3-D) computer-aided design (CAD) data for construction of an equipment catalog

The construction of an equipment catalog is necessary in ship outfitting and offshore plant design. We investigated the present status of equipment catalogs in shipyards and revealed several requirements for the catalogs, which are manually created and time-consuming. We defined the requirements by analyzing the construction procedure of the equipment catalog and conducted interviews with shipyard employees. In addition, problems with conventional equipment catalog construction are described, and a new procedure for the construction of an equipment catalog is introduced. By analyzing shipyard requirements, criteria for simplification (including volume, ports, and the outer boundary) are defined. Further analysis of technological factors for simplification is performed, and the results of implementing the simplification system are described. The proposed system is verified using three test cases used on site.     

Some features of non-linear travel time models for dynamic traffic assignment

Abstract

This paper investigates some features of non-linear travel time models for dynamic traffic assignment (DTA) that adopt traffic on the link as the sole determinant for the calculation of travel time and have explicit relationships between travel time and traffic on the link. Analytical proofs and numerical examples are provided to show first-in-first-out (FIFO) violation and the behaviour of decreasing outflow with increasing traffic in non-linear travel time models. It is analytically shown that any non-linear travel time model could violate FIFO in some circumstances, especially when inflow drops sharply, and some convex non-linear travel time models could show behaviour with outflow decreasing as traffic increases. It is also shown that the linear travel time model does not show these behaviours. A non-linear travel time model in general form was used for analytical proofs and several existing non-linear travel time models were adopted for numerical examples. Considering the features addressed in this study, non-linear travel time models seem to have limitations for use in DTA in practical terms and care should be taken when they are used for modelling time-varying transportation networks.     

Traffic Performance Models for Dynamic Traffic Assignment: An Assessment of Existing Models

Abstract

This paper provides a review of the traffic performance models for dynamic traffic assignment (DTA) and it identifies the strength and weakness of existing models. Requirements for traffic performance models are identified and various forms of existing traffic performance models for DTA are reviewed and analysed according to the requirements. Non‐linear travel time models are shown to have some deficiencies that make them unsuitable for the analysis of time‐varying transportation networks. Even though linear‐type travel time models are identified as good candidates for the analysis of dynamic transportation networks, they have limitations from the practical point of view that travel time increases only linearly with the amount of traffic on the link. This poses a dilemma and it seems to be one whose resolution is an imminent precondition for DTA modelling to progress in a way that is both theoretically coherent and plausible in practical terms.     

Precise estimation of connections of metro passengers from Smart Card data

The aim of this study is to estimate both the physical and schedule-based connections of metro passengers from their entry and exit times at the gates and the stations, a data set available from Smart Card transactions in a majority of train networks. By examining the Smart Card data, we will observe a set of transit behaviors of metro passengers, which is manifested by the time intervals that identifies the boarding, transferring, or alighting train at a station. The authenticity of the time intervals is ensured by separating a set of passengers whose trip has a unique connection that is predominantly better by all respects than any alternative connection. Since the connections of such passengers, known as reference passengers, can be readily determined and hence their gate times and stations can be used to derive reliable time intervals. To detect an unknown path of a passenger, the proposed method checks, for each alternative connection, if it admits a sequence of boarding, middle train(s), and alighting trains, whose time intervals are all consistent with the gate times and stations of the passenger, a necessary condition of a true connection. Tested on weekly 32 million trips, the proposed method detected unique connections satisfying the necessary condition, which are, therefore, most likely true physical and schedule-based connections in 92.6 and 83.4 %, respectively, of the cases.     

A solution algorithm for a dynamic deterministic user equilibrium assignment model with departure time choice

Abstract

A route-based combined model of dynamic deterministic route and departure time choice and a solution method for many origin and destination pairs is proposed. The divided linear travel time model is used to calculate the link travel time and to describe the propagation of flow over time. For the calculation of route travel times, the predictive ideal route travel time concept is adopted. Solving the combined model of dynamic deterministic route and departure time choice is shown to be equivalent to solving simultaneously a system of non-linear equations. A Newton-type iterative scheme is proposed to solve this problem. The performance of the proposed solution method is demonstrated using a version of the Sioux Falls network. This shows that the proposed solution method produces good equilibrium solutions with reasonable computational cost.     

A model and solution algorithm for dynamic deterministic user equilibrium assignment

Abstract

In this paper a route-based dynamic deterministic user equilibrium assignment model is presented. Some features of the linear travel time model are first investigated and then a divided linear travel time model is proposed for the estimation of link travel time: it addresses the limitations of the linear travel time model. For the application of the proposed model to general transportation networks, this paper provides thorough investigations on the computational issues in dynamic traffic assignment with many-to-many OD pairs and presents an efficient solution procedure. The numerical calculations demonstrate that the proposed model and solution algorithm produce satisfactory solutions for a network of substantial size with many-to-many OD pairs. Comparisons of assignment results are also made to show the impacts of incorporation of different link travel time models on the assignment results.