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
Journal ArticleDOI
TL;DR: This paper presents a model for the constrained minimum weight Hamiltonian path problem with precedences and due dates forcing constraints, and introduces related valid cuts that can be used in a separation framework for the dual (Lagrangian based) relaxation of the problem.
Abstract: The Sequential Ordering Problem (herewith, SOP) with precedence relationships was introduced in Escudero (1988), and extended to cover release and due dates in Escudero and Sciomachen (1993). It has a broad range of applications, mainly in production planning for manufacturing systems. The problem consists of finding a minimum weight Hamiltonian path on a directed graph with weights on the nodes and the arcs, satisfying precedence relationships among the nodes and given lower and upper bounds on the weights of the Hamiltonian subpaths. In this paper we present a model for the constrained minimum weight Hamiltonian path problem with precedences and due dates forcing constraints, and introduce related valid cuts that can be used in a separation framework for the dual (Lagrangian based) relaxation of the problem. We also provide an heuristic separation procedure to obtain those cuts, so-called the Lagrangian Relax-and-Cut (LRC) scheme. Computational experience is given for variations of some SOP cases already reported in the literature.

6 citations

Proceedings Article
03 Jul 1996
TL;DR: This work considers the problem of partitioning rectilinear polygons into rectangles, using segments of minimum total length, and finds an optimal partitioning in less than O(n4) time.
Abstract: We consider the problem of partitioning rectilinear polygons into rectangles, using segments of minimum total length. This problem is NP-hard for polygons with holes. Even for hole-free polygons no known algorithm can find an optimal partitioning in less than O(n4) time.

6 citations

Journal Article
TL;DR: In this article, the authors proposed a GA algorithm to minimize the weight of bridge trusses under a moving load (HS20-truck) under the limitations imposed on its behavior by the design codes when it is subjected to moving load.
Abstract: The aim of this work is to minimize the weight of steel bridge trusses under the limitations imposed on its behaviour by the design codes when it is subjected to moving load (HS20-truck). Adaptive manner operators are included to enhance the capability of GA. Design examples are solved to illustrate the applicability of proposed algorithm. Results are compared with those evaluated by various optimization methods with continuous design variables such as sequential convex programming (SCP), sequential quadratic programming (SQP) and evolution strategy (EVOL). It can be concluded that the results obtained by GA is meaningful, more suitable for practice and GA performs well to find minimum weight of the bridge trusses under moving load.

6 citations

Journal ArticleDOI
TL;DR: In this paper, the authors define a function by means of the minimum weight flow on a planar graph and prove that this function satisfies the ultradiscrete Toda molecule equation, its Backlund transformation and the two-dimensional Toda molecules equation.
Abstract: We define a function by means of the minimum weight flow on a planar graph and prove that this function satisfies the ultradiscrete Toda molecule equation, its Backlund transformation and the two-dimensional Toda molecule equation. The method we employ in the proof can be considered as fundamental to the integrability of ultradiscrete soliton equations.

6 citations

Proceedings ArticleDOI
01 Jan 1992
TL;DR: In this article, the authors proposed a strategy for obtaining an optimal topology by minimizing the compliance of the truss, compared with a direct weight minimization solution to satisfy stress and displacement constraints.
Abstract: Strategies for topology optimization of trusses for minimum weight subject to stress and displacement constraints by Simultaneous Analysis and Design (SAND) are considered. The ground structure approach is used. A penalty function formulation of SAND is compared with an augmented Lagrangian formulation. The efficiency of SAND in handling combinations of general constraints is tested. A strategy for obtaining an optimal topology by minimizing the compliance of the truss is compared with a direct weight minimization solution to satisfy stress and displacement constraints. It is shown that for some problems, starting from the ground structure and using SAND is better than starting from a minimum compliance topology design and optimizing only the cross sections for minimum weight under stress and displacement constraints. A member elimination strategy to save CPU time is discussed.

6 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