The unprecedented growth of passenger throughput in large airport terminals highlights the importance of analyzing passengers’ movement to achieve airport terminal’s elaborate management. Based on the theory of original social force model, video data from a departure hall of a large airport terminal in China were analyzed to summarize passengers’ path planning characteristics. Then, a double-level model was established to describe passengers’ path planning behaviors. At the decision level of the proposed model, the avoiding force model including common avoiding force and additional horizontal avoiding force was established on the basis of setting time and space limitations for taking avoiding action and was used to describe passengers’ path planning in close-range space. At the tactical level of the proposed model, the route and node choice models were established to describe passengers’ path planning in long-range space. In the route choice model, a distribution of intermediate destination areas was proposed, with detouring distance, pedestrian density, speed difference, and pedestrian distribution considered in choosing an intermediate destination area. In the node choice model, the walking distance, the quantity of people waiting, and luggage were considered in choosing a check-in counter or security check channel. The main parameters of the proposed model were confirmed according to video data. Simulation results show that the proposed model can simulate departure passengers’ path planning behaviors at an acceptable accuracy level.

No abstract

The no-wait flow-shop scheduling problem with sequence-dependent setup times and release times (i.e., the NFSP with SSTs and RTs) is a typical NP-hard problem. This paper proposes an enhanced differential evolution algorithm with several fast evaluating strategies, namely, DE_FES, to minimize the total weighted tardiness objective (TWT) for the NFSP with SSTs and RTs. In the proposed DE_FES, the DE-based search is adopted to perform global search for obtaining the promising regions or solutions in solution space, and a fast local search combined with three presented strategies is designed to execute exploitation from these obtained regions. Test results and comparisons with two effective meta-heuristics show the effectiveness and robustness of DE_FES.

Vehicle routing problem with time Windows (VRPTW) that is a kind of important extension type for VPR. In view of problem which the ant colony algorithm in solving VRPTW easily plunged into local optimum , this paper defines a new ant transition probability of saving ideas, and uses the Pareto optimal solution set of global pheromone updating rule, and puts forward a kind of improved Pareto ant colony algorithm (IPACA) . Through the simulation experiments show that IPACA improves the global search ability of ACA, effectively avoids the algorithm falls into local optimum, and reduces the total distribution cost (distance), so as to verify the effectiveness of the proposed algorithm.

A new comprehensive evaluation method of tobacco mixing uniformity was presented in this paper. In this method, projection pursuit model was used to select evaluation index and determine the index weights. Seven chemical compositions which had a major impact on the overall evaluation, such as total volatile acid, total volatile bases, PH, polyphenol, protein, total nitrogen and chlorine were sampled repetitiously and calculated the average and coefficient of variance. Tobacco mixing uniformity was evaluated by the score according to coefficient of variance. Comprehensive evaluation of five batches of tobacco was carried out and the results were consistent with the traditional. This method was easy to get basic data and evaluation results fitted the actual. It was a simple and practical evaluation method of mixing uniformity.