A non-additive multiple criteria analysis method for evaluation of airline service quality

Subjective preferences with interactive property are often involved in the evaluation of airline service quality. It may not be possible, however, to correctly evaluate service quality using conventional additive measures. The fuzzy measure, which is a non-additive measure, is more suitable for this situation. Given the presence of arduousness in current fuzzy measure identification and in the calculation of the comprehensive performance values of alternatives in terms of the Choquet integral, this paper proposes the λ_k fuzzy measure and introduces Marichal entropy of the λ_k fuzzy measure to reach a solution. This paper also presents the aggregator Choquet integral with respect to the λ_k fuzzy measure. To verify the method's effectiveness, an application study of the comprehensive performance of 15 US airlines was conducted, using data collected over a 10-year period. Our results show that the proposed method is a suitable multi-criteria analysis method, which can be used to evaluate the performance of airline service quality when man–made interaction phenomena are not existent.     

Clustered airline flight scheduling: Evidence from airline deregulation in Korea

This paper explores the impacts of competition level on airline scheduling in the Korean domestic short-haul routes where a hub-and-spoke system is not the optimal air transport network strategy. The empirical findings using the Korean airline panel data for the period 2006–2010 suggest that competition leads to less differentiated departure flight times as expected from spatial competition theory. Unlike the previous study on the U.S airline industry, the degree of this tendency for less differentiation differs across the type of routes: the Jeju island routes (leisure type) and the inland routes (business type), in the deregulated period. Following the May 2008 Deregulation Act we find an increasingly clustered pattern of airline scheduling in the Jeju island routes where there have been competitive pressures associated with new low cost entrants. This recent evidence would imply that airline carriers strategically schedule departure flight times and allocate flights between routes as competition increases in the deregulated period.     

A hybrid parallel genetic algorithm for yard crane scheduling

This paper aims at postulating a novel strategy in terms of yard crane scheduling. In this study, a dynamic scheduling model using objective programming for yard cranes is initially developed based on rolling-horizon approach. To resolve the NP-complete problem regarding the yard crane scheduling, a hybrid algorithm, which employs heuristic rules and parallel genetic algorithm (PGA), is then employed. Then a simulation model is developed for evaluating this approach. Finally, numerical experiments on a specific container terminal yard are used for system illustration. Computational results suggest that the proposed method is able to solve the problem efficiently.     

Runway capacity management – An empirical study with application to Doha International Airport

This paper examines a three-faceted approach for runway capacity management, based on the runway configuration, a chosen scheduling approach, and an aircraft separation standard. These factors prompt alternative runway settings that are encapsulated using a classical mixed-integer formulation. The optimal solution for each runway setting is compared against our proposed optimization-based heuristic. This integrated approach is applied to investigating the transition from the (Old) Doha International Airport to the New Doha International Airport. Our empirical study based on historical data reveals that the proposed heuristic consistently yields optimal or near-optimal schedules, with considerable savings in fuel cost and reductions in delays, while preserving the spirit of an FCFS sequencing policy.     

The generalized lock scheduling problem: An exact approach

The present paper introduces an integrated approach to solving the generalized lock scheduling problem. Three interrelated sub problems can be discerned: ship placement, chamber assignment and lockage operation scheduling. In their turn, these are closely related to the 2D bin packing problem, the assignment problem and the (parallel) machine scheduling problem respectively. In previous research, the three sub problems mentioned were considered separately, often using (heuristic) interaction between them to obtain better solutions. A mixed integer linear programming model is presented and applied to instances from both inland locks and locks in a tide independent port. The experiments show that small instances incorporating a wide range of real-life constraints can be solved to optimality.     

A direct comparison of physical block occupancy versus timed block occupancy in train timetabling formulations

Two fundamental mathematical formulations for railway timetabling are compared on a common set of sample problems, representing both multiple track high density services in Europe and single track bidirectional operations in North America. One formulation, ACP, enforces against conflicts by constraining time intervals between trains, while the other formulation, RCHF, monitors physical occupation of controlled track segments. The results demonstrate that both ACP and RCHF return comparable solutions in the aggregate, with some significant differences in select instances, and a pattern of significant differences in performance and constraint enforcement overall.     

The asymptotic expansion of the regular discretization error of Itô integrals

We study an Edgeworth‐type refinement of the central limit theorem for the discretization error of Itô integrals. Toward this end, we introduce a new approach, based on the anticipating Itô formula. This alternative technique allows us to compute explicitly the terms of the corresponding expansion formula. Two applications to finance are given; the asymptotics of discrete hedging error under the Black–Scholes model and the difference between continuously and discretely monitored variance swap payoffs under stochastic volatility models.     

Ad hoc网络中基于多波束天线的集中式低时延调度算法

UxDMA算法是一种高效的集中式算法,是用于时分多址、频分多址和码分多址信道分配的统一算法。在UxDMA的基础上,利用多波束天线的多波束形成能力,针对低时延定向ad hoc网络提出了一种集中式调度算法——CLSM(Centralized Low-delay Scheduling Algorithm Based on Multi-beam Antennas)。CLSM通过不同时延等级限制的报文来比较着色后发送链路的优先级,优先选择高优先级链路传输。通过仿真验证了CLSM的性能：与UxDMA相比,该算法在多时延限制的发送端调度中表现出了更好的吞吐量和时延性能。     

大跨度天基数据链的TDD时隙调度分析与优化

针对天基数据链系统卫星间的传播时延较大且节点间距离变化较大等特点,提出了一种提高时频资源利用率、提升系统容量、减小时延的方法。在时分多址与空分多址相结合的接入方式下,进行了时隙调度的分析与优化,利用卫星星座的空间复用与大跨度传播时延特性,采用时隙编排、收发状态调整、帧格式优化等手段,将信道利用率和系统容量提升了1倍,将卫星节点在某一方向获得服务的平均等待时间缩短为原来的1/4,提高了天基数据链系统的服务质量。     

BEHAVIORAL PORTFOLIO SELECTION: ASYMPTOTICS AND STABILITY ALONG A SEQUENCE OF MODELS

We consider a sequence of financial markets that converges weakly in a suitable sense and maximize a behavioral preference functional in each market. For expected concave utilities, it is well known that the maximal expected utilities and the corresponding final positions converge to the corresponding quantities in the limit model. We prove similar results for nonconcave utilities and distorted expectations as employed in behavioral finance, and we illustrate by a counterexample that these results require a stronger notion of convergence of the underlying models compared to the concave utility maximization. We use the results to analyze the stability of behavioral portfolio selection problems and to provide numerically tractable methods to solve such problems in complete continuous‐time models.