Exact integration in the boundary element method for two-dimensional elastostatic problems

This paper derives the exact integrations for the integrals in the boundary element analysis of two-dimensional elastostatics. For facilitation, the derivation is based on the simple forms of the fundamental functions by taking constant, discontinuous linear and discontinuous quadratic elements as examples. The efficiency and accuracy of the derived exact integrations are verified against five benchmark problems; the results indicate that the derived exact integrations significantly reduces the CPU time for forming the matrices of the boundary element analysis and solving the internal displacements.     

Precise rendering method for exact anti-aliasing and highlighting

This paper introduces the Precise Rendering Method, which generates accurately anti-aliased and highlighted images from tessellated polygons. The Precise Rendering Method first solves the aliasing problems of hidden surface removal by using the Cross Scanline Algorithm. This algorithm can exactly calculate polygon areas projected onto each pixel by using horizontal and vertical scanlines. Aliasing artifacts in shading are then prevented by the Reflection Intergration Method, which analytically integrates the intensity of reflection in the solid angle defined by surface normals at vertices of the projected area. Several synthesized images are created to show the efficiency of the Precise Rendering Method.     

一种关于目标罚参数的精确罚函数法

罚函数法是一种将约束优化问题转化为无约束问题的重要方法.对于一般的约束优化问题,通过加入新参数,给出了一种改进的精确罚函数和这种罚函数的精确罚定理证明,提出了求解这种罚函数的算法.实验表明该算法是有效的.     

Formulations and exact algorithms for the vehicle routing problem with time windows

In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for the VRPTW are in many aspects inherited from work on the traveling salesman problem (TSP). In recognition of this fact this paper is structured relative to four seminal papers concerning the formulation and exact solution of the TSP, i.e. the arc formulation, the arc-node formulation, the spanning tree formulation, and the path formulation. We give a detailed analysis of the formulations of the VRPTW and a review of the literature related to the different formulations. There are two main lines of development in relation to the exact algorithms for the VRPTW. One is concerned with the general decomposition approach and the solution to certain dual problems associated with the VRPTW. Another more recent direction is concerned with the analysis of the polyhedral structure of the VRPTW. We conclude by examining possible future lines of research in the area of the VRPTW.     

Recovering the initial state of an infinite-dimensional system using observers

Let A be the generator of a strongly continuous semigroup T on the Hilbert space X, and let C be a linear operator from D(A) to another Hilbert space Y (possibly unbounded with respect to X, not necessarily admissible). We consider the problem of estimating the initial state z₀∈D(A) (with respect to the norm of X) from the output function y(t)=CT_tz₀, given for all t in a bounded interval [0,τ]. We introduce the concepts of estimatability and backward estimatability for (A,C) (in a more general way than currently available in the literature), we introduce forward and backward observers, and we provide an iterative algorithm for estimating z₀ from y. This algorithm generalizes various algorithms proposed recently for specific classes of systems and it is an attractive alternative to methods based on inverting the Gramian. Our results lead also to a very general formulation of Russell’s principle, i.e., estimatability and backward estimatability imply exact observability. This general formulation of the principle does not require T to be invertible. We illustrate our estimation algorithms on systems described by wave and Schrödinger equations, and we provide results from numerical simulations.     

动态定价策略下的精确库存成本建模与优化

提出一种更接近实际的需求率公式,在式中同时考虑了价格和出厂时间对客户需求率的影响.基于新的需求率公式,建立了动态定价策略下的精确库存持有成本模型和库存商品的利润函数.注意到利润函数的复杂性,使用遗传算法分析了利润函数的性质,得出最优定价时间、定价价格和最大利润的关系,并分析了库存持有成本变化和消费者购买欲望变化对各定价参数的影响.     

Fast computation of the prime implicants by exact direct-cover algorithm based on the new partial ordering operation rule

In this study, a novel OFF-set based direct-cover Exact Minimization Algorithm (EMA) is proposed for single-output Boolean functions represented in a sum-of-products form. To obtain the complete set of prime implicants covering the given Target Minterm (ON-minterm), the proposed method uses OFF-cubes (OFF-minterms) expanded by this Target Minterm. The amount of temporary results produced by this method does not exceed the size of the OFF-set. In order to achieve the goal of this study, which is to make faster computations, logic operations were used instead of the standard operations. Expansion OFF-cubes, commutative absorption operations and intersection operations are realized by logic operations for fast computation. The proposed minimization method is tested on several classes of benchmarks and then compared with the ESPRESSO algorithm. The results show that the proposed algorithm obtains more accurate and faster results than ESPRESSO does.     

Coupled-task scheduling on a single machine subject to a fixed-job-sequence

This paper investigates single-machine coupled-task scheduling where each job has two tasks separated by an exact delay. The objective of this study is to schedule the tasks to minimize the makespan subject to a given job sequence. We introduce several intriguing properties of the fixed-job-sequence problem under study. While the complexity status of the studied problem remains open, an O(n²) algorithm is proposed to construct a feasible schedule attaining the minimum makespan for a given permutation of 2n tasks abiding by the fixed-job-sequence constraint. We investigate several polynomially solvable cases of the fixed-job-sequence problem and present a complexity graph of the problem.     

An exact algorithm for minimum distortion embedding

Let G be an unweighted connected graph on n vertices. We show that an embedding of the shortest path metric of G into the line with minimum distortion can be found in time 5^n+o(n). This is the first algorithm breaking the trivial n!-barrier.     

Analysis of the maximum level policy in a production-distribution system

We consider a production-distribution system, where a facility produces one commodity which is distributed to a set of retailers by a fleet of vehicles. Each retailer defines a maximum level of the inventory. The production policy, the retailers replenishment policies and the transportation policy have to be determined so as to minimize the total system cost. The overall cost is composed by fixed and variable production costs at the facility, inventory costs at both facility and retailers and routing costs. We study two different types of replenishment policies. The well-known order-up to level (OU) policy, where the quantity shipped to each retailer is such that the level of its inventory reaches the maximum level, and the maximum level (ML) policy, where the quantity shipped to each retailer is such that the inventory is not greater than the maximum level. We first show that when the transportation is outsourced, the problem with OU policy is NP-hard, whereas there exists a class of instances where the problem with ML policy can be solved in polynomial time. We also show the worst-case performance of the OU policy with respect to the more flexible ML policy. Then, we focus on the ML policy and the design of a hybrid heuristic. We also present an exact algorithm for the solution of the problem with one vehicle. Results of computational experiments carried out on small size instances show that the heuristic can produce high quality solutions in a very short amount of time. Results obtained on a large set of randomly generated problem instances are also shown, aimed at comparing the two policies.