CINXE.COM
Search results for: heuristic
<!DOCTYPE html> <html lang="en" dir="ltr"> <head> <!-- Google tag (gtag.js) --> <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> <!-- Yandex.Metrika counter --> <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> <!-- /Yandex.Metrika counter --> <!-- Matomo --> <!-- End Matomo Code --> <title>Search results for: heuristic</title> <meta name="description" content="Search results for: heuristic"> <meta name="keywords" content="heuristic"> <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="heuristic" 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="heuristic"> <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> 246</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: heuristic</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">96</span> Loss Minimization by Distributed Generation Allocation in Radial Distribution System Using Crow Search Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Nageswara%20Rao">M. Nageswara Rao</a>, <a href="https://publications.waset.org/abstracts/search?q=V.%20S.%20N.%20K.%20Chaitanya"> V. S. N. K. Chaitanya</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20Amarendranath"> K. Amarendranath</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an optimal allocation and sizing of Distributed Generation (DG) in Radial Distribution Network (RDN) for total power loss minimization and enhances the voltage profile of the system. The two main important part of this study first is to find optimal allocation and second is optimum size of DG. The locations of DGs are identified by Analytical expressions and crow search algorithm has been employed to determine the optimum size of DG. In this study, the DG has been placed on single and multiple allocations.CSA is a meta-heuristic algorithm inspired by the intelligent behavior of the crows. Crows stores their excess food in different locations and memorizes those locations to retrieve it when it is needed. They follow each other to do thievery to obtain better food source. This analysis is tested on IEEE 33 bus and IEEE 69 bus under MATLAB environment and the results are compared with existing methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=analytical%20expression" title="analytical expression">analytical expression</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20generation" title=" distributed generation"> distributed generation</a>, <a href="https://publications.waset.org/abstracts/search?q=crow%20search%20algorithm" title=" crow search algorithm"> crow search algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20loss" title=" power loss"> power loss</a>, <a href="https://publications.waset.org/abstracts/search?q=voltage%20profile" title=" voltage profile"> voltage profile</a> </p> <a href="https://publications.waset.org/abstracts/104210/loss-minimization-by-distributed-generation-allocation-in-radial-distribution-system-using-crow-search-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/104210.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">235</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">95</span> Enhanced Imperialist Competitive Algorithm for the Cell Formation Problem Using Sequence Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20H.%20Borghei">S. H. Borghei</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Teymourian"> E. Teymourian</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Mobin"> M. Mobin</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20M.%20Komaki"> G. M. Komaki</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Sheikh"> S. Sheikh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Imperialist competitive algorithm (ICA) is a recent meta-heuristic method that is inspired by the social evolutions for solving NP-Hard problems. The ICA is a population based algorithm which has achieved a great performance in comparison to other meta-heuristics. This study is about developing enhanced ICA approach to solve the cell formation problem (CFP) using sequence data. In addition to the conventional ICA, an enhanced version of ICA, namely EICA, applies local search techniques to add more intensification aptitude and embed the features of exploration and intensification more successfully. Suitable performance measures are used to compare the proposed algorithms with some other powerful solution approaches in the literature. In the same way, for checking the proficiency of algorithms, forty test problems are presented. Five benchmark problems have sequence data, and other ones are based on 0-1 matrices modified to sequence based problems. Computational results elucidate the efficiency of the EICA in solving CFP problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cell%20formation%20problem" title="cell formation problem">cell formation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=group%20technology" title=" group technology"> group technology</a>, <a href="https://publications.waset.org/abstracts/search?q=imperialist%20competitive%20algorithm" title=" imperialist competitive algorithm"> imperialist competitive algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=sequence%20data" title=" sequence data"> sequence data</a> </p> <a href="https://publications.waset.org/abstracts/37026/enhanced-imperialist-competitive-algorithm-for-the-cell-formation-problem-using-sequence-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37026.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">455</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">94</span> Optimal Maintenance Policy for a Three-Unit System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Abbou">A. Abbou</a>, <a href="https://publications.waset.org/abstracts/search?q=V.%20Makis"> V. Makis</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Salari"> N. Salari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We study the condition-based maintenance (CBM) problem of a system subject to stochastic deterioration. The system is composed of three units (or modules): (i) Module 1 deterioration follows a Markov process with two operational states and one failure state. The operational states are partially observable through periodic condition monitoring. (ii) Module 2 deterioration follows a Gamma process with a known failure threshold. The deterioration level of this module is fully observable through periodic inspections. (iii) Only the operating age information is available of Module 3. The lifetime of this module has a general distribution. A CBM policy prescribes when to initiate a maintenance intervention and which modules to repair during intervention. Our objective is to determine the optimal CBM policy minimizing the long-run expected average cost of operating the system. This is achieved by formulating a Markov decision process (MDP) and developing the value iteration algorithm for solving the MDP. We provide numerical examples illustrating the cost-effectiveness of the optimal CBM policy through a comparison with heuristic policies commonly found in the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=reliability" title="reliability">reliability</a>, <a href="https://publications.waset.org/abstracts/search?q=maintenance%20optimization" title=" maintenance optimization"> maintenance optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=Markov%20decision%20process" title=" Markov decision process"> Markov decision process</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristics" title=" heuristics "> heuristics </a> </p> <a href="https://publications.waset.org/abstracts/84566/optimal-maintenance-policy-for-a-three-unit-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/84566.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">219</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">93</span> A Novel Meta-Heuristic Algorithm Based on Cloud Theory for Redundancy Allocation Problem under Realistic Condition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=H.%20Mousavi">H. Mousavi</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Sharifi"> M. Sharifi</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20Pourvaziri"> H. Pourvaziri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Redundancy Allocation Problem (RAP) is a well-known mathematical problem for modeling series-parallel systems. It is a combinatorial optimization problem which focuses on determining an optimal assignment of components in a system design. In this paper, to be more practical, we have considered the problem of redundancy allocation of series system with interval valued reliability of components. Therefore, during the search process, the reliabilities of the components are considered as a stochastic variable with a lower and upper bounds. In order to optimize the problem, we proposed a simulated annealing based on cloud theory (CBSAA). Also, the Monte Carlo simulation (MCS) is embedded to the CBSAA to handle the random variable components’ reliability. This novel approach has been investigated by numerical examples and the experimental results have shown that the CBSAA combining MCS is an efficient tool to solve the RAP of systems with interval-valued component reliabilities. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=redundancy%20allocation%20problem" title="redundancy allocation problem">redundancy allocation problem</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=cloud%20theory" title=" cloud theory"> cloud theory</a>, <a href="https://publications.waset.org/abstracts/search?q=monte%20carlo%20simulation" title=" monte carlo simulation"> monte carlo simulation</a> </p> <a href="https://publications.waset.org/abstracts/33681/a-novel-meta-heuristic-algorithm-based-on-cloud-theory-for-redundancy-allocation-problem-under-realistic-condition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33681.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">92</span> Deep learning with Noisy Labels : Learning True Labels as Discrete Latent Variable</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Azeddine%20El-Hassouny">Azeddine El-Hassouny</a>, <a href="https://publications.waset.org/abstracts/search?q=Chandrashekhar%20Meshram"> Chandrashekhar Meshram</a>, <a href="https://publications.waset.org/abstracts/search?q=Geraldin%20Nanfack"> Geraldin Nanfack</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years, learning from data with noisy labels (Label Noise) has been a major concern in supervised learning. This problem has become even more worrying in Deep Learning, where the generalization capabilities have been questioned lately. Indeed, deep learning requires a large amount of data that is generally collected by search engines, which frequently return data with unreliable labels. In this paper, we investigate the Label Noise in Deep Learning using variational inference. Our contributions are : (1) exploiting Label Noise concept where the true labels are learnt using reparameterization variational inference, while observed labels are learnt discriminatively. (2) the noise transition matrix is learnt during the training without any particular process, neither heuristic nor preliminary phases. The theoretical results shows how true label distribution can be learned by variational inference in any discriminate neural network, and the effectiveness of our approach is proved in several target datasets, such as MNIST and CIFAR32. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=label%20noise" title="label noise">label noise</a>, <a href="https://publications.waset.org/abstracts/search?q=deep%20learning" title=" deep learning"> deep learning</a>, <a href="https://publications.waset.org/abstracts/search?q=discrete%20latent%20variable" title=" discrete latent variable"> discrete latent variable</a>, <a href="https://publications.waset.org/abstracts/search?q=variational%20inference" title=" variational inference"> variational inference</a>, <a href="https://publications.waset.org/abstracts/search?q=MNIST" title=" MNIST"> MNIST</a>, <a href="https://publications.waset.org/abstracts/search?q=CIFAR32" title=" CIFAR32"> CIFAR32</a> </p> <a href="https://publications.waset.org/abstracts/142809/deep-learning-with-noisy-labels-learning-true-labels-as-discrete-latent-variable" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/142809.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">128</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">91</span> The Filipino Catholics in Japan: Traces and Cues of De/Ghettoization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Willard%20Enrique%20R.%20Macaraan">Willard Enrique R. Macaraan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Filipino Catholics' historicized narrative in the Church of Japan is found to be marked by contestation and negotiation. This paper aims to uncover the nuances of this marginality by utilizing Loic Wacquant's theorization of urban ghettos as well as Pierre Bourdieu's field ideation. In an attempt to illustrate the dynamics of the power-play that is implicit in any situation of marginality, the paper proposes a 'diamond-quadrant' (DQ) plane that may serve as a heuristic device for analytical purposes. This study is drawn from data collected and gathered through ten-month field research in selected church communities in the Archdiocese of Tokyo, Japan employing qualitative methodologies like participant observation, interviews, and document reviews. Reconstructing their historicized struggle since the late 70s, it is discovered that the arena of contested space has shifted from the right plane of "ghettoization" tendencies in the early years towards the left plane of "deghettoization" strategies in recent years. Still, a highly negotiated space, several situational factors, and emerging trends in and outside the ecclesial grounds have led to this major shift. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wacquant" title="Wacquant">Wacquant</a>, <a href="https://publications.waset.org/abstracts/search?q=ghetto" title=" ghetto"> ghetto</a>, <a href="https://publications.waset.org/abstracts/search?q=migration" title=" migration"> migration</a>, <a href="https://publications.waset.org/abstracts/search?q=religion" title=" religion"> religion</a> </p> <a href="https://publications.waset.org/abstracts/151055/the-filipino-catholics-in-japan-traces-and-cues-of-deghettoization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/151055.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">93</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">90</span> Uncertain Time-Cost Trade off Problems of Construction Projects Using Fuzzy Set Theory</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=V.%20S.%20S.%20Kumar">V. S. S. Kumar</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Vikram"> B. Vikram</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The development of effective decision support tools that adopted in the construction industry is vital in the world we live in today, since it can lead to substantial cost reduction and efficient resource consumption. Solving the time-cost trade off problems and its related variants is at the heart of scientific research for optimizing construction planning problems. In general, the classical optimization techniques have difficulties in dealing with TCT problems. One of the main reasons of their failure is that they can easily be entrapped in local minima. This paper presents an investigation on the application of meta-heuristic techniques to two particular variants of the time-cost trade of analysis, the time-cost trade off problem (TCT), and time-cost trade off optimization problem (TCO). In first problem, the total project cost should be minimized, and in the second problem, the total project cost and total project duration should be minimized simultaneously. Finally it is expected that, the optimization models developed in this paper will contribute significantly for efficient planning and management of construction project. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20sets" title="fuzzy sets">fuzzy sets</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertainty" title=" uncertainty"> uncertainty</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=time%20cost%20trade%20off%20problems" title=" time cost trade off problems"> time cost trade off problems</a> </p> <a href="https://publications.waset.org/abstracts/3994/uncertain-time-cost-trade-off-problems-of-construction-projects-using-fuzzy-set-theory" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3994.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">356</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">89</span> Building Scalable and Accurate Hybrid Kernel Mapping Recommender</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hina%20Iqbal">Hina Iqbal</a>, <a href="https://publications.waset.org/abstracts/search?q=Mustansar%20Ali%20Ghazanfar"> Mustansar Ali Ghazanfar</a>, <a href="https://publications.waset.org/abstracts/search?q=Sandor%20Szedmak"> Sandor Szedmak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recommender systems uses artificial intelligence practices for filtering obscure information and can predict if a user likes a specified item. Kernel mapping Recommender systems have been proposed which are accurate and state-of-the-art algorithms and resolve recommender system’s design objectives such as; long tail, cold-start, and sparsity. The aim of research is to propose hybrid framework that can efficiently integrate different versions— namely item-based and user-based KMR— of KMR algorithm. We have proposed various heuristic algorithms that integrate different versions of KMR (into a unified framework) resulting in improved accuracy and elimination of problems associated with conventional recommender system. We have tested our system on publically available movies dataset and benchmark with KMR. The results (in terms of accuracy, precision, recall, F1 measure and ROC metrics) reveal that the proposed algorithm is quite accurate especially under cold-start and sparse scenarios. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kernel%20Mapping%20Recommender%20Systems" title="Kernel Mapping Recommender Systems">Kernel Mapping Recommender Systems</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20recommender%20systems" title=" hybrid recommender systems"> hybrid recommender systems</a>, <a href="https://publications.waset.org/abstracts/search?q=cold%20start" title=" cold start"> cold start</a>, <a href="https://publications.waset.org/abstracts/search?q=sparsity" title=" sparsity"> sparsity</a>, <a href="https://publications.waset.org/abstracts/search?q=long%20tail" title=" long tail"> long tail</a> </p> <a href="https://publications.waset.org/abstracts/59766/building-scalable-and-accurate-hybrid-kernel-mapping-recommender" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59766.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">338</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">88</span> Heuristic of Style Transfer for Real-Time Detection or Classification of Weather Conditions from Camera Images</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hamed%20Ouattara">Hamed Ouattara</a>, <a href="https://publications.waset.org/abstracts/search?q=Pierre%20Duthon"> Pierre Duthon</a>, <a href="https://publications.waset.org/abstracts/search?q=Fr%C3%A9d%C3%A9ric%20Bernardin"> Frédéric Bernardin</a>, <a href="https://publications.waset.org/abstracts/search?q=Omar%20Ait%20Aider"> Omar Ait Aider</a>, <a href="https://publications.waset.org/abstracts/search?q=Pascal%20Salmane"> Pascal Salmane</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this article, we present three neural network architectures for real-time classification of weather conditions (sunny, rainy, snowy, foggy) from images. Inspired by recent advances in style transfer, two of these architectures -Truncated ResNet50 and Truncated ResNet50 with Gram Matrix and Attention- surpass the state of the art and demonstrate re-markable generalization capability on several public databases, including Kaggle (2000 images), Kaggle 850 images, MWI (1996 images) [1], and Image2Weather [2]. Although developed for weather detection, these architectures are also suitable for other appearance-based classification tasks, such as animal species recognition, texture classification, disease detection in medical images, and industrial defect identification. We illustrate these applications in the section “Applications of Our Models to Other Tasks” with the “SIIM-ISIC Melanoma Classification Challenge 2020” [3]. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=weather%20simulation" title="weather simulation">weather simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=weather%20measurement" title=" weather measurement"> weather measurement</a>, <a href="https://publications.waset.org/abstracts/search?q=weather%20classification" title=" weather classification"> weather classification</a>, <a href="https://publications.waset.org/abstracts/search?q=weather%20detection" title=" weather detection"> weather detection</a>, <a href="https://publications.waset.org/abstracts/search?q=style%20transfer" title=" style transfer"> style transfer</a>, <a href="https://publications.waset.org/abstracts/search?q=Pix2Pix" title=" Pix2Pix"> Pix2Pix</a>, <a href="https://publications.waset.org/abstracts/search?q=CycleGAN" title=" CycleGAN"> CycleGAN</a>, <a href="https://publications.waset.org/abstracts/search?q=CUT" title=" CUT"> CUT</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20style%20transfer" title=" neural style transfer"> neural style transfer</a> </p> <a href="https://publications.waset.org/abstracts/194615/heuristic-of-style-transfer-for-real-time-detection-or-classification-of-weather-conditions-from-camera-images" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/194615.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">3</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> Rumour Containment Using Monitor Placement and Truth Propagation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amrah%20Maryam">Amrah Maryam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The emergence of online social networks (OSNs) has transformed the way we pursue and share information. On the one hand, OSNs provide great ease for the spreading of positive information while, on the other hand, they may also become a channel for the spreading of malicious rumors and misinformation throughout the social network. Thus, to assure the trustworthiness of OSNs to its users, it is of vital importance to detect the misinformation propagation in the network by placing network monitors. In this paper, we aim to place monitors near the suspected nodes with the intent to limit the diffusion of misinformation in the social network, and then we also detect the most significant nodes in the network for propagating true information in order to minimize the effect of already diffused misinformation. Thus, we initiate two heuristic monitor placement using articulation points and truth propagation using eigenvector centrality. Furthermore, to provide real-time workings of the system, we integrate both the monitor placement and truth propagation entities as well. To signify the effectiveness of the approaches, we have carried out the experiment and evaluation of Stanford datasets of online social networks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=online%20social%20networks" title="online social networks">online social networks</a>, <a href="https://publications.waset.org/abstracts/search?q=monitor%20placement" title=" monitor placement"> monitor placement</a>, <a href="https://publications.waset.org/abstracts/search?q=independent%20cascade%20model" title=" independent cascade model"> independent cascade model</a>, <a href="https://publications.waset.org/abstracts/search?q=spread%20of%20misinformation" title=" spread of misinformation"> spread of misinformation</a> </p> <a href="https://publications.waset.org/abstracts/113743/rumour-containment-using-monitor-placement-and-truth-propagation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/113743.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">161</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> Series-Parallel Systems Reliability Optimization Using Genetic Algorithm and Statistical Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Essa%20Abrahim%20Abdulgader%20Saleem">Essa Abrahim Abdulgader Saleem</a>, <a href="https://publications.waset.org/abstracts/search?q=Thien-My%20Dao"> Thien-My Dao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The main objective of this paper is to optimize series-parallel system reliability using Genetic Algorithm (GA) and statistical analysis; considering system reliability constraints which involve the redundant numbers of selected components, total cost, and total weight. To perform this work, firstly the mathematical model which maximizes system reliability subject to maximum system cost and maximum system weight constraints is presented; secondly, a statistical analysis is used to optimize GA parameters, and thirdly GA is used to optimize series-parallel systems reliability. The objective is to determine the strategy choosing the redundancy level for each subsystem to maximize the overall system reliability subject to total cost and total weight constraints. Finally, the series-parallel system case study reliability optimization results are showed, and comparisons with the other previous results are presented to demonstrate the performance of our GA. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=reliability" title="reliability">reliability</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=meta-heuristic" title=" meta-heuristic"> meta-heuristic</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=redundancy" title=" redundancy"> redundancy</a> </p> <a href="https://publications.waset.org/abstracts/55689/series-parallel-systems-reliability-optimization-using-genetic-algorithm-and-statistical-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55689.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">337</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> Basic Modal Displacements (BMD) for Optimizing the Buildings Subjected to Earthquakes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seyed%20Sadegh%20Naseralavi">Seyed Sadegh Naseralavi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohsen%20Khatibinia"> Mohsen Khatibinia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In structural optimizations through meta-heuristic algorithms, analyses of structures are performed for many times. For this reason, performing the analyses in a time saving way is precious. The importance of the point is more accentuated in time-history analyses which take much time. To this aim, peak picking methods also known as spectrum analyses are generally utilized. However, such methods do not have the required accuracy either done by square root of sum of squares (SRSS) or complete quadratic combination (CQC) rules. The paper presents an efficient technique for evaluating the dynamic responses during the optimization process with high speed and accuracy. In the method, first by using a static equivalent of the earthquake, an initial design is obtained. Then, the displacements in the modal coordinates are achieved. The displacements are herein called basic modal displacements (MBD). For each new design of the structure, the responses can be derived by well scaling each of the MBD along the time and amplitude and superposing them together using the corresponding modal matrices. To illustrate the efficiency of the method, an optimization problems is studied. The results show that the proposed approach is a suitable replacement for the conventional time history and spectrum analyses in such problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=basic%20modal%20displacements" title="basic modal displacements">basic modal displacements</a>, <a href="https://publications.waset.org/abstracts/search?q=earthquake" title=" earthquake"> earthquake</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=spectrum" title=" spectrum"> spectrum</a> </p> <a href="https://publications.waset.org/abstracts/29240/basic-modal-displacements-bmd-for-optimizing-the-buildings-subjected-to-earthquakes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29240.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">361</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> Multiloop Fractional Order PID Controller Tuned Using Cuckoo Algorithm for Two Interacting Conical Tank Process</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=U.%20Sabura%20Banu">U. Sabura Banu</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20K.%20Lakshmanaprabu"> S. K. Lakshmanaprabu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The improvement of meta-heuristic algorithm encourages control engineer to design an optimal controller for industrial process. Most real-world industrial processes are non-linear multivariable process with high interaction. Even in sub-process unit, thousands of loops are available mostly interacting in nature. Optimal controller design for such process are still challenging task. Closed loop controller design by multiloop PID involves a tedious procedure by performing interaction study and then PID auto-tuning the loop with higher interaction. Finally, detuning the controller to accommodate the effects of the other process variables. Fractional order PID controllers are replacing integer order PID controllers recently. Design of Multiloop Fractional Order (MFO) PID controller is still more complicated. Cuckoo algorithm, a swarm intelligence technique is used to optimally tune the MFO PID controller with easiness minimizing Integral Time Absolute Error. The closed loop performance is tested under servo, regulatory and servo-regulatory conditions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Cuckoo%20algorithm" title="Cuckoo algorithm">Cuckoo algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=mutliloop%20fractional%20order%20PID%20controller" title=" mutliloop fractional order PID controller"> mutliloop fractional order PID controller</a>, <a href="https://publications.waset.org/abstracts/search?q=two%20Interacting%20conical%20tank%20process" title=" two Interacting conical tank process"> two Interacting conical tank process</a> </p> <a href="https://publications.waset.org/abstracts/21246/multiloop-fractional-order-pid-controller-tuned-using-cuckoo-algorithm-for-two-interacting-conical-tank-process" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21246.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">499</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> An Efficient Stud Krill Herd Framework for Solving Non-Convex Economic Dispatch Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bachir%20Bentouati">Bachir Bentouati</a>, <a href="https://publications.waset.org/abstracts/search?q=Lakhdar%20Chaib"> Lakhdar Chaib</a>, <a href="https://publications.waset.org/abstracts/search?q=Saliha%20Chettih"> Saliha Chettih</a>, <a href="https://publications.waset.org/abstracts/search?q=Gai-Ge%20Wang"> Gai-Ge Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The problem of economic dispatch (ED) is the basic problem of power framework, its main goal is to find the most favorable generation dispatch to generate each unit, reduce the whole power generation cost, and meet all system limitations. A heuristic algorithm, recently developed called Stud Krill Herd (SKH), has been employed in this paper to treat non-convex ED problems. The proposed KH has been modified using Stud selection and crossover (SSC) operator, to enhance the solution quality and avoid local optima. We are demonstrated SKH effects in two case study systems composed of 13-unit and 40-unit test systems to verify its performance and applicability in solving the ED problems. In the above systems, SKH can successfully obtain the best fuel generator and distribute the load requirements for the online generators. The results showed that the use of the proposed SKH method could reduce the total cost of generation and optimize the fulfillment of the load requirements. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=stud%20krill%20herd" title="stud krill herd">stud krill herd</a>, <a href="https://publications.waset.org/abstracts/search?q=economic%20dispatch" title=" economic dispatch"> economic dispatch</a>, <a href="https://publications.waset.org/abstracts/search?q=crossover" title=" crossover"> crossover</a>, <a href="https://publications.waset.org/abstracts/search?q=stud%20selection" title=" stud selection"> stud selection</a>, <a href="https://publications.waset.org/abstracts/search?q=valve-point%20effect" title=" valve-point effect"> valve-point effect</a> </p> <a href="https://publications.waset.org/abstracts/78035/an-efficient-stud-krill-herd-framework-for-solving-non-convex-economic-dispatch-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/78035.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">198</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> A Novel Solution Methodology for Transit Route Network Design Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ghada%20Moussa">Ghada Moussa</a>, <a href="https://publications.waset.org/abstracts/search?q=Mamoud%20Owais"> Mamoud Owais</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Transit Route Network Design Problem (TrNDP) is the most important component in Transit planning, in which the overall cost of the public transportation system highly depends on it. The main purpose of this study is to develop a novel solution methodology for the TrNDP, which goes beyond pervious traditional sophisticated approaches. The novelty of the solution methodology, adopted in this paper, stands on the deterministic operators which are tackled to construct bus routes. The deterministic manner of the TrNDP solution relies on using linear and integer mathematical formulations that can be solved exactly with their standard solvers. The solution methodology has been tested through Mandl’s benchmark network problem. The test results showed that the methodology developed in this research is able to improve the given network solution in terms of number of constructed routes, direct transit service coverage, transfer directness and solution reliability. Although the set of routes resulted from the methodology would stand alone as a final efficient solution for TrNDP, it could be used as an initial solution for meta-heuristic procedures to approach global optimal. Based on the presented methodology, a more robust network optimization tool would be produced for public transportation planning purposes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=integer%20programming" title="integer programming">integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=transit%20route%20design" title=" transit route design"> transit route design</a>, <a href="https://publications.waset.org/abstracts/search?q=transportation" title=" transportation"> transportation</a>, <a href="https://publications.waset.org/abstracts/search?q=urban%20planning" title=" urban planning"> urban planning</a> </p> <a href="https://publications.waset.org/abstracts/5927/a-novel-solution-methodology-for-transit-route-network-design-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5927.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">273</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> Development of a Digital Healthcare Intervention to Reduce Digital and Healthcare Inequality in Rural Communities with a Focus on Hypertensive Management</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Festus%20Adedoyin">Festus Adedoyin</a>, <a href="https://publications.waset.org/abstracts/search?q=Nana%20Mbeah%20Otoo"> Nana Mbeah Otoo</a>, <a href="https://publications.waset.org/abstracts/search?q=Sofia%20Meacham"> Sofia Meacham</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Hypertension is one of the main health issues in Ghana, where prevalence is higher in rural than in urban areas. This is due to the challenges rural areas have in accessing technology and healthcare services for hypertension control. This study's goal is to create a digital healthcare solution to alleviate this inequality. Through an analysis of current technology and problems, using the ring onion methodology, the study determined the needs for the intervention and evaluated healthcare disparities. An online application with teleconsultation capabilities, reminder mechanisms, and clinical decision support is part of the suggested solution. In outlying areas, mobile clinics in containers with the required equipment will be established. Heuristic evaluation and think-aloud sessions were used to assess the prototype's usability and navigational problems. This study highlights the need to develop digital health interventions to help manage hypertension in rural locations and decrease healthcare disparities. To develop and improve digital healthcare solutions for rural areas worldwide and in Ghana, this study might be used as a tool for future research. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digital%20health" title="digital health">digital health</a>, <a href="https://publications.waset.org/abstracts/search?q=health%20inequalities" title=" health inequalities"> health inequalities</a>, <a href="https://publications.waset.org/abstracts/search?q=hypertension%20management" title=" hypertension management"> hypertension management</a>, <a href="https://publications.waset.org/abstracts/search?q=rural%20areas" title=" rural areas"> rural areas</a> </p> <a href="https://publications.waset.org/abstracts/168319/development-of-a-digital-healthcare-intervention-to-reduce-digital-and-healthcare-inequality-in-rural-communities-with-a-focus-on-hypertensive-management" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/168319.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">108</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> Analogical Reasoning on Preschoolers’ Linguistic Performance</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yenie%20Norambuena">Yenie Norambuena</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Analogical reasoning is a cognitive process that consists of structured comparisons of mental representations and scheme construction. Because of its heuristic function, it is ubiquitous in cognition and could play an important role in language development. The use of analogies is expressed early in children and this behavior is also reflected in language, suggesting a possible way to understand the complex links between thought and language. The current research examines factors of verbal and non-verbal reasoning that should be taken into consideration in the study of language development for their relations and predictive value. The study was conducted with 48 Chilean preschoolers (Spanish speakers) from 4 to 6-year-old. We assessed children’s verbal analogical reasoning, non-verbal analogical reasoning and linguistics skills (Listening Comprehension, Phonemic awareness, Alphabetic principle, Syllabification, Lexical repetition and Lexical decision). The results evidenced significant correlations between analogical reasoning factors and linguistic skills and they can predict linguistic performance mainly on oral comprehension, lexical decision and phonological skills. These findings suggest a fundamental interrelationship between analogical reasoning and linguistic performance on children’s and points to the need to consider this cognitive process in comprehensive theories of children's language development. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=verbal%20analogical%20reasoning" title="verbal analogical reasoning">verbal analogical reasoning</a>, <a href="https://publications.waset.org/abstracts/search?q=non-verbal%20analogical%20reasoning" title=" non-verbal analogical reasoning"> non-verbal analogical reasoning</a>, <a href="https://publications.waset.org/abstracts/search?q=linguistic%20skills" title=" linguistic skills"> linguistic skills</a>, <a href="https://publications.waset.org/abstracts/search?q=language%20development" title=" language development"> language development</a> </p> <a href="https://publications.waset.org/abstracts/87500/analogical-reasoning-on-preschoolers-linguistic-performance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/87500.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">266</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> Applying Genetic Algorithm in Exchange Rate Models Determination</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mehdi%20Rostamzadeh">Mehdi Rostamzadeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Genetic Algorithms (GAs) are an adaptive heuristic search algorithm premised on the evolutionary ideas of natural selection and genetic. In this study, we apply GAs for fundamental and technical models of exchange rate determination in exchange rate market. In this framework, we estimated absolute and relative purchasing power parity, Mundell-Fleming, sticky and flexible prices (monetary models), equilibrium exchange rate and portfolio balance model as fundamental models and Auto Regressive (AR), Moving Average (MA), Auto-Regressive with Moving Average (ARMA) and Mean Reversion (MR) as technical models for Iranian Rial against European Union’s Euro using monthly data from January 1992 to December 2014. Then, we put these models into the genetic algorithm system for measuring their optimal weight for each model. These optimal weights have been measured according to four criteria i.e. R-Squared (R2), mean square error (MSE), mean absolute percentage error (MAPE) and root mean square error (RMSE).Based on obtained Results, it seems that for explaining of Iranian Rial against EU Euro exchange rate behavior, fundamental models are better than technical models. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=exchange%20rate" title="exchange rate">exchange rate</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=fundamental%20models" title=" fundamental models"> fundamental models</a>, <a href="https://publications.waset.org/abstracts/search?q=technical%20models" title=" technical models"> technical models</a> </p> <a href="https://publications.waset.org/abstracts/47210/applying-genetic-algorithm-in-exchange-rate-models-determination" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47210.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">273</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> Hyperspectral Image Classification Using Tree Search Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shreya%20Pare">Shreya Pare</a>, <a href="https://publications.waset.org/abstracts/search?q=Parvin%20Akhter"> Parvin Akhter</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Remotely sensing image classification becomes a very challenging task owing to the high dimensionality of hyperspectral images. The pixel-wise classification methods fail to take the spatial structure information of an image. Therefore, to improve the performance of classification, spatial information can be integrated into the classification process. In this paper, the multilevel thresholding algorithm based on a modified fuzzy entropy function is used to perform the segmentation of hyperspectral images. The fuzzy parameters of the MFE function have been optimized by using a new meta-heuristic algorithm based on the Tree-Search algorithm. The segmented image is classified by a large distribution machine (LDM) classifier. Experimental results are shown on a hyperspectral image dataset. The experimental outputs indicate that the proposed technique (MFE-TSA-LDM) achieves much higher classification accuracy for hyperspectral images when compared to state-of-art classification techniques. The proposed algorithm provides accurate segmentation and classification maps, thus becoming more suitable for image classification with large spatial structures. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=classification" title="classification">classification</a>, <a href="https://publications.waset.org/abstracts/search?q=hyperspectral%20images" title=" hyperspectral images"> hyperspectral images</a>, <a href="https://publications.waset.org/abstracts/search?q=large%20distribution%20margin" title=" large distribution margin"> large distribution margin</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20fuzzy%20entropy%20function" title=" modified fuzzy entropy function"> modified fuzzy entropy function</a>, <a href="https://publications.waset.org/abstracts/search?q=multilevel%20thresholding" title=" multilevel thresholding"> multilevel thresholding</a>, <a href="https://publications.waset.org/abstracts/search?q=tree%20search%20algorithm" title=" tree search algorithm"> tree search algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=hyperspectral%20image%20classification%20using%20tree%20search%20algorithm" title=" hyperspectral image classification using tree search algorithm"> hyperspectral image classification using tree search algorithm</a> </p> <a href="https://publications.waset.org/abstracts/143284/hyperspectral-image-classification-using-tree-search-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/143284.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">177</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> Hybridized Simulated Annealing with Chemical Reaction Optimization for Solving to Sequence Alignment Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ernesto%20Linan">Ernesto Linan</a>, <a href="https://publications.waset.org/abstracts/search?q=Linda%20Cruz"> Linda Cruz</a>, <a href="https://publications.waset.org/abstracts/search?q=Lucero%20Becerra"> Lucero Becerra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a new hybridized algorithm based on Chemical Reaction Optimization and Simulated Annealing is proposed to solve the alignment sequence Problem. The Chemical Reaction Optimization is a population-based meta-heuristic algorithm based on the principles of a chemical reaction. Simulated Annealing is applied to solve a large number of combinatorial optimization problems of general-purpose. In this paper, we propose hybridization between Chemical Reaction Optimization algorithm and Simulated Annealing in order to solve the Sequence Alignment Problem. An initial population of molecules is defined at beginning of the proposed algorithm, where each molecule represents a sequence alignment problem. In order to simulate inter-molecule collisions, the process of Chemical Reaction is placed inside the Metropolis Cycle at certain values of temperature. Inside this cycle, change of molecules is done due to collisions; some molecules are accepted by applying Boltzmann probability. The results with the hybrid scheme are better than the results obtained separately. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=chemical%20reaction%20optimization" title="chemical reaction optimization">chemical reaction optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=sequence%20alignment%20problem" title=" sequence alignment problem"> sequence alignment problem</a>, <a href="https://publications.waset.org/abstracts/search?q=simulated%20annealing%20algorithm" title=" simulated annealing algorithm"> simulated annealing algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristics" title=" metaheuristics"> metaheuristics</a> </p> <a href="https://publications.waset.org/abstracts/136324/hybridized-simulated-annealing-with-chemical-reaction-optimization-for-solving-to-sequence-alignment-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/136324.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">211</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> Truck Scheduling Problem in a Cross-Dock Centre with Fixed Due Dates</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohsen%20S.%20Sajadieha">Mohsen S. Sajadieha</a>, <a href="https://publications.waset.org/abstracts/search?q=Danyar%20Molavia"> Danyar Molavia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a truck scheduling problem is investigated at a two-touch cross-docking center with due dates for outbound trucks as a hard constraint. The objective is to minimize the total cost comprising penalty and delivery cost of delayed shipments. The sequence of unloading shipments is considered and is assumed that shipments are sent to shipping dock doors immediately after unloading and a First-In-First-Out (FIFO) policy is considered for loading the shipments. A mixed integer programming model is developed for the proposed model. Two meta-heuristic algorithms including genetic algorithm (GA) and variable neighborhood search (VNS) are developed to solve the problem in medium and large sized scales. The numerical results show that increase in due dates for outbound trucks has a crucial impact on the reduction of penalty costs of delayed shipments. In addition, by increase the due dates, the improvement in the objective function arises on average in comparison with the situation that the cross-dock is multi-touch and shipments are sent to shipping dock doors only after unloading the whole inbound truck. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cross-docking" title="cross-docking">cross-docking</a>, <a href="https://publications.waset.org/abstracts/search?q=truck%20scheduling" title=" truck scheduling"> truck scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed%20due%20date" title=" fixed due date"> fixed due date</a>, <a href="https://publications.waset.org/abstracts/search?q=door%20assignment" title=" door assignment"> door assignment</a> </p> <a href="https://publications.waset.org/abstracts/32252/truck-scheduling-problem-in-a-cross-dock-centre-with-fixed-due-dates" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32252.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">404</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> One-Way Electric Vehicle Carsharing in an Urban Area with Vehicle-To-Grid Option</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Cem%20Isik%20Dogru">Cem Isik Dogru</a>, <a href="https://publications.waset.org/abstracts/search?q=Salih%20Tekin"> Salih Tekin</a>, <a href="https://publications.waset.org/abstracts/search?q=Kursad%20Derinkuyu"> Kursad Derinkuyu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Electric vehicle (EV) carsharing is an alternative method to tackle urban transportation problems. This method can be applied by several options. One of the options is the one-way carsharing, which allow an EV to be taken at a designated location and leaving it on another specified location customer desires. Although it may increase users’ satisfaction, the issues, namely, demand dissatisfaction, relocation of EVs and charging schedules, must be dealt with. Also, excessive electricity has to be stored in batteries of EVs. To cope with aforementioned issues, two-step mixed integer programming (MIP) model is proposed. In first step, the integer programming model is used to determine amount of electricity to be sold to the grid in terms of time periods for extra profit. Determined amounts are provided from the batteries of EVs. Also, this step works in day-ahead electricity markets with forecast of periodical electricity prices. In second step, other MIP model optimizes daily operations of one-way carsharing: charging-discharging schedules, relocation of EVs to serve more demand and renting to maximize the profit of EV fleet owner. Due to complexity of the models, heuristic methods are introduced to attain a feasible solution and different price information scenarios are compared. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=electric%20vehicles" title="electric vehicles">electric vehicles</a>, <a href="https://publications.waset.org/abstracts/search?q=forecasting" title=" forecasting"> forecasting</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20programming" title=" mixed integer programming"> mixed integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=one-way%20carsharing" title=" one-way carsharing "> one-way carsharing </a> </p> <a href="https://publications.waset.org/abstracts/113841/one-way-electric-vehicle-carsharing-in-an-urban-area-with-vehicle-to-grid-option" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/113841.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">130</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> An Extended Basic Period and Power-of-Two Policy for Economic Lot-Size Batch-Shipment Scheduling Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wen-Tsung%20Ho">Wen-Tsung Ho</a>, <a href="https://publications.waset.org/abstracts/search?q=Ku-Kuang%20Chang"> Ku-Kuang Chang</a>, <a href="https://publications.waset.org/abstracts/search?q=Hsin-Yuan%20Chang"> Hsin-Yuan Chang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, we consider an economic lot-size batch-shipment scheduling problem (ELBSP) with extended basic period (EBP) and power-of-two (PoT) policies. In this problem, the supplier using a single facility to manufacture multiple products and equally sized batches are then delivered by the supplier to buyers over an infinite planning horizon. Further, the extended basic period (EBP) and power-of-two (PoT) policy are utilized. Relaxing the production schedule converts the ELBSP to an economic lot-size batch-shipment problem (ELBP) with EBP and PoT policies, and a nonlinear integer programming model of the ELBP is constructed. Using the replenishment cycle division and recursive tightening methods, optimal solutions are then solved separately for each product. The sum of these optimal solutions is the lower bound of the ELBSP. A proposed heuristic method with polynomial complexity is then applied to figure out the near-optimal solutions of the ELBSP. Numerical example is presented to confirm the efficacy of the proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=economic%20lot-size%20scheduling%20problem" title="economic lot-size scheduling problem">economic lot-size scheduling problem</a>, <a href="https://publications.waset.org/abstracts/search?q=extended%20basic%20period" title=" extended basic period"> extended basic period</a>, <a href="https://publications.waset.org/abstracts/search?q=replenishment%20cycle%20division" title=" replenishment cycle division"> replenishment cycle division</a>, <a href="https://publications.waset.org/abstracts/search?q=recursive%20tightening" title=" recursive tightening"> recursive tightening</a>, <a href="https://publications.waset.org/abstracts/search?q=power-of-two" title=" power-of-two"> power-of-two</a> </p> <a href="https://publications.waset.org/abstracts/69870/an-extended-basic-period-and-power-of-two-policy-for-economic-lot-size-batch-shipment-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/69870.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">338</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> Resource-Constrained Assembly Line Balancing Problems with Multi-Manned Workstations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yin-Yann%20Chen">Yin-Yann Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Jia-Ying%20Li"> Jia-Ying Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Assembly line balancing problems can be categorized into one-sided, two-sided, and multi-manned ones by using the number of operators deployed at workstations. This study explores the balancing problem of a resource-constrained assembly line with multi-manned workstations. Resources include machines or tools in assembly lines such as jigs, fixtures, and hand tools. A mathematical programming model was developed to carry out decision-making and planning in order to minimize the numbers of workstations, resources, and operators for achieving optimal production efficiency. To improve the solution-finding efficiency, a genetic algorithm (GA) and a simulated annealing algorithm (SA) were designed and developed in this study to be combined with a practical case in car making. Results of the GA/SA and mathematics programming were compared to verify their validity. Finally, analysis and comparison were conducted in terms of the target values, production efficiency, and deployment combinations provided by the algorithms in order for the results of this study to provide references for decision-making on production deployment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=heuristic%20algorithms" title="heuristic algorithms">heuristic algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=line%20balancing" title=" line balancing"> line balancing</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-manned%20workstation" title=" multi-manned workstation"> multi-manned workstation</a>, <a href="https://publications.waset.org/abstracts/search?q=resource-constrained" title=" resource-constrained"> resource-constrained</a> </p> <a href="https://publications.waset.org/abstracts/82361/resource-constrained-assembly-line-balancing-problems-with-multi-manned-workstations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/82361.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">208</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> A Simple Adaptive Atomic Decomposition Voice Activity Detector Implemented by Matching Pursuit</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Thomas%20Bryan">Thomas Bryan</a>, <a href="https://publications.waset.org/abstracts/search?q=Veton%20Kepuska"> Veton Kepuska</a>, <a href="https://publications.waset.org/abstracts/search?q=Ivica%20Kostanic"> Ivica Kostanic</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A simple adaptive voice activity detector (VAD) is implemented using Gabor and gammatone atomic decomposition of speech for high Gaussian noise environments. Matching pursuit is used for atomic decomposition, and is shown to achieve optimal speech detection capability at high data compression rates for low signal to noise ratios. The most active dictionary elements found by matching pursuit are used for the signal reconstruction so that the algorithm adapts to the individual speakers dominant time-frequency characteristics. Speech has a high peak to average ratio enabling matching pursuit greedy heuristic of highest inner products to isolate high energy speech components in high noise environments. Gabor and gammatone atoms are both investigated with identical logarithmically spaced center frequencies, and similar bandwidths. The algorithm performs equally well for both Gabor and gammatone atoms with no significant statistical differences. The algorithm achieves 70% accuracy at a 0 dB SNR, 90% accuracy at a 5 dB SNR and 98% accuracy at a 20dB SNR using 30dB SNR as a reference for voice activity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=atomic%20decomposition" title="atomic decomposition">atomic decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=gabor" title=" gabor"> gabor</a>, <a href="https://publications.waset.org/abstracts/search?q=gammatone" title=" gammatone"> gammatone</a>, <a href="https://publications.waset.org/abstracts/search?q=matching%20pursuit" title=" matching pursuit"> matching pursuit</a>, <a href="https://publications.waset.org/abstracts/search?q=voice%20activity%20detection" title=" voice activity detection"> voice activity detection</a> </p> <a href="https://publications.waset.org/abstracts/27613/a-simple-adaptive-atomic-decomposition-voice-activity-detector-implemented-by-matching-pursuit" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27613.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">290</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 Model for Diagnosis and Prediction of Coronavirus Using Neural Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sajjad%20Baghernezhad">Sajjad Baghernezhad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Meta-heuristic and hybrid algorithms have high adeer in modeling medical problems. In this study, a neural network was used to predict covid-19 among high-risk and low-risk patients. This study was conducted to collect the applied method and its target population consisting of 550 high-risk and low-risk patients from the Kerman University of medical sciences medical center to predict the coronavirus. In this study, the memetic algorithm, which is a combination of a genetic algorithm and a local search algorithm, has been used to update the weights of the neural network and develop the accuracy of the neural network. The initial study showed that the accuracy of the neural network was 88%. After updating the weights, the memetic algorithm increased by 93%. For the proposed model, sensitivity, specificity, positive predictivity value, value/accuracy to 97.4, 92.3, 95.8, 96.2, and 0.918, respectively; for the genetic algorithm model, 87.05, 9.20 7, 89.45, 97.30 and 0.967 and for logistic regression model were 87.40, 95.20, 93.79, 0.87 and 0.916. Based on the findings of this study, neural network models have a lower error rate in the diagnosis of patients based on individual variables and vital signs compared to the regression model. The findings of this study can help planners and health care providers in signing programs and early diagnosis of COVID-19 or Corona. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=COVID-19" title="COVID-19">COVID-19</a>, <a href="https://publications.waset.org/abstracts/search?q=decision%20support%20technique" title=" decision support technique"> decision support technique</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=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=memetic%20algorithm" title=" memetic algorithm"> memetic algorithm</a> </p> <a href="https://publications.waset.org/abstracts/168424/a-model-for-diagnosis-and-prediction-of-coronavirus-using-neural-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/168424.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">66</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> A Metaheuristic Approach for Optimizing Perishable Goods Distribution</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bahare%20Askarian">Bahare Askarian</a>, <a href="https://publications.waset.org/abstracts/search?q=Suchithra%20Rajendran"> Suchithra Rajendran</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Maintaining the freshness and quality of perishable goods during distribution is a critical challenge for logistics companies. This study presents a comprehensive framework aimed at optimizing the distribution of perishable goods through a mathematical model of the Transportation Inventory Location Routing Problem (TILRP). The model incorporates the impact of product age on customer demand, addressing the complexities associated with inventory management and routing. To tackle this problem, we develop both simple and hybrid metaheuristic algorithms designed for small- and medium-scale scenarios. The hybrid algorithm combines Biogeographical Based Optimization (BBO) algorithms with local search techniques to enhance performance in small- and medium-scale scenarios, extending our approach to larger-scale challenges. Through extensive numerical simulations and sensitivity analyses across various scenarios, the performance of the proposed algorithms is evaluated, assessing their effectiveness in achieving optimal solutions. The results demonstrate that our algorithms significantly enhance distribution efficiency, offering valuable insights for logistics companies striving to improve their perishable goods supply chains. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=perishable%20goods" title="perishable goods">perishable goods</a>, <a href="https://publications.waset.org/abstracts/search?q=meta-heuristic%20algorithm" title=" meta-heuristic algorithm"> meta-heuristic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=vehicle%20problem" title=" vehicle problem"> vehicle problem</a>, <a href="https://publications.waset.org/abstracts/search?q=inventory%20models" title=" inventory models"> inventory models</a> </p> <a href="https://publications.waset.org/abstracts/191964/a-metaheuristic-approach-for-optimizing-perishable-goods-distribution" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/191964.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">19</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> Gariep Dam Basin Management for Satisfying Ecological Flow Requirements</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dimeji%20Abe">Dimeji Abe</a>, <a href="https://publications.waset.org/abstracts/search?q=Nonso%20Okoye"> Nonso Okoye</a>, <a href="https://publications.waset.org/abstracts/search?q=Gideon%20Ikpimi"> Gideon Ikpimi</a>, <a href="https://publications.waset.org/abstracts/search?q=Prince%20Idemudia"> Prince Idemudia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Multi-reservoir optimization operation has been a critical issue for river basin management. Water, as a scarce resource, is in high demand and the problems associated with the reservoir as its storage facility are enormous. The complexity in balancing the supply and demand of this prime resource has created the need to examine the best way to solve the problem using optimization techniques. The objective of this study is to evaluate the performance of the multi-objective meta-heuristic algorithm for the operation of Gariep Dam for satisfying ecological flow requirements. This study uses an evolutionary algorithm called backtrack search algorithm (BSA) to determine the best way to optimise the dam operations of hydropower production, flood control, and water supply without affecting the environmental flow requirement for the survival of aquatic bodies and sustain life downstream of the dam. To achieve this objective, the operations of the dam that corresponds to different tradeoffs between the objectives are optimized. The results indicate the best model from the algorithm that satisfies all the objectives without any constraint violation. It is expected that hydropower generation will be improved and more water will be available for ecological flow requirements with the use of the algorithm. This algorithm also provides farmers with more irrigation water as well to improve their business. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=BSA%20evolutionary%20algorithm" title="BSA evolutionary algorithm">BSA evolutionary algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristics" title=" metaheuristics"> metaheuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=river%20basin%20management" title=" river basin management"> river basin management</a> </p> <a href="https://publications.waset.org/abstracts/99471/gariep-dam-basin-management-for-satisfying-ecological-flow-requirements" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/99471.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">245</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> Advanced Hybrid Particle Swarm Optimization for Congestion and Power Loss Reduction in Distribution Networks with High Distributed Generation Penetration through Network Reconfiguration</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=C.%20Iraklis">C. Iraklis</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20Evmiridis"> G. Evmiridis</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Iraklis"> A. Iraklis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Renewable energy sources and distributed power generation units already have an important role in electrical power generation. A mixture of different technologies penetrating the electrical grid, adds complexity in the management of distribution networks. High penetration of distributed power generation units creates node over-voltages, huge power losses, unreliable power management, reverse power flow and congestion. This paper presents an optimization algorithm capable of reducing congestion and power losses, both described as a function of weighted sum. Two factors that describe congestion are being proposed. An upgraded selective particle swarm optimization algorithm (SPSO) is used as a solution tool focusing on the technique of network reconfiguration. The upgraded SPSO algorithm is achieved with the addition of a heuristic algorithm specializing in reduction of power losses, with several scenarios being tested. Results show significant improvement in minimization of losses and congestion while achieving very small calculation times. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=congestion" title="congestion">congestion</a>, <a href="https://publications.waset.org/abstracts/search?q=distribution%20networks" title=" distribution networks"> distribution networks</a>, <a href="https://publications.waset.org/abstracts/search?q=loss%20reduction" title=" loss reduction"> loss reduction</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=smart%20grid" title=" smart grid"> smart grid</a> </p> <a href="https://publications.waset.org/abstracts/91520/advanced-hybrid-particle-swarm-optimization-for-congestion-and-power-loss-reduction-in-distribution-networks-with-high-distributed-generation-penetration-through-network-reconfiguration" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/91520.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">445</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> Deciding Graph Non-Hamiltonicity via a Closure Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=E.%20R.%20Swart">E. R. Swart</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20J.%20Gismondi"> S. J. Gismondi</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20R.%20Swart"> N. R. Swart</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20E.%20Bell"> C. E. Bell</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present an heuristic algorithm that decides graph non-Hamiltonicity. All graphs are directed, each undirected edge regarded as a pair of counter directed arcs. Each of the n! Hamilton cycles in a complete graph on n+1 vertices is mapped to an n-permutation matrix P where p(u,i)=1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n+1. We first create exclusion set E by noting all arcs (u, v) not in G, sufficient to code precisely all cycles excluded from G i.e. cycles not in G use at least one arc not in G. Members are pairs of components of P, {p(u,i),p(v,i+1)}, i=1, n-1. A doubly stochastic-like relaxed LP formulation of the Hamilton cycle decision problem is constructed. Each {p(u,i),p(v,i+1)} in E is coded as variable q(u,i,v,i+1)=0 i.e. shrinks the feasible region. We then implement the Weak Closure Algorithm (WCA) that tests necessary conditions of a matching, together with Boolean closure to decide 0/1 variable assignments. Each {p(u,i),p(v,j)} not in E is tested for membership in E, and if possible, added to E (q(u,i,v,j)=0) to iteratively maximize |E|. If the WCA constructs E to be maximal, the set of all {p(u,i),p(v,j)}, then G is decided non-Hamiltonian. Only non-Hamiltonian G share this maximal property. Ten non-Hamiltonian graphs (10 through 104 vertices) and 2000 randomized 31 vertex non-Hamiltonian graphs are tested and correctly decided non-Hamiltonian. For Hamiltonian G, the complement of E covers a matching, perhaps useful in searching for cycles. We also present an example where the WCA fails. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hamilton%20cycle%20decision%20problem" title="Hamilton cycle decision problem">Hamilton cycle decision problem</a>, <a href="https://publications.waset.org/abstracts/search?q=computational%20complexity%20theory" title=" computational complexity theory"> computational complexity theory</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20theory" title=" graph theory"> graph theory</a>, <a href="https://publications.waset.org/abstracts/search?q=theoretical%20computer%20science" title=" theoretical computer science"> theoretical computer science</a> </p> <a href="https://publications.waset.org/abstracts/6023/deciding-graph-non-hamiltonicity-via-a-closure-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6023.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">373</span> </span> </div> </div> <ul class="pagination"> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristic&page=5" rel="prev">‹</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristic&page=1">1</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristic&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristic&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristic&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristic&page=5">5</a></li> <li class="page-item active"><span class="page-link">6</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristic&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristic&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristic&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=heuristic&page=7" rel="next">›</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>