TSP problem is a class of classical problems in the combinatorial optimization problem;it has important applications in gene sequencing, robot control and other areas, especially in the computer domain, applied more w...
详细信息
ISBN:
(纸本)9783038352679
TSP problem is a class of classical problems in the combinatorial optimization problem;it has important applications in gene sequencing, robot control and other areas, especially in the computer domain, applied more widely. This paper considers abstracting the problem of stitching and reduction for scraps of paper as a class of TSP problem, and use the optimized greedy algorithm, achieve automatic image stitching shredding by the use of computer graphics technology. Contents of this paper make a useful attempt to study the automatic stitching algorithm for scraps of paper.
Accurately estimating the distributed indoor thermal environmental parameters with limited sensors is crucial for indoor environmental quality and building energy efficiency. This study combines proper orthogonal deco...
详细信息
ISBN:
(纸本)9798350366907;9789887581581
Accurately estimating the distributed indoor thermal environmental parameters with limited sensors is crucial for indoor environmental quality and building energy efficiency. This study combines proper orthogonal decomposition and greedy algorithm for sensors layout's optimization in a large-space thermal environment. Firstly, choose the initial quantity and positions of sensors, and collect steady temperature field information based on the feasible range of environmental variables;Secondly, extract features from the collected dataset using proper orthogonal decomposition, and determine the optimal number of sensors based on the energy proportion of the ***;Thirdly, select the sensor positions iteratively based on the correlations of eigenvectors and sensors using greedy algorithm. A field experiment for performance validation is conducted using a matrix of 72 temperature sensors in a large cafeteria. By using the collected 27 snapshot datasets, the temperature field can be reconstructed by Linear Stochastic Estimation using only six optimal sensors (steady-state error: 0.2433, RMSE). The proposed POD-greedy optimization strategy is also compared with another heuristic inference method. The better performance shows great potential for engineering practice and applications.
Vegetable product is an important commodity sold by fresh merchants, and its price is closely related to its product. Vegetables that are not sold one day are difficult to resell the next. Since merchants cannot predi...
详细信息
This paper aims to implement a cloud-based monitoring DC microgrid system suitable for communities by integrating a simulated utility grid system (SUGS), battery energy storage system (BESS), solar power generation sy...
详细信息
ISBN:
(纸本)9798350351163;9798350351156
This paper aims to implement a cloud-based monitoring DC microgrid system suitable for communities by integrating a simulated utility grid system (SUGS), battery energy storage system (BESS), solar power generation system (SPGS), and cloud-based front-end monitoring interface and technology. Additionally, the paper utilizes Long Short-Term Memory (LSTM) model to predict the next day's load curve and employs a solar simulator to simulate the daily variations in solar irradiance. Furthermore, to enhance economic benefits during peak and off-peak time-of-use (TOU) pricing periods, this paper adopts the concept of local selection using a greedy algorithm to optimize energy allocation between SUGS, BESS, and SPGS through cloud computing. Finally, a derating case study is conducted through simulations and experiments to verify the economic value and feasibility of the proposed greedy algorithm in a community-based DC microgrid.
Employing 1-bit quantization in massive multiple-input-multiple-output (MIMO) systems is a promising approach to improve the power efficiency. Various linear and nonlinear precoding techniques including the maximum sa...
详细信息
ISBN:
(纸本)9781728189642
Employing 1-bit quantization in massive multiple-input-multiple-output (MIMO) systems is a promising approach to improve the power efficiency. Various linear and nonlinear precoding techniques including the maximum safety margin (MSM) precoder have been presented to cope with severe 1-bit quantization distortions. In this paper, we show the reason for MSM precoder's success in reducing the quantization distortions and propose a low complexity extension with a greedy algorithm by exploiting this analytic result. Numerical results illustrate that the extended MSM is almost optimal in terms of maximizing the constructive interference (CI) between the received signals.
Scheduling in production systems consists in assigning operations on a set of available resources in order to achieve defined objectives. The Flexible Job shop Scheduling Problem (FJSP) is one of the scheduling proble...
详细信息
Scheduling in production systems consists in assigning operations on a set of available resources in order to achieve defined objectives. The Flexible Job shop Scheduling Problem (FJSP) is one of the scheduling problems and also an extension of classical Job shop Scheduling Problem (JSP) such that each operation can be processed on different machine and its processing time depends on the used machine. The FJSP is classified, as most of scheduling problems, NP-Hard in complexity theory and can be decomposed into two sub-problems: a routing sub-problem, which consists of assigning each operation to a machine out of a set of alternative machines, and a scheduling sub-problem, which consists of sequencing the assigned operations on all selected machines in order to attain a feasible schedule with optimized objectives. In this paper, we propose a decentralized model named Multi Agent model based on Chemical Reaction Optimization with greedy algorithm (MACROG FJSP) to solve the FJSP in order to minimize the maximum completion time (Makespan). Experiments are performed on well known benchmark instances proposed in the literature which are Fattahi, Kacem, Brandimarte and Hurink instances to evaluate the performance of our model. (C) 2017 The Authors. Published by Elsevier B.V.
Compared with group tour, DIY tour is characterized by flexible time arrangements and uncertain routes planning. This paper has mainly employed partial greedy algorithm based on time series in designing real-time rout...
详细信息
Compared with group tour, DIY tour is characterized by flexible time arrangements and uncertain routes planning. This paper has mainly employed partial greedy algorithm based on time series in designing real-time routes in DIY tours. As restaurant and accommodation are featured by time window constraint, thus the design is divided into several time partitions in line with 24-hour clock, and each partition has its tour behaviors including sighting, restaurant and accommodation. In each partition and its joint, the paper has availed partial optimal strategy of greedy algorithm so as to complete the overall routes design.
The developing tendency of new energy cars in China is discussed. Firstly, four influencing indicators, namely, economy, policy, technology and after-sales service, were selected, and 11 years of data were collected a...
详细信息
In the information age, with the continuous improvement of Internet technology, online information has gradually changed people's way of life and work. Therefore, after understanding the background of the spread o...
详细信息
In the paper some problems connected with a process of knowledge discovery are considered. These problems are reduced to the set cover problem. It is known that under a plausible assumption on the class N P the greedy...
详细信息
In the paper some problems connected with a process of knowledge discovery are considered. These problems are reduced to the set cover problem. It is known that under a plausible assumption on the class N P the greedy algorithm is close to best approximate polynomial algorithms for the set cover problem solving. Unfortunately, the performance ratio of this algorithm grows almost as natural logarithm on the cardinality of covered set. Instead of usual greedy algorithm we consider greedy algorithm with threshold. This algorithm constructs a partial cover, which covers at least a fixed part (for example, 90%) of the set. We prove that the cardinality of constructed partial cover is bounded from above by a linear function on the minimal cardinality of exact cover C min . In the case of 90% -cover, for example, in the capacity of such function we can take the function 2.31,·,C min +1. This bound is independent of the cardinality of covered set. Notice that the concept of partial cover in context of knowledge discovery problems is very close to the concept of approximate reduct.
暂无评论