CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: heuristics</title> <meta name="description" content="Search results for: heuristics"> <meta name="keywords" content="heuristics"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="heuristics" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="heuristics"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 88</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: heuristics</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">88</span> Automated Test Data Generation For some types of Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hitesh%20Tahbildar">Hitesh Tahbildar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The cost of test data generation for a program is computationally very high. In general case, no algorithm to generate test data for all types of algorithms has been found. The cost of generating test data for different types of algorithm is different. Till date, people are emphasizing the need to generate test data for different types of programming constructs rather than different types of algorithms. The test data generation methods have been implemented to find heuristics for different types of algorithms. Some algorithms that includes divide and conquer, backtracking, greedy approach, dynamic programming to find the minimum cost of test data generation have been tested. Our experimental results say that some of these types of algorithm can be used as a necessary condition for selecting heuristics and programming constructs are sufficient condition for selecting our heuristics. Finally we recommend the different heuristics for test data generation to be selected for different types of algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ongest%20path" title="ongest path">ongest path</a>, <a href="https://publications.waset.org/abstracts/search?q=saturation%20point" title=" saturation point"> saturation point</a>, <a href="https://publications.waset.org/abstracts/search?q=lmax" title=" lmax"> lmax</a>, <a href="https://publications.waset.org/abstracts/search?q=kL" title=" kL"> kL</a>, <a href="https://publications.waset.org/abstracts/search?q=kS" title=" kS"> kS</a> </p> <a href="https://publications.waset.org/abstracts/2406/automated-test-data-generation-for-some-types-of-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2406.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">405</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">87</span> A Hybrid Distributed Algorithm for Solving Job Shop Scheduling Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aydin%20Teymourifar">Aydin Teymourifar</a>, <a href="https://publications.waset.org/abstracts/search?q=Gurkan%20Ozturk"> Gurkan Ozturk</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a distributed hybrid algorithm is proposed for solving the job shop scheduling problem. The suggested method executes different artificial neural networks, heuristics and meta-heuristics simultaneously on more than one machine. The neural networks are used to control the constraints of the problem while the meta-heuristics search the global space and the heuristics are used to prevent the premature convergence. To attain an efficient distributed intelligent method for solving big and distributed job shop scheduling problems, Apache Spark and Hadoop frameworks are used. In the algorithm implementation and design steps, new approaches are applied. Comparison between the proposed algorithm and other efficient algorithms from the literature shows its efficiency, which is able to solve large size problems in short time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distributed%20algorithms" title="distributed algorithms">distributed algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=Apache%20Spark" title=" Apache Spark"> Apache Spark</a>, <a href="https://publications.waset.org/abstracts/search?q=Hadoop" title=" Hadoop"> Hadoop</a>, <a href="https://publications.waset.org/abstracts/search?q=job%20shop%20scheduling" title=" job shop scheduling"> job shop scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20network" title=" neural network"> neural network</a> </p> <a href="https://publications.waset.org/abstracts/72320/a-hybrid-distributed-algorithm-for-solving-job-shop-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72320.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">387</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">86</span> A Heuristic for the Integrated Production and Distribution Scheduling Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Christian%20Meinecke">Christian Meinecke</a>, <a href="https://publications.waset.org/abstracts/search?q=Bernd%20Scholz-Reiter"> Bernd Scholz-Reiter</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The integrated problem of production and distribution scheduling is relevant in many industrial applications. Thus, many heuristics to solve this integrated problem have been developed in the last decade. Most of these heuristics use a sequential working principal or a single decomposition and integration approach to separate and solve sub-problems. A heuristic using a multi-step decomposition and integration approach is presented in this paper and evaluated in a case study. The result show significant improved results compared with sequential scheduling heuristics. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=production%20and%20outbound%20distribution" title="production and outbound distribution">production and outbound distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=integrated%20planning" title=" integrated planning"> integrated planning</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic" title=" heuristic"> heuristic</a>, <a href="https://publications.waset.org/abstracts/search?q=decomposition" title=" decomposition"> decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=integration" title=" integration"> integration</a> </p> <a href="https://publications.waset.org/abstracts/4364/a-heuristic-for-the-integrated-production-and-distribution-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4364.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">429</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">85</span> An Approximation Technique to Automate Tron</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=P.%20Jayashree">P. Jayashree</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Rajkumar"> S. Rajkumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With the trend of virtual and augmented reality environments booming to provide a life like experience, gaming is a major tool in supporting such learning environments. In this work, a variant of Voronoi heuristics, employing supervised learning for the TRON game is proposed. The paper discusses the features that would be really useful when a machine learning bot is to be used as an opponent against a human player. Various game scenarios, nature of the bot and the experimental results are provided for the proposed variant to prove that the approach is better than those that are currently followed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=artificial%20Intelligence" title="artificial Intelligence">artificial Intelligence</a>, <a href="https://publications.waset.org/abstracts/search?q=automation" title=" automation"> automation</a>, <a href="https://publications.waset.org/abstracts/search?q=machine%20learning" title=" machine learning"> machine learning</a>, <a href="https://publications.waset.org/abstracts/search?q=TRON%20game" title=" TRON game"> TRON game</a>, <a href="https://publications.waset.org/abstracts/search?q=Voronoi%20heuristics" title=" Voronoi heuristics"> Voronoi heuristics</a> </p> <a href="https://publications.waset.org/abstracts/60483/an-approximation-technique-to-automate-tron" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/60483.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">467</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">84</span> A Genetic Algorithm Based Permutation and Non-Permutation Scheduling Heuristics for Finite Capacity Material Requirement Planning Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Watchara%20Songserm">Watchara Songserm</a>, <a href="https://publications.waset.org/abstracts/search?q=Teeradej%20Wuttipornpun"> Teeradej Wuttipornpun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a genetic algorithm based permutation and non-permutation scheduling heuristics (GAPNP) to solve a multi-stage finite capacity material requirement planning (FCMRP) problem in automotive assembly flow shop with unrelated parallel machines. In the algorithm, the sequences of orders are iteratively improved by the GA characteristics, whereas the required operations are scheduled based on the presented permutation and non-permutation heuristics. Finally, a linear programming is applied to minimize the total cost. The presented GAPNP algorithm is evaluated by using real datasets from automotive companies. The required parameters for GAPNP are intently tuned to obtain a common parameter setting for all case studies. The results show that GAPNP significantly outperforms the benchmark algorithm about 30% on average. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=capacitated%20MRP" title="capacitated MRP">capacitated MRP</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20programming" title=" linear programming"> linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=automotive%20industries" title=" automotive industries"> automotive industries</a>, <a href="https://publications.waset.org/abstracts/search?q=flow%20shop" title=" flow shop"> flow shop</a>, <a href="https://publications.waset.org/abstracts/search?q=application%20in%20industry" title=" application in industry"> application in industry</a> </p> <a href="https://publications.waset.org/abstracts/67589/a-genetic-algorithm-based-permutation-and-non-permutation-scheduling-heuristics-for-finite-capacity-material-requirement-planning-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67589.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">489</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">83</span> The Influence of Group Heuristics on Corporate Social Responsibility Messages Designed to Reduce Illegal Consumption</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kate%20Whitman">Kate Whitman</a>, <a href="https://publications.waset.org/abstracts/search?q=Zahra%20Murad"> Zahra Murad</a>, <a href="https://publications.waset.org/abstracts/search?q=Joe%20Cox"> Joe Cox</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Corporate social responsibility projects are suggested to motivate consumers to reciprocate good corporate deeds with their custom. When the projects benefit the ingroup vs the outgroup, such as locals rather than foreigners, the effect on reciprocity is suggested to be more powerful. This may be explained by group heuristics, a theory which indicates that favours to the ingroup (but not outgroup) are expected to be reciprocated, resulting in ingroup favouritism. The heuristic is theorised to explain prosocial behaviours towards the ingroup. The aim of this study is to test whether group heuristics similarly explain a reduction in antisocial behaviours towards the ingroup, measured by illegal consumption which harms a group that consumers identify with. In order to test corporate social responsibility messages, a population of interested consumers is required, so sport fans are recruited. A pre-registered experiment (N = 600) tests the influence of a focused “team” benefiting message vs a broader “sport” benefiting message on change in illegal intentions. The influence of group (team) identity and trait reciprocity on message efficacy are tested as measures of group heuristics. Results suggest that the “team” treatment significantly reduces illegal consumption intentions. The “sport” treatment interacted with the team identification measure, increasing illegal consumption intentions for low team identification individuals. The results suggest that corporate social responsibility may be effective in reducing illegal consumption, if the messages are delivered directly from brands to consumers with brand identification. Messages delivered on the behalf of an industry may have an undesirable effect. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=live%20sports" title="live sports">live sports</a>, <a href="https://publications.waset.org/abstracts/search?q=piracy" title=" piracy"> piracy</a>, <a href="https://publications.waset.org/abstracts/search?q=counterfeiting" title=" counterfeiting"> counterfeiting</a>, <a href="https://publications.waset.org/abstracts/search?q=corporate%20social%20responsibility" title=" corporate social responsibility"> corporate social responsibility</a>, <a href="https://publications.waset.org/abstracts/search?q=group%20heuristics" title=" group heuristics"> group heuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=ingroup%20bias" title=" ingroup bias"> ingroup bias</a>, <a href="https://publications.waset.org/abstracts/search?q=team%20identification" title=" team identification"> team identification</a> </p> <a href="https://publications.waset.org/abstracts/176230/the-influence-of-group-heuristics-on-corporate-social-responsibility-messages-designed-to-reduce-illegal-consumption" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/176230.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">84</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">82</span> Solving Weighted Number of Operation Plus Processing Time Due-Date Assignment, Weighted Scheduling and Process Planning Integration Problem Using Genetic and Simulated Annealing Search Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Halil%20Ibrahim%20Demir">Halil Ibrahim Demir</a>, <a href="https://publications.waset.org/abstracts/search?q=Caner%20Erden"> Caner Erden</a>, <a href="https://publications.waset.org/abstracts/search?q=Mumtaz%20Ipek"> Mumtaz Ipek</a>, <a href="https://publications.waset.org/abstracts/search?q=Ozer%20Uygun"> Ozer Uygun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Traditionally, the three important manufacturing functions, which are process planning, scheduling and due-date assignment, are performed separately and sequentially. For couple of decades, hundreds of studies are done on integrated process planning and scheduling problems and numerous researches are performed on scheduling with due date assignment problem, but unfortunately the integration of these three important functions are not adequately addressed. Here, the integration of these three important functions is studied by using genetic, random-genetic hybrid, simulated annealing, random-simulated annealing hybrid and random search techniques. As well, the importance of the integration of these three functions and the power of meta-heuristics and of hybrid heuristics are studied. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=process%20planning" title="process planning">process planning</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20scheduling" title=" weighted scheduling"> weighted scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20due-date%20assignment" title=" weighted due-date assignment"> weighted due-date assignment</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20search" title=" genetic search"> genetic search</a>, <a href="https://publications.waset.org/abstracts/search?q=simulated%20annealing" title=" simulated annealing"> simulated annealing</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20meta-heuristics" title=" hybrid meta-heuristics"> hybrid meta-heuristics</a> </p> <a href="https://publications.waset.org/abstracts/57629/solving-weighted-number-of-operation-plus-processing-time-due-date-assignment-weighted-scheduling-and-process-planning-integration-problem-using-genetic-and-simulated-annealing-search-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57629.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">469</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">81</span> On the Application of Heuristics of the Traveling Salesman Problem for the Task of Restoring the DNA Matrix</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Boris%20Melnikov">Boris Melnikov</a>, <a href="https://publications.waset.org/abstracts/search?q=Dmitrii%20Chaikovskii"> Dmitrii Chaikovskii</a>, <a href="https://publications.waset.org/abstracts/search?q=Elena%20Melnikova"> Elena Melnikova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The traveling salesman problem (TSP) is a well-known optimization problem that seeks to find the shortest possible route that visits a set of points and returns to the starting point. In this paper, we apply some heuristics of the TSP for the task of restoring the DNA matrix. This restoration problem is often considered in biocybernetics. For it, we must recover the matrix of distances between DNA sequences if not all the elements of the matrix under consideration are known at the input. We consider the possibility of using this method in the testing of distance calculation algorithms between a pair of DNAs to restore the partially filled matrix. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimization%20problems" title="optimization problems">optimization problems</a>, <a href="https://publications.waset.org/abstracts/search?q=DNA%20matrix" title=" DNA matrix"> DNA matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=partially%20filled%20matrix" title=" partially filled matrix"> partially filled matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=traveling%20salesman%20problem" title=" traveling salesman problem"> traveling salesman problem</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic%20algorithms" title=" heuristic algorithms"> heuristic algorithms</a> </p> <a href="https://publications.waset.org/abstracts/172868/on-the-application-of-heuristics-of-the-traveling-salesman-problem-for-the-task-of-restoring-the-dna-matrix" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/172868.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">150</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">80</span> Heuristics for Optimizing Power Consumption in the Smart Grid</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zaid%20Jamal%20Saeed%20Almahmoud">Zaid Jamal Saeed Almahmoud</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Our increasing reliance on electricity, with inefficient consumption trends, has resulted in several economical and environmental threats. These threats include wasting billions of dollars, draining limited resources, and elevating the impact of climate change. As a solution, the smart grid is emerging as the future power grid, with smart techniques to optimize power consumption and electricity generation. Minimizing the peak power consumption under a fixed delay requirement is a significant problem in the smart grid. In addition, matching demand to supply is a key requirement for the success of the future electricity. In this work, we consider the problem of minimizing the peak demand under appliances constraints by scheduling power jobs with uniform release dates and deadlines. As the problem is known to be NP-Hard, we propose two versions of a heuristic algorithm for solving this problem. Our theoretical analysis and experimental results show that our proposed heuristics outperform existing methods by providing a better approximation to the optimal solution. In addition, we consider dynamic pricing methods to minimize the peak load and match demand to supply in the smart grid. Our contribution is the proposal of generic, as well as customized pricing heuristics to minimize the peak demand and match demand with supply. In addition, we propose optimal pricing algorithms that can be used when the maximum deadline period of the power jobs is relatively small. Finally, we provide theoretical analysis and conduct several experiments to evaluate the performance of the proposed algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=heuristics" title="heuristics">heuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=smart%20grid" title=" smart grid"> smart grid</a>, <a href="https://publications.waset.org/abstracts/search?q=peak%20demand" title=" peak demand"> peak demand</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20supply" title=" power supply"> power supply</a> </p> <a href="https://publications.waset.org/abstracts/158813/heuristics-for-optimizing-power-consumption-in-the-smart-grid" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/158813.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">88</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">79</span> Dynamic Route Optimization in Vehicle Adhoc Networks: A Heuristics Routing Protocol</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rafi%20Ullah">Rafi Ullah</a>, <a href="https://publications.waset.org/abstracts/search?q=Shah%20Muhammad%20Emaduddin"> Shah Muhammad Emaduddin</a>, <a href="https://publications.waset.org/abstracts/search?q=Taha%20Jilani"> Taha Jilani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Vehicle Adhoc Networks (VANET) belongs to a special class of Mobile Adhoc Network (MANET) with high mobility. Network is created by road side vehicles equipped with communication devices like GPS and Wifi etc. Since the environment is highly dynamic due to difference in speed and high mobility of vehicles and weak stability of the network connection, it is a challenging task to design an efficient routing protocol for such an unstable environment. Our proposed algorithm uses heuristic for the calculation of optimal path for routing the packet efficiently in collaboration with several other parameters like geographical location, speed, priority, the distance among the vehicles, communication range, and networks congestion. We have incorporated probabilistic, heuristic and machine learning based approach inconsistency with the relay function of the memory buffer to keep the packet moving towards the destination. These parameters when used in collaboration provide us a very strong and admissible heuristics. We have mathematically proved that the proposed technique is efficient for the routing of packets, especially in a medical emergency situation. These networks can be used for medical emergency, security, entertainment and routing purposes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=heuristics%20routing" title="heuristics routing">heuristics routing</a>, <a href="https://publications.waset.org/abstracts/search?q=intelligent%20routing" title=" intelligent routing"> intelligent routing</a>, <a href="https://publications.waset.org/abstracts/search?q=VANET" title=" VANET"> VANET</a>, <a href="https://publications.waset.org/abstracts/search?q=route%20optimization" title=" route optimization"> route optimization</a> </p> <a href="https://publications.waset.org/abstracts/101651/dynamic-route-optimization-in-vehicle-adhoc-networks-a-heuristics-routing-protocol" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/101651.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">176</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">78</span> A Comparative Analysis of Heuristics Applied to Collecting Used Lubricant Oils Generated in the City of Pereira, Colombia</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Diana%20Fajardo">Diana Fajardo</a>, <a href="https://publications.waset.org/abstracts/search?q=Sebasti%C3%A1n%20Ortiz"> Sebastián Ortiz</a>, <a href="https://publications.waset.org/abstracts/search?q=Oscar%20Herrera"> Oscar Herrera</a>, <a href="https://publications.waset.org/abstracts/search?q=Ang%C3%A9lica%20Santis"> Angélica Santis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Currently, in Colombia is arising a problem related to collecting used lubricant oils which are generated by the increment of the vehicle fleet. This situation does not allow a proper disposal of this type of waste, which in turn results in a negative impact on the environment. Therefore, through the comparative analysis of various heuristics, the best solution to the VRP (Vehicle Routing Problem) was selected by comparing costs and times for the collection of used lubricant oils in the city of Pereira, Colombia; since there is no presence of management companies engaged in the direct administration of the collection of this pollutant. To achieve this aim, six proposals of through methods of solution of two phases were discussed. First, the assignment of the group of generator points of the residue was made (previously identified). Proposals one and four of through methods are based on the closeness of points. The proposals two and five are using the scanning method and the proposals three and six are considering the restriction of the capacity of collection vehicle. Subsequently, the routes were developed - in the first three proposals by the Clarke and Wright's savings algorithm and in the following proposals by the Traveling Salesman optimization mathematical model. After applying techniques, a comparative analysis of the results was performed and it was determined which of the proposals presented the most optimal values in terms of the distance, cost and travel time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Heuristics" title="Heuristics">Heuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization%20Model" title=" optimization Model"> optimization Model</a>, <a href="https://publications.waset.org/abstracts/search?q=savings%20algorithm" title=" savings algorithm"> savings algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=used%20vehicular%20oil" title=" used vehicular oil"> used vehicular oil</a>, <a href="https://publications.waset.org/abstracts/search?q=V.R.P." title=" V.R.P."> V.R.P.</a> </p> <a href="https://publications.waset.org/abstracts/56922/a-comparative-analysis-of-heuristics-applied-to-collecting-used-lubricant-oils-generated-in-the-city-of-pereira-colombia" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/56922.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">414</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">77</span> Single Machine Scheduling Problem to Minimize the Number of Tardy Jobs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ali%20Allahverdi">Ali Allahverdi</a>, <a href="https://publications.waset.org/abstracts/search?q=Harun%20Aydilek"> Harun Aydilek</a>, <a href="https://publications.waset.org/abstracts/search?q=Asiye%20Aydilek"> Asiye Aydilek</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Minimizing the number of tardy jobs is an important factor to consider while making scheduling decisions. This is because on-time shipments are vital for lowering cost and increasing customers’ satisfaction. This paper addresses the single machine scheduling problem with the objective of minimizing the number of tardy jobs. The only known information is the lower and upper bounds for processing times, and deterministic job due dates. A dominance relation is established, and an algorithm is proposed. Several heuristics are generated from the proposed algorithm. Computational analysis indicates that the performance of one of the heuristics is very close to the optimal solution, i.e., on average, less than 1.5 % from the optimal solution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=single%20machine%20scheduling" title="single machine scheduling">single machine scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=number%20of%20tardy%20jobs" title=" number of tardy jobs"> number of tardy jobs</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristi" title=" heuristi"> heuristi</a>, <a href="https://publications.waset.org/abstracts/search?q=lower%20and%20upper%20bounds" title=" lower and upper bounds"> lower and upper bounds</a> </p> <a href="https://publications.waset.org/abstracts/21639/single-machine-scheduling-problem-to-minimize-the-number-of-tardy-jobs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21639.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">555</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">76</span> On Exploring Search Heuristics for improving the efficiency in Web Information Extraction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Patricia%20Jim%C3%A9nez">Patricia Jiménez</a>, <a href="https://publications.waset.org/abstracts/search?q=Rafael%20Corchuelo"> Rafael Corchuelo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays the World Wide Web is the most popular source of information that relies on billions of on-line documents. Web mining is used to crawl through these documents, collect the information of interest and process it by applying data mining tools in order to use the gathered information in the best interest of a business, what enables companies to promote theirs. Unfortunately, it is not easy to extract the information a web site provides automatically when it lacks an API that allows to transform the user-friendly data provided in web documents into a structured format that is machine-readable. Rule-based information extractors are the tools intended to extract the information of interest automatically and offer it in a structured format that allow mining tools to process it. However, the performance of an information extractor strongly depends on the search heuristic employed since bad choices regarding how to learn a rule may easily result in loss of effectiveness and/or efficiency. Improving search heuristics regarding efficiency is of uttermost importance in the field of Web Information Extraction since typical datasets are very large. In this paper, we employ an information extractor based on a classical top-down algorithm that uses the so-called Information Gain heuristic introduced by Quinlan and Cameron-Jones. Unfortunately, the Information Gain relies on some well-known problems so we analyse an intuitive alternative, Termini, that is clearly more efficient; we also analyse other proposals in the literature and conclude that none of them outperforms the previous alternative. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=information%20extraction" title="information extraction">information extraction</a>, <a href="https://publications.waset.org/abstracts/search?q=search%20heuristics" title=" search heuristics"> search heuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=semi-structured%20documents" title=" semi-structured documents"> semi-structured documents</a>, <a href="https://publications.waset.org/abstracts/search?q=web%20mining." title=" web mining. "> web mining. </a> </p> <a href="https://publications.waset.org/abstracts/25697/on-exploring-search-heuristics-for-improving-the-efficiency-in-web-information-extraction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25697.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">335</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">75</span> A Hybrid Hopfield Neural Network for Dynamic Flexible Job Shop Scheduling Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aydin%20Teymourifar">Aydin Teymourifar</a>, <a href="https://publications.waset.org/abstracts/search?q=Gurkan%20Ozturk"> Gurkan Ozturk</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a new hybrid Hopfield neural network is proposed for the dynamic, flexible job shop scheduling problem. A new heuristic based and easy to implement energy function is designed for the Hopfield neural network, which penalizes the constraints violation and decreases makespan. Moreover, for enhancing the performance, several heuristics are integrated to it that achieve active, and non-delay schedules also, prevent early convergence of the neural network. The suggested algorithm that is designed as a generalization of the previous studies for the flexible and dynamic scheduling problems can be used for solving real scheduling problems. Comparison of the presented hybrid method results with the previous studies results proves its efficiency. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamic%20flexible%20job%20shop%20scheduling" title="dynamic flexible job shop scheduling">dynamic flexible job shop scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20network" title=" neural network"> neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristics" title=" heuristics"> heuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=constrained%20optimization" title=" constrained optimization"> constrained optimization</a> </p> <a href="https://publications.waset.org/abstracts/72143/a-hybrid-hopfield-neural-network-for-dynamic-flexible-job-shop-scheduling-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72143.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">418</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">74</span> Algorithms for Run-Time Task Mapping in NoC-Based Heterogeneous MPSoCs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20K.%20Benhaoua">M. K. Benhaoua</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20K.%20Singh"> A. K. Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20E.%20Benyamina"> A. E. Benyamina</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20Boulet"> P. Boulet</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mapping parallelized tasks of applications onto these MPSoCs can be done either at design time (static) or at run-time (dynamic). Static mapping strategies find the best placement of tasks at design-time, and hence, these are not suitable for dynamic workload and seem incapable of runtime resource management. The number of tasks or applications executing in MPSoC platform can exceed the available resources, requiring efficient run-time mapping strategies to meet these constraints. This paper describes a new Spiral Dynamic Task Mapping heuristic for mapping applications onto NoC-based Heterogeneous MPSoC. This heuristic is based on packing strategy and routing Algorithm proposed also in this paper. Heuristic try to map the tasks of an application in a clustering region to reduce the communication overhead between the communicating tasks. The heuristic proposed in this paper attempts to map the tasks of an application that are most related to each other in a spiral manner and to find the best possible path load that minimizes the communication overhead. In this context, we have realized a simulation environment for experimental evaluations to map applications with varying number of tasks onto an 8x8 NoC-based Heterogeneous MPSoCs platform, we demonstrate that the new mapping heuristics with the new modified dijkstra routing algorithm proposed are capable of reducing the total execution time and energy consumption of applications when compared to state-of-the-art run-time mapping heuristics reported in the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multiprocessor%20system%20on%20chip" title="multiprocessor system on chip">multiprocessor system on chip</a>, <a href="https://publications.waset.org/abstracts/search?q=MPSoC" title=" MPSoC"> MPSoC</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20on%20chip" title=" network on chip"> network on chip</a>, <a href="https://publications.waset.org/abstracts/search?q=NoC" title=" NoC"> NoC</a>, <a href="https://publications.waset.org/abstracts/search?q=heterogeneous%20architectures" title=" heterogeneous architectures"> heterogeneous architectures</a>, <a href="https://publications.waset.org/abstracts/search?q=run-time%20mapping%20heuristics" title=" run-time mapping heuristics"> run-time mapping heuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=routing%20algorithm" title=" routing algorithm "> routing algorithm </a> </p> <a href="https://publications.waset.org/abstracts/24295/algorithms-for-run-time-task-mapping-in-noc-based-heterogeneous-mpsocs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24295.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">489</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">73</span> Comparison of Heuristic Methods for Solving Traveling Salesman Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Regita%20P.%20Permata">Regita P. Permata</a>, <a href="https://publications.waset.org/abstracts/search?q=Ulfa%20S.%20Nuraini"> Ulfa S. Nuraini</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Traveling Salesman Problem (TSP) is the most studied problem in combinatorial optimization. In simple language, TSP can be described as a problem of finding a minimum distance tour to a city, starting and ending in the same city, and exactly visiting another city. In product distribution, companies often get problems in determining the minimum distance that affects the time allocation. In this research, we aim to apply TSP heuristic methods to simulate nodes as city coordinates in product distribution. The heuristics used are sub tour reversal, nearest neighbor, farthest insertion, cheapest insertion, nearest insertion, and arbitrary insertion. We have done simulation nodes using Euclidean distances to compare the number of cities and processing time, thus we get optimum heuristic method. The results show that the optimum heuristic methods are farthest insertion and nearest insertion. These two methods can be recommended to solve product distribution problems in certain companies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Euclidean" title="Euclidean">Euclidean</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristics" title=" heuristics"> heuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=TSP" title=" TSP"> TSP</a> </p> <a href="https://publications.waset.org/abstracts/129149/comparison-of-heuristic-methods-for-solving-traveling-salesman-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/129149.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">127</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">72</span> Search for APN Permutations in Rings ℤ_2×ℤ_2^k</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Daniel%20Panario">Daniel Panario</a>, <a href="https://publications.waset.org/abstracts/search?q=Daniel%20Santana%20de%20Freitas"> Daniel Santana de Freitas</a>, <a href="https://publications.waset.org/abstracts/search?q=Brett%20Stevens"> Brett Stevens</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Almost Perfect Nonlinear (APN) permutations with optimal resistance against differential cryptanalysis can be found in several domains. The permutation used in the standard for symmetric cryptography (the AES), for example, is based on a special kind of inversion in GF(28). Although very close to APN (2-uniform), this permutation still contains one number 4 in its differential spectrum, which means that, rigorously, it must be classified as 4-uniform. This fact motivates the search for fully APN permutations in other domains of definition. The extremely high complexity associated to this kind of problem precludes an exhaustive search for an APN permutation with 256 elements to be performed without the support of a suitable mathematical structure. On the other hand, in principle, there is nothing to indicate which mathematically structured domains can effectively help the search, and it is necessary to test several domains. In this work, the search for APN permutations in rings ℤ2×ℤ2k is investigated. After a full, exhaustive search with k=2 and k=3, all possible APN permutations in those rings were recorded, together with their differential profiles. Some very promising heuristics in these cases were collected so that, when used as a basis to prune backtracking for the same search in ℤ2×ℤ8 (search space with size 16! ≅244), just a few tenths of a second were enough to produce an APN permutation in a single CPU. Those heuristics were empirically extrapolated so that they could be applied to a backtracking search for APNs over ℤ2×ℤ16 (search space with size 32! ≅2117). The best permutations found in this search were further refined through Simulated Annealing, with a definition of neighbors suitable to this domain. The best result produced with this scheme was a 3-uniform permutation over ℤ2×ℤ16 with only 24 values equal to 3 in the differential spectrum (all the other 968 values were less than or equal 2, as it should be the case for an APN permutation). Although far from being fully APN, this result is technically better than a 4-uniform permutation and demanded only a few seconds in a single CPU. This is a strong indication that the use of mathematically structured domains, like the rings described in this work, together with heuristics based on smaller cases, can lead to dramatic cuts in the computational resources involved in the complexity of the search for APN permutations in extremely large domains. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=APN%20permutations" title="APN permutations">APN permutations</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic%20searches" title=" heuristic searches"> heuristic searches</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20cryptography" title=" symmetric cryptography"> symmetric cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=S-box%20design" title=" S-box design"> S-box design</a> </p> <a href="https://publications.waset.org/abstracts/145556/search-for-apn-permutations-in-rings-2-2k" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/145556.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">159</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">71</span> A Coordinate-Based Heuristic Route Search Algorithm for Delivery Truck Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Tarek">Ahmed Tarek</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Alveed"> Ahmed Alveed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Vehicle routing problem is a well-known re-search avenue in computing. Modern vehicle routing is more focused with the GPS-based coordinate system, as the state-of-the-art vehicle, and trucking systems are equipped with digital navigation. In this paper, a new two dimensional coordinate-based algorithm for addressing the vehicle routing problem for a supply chain network is proposed and explored, and the algorithm is compared with other available, and recently devised heuristics. For the algorithms discussed, which includes the pro-posed coordinate-based search heuristic as well, the advantages and the disadvantages associated with the heuristics are explored. The proposed algorithm is studied from the stand point of a small supermarket chain delivery network that supplies to its stores in four different states around the East Coast area, and is trying to optimize its trucking delivery cost. Minimizing the delivery cost for the supply network of a supermarket chain is important to ensure its business success. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=coordinate-based%20optimal%20routing" title="coordinate-based optimal routing">coordinate-based optimal routing</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamiltonian%20Circuit" title=" Hamiltonian Circuit"> Hamiltonian Circuit</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic%20algorithm" title=" heuristic algorithm"> heuristic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=traveling%20salesman%20problem" title=" traveling salesman problem"> traveling salesman problem</a>, <a href="https://publications.waset.org/abstracts/search?q=vehicle%20routing%20problem" title=" vehicle routing problem"> vehicle routing problem</a> </p> <a href="https://publications.waset.org/abstracts/136218/a-coordinate-based-heuristic-route-search-algorithm-for-delivery-truck-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/136218.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">147</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">70</span> Heuristic Search Algorithm (HSA) for Enhancing the Lifetime of Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tripatjot%20S.%20Panag">Tripatjot S. Panag</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20S.%20Dhillon"> J. S. Dhillon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The lifetime of a wireless sensor network can be effectively increased by using scheduling operations. Once the sensors are randomly deployed, the task at hand is to find the largest number of disjoint sets of sensors such that every sensor set provides complete coverage of the target area. At any instant, only one of these disjoint sets is switched on, while all other are switched off. This paper proposes a heuristic search method to find the maximum number of disjoint sets that completely cover the region. A population of randomly initialized members is made to explore the solution space. A set of heuristics has been applied to guide the members to a possible solution in their neighborhood. The heuristics escalate the convergence of the algorithm. The best solution explored by the population is recorded and is continuously updated. The proposed algorithm has been tested for applications which require sensing of multiple target points, referred to as point coverage applications. Results show that the proposed algorithm outclasses the existing algorithms. It always finds the optimum solution, and that too by making fewer number of fitness function evaluations than the existing approaches. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=coverage" title="coverage">coverage</a>, <a href="https://publications.waset.org/abstracts/search?q=disjoint%20sets" title=" disjoint sets"> disjoint sets</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic" title=" heuristic"> heuristic</a>, <a href="https://publications.waset.org/abstracts/search?q=lifetime" title=" lifetime"> lifetime</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=Wireless%20sensor%20networks" title=" Wireless sensor networks"> Wireless sensor networks</a>, <a href="https://publications.waset.org/abstracts/search?q=WSN" title=" WSN"> WSN</a> </p> <a href="https://publications.waset.org/abstracts/34165/heuristic-search-algorithm-hsa-for-enhancing-the-lifetime-of-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34165.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">452</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">69</span> Two Efficient Heuristic Algorithms for the Integrated Production Planning and Warehouse Layout Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Pourmohammadi%20Fallah">Mohammad Pourmohammadi Fallah</a>, <a href="https://publications.waset.org/abstracts/search?q=Maziar%20Salahi"> Maziar Salahi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the literature, a mixed-integer linear programming model for the integrated production planning and warehouse layout problem is proposed. To solve the model, the authors proposed a Lagrangian relax-and-fix heuristic that takes a significant amount of time to stop with gaps above 5$\%$ for large-scale instances. Here, we present two heuristic algorithms to solve the problem. In the first one, we use a greedy approach by allocating warehouse locations with less reservation costs and also less transportation costs from the production area to locations and from locations to the output point to items with higher demands. Then a smaller model is solved. In the second heuristic, first, we sort items in descending order according to the fraction of the sum of the demands for that item in the time horizon plus the maximum demand for that item in the time horizon and the sum of all its demands in the time horizon. Then we categorize the sorted items into groups of 3, 4, or 5 and solve a small-scale optimization problem for each group, hoping to improve the solution of the first heuristic. Our preliminary numerical results show the effectiveness of the proposed heuristics. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=capacitated%20lot-sizing" title="capacitated lot-sizing">capacitated lot-sizing</a>, <a href="https://publications.waset.org/abstracts/search?q=warehouse%20layout" title=" warehouse layout"> warehouse layout</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed-integer%20linear%20programming" title=" mixed-integer linear programming"> mixed-integer linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristics%20algorithm" title=" heuristics algorithm"> heuristics algorithm</a> </p> <a href="https://publications.waset.org/abstracts/154415/two-efficient-heuristic-algorithms-for-the-integrated-production-planning-and-warehouse-layout-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/154415.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">195</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">68</span> Spectrum Allocation Using Cognitive Radio in Wireless Mesh Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ayoub%20Alsarhan">Ayoub Alsarhan</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Otoom"> Ahmed Otoom</a>, <a href="https://publications.waset.org/abstracts/search?q=Yousef%20Kilani"> Yousef Kilani</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdel-Rahman%20al-GHuwairi"> Abdel-Rahman al-GHuwairi </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless mesh networks (WMNs) have emerged recently to improve internet access and other networking services. WMNs provide network access to the clients and other networking functions such as routing, and packet forwarding. Spectrum scarcity is the main challenge that limits the performance of WMNs. Cognitive radio is proposed to solve spectrum scarcity problem. In this paper, we consider a cognitive wireless mesh network where unlicensed users (secondary users, SUs) can access free spectrum that is allocated to spectrum owners (primary users, PUs). Although considerable research has been conducted on spectrum allocation, spectrum assignment is still considered an important challenging problem. This problem can be solved using cognitive radio technology that allows SUs to intelligently locate free bands and access them without interfering with PUs. Our scheme considers several heuristics for spectrum allocation. These heuristics include: channel error rate, PUs activities, channel capacity and channel switching time. Performance evaluation of the proposed scheme shows that the scheme is able to allocate the unused spectrum for SUs efficiently. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cognitive%20radio" title="cognitive radio">cognitive radio</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20spectrum%20access" title=" dynamic spectrum access"> dynamic spectrum access</a>, <a href="https://publications.waset.org/abstracts/search?q=spectrum%20management" title=" spectrum management"> spectrum management</a>, <a href="https://publications.waset.org/abstracts/search?q=spectrum%20sharing" title=" spectrum sharing"> spectrum sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20mesh%20networks" title=" wireless mesh networks"> wireless mesh networks</a> </p> <a href="https://publications.waset.org/abstracts/12925/spectrum-allocation-using-cognitive-radio-in-wireless-mesh-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12925.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">528</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">67</span> Exploring the Power of Words: Domesticating the Competence/Competency Concept in Ugandan Organisations </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=John%20C.%20Munene">John C. Munene</a>, <a href="https://publications.waset.org/abstracts/search?q=Florence%20Nansubuga"> Florence Nansubuga</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The study set out to examine a number of theories that have directly or indirectly implied that words are potent but that the potency depends on the context or practice in which they are utilised. The theories include the Freudian theory of Cathexis, which directly suggests that ambiguous events when named become potent as well as the word that is used to name them. We briefly examine Psychological differentiation, which submit that ambiguity is often a result of failure to distinguish figure from ground. The investigate Prospecting Theory, which suggests that in a situation when people have to make decisions, they have options to utilise intuition or reasoned judgment. It suggests that more often than not, the tendency is to utilise intuition especially when generic heuristics such as representativeness and similarity are available. That usage of these heuristics may depend on lack of a salience or accessibility of the situation due to ambiguity. We also examine Activity Theory, which proposes that meaning of words emerge directly and dialectically from the activities in which they are used. The paper argues that the power of words will depend on either or all of the theories mentioned above. To examine this general proposition we test the utilization of a generic competence framework in a local setting. The assumption is that generic frameworks are inherently ambiguous and lack the potency normally associated with the competence concept in the management of human resources. A number of case studies provide initial supporting evidence for the general proposition. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=competence" title="competence">competence</a>, <a href="https://publications.waset.org/abstracts/search?q=meaning" title=" meaning"> meaning</a>, <a href="https://publications.waset.org/abstracts/search?q=operationalisation" title=" operationalisation"> operationalisation</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20of%20words" title=" power of words"> power of words</a> </p> <a href="https://publications.waset.org/abstracts/44977/exploring-the-power-of-words-domesticating-the-competencecompetency-concept-in-ugandan-organisations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/44977.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">412</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">66</span> Vehicle Routing Problem with Mixed Fleet of Conventional and Heterogenous Electric Vehicles and Time Dependent Charging Costs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ons%20Sassi">Ons Sassi</a>, <a href="https://publications.waset.org/abstracts/search?q=Wahiba%20Ramdane%20Cherif-Khettaf"> Wahiba Ramdane Cherif-Khettaf</a>, <a href="https://publications.waset.org/abstracts/search?q=Ammar%20Oulamara"> Ammar Oulamara</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we consider a new real-life Heterogenous Electric Vehicle Routing Problem with Time Dependant Charging Costs and a Mixed Fleet (HEVRP-TDMF), in which a set of geographically scattered customers have to be served by a mixed fleet of vehicles composed of a heterogenous fleet of Electric Vehicles (EVs), having different battery capacities and operating costs, and Conventional Vehicles (CVs). We include the possibility of charging EVs in the available charging stations during the routes in order to serve all customers. Each charging station offers charging service with a known technology of chargers and time-dependent charging costs. Charging stations are also subject to operating time windows constraints. EVs are not necessarily compatible with all available charging technologies and a partial charging is allowed. Intermittent charging at the depot is also allowed provided that constraints related to the electricity grid are satisfied. The objective is to minimize the number of employed vehicles and then minimize the total travel and charging costs. In this study, we present a Mixed Integer Programming Model and develop a Charging Routing Heuristic and a Local Search Heuristic based on the Inject-Eject routine with three different insertion strategies. All heuristics are tested on real data instances. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=charging%20problem" title="charging problem">charging problem</a>, <a href="https://publications.waset.org/abstracts/search?q=electric%20vehicle" title=" electric vehicle"> electric vehicle</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristics" title=" heuristics"> heuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20search" title=" local search"> local search</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=routing%20problem" title=" routing problem"> routing problem</a> </p> <a href="https://publications.waset.org/abstracts/19969/vehicle-routing-problem-with-mixed-fleet-of-conventional-and-heterogenous-electric-vehicles-and-time-dependent-charging-costs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19969.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">463</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">65</span> Case Study Analysis of 2017 European Railway Traffic Management Incident: The Application of System for Investigation of Railway Interfaces Methodology</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sanjeev%20Kumar%20Appicharla">Sanjeev Kumar Appicharla</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the results of the modelling and analysis of the European Railway Traffic Management (ERTMS) safety-critical incident to raise awareness of biases in the systems engineering process on the Cambrian Railway in the UK using the RAIB 17/2019 as a primary input. The RAIB, the UK independent accident investigator, published the Report- RAIB 17/2019 giving the details of their investigation of the focal event in the form of immediate cause, causal factors, and underlying factors and recommendations to prevent a repeat of the safety-critical incident on the Cambrian Line. The Systems for Investigation of Railway Interfaces (SIRI) is the methodology used to model and analyze the safety-critical incident. The SIRI methodology uses the Swiss Cheese Model to model the incident and identify latent failure conditions (potentially less than adequate conditions) by means of the management oversight and risk tree technique. The benefits of the systems for investigation of railway interfaces methodology (SIRI) are threefold: first is that it incorporates the “Heuristics and Biases” approach advanced by 2002 Nobel laureate in Economic Sciences, Prof Daniel Kahneman, in the management oversight and risk tree technique to identify systematic errors. Civil engineering and programme management railway professionals are aware of the role “optimism bias” plays in programme cost overruns and are aware of bow tie (fault and event tree) model-based safety risk modelling techniques. However, the role of systematic errors due to “Heuristics and Biases” is not appreciated as yet. This overcomes the problems of omission of human and organizational factors from accident analysis. Second, the scope of the investigation includes all levels of the socio-technical system, including government, regulatory, railway safety bodies, duty holders, signaling firms and transport planners, and front-line staff such that lessons are learned at the decision making and implementation level as well. Third, the author’s past accident case studies are supplemented with research pieces of evidence drawn from the practitioner's and academic researchers’ publications as well. This is to discuss the role of system thinking to improve the decision-making and risk management processes and practices in the IEC 15288 systems engineering standard and in the industrial context such as the GB railways and artificial intelligence (AI) contexts as well. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=accident%20analysis" title="accident analysis">accident analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=AI%20algorithm%20internal%20audit" title=" AI algorithm internal audit"> AI algorithm internal audit</a>, <a href="https://publications.waset.org/abstracts/search?q=bounded%20rationality" title=" bounded rationality"> bounded rationality</a>, <a href="https://publications.waset.org/abstracts/search?q=Byzantine%20failures" title=" Byzantine failures"> Byzantine failures</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristics%20and%20biases%20approach" title=" heuristics and biases approach"> heuristics and biases approach</a> </p> <a href="https://publications.waset.org/abstracts/137535/case-study-analysis-of-2017-european-railway-traffic-management-incident-the-application-of-system-for-investigation-of-railway-interfaces-methodology" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/137535.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">188</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">64</span> The Emancipatory Methodological Approach to the Organizational Problems Management</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Slavica%20P.%20Petrovic">Slavica P. Petrovic</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the key dimensions of management problems in organizations refers to the relations between stakeholders. The management problems that are characterized by conflict and coercion, in which participants do not agree on the ends and means, in which different groups, i.e., individuals, strive to – using the power they have – impose on others their favoured strategy and decisions represent the relevant research subject. Creatively managing the coercive problems in organizations, in which the sources of power can be identified, implies the emancipatory paradigm and the use of corresponding systems methodology. The main research aim is to critically reassess the theoretical foundations and methodological and methodical development of Critical Systems Heuristics (CSH) – as a valid representative of the emancipatory paradigm – in order to determine the conditions, ways, and achievements of its application in managing the coercive problems in organizations. The basic hypothesis is that CSH, as the emancipatory methodology, given its own theoretical foundations and methodological-methodical development, can be employed in a scientifically based and practically useful manner in creative addressing the coercive problems. The scientific instrumentarium corresponding to this research aim is critical systems thinking with its three key commitments to: a) Critical awareness of the strengths and weaknesses of each research instrument (theory, methodology, method, technique, model) for structuring the problem situations in organizations, b) Improvement of managing the coercive problems in organizations, and c) Pluralism – respect the different perceptions and interpretations of problem situations, and enable the combined use of research instruments. The relevant research result is that CSH – considering its theoretical foundations, methodological and methodical development – enables to reveal the normative content of the proposed or existing designs of organizational systems. Accordingly, it can be concluded that through the use of critically heuristic categories and dialectical debate between those involved and those affected by the designs, but who are not included in designing organizational systems, CSH endeavours to – in the application – support the process of improving position of all stakeholders. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=coercion%20and%20conflict%20in%20organizations" title="coercion and conflict in organizations">coercion and conflict in organizations</a>, <a href="https://publications.waset.org/abstracts/search?q=creative%20management" title=" creative management"> creative management</a>, <a href="https://publications.waset.org/abstracts/search?q=critical%20systems%20heuristics" title=" critical systems heuristics"> critical systems heuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=the%20emancipatory%20systems%20methodology" title=" the emancipatory systems methodology"> the emancipatory systems methodology</a> </p> <a href="https://publications.waset.org/abstracts/24410/the-emancipatory-methodological-approach-to-the-organizational-problems-management" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24410.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">442</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">63</span> Advanced Technologies and Algorithms for Efficient Portfolio Selection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Konstantinos%20Liagkouras">Konstantinos Liagkouras</a>, <a href="https://publications.waset.org/abstracts/search?q=Konstantinos%20Metaxiotis"> Konstantinos Metaxiotis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we present a classification of the various technologies applied for the solution of the portfolio selection problem according to the discipline and the methodological framework followed. We provide a concise presentation of the emerged categories and we are trying to identify which methods considered obsolete and which lie at the heart of the debate. On top of that, we provide a comparative study of the different technologies applied for efficient portfolio construction and we suggest potential paths for future work that lie at the intersection of the presented techniques. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=portfolio%20selection" title="portfolio selection">portfolio selection</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization%20techniques" title=" optimization techniques"> optimization techniques</a>, <a href="https://publications.waset.org/abstracts/search?q=financial%20models" title=" financial models"> financial models</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic" title=" stochastic"> stochastic</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristics" title=" heuristics"> heuristics</a> </p> <a href="https://publications.waset.org/abstracts/31917/advanced-technologies-and-algorithms-for-efficient-portfolio-selection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31917.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">432</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">62</span> Dynamic Communications Mapping in NoC-Based Heterogeneous MPSoCs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20K.%20Benhaoua">M. K. Benhaoua</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20K.%20Singh"> A. K. Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20E.%20H.%20Benyamina"> A. E. H. Benyamina</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose heuristic for dynamic communications mapping that considers the placement of communications in order to optimize the overall performance. The mapping technique uses a newly proposed Algorithm to place communications between the tasks. The placement we propose of the communications leads to a better optimization of several performance metrics (time and energy consumption). Experimental results show that the proposed mapping approach provides significant performance improvements when compared to those using static routing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Multi-Processor%20Systems-on-Chip%20%28MPSoCs%29" title="Multi-Processor Systems-on-Chip (MPSoCs)">Multi-Processor Systems-on-Chip (MPSoCs)</a>, <a href="https://publications.waset.org/abstracts/search?q=Network-on-Chip%20%28NoC%29" title=" Network-on-Chip (NoC)"> Network-on-Chip (NoC)</a>, <a href="https://publications.waset.org/abstracts/search?q=heterogeneous%20architectures" title=" heterogeneous architectures"> heterogeneous architectures</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20mapping%20heuristics" title=" dynamic mapping heuristics"> dynamic mapping heuristics</a> </p> <a href="https://publications.waset.org/abstracts/22269/dynamic-communications-mapping-in-noc-based-heterogeneous-mpsocs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22269.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">533</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">61</span> A Combined Meta-Heuristic with Hyper-Heuristic Approach to Single Machine Production Scheduling Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=C.%20E.%20Nugraheni">C. E. Nugraheni</a>, <a href="https://publications.waset.org/abstracts/search?q=L.%20Abednego"> L. Abednego</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper is concerned with minimization of mean tardiness and flow time in a real single machine production scheduling problem. Two variants of genetic algorithm as meta-heuristic are combined with hyper-heuristic approach are proposed to solve this problem. These methods are used to solve instances generated with real world data from a company. Encouraging results are reported. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hyper-heuristics" title="hyper-heuristics">hyper-heuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=evolutionary%20algorithms" title=" evolutionary algorithms"> evolutionary algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=production%20scheduling" title=" production scheduling"> production scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=meta-heuristic" title=" meta-heuristic"> meta-heuristic</a> </p> <a href="https://publications.waset.org/abstracts/12732/a-combined-meta-heuristic-with-hyper-heuristic-approach-to-single-machine-production-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12732.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">381</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">60</span> Stochastic Repair and Replacement with a Single Repair Channel</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20A.%20Hajeeh">Mohammed A. Hajeeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper examines the behavior of a system, which upon failure is either replaced with certain probability p or imperfectly repaired with probability q. The system is analyzed using Kolmogorov's forward equations method; the analytical expression for the steady state availability is derived as an indicator of the system’s performance. It is found that the analysis becomes more complex as the number of imperfect repairs increases. It is also observed that the availability increases as the number of states and replacement probability increases. Using such an approach in more complex configurations and in dynamic systems is cumbersome; therefore, it is advisable to resort to simulation or heuristics. In this paper, an example is provided for demonstration. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=repairable%20models" title="repairable models">repairable models</a>, <a href="https://publications.waset.org/abstracts/search?q=imperfect" title=" imperfect"> imperfect</a>, <a href="https://publications.waset.org/abstracts/search?q=availability" title=" availability"> availability</a>, <a href="https://publications.waset.org/abstracts/search?q=exponential%20distribution" title=" exponential distribution"> exponential distribution</a> </p> <a href="https://publications.waset.org/abstracts/85531/stochastic-repair-and-replacement-with-a-single-repair-channel" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/85531.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">287</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">59</span> The Constraint of Machine Breakdown after a Match up Scheduling of Paper Manufacturing Industry</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=John%20M.%20Ikome">John M. Ikome</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the process of manufacturing, a machine breakdown usually forces a modified flow shop out of the prescribed state, this strategy reschedules part of the initial schedule to match up with the pre-schedule at some point with the objective to create a schedule that is reliable with the other production planning decisions like material flow, production and suppliers by utilizing a critical decision-making concept. We propose a rescheduling strategy and a match-up point that will have a determination procedure through an advanced feedback control mechanism to increase both the schedule quality and stability. These approaches are compared with alternative re-scheduling methods under different experimental settings. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=scheduling" title="scheduling">scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristics" title=" heuristics"> heuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=branch" title=" branch"> branch</a>, <a href="https://publications.waset.org/abstracts/search?q=integrated" title=" integrated"> integrated</a> </p> <a href="https://publications.waset.org/abstracts/50639/the-constraint-of-machine-breakdown-after-a-match-up-scheduling-of-paper-manufacturing-industry" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50639.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">408</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristics&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristics&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristics&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>