VRPTW的扰动恢复及其TABU SEARCH算法

本文对带时间窗的车辆路线安排扰动恢复问题进行了讨论,分析了各种可能的扰动:增加减少客户,时间窗、客户需求及路线可行性的扰动,构造了扰动模型.利用禁忌搜索算法对问题进行求解,同时通过对模型参数重新设置,得到了多个满足要求的不同的解,这样使解更具有实际可行性和有效性.     

Surface morphologies of anthracene single crystals grown from vapor phase

The morphologies and lattice structures of anthracene single crystals grown from the vapor phase were investigated using optical microscopy, phase contrast microscopy, atomic force microscopy (AFM), and X-ray diffraction analysis. Common morphologies with hexagonal large planes were observed irrespective of crystal size. The observation of certain surface morphologies with a phase contrast microscopy revealed that the spiral steps originated from screw dislocations present on the (0 0 1) planes. Moreover, the center and edge of the (0 0 1) planes had large curvatures, similar to hills. Resultantly, quarter-monolayer (ML) steps were observed on the large and flat planes between both hills.     

Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem

We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2^w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations in O(loglog|U|) time and needs O(loglog|U|/logloglog|U|) structural changes per update operation. The data structure is a simplified version of the van Emde Boas' tree introducing, in its construction and functioning, new concepts, which help to keep the important information for searching along the path of the tree, in a more compact and organized way.     

一种带时间窗和车辆数目限制的车辆路线问题及其算法

本文提出了带时间窗和车辆数目限制的车辆路线问题的数学模型,针对该问题的特征构造了一种路线生成算法和禁忌搜索算法,并对Solomon提出的C1、R1、RC1类数据集给出了数值运算的结果,实验结果表明算法是有效的.     

A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows

The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a problem oriented point of view the computational results show that the approach is competitive with an existing Tabu Search algorithm with respect to both solution quality and computation times.     

Analysis of (π K<Superscript>+</Superscript>) and (K<Superscript>-</Superscript>, K<Superscript>+</Superscript>) hypernuclear production spectra in distorted-wave impulse approximation

We study the hyperon-nucleus potential with distorted-wave impulse wave approximation (DWIA) using the Green's function method. In order to include the nucleon and hyperon potential effects in Fermi averaging, we introduce the local optimal momentum approximation of target nucleons. We can describe the quasi-free Λ , Σ and Ξ production spectra in a better way than in the standard Fermi-averaged t -matrix treatments.     

Direct mass measurements of neutron-deficient 152Sm projectile fragments at the FRS-ESR facility

The FRS-ESR facility at GSI provides one of the most efficient methods for direct mass measurements. In the present experiment, exotic nuclei were produced via fragmentation of ¹⁵²Sm projectiles in a thick beryllium target at 500-600 MeV/u, separated in-flight with the fragment separator FRS, and injected into the storage-cooler ring ESR. Time-resolved Schottky Mass Spectrometry was applied for mass measurements of stored and electron-cooled bare and few-electron ions. 373 different nuclides were identified by means of the spectra of their revolution frequencies. Masses for 18 nuclides (⁸⁴Zr, ⁹²Ru, ⁹⁴Rh, ^107,108,110Sb, ^111,112,114I, ¹¹⁸Ba, ^122,123La, ¹²⁴Ce, ¹²⁷Pr, ¹²⁹Nd, ¹³²Pm, ¹³⁴Sm, ¹³⁷Eu) have been determined for the first time. Masses for ^111,112I and ¹¹³Xe have been obtained via known α-decay energies. The experiment and first results will be presented.     

Searching for a counterfeit coin with b-balance

We consider the classical problem of searching for a heavier coin in a set of n coins, n-1 of which have the same weight. The weighing device is b-balance which is the generalization of two-arms balance. The minimum numbers of weighings are determined exactly for worst-case sequential algorithm, average-case sequential algorithm, worst-case predetermined algorithm, average-case predetermined algorithm.We also investigate the above search model with additional constraint: each weighing is only allowed to use the coins that are still in doubt. We present a worst-case optimal sequential algorithm and an average-case optimal sequential algorithm requiring the minimum numbers of weighings.     

ON DIRECT METHOD OF SOLUTION FOR A CLASS OF SINGULAR INTEGRAL EQUATIONS

In this article, by introducing characteristic singular integral operator and associate singular integral equations (SIEs), the authors discuss the direct method of solution for a class of singular integral equations with certain analytic inputs. They obtain both the conditions of solvability and the solutions in closed form. It is noteworthy that the method is different from the classical one that is due to Lu.     

Near-optimal design of Global Positioning System (GPS) networks using the Tabu Search technique

This paper describes an optimization technique based on an heuristic procedure which is applied to analyse and improve the efficiency of the design of Global Positioning System (GPS) surveying networks. GPS is a valuable survey tool because of its ability to increase the accuracy, speed and flexibility of a survey. A GPS network can be defined as a number of stations, which are co-ordinated by a series of sessions, formed by placing receivers on stations. The goal is to select the best order in which these sessions can be organised to give the best possible schedule. Generally, solving large networks to optimality requires impractical computational time. This paper proposes a Tabu Search technique which provides optimal or near-optimal solutions for large networks with an acceptable amount of computational effort. Computational results for several case studies with known and unknown optimal schedules have been presented to assess the performance of the proposed technique.