scispace - formally typeset
Search or ask a question
Topic

Minimum weight

About: Minimum weight is a research topic. Over the lifetime, 2002 publications have been published within this topic receiving 28244 citations.


Papers
More filters
Patent
07 Jul 2010
TL;DR: In this paper, a device for pathway exploration by utilizing predicted traffic data, which comprises a Link path forming unit, a segmenting unit, weight calculation unit and a selection unit, is presented.
Abstract: The invention provides a device for pathway exploration by utilizing predicted traffic data, which comprises a Link path forming unit, a segmenting unit, a weight calculation unit and a selection unit, wherein the Link path forming unit is used for forming all Link paths from an own vehicle to the destination, and the segmenting unit is used for segmenting the geographic region into a plurality of different regions which take the own vehicle as the center; the weight calculation unit is used for aiming at each Link path to calculate the weight of the Link path, and the selection unit is used for selecting the Link path with a minimum weight to be used as an optimal path; when the weight of the Link patch is calculated, the weight calculation unit uses real-time traffic data in a first region nearest to the own vehicle, and uses the predicted traffic data at the corresponding time in other regions.

16 citations

Journal ArticleDOI
TL;DR: It is shown that if there is a self-orthogonal 5-(72,16,78) design, then the rows of its block-point incidence matrix generate an extremal doubly even self-dual code of length 72 by the codewords of minimum weight.

16 citations

Journal ArticleDOI
TL;DR: In this paper, the authors apply deep reinforcement learning techniques to design high threshold decoders for the toric code under uncorrelated noise, and observe that the agent implements a policy similar to that of minimum weight perfect matchings even though no bias towards any policy is given a priori.

16 citations

Journal ArticleDOI
TL;DR: The results of the SGA are compared to those of state of art algorithms showing that SGA is a competitive meta-heuristic search procedure for engineering design applications.
Abstract: This paper presents a design procedure employing the Search Group Algorithm (SGA) for discrete optimization of planar steel frames. SGA is a global optimization heuristic algorithm that has been developed recently. It is based on search groups that explore the design space in a global phase and exploit the best domain regions found in a local phase. The algorithm is used in a structural optimization problem to obtain minimum weight frames subjected to strength and displacement requirements imposed by the American Institute for Steel Construction (AISC) Load and Resistance Factor Design. Designs are obtained by selecting appropriate W-shaped sections from a standard set of steel sections specified by the AISC. Three frame examples from the literature are examined to verify the effectiveness and robustness of the SGA for this type of problem. The results of the SGA are compared to those of state of art algorithms showing that SGA is a competitive meta-heuristic search procedure for engineering design applications.

16 citations

Journal ArticleDOI
TL;DR: Differential Evolution and Particle Swarm Optimization methods have been applied to the design of minimum weight toroidal shells subject to internal pressure, showing that Differential Evolution outperforms the Particle swarm Optimization in most of cases.
Abstract: In this paper, Differential Evolution and Particle Swarm Optimization methods have been applied to the design of minimum weight toroidal shells subject to internal pressure. Constraints are first yield pressure, plastic pressures, plastic instability pressure and volume contained by the toroid. Optimality includes geometry and wall thickness, which is constant or variable. The optimization process is performed by FORTRAN routines coupled with finite element analysis code ABAQUS. Depending on geometry parameters of the toroid, the material saving can be as high as 72%. The results also show that Differential Evolution outperforms the Particle Swarm Optimization in most of cases.

16 citations


Network Information
Related Topics (5)
Upper and lower bounds
56.9K papers, 1.1M citations
76% related
Time complexity
36K papers, 879.5K citations
73% related
Numerical analysis
52.2K papers, 1.2M citations
73% related
Optimization problem
96.4K papers, 2.1M citations
73% related
Polynomial
52.6K papers, 853.1K citations
72% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202321
202239
202153
202051
201966
201858