Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

114 results for “Heuristic”
Set a search alert
Research ArticleOpen accessIn the keywordsSolving School Bus Routing Problem by Intelligent Water Drops AlgorithmAmeera Saleh Jaradat, Mohammed Qassim ShatnawiThe School Bus Routing Problem (SBRP) is an essential subject in the development of transportation. Solving the problem will have a great impact on the transportation systems by improving the quality of the provided service and reducing the operations costs. SBRP tries to find an efficient school buses plan where each bus takes up students from different bus stops and … …Journal of Computer Science, Vol. 16, Issue 1 · 11 Jan 2018 · 8,587 accessesView PDFCite
Research ArticleOpen accessIn the keywordsCognitively Inspired Algorithm for Imprecise NavigationMelissa Shahrom, Zalilah Abd AzizThis paper presents an algorithm, namely the private navigation algorithm. The aim of this algorithm is to bridge the gap between high quality navigation services and low quality of location information or imprecise data. Generally, the imprecision is due to the poor positioning technology and the algorithms use to protect location privacy. The benefits of the algorithm are at least … …Journal of Computer Science, Vol. 12, Issue 6 · 14 Jul 2016 · 7,097 accessesView PDFCite
Research ArticleOpen accessIn the keywordsAnt Colony Optimization for Capacitated Vehicle Routing ProblemW. F. Tan, L. S. Lee, Z. A. Majid, H. V. SeowProblem statement: The Capacitated Vehicle Routing Problem (CVRP) is a well-known combinatorial optimization problem which is concerned with the distribution of goods between the depot and customers. It is of economic importance to businesses as approximately 10-20% of the final cost of the goods is contributed by the transportation process. Approach: This problem was tackled using an Ant Colony Optimization … …Journal of Computer Science, Vol. 8, Issue 6 · 15 Mar 2012 · 10,043 accessesView PDFCite
Research ArticleOpen accessIn the keywordsMathematical Model for Waste Reduction in Aluminum Fabrication Industry in KuwaitMohammed A. HajeehProblem statement: Waste generation in the aluminum industry throughout the fabrication processes in Kuwait. Approach: A mathematical model has been developed to analyze the fabrication process and a special heuristic is designed for solving the model. The model uses actual data presented from an Aluminum Fabrication Industry (AFI). Results: Reduced the amount of waste generated substantially during the process. Conclusion/Recommendations: … …Journal of Mathematics and Statistics, Vol. 6, Issue 2 · 30 Jun 2010 · 8,253 accessesView PDFCite
Research ArticleOpen accessIn the keywordsSolving One-Dimensional Cutting Stock Problem with Discrete Demands and Capacitated Planning ObjectiveSirirat Wongprakornkul, Peerayuth CharnsethikulProblem statement: One-dimensional cutting stock problem with discrete demands and capacitated planning objective is an NP hard problem. Approach: The mathematical model with column-generation technique by a branch-and-bound procedure and the heuristic based on the first fit decreasing method are proposed. Then, both approaches were compared and some characteristics were investigated such as upper-bound value, percentage above lower-bound value, computation … …Journal of Mathematics and Statistics, Vol. 6, Issue 2 · 30 Jun 2010 · 7,947 accessesView PDFCite
Research ArticleOpen accessIn the keywordsTraveling Salesman Approach for Solving Petrol Distribution Using Simulated AnnealingZuhaimy Ismail, Wan Rohaizad Wan IbrahimThis research presents an attempt to solve a logistic company's problem of delivering petrol to petrol station in the state of Johor. This delivery system is formulated as a travelling salesman problem (TSP). TSP involves finding an optimal route for visiting stations and returning to point of origin, where the inter-station distance is symmetric and known. This real world application … …American Journal of Applied Sciences, Vol. 5, Issue 11 · 30 Nov 2008 · 7,194 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Scheduling Algorithm Based on Petri Nets and Simulated AnnealingRachida Hadiby Ghoul, Abdelhamid Benjelloul, Sihem Kechida, Hicham TebbikhThis study aims at presenting a hybrid Flexible Manufacturing System "HFMS" short-term scheduling problem. Based on the art state of general scheduling algorithms, we present the meta-heuristic, we have decided to apply for a given example of HFMS. That was the study of Simulated Annealing Algorithm SA. The HFMS model based on hierarchical Petri nets, was used to represent static … …American Journal of Applied Sciences, Vol. 4, Issue 5 · 31 May 2007 · 7,164 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Variable Neighborhood Search Algorithm for Assigning Cells to Switches in Wireless NetworksMatthieu Andr, Gilles Pesant, Samuel PierreThe problem of assigning cells to switches in wireless networks consists of minimizing the total operating cost, that is, the cost of linking cells to switches and the cost of handover from one cell to another, by taking into account factors such as network topology, switch capacity and traffic load in the entire network. Such a problem is well known … …Journal of Computer Science, Vol. 1, Issue 2 · 30 Jun 2005 · 6,748 accessesView PDFCite
Research ArticleOpen accessIn the keywordsSpeech Enhancement Based on Adaptive Noise Cancellation and Particle Swarm OptimizationTayseer M.F. Taha, Summrina Kanwal Wajid, Amir HussainSpeech enhancement is used in almost all modern communication systems. This is due to the quality of speech being degraded by environmental interference factors, such as: Acoustic additive noise, acoustic reverberation or white Gaussian noise. This paper, explores the potential of different benchmark optimization techniques for enhancing the speech signal. This is accomplished by fine tuning filter coefficients using a … …Journal of Computer Science, Vol. 15, Issue 5 · 28 May 2019 · 7,729 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Great Deluge Algorithm with Bi-Decay Rate for Efficient Task Scheduling in Grid ComputingKaiLun Eng, Abdullah Muhammed, Sazlinah Hasan, Mohamad Afendee MohamedTo realise the utmost idea of global collaborative resource sharing with Grid computing, the fundamental scheduling process is playing a critical role. However, scheduling in Grid computing environment is a well-known NP-complete problem. In this study, we propose a new extension of Great Deluge algorithm with an effective diversification strategy for the Grid scheduling problem. The proposed approach, namely BiGD, … …Journal of Computer Science, Vol. 15, Issue 3 · 7 Mar 2019 · 7,720 accessesView PDFCite