The existing research of sequential zoning system and simultaneous zoning system mainly focuses on some optimization problems such as workload balance,product assignment and simulation for each system separately.But t...The existing research of sequential zoning system and simultaneous zoning system mainly focuses on some optimization problems such as workload balance,product assignment and simulation for each system separately.But there is little research on comparative study between sequential zoning and simultaneous zoning.In order to help the designers to choose the suitable zoning policy for picker-to-parts system reasonably and quickly,a systemic selection method is presented.Essentially,both zoning and batching are order clustering,so the customer order sheet can be divided into many unit grids.After the time formulation in one-dimensional unit was defined,the time models for each zoning policy in two-dimensional space were established using filling curves and sequence models to link the one-dimensional unit grids.In consideration of "U" shaped dual tour into consideration,the subtraction value of order picking time between sequential zoning and simultaneous zoning was defined as the objective function to select the suitable zoning policy based on time models.As it is convergent enough,genetic algorithm is adopted to find the optimal value of order picking time.In the experimental study,5 different kinds of order/stock keeping unit(SKU) matrices with different densities d and quantities q following uniform distribution were created in order to test the suitability of sequential zoning and simultaneous zoning to different kinds of orders.After parameters setting,experimental orders inputting and iterative computations,the optimal order picking time for each zoning policy was gotten.By observing whether the delta time between them is greater than 0 or not,the suitability of zoning policies for picker-to-parts system were obtained.The significant effect of batch size b,zone number z and density d on suitability was also found by experimental study.The proposed research provides a new method for selection between sequential zoning and simultaneous zoning for picker-to-parts system,and improves the rationality and efficiency of selection process in practical design.展开更多
Immune evolutionary algorithms with domain knowledge were presented to solve the problem of simultaneous localization and mapping for a mobile robot in unknown environments. Two operators with domain knowledge were de...Immune evolutionary algorithms with domain knowledge were presented to solve the problem of simultaneous localization and mapping for a mobile robot in unknown environments. Two operators with domain knowledge were designed in algorithms, where the feature of parallel line segments without the problem of data association was used to construct a vaccination operator, and the characters of convex vertices in polygonal obstacle were extended to develop a pulling operator of key point grid. The experimental results of a real mobile robot show that the computational expensiveness of algorithms designed is less than other evolutionary algorithms for simultaneous localization and mapping and the maps obtained are very accurate. Because immune evolutionary algorithms with domain knowledge have some advantages, the convergence rate of designed algorithms is about 44% higher than those of other algorithms.展开更多
An active set truncated-Newton algorithm (ASTNA) is proposed to solve the large-scale bound constrained sub-problems. The global convergence of the algorithm is obtained and two groups of numerical experiments are mad...An active set truncated-Newton algorithm (ASTNA) is proposed to solve the large-scale bound constrained sub-problems. The global convergence of the algorithm is obtained and two groups of numerical experiments are made for the various large-scale problems of varying size. The comparison results between ASTNA and the subspace limited memory quasi-Newton algorithm and between the modified augmented Lagrange multiplier methods combined with ASTNA and the modified barrier function method show the stability and effectiveness of ASTNA for simultaneous optimization of distillation column.展开更多
In order to solve three kinds of fuzzy programm model, fuzzy chance-constrained programming mode ng models, i.e. fuzzy expected value and fuzzy dependent-chance programming model, a simultaneous perturbation stochasti...In order to solve three kinds of fuzzy programm model, fuzzy chance-constrained programming mode ng models, i.e. fuzzy expected value and fuzzy dependent-chance programming model, a simultaneous perturbation stochastic approximation algorithm is proposed by integrating neural network with fuzzy simulation. At first, fuzzy simulation is used to generate a set of input-output data. Then a neural network is trained according to the set. Finally, the trained neural network is embedded in simultaneous perturbation stochastic approximation algorithm. Simultaneous perturbation stochastic approximation algorithm is used to search the optimal solution. Two numerical examples are presented to illustrate the effectiveness of the proposed algorithm.展开更多
A hybrid identification model based on multilayer artificial neural networks(ANNs) and particle swarm optimization(PSO) algorithm is developed to improve the simultaneous identification efficiency of thermal conductiv...A hybrid identification model based on multilayer artificial neural networks(ANNs) and particle swarm optimization(PSO) algorithm is developed to improve the simultaneous identification efficiency of thermal conductivity and effective absorption coefficient of semitransparent materials.For the direct model,the spherical harmonic method and the finite volume method are used to solve the coupled conduction-radiation heat transfer problem in an absorbing,emitting,and non-scattering 2D axisymmetric gray medium in the background of laser flash method.For the identification part,firstly,the temperature field and the incident radiation field in different positions are chosen as observables.Then,a traditional identification model based on PSO algorithm is established.Finally,multilayer ANNs are built to fit and replace the direct model in the traditional identification model to speed up the identification process.The results show that compared with the traditional identification model,the time cost of the hybrid identification model is reduced by about 1 000 times.Besides,the hybrid identification model remains a high level of accuracy even with measurement errors.展开更多
This paper addresses the Multi-Vehicle Routing Problem with Time Windows and Simultaneous Pickup and Delivery(MVRPTWSPD),aiming to optimize logistics distribution routes and minimize total costs.A vehicle routing opti...This paper addresses the Multi-Vehicle Routing Problem with Time Windows and Simultaneous Pickup and Delivery(MVRPTWSPD),aiming to optimize logistics distribution routes and minimize total costs.A vehicle routing optimization model is developed based on the operational requirements of the KS Logistics Center,focusing on minimizing vehicle dispatch,loading and unloading,operating,and time window penalty costs.The model incorporates constraints such as vehicle capacity,time windows,and travel distance,and is solved using a genetic algorithm to ensure optimal route planning.Through MATLAB simulations,34 customer points are analyzed,demonstrating that the simultaneous pickup and delivery model reduces total costs by 30.13%,increases vehicle loading rates by 20.04%,and decreases travel distance compared to delivery-only or pickup-only models.The results demonstrate the significant advantages of the simultaneous pickup and delivery mode in reducing logistics costs and improving vehicle utilization,offering valuable insights for enhancing the operational efficiency of the KS Logistics Center.展开更多
The sparse unmixing problem of greedy algorithms still remains a great challenge at finding an optimal subset of endmembers for the observed data from the spectral library,due to the usually high correlation of the sp...The sparse unmixing problem of greedy algorithms still remains a great challenge at finding an optimal subset of endmembers for the observed data from the spectral library,due to the usually high correlation of the spectral library.Under such circumstances,a novel greedy algorithm for sparse unmixing of hyperspectral data is presented,termed the recursive dictionary-based simultaneous orthogonal matching pursuit(RD-SOMP).The algorithm adopts a block-processing strategy to divide the whole hyperspectral image into several blocks.At each iteration of the block,the spectral library is projected into the orthogonal subspace and renormalized,which can reduce the correlation of the spectral library.Then RD-SOMP selects a new endmember with the maximum correlation between the current residual and the orthogonal subspace of the spectral library.The endmembers picked in all the blocks are associated as the endmember sets of the whole hyperspectral data.Finally,the abundances are estimated using the whole hyperspectral data with the obtained endmember sets.It can be proved that RD-SOMP can recover the optimal endmembers from the spectral library under certain conditions.Experimental results demonstrate that the RD-SOMP algorithm outperforms the other algorithms,with a better spectral unmixing accuracy.展开更多
The problem of joint eigenvalue estimation for the non-defective commuting set of matrices A is addressed. A procedure revealing the joint eigenstructure by simultaneous diagonalization of. A with simultaneous Schur d...The problem of joint eigenvalue estimation for the non-defective commuting set of matrices A is addressed. A procedure revealing the joint eigenstructure by simultaneous diagonalization of. A with simultaneous Schur decomposition (SSD) and balance procedure alternately is proposed for performance considerations and also for overcoming the convergence difficulties of previous methods based only on simultaneous Schur form and unitary transformations, it is shown that the SSD procedure can be well incorporated with the balancing algorithm in a pingpong manner, i. e., each optimizes a cost function and at the same time serves as an acceleration procedure for the other. Under mild assumptions, the convergence of the two cost functions alternately optimized, i. e., the norm of A and the norm of the left-lower part of A is proved. Numerical experiments are conducted in a multi-dimensional harmonic retrieval application and suggest that the presented method converges considerably faster than the methods based on only unitary transformation for matrices which are not near to normality.展开更多
Solving large scale system of Simultaneous Linear Equations (SLE) has been (and continue to be) a major challenging problem for many real-world engineering and science applications. Solving SLE with singular coefficie...Solving large scale system of Simultaneous Linear Equations (SLE) has been (and continue to be) a major challenging problem for many real-world engineering and science applications. Solving SLE with singular coefficient matrices arises from various engineering and sciences applications [1]-[6]. In this paper, efficient numerical procedures for finding the generalized (or pseudo) inverse of a general (squareectangle, symmetrical/unsymmetrical, non-singular/singular) matrix and solving systems of Simultaneous Linear Equations (SLE) are formulated and explained. The developed procedures and its associated computer software (under MATLAB [7] computer environment) have been based on “special Cholesky factorization schemes” (for a singular matrix). Test matrices from different fields of applications have been chosen, tested and compared with other existing algorithms. The results of the numerical tests have indicated that the developed procedures are far more efficient than the existing algorithms.展开更多
针对ISAC(integrated sensing and communication)辅助MIMO-OFDM系统中雷达感知信息存在误差时传统信道估计方法性能恶化、导频开销大、计算复杂度高等问题,提出一种面向感知误差的鲁棒两阶段稀疏信道估计框架。第一阶段设计残差能量加...针对ISAC(integrated sensing and communication)辅助MIMO-OFDM系统中雷达感知信息存在误差时传统信道估计方法性能恶化、导频开销大、计算复杂度高等问题,提出一种面向感知误差的鲁棒两阶段稀疏信道估计框架。第一阶段设计残差能量加权的同步正交匹配追踪算法REW-SOMP(residual energy weighted simultaneous orthogonal matching pursuit),通过局部字典自适应扩展与残差加权路径筛选机制,在感知误差下准确提取通信关联路径;第二阶段提出自适应惩罚因子交替方向乘子算法AP-ADMM(adaptive penalty factor alternating direction method of multipliers),动态平衡原始残差与对偶残差以优化信道增益估计,有效解决固定惩罚因子导致的收敛速度与精度矛盾问题。仿真结果表明:在3GPP标准信道下,导频密度仅为6.25%时,所提方法相较于传统宽带算法不仅可获得更好的NMSE性能,且在感知误差大时仍保持鲁棒性,同时显著降低了计算复杂度。展开更多
语义同步定位与地图构建(simultaneous localization and mapping,SLAM)能够帮助移动机器人实现对未知环境更高层次的语义信息感知,已经成为解决移动机器人适应未来发展的关键技术之一。针对移动机器人在弱纹理、存在动态物体的未知境...语义同步定位与地图构建(simultaneous localization and mapping,SLAM)能够帮助移动机器人实现对未知环境更高层次的语义信息感知,已经成为解决移动机器人适应未来发展的关键技术之一。针对移动机器人在弱纹理、存在动态物体的未知境下环境感知能力弱的问题,提出了一种基于稀疏邻接注意力的图像分割算法(SNA-Seg)。首先,设计了基于稀疏邻接窗口自注意机制的全景分割网络结构,在不增加计算复杂度的前提下,充分挖掘全局信息,增强了网络对边缘细节的分割效果。其次,选取Cityscapes数据集作为训练与测试数据集,采用全景质量(panoptic quality,PQ)、分割质量(segmentation quality,SQ)和平均交并比(mIoU)等指标对算法性能进行了评估,并且采集本地视觉图像数据验证了算法的实际有效性。实验结果表明,SNA-Seg算法与基于滑窗注意力(Swin)和邻接注意力(NA)图像分割算法比较,各项评价指标均有不同程度的提升,其中mIoU指标提升幅度达到了11.17%,反映了掩膜分类准确性提升最为显著;在实例分割任务中,SNA-Seg算法展现出更高的分割精度,其输出掩膜与原始图像在边缘细节和语义类别上一致性较强,分割结果更加符合真实场景的语义结构。本文方法为语义SLAM中的全景图像分割任务提供了新的技术思路。展开更多
The velocity distribution of layers from surface wave dispersion curve is a severely nonlinear program. Base on the Metropolis rule,we improved the simulated annealing algorithm to simultaneously inverse the velocitie...The velocity distribution of layers from surface wave dispersion curve is a severely nonlinear program. Base on the Metropolis rule,we improved the simulated annealing algorithm to simultaneously inverse the velocities and thicknesses using the dispersion data and identified the Moho and the bottom of lithosphere. The application to the numerical examples with 5% noise shows the velocity RMS is 1. 56% between the non-linear results and the original models when the condition of selecting method for temperature parameters and initial temperature are satisfied. Using the pure dispersions of Rayleigh wave,the nonlinear inversion has been carried out for S-wave velocities and thicknesses of the vertical profile crossing the Indian Plate,the Qinghai-Tibetan Plateau,and the Tarim Basin. It indicated that the crustal thickness is about 70 km in the Qiangtang block,while in the hinterland of the Qinghai-Tibetan Plateau the lithosphere is relatively thin(~ 130 km)from the velocity values and their offsets.展开更多
基金supported by National Natural Science Foundation of China (Grant No. 50175064)China Scholarship Council (Grant No. 2008622078)Material Handling Industry of America (Grant No. 12251)
摘要The existing research of sequential zoning system and simultaneous zoning system mainly focuses on some optimization problems such as workload balance,product assignment and simulation for each system separately.But there is little research on comparative study between sequential zoning and simultaneous zoning.In order to help the designers to choose the suitable zoning policy for picker-to-parts system reasonably and quickly,a systemic selection method is presented.Essentially,both zoning and batching are order clustering,so the customer order sheet can be divided into many unit grids.After the time formulation in one-dimensional unit was defined,the time models for each zoning policy in two-dimensional space were established using filling curves and sequence models to link the one-dimensional unit grids.In consideration of "U" shaped dual tour into consideration,the subtraction value of order picking time between sequential zoning and simultaneous zoning was defined as the objective function to select the suitable zoning policy based on time models.As it is convergent enough,genetic algorithm is adopted to find the optimal value of order picking time.In the experimental study,5 different kinds of order/stock keeping unit(SKU) matrices with different densities d and quantities q following uniform distribution were created in order to test the suitability of sequential zoning and simultaneous zoning to different kinds of orders.After parameters setting,experimental orders inputting and iterative computations,the optimal order picking time for each zoning policy was gotten.By observing whether the delta time between them is greater than 0 or not,the suitability of zoning policies for picker-to-parts system were obtained.The significant effect of batch size b,zone number z and density d on suitability was also found by experimental study.The proposed research provides a new method for selection between sequential zoning and simultaneous zoning for picker-to-parts system,and improves the rationality and efficiency of selection process in practical design.
基金Projects(60234030 60404021) supported by the National Natural Science Foundation of China
摘要Immune evolutionary algorithms with domain knowledge were presented to solve the problem of simultaneous localization and mapping for a mobile robot in unknown environments. Two operators with domain knowledge were designed in algorithms, where the feature of parallel line segments without the problem of data association was used to construct a vaccination operator, and the characters of convex vertices in polygonal obstacle were extended to develop a pulling operator of key point grid. The experimental results of a real mobile robot show that the computational expensiveness of algorithms designed is less than other evolutionary algorithms for simultaneous localization and mapping and the maps obtained are very accurate. Because immune evolutionary algorithms with domain knowledge have some advantages, the convergence rate of designed algorithms is about 44% higher than those of other algorithms.
基金Project (2002CB312200) supported by the National Key Basic Research and Development Program of China Project(03JJY3109) supported by the Natural Science Foundation of Hunan Province
摘要An active set truncated-Newton algorithm (ASTNA) is proposed to solve the large-scale bound constrained sub-problems. The global convergence of the algorithm is obtained and two groups of numerical experiments are made for the various large-scale problems of varying size. The comparison results between ASTNA and the subspace limited memory quasi-Newton algorithm and between the modified augmented Lagrange multiplier methods combined with ASTNA and the modified barrier function method show the stability and effectiveness of ASTNA for simultaneous optimization of distillation column.
基金National Natural Science Foundation of China (No.70471049)China Postdoctoral Science Foundation (No. 20060400704)
摘要In order to solve three kinds of fuzzy programm model, fuzzy chance-constrained programming mode ng models, i.e. fuzzy expected value and fuzzy dependent-chance programming model, a simultaneous perturbation stochastic approximation algorithm is proposed by integrating neural network with fuzzy simulation. At first, fuzzy simulation is used to generate a set of input-output data. Then a neural network is trained according to the set. Finally, the trained neural network is embedded in simultaneous perturbation stochastic approximation algorithm. Simultaneous perturbation stochastic approximation algorithm is used to search the optimal solution. Two numerical examples are presented to illustrate the effectiveness of the proposed algorithm.
基金supported by the Fundamental Research Funds for the Central Universities (No.3122020072)the Multi-investment Project of Tianjin Applied Basic Research(No.23JCQNJC00250)。
摘要A hybrid identification model based on multilayer artificial neural networks(ANNs) and particle swarm optimization(PSO) algorithm is developed to improve the simultaneous identification efficiency of thermal conductivity and effective absorption coefficient of semitransparent materials.For the direct model,the spherical harmonic method and the finite volume method are used to solve the coupled conduction-radiation heat transfer problem in an absorbing,emitting,and non-scattering 2D axisymmetric gray medium in the background of laser flash method.For the identification part,firstly,the temperature field and the incident radiation field in different positions are chosen as observables.Then,a traditional identification model based on PSO algorithm is established.Finally,multilayer ANNs are built to fit and replace the direct model in the traditional identification model to speed up the identification process.The results show that compared with the traditional identification model,the time cost of the hybrid identification model is reduced by about 1 000 times.Besides,the hybrid identification model remains a high level of accuracy even with measurement errors.
摘要This paper addresses the Multi-Vehicle Routing Problem with Time Windows and Simultaneous Pickup and Delivery(MVRPTWSPD),aiming to optimize logistics distribution routes and minimize total costs.A vehicle routing optimization model is developed based on the operational requirements of the KS Logistics Center,focusing on minimizing vehicle dispatch,loading and unloading,operating,and time window penalty costs.The model incorporates constraints such as vehicle capacity,time windows,and travel distance,and is solved using a genetic algorithm to ensure optimal route planning.Through MATLAB simulations,34 customer points are analyzed,demonstrating that the simultaneous pickup and delivery model reduces total costs by 30.13%,increases vehicle loading rates by 20.04%,and decreases travel distance compared to delivery-only or pickup-only models.The results demonstrate the significant advantages of the simultaneous pickup and delivery mode in reducing logistics costs and improving vehicle utilization,offering valuable insights for enhancing the operational efficiency of the KS Logistics Center.
基金supported by the National Natural Science Foundations of China(Nos.61401200,61201365)
摘要The sparse unmixing problem of greedy algorithms still remains a great challenge at finding an optimal subset of endmembers for the observed data from the spectral library,due to the usually high correlation of the spectral library.Under such circumstances,a novel greedy algorithm for sparse unmixing of hyperspectral data is presented,termed the recursive dictionary-based simultaneous orthogonal matching pursuit(RD-SOMP).The algorithm adopts a block-processing strategy to divide the whole hyperspectral image into several blocks.At each iteration of the block,the spectral library is projected into the orthogonal subspace and renormalized,which can reduce the correlation of the spectral library.Then RD-SOMP selects a new endmember with the maximum correlation between the current residual and the orthogonal subspace of the spectral library.The endmembers picked in all the blocks are associated as the endmember sets of the whole hyperspectral data.Finally,the abundances are estimated using the whole hyperspectral data with the obtained endmember sets.It can be proved that RD-SOMP can recover the optimal endmembers from the spectral library under certain conditions.Experimental results demonstrate that the RD-SOMP algorithm outperforms the other algorithms,with a better spectral unmixing accuracy.
基金The National Natural Science Foundation of China(No.60572072,60496311),the National High Technology Researchand Development Program of China (863Program ) ( No.2003AA123310),the International Cooperation Project on Beyond 3G Mobile of China (No.2005DFA10360).
摘要The problem of joint eigenvalue estimation for the non-defective commuting set of matrices A is addressed. A procedure revealing the joint eigenstructure by simultaneous diagonalization of. A with simultaneous Schur decomposition (SSD) and balance procedure alternately is proposed for performance considerations and also for overcoming the convergence difficulties of previous methods based only on simultaneous Schur form and unitary transformations, it is shown that the SSD procedure can be well incorporated with the balancing algorithm in a pingpong manner, i. e., each optimizes a cost function and at the same time serves as an acceleration procedure for the other. Under mild assumptions, the convergence of the two cost functions alternately optimized, i. e., the norm of A and the norm of the left-lower part of A is proved. Numerical experiments are conducted in a multi-dimensional harmonic retrieval application and suggest that the presented method converges considerably faster than the methods based on only unitary transformation for matrices which are not near to normality.
摘要Solving large scale system of Simultaneous Linear Equations (SLE) has been (and continue to be) a major challenging problem for many real-world engineering and science applications. Solving SLE with singular coefficient matrices arises from various engineering and sciences applications [1]-[6]. In this paper, efficient numerical procedures for finding the generalized (or pseudo) inverse of a general (squareectangle, symmetrical/unsymmetrical, non-singular/singular) matrix and solving systems of Simultaneous Linear Equations (SLE) are formulated and explained. The developed procedures and its associated computer software (under MATLAB [7] computer environment) have been based on “special Cholesky factorization schemes” (for a singular matrix). Test matrices from different fields of applications have been chosen, tested and compared with other existing algorithms. The results of the numerical tests have indicated that the developed procedures are far more efficient than the existing algorithms.
摘要针对ISAC(integrated sensing and communication)辅助MIMO-OFDM系统中雷达感知信息存在误差时传统信道估计方法性能恶化、导频开销大、计算复杂度高等问题,提出一种面向感知误差的鲁棒两阶段稀疏信道估计框架。第一阶段设计残差能量加权的同步正交匹配追踪算法REW-SOMP(residual energy weighted simultaneous orthogonal matching pursuit),通过局部字典自适应扩展与残差加权路径筛选机制,在感知误差下准确提取通信关联路径;第二阶段提出自适应惩罚因子交替方向乘子算法AP-ADMM(adaptive penalty factor alternating direction method of multipliers),动态平衡原始残差与对偶残差以优化信道增益估计,有效解决固定惩罚因子导致的收敛速度与精度矛盾问题。仿真结果表明:在3GPP标准信道下,导频密度仅为6.25%时,所提方法相较于传统宽带算法不仅可获得更好的NMSE性能,且在感知误差大时仍保持鲁棒性,同时显著降低了计算复杂度。
基金sponsored by the National Natural Science Foundation of China(41774069,41504047 and 41604054)
摘要The velocity distribution of layers from surface wave dispersion curve is a severely nonlinear program. Base on the Metropolis rule,we improved the simulated annealing algorithm to simultaneously inverse the velocities and thicknesses using the dispersion data and identified the Moho and the bottom of lithosphere. The application to the numerical examples with 5% noise shows the velocity RMS is 1. 56% between the non-linear results and the original models when the condition of selecting method for temperature parameters and initial temperature are satisfied. Using the pure dispersions of Rayleigh wave,the nonlinear inversion has been carried out for S-wave velocities and thicknesses of the vertical profile crossing the Indian Plate,the Qinghai-Tibetan Plateau,and the Tarim Basin. It indicated that the crustal thickness is about 70 km in the Qiangtang block,while in the hinterland of the Qinghai-Tibetan Plateau the lithosphere is relatively thin(~ 130 km)from the velocity values and their offsets.