Dynamic Location Method for Shallow Ocean Bottom Nodes Using the Levenberg-Marquart Algorithm

Ocean bottom node(OBN)data acquisition is the main development direction of marine seismic exploration;it is widely promoted,especially in shallow sea environments.However,the OBN receivers may move several times because they are easily affected by tides,currents,and other factors in the shallow sea environment during long-term acquisition.If uncorrected,then the imaging quality of subsequent processing will be affected.The conventional secondary positioning does not consider the case of multiple movements of the receivers,and the accuracy of secondary positioning is insufficient.The first arrival wave of OBN seismic data in shallow ocean mainly comprises refracted waves.In this study,a nonlinear model is established in accordance with the propagation mechanism of a refracted wave and its relationship with the time interval curve to realize the accurate location of multiple receiver movements.In addition,the Levenberg-Marquart algorithm is used to reduce the influence of the first arrival pickup error and to automatically detect the receiver movements,identifying the accurate dynamic relocation of the receivers.The simulation and field data show that the proposed method can realize the dynamic location of multiple receiver movements,thereby improving the accuracy of seismic imaging and achieving high practical value.

Optimal Configuration of Fault Location Measurement Points in DC Distribution Networks Based on Improved Particle Swarm Optimization Algorithm

The escalating deployment of distributed power sources and random loads in DC distribution networks hasamplified the potential consequences of faults if left uncontrolled. To expedite the process of achieving an optimalconfiguration of measurement points, this paper presents an optimal configuration scheme for fault locationmeasurement points in DC distribution networks based on an improved particle swarm optimization algorithm.Initially, a measurement point distribution optimization model is formulated, leveraging compressive sensing.The model aims to achieve the minimum number of measurement points while attaining the best compressivesensing reconstruction effect. It incorporates constraints from the compressive sensing algorithm and networkwide viewability. Subsequently, the traditional particle swarm algorithm is enhanced by utilizing the Haltonsequence for population initialization, generating uniformly distributed individuals. This enhancement reducesindividual search blindness and overlap probability, thereby promoting population diversity. Furthermore, anadaptive t-distribution perturbation strategy is introduced during the particle update process to enhance the globalsearch capability and search speed. The established model for the optimal configuration of measurement points issolved, and the results demonstrate the efficacy and practicality of the proposed method. The optimal configurationreduces the number of measurement points, enhances localization accuracy, and improves the convergence speedof the algorithm. These findings validate the effectiveness and utility of the proposed approach.

Optimization of Charging/Battery-Swap Station Location of Electric Vehicles with an Improved Genetic Algorithm-Based Model

The joint location planning of charging/battery-swap facilities for electric vehicles is a complex problem.Considering the differences between these two modes of power replenishment,we constructed a joint location-planning model to minimize construction and operation costs,user costs,and user satisfaction-related penalty costs.We designed an improved genetic algorithm that changes the crossover rate using the fitness value,memorizes,and transfers excellent genes.In addition,the present model addresses the problem of“premature convergence”in conventional genetic algorithms.A simulated example revealed that our proposed model could provide a basis for optimized location planning of charging/battery-swapping facilities at different levels under different charging modes with an improved computing efficiency.The example also proved that meeting more demand for power supply of electric vehicles does not necessarily mean increasing the sites of charging/battery-swap stations.Instead,optimizing the level and location planning of charging/battery-swap stations can maximize the investment profit.The proposed model can provide a reference for the government and enterprises to better plan the location of charging/battery-swap facilities.Hence,it is of both theoretical and practical value.

Improved Adaptive Differential Evolution Algorithm for the Un-Capacitated Facility Location Problem

The differential evolution algorithm is an evolutionary algorithm for global optimization and the un-capacitated facility location problem (UFL) is one of the classic NP-Hard problems. In this paper, combined with the specific characteristics of the UFL problem, we introduce the activation function to the algorithm for solving UFL problem and name it improved adaptive differential evolution algorithm (IADEA). Next, to improve the efficiency of the algorithm and to alleviate the problem of being stuck in a local optimum, an adaptive operator was added. To test the improvement of our algorithm, we compare the IADEA with the basic differential evolution algorithm by solving typical instances of UFL problem respectively. Moreover, to compare with other heuristic algorithm, we use the hybrid ant colony algorithm to solve the same instances. The computational results show that IADEA improves the performance of the basic DE and it outperforms the hybrid ant colony algorithm.

Improved Hybrid ToA/AoA Location Algorithm in NLoS Environments for Wireless Sensor Networks

An improved hybrid Time of Arrival (ToA)/ Angle of Arrival (AoA) location algorithm by adopting Gauss-Newton iterative algorithm is proposed. It is with the advantage of fast convergence and combining with the grid-search-based method to optimize the initial object coordinates of the iteration, meanwhile, under the condition of small measurement errors caused by noises of ToA and AoA, the algorithm performance can be improved effectively. In the Non-Line-of-Sight (NLoS) environments of the Wireless Sensor Network (WSN), simulation results show that improved accuracy is gained with moderate flexibility and fast steady convergence compared with the existing algorithms.

Downhole Microseismic Source Location Based on a Multi-Dimensional DIRECT Algorithm for Unconventional Oil and Gas Reservoir Exploration

Downhole microseismic data has the significant advantages of high signal-to-noise ratio and well-developed P and S waves and the core component of microseismic monitoring is microseismic event location associated with hydraulic fracturing in a relatively high confidence level and accuracy.In this study,we present a multidimensional DIRECT inversion method for microseismic locations and applicability tests over modeling data based on a downhole microseismic monitoring system.Synthetic tests inidcate that the objective function of locations can be defined as a multi-dimensional matrix space by employing the global optimization DIRECT algorithm,because it can be run without the initial value and objective function derivation,and the discretely scattered objective points lead to an expeditious contraction of objective functions in each dimension.This study shows that the DIRECT algorithm can be extensively applied in real downhole microseismic monitoring data from hydraulic fracturing completions.Therefore,the methodology,based on a multidimensional DIRECT algorithm,can provide significant high accuracy and convergent efficiency as well as robust computation for interpretable spatiotemporal microseismic evolution,which is more suitable for real-time processing of a large amount of downhole microseismic monitoring data.

An Exact Virtual Network Embedding Algorithm Based on Integer Linear Programming for Virtual Network Request with Location Constraint

Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.

On Fixed-Parameter Solvability of the Minimax Path Location Problem

The minimax path location problem is to find a path P in a graph G such that the maximum distance d_(G)(v,P)from every vertex v∈V(G)to the path P is minimized.It is a well-known NP-hard problem in network optimization.This paper studies the fixed-parameter solvability,that is,for a given graph G and an integer k,to decide whether there exists a path P in G such that max v∈V(G)d_(G)(v,P)≤k.If the answer is affirmative,then graph G is called k-path-eccentric.We show that this decision problem is NP-complete even for k=1.On the other hand,we characterize the family of 1-path-eccentric graphs,including the traceable,interval,split,permutation graphs and others.Furthermore,some polynomially solvable special graphs are discussed.

Improvements in seismic event locations in a deep western U.S. coal mine using tomographic velocity models and an evolutionary search algorithm

Methods of improving seismic event locations were investigated as part of a research study aimed at reducing ground control safety hazards. Seismic event waveforms collected with a 23-station three-dimensional sensor array during longwall coal mining provide the data set used in the analyses. A spatially variable seismic velocity model is constructed using seismic event sources in a passive tomographic method. The resulting three-dimensional velocity model is used to relocate seismic event positions. An evolutionary optimization algorithm is implemented and used in both the velocity model development and in seeking improved event location solutions. Results obtained using the different velocity models are compared. The combination of the tomographic velocity model development and evolutionary search algorithm provides improvement to the event locations.

New multi-layer data correlation algorithm for multi-passive-sensor location system

Under the scenario of dense targets in clutter, a multi-layer optimal data correlation algorithm is proposed. This algorithm eliminates a large number of false location points from the assignment process by rough correlations before we calculate the correlation cost, so it avoids the operations for the target state estimate and the calculation of the correlation cost for the false correlation sets. In the meantime, with the elimination of these points in the rough correlation, the disturbance from the false correlations in the assignment process is decreased, so the data correlation accuracy is improved correspondingly. Complexity analyses of the new multi-layer optimal algorithm and the traditional optimal assignment algorithm are given. Simulation results show that the new algorithm is feasible and effective.

Approximation Algorithms for the Priority Facility Location Problem with Penalties

develop a mentation This paper considers the priority facility primal-dual 3-approximation algorithm for procedure, the authors further improve the location problem with penalties： The authors this problem. Combining with the greedy aug- previous ratio 3 to 1.8526.

Communication Mechanism and Algorithm of Composite Location Analysis of Emergency Communication based on Rail

The emergency communication system based on rail is an unconventional emergency communication mode,it is a complement equipment for that conventional communication system can’t work while tunnel mine accident occurs.Medium of transmission channel is the widely existing rail in the tunnel.In this paper we analyzed the characteristics of the rail transmission channel,verified the feasibility that information is transmitted by vibration signal in rail,we proposed the realization plan of the system.Communication protocol and processing mechanism suitable for rail transmission are designed according to the characteristics of channel bandwidth and low data transmission.Information communication with low bit rate and low bit error is realized in the communication simulation model.In the simplified model,we realized to transmit recognition speech information,and the error rate of the key text information is low to accept.The most concerned problem of personnel location in the mine disaster rescue is proposed,the composite algorithm is based on the model of signal amplitude attenuation,key node information and data frame transmission delay.Location information of hitting point can be achieved within the simplified model of the experiment.Furthermore,we discuss the characteristics of vibration signals passing through different channels.

PLC-Oriented Access Point Location Planning Algorithm in Smart-Grid Communication Networks

In this study, we investigate the optimal location of access points （APs） to connect end nodes with a service provider through power-line communication in smartgrid communication networks. APs are the gateways of power-distribution communication networks, connecting users to control centers. Hence, they are vital for the reliable, safe, and economical operation of a power system. This paper proposes a planning method for AP allocation that takes into consideration economics, reliability, network delay, and （n-l） resilience. First, an optimization model for the AP location is established, which minimizes the cost of installing APs, while satisfying the reliability, network delay, and （n-1） resilience constraints. Then, an improved genetic algorithm is proposed to solve the optimization problem. The simulation results indicate that the proposed planning method can deal with diverse network conditions satisfactorily. Furthermore, it can be applied effectively with high flexibility and scalability.

Relocation of the 1998 Zhangbei-Shangyi earthquake sequence using the double difference earthquake location algorithm

On January 10, 1998, at 11h50min Beijing Time (03h50min UTC), an earthquake of ML=6.2 occurred in the border region between the Zhangbei County and Shangyi County of Hebei Province. This earthquake is the most significant event to have occurred in northern China in the recent years. The earthquake-generating structure of this event was not clear due to no active fault capable of generating a moderate earthquake was found in the epicentral area, nor surface ruptures with any predominate orientation were observed, no distinct orientation of its aftershock distribution given by routine earthquake location was shown. To study the seismogenic structure of the Zhangbei- Shangyi earthquake, the main shock and its aftershocks with ML3.0 of the Zhangbei-Shangyi earthquake sequence were relocated by the authors of this paper in 2002 using the master event relative relocation technique. The relocated epicenter of the main shock was located at 41.145癗, 114.462癊, which was located 4 km to the NE of the macro-epicenter of this event. The relocated focal depth of the main shock was 15 km. Hypocenters of the aftershocks distributed in a nearly vertical plane striking 180~200 and its vicinity. The relocated results of the Zhangbei-Shangyi earthquake sequence clearly indicated that the seismogenic structure of this event was a NNE-SSW-striking fault with right-lateral and reverse slip. In this paper, a relocation of the Zhangbei-Shangyi earthquake sequence has been done using the double difference earthquake location algorithm (DD algorithm), and consistent results with that obtained by the master event technique were obtained. The relocated hypocenters of the main shock are located at 41.131癗, 114.456癊, which was located 2.5 km to the NE of the macro-epicenter of the main shock. The relocated focal depth of the main shock was 12.8 km. Hypocenters of the aftershocks also distributed in a nearly vertical N10E-striking plane and its vicinity. The relocated results using DD algorithm clearly indicated that the seismogenic structure of this event was a NNE-striking fault again.

Optimum Location of Field Hospitals for COVID-19: A Nonlinear Binary Metaheuristic Algorithm

Determining the optimum location of facilities is critical in many fields,particularly in healthcare.This study proposes the application of a suitable location model for field hospitals during the novel coronavirus 2019(COVID-19)pandemic.The used model is the most appropriate among the three most common location models utilized to solve healthcare problems(the set covering model,the maximal covering model,and the P-median model).The proposed nonlinear binary constrained model is a slight modification of the maximal covering model with a set of nonlinear constraints.The model is used to determine the optimum location of field hospitals for COVID-19 risk reduction.The designed mathematical model and the solution method are used to deploy field hospitals in eight governorates in Upper Egypt.In this case study,a discrete binary gaining–sharing knowledge-based optimization(DBGSK)algorithm is proposed.The DBGSK algorithm is based on how humans acquire and share knowledge throughout their life.The DBGSK algorithm mainly depends on two junior and senior binary stages.These two stages enable DBGSK to explore and exploit the search space efficiently and effectively,and thus it can solve problems in binary space.

Automatic Driving Material Handling Vehicle Station Location and Scheduling Mathematical Modeling and Analysis

Traditional material handling vehicles often use internal combustion engines as their power source, which results in exhaust emissions that pollute the environment. In contrast, automated material handling vehicles have the advantages of zero emissions, low noise, and low vibration, thus avoiding exhaust pollution and providing a more comfortable working environment for operators. In order to achieve the goals of “peaking carbon emissions by 2030 and achieving carbon neutrality by 2060”, the use of environmentally friendly autonomous material handling vehicles for material transportation is an inevitable trend. To maximize the amount of transported materials, consider peak-to-valley electricity pricing, battery pack procurement, and the construction of charging and swapping stations while achieving “minimum daily transportation volume” and “lowest investment and operational cost over a 3-year settlement period” with the shortest overall travel distance for all material handling vehicles, this paper examines two different scenarios and establishes goal programming models. The appropriate locations for material handling vehicle swapping stations and vehicle battery pack scheduling schemes are then developed using the NSGA-II algorithm and ant colony optimization algorithm. The results show that, while ensuring a daily transportation volume of no less than 300 vehicles, the lowest investment and operational cost over a 3-year settlement period is approximately 24.1 million Yuan. The material handling vehicles follow the shortest path of 119.2653 km passing through the designated retrieval points and have two shortest routes. Furthermore, the advantages and disadvantages of the proposed models are analyzed, followed by an evaluation, deepening, and potential extension of the models. Finally, future research directions in this field are suggested.

Models for Location Inventory Routing Problem of Cold Chain Logistics with NSGA-Ⅱ Algorithm

In this paper,a novel location inventory routing(LIR)model is proposed to solve cold chain logistics network problem under uncertain demand environment. The goal of the developed model is to optimize costs of location,inventory and transportation.Due to the complex of LIR problem( LIRP), a multi-objective genetic algorithm(GA), non-dominated sorting in genetic algorithm Ⅱ( NSGA-Ⅱ) has been introduced. Its performance is tested over a real case for the proposed problems. Results indicate that NSGA-Ⅱ provides a competitive performance than GA,which demonstrates that the proposed model and multi-objective GA are considerably efficient to solve the problem.

基于改进麻雀搜索算法的3DDV-Hop定位算法

针对经典3DDV-Hop算法定位精度不高的问题,提出一种基于改进麻雀搜索算法优化的改进的3DDV-Hop算法;算法首先通过多通信半径优化传感器节点之间跳数,并且在平均跳距计算过程中引入动态加权因子提高平均跳距计算精度,其次在麻雀搜索算法的基础上融合反向学习策略与萤火虫算法分别对麻雀搜索算法的种群与位置更新迭代进行优化,最后将未知节点坐标计算问题转化成改进后的麻雀搜索算法寻优问题,利用改进后的麻雀搜索算法替代最小二乘法计算未知节点坐标,进一步提高未知节点位置计算精度;经过MATLAB仿真验证,改进算法对比于经典3DDV-Hop算法和相关算法,定位精度得到有效提高。

A Multi-Objective Optimization for Locating Maintenance Stations and Operator Dispatching of Corrective Maintenance

In this study,we introduce a novel multi-objective optimization model tailored for modern manufacturing,aiming to mitigate the cost impacts of operational disruptions through optimized corrective maintenance.Central to our approach is the strategic placement of maintenance stations and the efficient allocation of personnel,addressing a crucial gap in the integration of maintenance personnel dispatching and station selection.Our model uniquely combines the spatial distribution of machinery with the expertise of operators to achieve a harmonious balance between maintenance efficiency and cost-effectiveness.The core of our methodology is the NSGA Ⅲ+Dispatch,an advanced adaptation of the Non-Dominated Sorting Genetic Algorithm Ⅲ(NSGA-Ⅲ),meticulously designed for the selection of maintenance stations and effective operator dispatching.This method integrates a comprehensive coding process,crossover operator,and mutation operator to efficiently manage multiple objectives.Rigorous empirical testing,including a detailed analysis from a taiwan region electronic equipment manufacturer,validated the effectiveness of our approach across various scenarios of machine failure frequencies and operator configurations.The findings reveal that the proposed model significantly outperforms current practices by reducing response times by up to 23%in low-frequency and 28.23%in high-frequency machine failure scenarios,leading to notable improvements in efficiency and cost reduction.Additionally,it demonstrates significant improvements in oper-ational efficiency,particularly in selective high-frequency failure contexts,while ensuring substantial manpower cost savings without compromising on operational effectiveness.This research significantly advances maintenance strategies in production environments,providing the manufacturing industry with practical,optimized solutions for diverse machine malfunction situations.Furthermore,the methodologies and principles developed in this study have potential applications in various other sectors,including healthcare,transportation,and energy,where maintenance efficiency and resource optimization are equally critical.