共查询到20条相似文献,搜索用时 171 毫秒
1.
在布产品生产过程中,通常要把原料按照一定规则裁剪为合适使用的尺寸.如何剪裁以使余料最少是一个有着直接经济价值的问题.在对问题参数分析的基础上,建立了该问题对应的整数规划模型.在模型求解的具体实现过程中,基于贪婪算法的思想提出了一种求解此优化问题的近似算法,根据近似算法进行合理的组合设计.通过具体算例的计算表明了算法的有效性和可行性,鉴于参数设置的普遍性,所提出的算法具有广泛的实际应用潜力. 相似文献
2.
多用户动态交通分配模型的算法研究 总被引:1,自引:0,他引:1
阐述了多用户行为下的动态交通分配模型。结合迭代动态网络负荷算法和路径选择算法形成动态交通分配新算法,用以求解动态交通分配模型。采用一个算例对此作具体说明。 相似文献
3.
4.
通过对运输决策问题中某种基本情况的研究,建立运力有限情况下单个需求点单一物资运输的研究模型,给出求解模型的算法,通过一个算例进行了验证。与目前文献资料中类似研究模型相比较,在决策中考虑运达概率对运输决策的影响是本文模型的一大突出特点。 相似文献
5.
《江苏科技大学学报(社会科学版)》2017,(2)
为解决网络快速时尚品销售中提前期过长问题,提出一种考虑提前期环节间相互影响和服务水平约束的提前期压缩模型.为加快求解该多极点模型的速度和质量,对模拟退火算法进行改进,增加局部最优解暂存功能并建立自适应步长退火模型.通过算例分析,证明了该压缩模型的有效性. 相似文献
6.
《舰船科学技术》2015,(12):117-122
载波相位GPS测姿实施中,其姿态解算是核心技术之一,目前有多种姿态解算算法,其中对于单基线姿态测量,直接算法因具有原理简单、计算速度快、实时性好等特点被广泛应用。但在舰船测姿实施中,对姿态角的测量会产生一定的误差。采用直接算法在解算中没有对粗大误差和GPS信号缺失进行处理,使得解算结果误差较大。因此提出一种改进的舰船姿态解算算法即基于自适应卡尔曼滤波的姿态解算算法。建立航向角和纵摇角的解算模型,从理论上推导了基线越长,航向角测量精度越高;航向角的解算精度比纵摇角的解算精度高;基于自适应卡尔曼滤波的姿态解算算法的解算精度比直接法的解算精度高。通过仿真实验,对上述推理进行验证,航向角的解算精度比纵摇角的结算精度高出一个数量级;改进算法的解算精度比直接算法的解算精度高出一个数量级。 相似文献
7.
8.
9.
10.
基于量子粒子群算法的船舶电力系统网络重构 总被引:1,自引:0,他引:1
船舶电力系统网络重构可以看作为一个多目标、多约束、多时段、离散化的非线性规划最优问题。根据船舶电网结构的特点,提出了运用量子粒子群算法解决重构问题的思想。加入量子粒子群算法的离散化操作,使之能够满足船舶电网重构模型的要求。仿真结果说明该算法能够得出船舶电力系统网络重构的全局最优解,实现了网络重构最优,并且通过相应的算例与其他优化算法进行横向比较的结果也验证了量子粒子群算法有更好的可行性。 相似文献
11.
Shangyao Yan Chun-Ying Chen Shih-Chun Lin 《Journal of Marine Science and Technology》2009,14(4):417-435
Good short-term ship scheduling and container shipment planning are very important for liner operations; however, in Taiwan,
most such carriers currently utilize a trial-and-error process. In this study, we employ network flow techniques to construct
a model for such activities. A solution algorithm, based on Lagrangian relaxation, a subgradient method, and a heuristic for
the upper-bound solution, is developed to solve the model. To demonstrate and to test how well the model and the solution
algorithm apply in the real world, we performed a case study using operating data from a major Taiwanese marine shipping company.
The test results show that the model and the solution algorithm could be useful references for ship scheduling and container
shipment planning. 相似文献
12.
Dual cycling is an operation technique whereby quay cranes perform loading and unloading operations simultaneously in the same ship bay. In this article, a mixed-integer programming model for quay crane dual-cycling scheduling is developed. The model considers the stowage plan of outbound containers and the operation sequence of quay cranes. To solve the model, a heuristic method, called bi-level genetic algorithm, is designed. Meanwhile, a simulation optimization method integrating the intelligent decision mechanism of the optimization algorithm and evaluation function of simulation model is proposed. Numerical experiments indicate that dual cycling can reduce the operation time of quay cranes compared to the method of scheduling loading and unloading separately. Moreover, the model and algorithms developed in this article can tackle quay crane dual-cycling problem efficiently. 相似文献
13.
14.
15.
16.
J.-D. Caprace C. Petcu M. G. Velarde P. Rigo 《Journal of Marine Science and Technology》2013,18(3):404-417
In this article we describe the development of a tool that allows planners to efficiently and effectively plan space within valuable areas of a shipyard. Traditionally, space is considered as resource; however, it is difficult to accurately account for and plan its consumption with the currently available planning software’s. The spatial scheduling tool described in this article can be used by planners to manually or automatically reserve space within the shipyard for construction of large blocks over the entire erection period of the ship. The software is coupled with a heuristic optimization solver inspired by an algorithm used for "3D bin-packing problems." The result is the ability to efficiently generate and compare multiple space allocation alternatives in a reduced time with the ultimate goal of maintaining the critical ship erection schedule. A better solution than manual or semi-automatic allocation of blocks can be obtained through the optimization module. 相似文献
17.
18.
19.