采用独立车轮的直线电机轨道车辆的动力学分析

建立采用独立车轮的直线电机轨道车辆的动力学计算模型,采用符合直线感应电机驱动车辆特点和独立车轮特点的一系、二系悬挂设计,并对直线电机悬挂、独立车轮等关键部件进行了分析。在此基础上运用Simpack多体动力学仿真软件分析了该计算模型的曲线通过性能及运行平稳性等动力学性能。     

Optimisation of motorway operations via ramp metering and variable speed limits

This paper presents a modelling and optimisation framework for deriving ramp metering and variable speed control strategies. We formulate the optimal control problems aiming to minimise the travel delay on motorways based upon a macroscopic cell transmission model of traffic. The optimal ramp metering optimisation is formulated as a linear programming (LP) while the variable speed control problem is formulated as a mixed integer LP. The optimisation models are applied to a real scenario over a section of M25 motorway in the UK. This paper also includes various analyses on the sensitivity of the optimal control solutions with respect to different network configurations and model assumptions.     

Model and a solution algorithm for the dynamic resource allocation problem for large-scale transportation network evacuation

Allocating movable resources dynamically enables evacuation management agencies to improve evacuation system performance in both the spatial and temporal dimensions. This study proposes a mixed integer linear program (MILP) model to address the dynamic resource allocation problem for transportation evacuation planning on large-scale networks. The proposed model is built on the earliest arrival flow formulation that significantly reduces problem size. A set of binary variables, specifically, the beginning and the ending time of resource allocation at a location, enable a strong formulation with tight constraints. A solution algorithm is developed to solve for an optimal solution on large-scale network applications by adopting Benders decomposition. In this algorithm, the MILP model is decomposed into two sub-problems. The first sub-problem, called the restricted master problem, identifies a feasible dynamic resource allocation plan. The second sub-problem, called the auxiliary problem, models dynamic traffic assignment in the evacuation network given a resource allocation plan. A numerical study is performed on the Dallas–Fort Worth network. The results show that the Benders decomposition algorithm can solve an optimal solution efficiently on a large-scale network.     

对当前施工招标最高限价编制、审查的几点建议

针对公路工程施工招标最高限价编制和审查中,容易忽视的问题,提出自己的观点和看法,供同行参考。     

Truck capacity analysis in a cross‐dock transportation network considering direct shipment

In a transportation network, decision making parameters may change and may cause the optimum value of objective function to vary in a specific range. Therefore, managers try to identify the effects of these changes by sensitive analysis to find appropriate solutions. In this paper, first, a model for cross‐dock transportation network considering direct shipment is presented, and then an algorithm based on branch and bound algorithm and dual price concept for sensitive analysis is developed. When managers encounter problems such as budget limit, they may decide to change the capacity of trucks as a procedure to reduce the transportation costs of the network. The algorithm provides a useful lower bound on the solutions of the problems and makes it easy for the managers to eliminate inappropriate options of truck capacities, which cannot lead to cost reduction. To verify the algorithm, an example will be given at the end of the paper. Copyright © 2013 John Wiley & Sons, Ltd.     

The optimal dual-pricing policy of mall parking service

In studies of parking policy, the role of parking pricing has been addressed. Most researches have focused on the determination of a proper price for city parking spaces that are open to the public and it is now evident that price is used by authorities as a tool to manage transport demand. However, studies of parking pricing that pertain to privately-owned parking resources are few and in particular, the problem of setting a proper price for physical market parking has rarely been studied, such as a mall’s ‘dual-pricing portfolio’ decision for the simultaneous determination of a parking fee and the consumer spending required for free parking (i.e., the ‘threshold’). This is a common problem for most malls, but the different agents involved (e.g., the visitors, the mall, the marketplace and the parking lot departments) usually have diverse goals, so the decision must take account of a multiplicity of criteria and subtle relationships. In order to systematically support this type of inter-departmental decision process, a decision model that includes an analytical decision-aid process and the relevant programming models is established. A numerical example verifies the proposed model by taking the data for a mall in Taiwan and the implications, in terms of management, are given. This systematic computational model can be generalized to any type of commercial market that requires a (new) parking pricing policy.     

Optimization method of alternate traffic restriction scheme based on elastic demand and mode choice behavior

As a countermeasure to urban traffic congestion, alternate traffic restriction (ATR) involves a certain proportion of automobiles being prohibited from entering pre-determined ATR districts during specific time periods. The present study introduces an optimization method for ATR schemes in terms of both their restriction districts and the proportion of restricted automobiles. As a Stackelberg game between traffic policy makers and road users, the ATR scheme optimization problem is established using a bi-level programming model, with the upper-level examining an ATR scheme aimed at consumers’ surplus maximization under the condition of overload flow minimization, and the lower-level synthetically optimizing elastic demand, mode choice (private car, public transit and park-and-ride) and multi-class user equilibrium assignment. A genetic algorithm based on the graph theory is also proposed to solve the bi-level programming model with a gradient project algorithm for solving the lower-level model. To our knowledge, this study represents the first attempt to theoretically optimize an ATR scheme using a systematic approach with mathematical model specification.     

A dynamic evacuation model for pedestrian–vehicle mixed-flow networks

In urban emergency evacuation, a potentially large number of evacuees may depend either on transit or other modes, or need to walk a long distance, to access their passenger cars. In the process of approaching the designated pick-up points or parking areas for evacuation, the massive number of pedestrians may cause tremendous burden to vehicles in the roadway network. Responsible agencies often need to contend with congestion incurred by massive vehicles emanating from parking garages, evacuation buses generated from bus stops, and the conflicts between evacuees and vehicles at intersections. Hence, an effective plan for such evacuation needs to concurrently address both the multi-modal traffic route assignment and the optimization of network signal controls for mixed traffic flows. This paper presents an integrated model to produce the optimal distribution of vehicle and pedestrian flows, and the responsive network signal plan for massive mixed pedestrian–vehicle flows within the evacuation zone. The proposed model features its effectiveness in accounting for multiple types of evacuation vehicles, the interdependent relations between pedestrian and vehicle flows via some conversion locations, and the inevitable conflicts between intersection turning vehicle and pedestrian flows. An illustrating example concerning an evacuation around the M&T stadium area has been presented, and the results indicate the promising properties of our proposed model, especially on reflecting the complex interactions between vehicle and pedestrian flows and the favorable use of high-occupancy vehicles for evacuation operations.     

基于模拟退火算法的供应链管理分析

随着经济全球化的到来,更多的企业将工作重心放在其核心竞争力上,而物流业务也逐渐从生产加工等业务中分离出来。因此,如何有效管理供应商和生产商之间的关系(即供应链管理)已成为当前企业竞争和收益的焦点。以往对于供应链模型的求解往往是基于遗传算法等,虽然成熟有效,但局部搜索能力较差并且计算时间较长。主要应用模拟退火算法对供应链模型的求解问题进行研究和分析,并结合例题说明其有效性。     

湘江船闸的过闸调度算法研究

船闸调度主要任务是确定排哪些船舶及其各自在船闸中相对位置,是一个多目标非线性规划问题。为解决此问题,首先建立调度数学模型,通过研究调度算法进行求解,试验证明船闸面积利用率比前期提高,工作效率得到改善。