用数学建模解决两辆铁路平板车的装货问题

针对两辆铁路平板车的装货优化设计,本文根据题目所给的条件,分析并整理出其目标函数和约束条件,建立整数线性规划模型。通过Lingo软件计算得出浪费空间的最小值0.6厘米,再通过MATLAB软件计算整理出所有最优解15组。结合实际,考虑到在现实生活中,为了保证行驶的安全,两辆平板车的重量应尽可能地相近,我们又做了进一步的优化,使得两车的重量完全相等。

解约条款下的装货准备就绪问题刍议

航次租船合同的履行可以分为四个阶段，即预备航次、装货作业、载货航次和卸货作业。其中第一阶段为航次租船合同所特有，也最具复杂性。在此阶段，承租双方往往对对方情况了解甚少，而双方的履约能力又易受其他一些不确定……

基于数模理论的铁路装载配货问题最优解分析

针对将七种规格的包装箱要装到两辆铁路平板车上问题,将其转化为求解多个n元一次不等式最优解的数学模型,通过穷举法,利用计算机VB高级语言进行编程计算。在程序的编译过程中,我们增加了约束条件、减少了可以避免的计算量,加快了程序计算速度。最终得出了满足要求的6组等价最优解。

Rolling horizon scheduling algorithm for dynamic vehicle scheduling system

Dynamic exclusive pickup and delivery problem with time windows (DE-PDPTW), aspecial dynamic vehicle scheduling problem, is proposed. Its mathematical description is given andits static properties are analyzed, and then the problem is simplified asthe asymmetrical travelingsalesman problem with time windows. The rolling horizon scheduling algorithm (RHSA) to solve thisdynamic problem is proposed. By the rolling of time horizon, the RHSA can adapt to the problem'sdynamic change and reduce the computation time by dealing with only part of the customers in eachrolling time horizon. Then, its three factors, the current customer window, the scheduling of thecurrent customer window and the rolling strategy, are analyzed. The test results demonstrate theeffectiveness of the RHSA to solve the dynamic vehicle scheduling problem.