山区高速公路弃土场的综合设计探讨

针对山区高速公路建设过程中弃土场大量出现的实际情况,结合安徽省山区高速公路的具体设计工作,对弃土场进行价值分析,提出了综合设计思路,有助于推动弃土场设计的发展。     

液化石油气(LPG)汽车的优点及存在的问题

液化石油气（英文缩写为LPG）做为一种新型的能源,可以有效地治理汽车尾气污染．改善大气环境。本文阐述了LPG汽车的优点及工作中存在的若干问题,并提出解决办法。     

基于DR-System的存贮路径问题研究

本文研究的是基于DR-System的存贮路径问题,即综合考虑配送中心订货成本、配送成本、配送中心和客户库存持有成本的最小化问题．本文提出井运用启发式算法来求解谊问题．首先把问题分解为两个子问题,即配送中心的订货问题和客户的配送问题,分别求解得到问题的初始解;然后,通过分析客户配送提前对总成本的影响,来改进初始解,从而得到谊问题的一个满意解．     

公路工程监理市场面临的问题与解决的措施

分析了公路工程监理市场存在的问题及问题产生的原因,针对性地提出了解决问题的措施。     

山区高速公路边坡稳定性评价方法浅析

山区高速公路边坡的稳定性对道路交通安全具有重要影响,通过对国内外很多边坡稳定性评价方法的介绍,指出了各种边坡稳定性评价方法存在的缺陷,并提出了一些建议。     

基于三点模型的柴油机热工参数预测

准确预测热工参数劣化趋势是对柴油机实施预测维修的前提。已有预测技术均视不同时段信息所具有的建模价值相等,忽略了近期信息比远期信息更能反映设备当前运行态势这一客观事实,导致预测模型难以准确描述柴油机热工参数的真实变化规律。针对该问题,提出一种基于三点模型的柴油机热工参数预测方法,并采用新陈代谢法同步更新建模数据,以提高建模数据的利用效率及预测精度。与灰色系统GM(1,1)模型预测精度的对比结果表明,三点模型能够有效处理不同时段信息在反映设备运行态势能力上的差异,得到更为准确的预测结果。     

A Pareto-improving hybrid rationing and pricing policy with multiclass network equilibria

This paper extends the work on Pareto-improving hybrid rationing and pricing policy for general road networks by considering heterogeneous users with different values of time. Mathematical programming models are proposed to find a multiclass Pareto-improving pure road space rationing scheme (MPI-PR) and multiclass hybrid rationing and pricing schemes (MHPI and MHPI-S). A numerical example with a multimodal network is provided for comparing both the efficiency and equity of the three proposed policies. We discover that MHPI-S can achieve the largest reduction in total system delay, MHPI can induce the least spatial inequity and MHPI-S is a progressive policy which is appealing to policy makers. Furthermore, numerical results reveal that different classes of users react differently to the same hybrid policies and multiclass Pareto-improving hybrid schemes yield less delay reduction when compared to their single-class counterparts.     

Locating rental stations and bikeways in a public bike system

To determine the spatial distribution of rental stations and bikeways in a public bike system, this paper proposes a facility location and network design model. The model is developed as a multi-objective programing problem that considers four objectives (minimizing cyclist risk, maximizing cyclist comfort, minimizing adverse impacts on traffic and maximizing service coverage) and multiple constraints (monetary budget, network connectivity, station spacing, bikeway types, station number and value ranges of decision variables). The ε-constraint method solves the programing problem for the public bike system in Daan District, Taipei City, Taiwan. The nine non-dominated alternatives generated are all markedly better than existing locations of rental stations and bikeways. Scenario analysis results indicate that increasing the construction budget for bikeways significantly improves cyclist safety and comfort whilst increasing the adverse impact on traffic. Planners can use this model to develop public bike systems that spatially integrate rental stations and bikeway networks.     

Formulating cargo inventory costs for liner shipping network design

This study examines how to incorporate the inventory costs of containerized cargoes into existing liner service planning models such that the designed networks could be improved while not causing extra modeling/computational burden. Two approaches are compared: (i) not considering the inventory costs at all and (ii) incorporating the inventory costs associated with onboard time and those related to transshipment by assuming a fixed connection time. The two models are compared with the ideal model capturing the exact inventory costs on a route choice problem and a capacity planning problem based on extensive randomly generated and practical numerical experiments. The results show that: first, ignoring the inventory costs in service planning models may lead to network design with much higher costs (poor network design decisions); second, in service planning models assuming weekly frequency, the inventory costs associated with onboard time could be formulated exactly, and those related to the connection time of weekly services could be approximated by assuming fixed connection time of 3.5 days for ports with 1 day’s minimum connection time and 4.5 days for ports with 2 days’ minimum connection time.     

The Storage Space Allocation Problem at a Container Terminal

Due to the asymmetry between the time required to retrieve a container to vessel and the time required to register a container at the gate, the storage space allocation problem solves the best allocation policy of these containers that minimizes the potential number of gantry movements during the assigning process and the future retrieval process. A decision rule-based heuristic is proposed, and three properties are discovered in this research. Comprehensive numerical experiments show that the proposed heuristic can solve the real-sized instances within a second, making it possible to account for uncertainty because the re-optimization effort is negligible. Moreover, when applying the proposed heuristic to a container yard at the Port of Kaohsiung in Taiwan and considering the extreme cases, the heuristic performs even better when the number of containers increases and still requires less than 1 s to solve these extreme cases. Finally, the proposed heuristic can be applied to different layouts of storage space and various material handling machines.