A problem reduction based approach to discrete optimization algorithm design

Computing ◽  
2010 ◽  
Vol 88 (1-2) ◽  
pp. 31-54 ◽  
Author(s):  
Yujun Zheng ◽  
Jinyun Xue

This paper discusses various optimization algorithm design techniques. So, optimization techniques which are discussed in this paper are greedy method, dynamic programming and branch and bound. Problem comes under optimization are used to find either maximum or minimum. All these techniques we have multiple inputs and some constraints and we have to find feasible solution using these inputs and constraints. In greedy method we follow some predefined method. Using that predefined method, we reach to the solution. On contrary to this in dynamic programming we take decision at every step and in the end we reach to the solution. In branch and bound we create state space tree and explore all possibilities of live node. Based on some constraint we start killing some alive nodes. Here, firstly I will discuss all the design techniques. Then types of problems that can be solved under each design techniques and their time complexities.


2015 ◽  
Vol 734 ◽  
pp. 220-223
Author(s):  
Fang Li ◽  
Li Fang Wang ◽  
Cheng Lin Liao

X-by-Wire system is a typical automotive network control system. The control of x-by-wire system depends on communication network (like CAN, TTCAN or FlexRay), it must meet not only the control performance, but also the real-time performance and reliability requirement. Network optimization in x-by-wire system is great significant for achieving these targets. In this paper, first task graph was designed for the x-by-wire system, and different control links were distinguished from the task graph. Then the network optimization algorithm was designed to implement message slot arrangement coordinated with task execution time in the control links, and the principle of the network optimization algorithm design is reducing the control link response time for the best effort. Through a typical car x-by-wire control system, we can see that the network optimization algorithm research has important guidance for the optimization of the system message transmission, and can improve the system's real-time performance.


2019 ◽  
Vol 23 (3) ◽  
pp. 411-423 ◽  
Author(s):  
Xingfeng Wang ◽  
Qing Zhang ◽  
Xianrong Qin ◽  
Yuantao Sun

Performance-based design optimization of steel frames, with element sections selected from standard sections, is a computationally intensive task. In this article, an efficient discrete optimization algorithm is proposed for performance-based design optimization of steel frames. The computational efficiency is improved by searching in a sensible manner, guided by the deformation information of structural elements. To include all standard sections in the design space, the cross-sectional area ( Area) and moment of inertia ( Ix) are selected as the design variables. Based on different relationships between Area and Ix, a twofold strategy is put forward, which includes a quick exploration and an elaborate exploitation. For comparison, a similar algorithm is also proposed, using Area as the only design variable. A fixed relationship between Area and other sectional properties is used. Two numerical examples are presented to minimize the structural weight while satisfying performance constraints. The results indicate that the proposed discrete algorithm can achieve lighter structural designs than the area-only algorithm. Furthermore, the convergence history proves that a high computational efficiency can be realized by using the proposed algorithm.


Sign in / Sign up

Export Citation Format

Share Document