A Coordination-Based Algorithm for Dedicated Destination Vehicle Routing in B2B E-Commerce

This paper proposes a solution to the open vehicle routing problem with time windows(OVRPTW)considering third-party logistics(3PL).For the typical OVRPTW problem,most researchers consider time windows,capacity,routing limitations,vehicle destination,etc.Most researchers who previously investigated this problem assumed the vehicle would not return to the depot,but did not consider its final destination.However,by considering 3PL in the B2B e-commerce,the vehicle is required back to the nearest 3PL location with available space.This paper formulates the problem as a mixed integer linear programming(MILP)model with the objective of minimizing the total travel distance.A coordinate representation particle swarm optimization(CRPSO)algorithm is developed to obtain the best delivery sequencing and the capacity of each vehicle.Results of the computational study show that the proposed method provides solution within a reasonable amount of time.Finally,the result compared to PSO also indicates that the CRPSO is effective.

A Destination Based Routing Protocol for Context Based Clusters in VANET

Today, vehicular ad-hoc network (VANET) is a hot research topic due to its many applications like collision avoidance, congestion road notification, parking lot availability, road-side business advertisements, etc. All these applications have hard delay constraints i.e. the messages should reach the target location within certain time limits. So, there must be efficient routing in VANET which meets these delay constraints. In this paper, two techniques are proposed to minimize the data traffic and delay in VANET. Firstly, a context based clustering is proposed which takes into consideration various parameters in cluster formation-location of vehicle, direction of vehicle, velocity of vehicle, interest list of vehicle [1] and destination of vehicle. Secondly, a destination based routing protocol is proposed for these context based clusters for efficient inter-cluster communication.

Destination Based Stable Clustering Algorithm and Routing for VANET

Now in modern telecommunication, one of the big topic research is a Vehicle Ad-hoc Network “VANET” (V2V). This topic is one of an “issues of the day” because research has problematic topic due to its many application-questions, what we need to solve: avoid collisions, any accidents on a way, and notifications about congestions on the road, available car parking, road-side commercial-business ads, and etcetera. These like application forms creating big delay constraining’s i.e. the instant data should reach the destination within certain time limits. Therefore, we need a really efficient stable clustering method and routing in vehicle ad-hoc network which will be resistant to network delays and meets network requirements. The methods are proposed in the paper for optimization VANETs data traffic as well as to minimizing delay. First, here is presented, a stable clustering algorithm based on the destination, contextually take into consideration various physical parameters for cluster formation such as location of the vehicle and its direction, vehicle speed and destination, as well as a possible list of interests of the vehicle. And also the next main process is to depend on these “five parameters” we can calculate the “Cluster Head Eligibility” of each car. Second, based on this “Cluster Head Eligibility”, described cluster head selection method. Third, for efficient communication between clusters, present a routing protocol based on the “destination”, which considered an efficient selecting method of next forwarding nodes, which is calculated by using “FE” metric.

Combinatorial Model Involving Stochastic Choices of Destination, Mode and Route

Traffic assignment models are one of the basic tools for the analysis and design of transportation systems. However, the existing models have some defects. Considering the characteristics of Chinese urban mixed traffic and the randomness of transportation information, the author develops a combinatorial model involving stochastic choices of destination, mode and route. Its uniqueness and equivalance are also proved by the optimization theory.

Inter-domain routing and wavelength assignment based on source routing in ASON

The inter-domain and intra-domain routings are treated jointly with dynamically distributed algorithms in automatically switched optical networks （ASON） based on source routing. The proposed algorithms are discussed through numerical calculations. The routing loops can be avoided efficiently and the inter-domain signaling complexity is reduced significantly. The performance of the blocking probability is also improved.

Integrating Origin-Destination Survey and Stochastic User Equilibrium: A Case Study for Route Relocation

The paper analyses integrating origin-destination (O-D) survey results with stochastic user equilibrium (SUE) in traffic assignment. The two methods are widely used in transportation planning but their applications have not yet fully integrated. While O-D gives a generalized trip patterns, purpose and characteristics, SUE provides optimal trip distributions using the characteristics found in O-D survey. The paper utilized O-D and SUE in route relocation study for the town of Coamo in Puerto Rico. The O-D survey was used initially in studying possible trip distribution and assignment for the new route. Initial distribution and assignment of traffic to the existing roadway networks and the proposed route were allocated utilizing the O-D survey findings. The SUE was then used to optimize the assignments considering roadway characteristics such as number of lanes, capacity limits, free flow speed, signal spacing density, travel time and gasoline cost. The travel time was optimized through the Bureau of Public Roads (BPR) equation found in 2000 HCM. The optimal trips found from the SUE were then used to propose the final alignment of the new route. Traffic assignment from the SUE was slightly different from those initially assigned using O-D, indicating there was optimization. The assignment on new route was increased by 13.8% from the one assigned using O-D while assignment on the existing link was reduced by 22%.

Core Placement Algorithm for Multicast Routing with QoS Requirements

Differing from the source oriented algorithms, the Core Based Tree (CBT) multicast routing architecture establishes a single shared tree for multiple connections on a multicast group, which results in higher ratio of network resources utilization. In alluding to the problem of Core Placement, we propose a simple method (QOCP) to locate an optimal core node, which can minimize the multicast delay and inter destination delay variation simultaneously. The simulation results show that our method is very effective, and outperforms the other algorithms studied in this paper.

考虑残疾乘客优先的多车场定制公交路径优化

【目的】探究考虑残疾乘客优先的多车场定制公交路径优化问题,为定制公交路径决策提供理论依据。【方法】构建以车辆行驶时间成本、车辆固定派遣成本、残疾乘客等待时间成本之和最小为目标,包含多起终点、多停车场、多车型、多乘客类型、残疾乘客上下车优先等诸多要素的定制公交路径优化模型。改进Benders分解算法,并采用多平面割约束策略及引入松弛变量的方式提高算法求解效率,最后通过案例对模型和算法进行分析和验证。【结果】与未考虑残疾乘客优先相比,在考虑残疾乘客优先的情况下,残疾乘客的等车时间和乘车时间分别减少了30.6%和1.3%;与传统分支定界算法相比,改进的Benders分解算法在获得满意解的同时,运算时间缩短了20.6%。【结论】本文提出的模型有效减少了残疾乘客等车时间和乘车时间,改进的Benders分解算法同样有效。本研究对解决残疾人出行问题具有重要的现实意义。

考虑技术站编组去向的车流径路优化研究

在车流径路规划中,相同到站的车流经同一技术站改编后合并。研究旨在提出一种考虑技术站编组去向的车流径路优化模型,以克服现有车流径路模型中车流相遇即合并的限制。构建反映技术站间编组去向的网络G1,G1中的每条边与实际路网G2对应顶点间的最短路绑定。以路网G2上车流的广义走行费用最小为目标,考虑技术站的流量守恒、改编能力以及区间通过能力等约束条件,构建一个整数规划模型。为求解该模型,采用模拟退火算法,使用惩罚函数处理容量约束。根据相同终点车流在G1相遇即合并的特点生成初始解,通过随机改变某股车流的径路生成新的解,且确保终点相同的车流仍满足相遇即合并的条件。通过算例对比研究提出的模型与传统的“树形径路”模型,验证模型的有效性和合理性。

晚明三教会通视域下的焦竑易学

焦竑作为晚明时期的思想大家和士林领袖,易学文化对其思想与行动均起到了重要的濡染作用。鉴于目前学界对焦竑易学的研究相对薄弱,通过追溯焦竑的学思历程揭示其学《易》契机,并对《焦氏笔乘》《澹园集》《易筌》等著述中的易学文本及观点进行提取、重组和分析,从而展现焦竑在义理层面融通百家、考据求真的治《易》方法,同时又注重以象征实、以象见理的易象理路。面对晚明社会三教会通、融合过程中产生的诸多矛盾,焦竑秉持《周易》“天下同归而殊途”的精神,主张以易学心性论调和三教分歧。焦竑的学思行迹及利玛窦对焦氏的推崇,对晚明社会的三教会通、东西互鉴起到了重要的推动作用。

策略路由在高校网络多应用场景中的应用——以朝阳师范高等专科学校校园网为例

针对高校多条专线出口的网络环境,以朝阳师范高等专科学校为例,提出基于多应用场景的校园网策略路由解决方案.分析朝阳师专校园网多应用场景的网络需求,并结合需求给出基于用户源地址、基于目的资源地址,以及基于用户源地址和目的资源地址相结合的3种策略路由方案.方案验证结果表明,各个方案实现过程与规划需求一致,均能达到预期目标.策略路由能提高高校各专线资源和网络带宽的利用率,同时也能提升用户体验,值得推广.

欧洲铁路旅游发展经验及启示

交通是旅游业发展的重要引擎,旅游是现代交通转型升级的重要方向。近年来,综合交通运输体系不断完善,交通与旅游融合日益成为推动产业发展一种新趋势。随着“四纵四横”高速铁路网全面建成,铁路旅游已成为交通旅游重要组成部分。欧洲旅游资源丰富,其铁路网广泛,在交通旅游中发挥着重要的作用。介绍欧洲铁路旅游发展历程,总结欧洲铁路旅游5种目的地主要线路模式,分析提炼其在差异化旅游产品、融合合作、数字化转型方面发展经验,结合我国铁路旅游现状及存在问题,提出促进我国铁路旅游发展的策略建议,包括精准匹配市场需求,设计差异化旅游产品;深化合作共赢,促进铁路与旅游高质量融合发展;加快推进铁路旅游平台信息化发展,助力后疫情时代铁路旅游发展。

基于智能移载搬运机器人的自动化仓库调度优化研究

近年来,电商仓储压力与日俱增,为了提升分拣效率,部分电商仓库应用了基于智能移载搬运机器人的自动化仓库系统。本文针对该系统中的目的地指派与智能移载搬运机器人路径规划的集成问题,构建一个混合整数规划模型。为了高效地求解该问题,设计了一种基于路线模板法的分支定界算法,其中分支定界算法用于求解目的地指派问题,路线模板法用于求解路径规划问题。实验表明,此算法可有效提高求解速度。随后,通过敏感度测试来探究系统中相关资源对系统性能的影响,并得到管理启示。

“桂-阳”区域郊野型旅游绿道网选线适宜性评价

基于全域旅游理念和适宜性评价理论,对桂林城区至阳朔县区域绿道网选线规划展开重点研究。采用实地踏勘、问卷调研等方法,首先对区域现有旅游资源状况和绿道建设可行性进行分析,提出绿道网规划选线目标,即南拓北线漓东绿道,同步建设漓西绿道,并结合桂阳绿道、漓西绿道两条主干绿道,打造中部绿道网,构建“桂-阳”全域旅游郊野型绿道网。其次采用层次分析法、德尔菲法等定量方法构建适宜性评价结构模型,确定地貌、景点资源、水资源、村镇、商业资源5个一级因子指标及权重,利用GIS技术生成综合适宜性分析图,结合已有道路和资源进行修正后获得绿道网选线布局。最后对绿道分级、驿站站点间距、配套服务、综合道宽度等建设提出技术要求。

Combinatorial Model Involving Travel Choice,Destination Choice and Route Choice

Considering random utility of transportation information, the author develops combinatorial model involving travel choice, destination choice and route choice. It's uniqueness and equivalance are also proved. Finally, an model's a1gorithm is given out.

基于群体智能算法的通勤车辆路径优化问题

为解决员工通勤难的问题,面向大型企业为员工提供统一接送通勤服务,研究多目的地和多车型的车辆路径问题,并建立相应的数学模型,提出群体智能算法对其进行求解。基于现实生活中通勤服务车辆实际约束,采用混合整数规划方法,以最小化运营成本为目标构建多目的地和多车型的车辆路径问题的数学模型。提出一种基于S-N链的解表示方法以及对应的解码过程和评价准则,并采用群体智能算法中的蜘蛛猴优化算法对问题进行求解。为验证蜘蛛猴优化算法的有效性,将其与粒子群优化算法进行比较。结果表明,在相同求解时间下,蜘蛛猴优化算法求解此问题的性能更优。对17组随机算例进行测试,验证所提数学模型和蜘蛛猴优化算法能够有效解决多目的地和多车型的车辆路径问题。

DTNs中意识控制的等待路由机制

容迟网络DTNs(Delay Tolerant Networks)缺乏端到端稳定的链路连接,因此该网络中数据包的转发及能量消耗问题被广泛关注。而已有的研究成果大多只关注DTNs中存在一个目的节点的网络性能,忽略了网络中存在多个自私性和利他性目的节点情况。而数据包传输功率的选择也是影响网络性能的一个关键因素。基于此,本文在充分考虑DTN中存在多个目的节点的利他性和自私性的情况下,首先通过微分方程组来模型化数据包传递的过程,接着定义了传输性能和能量消耗之间的权衡表达函数,并且证明了该函数是一个次模函数以及次模函数的NP-hard问题,最后通过实验验证本文所提出的意识控制等待路由机制。结果表明:存在利他性目的节点的网络性能在传递率和权衡方面优于自私性目的节点;意识控制等待路由机制在能量消耗、传递率和折衷方面优于Epidemic、DT和Time-aware路由。

海外旅游者对旅游目的地和旅游路线的选择研究

研究了海外旅游者对旅游目的地和旅游路线的选择规律.利用项目组在12个旅游热点城市的市场调查结果,结合近些年国家旅游局海外旅游者抽样调查资料,运用旅游地理学和市场学的基本原理,总结出海外旅游者选择旅游目的地和路线的规律性,即海外旅游者多前往经济发达、资源丰富的旅游目的地;传统的旅游黄金线路仍然是海外旅游者在境内移动的主要旅游路线.

城市综合交通规划的组合模型

根据我国城市混合交通阻抗的特点 ,将出行者看作为出行的消费者 ,考虑出行者出行决策的同时性 ,以离散选择和随机效用理论为分析工具 ,研究了基于对称阻抗的交通网络出行、讫点、方式和路径随机选择的组合模型 ;根据最优化原理和Lagrange算子性质 ,证明了模型最优解满足出行、讫点、方式和路径选择平衡的条件 ,且最优解是唯一的 .最后给出一个算例 .

论“旅游目的地”与“旅游过境地”

旅游地的空间竞争与合作是当前学术界颇为关注的一个热点问题。处在同一旅游线路①上的不同旅游地之间产业和产品的空间竞争与合作是区域旅游竞争与合作的典型代表,较少有学者进行研究。本文在回顾以往研究成果的基础上,分析了旅游目的地与旅游过境地在竞争与合作中旅游产业定位和空间布局等重大问题对两地在旅游开发、投资等方面的影响。