Article
Competent genetic algorithms for weighing matrices
In this paper, we demonstrate that the search for weighing matrices constructed from two circulants can be viewed as a minimization problem together with two competent genetic algorithms to locate optima of an objective function. The motivation to deal with the messy genetic algorithm (mGA) is given from the pioneering results of Goldberg, regarding the ability of the mGA to put tight genes together in a solution which points directly to structural patterns in weighing matrices. In order to take into advantage certain properties of two ternary sequences with zero autocorrelation we use an adaptation of the fast messy GA (fmGA) where we combine mGA with advanced techniques, such as thresholding and tie-breaking. This transformation of the weighing matrices problem to an instance of a combinatorial optimization problem seems to be promising, since we resolved two open cases for weighing matrices as these are listed in the second edition of the Handbook of Combinatorial Designs.
In this paper, we consider the minimizing total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine. This problem is known to be open. Here, we give some properties of optimal schedules for the problem and its special cases.
Consideration was given to a graphic realization of the method of dynamic programming. Its concept was demonstrated by the examples of the partition and knapsack problems. The proposed method was compared with the existing algorithms to solve these problems.
In this article we describe a system allowing companies to organize an efficient inventory management with 40 suppliers of different products. The system consists of four modules, each of which can be improved: demand planning, inventory management, procurement planning and KPI reporting. Described system was implemented in a real company, specializing on perishable products totaling over 600 SKUs. The system helped the company to increase its turnover by 7% while keeping the same level of services.
In this paper the authors analyze the optimization of public service delivery in Russia. The role of the optimization of administrative processes in the modernization of public administration is also considered; major activities aimed at the optimization of the public services delivery in 2010-2011 are described; some background information for decision making process is revealed; major methods of improving quality and accessibility of public services are analyzed; the key methodological approaches for the reengineering of public services and spheres of government regulations are presented. Basing on the researches conducted, the authors propose the ways of making the activities aimed at the optimization of public services effi cient.
This volume presents new results in the study and optimization of information transmission models in telecommunication networks using different approaches, mainly based on theiries of queueing systems and queueing networks .
The paper provides a number of proposed draft operational guidelines for technology measurement and includes a number of tentative technology definitions to be used for statistical purposes, principles for identification and classification of potentially growing technology areas, suggestions on the survey strategies and indicators. These are the key components of an internationally harmonized framework for collecting and interpreting technology data that would need to be further developed through a broader consultation process. A summary of definitions of technology already available in OECD manuals and the stocktaking results are provided in the Annex section.