Search results for: imperialist competitive algorithm

Authors: Nhat-To Huynh, Chen-Fu Chien

Abstract:

Textile batch dyeing scheduling problem is complicated which includes batch formation, batch assignment on machines, batch sequencing with sequence-dependent setup time. Most manufacturers schedule their orders manually that are time consuming and inefficient. More power methods are needed to improve the solution. Motivated by the real needs, this study aims to propose approaches in which genetic algorithm is developed with multi-subpopulation and hybridised with estimation of distribution algorithm to solve the constructed problem for minimising the makespan. A heuristic algorithm is designed and embedded into the proposed algorithms to improve the ability to get out of the local optima. In addition, an empirical study is conducted in a textile company in Taiwan to validate the proposed approaches. The results have showed that proposed approaches are more efficient than simulated annealing algorithm.

Keywords: estimation of distribution algorithm, genetic algorithm, multi-subpopulation, scheduling, textile dyeing

Procedia PDF Downloads 270

Authors: Keunhong Chae, Seokho Yoon

Abstract:

We propose a code acquisition scheme called improved multiple-shift (IMS) for optical code division multiple access systems, where the optical orthogonal code is used instead of the pseudo noise code. Although the IMS algorithm has a similar process to that of the conventional MS algorithm, it has a better code acquisition performance than the conventional MS algorithm. We analyze the code acquisition performance of the IMS algorithm and compare the code acquisition performances of the MS and the IMS algorithms in single-user and multi-user environments.

Keywords: code acquisition, optical CDMA, optical orthogonal code, serial algorithm

Procedia PDF Downloads 494

Authors: Tai Nguyen, Minh Bui, Huong Ninh, Tu Nguyen, Hai Tran

Abstract:

GraphCut algorithm has been widely utilized to solve various types of computer vision problems. Its expensive computational cost encouraged many researchers to improve the speed of the algorithm. Recent works proposed schemes that work on parallel computing platforms such as CUDA. However, the problem of low convergence speed prevents the usage of GraphCut for real time applications. In this paper, we propose global suppression heuristic to boost the conver-gence process of the algorithm. A parallel implementation of GraphCut algorithm on CUDA designed for the image stitching problem is introduced. Our method achieves up to 3× time boost on the graph of size 80 × 480 compared to the best sequential GraphCut algorithm while achieving satisfactory stitched images, suitable for panorama applications. Our source code will be soon available for further research.

Keywords: CUDA, graph cut, image stitching, texture synthesis, maxflow/mincut algorithm

Procedia PDF Downloads 87

Authors: Ayesha Khatun

Abstract:

In 21st century where markets are unstable, technologies rapidly proliferate, competitors multiply, products and services become obsolete almost overnight and customers demand low cost high value product, leveraging and harnessing knowledge is not just a potential source of competitive advantage rather a necessity in technology based and information intensive industries. Knowledge management focuses on leveraging the available knowledge and sharing the same among the individuals in the organization so that the employees can make best use of it towards achieving the organizational goals. Knowledge is not a discrete object. It is embedded in people and so difficult to transfer outside the immediate context that it becomes a major competitive advantage. However, internal transfer of knowledge among the employees is essential to maximize the use of knowledge available in the organization in an unstructured manner. But as knowledge is the source of competitive advantage for the organization it is also the source of competitive advantage for the individuals. People think that knowledge is power and sharing the same may lead to lose the competitive position. Moreover, the very nature of tacit knowledge poses many difficulties in sharing the same. But sharing tacit knowledge is the vital part of knowledge management process because it is the tacit knowledge which is inimitable. Knowledge management has been made synonymous with the use of software and technology leading to the management of explicit knowledge only ignoring personal interaction and forming of informal networks which are considered as the most successful means of sharing tacit knowledge. Factors responsible for effective sharing of tacit knowledge are grouped into –individual, organizational and technological factors. Different factors under each category have been identified. Creating a positive organizational culture, encouraging personal interaction, practicing reward system are some of the strategies that can help to overcome many of the barriers to effective sharing of tacit knowledge. Methodology applied here is completely secondary. Extensive review of relevant literature has been undertaken for the purpose.

Keywords: knowledge, tacit knowledge, knowledge management, sustainable competitive advantage, organization, knowledge sharing

Procedia PDF Downloads 368

Authors: M. Fernanda Salgado, Alfonso Tierra, Wilbert Aguilar

Abstract:

The present project consists in applying the informed search algorithm A star (A*) to solve traveler problems, applying it by urban public transportation routes. The digitization of the information allowed to identify 26% of the total of routes that are registered within the Metropolitan District of Quito. For the validation of this information, data were taken in field on the travel times and the difference with respect to the times estimated by the program, resulting in that the difference between them was not greater than 2:20 minutes. We validate A* algorithm with the Dijkstra algorithm, comparing nodes vectors based on the public transport stops, the validation was established through the student t-test hypothesis. Then we verified that the times estimated by the program using the A* algorithm are similar to those registered on field. Furthermore, we review the performance of the algorithm generating iterations in both algorithms. Finally, with these iterations, a hypothesis test was carried out again with student t-test where it was concluded that the iterations of the base algorithm Dijsktra are greater than those generated by the algorithm A*.

Keywords: algorithm A*, graph, mobility, public transport, travel planning, routes

Procedia PDF Downloads 207

Authors: E. Behmanesh, J. Pannek

Abstract:

The distribution-allocation problem is known as one of the most comprehensive strategic decision. In real-world cases, it is impossible to solve a distribution-allocation problem in traditional ways with acceptable time. Hence researchers develop efficient non-traditional techniques for the large-term operation of the whole supply chain. These techniques provide near-optimal solutions particularly for large scales test problems. This paper, presents an integrated supply chain model which is flexible in the delivery path. As the solution methodology, we apply a memetic algorithm with a novelty in population presentation. To illustrate the performance of the proposed memetic algorithm, LINGO optimization software serves as a comparison basis for small size problems. In large size cases that we are dealing with in the real world, the Genetic algorithm as the second metaheuristic algorithm is considered to compare the results and show the efficiency of the memetic algorithm.

Keywords: integrated logistics network, flexible path, memetic algorithm, genetic algorithm

Procedia PDF Downloads 338

Authors: Daliyah S. Aljutaili, Redna A. Almutlaq, Suha A. Alharbi, Dina M. Ibrahim

Abstract:

All currencies around the world look very different from each other. For instance, the size, color, and pattern of the paper are different. With the development of modern banking services, automatic methods for paper currency recognition become important in many applications like vending machines. One of the currency recognition architecture’s phases is Feature detection and description. There are many algorithms that are used for this phase, but they still have some disadvantages. This paper proposes a feature detection algorithm, which merges the advantages given in the current SIFT and SURF algorithms, which we call, Speeded up Robust Scale-Invariant Feature Transform (SR-SIFT) algorithm. Our proposed SR-SIFT algorithm overcomes the problems of both the SIFT and SURF algorithms. The proposed algorithm aims to speed up the SIFT feature detection algorithm and keep it robust. Simulation results demonstrate that the proposed SR-SIFT algorithm decreases the average response time, especially in small and minimum number of best key points, increases the distribution of the number of best key points on the surface of the currency. Furthermore, the proposed algorithm increases the accuracy of the true best point distribution inside the currency edge than the other two algorithms.

Keywords: currency recognition, feature detection and description, SIFT algorithm, SURF algorithm, speeded up and robust features

Procedia PDF Downloads 205

Authors: P. Shrivastava, A. Shukla, K. Verma, S. Rungta

Abstract:

Parkinson's disease is a chronic neurological disorder that directly affects human gait. It leads to slowness of movement, causes muscle rigidity and tremors. Gait serve as a primary outcome measure for studies aiming at early recognition of disease. Using gait techniques, this paper implements efficient binary bat algorithm for an early detection of Parkinson's disease by selecting optimal features required for classification of affected patients from others. The data of 166 people, both fit and affected is collected and optimal feature selection is done using PSO and Bat algorithm. The reduced dataset is then classified using neural network. The experiments indicate that binary bat algorithm outperforms traditional PSO and genetic algorithm and gives a fairly good recognition rate even with the reduced dataset.

Keywords: parkinson, gait, feature selection, bat algorithm

Procedia PDF Downloads 509

Authors: Sipho Mbatha, Anne Mastament-Mason

Abstract:

The Multi-Fibre Arrangement (MFA) which regulated all trade in the Apparel Manufacturing Industries (AMI) for four decades was dissolved in 2005. Since 2005, the Apparel Manufacturing Industry of South Africa (AMISA) has been battling to adjust to an environment of liberalised trade, mainly due to strategic, infrastructural and skills factors. In developing competitive advantage strategy for the AMISA, the study aimed to do the following (1) to apply Porter’s diamond model’s determinant “Factor Condition” as framework to develop competitive advantage strategies. (2) Examine the effectiveness of government policy Industrial Policy Action Plan (IPAP 2007) in supporting AMISA. (3) Examine chance events that could be used as bases for competitive advantage strategies for the AMISA. This study found that the lack of advanced skills and poor infrastructure are affecting the competitive advantage of AMISA. The then Clothing, Textiles, Leather and Footwear Sector Education and Training Authority (CTLF-SETA) has also fallen short of addressing the skills gap within the apparel manufacturing industries. The only time that AMISA have shown signs of competitive advantage was when they made use of government grants and incentives available to only compliant AMISA. The findings have shown that the apparel retail groups have shown support for the AMISA by shouldering raw material costs, making it easier to manufacture the required apparel at acceptable lead times. AMISA can compete in low end apparel, provided quick response is intensified, the development of local textiles and raw materials is expedited.

Keywords: compliance rule, apparel manufacturing idustry, factor conditions, advance skills, industrial policy action plan of South Africa

Procedia PDF Downloads 566

Authors: Najmeh Mohsenifar, Narjes Mohsenifar, Abbas Kargar

Abstract:

In this paper, has been presented a stable method for predicting the ECG signals through the RBF neural networks, by the PSO algorithm. In spite of quasi-periodic ECG signal from a healthy person, there are distortions in electro cardiographic data for a patient. Therefore, there is no precise mathematical model for prediction. Here, we have exploited neural networks that are capable of complicated nonlinear mapping. Although the architecture and spread of RBF networks are usually selected through trial and error, the PSO algorithm has been used for choosing the best neural network. In this way, 2 second of a recorded ECG signal is employed to predict duration of 20 second in advance. Our simulations show that PSO algorithm can find the RBF neural network with minimum MSE and the accuracy of the predicted ECG signal is 97 %.

Keywords: electrocardiogram, RBF artificial neural network, PSO algorithm, predict, accuracy

Procedia PDF Downloads 586

Authors: Xiuqin Ma, Hongwu Qin

Abstract:

A new efficient normal parameter reduction algorithm of soft set in decision making was proposed. However, up to the present, few documents have focused on real-life applications of this algorithm. Accordingly, we apply a New Efficient Normal Parameter Reduction algorithm into real-life datasets of online shopping, such as Blackberry Mobile Phone Dataset. Experimental results show that this algorithm is not only suitable but feasible for dealing with the online shopping.

Keywords: soft sets, parameter reduction, normal parameter reduction, online shopping

Procedia PDF Downloads 482

Authors: Elham Kazemi

Abstract:

Quadratic Assignment Problem (QAP) is one the combinatorial optimization problems about which research has been done in many companies for allocating some facilities to some locations. The issue of particular importance in this process is the costs of this allocation and the attempt in this problem is to minimize this group of costs. Since the QAP’s are from NP-hard problem, they cannot be solved by exact solution methods. Cuckoo Optimization Algorithm is a Meta-heuristicmethod which has higher capability to find the global optimal points. It is an algorithm which is basically raised to search a continuous space. The Quadratic Assignment Problem is the issue which can be solved in the discrete space, thus the standard arithmetic operators of Cuckoo Optimization Algorithm need to be redefined on the discrete space in order to apply the Cuckoo Optimization Algorithm on the discrete searching space. This paper represents the way of discretizing the Cuckoo optimization algorithm for solving the quadratic assignment problem.

Keywords: Quadratic Assignment Problem (QAP), Discrete Cuckoo Optimization Algorithm (DCOA), meta-heuristic algorithms, optimization algorithms

Procedia PDF Downloads 478

Authors: Emanuele Peggi

Abstract:

The regulation of competitive takeover bids is one of the most problematic issues of any legislation on takeovers since it concerns a particular type of market, that of corporate control, whose peculiar characteristic is that companies represent "assets" unique of their kind, for each of which there will be a relevant market characterized by the presence of different subjects interested in acquiring control. Firstly, this work aims to analyze, from a comparative point of view, the regulation of takeover bids in competitive scenarios, characterized by the presence of multiple takeover bids for the same target company, and contribute to the debate on the impact that various solutions adopted in some legal systems examined (Italy, UK, and USA) have had on the efficiency of the market for corporate control. Secondly, the different auction models identified by the economic literature and their possible applications to corporate acquisitions in competitive scenarios will be examined, as well as the consequences that the application of each of them causes on the efficiency of the market for corporate control and the interests of the target shareholders. The scope is to study the possibility of attributing to the management of the target company the power to design the auction in order to better protect the interests of shareholders through the adoption of ad hoc models according to the specific context. and in particular on the ground of their assessment of the buyer's risk profile.

Keywords: takeovers, auction theory, shareholders, target company

Procedia PDF Downloads 143

Authors: Aminur Rahman

Abstract:

The Unique feature of BROTHERS Furniture sofa stands in ergonomic Design, skilled hand work and art work. Present world market is passing through a contentious competitive situation that is rapidly and dramatic. Competitive strategy concerns how to create competitive advantage in upholstery businesses. In order to competitive advantage in upholstery sofa market, Design and develop a sofa that have to ergonomic features. Design an ergonomic upholstery sofa knowing and understanding the appropriate seat depth, seat height, angle between Seat & back, back height which is concurrent market demand, world class sofa has to incorporate ergonomic factors. The study the relationships between human, seat and context variables comfort and discomfort. We must have conduct market survey among users whose are need and use sofa. Health & safety factors should be examined from a variety of angle. An attractive design and meet customer requirements, ergonomically fit should be considered for sofa development. This paper will explain how to design & develop sofa’s as per standard specifications which have ergonomic features for users all over the world.

Keywords: ergonomics, angle between seat & back, standard dimension, seat comfort

Procedia PDF Downloads 104

Authors: Chaghoub Soraya, Zhang Xiaoyan

Abstract:

This research presents the first constant approximation algorithm to the p-median network design problem with multiple cable types. This problem was addressed with a single cable type and there is a bifactor approximation algorithm for the problem. To the best of our knowledge, the algorithm proposed in this paper is the first constant approximation algorithm for the p-median network design with multiple cable types. The addressed problem is a combination of two well studied problems which are p-median problem and network design problem. The introduced algorithm is a random sampling approximation algorithm of constant factor which is conceived by using some random sampling techniques form the literature. It is based on a redistribution Lemma from the literature and a steiner tree problem as a subproblem. This algorithm is simple, and it relies on the notions of random sampling and probability. The proposed approach gives an approximation solution with one constant ratio without violating any of the constraints, in contrast to the one proposed in the literature. This paper provides a (21 + 2)-approximation algorithm for the p-median network design problem with multiple cable types using random sampling techniques.

Keywords: approximation algorithms, buy-at-bulk, combinatorial optimization, network design, p-median

Procedia PDF Downloads 162

Authors: Mei-Fang Wu, Shu-Li Wang, Feng-Tsung Cheng

Abstract:

Highly developed technology and highly competitive global market highlight the important role of competitive advantages and operation performances in sustainable company operation. Activity-Based Costing (ABC) provides accurate operation cost and operation performance information. Rich literature provide relevant research with cases study on Activity-Based Costing application, and yet, there is no research studying on cause relationship between key success factors of applying Activity-Based Costing and its specific outcomes, such as profitability or share market. These relationships provide the ways to handle the key success factors to achieve the specific outcomes for ensuring to promote the competitive advantages and operation performances. The main purposes of this research are exploring the key success paths by Key Success Paths approach which will lead the ways to apply Activity-Base Costing. The Key Success Paths is the innovative method which is exploring the cause relationships and explaining what are the effects of key success factors to specific outcomes of Activity-Based Costing implementation. The cause relationships between key success factors and successful specific outcomes are Key Success Paths (KSPs). KSPs are the guidelines to lead the cost management strategies to achieve the goals of competitive advantages and operation performances. The research findings indicate that good management system design may impact the good outcomes of Activity-Based Costing application and achieve to outstanding competitive advantage, operating performance and profitability as well by KSPs exploration.

Keywords: activity-based costing, key success factors, key success paths approach, key success paths, key failure paths

Procedia PDF Downloads 358

Authors: Mncedisi Trinity Dewa, Andre Francois Van Der Merwe, Stephen Matope

Abstract:

Tool, Die and Mould-making (TDM) firms have been known to play a pivotal role in the growth and development of the manufacturing sectors in most economies. Their output contributes significantly to the quality, cost and delivery speed of final manufactured parts. Unfortunately, the South African Tool, Die and Mould-making manufacturers have not been competing on the local or global market in a significant way. This reality has hampered the productivity and growth of the sector thus attracting intervention. The paper explores the shortcomings South African toolmakers have to overcome to restore their competitive position globally. Results from a global benchmarking survey on the tooling sector are used to establish a roadmap of what South African toolmakers can do to become a productive, World Class force on the global market.

Keywords: competitive performance objectives, toolmakers, world-class manufacturing, lead times

Procedia PDF Downloads 483

Authors: J. Yang, Y. Ma, X. Zhang, S. Li, Y. Zhang

Abstract:

The traditional k-means algorithm has been widely used as a simple and efficient clustering method. However, the algorithm often converges to local minima for the reason that it is sensitive to the initial cluster centers. In this paper, an algorithm for selecting initial cluster centers on the basis of minimum spanning tree (MST) is presented. The set of vertices in MST with same degree are regarded as a whole which is used to find the skeleton data points. Furthermore, a distance measure between the skeleton data points with consideration of degree and Euclidean distance is presented. Finally, MST-based initialization method for the k-means algorithm is presented, and the corresponding time complexity is analyzed as well. The presented algorithm is tested on five data sets from the UCI Machine Learning Repository. The experimental results illustrate the effectiveness of the presented algorithm compared to three existing initialization methods.

Keywords: degree, initial cluster center, k-means, minimum spanning tree

Procedia PDF Downloads 375

Authors: Archana Singh, Jyoti Agarwal, Ajay Rana

Abstract:

Data Mining is an efficient technology to discover patterns in large databases. Association Rule Mining techniques are used to find the correlation between the various item sets in a database, and this co-relation between various item sets are used in decision making and pattern analysis. In recent years, the problem of finding association rules from large datasets has been proposed by many researchers. Various research papers on association rule mining (ARM) are studied and analyzed first to understand the existing algorithms. Apriori algorithm is the basic ARM algorithm, but it requires so many database scans. In DIC algorithm, less amount of database scan is needed but complex data structure lattice is used. The main focus of this paper is to propose a new optimized algorithm (Friendly Algorithm) and compare its performance with the existing algorithms A data set is used to find out frequent itemsets and association rules with the help of existing and proposed (Friendly Algorithm) and it has been observed that the proposed algorithm also finds all the frequent itemsets and essential association rules from databases as compared to existing algorithms in less amount of database scan. In the proposed algorithm, an optimized data structure is used i.e. Graph and Adjacency Matrix.

Keywords: association rules, data mining, dynamic item set counting, FP-growth, friendly algorithm, graph

Procedia PDF Downloads 385

Authors: Ji Eun Shin, Dong Hoon Lim

Abstract:

Data clustering is a common technique used in data analysis and is used in many applications, such as artificial intelligence, pattern recognition, economics, ecology, psychiatry and marketing. K-means clustering is a well-known clustering algorithm aiming to cluster a set of data points to a predefined number of clusters. In this paper, we implement K-means algorithm based on MapReduce framework with RHadoop to make the clustering method applicable to large scale data. RHadoop is a collection of R packages that allow users to manage and analyze data with Hadoop. The main idea is to introduce a combiner as a function of our map output to decrease the amount of data needed to be processed by reducers. The experimental results demonstrated that K-means algorithm using RHadoop can scale well and efficiently process large data sets on commodity hardware. We also showed that our K-means algorithm using RHadoop with combiner was faster than regular algorithm without combiner as the size of data set increases.

Keywords: big data, combiner, K-means clustering, RHadoop

Procedia PDF Downloads 393

Authors: G. Erkomaishvili

Abstract:

The paper discusses economic policy of Georgia aiming to increase national competitiveness as well as the tools and means which will help to improve the competitiveness of the country. The sectors of the economy, in which the country can achieve the competitive advantage, are studied. It is noted that the country’s economic policy plays an important role in obtaining and maintaining the competitive advantage - authority should take measures to ensure high level of education; scientific and research activities should be funded by the state; foreign direct investments should be attracted mainly in science-intensive industries; adaptation with the latest scientific achievements of the modern world and deepening of scientific and technical cooperation. Stable business environment and export oriented strategy is the basis for the country’s economic growth. As the outcome of the research, the paper suggests the strategy for improving competitiveness in Georgia; recommendations are provided based on relevant conclusions.

Keywords: competitive advantage, competitiveness, competitiveness improvement strategy, competitiveness of Georgia

Procedia PDF Downloads 382

Authors: J. Kaabi, Y. Harrath

Abstract:

This paper studied the flow shop scheduling problem under machine availability constraints. The machines are subject to flexible preventive maintenance activities. The nonresumable scenario for the jobs was considered. That is, when a job is interrupted by an unavailability period of a machine it should be restarted from the beginning. The objective is to minimize the total tardiness time for the jobs and the advance/tardiness for the maintenance activities. To solve the problem, a genetic algorithm was developed and successfully tested and validated on many problem instances. The computational results showed that the new genetic algorithm outperforms another earlier proposed algorithm.

Keywords: flow shop scheduling, genetic algorithm, maintenance, priority rules

Procedia PDF Downloads 440

Authors: Henry Kiptum Yatich, Ronald Chepkilot, Aquilars Mutuku Kalio

Abstract:

Studies on energy management have focused on environmental conservation, reduction in production and operation expenses. However, transferring gains of energy management practices to competitive advantage is importance to manufacturers in Kenya. Success in managing competitive advantage arises out of a firm’s ability in identifying and implementing actions that can give the company an edge over its rivals. Manufacturing firms in Kenya are the highest consumers of both electricity and petroleum products. In this regard, the study posits that transfer of the gains of energy management practices to competitive advantage is imperative. The study was carried in Nairobi and its environs, which hosts the largest number of manufacturers. The study objectives were; to determine the level of implementing energy management regulations on sustaining competitive advantage, to determine the level of implementing company energy management policy on competitive advantage, to examine the level of implementing energy efficient technology on sustaining competitive advantage, and to assess the percentage energy expenditure on sustaining competitive advantage among manufacturing firms. The study adopted a survey research design, with a study population of 145,987. A sample of 384 respondents was selected randomly from 21 proportionately selected firms. Structured questionnaires were used to collect data. Data analysis was done using descriptive statistics (mean and standard deviations) and inferential statistics (correlation, regression, and T-test). Data is presented using tables and diagrams. The study found that Energy Management Regulations, Company Energy Management Policies, and Energy Expenses are significant predictors of Competitive Advantage (CA). However, Energy Efficient Technology as a component of Energy Management Practices did not have a significant relationship with Competitive Advantage. The study revealed that the level of awareness in the sector stood at 49.3%. Energy Expenses in the sector stood at an average of 10.53% of the firm’s total revenue. The study showed that gains from energy efficiency practices can be transferred to competitive strategies so as to improve firm competitiveness. The study recommends that manufacturing firms should consider energy management practices as part of its strategic agenda in assessing and reviewing their energy management practices as possible strategies for sustaining competitiveness. The government agencies such as Energy Regulatory Commission, the Ministry of Energy and Petroleum, and Kenya Association of Manufacturers should enforce the energy management regulations 2012, and with enhanced stakeholder involvement and sensitization so as promote sustenance of firm competitiveness. Government support in providing incentives and rebates for acquisition of energy efficient technologies should be pursued. From the study limitation, future experimental and longitudinal studies need to be carried out. It should be noted that energy management practices yield enormous benefits to all stakeholders and that the practice should not be considered a competitive tool but rather as a universal practice.

Keywords: energy, efficiency, management, guidelines, policy, technology, competitive advantage

Procedia PDF Downloads 355

Authors: Omar Dib, Alexandre Caminada, Marie-Ange Manier

Abstract:

The purpose of this study is to introduce a novel approach to solve the one-to-one shortest path problem. A directed connected graph is assumed in which all edges’ weights are positive. Our method is based on a memetic algorithm in which we combine a genetic algorithm (GA) and a variable neighborhood search method (VNS). We compare our approximate method with two exact algorithms Dijkstra and Integer Programming (IP). We made experimentations using random generated, complete and real graph instances. In most case studies, numerical results show that our method outperforms exact methods with 5% average gap to the optimality. Our algorithm’s average speed is 20-times faster than Dijkstra and more than 1000-times compared to IP. The details of the experimental results are also discussed and presented in the paper.

Keywords: shortest path problem, Dijkstra’s algorithm, integer programming, memetic algorithm

Procedia PDF Downloads 434

Authors: Gulnaz Erkomaishvili, Eteri Kharaishvili, Marina Chavleishvili

Abstract:

The paper discusses the economic policy of increasing national competitiveness, the tools, and means which help the country to improve its competitiveness. The sectors of the economy, in which the country can achieve a competitive advantage, are studied. It is noted that the country’s economic policy plays an important role in obtaining and maintaining a competitive advantage - authority should take measures to ensure a high level of education; scientific and research activities should be funded by the state; foreign direct investments should be attracted mainly in science-intensive industries; adaptation with the latest scientific achievements of the modern world and deepening of scientific and technical cooperation. Stable business environment and export-oriented strategy is the basis for the country’s economic growth. The studies have shown that institutional reforms in Georgia are not enough to significantly improve the country's competitiveness.

Keywords: competitiveness, economic policy, competitiveness improvement strategy, competitiveness of Georgia

Procedia PDF Downloads 101

Authors: Arman S. Kussainov, Altynbek K. Beisekov

Abstract:

This work focuses on building an efficient universal procedure to construct a single density of states from the multiple pieces of data provided by the parallel implementation of the Wang Landau Monte Carlo based algorithm. The Ising and Pott models were used as the examples of the two-dimensional spin lattices to construct their densities of states. Sampled energy space was distributed between the individual walkers with certain overlaps. This was made to include the latest development of the algorithm as the density of states replica exchange technique. Several factors of immediate importance for the seamless stitching process have being considered. These include but not limited to the speed and universality of the initial parallel algorithm implementation as well as the data post-processing to produce the expected smooth density of states.

Keywords: density of states, Monte Carlo, parallel algorithm, Wang Landau algorithm

Procedia PDF Downloads 365

Authors: Tayfun Çay, Yasar İnceyol, Abdurrahman Özbeyaz

Abstract:

Land reallocation is one of the most important steps in land consolidation projects. Many different models were proposed for land reallocation in the literature such as Fuzzy Logic, block priority based land reallocation and Spatial Decision Support Systems. A model including four parts is considered for automatic block reallocation with genetic algorithm method in land consolidation projects. These stages are preparing data tables for a project land, determining conditions and constraints of land reallocation, designing command steps and logical flow chart of reallocation algorithm and finally writing program codes of Genetic Algorithm respectively. In this study, we designed the first three steps of the considered model comprising four steps.

Keywords: land consolidation, landholding, land reallocation, optimization, genetic algorithm

Procedia PDF Downloads 389

Authors: Dimitri Golenko-Ginzburg

Abstract:

A CPM network project with deterministic activity durations, in which activities require homogenous resources with fixed capacities, is considered. The problem is to determine the optimal schedule of starting times for all network activities within their maximal allowable limits (in order not to exceed the network's critical time) to minimize the maximum required resources for the project at any point in time. In case when a non-critical activity may start only at discrete moments with the pregiven time span, the problem becomes NP-complete and an optimal solution may be obtained via a look-over algorithm. For the case when a look-over requires much computational time an approximate algorithm is suggested. The algorithm's performance ratio, i.e., the relative accuracy error, is determined. Experimentation has been undertaken to verify the suggested algorithm.

Keywords: resource smoothing problem, CPM network, lookover algorithm, lexicographical order, approximate algorithm, accuracy estimate

Procedia PDF Downloads 269

Authors: P. Valsalal, S. Thangalakshmi

Abstract:

There is a widespread changeover in the electrical power industry universally from old-style monopolistic outline towards a horizontally distributed competitive structure to come across the demand of rising consumption. When the transmission lines of derestricted system are incapable to oblige the entire service needs, the lines are overloaded or congested. The governor between customer and power producer is nominated as Independent System Operator (ISO) to lessen the congestion without obstructing transmission line restrictions. Among the existing approaches for congestion management, the frequently used approaches are reorganizing the generation and load curbing. There is a boundary for reorganizing the generators, and further loads may not be supplemented with the prevailing resources unless more private power producers are added in the system by considerably raising the cost. Hence, congestion is relaxed by appropriate Flexible AC Transmission Systems (FACTS) devices which boost the existing transfer capacity of transmission lines. The FACTs device, namely, Unified Power Flow Controller (UPFC) is preferred, and the correct placement of UPFC is more vital and should be positioned in the highly congested line. Hence, the weak line is identified by using power flow performance index with the new objective function with proposed hybrid Fish – Bee algorithm. Further, the location of UPFC at appropriate line reduces the branch loading and minimizes the voltage deviation. The power transfer capacity of lines is determined with and without UPFC in the identified congested line of IEEE 30 bus structure and the simulated results are compared with prevailing algorithms. It is observed that the transfer capacity of existing line is increased with the presented algorithm and thus alleviating the congestion.

Keywords: available line transfer capability, congestion management, FACTS device, Hybrid Fish-Bee Algorithm, ISO, UPFC

Procedia PDF Downloads 351

Authors: Sagir Abubakar

Abstract:

The electronic means of transaction has provided an opportunity especially for commercial banks to entice more customers that will subsequently boost their return on investment. It moves them from traditional marketing into digital marketing and gives them a competitive advantage over others in the same industry.The paper, therefore, examined the competitive advantage of the electronic marketing strategy among commercial banks branches in Bauchi state. The main objective of the study was to determine the impact of e-marketing strategy as a competitive advantage among commercial banks branches in Bauchi state and to evaluate the level of enlightenment campaign offered by the commercial banks branches to their customers on e-marketing. The study obtained data from the staff of the five (s) selected banks branches as the respondents to answer the questionnaire. The research is a quantitative research, where the data where obtained using questionnaire. 100 questionnaires were distributed and analyzed using SPSS’s regression analysis. The research among other findings discovered that, the e-marketing has led to a significant improvement in the banking industry and is expected to continue because of the improvement in the ICT sector. It was also found out that most customers are not aware of the electronic products offered by commercial banks branches in Bauchi state. Some of factors affecting the adoption of e-marketing by banks as indicated from the findings include: top management commitment, government policy on ICT and availability of ICT personnel. The study recommended that commercial banks branches should engage in enlightenment campaign about the existing of their e- products/services, management should place an incentives in order to raise the interest of customers to patronize the products/services online.

Keywords: e-marketing strategy, competitive advantage, banks, Bauchi State

Procedia PDF Downloads 287