太阳风等离子体输出流量的全日面二维结构

本文根据1983年十个 Carrington 周(1733—1742)期间的 K-日冕亮度、行星际闪烁(IPS)观测和光球磁场观测,首次探讨了太阳风等离子体质量、动量和能量输出流量 F_M,F_P 和 F_E 的全日面二维平均结构及其与光球磁场结构的关系.     

Constraint Programming and Operations Research: Comments from an Operations Researcher

This paper relates the author's personal experience with constraint programming and gives a personal assessment of the relationships between constraint programming and operations research.     

Strategic analysis of the dairy transportation problem

The dairy transportation problem (DTP) consists of determining the best routes to be performed for collecting milk from farms and delivering it to processing plants. We study the particular case of the province of Quebec, where the Fédération des producteurs de lait du Québec is responsible for negotiating the transportation costs on behalf of producers. Several issues are highlighted in the actual process of designing contracts such as using historical data. We propose an approach based on scenario analysis that consists of revising both the steps and the information used to construct the routes. We develop a generalized tabu search algorithm that integrates the different characteristics of the DTP.     

A simulation-based approach for fleet design in a technician dispatch problem with stochastic demand

We address the problem of developing policies for selecting the proper number of technicians to hire (fleet size) for an on-call repair service operating over a yearly planning horizon in an environment where the number of requests to be serviced each day can vary significantly from day to day and on a seasonal basis. We propose a new approach based on the simulation of a large number of sampled weekly instances and the application of a previously developed optimization procedure for the daily dispatch of technicians. The sampled instances are derived from an extensive statistical analysis of demand data with respect to several key parameters. The results of the simulations are utilized to adjust performance curves in function of fleet size that are then used in an economic analysis of the trade-offs between service quality and cost. Efficient policies for fleet design are then deducted from this analysis.     

Implicit depot assignments and rotations in vehicle routing heuristics

Vehicle routing variants with multiple depots and mixed fleet present intricate combinatorial aspects related to sequencing choices, vehicle type choices, depot choices, and depots positioning. This paper introduces a dynamic programming methodology for efficiently evaluating compound neighborhoods combining sequence-based moves with an optimal choice of vehicle and depot, and an optimal determination of the first customer to be visited in the route, called rotation. The assignment choices, making the richness of the problem, are thus no more addressed in the solution structure, but implicitly determined during each move evaluation. Two meta-heuristics relying on these concepts, an iterated local search and a hybrid genetic algorithm, are presented. Extensive computational experiments demonstrate the remarkable performance of these methods on classic benchmark instances for multi-depot vehicle routing problems with and without fleet mix, as well as the notable contribution of the implicit depot choice and positioning methods to the search performance. New state-of-the-art results are obtained for multi-depot vehicle routing problems (MDVRP), and multi-depot vehicle fleet mix problems (MDVFMP) with unconstrained fleet size. The proposed concepts are fairly general, and widely applicable to many other vehicle routing variants.     

Heuristics for multi-attribute vehicle routing problems: A survey and synthesis

The attributes of vehicle routing problems are additional characteristics or constraints that aim to better take into account the specificities of real applications. The variants thus formed are supported by a well-developed literature, including a large variety of heuristics. This article first reviews the main classes of attributes, providing a survey of heuristics and meta-heuristics for Multi-Attribute Vehicle Routing Problems (MAVRP). It then takes a closer look at the concepts of 64 remarkable meta-heuristics, selected objectively for their outstanding performance on 15 classic MAVRP with different attributes. This cross-analysis leads to the identification of “winning strategies” in designing effective heuristics for MAVRP. This is an important step in the development of general and efficient solution methods for dealing with the large range of vehicle routing variants.     

类氖钛X射线激光实验研究

在“星光”装置上采用预脉冲技术和透-反射线聚焦系统成功地进行了类氛钛x射线激光实验.测量了TiXⅢ,3s-3p,J=0～1激光线的增益系数.首次实验研究了预脉冲能量不同时,激光线强度随泵浦激光能量的变化及其发散角和偏转角.     

On the singularity of Green's tensor for a perfectly conducting semi-infinite cone

This paper is intended to clarify a misunderstanding concerningthe source singularity of the electric Green's tensor for aperfectly conducting semi-infinite cone of circular cross-section.Tai's series expansion of the Green's tensor is known to lacka singular term at the source region. Jones has reconstructedthe solution to this problem and has pointed out the differencebetween his result and that of Tai. The aim of our paper isto demonstrate that, although Jones's closed-form solution iscorrect, there is a mistake in his comparison with Tai's seriessolution. We conclude that one of the two additional singularterms that Jones claims as missing from Tai's formula must beomitted. Besides, we compare Jones's closed-form solution withSmyshlyaev's solution to the very same problem. We concludethat the magnetic field expressions given by Jones and Smyshlyaevcoincide, but a singular term is missing from Smyshlyaev's expressionfor the electric field.