Relative efficiency appraisal of discrete choice modeling algorithms using small-scale maximum likelihood estimator through empirically tailored computing environment

Discrete choice models are widely used in multiple sectors such as transportation, health, energy, and marketing, etc., where the model estimation is usually carried out by using commercial software. Nonetheless, tailored computer codes offer modellers greater flexibility and control of unique modelling situation. Aligned with empirically tailored computing environment, this research discusses the relative performance of six different algorithms of a discrete choice model using three key performance measures： convergence time, number of iterations, and iteration time. The computer codes are developed by using Visual Basic Application （VBA）. Maximum likelihood function （MLF） is formulated and the mathematical relationships of gradient and Hessian matrix are analytically derived to carry out the estimation process. The estimated parameter values clearly suggest that convergence criterion and initial guessing of parameters are the two critical factors in determining the overall estimation performance of a custom-built discrete choice model.

基于Inver-over算子的离散和声退火混合算法解决TSP问题

和声搜索是一种新的启发式优化算法,算法模拟了音乐创作中乐师们凭自己的记忆,通过反复地调整乐队中各乐器的音调,最终能达到一个美妙的和声状态的过程.针对和声搜索算法容易陷入局部最优的缺陷,将其与模拟退火算法结合,得到了一种和声退火混合算法.又将混合算法应用到离散域中,并用Inver-over算子实现了离散和声退火混合算法.实验表明,混合算法针对TSP问题具有较高的求解质量.

Simple Insulin Dose Adjustment Using 3-3-1 Algorithm in Japanese Patients with Type 2 Diabetes: Start Kanazawa Study (Self-Titration Aggressive Algorithm with Glargine Trial)

We implemented a 3-3-1 algorithm in order to provide safe and simple self-titration in patients who newly initiated BOT as well as who were already on BOT and evaluated its utility in clinical setting. A total of 46 patients, 21 patients in the newly-initiated group and 25 patients in the existing BOT group performed dose adjustment using 3-3-1 algorithm. HbA1c was significantly improved 4 weeks after the initiation from 8.5% ± 1.2% at baseline to 7.3% ± 0.7% at the final evaluation (p 0.01, vs. Baseline). The average daily insulin units increased throughout the study period from 10.1 ± 6.7 at baseline to 14.6 ± 8.9 units at the final evaluation. Weight didn’t significantly change throughout the study (p = 0.12). The incidents of hypoglycemia were 0.8/month during the insulin dose self-adjustment period and 0.4/month during the follow-up period. The 3-3-1 algorithm using insulin glargine provided a safe and simple dose adjustment and demonstrated its utility in patients who were newly introduced to insulin treatment as well as who were already on BOT.

A new integration algorithm for finite deformation of thermo-elasto-viscoplastic single crystals

An algorithm for integrating the constitutive equations in thermal framework is presented, in which the plastic deformation gradient is chosen as the integration variable. Compared with the classic algorithm, a key feature of this new approach is that it can describe the finite deformation of crystals under thermal conditions. The obtained plastic deformation gradient contains not only plastic defor- mation but also thermal effects. The governing equation for the plastic deformation gradient is obtained based on ther- mal multiplicative decomposition of the total deformation gradient. An implicit method is used to integrate this evo- lution equation to ensure stability. Single crystal 1 100 aluminum is investigated to demonstrate practical applications of the model. The effects of anisotropic properties, time step, strain rate and temperature are calculated using this integration model.

An Algorithm of 0-1 Knapsack Problem Based on Economic Model

In order to optimize the knapsack problem further, this paper proposes an innovative model based on dynamic expectation efficiency, and establishes a new optimization algorithm of 0-1 knapsack problem after analysis and research. Through analyzing the study of 30 groups of 0-1 knapsack problem from discrete coefficient of the data, we can find that dynamic expectation model can solve the following two types of knapsack problem. Compared to artificial glowworm swam algorithm, the convergence speed of this algorithm is ten times as fast as that of artificial glowworm swam algorithm, and the storage space of this algorithm is one quarter that of artificial glowworm swam algorithm. To sum up, it can be widely used in practical problems.

Optimization of Process Parameters of Continuous Microwave Drying Raspberry Puree Based on RSM and ANN-GA

To improve drying uniformity and anthocyanin content of the raspberry puree dried in a continuous microwave dryer,the effects of process parameters(microwave intensity,air velocity,and drying time)on evaluation indexes(average temperature,average moisture content,average retention rate of the total anthocyanin content,temperature contrast value,and moisture dispersion value)were investigated via the response surface method(RSM)and the artificial neural network(ANN)with genetic algorithm(GA).The results showed that the microwave intensity and drying time dominated the changes of evaluation indexes.Overall,the ANN model was superior to the RSM model with better estimation ability,and higher drying uniformity and anthocyanin retention rate were achieved for the ANN-GA model compared with RSM.The optimal parameters were microwave intensity of 5.53 W•g^(-1),air velocity of 1.22 m·s^(-1),and drying time of 5.85 min.This study might provide guidance for process optimization of microwave drying berry fruits.

An Improved Binary Wolf Pack Algorithm Based on Adaptive Step Length and Improved Update Strategy for 0-1 Knapsack Problems

Binary wolf pack algorithm (BWPA) is a kind of intelligence algorithm which can solve combination optimization problems in discrete spaces.Based on BWPA, an improved binary wolf pack algorithm (AIBWPA) can be proposed by adopting adaptive step length and improved update strategy of wolf pack. AIBWPA is applied to 10 classic 0-1 knapsack problems and compared with BWPA, DPSO, which proves that AIBWPA has higher optimization accuracy and better computational robustness. AIBWPA makes the parameters simple, protects the population diversity and enhances the global convergence.

基于改进反序-杂交算子的免疫克隆选择算法

反序-杂交算子在求解TSP时容易陷入局部最优。为了优化电路板布局,提高计算快速性,对反序-杂交算子进行了改进,设计了1st-Inver-over算子和2nd-Inver-over算子。采用1st-Inver-over算子和2nd-Inver-over算子作为主要免疫基因操作算子实现了求解TSP的免疫克隆算法,在算法前期,只采用1st-Inver-over算子来保证算法的收敛速度,在算法后期,根据种群的多样性自适应的选取1st-Inver-over算子和2nd-Inver-over算子来协调算法的收敛速度和种群的多样性。仿真结果表明,Inver-over ICSA比经典的GT算法具有更好的收敛性和搜索效率。

基于精英策略的反序-杂交算法

论述了反序-杂交算子在求解TSP上的优势,认为该算子算法结构简单,在求解问题时不仅速度快,而且有很好的精确性和稳定性。基于多父体杂交算法的精英子空间的方法在求解函数优化问题上可以得到很好的结果,将精英策略和反序-杂交算子相结合,来求解组合优化问题,在反序-杂交算法中运用精英策略进行个体选择,使算法具有更强的学习能力。数值实验表明,新算法比传统的反序-杂交算子具有更快的运行速度和更好的求解精度。

A system-wide approach to minimize the operational cost of bench production in open-cast mining operations

The production cycle of open-cast coal mines generally in eludes drilling, blasting, loading, hauling and coal preparation activities. Individual optimization of these activities does not mean that the whole system is optimized. This paper proposes a cost model considering all activities in mining cycle and system-wide approach to minimize the total mining cost of bench production. Since the fragmentation size and blast-hole diameter are linked to all activities of mining system, they are considered as decision variables in the problem form ul at io n. The operatio n costs are then minimized by using the evolutionary algorithm. Moreover, the impact of the change in the explosive price, and the hourly unit cost of equipment on total mining cost is quantified by sensitivity analysis. A case study is implemented to demonstrate the developed model.

f-heredity knowledge and f-heredity mining

Using S-rough sets, this paper gives the concepts off-heredity knowledge and its heredity coefficient, and f-variation coefficient of knowledge; presents the theorem of f-attribute dependence of variation coefficient and the relation theorem of heredity-variation. The attribute dependence of f-variation coefficient and the relation of heredity-variation are important characteristics of S-rough sets. From such discussion, this paper puts forward the heredity mining off-knowledge and the algorithm of heredity mining, also gives its relative application.

Semi-solid Pressing Bonding Strength between Steel and Cu-graphite Composite

The pressing bonding of steel plate with QTi3.5-3.5graphite slurry was studied. The relationship among preheating temperature of steel plate, preheating temperature of dies, solid fraction of QTi3.5-3.5graphite slurry, and interfacial shear strength of bonding plate could be established with artificial neural networks perfectly. This model could be optimized with a genetic algorithm. The results show that the optimum bonding parameters are: 618℃ for preheating temperature of steel plate, 526℃ for preheating temperature of dies and 46.2% for solid fraction of QTi3.5-3.5graphite slurry, and the largest interfacial shear strength of bonding plate is 128.3 MPa.

Real-time OHT Dispatching Mechanism for the Interbay Automated Material Handling System with Shortcuts and Bypasses

As a key to improve the performance of the interbay automated material handling system （AMHS） in 300 mm semiconductor wafer fabrication system, the real- time overhead hoist transport （OHT） dispatching problem has received much attention. This problem is first formu- lated as a special form of assignment problem and it is proved that more than one solution will be obtained by Hungarian algorithm simultaneously. Through proposing and strictly proving two propositions related to the char- acteristics of these solutions, a modified Hungarian algo- rithm is designed to distinguish these solutions. Finally, a new real-time OHT dispatching method is carefully designed by implementing the solution obtained by the modified Hungarian algorithm. The experimental results of discrete event simulations show that, compared with con- ventional Hungarian algorithm dispatching method, the proposed dispatching method that chooses the solution with the maximum variance respectively reduces on average 4 s of the average waiting time and average lead time of wafer lots, and its performance is rather stable in multiple dif- ferent scenarios of the interbay AMHS with different quantities of shortcuts. This research provides an efficient real-time OHT dispatching mechanism for the interbay AMHS with shortcuts and bypasses.

OPTIMIZATION ON ANTENNA PATTERN OF SPACEBORNE SAR WITH IMPROVED NSGA-Ⅱ

Optimization of antenna array pattern used in a spaceborne Synthetic Aperture Radar (SAR) system is considered in this study. A robust evolutionary algorithm, Non-dominated Sorting Genetic Algorithms (the improved NSGA-Ⅱ), is applied on a spaceborne SAR antenna pattern design. The system consists of two objective functions with two constraints. Pareto fronts are generated as a result of multi-objective optimization. After being validated by a test problem ZDT4, the algorithms are used to synthesize spaceborne SAR antenna radiation pattern. The good results with low Ambi- guity-to-Signal Ratio (ASR) and high directivity are obtained in the paper.

Weekly Fleet Assignment Model and Algorithm

A 0-1 integer programming model for weekly fleet assignment was put forward based on linear network and weekly flight scheduling in China. In this model, the objective function is to maximize the total profit of fleet assignment, subject to the constraints of coverage, aircraft flow balance, fleet size, aircraft availability, aircraft usage, flight restriction, aircraft seat capacity, and stopover. Then the branch-and-bound algorithm based on special ordered set was applied to solve the model. At last, a real- wofld case study on an airline with 5 fleets, 48 aircrafts and 1 786 flight legs indicated that the profit increase was ￥ 1 591276 one week and the running time was no more than 4 rain, which shows that the model and algorithm are fairly good for domestic airline.

Seismic fluid identification using a nonlinear elastic impedance inversion method based on a fast Markov chain Monte Carlo method

Elastic impedance inversion with high efficiency and high stability has become one of the main directions of seismic pre-stack inversion. The nonlinear elastic impedance inversion method based on a fast Markov chain Monte Carlo （MCMC） method is proposed in this paper, combining conventional MCMC method based on global optimization with a preconditioned conjugate gradient （PCG） algorithm based on local optimization, so this method does not depend strongly on the initial model. It converges to the global optimum quickly and efficiently on the condition that effi- ciency and stability of inversion are both taken into consid- eration at the same time. The test data verify the feasibility and robustness of the method, and based on this method, we extract the effective pore-fluid bulk modulus, which is applied to reservoir fluid identification and detection, and consequently, a better result has been achieved.

Parameter Self - Learning of Generalized Predictive Control Using BP Neural Network

This paper describes the self—adjustment of some tuning-knobs of the generalized predictive controller(GPC).A three feedforward neural network was utilized to on line learn two key tuning-knobs of GPC,and BP algorithm was used for the training of the linking-weights of the neural network.Hence it gets rid of the difficulty of choosing these tuning-knobs manually and provides easier condition for the wide applications of GPC on industrial plants.Simulation results illustrated the effectiveness of the method.

<i>H</i>(.,.)<i>- φ - η -</i>Accretive Operators and Generalized Variational-Like Inclusions

In this paper, we generalize H(.,.) accretive operator introduced by Zou and Huang [1] and we call it H(.,.)- φ - η - accretive operator. We define the resolvent operator associated with H(.,.)- φ - η - accretive operator and prove its Lipschitz continuity. By using these concepts an iterative algorithm is suggested to solve a generalized variational-like inclusion problem. Some examples are given to justify the definition of H(.,.)- φ - η - accretive operator.

实数编码遗传算法在大地电磁测深二维反演中的应用(英文)

作为全局非线性优化的新方法之一的遗传算法,近年来已从生物工程流行到大地电磁测深资料解释中.然而,大地电磁反演问题具有不适定性,解的非唯一性.通过结合求解不适定问题的Tikhonov正则化方法,本文采用实数编码遗传算法求解大地电磁二维反演问题.此算法在构建目标函数时引入正则化的思想,利用遗传算法求解最优化问题.常规的基于局部线性化的最优化反演方法易使解陷入局部极小值,而且严重的依赖初始模型的选择.与传统线性化的迭代反演方法相比,实数编码遗传算法能够克服传统方法的不足且能获得更好的反演结果.通过对大地电磁测深理论模型进行计算,结果表明:该算法具有收敛速度快、解的精度高和避免出现早熟等优点,可用于大地电磁资料解释.

求解TSP的混合遗传算法

介绍一种求解TSP的混合遗传算法,该算法结合了基于邻域的LK算法和采用Inver-Over算子的遗传算法,并在算法中增加一些控制策略,加快算法的收敛速度,又保证群体的多样性。实验表明该算法是有效的。