scispace - formally typeset
Search or ask a question
Topic

Discrete optimization

About: Discrete optimization is a research topic. Over the lifetime, 4598 publications have been published within this topic receiving 158297 citations. The topic is also known as: discrete optimisation.


Papers
More filters
Journal ArticleDOI
TL;DR: In this article, a novel algorithm is developed that employs basic principles of this method for structural optimization problems specifically, and performance of the proposed algorithm is measured using one benchmark as well as three practical truss structures that are sized for minimum weight subject to stress, stability and displacement constraints according to the American Institute of Steel Construction-Allowable Stress Design (AISC-ASD) specification.

138 citations

Journal ArticleDOI
TL;DR: The mixed layout and sizing optimization problem of a typical steel roof is solved using a genetic algorithm for the layout part, and a logic problem is used for the sizing optimization of the truss roof.
Abstract: Genetic algorithms have their basis in Darwin’s theory of survival of the fittest. These algorithms have been used successfully in genetics and recently in a variety of optimization problems. In this paper, the mixed layout and sizing optimization problem of a typical steel roof is solved using a genetic algorithm for the layout part, and a logic problem is used for the sizing optimization of the truss roof. The method is applied to large-design-space problems, and near-optimum solutions are found in reasonable computing time. The genetic algorithm is based on a roulette-wheel reproduction scheme, a single point crossover, and a standard mutation scheme. An elitist strategy is also used that passes the best designs of a generation to the next generation. Numerical results are presented that show the efficiency of the method. Estimates of the various parameters of the algorithm are determined, which render the method an efficient optimization method for discrete structural design problems.

137 citations

Journal ArticleDOI
TL;DR: This paper formulates the EVCS problem as a hierarchical mixed-variable optimization problem, considering the dependency among the station selection, the charging option at each station and the charging amount settings, and specifically design a Mixed-Variable Differentiate Evolution (MVDE) as the scheduling algorithm for this problem.
Abstract: The increasing popularity of battery-limited electric vehicles puts forward an important issue of how to charge the vehicles effectively. This problem, commonly referred to as Electric Vehicle Charging Scheduling (EVCS), has been proven to be NP-hard. Most of the existing works formulate the EVCS problem simply as a constrained shortest path finding problem and treat it by discrete optimization. However, other variables such as the charging amount of energy and the charging option at a station need to be considered in practical use. This paper hence formulates the EVCS problem as a hierarchical mixed-variable optimization problem, considering the dependency among the station selection, the charging option at each station and the charging amount settings. To adapt to the new problem model, we specifically design a Mixed-Variable Differentiate Evolution (MVDE) as the scheduling algorithm for our proposed EVCS system. The MVDE contains several specific operators, including a charging station route construction, a hierarchical mixed-variable mutation operator and a constraint-aware evaluation operator. Experimental results validate the effectiveness of our proposed MVDE-based system on both synthetic and real-world transportation networks.

137 citations

Journal ArticleDOI
TL;DR: Some scalar optimization problems are presented whose optimal solutions are also solutions of a general vector optimization problem, and the results will be applied to a certain class of approximation problems.
Abstract: In this paper some scalar optimization problems are presented whose optimal solutions are also solutions of a general vector optimization problem. This will be done for weakly minimal and minimal solutions, respectively. Finally the results will be applied to a certain class of approximation problems.

137 citations

Journal ArticleDOI
TL;DR: In this paper, a fuzzy discrete multicriteria cost optimization model for design of space steel structures subjected to the actual constraints of commonly-used design codes such as the AISC ASD code is presented.
Abstract: Only a small fraction of the hundreds of papers published on optimization of steel structures deal with cost optimization; the great majority deal only with minimization of the weight of the structure. Those few that are concerned with cost optimization deal with small two-dimensional or academic examples. In this article, the writers present a fuzzy discrete multicriteria cost optimization model for design of space steel structures subjected to the actual constraints of commonly-used design codes such as the AISC ASD code by considering three design criteria: (1) minimum material cost; (2) minimum weight; and (3) minimum number of different section types. The computational model starts with a continuous-variable minimum weight solution with a preemptive constraint violation strategy as the lower bound followed by a fuzzy discrete multicriteria optimization. It is concluded that solving the structural design problem as a cost optimization problem can result in substantial cost savings compared with the tr...

137 citations


Network Information
Related Topics (5)
Optimization problem
96.4K papers, 2.1M citations
90% related
Optimal control
68K papers, 1.2M citations
84% related
Robustness (computer science)
94.7K papers, 1.6M citations
84% related
Scheduling (computing)
78.6K papers, 1.3M citations
83% related
Linear system
59.5K papers, 1.4M citations
82% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202313
202236
2021104
2020128
2019113
2018140