18 results for “heuristic based solution”

Set a search alert

Research ArticleOpen accessIn the abstractA Stochastic Knapsack Problem with Continuous Random CapacitySuwitchporn Witchakul, Prapaisri Sudas Na Ayudhaya, Peerayuth CharnsethikulProblem Statement: The problem of allocating a set of items in order to maximize the toal linear profit under uncertain capacity referred as a stochastic knapsack problem with continuous random capacity was studied theoretically and computationally. Approach: Two optimization based heuristic algorithms were proposed and developed for solving the problem and both efficiency and effectiveness are compared with the general … …Journal of Mathematics and Statistics, Vol. 4, Issue 4 · 31 Dec 2008 · 6,946 accessesView PDF Cite

Research ArticleOpen accessIn the abstractSolving the Vehicle Routing Problem with Stochastic Demands via Hybrid Genetic Algorithm-Tabu SearchZ. Ismail, IrhamahThis study considers a version of the stochastic vehicle routing problem where customer demands are random variables with known probability distribution. A new scheme based on a hybrid GA and Tabu Search heuristic is proposed for this problem under a priori approach with preventive restocking. The relative performance of the proposed HGATS is compared to each GA and TS alone, … …Journal of Mathematics and Statistics, Vol. 4, Issue 3 · 30 Sep 2008 · 7,951 accessesView PDF Cite

Research ArticleOpen accessIn the abstractA 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 PDF Cite

Research ArticleOpen accessIn the abstractAn Iterative Method for Algorithms Implementation on a Limited Dynamically Reconfigurable HardwareAbdellatif Mtibaa, Abdessalem B. Abdelali, Lotfi Boussaid, Elbey BourennaneIn this study we propose a framework and a combined temporal partitioning and design space exploration method for run time reconfigurable processors. Our objective is to help designers to implement an algorithm in limited FPGA area resources while respecting the execution time constraint. The algorithm to be implemented is represented by a task graph with different implementation alternatives (design points) … …Journal of Computer Science, Vol. 2, Issue 5 · 31 May 2006 · 6,536 accessesView PDF Cite

Research ArticleOpen accessIn the abstractA 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 PDF Cite

Research ArticleOpen accessAll words, across the recordAN OPTIMIZATION-BASED HEURISTIC FOR A CAPACITATED LOT-SIZING MODEL IN AN AUTOMATED TELLER MACHINES NETWORKSupatchaya Chotayakul, Peerayuth Charnsetthikul, Juta Pichitlamken, John KobzaThis research studies a cash inventory problem in an ATM Network to satisfy customer’s cash needs over multiple periods with deterministic demand. The objective is to determine the amount of money to place in Automated Teller Machines (ATMs) and cash centers for each period over a given time horizon. The algorithms are designed as a multi-echelon inventory problem with single-item … …Journal of Mathematics and Statistics, Vol. 9, Issue 4 · 1 Oct 2013 · 7,049 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordProduction Scheduling for Dispatching Ready Mixed Concrete Trucks Using Bee Colony OptimizationSakchai Srichandum, Thammasak RujirayanyongProblem statement: This study proposed a systematic model of delivering Ready Mixed Concrete (RMC) that optimizes the schedule of dispatching RMC trucks. Approach: Firstly, the factors that impact the RMC delivery process are analyzed. Secondly, a model based on Bee Colony Optimization (BCO) was developed in order to find the best dispatching schedule that minimize the total waiting time of … …American Journal of Engineering and Applied Sciences, Vol. 3, Issue 1 · 31 Mar 2010 · 9,322 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordTraveling 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 PDF Cite