自动化码头运输设备充电策略优化的仿真研究

随着自动化集装箱码头成为当今码头的发展趋势,AGV(automated guided vehicle) 作为自动化码头中使用最为广泛的水平运输工具,合理制定其充电策略至关重要。针对当前自动化集装箱码头中AGV充电策略的不足,提出一种以离线充电为主在线充电为辅的充电策略,并且针对在线充电站点位置选择问题提出一种利用热区图选择有效在线充电站点的快捷方法。在使用该种充电策略情况下,通过大量仿真实验得出在码头工作任务量不变的前提下可减少AGV数量配置的结果,说明自动化集装箱码头水平搬运效率得到提高,证明该充电策略具有有效性。     

多重约束下智慧仓储机器人配置仿真优化研究

针对智慧仓库的仓储机器人配置问题,构建了基于排队论的离散事件仿真模型,在保证系统可靠性和服务强度的前提下,考虑到故障对系统的影响,以距离成本、时间成本、空闲成本和购置成本所构成的总成本最小化为目标,提出了一种基于FlexSim平台的离散事件仿真优化方法。通过分析系统平均队长、订单平均逗留时间等指标,将直观化的系统瓶颈与运行实际数据相结合,求得系统成本最小的配置策略。结合实例,对算例中的智慧仓库机器人配置方案进行求解。结果表明,基于FlexSim平台的离散事件仿真寻优方法,能够求解仓储机器人配置的优化方案,并能保证模型方法的计算效率。     

一种群决策中确定专家判断认真程度的方法

给出一种群决策中确定专家判断认真程度的方法。主要思路是通过提取专家判断矩阵的全部信息，确定专家意见的一致程度，从而确定专家判断的认真程度。最后给出一个典型的算例以说明该方法的可行性和有效性。     

Cooperative Mechanism of Supply Chain Under Asymmetric Information

Abstract: The cooperative mechanism is one main issue in the decentralized supply chain system, especially in an asym-metric information structure. We analyze the non-cooperative game behavior of a 2-echelon distribution supply chain,compare the results with the system optimal solution, and give the supplier dominated cooperative mechanisms. We alsoanalyze the validity of our contract under the asymmetric retailers' holding cost information and give some useful conclu-sions.     

PO Solution for Scattering by the Complex Object Coated with Anisotropic Materials

1 .INTRODUCTIONItisknownthatphysicaloptics(PO)hasbeenwidelyusedinfastpredictionofradarcrosssection (RCS)ofacomplexconductingorcoatedobject.POisadoptedwithoutexceptionamongtheissuedfamouscomputa tionalsoftwareofhigh frequencyEMscatteringbyacomplexobjectsuchasRECOTA[1 ] ,GRECO[2 ,3] ,X PATCH[4] ,whereonlytheisotropiccoatingisconcerned .However,theanisotropiccoatingencoun teredinsomepracticalapplicationsimpelsonetofindthesuitablesolutionforhigh frequencyscatteringbytheobjectcoatedwi…     

网络最大流的割集矩阵算法

利用网络单位流量及网络可行流的流量平衡关系,得出流量关系矩阵,由流量关系矩阵,得出网络割矩阵,从而求出网络图的割集,最后根据网络最大流等于最小割容量,求得网络最大流,此方法使得计算网络最大流变得简便,且具有很强的实用性.     

企业技改投资项目的决策分析

以某个企业技改项目投资决策为例，给出一个交互式多目标决策过程。应用起来较为简单、实用，易于计算机实现求解过程。该过程充分考虑企业进行决策时的实际情况及环境和人的主管偏好，所得结果更合理。     

Pre-processing for time domain image formation in SS-BSAR system

A pre-processing procedure is designed for a space-surface bistatic synthetic aperture radar (SS-BSAR) system when a time domain image formation algorithm is employed. Three crucial technical issues relating to the procedure are fully discussed. Firstly, unlike image formation algorithms operating in the frequency domain, a time domain algorithm requires the accurate global navigation satellite system (GNSS) time and position. This paper proposes acquisition of this information using a time-and-spatial transfer with precise ephemeris and interpolation. Secondly, synchronization errors and compensation methods in SS-BSAR are analyzed. Finally, taking the non-ideal factors in the echo and the compatibility of image formation algorithms into account, a matched filter based on the minimum delay is constructed. Experimental result using real data suggest the pre-processing is functioning properly.     

Adaptive robust control of mobile satellite communication system with disturbance and model uncertainties

The tracking and stable control of a typical shipmounted mobile satellite communication system(MSCS) is studied.Unlike the former studies based on simplified single-axis models,a tri-axis nonlinear model including the kinematic and dynamic features of the MSCS is used as the control object.An adaptive robust controller with trajectory planning is designed to deal with large parametric uncertainties and uncertain nonlinearities of the system.A theoretic performance result is given and proved.The designed adaptive robust controller and other two traditional controllers are tested in the comparative simulations under three different situations.The simulation results show the tracking and stable validity of the proposed controller.     

Analysis of minimum numbers of linearly active S-boxes of a class of generalized feistel block ciphers

For a class of generalized Feistel block ciphers,an explicit formula for the minimum numbers of linearly active S-boxes of any round r is presented.