基于蒙特卡洛方法的海上搜寻区域确定模型

为了提高海上搜寻与救助的成功率,采用FVCOM模型进行遇难海域表面流场的数值预报,并与实测结果进行比较。采用经验公式法确定不同漂浮物种类风致漂移速度与风速的关系。引入蒙特卡洛方法,通过量化影响漂移的不确定性因素,确定漂浮物位置随时间变化的概率密度函数,并以统计区域作为搜寻区域,编制程序建立搜寻区域确定模型。模型实例验证效果较好,可为搜救工作的开展提供依据。     

Routing and scheduling of RoRo ships with stowage constraints

Roll-on/Roll-off ships are used for international transport of vehicles and other rolling equipment. We consider the problem where a ship sails between two geographical regions, picking up cargo in the first and making deliveries to the second. Several variations are considered with optional cargoes, flexible cargo quantities, and ship stability restrictions. Decisions must be made regarding the route and schedule of the ship as well as the stowage of cargo onboard. The problem is modeled as a mixed integer program, which has been solved using Xpress. In addition, a tailor made heuristic procedure is built using components from tabu search and squeaky wheel optimization. Extensive computational results are presented, showing that the heuristic is able to handle realistically sized problem instances.     

搜索引擎相关技术研究概述

主要介绍了搜索引擎的概念、分类和主要工作原理,并详细介绍了目前该领域所涉及的关键技术及相应的主要研究方向,最后指出了目前的搜索引擎存在的问题,并提出了一种改进的研究方向.     

Future air traffic management systems and financial decision-making constraints

The object is to identify characteristics of feasible systems for UK – and European – Air Traffic Management (ATM) in the coming decades. ATM here covers Air Traffic Control (ATC) provision plus wider issues, such as airspace design. The analytical focus is on the financial decision-making processes and constraints that will act to shape this future system. R&D work into control workload and planning based on an "ATM core concept" are proposed as likely to offer the best way forward.     

树形结构在关系数据库中的压缩存储研究

讨论在关系数据库中压缩存放树形数据结构的方法；数据一致性的保证；分析存储、检索算法的时空复杂度。     

Novel Local Search Method for the Traveling Salesman Problem

A new local search method for the traveling salesman problem based on an original greedy representation of solution space and neighborhood structure is proposed. First, a partial closed route that only consists of three cities is given; then other cities are added to this route by a greedy procedure successively. Implemented on a personal computer, this algorithm finds optimal solutions for 24 out of 27 standard benchmarks, and outperforms the Full Subpath Ejection Algorithm (F-SEC) proposed by Rego in 1998.     

供水管网多事故关阀方案分析

根据多事故点关阀分析的需求建立了基本网络模型,并建立阀门之间的控制关系,应用广度优先搜索遍历供水管网图,找出多事故点时的关阀集。根据阀门之间的控制关系剔除可不关的阀门,得出最优的关阀方案,并列出了受影响的管段。     

试论发达国家海上救助水平的几个要素及对策

文中通过分析发达国家海上搜救的四要素及我国的各要素现状,结合作者的搜救实践,指出我国海上搜救的不足之处,并提出相关对策。     

What drives the drivers? Predicting turnover intentions in the Belgian bus and coach industry

The bus industry is characterized by demanding jobs and high turnover rates. In this study we gather essential insights that can help companies and industry-level policy makers increase the attractiveness of the profession and design effective retention policies. We compare the factors that induce Belgian drivers to leave their current organization with those inducing them to leave the industry. Key factors increasing the likelihood to consider quitting the company are a negative work-life balance, a lack of social support and a temporary contract. Dominant factors to consider quitting the bus driver profession are a lack of fulfillment, a demanding job environment and a negative work-life balance.     

A model and optimization-based heuristic for the operational aircraft maintenance routing problem

This paper investigates the Operational Aircraft Maintenance Routing Problem (OAMRP). Given a set of flights for a specific homogeneous fleet type, this short-term planning problem requires building feasible aircraft routes that cover each flight exactly once and that satisfy maintenance requirements. Basically, these requirements enforce an aircraft to undergo a planned maintenance at a specified station before accumulating a maximum number of flying hours. This stage is significant to airline companies as it directly impacts the fleet availability, safety, and profitability. The contribution of this paper is twofold. First, we elucidate the complexity status of the OAMRP and we propose an exact mixed-integer programming model that includes a polynomial number of variables and constraints. Furthermore, we propose a graph reduction procedure and valid inequalities that aim at improving the model solvability. Second, we propose a very large-scale neighborhood search algorithm along with a procedure for computing tight lower bounds. We present the results of extensive computational experiments that were carried out on real-world flight networks and attest to the efficacy of the proposed exact and heuristic approaches. In particular, we provide evidence that the exact model delivers optimal solutions for instances with up to 354 flights and 8 aircraft, and that the heuristic approach consistently delivers high-quality solutions while requiring short CPU times.