The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper studies ordering problem and logistics distribution of the distribution center in the supply chain. From the perspective of supply chain integration, considering inventory capacity constraints of distribution center and vehicle routing constraints, the optimization model of ordering and distribution are proposed firstly and the average total costs are minimized. In the process of logistics...
The amplitude phase shift keying (APSK) constellation with Gray labeling (Gray-APSK) is able to achieve considerable shaping gains in comparison with the quadrature amplitude modulation (QAM) counterpart under both iterative and non-iterative scenarios. Nevertheless, the Gray-APSK constellation with the fixed radius cannot provide the optimal performance for every code rate of practical usage. In...
In this paper, the BP neural network improved by the genetic algorithm (GA) is applied to the problem of human face detection. GA is used to optimize the initial weights of the BP neural network to make full use of its global optimization and local accurate searching of the BP algorithm. Matlab Software and its neural network toolbox are used to simulate and compute. The experiment results show that...
This paper proposes to apply the artificial neural network theory and the genetic algorithm to solve the difficulties of predicting composite mechanical properties. Niche technique based on crowding mechanism is used in genetic algorithm, and punishing function is adopted to adjust individual fitness, so as to promote global search capability. Taking the wheat straw-reinforced composite for instance,...
This paper describes a comprehensive method to construct fuzzy classification system considering both precision and interpretability. Fuzzy classification system, initialized by modified Gath-Geva fuzzy clustering algorithm, is transformed into neural network. After training the neural network, fuzzy sets similarity measure is adopt to merge redundant fuzzy sets to improve interpretability, and a...
The paper presents an approach to model the electrohydraulic system of a certain mine-sweeping weapon using the radial basis function (RBF) neural networks. In order to obtain accurate and simple RBF neural networks efficiently, a hierarchical genetic algorithm (HGA) is used to train the neural networks, in which the number of hidden units and the parameters of centers are optimized by the HGA simultaneously...
The classical portfolio problem is a problem of distributing capital to a set of securities. By generalizing the set of securities to a set of investment strategies (or security-rule pairs), this study proposes an investment strategy portfolio problem, which becomes a problem of distributing capital to a set of investment strategies. Since the investment strategy portfolio problem can be formulated...
This paper present a novel method based on multi-objective genetic algorithm to construct fuzzy classification system. First, in order to relieve the problem of "curse of dimensionality", a multi-objective genetic algorithm is used to accomplish feature selection and fuzzy partition with maximum classification performance and minimum number of features and minimum number of fuzzy rules,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.