Search results for "angle"
showing 10 items of 1921 documents
Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
2018
Abstract For the exact solution of many types of vehicle-routing problems, column-generation based algorithms have become predominant. The column-generation subproblems are then variants of the shortest-path problem with resource constraints which can be solved well with dynamic-programming labeling algorithms. For vehicle-routing problems with a pickup-and-delivery structure, the strongest known dominance between two labels requires the delivery triangle inequality (DTI) for reduced costs to hold. When the direction of labeling is altered from forward labeling to backward labeling, the DTI requirement becomes the pickup triangle inequality (PTI). DTI and PTI cannot be guaranteed at the sam…
GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem
2007
We develop a greedy randomized adaptive search procedure (GRASP) for the constrained two-dimensional two-stage cutting-stock problem. This is a special cutting problem in which the cut is performed in two phases. In the first phase, the stock rectangle is slit down its width into different vertical strips and in the second phase, each of these strips is processed to obtain the final pieces. We propose two different algorithms based on GRASP methodology. One is “piece-oriented” while the other is “strip-oriented.” Both procedures are fast and provide solutions of different structures to this cutting problem. We also propose a path-relinking algorithm, which operates on a set of elite soluti…
G1 rational blend interpolatory schemes: a comparative study
2012
Interpolation of triangular meshes is a subject of great interest in many computer graphics related applications, as, for example, gaming and realtime rendering. One of the main approaches to interpolate the positions and normals of the mesh vertices is the use of parametric triangular Bezier patches. As it is well known, any method aiming at constructing a parametric, tangent plane (G^1) continuous surface has to deal with the vertex consistency problem. In this article, we propose a comparison of three methods appeared in the nineties that use a particular technique called rational blend to avoid this problem. Together with these three methods we present a new scheme, a cubic Gregory patc…
Constructive procedures to solve 2-dimensional bin packing problems with irregular pieces and guillotine cuts
2015
Abstract This paper presents an approach for solving a new real problem in cutting and packing. At its core is an innovative mixed integer programme model that places irregular pieces and defines guillotine cuts. The two-dimensional irregular shape bin packing problem with guillotine constraints arises in the glass cutting industry, for example, the cutting of glass for conservatories. Almost all cutting and packing problems that include guillotine cuts deal with rectangles only, where all cuts are orthogonal to the edges of the stock sheet and a maximum of two angles of rotation are permitted. The literature tackling packing problems with irregular shapes largely focuses on strip packing i…
A tabu search algorithm for a two-dimensional non-guillotine cutting problem
2007
In this paper we study a two-dimensional non-guillotine cutting problem, the problem of cutting rectangular pieces from a large stock rectangle so as to maximize the total value of the pieces cut. The problem has many industrial applications whenever small pieces have to be cut from or packed into a large stock sheet. We propose a tabu search algorithm. Several moves based on reducing and inserting blocks of pieces have been defined. Intensification and diversification procedures, based on long-term memory, have been included. The computational results on large sets of test instances show that the algorithm is very efficient for a wide range of packing and cutting problems.
Handling precedence constraints in scheduling problems by the sequence pair representation
2015
In this paper, we show that sequence pair (SP) representation, primarily applied to the rectangle packing problems appearing in the VLSI industry, can be a solution representation of precedence constrained scheduling. We present three interpretations of sequence pair, which differ in complexity of schedule evaluation and size of a corresponding solution space. For each interpretation we construct an incremental precedence constrained SP neighborhood evaluation algorithm, computing feasibility of each solution in the insert neighborhood in an amortized constant time per examined solution, and prove the connectivity property of the considered neighborhoods. To compare proposed interpretations…
Non-parametric mean curvature flow with prescribed contact angle in Riemannian products
2020
Assuming that there exists a translating soliton $u_\infty$ with speed $C$ in a domain $\Omega$ and with prescribed contact angle on $\partial\Omega$, we prove that a graphical solution to the mean curvature flow with the same prescribed contact angle converges to $u_\infty +Ct$ as $t\to\infty$. We also generalize the recent existence result of Gao, Ma, Wang and Weng to non-Euclidean settings under suitable bounds on convexity of $\Omega$ and Ricci curvature in $\Omega$.
Fixed angle inverse scattering in the presence of a Riemannian metric
2020
We consider a fixed angle inverse scattering problem in the presence of a known Riemannian metric. First, assuming a no caustics condition, we study the direct problem by utilizing the progressing wave expansion. Under a symmetry assumption on the metric, we obtain uniqueness and stability results in the inverse scattering problem for a potential with data generated by two incident waves from opposite directions. Further, similar results are given using one measurement provided the potential also satisfies a symmetry assumption. This work extends the results of [23,24] from the Euclidean case to certain Riemannian metrics.
Geometry and analysis of Dirichlet forms
2012
Let $ \mathscr E $ be a regular, strongly local Dirichlet form on $L^2(X, m)$ and $d$ the associated intrinsic distance. Assume that the topology induced by $d$ coincides with the original topology on $ X$, and that $X$ is compact, satisfies a doubling property and supports a weak $(1, 2)$-Poincar\'e inequality. We first discuss the (non-)coincidence of the intrinsic length structure and the gradient structure. Under the further assumption that the Ricci curvature of $X$ is bounded from below in the sense of Lott-Sturm-Villani, the following are shown to be equivalent: (i) the heat flow of $\mathscr E$ gives the unique gradient flow of $\mathscr U_\infty$, (ii) $\mathscr E$ satisfies the Ne…
"Table 6" of "Properties of jet fragmentation using charged particles measured with the ATLAS detector in $pp$ collisions at $\sqrt{s}=13$ TeV"
2020
$\langle p_{T}^{rel} / GeV \rangle$, central jet.