机场选择研究综述

随着机场群都市区的形成,分析旅客对登机机场的选择就成为航空运输规划一个重要环节.近年来,对它的研究已经成为西方发达国家航空运输领域的前沿热点问题之一。鉴于我国在这方面的研究还未展开,因此有必要对国外已有的研究进行系统阐述。首先阐明了机场群都市区形成所引发的机场选择问题,接着回顾了国外对这一问题的研究历史,归纳已取得的重要研究成果和基础数据描述,并对"参数化随机选择集多项Logit"模型这一新进展作了重点介绍,最后提出一些需要深入研究的建议。     

城市交通多类型随机用户出行决策模型研究

考虑城市交通中有多类出行者的一般情况,在ATIS等交通信息系统的影响下,不同类型的出行者对路径出行时间有不同理解,用不同的参数来反映.在此基础上,给出考虑路径选择、方式选择、讫点选择及是否出行的多类型随机用户出行决策模型,证明了模型的一阶条件满足路径选择、方式选择、讫点选择及是否出行的条件,最后给出模型算法.     

Foundations of the 2N-ary Choice Tree Model

We define the 2N-ary choice tree model for reaction times and choice probabilities in N-alternative preferential choice by specifying a random walk on a 2N-ary tree. It allows for calculation of expected choice response times and expected choice probabilities in closed form and accounts for several preference reversal effects that emerge from the context. Here, we focus on the expected values and on the definition of the transition probabilities that constitute the random walk.     

Unions and the axiom of choice

We study statements about countable and well‐ordered unions and their relation to each other and to countable and well‐ordered forms of the axiom of choice. Using WO as an abbreviation for “well‐orderable”, here are two typical results: The assertion that every WO family of countable sets has a WO union does not imply that every countable family of WO sets has a WO union; the axiom of choice for WO families of WO sets does not imply that the countable union of countable sets is WO. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A weak countable choice principle

A weak choice principle is introduced that is implied by both countable choice and the law of excluded middle. This principle suffices to prove that metric independence is the same as linear independence in an arbitrary normed space over a locally compact field, and to prove the fundamental theorem of algebra.     

Extending Independent Sets to Bases and the Axiom of Choice

We show that the both assertions “in every vector space B over a finite element field every subspace V ? B has a complementary subspace S” and “for every family ?? of disjoint odd sized sets there exists a subfamily ?={F_j:j ?ω} with a choice function” together imply the axiom of choice AC. We also show that AC is equivalent to the statement “in every vector space over ? every generating set includes a basis”.     

Approximations of choice probabilities in mixed logit models

This paper is concerned with the approximate computation of choice probabilities in mixed logit models. The relevant approximations are based on the Taylor expansion of the classical logit function and on the high order moments of the random coefficients. The approximate choice probabilities and their derivatives are used in conjunction with log likelihood maximization for parameter estimation. The resulting method avoids the assumption of an apriori distribution for the random tastes. Moreover experiments with simulation data show that it compares well with the simulation based methods in terms of computational cost.     

船舶溢油事故报告选择概率预测研究

事故报告是整个船舶溢油应急过程的触发点,具有关键作用。实际情况中,事故船方常常存在瞒报、不报或不及时报告的情况,导致溢油危害升级。本文旨在探索事故船方在进行事故报告时的选择过程和影响因素,通过对上海、宁波、舟山、大连、天津、厦门六个城市207名海上船舶作业人员的问卷调查,利用离散选择模型得到了影响船方事故报告选择的主要因素,并对其选择概率进行了预测。     

Existence of solutions for systems of generalized quasi‐equilibrium problems

In this paper, first of all, we consider a generalized game in choice form with 2 constraints and its corresponding equilibrium in choice. We assert new conditions under which the equilibrium in choice exists. As a consequence, we establish the existence of the equilibrium for generalized abstract economies. Then, we apply the obtained theorems to prove the existence of solutions for systems of quasi‐equilibrium problems. We do this by considering new hypotheses for the properties of the involved correspondences. This approach leads us to results which differ a lot from the ones existing in literature.     

Rigid Unary Functions and the Axiom of Choice

We shall investigate certain statements concerning the rigidity of unary functions which have connections with (weak) forms of the axiom of choice.     

Partial Online List Coloring of Graphs

For a graph G, let be the maximum number of vertices of G that can be colored whenever each vertex of G is given t permissible colors. Albertson, Grossman, and Haas conjectured that if G is s‐choosable and , then . In this article, we consider the online version of this conjecture. Let be the maximum number of vertices of G that can be colored online whenever each vertex of G is given t permissible colors online. An analog of the above conjecture is the following: if G is online s‐choosable and then . This article generalizes some results concerning partial list coloring to online partial list coloring. We prove that for any positive integers , . As a consequence, if s is a multiple of t, then . We also prove that if G is online s‐choosable and , then and for any , .     

Existence of equilibrium for generalized games in choice form and applications

This paper has two central aims: first, to provide simple conditions under which the generalized games in choice form and, consequently, the abstract economies admit equilibrium; second, to study the solvability of several types of systems of vector quasi-equilibrium problems as an application. Our work outlines that there still is much to be gained from using the results concerning the existence of equilibrium of games as tools of research for other optimization problems.     

Sum List Coloring Graphs

Let G=(V,E) be a graph with n vertices and e edges. The sum choice number of G is the smallest integer p such that there exist list sizes (f(v):v ∈ V) whose sum is p for which G has a proper coloring no matter which color lists of size f(v) are assigned to the vertices v. The sum choice number is bounded above by n+e. If the sum choice number of G equals n+e, then G is sum choice greedy. Complete graphs K_n are sum choice greedy as are trees. Based on a simple, but powerful, lemma we show that a graph each of whose blocks is sum choice greedy is also sum choice greedy. We also determine the sum choice number of K_2,n, and we show that every tree on n vertices can be obtained from K_n by consecutively deleting single edges where all intermediate graphs are sc-greedy.     

Kernel adjusted density estimation

We propose and study a kernel estimator of a density in which the kernel is adapted to the data but not fixed. The smoothing procedure is followed by a location-scale transformation to reduce bias and variance. The new method naturally leads to an adaptive choice of the smoothing parameters which avoids asymptotic expansions.     

组合算法及其应用

提出了在组合算法设计和组合算法选择方面所应当遵循的三个原则,即通用性、可计算性和较少的信息冗余量,并初步分析了它们之间的相互关系.通过分析,提示了组合算法的设计方法,改进方向和优化技术.     

Compactness in Countable Tychonoff Products and Choice

We study the relationship between the countable axiom of choice and the Tychonoff product theorem for countable families of topological spaces.     

The multiple judge,multiple criteria ranking problem: A fuzzy set approach

This paper investigates the problem of selecting, from a set of issues, those which best satisfy a collection of criteria. A group of judges have fuzzy sets defined over the issues, for each criterion, whose values lie in a finite linearly ordered set $\text{L}$. These judges also have fuzzy sets defined over the set of criteria. The paper discusses methods of aggregating all the fuzzy sets into one fuzzy set μ, defined on the issues, so that μA?L gives the final ranking for issue A.     

On a generalization of Rubin's theorem

The work is devoted to the calculation of asymptotic value of the choice number of the complete r‐partite graph K_{m* r} = K_{m, …, m} with equal part size m. We obtained the asymptotics in the case lnr = o(lnm). The proof generalizes the classical result of A.L. Rubin for the case r = 2. © 2010 Wiley Periodicals, Inc. J Graph Theory 67: 226–234, 2011 67: 226‐234, 2011