oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2020 ( 4 )

2019 ( 51 )

2018 ( 108 )

2017 ( 104 )

Custom range...

Search Results: 1 - 10 of 4527 matches for " heuristic approach "
All listed articles are free for downloading (OA Articles)
Page 1 /4527
Display every page Item
A Heuristic Approach for Assembly Scheduling and Transportation Problems with Parallel Machines  [PDF]
Peng-Sheng You, Yi-Chih Hsieh, Ta-Cheng Chen, Yung-Cheng Lee
iBusiness (IB) , 2013, DOI: 10.4236/ib.2013.51B006
Abstract: Many firms have to deal with the problems of scheduling and transportation allocation. The problems of assembly scheduling mainly focus on how to arrange orders in proper sequence on the assembly line with the purpose of minimizing the maximum completion time before they are flown to their destinations. Transportation allocation problems arise in how to assign processed orders to transport modes in order to minimize penalties such as earliness and tardiness. The two problems are usually separately discussed due to their complexity. This paper simultaneously deals with these two problems for firms with multiple identical parallel machines. We formulate this problem as a mixed integer programming model. The problem belongs to the class of NP-complete combinatorial optimization problems. This paper develops a hybrid genetic algorithm to obtain a compromised solution within a reasonable CPU time. We evaluate the performance of the presented heuristic with the well-known GAMS/CPLEX software. The presented approach is shown to perform well compared with well-known commercial software.
The Context of Knowledge and Data Discovery in Highly Dense Data Points Using Heuristic Approach  [PDF]
C. S. Sasireka, P. Raviraj
Journal of Signal and Information Processing (JSIP) , 2013, DOI: 10.4236/jsip.2013.41011
Abstract:

In data mining framework, for proficient data examination recent researchers utilized branch-and-bound methods such as seriation, clustering, and feature selection. Conventional cluster search was completed with diverse partitioning schemes to optimize the cluster pattern. Considering image data, partitioning approaches seems to be computationally complex due to large data size, and uncertainty of number of clusters. Recent work presented a new version of branch and bound model called model selection problem, handles the clustering issues more efficiently. The existing work deployed spatially coherent sampling for generating cluster parameter candidates. But if the problem-specific bounds and/or added heuristics in the data points of the domain area get surmounted, memory overheads, specific model selection, and uncertain data points cause various clustering abnormalities. To overcome the above mentioned issues, we plan to present an Optimal Model-Selection Clustering for image data point analysis in the context of knowledge and data discovery in highly dense data points with more uncertainty. In this work, we are going to analyze the model selection clustering which is first initiated through the process of heuristic training sequences on image data points and appropriates the problem-specific characteristics. Heuristic training sequences will generate and test a set of models to determine whether the model is matched with the characteristics of the problem or not. Through the process of heuristic training sequences, we efficiently perform the model selection criteria. An experimental evaluation is conducted on the proposed model selection clustering for image data point using heuristic approach (MSCHA) with real and synthetic data sets extracted from research repositories (UCI) and performance of the proposed MSCHA is measured in terms of Data point density, Model-Selection Criteria, Cluster validity.

Modified Ant Colony Algorithm for Grid Scheduling
Mr. P.Mathiyalagan,S.Suriya,Dr.S.N.Sivanandam
International Journal on Computer Science and Engineering , 2010,
Abstract: The grid computing system is a new, powerful and innovative system for a group of heterogeneous distributed computing systems. It requires grid scheduling to achieve high performance. The efficient scheduling of independent jobs in a heterogeneous computing environment is an important problem in domains such as grid computing. In general, finding optimal schedule for such an environment using the traditional sequential method is an NP-hard problem whereas heuristic approaches will provide near optimal solutions for complex problems. The Ant colony algorithm, which is one of the heuristic algorithms, suits well for the grid schedulingenvironment using stigmeric communication. The proposed Ant colony algorithm in this paper has a modified pheromone updating rule which solves the grid scheduling problem effectively than that of the existing Ant colony algorithm.
Graph Colouring and Clustering Heuristic Approach for Minimizing Examination Duration: A Case Study
Norwahida Syazwani Othman,Faizuniza Mashhod
IBIMA Business Review , 2012,
Abstract: Exam timetable is difficult to be done manually due to several factors such as dual academic calendar, larger student enrolments, constraints among invigilators and limitations of resources. At tertiary education, preparing exam timetable is very critical in order to ensure that all students are able to sit for the exam of every subject that they have registered without any clashing and only sit for one exam at one time. The lecturers who are also the invigilators as well need to be considered as one of the elements in the development of exam timetable as they are required to be in one venue at one time. Therefore, a good time table needs to ensure that the students and invigilators are able to commit their roles accordingly during the exam period. But the main problem is the duration of the exam which will be extended to fulfil all the requirements. This study presents a solution method intended for reducing exam duration in Centre for Foundation Studies and Extension Education (FOSEE), Multimedia University (MMU), Malaysia. The method of solution is using heuristic approaches that include graph colouring, clustering and sequential heuristic. The discussions were focused on constraints among invigilators and the approach is tested on real-world exam timetabling problems.
Extending Life Concepts to Complex Systems
Jean Le Fur
Interdisciplinary Description of Complex Systems , 2013,
Abstract: There is still no consensus definition of complex systems. This article explores, as a heuristic approach, the possibility of using notions associated with life as transversal concepts for defining complex systems. This approach is developed within a general classification of systems, with complex systems considered as a general ‘living things’ category and living organisms as a specialised class within this category. Concepts associated with life are first explored in the context of complex systems: birth, death and lifetime, adaptation, ontogeny and growth, reproduction. Thereafter, a refutation approach is used to test the proposed classification against a set of diverse systems, including a reference case, edge cases and immaterial complex systems. The summary of this analysis is then used to generate a definition of complex systems, based on the proposal, and within the background of cybernetics, complex adaptive systems and biology. Using notions such as ‘birth’ or ‘lifespan’ as transversal concepts may be of heuristic value for the generic characterization of complex systems, opening up new lines of research for improving their definition.
A NOVEL METHOD FOR FINDING PRIVACY PRESERVING ASSOCIATION RULE MINING
N V Muthu lakshmi,Dr. K Sandhya Rani
Indian Journal of Computer Science and Engineering , 2012,
Abstract: Association rule mining is one of the significant research areas which explore the association between various item sets. The issue of privacy arises when several legitimate people share their data or knowledge for their mutual benefits. In case of centralized database, sensitive item sets are hidden by using association rule hiding approaches.Based on the execution time, the degree of optimality, the level of tolerance of side effects and guaranteed to get solution different association rule hiding approaches are exist. Among the commonly used approaches, heuristic approach is widely used since it guarantees to provide solution but causes some side effects. In this paper a heuristic based methodology is proposed to hide the sensitive item sets efficiently by adopting two criterions. This methodology protects private information by doing sanitization process but before participating in the sanitization process, the method analysis the side effects and select the most promising one to change so that side effects can be fully avoided or accepting few side effects which will not harm the informational accuracy.
A heuristic for the inventory management of smart vending machine systems
Yang-Byung Park,Jun-Soo Yoo
Journal of Industrial Engineering and Management , 2012, DOI: 10.3926/jiem.587
Abstract: Purpose: The purpose of this paper is to propose a heuristic for the inventory management of smart vending machine systems with product substitution under the replenishment point, order-up-to level policy and to evaluate its performance. Design/methodology/approach: The heuristic is developed on the basis of the decoupled approach. An integer linear mathematical model is built to determine the number of product storage compartments and replenishment threshold for each smart vending machine in the system and the Clarke and Wright’s savings algorithm is applied to route vehicles for inventory replenishments of smart vending machines that share the same delivery days. Computational experiments are conducted on several small-size test problems to compare the proposed heuristic with the integrated optimization mathematical model with respect to system profit. Furthermore, a sensitivity analysis is carried out on a medium-size test problem to evaluate the effect of the customer service level on system profit using a computer simulation. Findings: The results show that the proposed heuristic yielded pretty good solutions with 5.7% error rate on average compared to the optimal solutions. The proposed heuristic took about 3 CPU minutes on average in the test problems being consisted of 10 five-product smart vending machines. It was confirmed that the system profit is significantly affected by the customer service level. Originality/value: The inventory management of smart vending machine systems is newly treated. Product substitutions are explicitly considered in the model. The proposed heuristic is effective as well as efficient. It can be easily modified for application to various retail vending settings under a vendor-managed inventory scheme with POS system.
Optimization of QoS Parameters in Cognitive Radio Using Combination of Two Crossover Methods in Genetic Algorithm  [PDF]
Abdelfatah Elarfaoui, Noureddine Elalami
Int'l J. of Communications, Network and System Sciences (IJCNS) , 2013, DOI: 10.4236/ijcns.2013.611050
Abstract:


Radio Cognitive (RC) is the new concept introduced to improve spectrum utilization in wireless communication and present important research field to resolve the spectrum scarcity problem. The powerful ability of CR to change and adapt its transmit parameters according to environmental sensed parameters, makes CR as the leading technology to manage spectrum allocation and respond to QoS provisioning. In this paper, we assume that the radio environment has been sensed and that the SU specifies QoS requirements of the wireless application. We use genetic algorithm (GA) and propose crossover method called Combined Single-Heuristic Crossover. The weighted sum multi-objective approach is used to combine performance objectives functions discussed in this paper and BER approximate formula is considered.


PENDEKATAN ACTIVITY-BASED COSTING DAN METODE PENCARIAN HEURISTIC UNTUK MENYELESAIKAN PROBLEM PEMILIHAN PERALATAN PADA FLEXIBLE MANUFACTURING SYSTEMS (FMS)
Gregorius Satia Budhi
Jurnal Informatika , 2002,
Abstract: The application of Activity Based Costing (ABC) approach to select the set-machine that is used in the production of Flexible Manufacture System (FMS) based on technical and economical criteria can be useful for producers to design FMS by considering the minimum production cost. In the other hand, Heuristic Search is known to have a short searching time. Algorithm Heuristic that using ABC approach as the weight in finding the solution to shorten the equipment selection time during the design / redesign process of the FMS in less than exponential time was designed in this research. The increasing speed is useful because with the faster time in design / redesign process, therefore the flexibility level of part variety that can be processed will become better. Theoretical and empirical analysis in Algorithm Heuristic shows that time searching to get appropriate set of equipment is not too long, so that we can assume that the designed Algorithm Heuristic can be implemented in the real world. By comparing the empirical result of Algorithm Heuristic to the Algorithm Exhaustive, we can also assume that Algorithm Heuristic that using ABC method as the weight for finding solution can optimise the equipment selection problem of FMS based on economical criteria too. Abstract in Bahasa Indonesia : Penggunaan pendekatan Activity Based Costing (ABC) untuk memilih set mesin yang digunakan dalam produksi pada Flexible Manufacture Systems (FMS) berdasar atas kriteria teknis dan ekonomis, dapat membantu pelaku produksi untuk mendisain FMS dengan pertimbangan minimalisasi biaya produksi. Sementara itu, Heuristic Search dikenal memiliki waktu pencarian yang singkat. Pada riset ini didisain sebuah Algoritma Heuristic yang menggunakan pendekatan ABC sebagai bobot dalam pencarian solusi, untuk mempersingkat waktu pemilihan peralatan saat desain/redisain FMS dalam waktu kurang dari waktu Eksponensial. Peningkatan kecepatan ini bermanfaat, karena dengan cepatnya waktu disain / redisain maka derajat fleksibilitas jenis (variety) part yang dapat diproses menjadi lebih baik. Analisis Teoritis dan Empiris pada Algoritma Heuristic menunjukkan bahwa waktu pencarian untuk mendapatkan suatu set peralatan yang tepat adalah cukup singkat, sehingga dapat disimpulkan bahwa Algoritma Heuristic yang didisain dapat diimplementasikan pada dunia nyata. Dengan membandingkan hasil empiris Algoritma Heuristic dengan Algoritma Exhaustive sebagai pembanding, disimpulkan bahwa Algoritma Heuristic yang menggunakan metode ABC sebagai bobot pencarian solusi dapat mengoptimasi problem pemilihan peralatan
Heuristic approach to optimize the number of test cases for simple circuits
SM. Thamarai,K.Kuppusamy,T. Meyyappan
International Journal of VLSI Design & Communication Systems , 2010,
Abstract: In this paper a new solution is proposed for testing simple stwo stage electronic circuits. It minimizes thenumber of tests to be performed to determine the genuinity of the circuit. The main idea behind the presentresearch work is to identify the maximum number of indistinguishable faults present in the given circuitand minimize the number of test cases based on the number of faults that has been detected. Heuristicapproach is used for test minimization part, which identifies the essential tests from overall test cases.From the results it is observed that, test minimization varies from 50% to 99% with the lowest onecorresponding to a circuit with four gates .Test minimization is low in case of circuits with lesser inputleads in gates compared to greater input leads in gates for the boolean expression with same number ofsymbols. Achievement of 99% reduction is due to the fact that the large number of tests find the same faults.The new approach is implemented for simple circuits. The results show potential for both smaller test setsand lower cpu times
Page 1 /4527
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.