CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: local minima problem</title> <meta name="description" content="Search results for: local minima problem"> <meta name="keywords" content="local minima problem"> <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="local minima problem" 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="local minima problem"> <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> 12074</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: local minima problem</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">12074</span> An IM-COH Algorithm Neural Network Optimization with Cuckoo Search Algorithm for Time Series Samples</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wullapa%20Wongsinlatam">Wullapa Wongsinlatam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Back propagation algorithm (BP) is a widely used technique in artificial neural network and has been used as a tool for solving the time series problems, such as decreasing training time, maximizing the ability to fall into local minima, and optimizing sensitivity of the initial weights and bias. This paper proposes an improvement of a BP technique which is called IM-COH algorithm (IM-COH). By combining IM-COH algorithm with cuckoo search algorithm (CS), the result is cuckoo search improved control output hidden layer algorithm (CS-IM-COH). This new algorithm has a better ability in optimizing sensitivity of the initial weights and bias than the original BP algorithm. In this research, the algorithm of CS-IM-COH is compared with the original BP, the IM-COH, and the original BP with CS (CS-BP). Furthermore, the selected benchmarks, four time series samples, are shown in this research for illustration. The research shows that the CS-IM-COH algorithm give the best forecasting results compared with the selected samples. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=artificial%20neural%20networks" title="artificial neural networks">artificial neural networks</a>, <a href="https://publications.waset.org/abstracts/search?q=back%20propagation%20algorithm" title=" back propagation algorithm"> back propagation algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=time%20series" title=" time series"> time series</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20minima%20problem" title=" local minima problem"> local minima problem</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristic%20optimization" title=" metaheuristic optimization"> metaheuristic optimization</a> </p> <a href="https://publications.waset.org/abstracts/100995/an-im-coh-algorithm-neural-network-optimization-with-cuckoo-search-algorithm-for-time-series-samples" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/100995.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">152</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">12073</span> Improving the Performance of Back-Propagation Training Algorithm by Using ANN</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vishnu%20Pratap%20Singh%20Kirar">Vishnu Pratap Singh Kirar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Artificial Neural Network (ANN) can be trained using backpropagation (BP). It is the most widely used algorithm for supervised learning with multi-layered feed-forward networks. Efficient learning by the BP algorithm is required for many practical applications. The BP algorithm calculates the weight changes of artificial neural networks, and a common approach is to use a two-term algorithm consisting of a learning rate (LR) and a momentum factor (MF). The major drawbacks of the two-term BP learning algorithm are the problems of local minima and slow convergence speeds, which limit the scope for real-time applications. Recently the addition of an extra term, called a proportional factor (PF), to the two-term BP algorithm was proposed. The third increases the speed of the BP algorithm. However, the PF term also reduces the convergence of the BP algorithm, and criteria for evaluating convergence are required to facilitate the application of the three terms BP algorithm. Although these two seem to be closely related, as described later, we summarize various improvements to overcome the drawbacks. Here we compare the different methods of convergence of the new three-term BP algorithm. <p class="card-text"><strong>Keywords:</strong> <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=backpropagation" title=" backpropagation"> backpropagation</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20minima" title=" local minima"> local minima</a>, <a href="https://publications.waset.org/abstracts/search?q=fast%20convergence%20rate" title=" fast convergence rate"> fast convergence rate</a> </p> <a href="https://publications.waset.org/abstracts/22746/improving-the-performance-of-back-propagation-training-algorithm-by-using-ann" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22746.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">498</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">12072</span> An Improved Dynamic Window Approach with Environment Awareness for Local Obstacle Avoidance of Mobile Robots</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Baoshan%20Wei">Baoshan Wei</a>, <a href="https://publications.waset.org/abstracts/search?q=Shuai%20Han"> Shuai Han</a>, <a href="https://publications.waset.org/abstracts/search?q=Xing%20Zhang"> Xing Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Local obstacle avoidance is critical for mobile robot navigation. It is a challenging task to ensure path optimality and safety in cluttered environments. We proposed an Environment Aware Dynamic Window Approach in this paper to cope with the issue. The method integrates environment characterization into Dynamic Window Approach (DWA). Two strategies are proposed in order to achieve the integration. The local goal strategy guides the robot to move through openings before approaching the final goal, which solves the local minima problem in DWA. The adaptive control strategy endows the robot to adjust its state according to the environment, which addresses path safety compared with DWA. Besides, the evaluation shows that the path generated from the proposed algorithm is safer and smoother compared with state-of-the-art algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20control" title="adaptive control">adaptive control</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20window%20approach" title=" dynamic window approach"> dynamic window approach</a>, <a href="https://publications.waset.org/abstracts/search?q=environment%20aware" title=" environment aware"> environment aware</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20obstacle%20avoidance" title=" local obstacle avoidance"> local obstacle avoidance</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20robots" title=" mobile robots"> mobile robots</a> </p> <a href="https://publications.waset.org/abstracts/102425/an-improved-dynamic-window-approach-with-environment-awareness-for-local-obstacle-avoidance-of-mobile-robots" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/102425.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">159</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">12071</span> Predicting Daily Patient Hospital Visits Using Machine Learning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shreya%20Goyal">Shreya Goyal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The study aims to build user-friendly software to understand patient arrival patterns and compute the number of potential patients who will visit a particular health facility for a given period by using a machine learning algorithm. The underlying machine learning algorithm used in this study is the Support Vector Machine (SVM). Accurate prediction of patient arrival allows hospitals to operate more effectively, providing timely and efficient care while optimizing resources and improving patient experience. It allows for better allocation of staff, equipment, and other resources. If there's a projected surge in patients, additional staff or resources can be allocated to handle the influx, preventing bottlenecks or delays in care. Understanding patient arrival patterns can also help streamline processes to minimize waiting times for patients and ensure timely access to care for patients in need. Another big advantage of using this software is adhering to strict data protection regulations such as the Health Insurance Portability and Accountability Act (HIPAA) in the United States as the hospital will not have to share the data with any third party or upload it to the cloud because the software can read data locally from the machine. The data needs to be arranged in. a particular format and the software will be able to read the data and provide meaningful output. Using software that operates locally can facilitate compliance with these regulations by minimizing data exposure. Keeping patient data within the hospital's local systems reduces the risk of unauthorized access or breaches associated with transmitting data over networks or storing it in external servers. This can help maintain the confidentiality and integrity of sensitive patient information. Historical patient data is used in this study. The input variables used to train the model include patient age, time of day, day of the week, seasonal variations, and local events. The algorithm uses a Supervised learning method to optimize the objective function and find the global minima. The algorithm stores the values of the local minima after each iteration and at the end compares all the local minima to find the global minima. The strength of this study is the transfer function used to calculate the number of patients. The model has an output accuracy of >95%. The method proposed in this study could be used for better management planning of personnel and medical resources. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=machine%20learning" title="machine learning">machine learning</a>, <a href="https://publications.waset.org/abstracts/search?q=SVM" title=" SVM"> SVM</a>, <a href="https://publications.waset.org/abstracts/search?q=HIPAA" title=" HIPAA"> HIPAA</a>, <a href="https://publications.waset.org/abstracts/search?q=data" title=" data"> data</a> </p> <a href="https://publications.waset.org/abstracts/179030/predicting-daily-patient-hospital-visits-using-machine-learning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/179030.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">65</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">12070</span> The Application of Pareto Local Search to the Single-Objective Quadratic Assignment Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdullah%20Alsheddy">Abdullah Alsheddy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the employment of Pareto optimality as a strategy to help (single-objective) local search escaping local optima. Instead of local search, Pareto local search is applied to solve the quadratic assignment problem which is multi-objectivized by adding a helper objective. The additional objective is defined as a function of the primary one with augmented penalties that are dynamically updated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pareto%20optimization" title="Pareto optimization">Pareto optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objectivization" title=" multi-objectivization"> multi-objectivization</a>, <a href="https://publications.waset.org/abstracts/search?q=quadratic%20assignment%20problem" title=" quadratic assignment problem"> quadratic assignment problem</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20search" title=" local search"> local search</a> </p> <a href="https://publications.waset.org/abstracts/9877/the-application-of-pareto-local-search-to-the-single-objective-quadratic-assignment-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9877.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">466</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">12069</span> Interactive Winding Geometry Design of Power Transformers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Paffrath%20Meinhard">Paffrath Meinhard</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhou%20Yayun"> Zhou Yayun</a>, <a href="https://publications.waset.org/abstracts/search?q=Guo%20Yiqing"> Guo Yiqing</a>, <a href="https://publications.waset.org/abstracts/search?q=Ertl%20Harald"> Ertl Harald</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Winding geometry design is an important part of power transformer electrical design. Conventionally, the winding geometry is designed manually, which is a time-consuming job because it involves many iteration steps in order to meet all cost, manufacturing and electrical requirements. Here a method is presented which automatically generates the winding geometry for given user parameters and allows the user to interactively set and change parameters. To achieve this goal, the winding problem is transferred to a mixed integer nonlinear optimization problem. The relevant geometrical design parameters are defined as optimization variables. The cost and other requirements are modeled as constraints. For the solution, a stochastic ant colony optimization algorithm is applied. It is well-known, that an optimizer can get stuck in a local minimum. For the winding problem, we present efficient strategies to come out of local minima, furthermore a reduced variable search range helps to accelerate the solution process. Numerical examples show that the optimization result is delivered within seconds such that the user can interactively change the variable search area and constraints to improve the design. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20optimization" title="ant colony optimization">ant colony optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20nonlinear%20programming" title=" mixed integer nonlinear programming"> mixed integer nonlinear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20transformer" title=" power transformer"> power transformer</a>, <a href="https://publications.waset.org/abstracts/search?q=winding%20design" title=" winding design"> winding design</a> </p> <a href="https://publications.waset.org/abstracts/74700/interactive-winding-geometry-design-of-power-transformers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/74700.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">380</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">12068</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">12067</span> A Lightweight Pretrained Encrypted Traffic Classification Method with Squeeze-and-Excitation Block and Sharpness-Aware Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zhiyan%20Meng">Zhiyan Meng</a>, <a href="https://publications.waset.org/abstracts/search?q=Dan%20Liu"> Dan Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Jintao%20Meng"> Jintao Meng</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Dependable encrypted traffic classification is crucial for improving cybersecurity and handling the growing amount of data. Large language models have shown that learning from large datasets can be effective, making pre-trained methods for encrypted traffic classification popular. However, attention-based pre-trained methods face two main issues: their large neural parameters are not suitable for low-computation environments like mobile devices and real-time applications, and they often overfit by getting stuck in local minima. To address these issues, we developed a lightweight transformer model, which reduces the computational parameters through lightweight vocabulary construction and Squeeze-and-Excitation Block. We use sharpness-aware optimization to avoid local minima during pre-training and capture temporal features with relative positional embeddings. Our approach keeps the model's classification accuracy high for downstream tasks. We conducted experiments on four datasets -USTC-TFC2016, VPN 2016, Tor 2016, and CICIOT 2022. Even with fewer than 18 million parameters, our method achieves classification results similar to methods with ten times as many parameters. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=sharpness-aware%20optimization" title="sharpness-aware optimization">sharpness-aware optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=encrypted%20traffic%20classification" title=" encrypted traffic classification"> encrypted traffic classification</a>, <a href="https://publications.waset.org/abstracts/search?q=squeeze-and-excitation%20block" title=" squeeze-and-excitation block"> squeeze-and-excitation block</a>, <a href="https://publications.waset.org/abstracts/search?q=pretrained%20model" title=" pretrained model"> pretrained model</a> </p> <a href="https://publications.waset.org/abstracts/191101/a-lightweight-pretrained-encrypted-traffic-classification-method-with-squeeze-and-excitation-block-and-sharpness-aware-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/191101.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">30</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">12066</span> Storage Durations Affect the Physico-Chemical Characteristics of Physalis Minima L.</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Norhanizan%20U.">Norhanizan U.</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20H.%20Ahmad"> S. H. Ahmad</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20A.%20P.%20Abdullah"> N. A. P. Abdullah</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20B.%20Saleh"> G. B. Saleh </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Physalis minima from the family of Solanaceae is one of the promising fruits which contains the high amount of vitamin C and other antioxidants as well. However, it is a perishable fruit where the deterioration process will commence if the fruits are not stored in proper conditions. There is not much work has been carried out to study the effects of storage durations on Physalis fruit. Therefore, this study was conducted to determine the effects of 0, 3, 6, and 9 days of storage on postharvest quality of Physalis minima fruits. Total of 120g of uniform sizes of fruits (2.3 to 2.5g) were used for each replication and the experiment was repeated thrice. The fruits were divided equally into four groups with each group labeled according to the days of storage. The fruits were then stored in the cool room for nine days with temperature maintain at 12 ° C. The fruits were analyzed for weight loss, firmness, color (L*, C* and hue angle), titratable acidity (TA), soluble solids concentrations (SSC), pH and ascorbic acids. Data were analyzed using analysis of variance and means was separated using least significant difference (LSD). The storage durations affect the quality characteristics of the fruits. On the day 9, the average of fruit weight loss and fruit firmness decreased about 21 and 24% respectively. The level of ascorbic acids and titrable acidity were also decreased while the soluble solids concentration increased during storage. Thus, in order to retain the quality of the fruits, it is recommended that the Physalis fruit can be stored only up to 6 days at 12 ° C. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fruit%20quality" title="fruit quality">fruit quality</a>, <a href="https://publications.waset.org/abstracts/search?q=Physalis%20minima" title=" Physalis minima"> Physalis minima</a>, <a href="https://publications.waset.org/abstracts/search?q=Solanaceae" title=" Solanaceae"> Solanaceae</a>, <a href="https://publications.waset.org/abstracts/search?q=storage%20durations" title=" storage durations "> storage durations </a> </p> <a href="https://publications.waset.org/abstracts/37366/storage-durations-affect-the-physico-chemical-characteristics-of-physalis-minima-l" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37366.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">282</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">12065</span> Promoting Authenticity in Employer Brands to Address the Global-Local Problem in Complex Organisations: The Case of a Developing Country</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Saud%20Al%20Taj">Saud Al Taj</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Employer branding is considered as a useful tool for addressing the global-local problem facing complex organisations that have operations scattered across the globe and face challenges of dealing with the local environment alongside. Despite being an established field of study within the Western developed world, there is little empirical evidence concerning the relevance of employer branding to global companies that operate in the under-developed economies. This paper fills this gap by gaining rich insight into the implementation of employer branding programs in a foreign multinational operating in Pakistan dealing with the global-local problem. The study is qualitative in nature and employs semi-structured and focus group interviews with senior/middle managers and local frontline employees to deeply examine the phenomenon in case organisation. Findings suggest that authenticity is required in employer brands to enable them to respond to the local needs thereby leading to the resolution of the global-local problem. However, the role of signaling theory is key to the development of authentic employer brands as it stresses on the need to establish an efficient and effective signaling environment wherein signals travel in both directions (from signal designers to receivers and backwards) and facilitate firms with the global-local problem. The paper also identifies future avenues of research for the employer branding field. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=authenticity" title="authenticity">authenticity</a>, <a href="https://publications.waset.org/abstracts/search?q=counter-signals" title=" counter-signals"> counter-signals</a>, <a href="https://publications.waset.org/abstracts/search?q=employer%20branding" title=" employer branding"> employer branding</a>, <a href="https://publications.waset.org/abstracts/search?q=global-local%20problem" title=" global-local problem"> global-local problem</a>, <a href="https://publications.waset.org/abstracts/search?q=signaling%20theory" title=" signaling theory "> signaling theory </a> </p> <a href="https://publications.waset.org/abstracts/20110/promoting-authenticity-in-employer-brands-to-address-the-global-local-problem-in-complex-organisations-the-case-of-a-developing-country" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20110.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">367</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">12064</span> Tree-Based Inference for Regionalization: A Comparative Study of Global Topological Perturbation Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Orhun%20Aydin">Orhun Aydin</a>, <a href="https://publications.waset.org/abstracts/search?q=Mark%20V.%20Janikas"> Mark V. Janikas</a>, <a href="https://publications.waset.org/abstracts/search?q=Rodrigo%20Alves"> Rodrigo Alves</a>, <a href="https://publications.waset.org/abstracts/search?q=Renato%20Assuncao"> Renato Assuncao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a tree-based perturbation methodology for regionalization inference is presented. Regionalization is a constrained optimization problem that aims to create groups with similar attributes while satisfying spatial contiguity constraints. Similar to any constrained optimization problem, the spatial constraint may hinder convergence to some global minima, resulting in spatially contiguous members of a group with dissimilar attributes. This paper presents a general methodology for rigorously perturbing spatial constraints through the use of random spanning trees. The general framework presented can be used to quantify the effect of the spatial constraints in the overall regionalization result. We compare several types of stochastic spanning trees used in inference problems such as fuzzy regionalization and determining the number of regions. Performance of stochastic spanning trees is juxtaposed against the traditional permutation-based hypothesis testing frequently used in spatial statistics. Inference results for fuzzy regionalization and determining the number of regions is presented on the Local Area Personal Incomes for Texas Counties provided by the Bureau of Economic Analysis. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=regionalization" title="regionalization">regionalization</a>, <a href="https://publications.waset.org/abstracts/search?q=constrained%20clustering" title=" constrained clustering"> constrained clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=probabilistic%20inference" title=" probabilistic inference"> probabilistic inference</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20clustering" title=" fuzzy clustering"> fuzzy clustering</a> </p> <a href="https://publications.waset.org/abstracts/84786/tree-based-inference-for-regionalization-a-comparative-study-of-global-topological-perturbation-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/84786.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">229</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">12063</span> Using Convergent and Divergent Thinking in Creative Problem Solving in Mathematics</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Keng%20Keh%20Lim">Keng Keh Lim</a>, <a href="https://publications.waset.org/abstracts/search?q=Zaleha%20Ismail"> Zaleha Ismail</a>, <a href="https://publications.waset.org/abstracts/search?q=Yudariah%20Mohammad%20Yusof"> Yudariah Mohammad Yusof</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper aims to find out how students using convergent and divergent thinking in creative problem solving to solve mathematical problems creatively. Eight engineering undergraduates in a local university took part in this study. They were divided into two groups. They solved the mathematical problems with the use of creative problem solving skills. Their solutions were collected and analyzed to reveal all the processes of problem solving, namely: problem definition, ideas generation, ideas evaluation, ideas judgment, and solution implementation. The result showed that the students were able to solve the mathematical problem with the use of creative problem solving skills. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convergent%20thinking" title="convergent thinking">convergent thinking</a>, <a href="https://publications.waset.org/abstracts/search?q=divergent%20thinking" title=" divergent thinking"> divergent thinking</a>, <a href="https://publications.waset.org/abstracts/search?q=creative%20problem%20solving" title=" creative problem solving"> creative problem solving</a>, <a href="https://publications.waset.org/abstracts/search?q=creativity" title=" creativity"> creativity</a> </p> <a href="https://publications.waset.org/abstracts/77631/using-convergent-and-divergent-thinking-in-creative-problem-solving-in-mathematics" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/77631.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">349</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">12062</span> Experimental Simulation Set-Up for Validating Out-Of-The-Loop Mitigation when Monitoring High Levels of Automation in Air Traffic Control</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Oliver%20Ohneiser">Oliver Ohneiser</a>, <a href="https://publications.waset.org/abstracts/search?q=Francesca%20De%20Crescenzio"> Francesca De Crescenzio</a>, <a href="https://publications.waset.org/abstracts/search?q=Gianluca%20Di%20Flumeri"> Gianluca Di Flumeri</a>, <a href="https://publications.waset.org/abstracts/search?q=Jan%20Kraemer"> Jan Kraemer</a>, <a href="https://publications.waset.org/abstracts/search?q=Bruno%20Berberian"> Bruno Berberian</a>, <a href="https://publications.waset.org/abstracts/search?q=Sara%20Bagassi"> Sara Bagassi</a>, <a href="https://publications.waset.org/abstracts/search?q=Nicolina%20Sciaraffa"> Nicolina Sciaraffa</a>, <a href="https://publications.waset.org/abstracts/search?q=Pietro%20Aric%C3%B2"> Pietro Aricò</a>, <a href="https://publications.waset.org/abstracts/search?q=Gianluca%20Borghini"> Gianluca Borghini</a>, <a href="https://publications.waset.org/abstracts/search?q=Fabio%20Babiloni"> Fabio Babiloni</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An increasing degree of automation in air traffic will also change the role of the air traffic controller (ATCO). ATCOs will fulfill significantly more monitoring tasks compared to today. However, this rather passive role may lead to Out-Of-The-Loop (OOTL) effects comprising vigilance decrement and less situation awareness. The project MINIMA (Mitigating Negative Impacts of Monitoring high levels of Automation) has conceived a system to control and mitigate such OOTL phenomena. In order to demonstrate the MINIMA concept, an experimental simulation set-up has been designed. This set-up consists of two parts: 1) a Task Environment (TE) comprising a Terminal Maneuvering Area (TMA) simulator as well as 2) a Vigilance and Attention Controller (VAC) based on neurophysiological data recording such as electroencephalography (EEG) and eye-tracking devices. The current vigilance level and the attention focus of the controller are measured during the ATCO’s active work in front of the human machine interface (HMI). The derived vigilance level and attention trigger adaptive automation functionalities in the TE to avoid OOTL effects. This paper describes the full-scale experimental set-up and the component development work towards it. Hence, it encompasses a pre-test whose results influenced the development of the VAC as well as the functionalities of the final TE and the two VAC’s sub-components. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=automation" title="automation">automation</a>, <a href="https://publications.waset.org/abstracts/search?q=human%20factors" title=" human factors"> human factors</a>, <a href="https://publications.waset.org/abstracts/search?q=air%20traffic%20controller" title=" air traffic controller"> air traffic controller</a>, <a href="https://publications.waset.org/abstracts/search?q=MINIMA" title=" MINIMA"> MINIMA</a>, <a href="https://publications.waset.org/abstracts/search?q=OOTL%20%28Out-Of-The-Loop%29" title=" OOTL (Out-Of-The-Loop)"> OOTL (Out-Of-The-Loop)</a>, <a href="https://publications.waset.org/abstracts/search?q=EEG%20%28Electroencephalography%29" title=" EEG (Electroencephalography)"> EEG (Electroencephalography)</a>, <a href="https://publications.waset.org/abstracts/search?q=HMI%20%28Human%20Machine%20Interface%29" title=" HMI (Human Machine Interface)"> HMI (Human Machine Interface)</a> </p> <a href="https://publications.waset.org/abstracts/84169/experimental-simulation-set-up-for-validating-out-of-the-loop-mitigation-when-monitoring-high-levels-of-automation-in-air-traffic-control" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/84169.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">383</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">12061</span> A Hybrid Heuristic for the Team Orienteering Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adel%20Bouchakhchoukha">Adel Bouchakhchoukha</a>, <a href="https://publications.waset.org/abstracts/search?q=Hakim%20Akeb"> Hakim Akeb </a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this work, we propose a hybrid heuristic in order to solve the Team Orienteering Problem (TOP). Given a set of points (or customers), each with associated score (profit or benefit), and a team that has a fixed number of members, the problem to solve is to visit a subset of points in order to maximize the total collected score. Each member performs a tour starting at the start point, visiting distinct customers and the tour terminates at the arrival point. In addition, each point is visited at most once, and the total time in each tour cannot be greater than a given value. The proposed heuristic combines beam search and a local optimization strategy. The algorithm was tested on several sets of instances and encouraging results were obtained. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=team%20orienteering%20problem" title="team orienteering problem">team orienteering problem</a>, <a href="https://publications.waset.org/abstracts/search?q=vehicle%20routing" title=" vehicle routing"> vehicle routing</a>, <a href="https://publications.waset.org/abstracts/search?q=beam%20search" title=" beam search"> beam search</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20search" title=" local search"> local search</a> </p> <a href="https://publications.waset.org/abstracts/12948/a-hybrid-heuristic-for-the-team-orienteering-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12948.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">418</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">12060</span> Design of a Phemt Buffer Amplifier in Mm-Wave Band around 60 GHz</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maryam%20Abata">Maryam Abata</a>, <a href="https://publications.waset.org/abstracts/search?q=Moulhime%20El%20Bekkali"> Moulhime El Bekkali</a>, <a href="https://publications.waset.org/abstracts/search?q=Said%20Mazer"> Said Mazer</a>, <a href="https://publications.waset.org/abstracts/search?q=Catherine%20Algani"> Catherine Algani</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahmoud%20Mehdi"> Mahmoud Mehdi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One major problem of most electronic systems operating in the millimeter wave band is the signal generation with a high purity and a stable carrier frequency. This problem is overcome by using the combination of a signal with a low frequency local oscillator (LO) and several stages of frequency multipliers. The use of these frequency multipliers to create millimeter-wave signals is an attractive alternative to direct generation signal. Therefore, the isolation problem of the local oscillator from the other stages is always present, which leads to have various mechanisms that can disturb the oscillator performance, thus a buffer amplifier is often included in oscillator outputs. In this paper, we present the study and design of a buffer amplifier in the mm-wave band using a 0.15μm pHEMT from UMS foundry. This amplifier will be used as a part of a frequency quadrupler at 60 GHz. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mm-wave%20band" title="Mm-wave band">Mm-wave band</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20oscillator" title=" local oscillator"> local oscillator</a>, <a href="https://publications.waset.org/abstracts/search?q=frequency%20quadrupler" title=" frequency quadrupler"> frequency quadrupler</a>, <a href="https://publications.waset.org/abstracts/search?q=buffer%20amplifier" title=" buffer amplifier"> buffer amplifier</a> </p> <a href="https://publications.waset.org/abstracts/26079/design-of-a-phemt-buffer-amplifier-in-mm-wave-band-around-60-ghz" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/26079.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">544</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">12059</span> Inversion of the Spectral Analysis of Surface Waves Dispersion Curves through the Particle Swarm Optimization Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Cerrato%20Casado">A. Cerrato Casado</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20Guigou"> C. Guigou</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20Jean"> P. Jean</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this investigation, the particle swarm optimization (PSO) algorithm is used to perform the inversion of the dispersion curves in the spectral analysis of surface waves (SASW) method. This inverse problem usually presents complicated solution spaces with many local minima that make difficult the convergence to the correct solution. PSO is a metaheuristic method that was originally designed to simulate social behavior but has demonstrated powerful capabilities to solve inverse problems with complex space solution and a high number of variables. The dispersion curve of the synthetic soils is constructed by the vertical flexibility coefficient method, which is especially convenient for soils where the stiffness does not increase gradually with depth. The reason is that these types of soil profiles are not normally dispersive since the dominant mode of Rayleigh waves is usually not coincident with the fundamental mode. Multiple synthetic soil profiles have been tested to show the characteristics of the convergence process and assess the accuracy of the final soil profile. In addition, the inversion procedure is applied to multiple real soils and the final profile compared with the available information. The combination of the vertical flexibility coefficient method to obtain the dispersion curve and the PSO algorithm to carry out the inversion process proves to be a robust procedure that is able to provide good solutions for complex soil profiles even with scarce prior information. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dispersion" title="dispersion">dispersion</a>, <a href="https://publications.waset.org/abstracts/search?q=inverse%20problem" title=" inverse problem"> inverse problem</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=SASW" title=" SASW"> SASW</a>, <a href="https://publications.waset.org/abstracts/search?q=soil%20profile" title=" soil profile"> soil profile</a> </p> <a href="https://publications.waset.org/abstracts/87227/inversion-of-the-spectral-analysis-of-surface-waves-dispersion-curves-through-the-particle-swarm-optimization-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/87227.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">185</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">12058</span> Improved Artificial Bee Colony Algorithm for Non-Convex Economic Power Dispatch Problem </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Badr%20M.%20Alshammari">Badr M. Alshammari</a>, <a href="https://publications.waset.org/abstracts/search?q=T.%20Guesmi"> T. Guesmi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study presents a modified version of the artificial bee colony (ABC) algorithm by including a local search technique for solving the non-convex economic power dispatch problem. The local search step is incorporated at the end of each iteration. Total system losses, valve-point loading effects and prohibited operating zones have been incorporated in the problem formulation. Thus, the problem becomes highly nonlinear and with discontinuous objective function. The proposed technique is validated using an IEEE benchmark system with ten thermal units. Simulation results demonstrate that the proposed optimization algorithm has better convergence characteristics in comparison with the original ABC algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=economic%20power%20dispatch" title="economic power dispatch">economic power dispatch</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20bee%20colony" title=" artificial bee colony"> artificial bee colony</a>, <a href="https://publications.waset.org/abstracts/search?q=valve-point%20loading%20effects" title=" valve-point loading effects"> valve-point loading effects</a>, <a href="https://publications.waset.org/abstracts/search?q=prohibited%20operating%20zones" title=" prohibited operating zones"> prohibited operating zones</a> </p> <a href="https://publications.waset.org/abstracts/89937/improved-artificial-bee-colony-algorithm-for-non-convex-economic-power-dispatch-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89937.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">257</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">12057</span> Continuous Differential Evolution Based Parameter Estimation Framework for Signal Models</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ammara%20Mehmood">Ammara Mehmood</a>, <a href="https://publications.waset.org/abstracts/search?q=Aneela%20Zameer"> Aneela Zameer</a>, <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Asif%20Zahoor%20Raja"> Muhammad Asif Zahoor Raja</a>, <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Faisal%20Fateh"> Muhammad Faisal Fateh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this work, the strength of bio-inspired computational intelligence based technique is exploited for parameter estimation for the periodic signals using Continuous Differential Evolution (CDE) by deﬁning an error function in the mean square sense. Multidimensional and nonlinear nature of the problem emerging in sinusoidal signal models along with noise makes it a challenging optimization task, which is dealt with robustness and effectiveness of CDE to ensure convergence and avoid trapping in local minima. In the proposed scheme of Continuous Differential Evolution based Signal Parameter Estimation (CDESPE), unknown adjustable weights of the signal system identification model are optimized utilizing CDE algorithm. The performance of CDESPE model is validated through statistics based various performance indices on a sufficiently large number of runs in terms of estimation error, mean squared error and Thiel’s inequality coefﬁcient. Efficacy of CDESPE is examined by comparison with the actual parameters of the system, Genetic Algorithm based outcomes and from various deterministic approaches at different signal-to-noise ratio (SNR) levels. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parameter%20estimation" title="parameter estimation">parameter estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=bio-inspired%20computing" title=" bio-inspired computing"> bio-inspired computing</a>, <a href="https://publications.waset.org/abstracts/search?q=continuous%20differential%20evolution%20%28CDE%29" title=" continuous differential evolution (CDE)"> continuous differential evolution (CDE)</a>, <a href="https://publications.waset.org/abstracts/search?q=periodic%20signals" title=" periodic signals"> periodic signals</a> </p> <a href="https://publications.waset.org/abstracts/72735/continuous-differential-evolution-based-parameter-estimation-framework-for-signal-models" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72735.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">302</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">12056</span> An Adiabatic Quantum Optimization Approach for the Mixed Integer Nonlinear Programming Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maxwell%20Henderson">Maxwell Henderson</a>, <a href="https://publications.waset.org/abstracts/search?q=Tristan%20Cook"> Tristan Cook</a>, <a href="https://publications.waset.org/abstracts/search?q=Justin%20Chan%20Jin%20Le"> Justin Chan Jin Le</a>, <a href="https://publications.waset.org/abstracts/search?q=Mark%20Hodson"> Mark Hodson</a>, <a href="https://publications.waset.org/abstracts/search?q=YoungJung%20Chang"> YoungJung Chang</a>, <a href="https://publications.waset.org/abstracts/search?q=John%20Novak"> John Novak</a>, <a href="https://publications.waset.org/abstracts/search?q=Daniel%20Padilha"> Daniel Padilha</a>, <a href="https://publications.waset.org/abstracts/search?q=Nishan%20Kulatilaka"> Nishan Kulatilaka</a>, <a href="https://publications.waset.org/abstracts/search?q=Ansu%20Bagchi"> Ansu Bagchi</a>, <a href="https://publications.waset.org/abstracts/search?q=Sanjoy%20Ray"> Sanjoy Ray</a>, <a href="https://publications.waset.org/abstracts/search?q=John%20Kelly"> John Kelly</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present a method of using adiabatic quantum optimization (AQO) to solve a mixed integer nonlinear programming (MINLP) problem instance. The MINLP problem is a general form of a set of NP-hard optimization problems that are critical to many business applications. It requires optimizing a set of discrete and continuous variables with nonlinear and potentially nonconvex constraints. Obtaining an exact, optimal solution for MINLP problem instances of non-trivial size using classical computation methods is currently intractable. Current leading algorithms leverage heuristic and divide-and-conquer methods to determine approximate solutions. Creating more accurate and efficient algorithms is an active area of research. Quantum computing (QC) has several theoretical benefits compared to classical computing, through which QC algorithms could obtain MINLP solutions that are superior to current algorithms. AQO is a particular form of QC that could offer more near-term benefits compared to other forms of QC, as hardware development is in a more mature state and devices are currently commercially available from D-Wave Systems Inc. It is also designed for optimization problems: it uses an effect called quantum tunneling to explore all lowest points of an energy landscape where classical approaches could become stuck in local minima. Our work used a novel algorithm formulated for AQO to solve a special type of MINLP problem. The research focused on determining: 1) if the problem is possible to solve using AQO, 2) if it can be solved by current hardware, 3) what the currently achievable performance is, 4) what the performance will be on projected future hardware, and 5) when AQO is likely to provide a benefit over classical computing methods. Two different methods, integer range and 1-hot encoding, were investigated for transforming the MINLP problem instance constraints into a mathematical structure that can be embedded directly onto the current D-Wave architecture. For testing and validation a D-Wave 2X device was used, as well as QxBranch’s QxLib software library, which includes a QC simulator based on simulated annealing. Our results indicate that it is mathematically possible to formulate the MINLP problem for AQO, but that currently available hardware is unable to solve problems of useful size. Classical general-purpose simulated annealing is currently able to solve larger problem sizes, but does not scale well and such methods would likely be outperformed in the future by improved AQO hardware with higher qubit connectivity and lower temperatures. If larger AQO devices are able to show improvements that trend in this direction, commercially viable solutions to the MINLP for particular applications could be implemented on hardware projected to be available in 5-10 years. Continued investigation into optimal AQO hardware architectures and novel methods for embedding MINLP problem constraints on to those architectures is needed to realize those commercial benefits. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adiabatic%20quantum%20optimization" title="adiabatic quantum optimization">adiabatic quantum optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20nonlinear%20programming" title=" mixed integer nonlinear programming"> mixed integer nonlinear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20computing" title=" quantum computing"> quantum computing</a>, <a href="https://publications.waset.org/abstracts/search?q=NP-hard" title=" NP-hard"> NP-hard</a> </p> <a href="https://publications.waset.org/abstracts/79560/an-adiabatic-quantum-optimization-approach-for-the-mixed-integer-nonlinear-programming-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/79560.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">525</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">12055</span> Heuristic Methods for the Capacitated Location- Allocation Problem with Stochastic Demand</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Salinee%20Thumronglaohapun">Salinee Thumronglaohapun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The proper number and appropriate locations of service centers can save cost, raise revenue and gain more satisfaction from customers. Establishing service centers is high-cost and difficult to relocate. In long-term planning periods, several factors may affect the service. One of the most critical factors is uncertain demand of customers. The opened service centers need to be capable of serving customers and making a profit although the demand in each period is changed. In this work, the capacitated location-allocation problem with stochastic demand is considered. A mathematical model is formulated to determine suitable locations of service centers and their allocation to maximize total profit for multiple planning periods. Two heuristic methods, a local search and genetic algorithm, are used to solve this problem. For the local search, five different chances to choose each type of moves are applied. For the genetic algorithm, three different replacement strategies are considered. The results of applying each method to solve numerical examples are compared. Both methods reach to the same best found solution in most examples but the genetic algorithm provides better solutions in some cases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=location-allocation%20problem" title="location-allocation problem">location-allocation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20demand" title=" stochastic demand"> stochastic demand</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20search" title=" local search"> local search</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a> </p> <a href="https://publications.waset.org/abstracts/114723/heuristic-methods-for-the-capacitated-location-allocation-problem-with-stochastic-demand" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/114723.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">124</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">12054</span> Kriging-Based Global Optimization Method for Bluff Body Drag Reduction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bingxi%20Huang">Bingxi Huang</a>, <a href="https://publications.waset.org/abstracts/search?q=Yiqing%20Li"> Yiqing Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Marek%20Morzynski"> Marek Morzynski</a>, <a href="https://publications.waset.org/abstracts/search?q=Bernd%20R.%20Noack"> Bernd R. Noack</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose a Kriging-based global optimization method for active flow control with multiple actuation parameters. This method is designed to converge quickly and avoid getting trapped into local minima. We follow the model-free explorative gradient method (EGM) to alternate between explorative and exploitive steps. This facilitates a convergence similar to a gradient-based method and the parallel exploration of potentially better minima. In contrast to EGM, both kinds of steps are performed with Kriging surrogate model from the available data. The explorative step maximizes the expected improvement, i.e., favors regions of large uncertainty. The exploitive step identifies the best location of the cost function from the Kriging surrogate model for a subsequent weight-biased linear-gradient descent search method. To verify the effectiveness and robustness of the improved Kriging-based optimization method, we have examined several comparative test problems of varying dimensions with limited evaluation budgets. The results show that the proposed algorithm significantly outperforms some model-free optimization algorithms like genetic algorithm and differential evolution algorithm with a quicker convergence for a given budget. We have also performed direct numerical simulations of the fluidic pinball (N. Deng et al. 2020 J. Fluid Mech.) on three circular cylinders in equilateral-triangular arrangement immersed in an incoming flow at Re=100. The optimal cylinder rotations lead to 44.0% net drag power saving with 85.8% drag reduction and 41.8% actuation power. The optimal results for active flow control based on this configuration have achieved boat-tailing mechanism by employing Coanda forcing and wake stabilization by delaying separation and minimizing the wake region. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=direct%20numerical%20simulations" title="direct numerical simulations">direct numerical simulations</a>, <a href="https://publications.waset.org/abstracts/search?q=flow%20control" title=" flow control"> flow control</a>, <a href="https://publications.waset.org/abstracts/search?q=kriging" title=" kriging"> kriging</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20optimization" title=" stochastic optimization"> stochastic optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=wake%20stabilization" title=" wake stabilization"> wake stabilization</a> </p> <a href="https://publications.waset.org/abstracts/138533/kriging-based-global-optimization-method-for-bluff-body-drag-reduction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/138533.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">106</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">12053</span> Optimisation of a Dragonfly-Inspired Flapping Wing-Actuation System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jia-Ming%20Kok">Jia-Ming Kok</a>, <a href="https://publications.waset.org/abstracts/search?q=Javaan%20Chahl"> Javaan Chahl</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An optimisation method using both global and local optimisation is implemented to determine the flapping profile which will produce the most lift for an experimental wing-actuation system. The optimisation method is tested using a numerical quasi-steady analysis. Results of an optimised flapping profile show a 20% increase in lift generated as compared to flapping profiles obtained by high speed cinematography of a Sympetrum frequens dragonfly. Initial optimisation procedures showed 3166 objective function evaluations. The global optimisation parameters - initial sample size and stage one sample size, were altered to reduce the number of function evaluations. Altering the stage one sample size had no significant effect. It was found that reducing the initial sample size to 400 would allow a reduction in computational effort to approximately 1500 function evaluations without compromising the global solvers ability to locate potential minima. To further reduce the optimisation effort required, we increase the local solver’s convergence tolerance criterion. An increase in the tolerance from 0.02N to 0.05N decreased the number of function evaluations by another 20%. However, this potentially reduces the maximum obtainable lift by up to 0.025N. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=flapping%20wing" title="flapping wing">flapping wing</a>, <a href="https://publications.waset.org/abstracts/search?q=optimisation" title=" optimisation"> optimisation</a>, <a href="https://publications.waset.org/abstracts/search?q=quasi-steady%20model" title=" quasi-steady model"> quasi-steady model</a>, <a href="https://publications.waset.org/abstracts/search?q=dragonfly" title=" dragonfly"> dragonfly</a> </p> <a href="https://publications.waset.org/abstracts/9439/optimisation-of-a-dragonfly-inspired-flapping-wing-actuation-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9439.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">357</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">12052</span> Intended and Unintended Outcomes of Partnerships at the Local Level in Slovakia</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Daniel%20Klimovsk%C3%BD">Daniel Klimovský</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Slovakia belongs to the most fragmented countries if one looks at its local government structure. The Slovak central governments implemented both broad devolution and fiscal decentralization some decades ago. However, neither territorial consolidation nor size categorization of local competences and powers has been implemented yet. Taking this fact into account, it is clear that the local governments are challenged not only by their citizens as customers but also by effectiveness as well as efficiency of delivered services. The paper is focused on behavior of the local governments in Slovakia and their approaches towards other local partners, including other local governments. Analysis of set of interviews shows that inter-municipal cooperation is the most common local partnership in Slovakia, but due to diversity of the local governments, this kind of cooperation leads to both intended and unintended outcomes. While in many cases the local governments are more efficient as well as effective in delivery of local services thanks to inter-municipal cooperation, there are many cases where inter-municipal cooperation fails, and it brings rather questionable or even negative outcomes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=local%20governments" title="local governments">local governments</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20partnerships" title=" local partnerships"> local partnerships</a>, <a href="https://publications.waset.org/abstracts/search?q=inter-municipal%20cooperation" title=" inter-municipal cooperation"> inter-municipal cooperation</a>, <a href="https://publications.waset.org/abstracts/search?q=delivery%20of%20local%20services" title=" delivery of local services"> delivery of local services</a> </p> <a href="https://publications.waset.org/abstracts/81207/intended-and-unintended-outcomes-of-partnerships-at-the-local-level-in-slovakia" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/81207.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">262</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">12051</span> Effective Citizen Participation in Local Government Decision-Making and Democracy</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ali%20Zaimi">Ali Zaimi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Citizen participation in local government is an opportunity given to citizens and government to increase communication between them, create public support for local government plans and most important grow public trust in government. Also, the citizens’ involvement in the political process is an important part of democracy. This study aims to define the strategies for increasing citizen participation in local governance and concentrated in two important mechanisms such as participatory budget and public policy councils. Three strategies that promote more effective citizen involvement in local governance are understanding and using formal institutions of power, collaboration of citizens’ groups and governments officials to jointly formulate programs plans, electing and appointing local officials. A unique aspect of citizen participation to operate effectively is the transparency of government and the inclusion of actors into decision-making. The citizen engagement in local governance enhances accountability and problem solving, promote more inclusive and cohesive communities and enlarge the quality and quantity of initiatives made by communities. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=accountability" title="accountability">accountability</a>, <a href="https://publications.waset.org/abstracts/search?q=citizen%20participation" title=" citizen participation"> citizen participation</a>, <a href="https://publications.waset.org/abstracts/search?q=democracy" title=" democracy"> democracy</a>, <a href="https://publications.waset.org/abstracts/search?q=government" title=" government"> government</a> </p> <a href="https://publications.waset.org/abstracts/92290/effective-citizen-participation-in-local-government-decision-making-and-democracy" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92290.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">265</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">12050</span> Existence Solutions for Three Point Boundary Value Problem for Differential Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Houas">Mohamed Houas</a>, <a href="https://publications.waset.org/abstracts/search?q=Maamar%20Benbachir"> Maamar Benbachir</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, under weak assumptions, we study the existence and uniqueness of solutions for a nonlinear fractional boundary value problem. New existence and uniqueness results are established using Banach contraction principle. Other existence results are obtained using scheafer and krasnoselskii's fixed point theorem. At the end, some illustrative examples are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=caputo%20derivative" title="caputo derivative">caputo derivative</a>, <a href="https://publications.waset.org/abstracts/search?q=boundary%20value%20problem" title=" boundary value problem"> boundary value problem</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed%20point%20theorem" title=" fixed point theorem"> fixed point theorem</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20conditions" title=" local conditions"> local conditions</a> </p> <a href="https://publications.waset.org/abstracts/13970/existence-solutions-for-three-point-boundary-value-problem-for-differential-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13970.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">428</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">12049</span> The Impact of Indigenous Architecture and the Origin of Tomb Architecture in Indian Sub-Continent: A Case Study of the Tombs of Muhmmad B. Haroon, Saif-Ud-Daula Mahmud, Khalid Walid and Sultan Ghari; An Appraisal</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tauqeer%20Ahmad">Tauqeer Ahmad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A lot of literature have been produced addressing the problem of origin and development of tomb architecture in Pakistan and India. In this attempt, the author would address this problem in the Indian prospective. Particularly, the impact of indigenous architecture would be analyzed in this research paper. As we observe that on early Muslim tombs in Indian sub-continent, to large extent, were contributed in term of architecture by local masons. So far as the material used in these early tombs is concerned was also picked from Indian tradition according to the availability and the local traditions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Khitti%20Chor" title="Khitti Chor">Khitti Chor</a>, <a href="https://publications.waset.org/abstracts/search?q=tomb%20of%20Sultan%20Ghari" title=" tomb of Sultan Ghari"> tomb of Sultan Ghari</a>, <a href="https://publications.waset.org/abstracts/search?q=tomb%20at%20Zairan" title=" tomb at Zairan"> tomb at Zairan</a>, <a href="https://publications.waset.org/abstracts/search?q=Lasbela" title=" Lasbela "> Lasbela </a> </p> <a href="https://publications.waset.org/abstracts/39124/the-impact-of-indigenous-architecture-and-the-origin-of-tomb-architecture-in-indian-sub-continent-a-case-study-of-the-tombs-of-muhmmad-b-haroon-saif-ud-daula-mahmud-khalid-walid-and-sultan-ghari-an-appraisal" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39124.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">327</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">12048</span> Discrete Swarm with Passive Congregation for Cost Minimization of the Multiple Vehicle Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tarek%20Aboueldahab">Tarek Aboueldahab</a>, <a href="https://publications.waset.org/abstracts/search?q=Hanan%20Farag"> Hanan Farag</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cost minimization of Multiple Vehicle Routing Problem becomes a critical issue in the field of transportation because it is NP-hard optimization problem and the search space is complex. Many researches use the hybridization of artificial intelligence (AI) models to solve this problem; however, it can not guarantee to reach the best solution due to the difficulty of searching the whole search space. To overcome this problem, we introduce the hybrid model of Discrete Particle Swarm Optimization (DPSO) with a passive congregation which enable searching the whole search space to compromise between both local and global search. The practical experiment shows that our model obviously outperforms other hybrid models in cost minimization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cost%20minimization" title="cost minimization">cost minimization</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-vehicle%20routing%20problem" title=" multi-vehicle routing problem"> multi-vehicle routing problem</a>, <a href="https://publications.waset.org/abstracts/search?q=passive%20congregation" title=" passive congregation"> passive congregation</a>, <a href="https://publications.waset.org/abstracts/search?q=discrete%20swarm" title=" discrete swarm"> discrete swarm</a>, <a href="https://publications.waset.org/abstracts/search?q=passive%20congregation" title=" passive congregation"> passive congregation</a> </p> <a href="https://publications.waset.org/abstracts/157025/discrete-swarm-with-passive-congregation-for-cost-minimization-of-the-multiple-vehicle-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/157025.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">98</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">12047</span> Solving Single Machine Total Weighted Tardiness Problem Using Gaussian Process Regression</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wanatchapong%20Kongkaew">Wanatchapong Kongkaew</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes an application of probabilistic technique, namely Gaussian process regression, for estimating an optimal sequence of the single machine with total weighted tardiness (SMTWT) scheduling problem. In this work, the Gaussian process regression (GPR) model is utilized to predict an optimal sequence of the SMTWT problem, and its solution is improved by using an iterated local search based on simulated annealing scheme, called GPRISA algorithm. The results show that the proposed GPRISA method achieves a very good performance and a reasonable trade-off between solution quality and time consumption. Moreover, in the comparison of deviation from the best-known solution, the proposed mechanism noticeably outperforms the recently existing approaches. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gaussian%20process%20regression" title="Gaussian process regression">Gaussian process regression</a>, <a href="https://publications.waset.org/abstracts/search?q=iterated%20local%20search" title=" iterated local search"> iterated local search</a>, <a href="https://publications.waset.org/abstracts/search?q=simulated%20annealing" title=" simulated annealing"> simulated annealing</a>, <a href="https://publications.waset.org/abstracts/search?q=single%20machine%20total%20weighted%20tardiness" title=" single machine total weighted tardiness"> single machine total weighted tardiness</a> </p> <a href="https://publications.waset.org/abstracts/6433/solving-single-machine-total-weighted-tardiness-problem-using-gaussian-process-regression" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6433.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">309</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">12046</span> Parameter Identification Analysis in the Design of Rock Fill Dams</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=G.%20Shahzadi">G. Shahzadi</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Soulaimani"> A. Soulaimani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research work aims to identify the physical parameters of the constitutive soil model in the design of a rockfill dam by inverse analysis. The best parameters of the constitutive soil model, are those that minimize the objective function, defined as the difference between the measured and numerical results. The Finite Element code (Plaxis) has been utilized for numerical simulation. Polynomial and neural network-based response surfaces have been generated to analyze the relationship between soil parameters and displacements. The performance of surrogate models has been analyzed and compared by evaluating the root mean square error. A comparative study has been done based on objective functions and optimization techniques. Objective functions are categorized by considering measured data with and without uncertainty in instruments, defined by the least square method, which estimates the norm between the predicted displacements and the measured values. Hydro Quebec provided data sets for the measured values of the Romaine-2 dam. Stochastic optimization, an approach that can overcome local minima, and solve non-convex and non-differentiable problems with ease, is used to obtain an optimum value. Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Differential Evolution (DE) are compared for the minimization problem, although all these techniques take time to converge to an optimum value; however, PSO provided the better convergence and best soil parameters. Overall, parameter identification analysis could be effectively used for the rockfill dam application and has the potential to become a valuable tool for geotechnical engineers for assessing dam performance and dam safety. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rockfill%20dam" title="Rockfill dam">Rockfill dam</a>, <a href="https://publications.waset.org/abstracts/search?q=parameter%20identification" title=" parameter identification"> parameter identification</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20analysis" title=" stochastic analysis"> stochastic analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=regression" title=" regression"> regression</a>, <a href="https://publications.waset.org/abstracts/search?q=PLAXIS" title=" PLAXIS"> PLAXIS</a> </p> <a href="https://publications.waset.org/abstracts/110580/parameter-identification-analysis-in-the-design-of-rock-fill-dams" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/110580.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">146</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">12045</span> Portfolio Risk Management Using Quantum Annealing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Thomas%20Doutre">Thomas Doutre</a>, <a href="https://publications.waset.org/abstracts/search?q=Emmanuel%20De%20Meric%20De%20Bellefon"> Emmanuel De Meric De Bellefon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper describes the application of local-search metaheuristic quantum annealing to portfolio opti- mization. Heuristic technics are particularly handy when Markowitz’ classical Mean-Variance problem is enriched with additional realistic constraints. Once tailored to the problem, computational experiments on real collected data have shown the superiority of quantum annealing over simulated annealing for this constrained optimization problem, taking advantages of quantum effects such as tunnelling. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimization" title="optimization">optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=portfolio%20risk%20management" title=" portfolio risk management"> portfolio risk management</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20annealing" title=" quantum annealing"> quantum annealing</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristic" title=" metaheuristic"> metaheuristic</a> </p> <a href="https://publications.waset.org/abstracts/40564/portfolio-risk-management-using-quantum-annealing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40564.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">383</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=local%20minima%20problem&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=local%20minima%20problem&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=local%20minima%20problem&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=local%20minima%20problem&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=local%20minima%20problem&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=local%20minima%20problem&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=local%20minima%20problem&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=local%20minima%20problem&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=local%20minima%20problem&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=local%20minima%20problem&page=402">402</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=local%20minima%20problem&page=403">403</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=local%20minima%20problem&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>