基于偏好顺序集的非补偿式铁路旅客选择行为估计方法

精细化需求预测是铁路提高收益的重要基础.本文考虑了铁路产品属性对于旅客选择行为的影响,构建具有一定偏好顺序的产品集合来表征不同类型的旅客.在此基础上,利用客票存根及余票数据,建立预售期内旅客选择过程的极大似然函数,求解得到不同旅客类型的出现概率.首先通过仿真算例验证了模型的计算可行性,然后通过实证数据,估算了北京南至上海虹桥方向不同旅客类型在各时段的出现概率,进一步统计得到旅客在不同时段下铁路旅客buy-up行为概率及属性敏感度的变化,并提出一些可用于优化售票策略的建议.     

Experiment of boundedly rational route choice behavior and the model under satisficing rule

In this paper, we study the boundedly rational route choice behavior under the Simon’s satisficing rule. A laboratory experiment was carried out to verify the participants’ boundedly rational route choice behavior. By introducing the concept of aspiration level which is specific to each person, we develop a novel model of the problem in a parallel-link network and investigate the properties of the boundedly rational user equilibrium (BRUE) state. Conditions for ensuring the existence and uniqueness of the BRUE solution are derived. A solution method is proposed to find the unique BRUE state. Extensions to general networks are conducted. Numerical examples are presented to demonstrate the theoretical analyses.     

港口与运输方式及陆港联合选择的巢式Logit模型

为刻画托运人对港口、运输方式及陆港的联合选择行为,将港口费用、等待时间、班轮频率、货物价值、单次运量、运输成本、运输及通关时间、准班率、陆港服务作为效用变量,构建港口选择位于上层、运输方式及陆港选择位于下层的巢式Logit模型.基于辽宁部分城市集装箱托运人的RP/SP调查数据,对模型参数进行估计和检验.结果表明,低运量倾向选择公路运输,托运人对多式联运的运输成本、运输及通关时间比公路运输的更重视,对公路运输的准班率比多式联运的更重视,陆港服务对多式联运具有显著正向影响,巢式Logit模型比MNL模型具有更优的统计学特征.     

无线传感器网络安全路由协议SNEP的分析与仿真实现

以提供可靠保密通信为目标的安全路由协议的分析是无线传感器网络安全基本研究领域之一．阐述了针对无线传感器网络的攻击手段所采取的措施,研究了安全路由协议,重点研究了其中的传感网络加密协议（Sensor Network Encryption Protocol,SNEP）,并进行了仿真实现,最后针对无线传感网络的攻击方式对SNEP的安全性进行了分析．结果证明SNEP协议具有数据机密性、数据认证、防御重放攻击等安全服务．     

集装箱码头800M数字集群通信系统制式的选择

介绍了数字集群通信系统的特点,对数字集群系统两种制式作了比较。分析了集装箱码头对通信系统的要求和目前国内iDEN系统的运行状态。     

汕尾市新港大桥桥型方案比选

大跨度桥型方案比选。应在技术可行的前提下,对桥梁的经济性、美观性和创新性进行系统的分析、论证与比较,力争找到一个既能突出当地经济特色、人文思想及价值观念,又能表达现当代桥梁的技术水平及蕴涵未来桥梁的发展趋势的最佳方案。     

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

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

分送式货物配送的优化

在分析分配式货物配送现状基础上,对物流中心的配送问题从配装和运输两个环节进行优化。建模时主要考虑货车的类型、体积、载重等约束条件,以车辆的配送路径最短、拼装货品最多为优化目标,研究配送的优化模型和算法。     

Improving maritime inventory routing: application to a Brazilian petroleum case

The crude oil offloading and supply problem (COSP) is a type of operation maritime inventory routing (MIR) problem encountered by petroleum companies. In COSP, the company not only is responsible for the ship scheduling to carry the crude oil from production sites to discharge ports but also must maintain inventory levels at both ports (production and consumption) between safety operational bounds to avoid disruptions in its crude oil production and/or refining processes. We show how to improve significantly the decision-making process in a Brazilian petroleum company using a mixed-integer linear programming (MILP) model to represent COSP. Comparison tests with a current ship-scheduling method adopted in the company indicated that the use of the MILP model increased the transportation efficiency and reduced costs by 20% on average. In addition to the quantitative gains, the use of a MILP model to solve COSP has succeeded when encountering real-life events, such as variation in production or consumption rates, berth unavailability, and changes in the storage capacities at ports.     

Order-first split-second methods for vehicle routing problems: A review

Cluster-first route-second methods like the sweep heuristic (Gillett and Miller, 1974) are well known in vehicle routing. They determine clusters of customers compatible with vehicle capacity and solve a traveling salesman problem for each cluster. The opposite approach, called route-first cluster-second, builds a giant tour covering all customers and splits it into feasible trips. Cited as a curiosity for a long time but lacking numerical evaluation, this technique has nevertheless led to successful metaheuristics for various vehicle routing problems in the last decade. As many implementations consider an ordering of customers instead of building a giant tour, we propose in this paper the more general name of ordering-first split-second methods. This article shows how this approach can be declined for different vehicle routing problems and reviews the associated literature, with more than 70 references.