full load running

The constraints on time in full loads are a complexity problem.

针对时间约束在满载问题中的复杂性,建立了一个考虑装载时间和次序的具有动态时间窗的满载车辆调度模型,并给出了一个基于动态构造原理的启发式算法。

Based on analyzing the characteristic of the multiple depot vehicle scheduling (MDVS) problem with full loads, this paper put forward a optimization model, designed heuristic algorithm.

针对多车场满载运输问题的特征,提出了多车场车辆优化调度的数学模型,设计了求解该问题的启发式算法,应用结果表明,该算法是可行的。

Evaluation for the load factor and crowd degree is performed on the basis of OD(Origin and Destination)passenger flow analysis incorporating the study of traffic round trip.

从运营需要出发,提出客流预测的年限和内容;通过对客流量级的阐述,分析客流预测三级数据,确定运营的规模;根据OD(起讫点)客流分析来研究行车交路,做出满载率和拥挤度的评价;最终确定车辆编组与行车密度的合理组合,形成系统全面的技术方案,使客流预测更好地为运营组织服务。

Genetic algorithm for vehicle scheduling problem of non-full loads of single parking and single vehicle types restrained by time windows;

有时间窗约束单车场单车型非满载车辆调度问题的遗传算法

Improved genetic algorithm for VRP of non-full loads;

求解非满载车辆调度问题的改进遗传算法