Combinational Optimization Power (COP) - A Practical Power Budgeting Method for Many-cores

2021 ◽  
Author(s):  
Xin Li ◽  
Zhi Li ◽  
Yaqi Ju ◽  
Huajie Lin ◽  
Wei Zhou
Keyword(s):  
Combinational Optimization

scholarly journals A Variable Neighborhood MOEA/D for Multiobjective Test Task Scheduling Problem

2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Hui Lu ◽  
Zheng Zhu ◽  
Xiaoteng Wang ◽  
Lijuan Yin
Keyword(s):  
Task Scheduling ◽  
Search Space ◽  
Global Optimum ◽  
Scheduling Problem ◽  
Local Optima ◽  
Test Task ◽  
Combinational Optimization ◽  
The Mean ◽  
Nondominated Sorting ◽  
Better Than

Test task scheduling problem (TTSP) is a typical combinational optimization scheduling problem. This paper proposes a variable neighborhood MOEA/D (VNM) to solve the multiobjective TTSP. Two minimization objectives, the maximal completion time (makespan) and the mean workload, are considered together. In order to make solutions obtained more close to the real Pareto Front, variable neighborhood strategy is adopted. Variable neighborhood approach is proposed to render the crossover span reasonable. Additionally, because the search space of the TTSP is so large that many duplicate solutions and local optima will exist, the Starting Mutation is applied to prevent solutions from becoming trapped in local optima. It is proved that the solutions got by VNM can converge to the global optimum by using Markov Chain and Transition Matrix, respectively. The experiments of comparisons of VNM, MOEA/D, and CNSGA (chaotic nondominated sorting genetic algorithm) indicate that VNM performs better than the MOEA/D and the CNSGA in solving the TTSP. The results demonstrate that proposed algorithm VNM is an efficient approach to solve the multiobjective TTSP.

An Improved PBIL Algorithm for the Machine-Part Cell Formation

2010 ◽  
Vol 26-28 ◽  
pp. 498-501 ◽  
Author(s):  
Zhu Wang ◽  
Qing Bin Zhang ◽  
Yan Fang Ma ◽  
Jing Zhang ◽  
Yuan Liu
Keyword(s):  
Machine Part ◽  
Optimization Problem ◽  
Cell Formation ◽  
Past Research ◽  
Selection Strategy ◽  
Permutation Code ◽  
Combinational Optimization ◽  
Mutation Operators ◽  
Np Complete ◽  
Crossover And Mutation

The machine-part cell formation is a NP- complete combinational optimization problem. Past research has shown that although the genetic algorithm (GA) can get high quality solutions, special selection strategy, crossover and mutation operators as well as the parameters must be defined previously to solve the problem efficiently and flexibly. In this paper, an improved permutation code PBIL is adopted to solve the machine-part cell formation problem. Simulation results on five well known problems show that the PBIL can get satisfied solutions more simply and efficiently.

scholarly journals A Quasiphysical and Dynamic Adjustment Approach for Packing the Orthogonal Unequal Rectangles in a Circle with a Mass Balance: Satellite Payload Packing

2014 ◽  
Vol 2014 ◽  
pp. 1-16 ◽  
Author(s):  
Ziqiang Li ◽  
Xianfeng Wang ◽  
Jiyang Tan ◽  
Yishou Wang
Keyword(s):  
Potential Energy ◽  
Mass Balance ◽  
Energy Function ◽  
Numerical Experiments ◽  
Optimization Problem ◽  
Optimal Solution ◽  
Potential Energy Function ◽  
Resultant Force ◽  
Dynamic Adjustment ◽  
Combinational Optimization

Packing orthogonal unequal rectangles in a circle with a mass balance (BCOURP) is a typical combinational optimization problem with the NP-hard nature. This paper proposes an effective quasiphysical and dynamic adjustment approach (QPDAA). Two embedded degree functions between two orthogonal rectangles and between an orthogonal rectangle and the container are defined, respectively, and the extruded potential energy function and extruded resultant force formula are constructed based on them. By an elimination of the extruded resultant force, the dynamic rectangle adjustment, and an iteration of the translation, the potential energy and static imbalance of the system can be quickly decreased to minima. The continuity and monotony of two embedded degree functions are proved to ensure the compactness of the optimal solution. Numerical experiments show that the proposed QPDAA is superior to existing approaches in performance.

scholarly journals Μέθοδοι κατάτμησης έγχρωμης εικόνας με χρήση: ασαφούς λογικής, watershed ανάλυσης, θεωρίας γράφων και χώρου κλιμάκων

2002 ◽  
Author(s):  
Σωκράτης Μακρογιάννης
Keyword(s):  
Image Segmentation ◽  
Color Image ◽  
Scale Space ◽  
Color Image Segmentation ◽  
Combinational Optimization

Το αντικείμενο έρευνας αυτής της διατριβής είναι η κατάτμηση έγχρωμης εικόνας (color image segmentation). Γενικά αυτό το πεδίο είναι πολύ ευρύ και με ποικίλες εφαρμογές που καθορίζουν τον τρόπο προσέγγισης του προβλήματος. Το συγκεκριμένο πρόβλημα προσεγγίστηκε διατηρώντας τη γενικότητά του και δίνοντας έμφαση στις ακόλουθες έννοιες: 1. Επιλογή και χρησιμότητα των χρωματικών χώρων κατά περίπτωση. 2. Χρησιμότητα και εφαρμογή της θεωρίας ασαφούς λογικής στην αναπαράσταση της αβεβαιότητας καθώς και στη λήψη αποφάσεων. Η θεωρία ασαφούς λογικής αποτελεί μια αξιόπιστη λύση σε προβλήματα ανίχνευσης αντικειμένων και κατάτμησης και συνεισφέρει στην τυποποίηση του προβλήματος με βάση έννοιες της ανθρώπινης αντίληψης. 3. Εφαρμογή μεθόδων βασισμένων σε περιοχές με χρήση του αλγορίθμου Watershed για το σχηματισμό των αρχικών περιοχών. 4. Υιοθέτηση στατιστικών ποσοτήτων σε διαδικασίες όπως η ανίχνευση ακμών και οι μετρικές ομοιογένειας περιοχών. 5. Εφαρμογή της θεωρίας γράφων στην τυποποίηση του προβλήματος συνδυαστικής βελτιστοποίησης (combinational optimization) για το σχηματισμό των τελικών περιοχών της εικόνας. 6. Αναπαράσταση της πληροφορίας σε διαφορετικά επίπεδα ανάλυσης με βάση τη θεωρία χώρου κλιμάκων (scale space). Οι παραπάνω έννοιες συνδυάστηκαν ώστε να ξεπεραστούν ενδογενή προβλήματα που παρουσιάζονται σε μεθόδους βασισμένες σε περιοχές με κυριότερο αυτό της υπερκατάτμησης. Επιπλέον αναπτύχθηκαν τεχνικές κωδικοποίησης εικόνας βασισμένες σε περιοχές που αναδεικνύουν τη χρησιμότητα των παραπάνω μεθόδων, σε μια κατηγορία εφαρμογών.

scholarly journals New gradient methods for sensor selection problems

2019 ◽  
Vol 15 (3) ◽  
pp. 155014771983964
Author(s):  
De Zhang ◽  
Mingqiang Li ◽  
Feng Zhang ◽  
Maojun Fan
Keyword(s):  
Optimization Problem ◽  
Gradient Methods ◽  
Sensor Selection ◽  
Selection Problem ◽  
Projected Gradient Method ◽  
Step Size ◽  
Convex Optimization Problem ◽  
Selection Problems ◽  
Combinational Optimization ◽  
Relaxed Problem

In this article, we consider the sensor selection problem of choosing [Formula: see text] sensors from a set of [Formula: see text] possible sensor measurements. The sensor selection problem is a combinational optimization problem. Evaluating the performance for each possible combination is impractical unless [Formula: see text] and [Formula: see text] are small. We relax the original selection problem to be a convex optimization problem and describe a projected gradient method with Barzilai–Borwein step size to solve the proposed relaxed problem. Numerical results demonstrate that the proposed algorithm converges faster than some classical algorithms. The solution obtained by the proposed algorithm is closer to the truth.

Optimal Layout of Pipe Network of District Cooling System in Shanghai EXPO Park

2011 ◽  
Vol 250-253 ◽  
pp. 3064-3068
Author(s):  
Xiao Ping Feng ◽  
Hang Ming Wu ◽  
Wei Ding Long
Keyword(s):  
Decision Making ◽  
Optimization Problem ◽  
Cooling System ◽  
Optimal Layout ◽  
Pipe Network ◽  
Pipeline Network ◽  
Combinational Optimization ◽  
Annual Total ◽  
Operation Cost ◽  
Annual Total Cost

The layout of district cooling pipeline network is a typical combinational optimization problem. Taking the minimum annual total cost of pipeline network as the optimization target, this article applied the single parent genetic algorithm in optimum arrangement of aqueous cooling system pipe network of the First Energy Station in Shanghai Expo Park, which has given a scheme of arrangement with minimum tentative investment and operation cost to provide basis for scheme assessment and decision-making. The study shows that the application can provide not only many optimal arrangements for pipe network which has the same refrigeration station to make basis for scheme assessment and decision-making, but also the basis for choosing the best position of refrigeration station.

Combinational Optimization of Part Matching for a Part Recycling System

2000 ◽  
Vol 2000.3 (0) ◽  
pp. 589-590
Author(s):  
Chikako KAITE ◽  
Yasuhiro YAMADA ◽  
Yoshiaki KOMURA
Keyword(s):  
Recycling System ◽  
Combinational Optimization
Sign in / Sign up

Export Citation Format

Share Document