HEURISTIC MODELING FOR A DYNAMIC AND GOAL PROGRAMMING IN PRODUCTION PLANNING OF CONTINUOUS MANUFACTURING SYSTEMS

At the first sight it seems that advanced operation research is not used enough in continuous production systems as comparison with mass production, batch production and job shop systems, but really in a comprehensive evaluation the advanced operation research techniques can be used in continuous production systems in developing countries very widely, because of initial inadequate plant layout, stage by stage development of production lines, the purchase of second hand machineries from various countries, plurality of customers. A case of production system planning is proposed for a chemical company in which the above mentioned conditions are almost presented. The goals and constraints in this issue are as follows： （1） Minimizing deviation of customer＇s requirements. （2） Maximizing the profit. （3） Minimizing the frequencies of changes in formula production. （4） Minimizing the inventory of final products. （5） Balancing the production sections with regard to rate in production. （6） Limitation in inventory of raw material. The present situation is in such a way that various techniques such as goal programming, linear programming and dynamic programming can be used. But dynamic production programming issues are divided into two categories, at first one with limitation in production capacity and another with unlimited production capacity. For the first category, a systematic and acceptable solution has not been presented yet. Therefore an innovative method is used to convert the dynamic situation to a zero- one model. At last this issue is changed to a goal programming model with non-linear limitations with the use of GRG algorithm and that＇s how it is solved.

A Cooperation-planning Model Based on Bilevel Programming Decision

This paper is based on a resource constrained active network project;the constraint of the local resource and the time constraint of the cooperation resource are considered simultaneously.And the respective benefit of the manager and cooperation partners is also considered simultaneously.And a cooperation planning model based on bilevel multi-objective programming is de- signed,according to the due time and total cost.And an extended CNP based on the permitted range for resource and time requests is presented.A larger task set in scheduling cycle is on the permitting for the request of cooperation resource and time while the task manager itself may be permitted biding for tasks.As a result,the optimization space for the cooperation planning is enlarged.So not every bidding task is successfully bid by invitee,and the task manager itself takes on some bidding tasks.Finally,the genetic algorithm is given and the validity and feasibility of the model is proved by a case.

Novel integrated optimization algorithm for trajectory planning of robot manipulators based on integrated evolutionary programming

Optimal trajectory planning for robot manipulators plays an important role in implementing the high productivity for robots. The performance indexes used in optimal trajectory planning are classified into two main categories: optimum traveling time and optimum mechanical energy of the actuators. The current trajectory planning algorithms are designed based on one of the above two performance indexes. So far, there have been few planning algorithms designed to satisfy two performance indexes simultaneously. On the other hand, some deficiencies arise in the existing integrated optimi2ation algorithms of trajectory planning. In order to overcome those deficiencies, the integrated optimization algorithms of trajectory planning are presented based on the complete analysis for trajectory planning of robot manipulators. In the algorithm, two object functions are designed based on the specific weight coefficient method and ' ideal point strategy. Moreover, based on the features of optimization problem, the intensified evolutionary programming is proposed to solve the corresponding optimization model. Especially, for the Stanford Robot,the high-quality solutions are found at a lower cost.

Study on path planning and compensation of off-line programming for thick walled curve welding

Thick walled curve welding are usually joined by multi-layer and multi-pass welding, which quality and efficiency could be improved by off-line programming of robot welding. However, the precision of off-line programming welding path was decreased due to the deviation between the off-line planned welding path and the actual welding path. A path planning algorithm and a path compensation algorithm of multi-layer and multi-pass curve welding seam for off-line programming of robot welding are developed in this paper. Experimental results show that the robot off-line programming improves the welding efftcieney and precision for thick walled curve welding seam.

A Review of Quantitative Analysis (QA) in Production Planning Decisions Using the Linear Programming Model

The purpose of this paper was to examine the role of quantitative analysis in production planning decisions. This draws from the observed imperatives of quantitative analysis in business decisions and its capacity for predictability and enhanced decision making given the increasingly complex nature of the business environment. The paper therefore addressed the historical evolution of quantitative technique as an efficient and effective decision-making tool. The content of the paper addressed commonly applied quantitative technique in manufacturing firms today which is, linear programming and its subsequent impact on production planning decisions. The results based on a congruence of views revealed that the “best-fit” application of quantitative analysis models and tools can untangle the complexities of production and planning decision making process in order to achieve the organizational goal. This is, as literature also showed that there is obviously no consensus or integrated model that is capable of solving all managerial problem, different models such as the linear programming model have however been developed to cater for different problems as they arise. The workability or suitability of quantitative analysis is actually premised on its appropriate application. The paper recommends the application of quantitative analysis using linear programming in solving various resource allocation related issues in the primary production planning function of manufacturing firms.

China's Biotechnology Development Program during the Tenth Five-Year Plan Period (2001-2005)

Bioengineering TechnoIogy(Ⅰ)1. Crop molecular marker-assisted selection and pyramiding breeding technology2. Super hybrid

China's Biotech Achievements——Development of China's 863 Program in the Ninth Five-Year Plan Period

Modern biotechnology booms in the molecular life science. It brings about a promising future for improving human health, foodstuff, environment and energy and is of significance to improve traditional agriculture, druamakins and other

Study on the Programming Standard for Ecological Rescue in General Land Use Planning

This paper aims at establishing the operation idea based on the analysis of the connotation,principles and reference indexes for programming standard for ecological rescue.The paper puts forward that the programming standard should take into account the natural,social and economic reference indexes,and modifies the scale and distribution of the ecological rescue according to the order of ecological safety,social safety and economic development.The paper suggests that the land planning department should strengthen the study and datum accumulation in order to establish the technology regulations of programming standard of the ecological rescue.

机耕道自动驾驶农机局部路径规划

针对机耕道场景下自动驾驶农机行驶的安全性、平稳性与规划实时性的实际需求,该研究提出了一种基于二次规划的局部路径规划方法。首先基于有限状态机构建农机机耕道行驶模式,其次采用横纵向解耦的方法,通过改进状态栅格法分别对农机速度行为和轨迹行为进行决策,随后利用二次规划方法生成满足多目标、多约束条件的农机轨迹和速度,得到最优路径,最后在多种行驶环境中进行仿真和实车试验,行驶参考速度为2 m/s。实车试验结果表明,在绕行静态障碍物场景中,规划轨迹的平均绝对曲率为0.021 m^(-1),最大绝对曲率为0.056 m^(-1),平均绝对横向误差为3.23 cm,最大绝对横向误差为8.69 cm,农机与障碍物外轮廓的距离大于0.76 m;在规避相向行驶、同向行驶和横穿机耕道的动态障碍物场景中,规划速度的平均绝对速度误差为0.08~0.12 m/s,绝对速度误差小于0.38 m/s,加速度变化范围为-0.38~0.44 m/s^(2)。在规划周期为200 ms的仿真试验中,该文算法平均耗时48 ms,最大耗时75 ms,相比采用静态状态栅格法平均耗时减少38 ms,算法效率提升44%。研究结果可为机耕道场景下的农机局部路径规划提供技术支持。

Two-Phase Multi Objective Fuzzy Linear Programming Approach for Sustainable Irrigation Planning

The objective of the present study is to develop the irrigation planning model and to apply the same in the form of Two-Phase Multi Objective Fuzzy Linear Programming (TPMOFLP) approach for crop planning in command area of Jayakwadi Project Stage I, Maharashtra State, India. The development of TPMOFLP model is on the basis of various Linear Programming (LP) models and Multi Objective Fuzzy Linear Programming (MOFLP) models, these models have been applied for maximization of the Net Benefits (NB), Crop production (CP), Employment Generation (EG) and Manure Utilization (MU) respectively. The significant increase in the value of level of satisfaction (λ) has been found from 0.58 to 0.65 by using the TPMOFLP approach as compare to that of MOFLP model based on maxmin approach. The two-phase approach solution provides NB = 1503.56 Million Rupees, CP = 335729.30 Tons, EG = 29.74 Million Man days and MU = 160233.70 Tons respectively. The proposed model will be helpful for the Decision Maker (DM) to take a decision under conflicting situation while planning for different conflicting objectives simultaneously and has potential to find out an integrated irrigation planning with prime consideration for economic, social and environmental issue.

受限泊车通道下自动驾驶平行泊车的路径规划方法

针对受限泊车通道下自动泊车规划时间长、成功率低等问题,提出了一种改进混合A^(*)算法的路径规划方法。首先,将泊车路径分为前进的位姿调整段与后退的倒车入库段两部分,通过建立直线-圆弧的约束优化模型规划位姿调整段,寻找合适的倒车起始点;其次,通过在混合A^(*)算法中额外引入碰撞风险代价,改进节点扩展方式,并通过判断车辆轮廓线是否与障碍物线相交来进行碰撞检测,以提高倒车入库段规划的实时性和安全性;最后,以路径长度、平滑度、偏离度为指标设计目标函数,并考虑汽车的运动学约束,使用二次规划对初始路径进行平滑,得到最终路径。使用MATLAB对改进算法与原始算法进行仿真分析,结果表明:在受限泊车通道下,改进算法能得到平滑的无碰撞泊车路径,搜索时间比混合A^(*)算法减少了23.8%,且所得路径更安全,更易进行跟踪控制。

基于线性化方法的交直流混合配电系统网架规划

随着配电系统中直流设备的大量接入,交直流混合配电系统得到越来越广泛的应用。为适应交直流混合配电系统中不同交直流(AC/DC)类型的负荷或电源的接入,提出一种新的交直流混合配电系统网架结构规划方法,该方法考虑了网架交直流配置的所有可能性。首先以二进制网络矩阵描述配电系统的网架结构;其次建立网架单层规划模型,将规划变量和运行变量同时进行优化以提升全局寻优能力;最后将单层规划模型进行线性化处理,转换为混合整数线性规划问题以提升求解效率。仿真结果表明,所提方法能够为配电系统中不同交直流类型的负荷和电源的接入提供最佳的网架配置方案,相比于传统的纯交流规划方案具有更好的经济性和供电能力,在算法上与经典遗传算法求解的双层规划方法相比,具有更好的全局寻优能力和计算效率。

低轨星座传感器资源调度的自主任务规划建模方法

低轨星座传感器资源的优化调度是复杂多约束下的任务规划问题,为了满足多个运动目标全程跟踪与监视的资源实时优化调度需求,提出一种星上自主快速求解的规划模型.在对自主任务规划问题进行详细建模的基础上,考虑各项约束条件与优化因素,将原问题转化成简易的0-1线性整数规划模型,并构建多目标跟踪试验场景对所提方法进行了仿真验证.仿真结果表明,基于简易规划模型的资源调度可实现多目标的全程跟踪与监视.

声誉规划视域下的国际中文教育——基于欧洲中文教育机构语言文化活动的实证研究

本研究以欧洲中文教育机构官网报道为数据源,基于2018年~2022年间欧洲中文教育活动新闻报道3228条,从形式、功能、形象三个方面对这些报道进行分析。研究发现:形式上,欧洲中文教育主体多元,在层级间或国家间不同主体也存在互动合作;功能上,在推动中文应用领域方面取得进展,尤其在教育、媒体以及图书出版三个高声誉领域;形象上,各机构展示了中文的多种形象,促进了中文的经济和文化价值塑造。

国家战略目标导向的科研:“863”计划与“973”计划

通过对国家战略目标导向下的两个国家重大科技计划——“863”计划和“973”计划的深度解读分析,从任务提出背景、组织管理机制、效益与影响三方面揭示国家战略目标导向下科研工作组织的理念和运行机制,分析了政府、市场和专家在服务国家战略目标的科研活动中所扮演的角色,以及自由探索与国家目标之间的关系,并以此启发未来科技举国体制的实施。

老年慢性心力衰竭患者自我容量管理方案的构建及应用

目的:构建老年慢性心力衰竭患者自我容量管理方案并评价其临床应用效果,以期提高老年慢性心力衰竭患者的自我护理能力。方法:基于计划行为理论,运用德尔菲法构建老年慢性心力衰竭患者自我容量管理方案,方案包括行为态度、主观规范、知觉行为控制、行为意向到行为产生4个维度。便利选取北京市某三级甲等医院2022年6月至2023年1月入院的老年慢性心力衰竭患者为研究对象,以2022年6月—9月的47例患者为对照组,采用常规护理方法;以2022年10月至2023年1月的44例患者为干预组,采用常规护理结合自我容量管理方案的方法。3个月后,比较两组患者的自我护理能力、容量相关指标、心血管不良事件发生率。结果:3个月后,干预组患者的自我护理能力得分低于对照组(P<0.001),脑钠肽水平和体质量降低幅度大于对照组(P<0.001);干预组患者的左室舒张末内径缩小,对照组患者左室舒张末内径扩大,两组变化趋势不同(P=0.036);两组患者心血管不良事件发生率比较,差异无统计学意义(P=0.138)。结论:本研究构建的老年慢性心力衰竭患者自我容量管理方案的应用可以提高患者的自我管理能力和容量管理效果,可为老年慢性心力衰竭的自我容量管理提供参考。

考虑运行图抽线调整的城际铁路动车周转计划编制

针对现有城际铁路动车组周转计划编制方法未考虑运行线客座率分布,导致抽线调整时难以单独停运低客座率车次而不影响高客座率车次的问题,本文提出一种适用于运行图抽线调整的动车组周转计划优化编制方法。以最小化动车组使用数量及交路中运行线客座率差异为目标,考虑满足一级修等约束条件,构建非线性整数规划模型;通过线性化处理并结合Hierholzer's算法筛选合格解的方式,高效求解模型。案例分析表明:相较于只考虑动车组使用数量的传统方法,该模型在不增加动车组使用数量的情况下,可以显著降低各交路中运行线客座率的差异。优化后的交路中运行线客座率极差提高了68.67%,交路中运行线客座率方差之和降低至对比方案的66.27%。抽线调整时,采用优化方案能够更精确地优先取消低客座率运行线,有效保留高客座率运行线。在抽线条数分别设定为1,2,3的情况下,优化方案停开的运行线中,客座率低于60%的运行线的占比均保持在77%以上,而对比方案中该比例均未超过45%;优化方案中被取消车次的平均客座率比对比方案分别降低了4.48%、5.88%和6.01%。

基于动态优先级的机坪车辆避冲突运行规划方法

【目的】针对机坪车机混行环境,提出了一种考虑动态优先级的避冲突运行规划方法。【方法】首先,从作业效率和运行风险两个层面,提出动态优先级计算方法,完善了多类型保障车辆时变冲突风险划分的规则。其次,考虑保障车辆运行规则和物理特性,建立了考虑行驶和等待时间最小化的混合整数规划模型。最后,设计全局路径优化的两阶段算法进行求解,并通过低时间复杂度的改进冲突探测方法,弥补了传统方法求解大规模复杂问题在时效性方面的不足。【结果】实验表明,设计的算法在大、小规模场景均有较好的适用性,相比对照算法,冲突优化幅度提升7.6%,车辆与航空器冲突占比降低7.5%。【结论】所提方法满足了保障车辆差异化运行要求,实现了车辆和航空器混合运行环境下避冲突路径规划的功能。