The Investigation on Cabin Noise Control of Ship Structure Based on SEA Graph Method

Author(s):  
Zeyu Shi ◽  
Xiongliang Yao ◽  
Guoxun Wu ◽  
Yue Tian

The noise of ship structure is mainly transmitted by two types which are air sound and structural sound. As a kind of mechanical energy, sound is produced by the sound source and goes through various transmission paths to the recipient. This process is a process of constant loss of energy. Therefore, according to aspects of noise generation, output, transmission and reception, the principle of cabin noise control can be divided into four aspects which are cabin structure acoustics design, noise source control, noise transfer path and individual protection at the end of cabin. In order to determine the best noise reduction measures, noise control measures should be considered on the basis of three principles of science, advanced nature and economy. Statistical energy analysis (SEA) graph method is compared a series of adjacent loss factor matrices in the SEA model with the data structure of graphs in graph theory, a plurality of transmission path of SEA model can be obtained by giving different weights to adjacent matrix loss factor matrices in SEA model. The problem of finding maximum energy transfer path in the SEA model is actually equivalent to the issue of seeking shortest path in the graph theory. In order to reduce the cabin noise of the ship structure, it is necessary to know the main source and the main energy conduction path of the noise cabin. The problem is translated into K shortest path problem in graph theory. In this paper, acoustical sensitivity analysis of noise reduction design parameter is developed according to sound energy transmission of two layer cavities structure, which can guide the noise reduction design of the ship cabin. The proposed cabin noise control method is applied to the problem of overproof cabin noise, and the optimal noise control scheme is obtained.

2017 ◽  
Vol 27 (1) ◽  
pp. 133-155 ◽  
Author(s):  
Jacek Widuch

Abstract A bicriterion bus routing (BBR) problem is described and analysed. The objective is to find a route from the start stop to the final stop minimizing the time and the cost of travel simultaneously. Additionally, the time of starting travel at the start stop is given. The BBR problem can be resolved using methods of graph theory. It comes down to resolving a bicriterion shortest path (BSP) problem in a multigraph with variable weights. In the paper, differences between the problem with constant weights and that with variable weights are described and analysed, with particular emphasis on properties satisfied only for the problem with variable weights and the description of the influence of dominated partial solutions on non-dominated final solutions. This paper proposes methods of estimation a dominated partial solution for the possibility of obtaining a non-dominated final solution from it. An algorithm for solving the BBR problem implementing these estimation methods is proposed and the results of experimental tests are presented.


2018 ◽  
Vol 66 (4) ◽  
pp. 362-374 ◽  
Author(s):  
Ying Hu ◽  
Chenxi Li ◽  
Feng Han ◽  
Zixin Feng ◽  
Liyan He

Author(s):  
G. H. Shirdel ◽  
B. Vaez-Zadeh

A hypergraph is given by [Formula: see text], where [Formula: see text] is a set of vertices and [Formula: see text] is a set of nonempty subsets of [Formula: see text], the member of [Formula: see text] is named hyperedge. So, a hypergraph is a nature generalization of a graph. A hypergraph has a complex structure, thus some researchers try to transform a hypergraph to a graph. In this paper, we define two graphs, Clique graph and Persian graph. These relations are one to one. We can find the shortest path between two vertices in a hypergraph [Formula: see text], by using the Dijkstra algorithm in graph theory on the graphs corresponding to [Formula: see text].


Sign in / Sign up

Export Citation Format

Share Document