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: convex feasibility problem</title> <meta name="description" content="Search results for: convex feasibility problem"> <meta name="keywords" content="convex feasibility 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="convex feasibility 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/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="convex feasibility 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> 3949</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: convex feasibility problem</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3679</span> The Economic Lot Scheduling Problem in Flow Lines with Sequence-Dependent Setups</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Heydari">M. Heydari</a>, <a href="https://publications.waset.org/search?q=S.%20A.%20Torabi"> S. A. Torabi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The problem of lot sizing, sequencing and scheduling multiple products in flow line production systems has been studied by several authors. Almost all of the researches in this area assumed that setup times and costs are sequence –independent even though sequence dependent setups are common in practice. In this paper we present a new mixed integer non linear program (MINLP) and a heuristic method to solve the problem in sequence dependent case. Furthermore, a genetic algorithm has been developed which applies this constructive heuristic to generate initial population. These two proposed solution methods are compared on randomly generated problems. Computational results show a clear superiority of our proposed GA for majority of the test problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Economic%20lot%20scheduling%20problem" title="Economic lot scheduling problem">Economic lot scheduling problem</a>, <a href="https://publications.waset.org/search?q=finite%20horizon" title=" finite horizon"> finite horizon</a>, <a href="https://publications.waset.org/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/search?q=mixed%20zero-one%20nonlinear%20programming" title=" mixed zero-one nonlinear programming"> mixed zero-one nonlinear programming</a>, <a href="https://publications.waset.org/search?q=sequence-dependent." title=" sequence-dependent."> sequence-dependent.</a> </p> <a href="https://publications.waset.org/14466/the-economic-lot-scheduling-problem-in-flow-lines-with-sequence-dependent-setups" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14466/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14466/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14466/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14466/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14466/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14466/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14466/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14466/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14466/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14466/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14466.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">1538</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3678</span> A New Integer Programming Formulation for the Chinese Postman Problem with Time Dependent Travel Times</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jinghao%20Sun">Jinghao Sun</a>, <a href="https://publications.waset.org/search?q=Guozhen%20Tan"> Guozhen Tan</a>, <a href="https://publications.waset.org/search?q=Guangjian%20Hou"> Guangjian Hou</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Chinese Postman Problem (CPP) is one of the classical problems in graph theory and is applicable in a wide range of fields. With the rapid development of hybrid systems and model based testing, Chinese Postman Problem with Time Dependent Travel Times (CPPTDT) becomes more realistic than the classical problems. In the literature, we have proposed the first integer programming formulation for the CPPTDT problem, namely, circuit formulation, based on which some polyhedral results are investigated and a cutting plane algorithm is also designed. However, there exists a main drawback: the circuit formulation is only available for solving the special instances with all circuits passing through the origin. Therefore, this paper proposes a new integer programming formulation for solving all the general instances of CPPTDT. Moreover, the size of the circuit formulation is too large, which is reduced dramatically here. Thus, it is possible to design more efficient algorithm for solving the CPPTDT in the future research. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Chinese%20Postman%20Problem" title="Chinese Postman Problem">Chinese Postman Problem</a>, <a href="https://publications.waset.org/search?q=Time%20Dependent" title=" Time Dependent"> Time Dependent</a>, <a href="https://publications.waset.org/search?q=Integer%20Programming" title=" Integer Programming"> Integer Programming</a>, <a href="https://publications.waset.org/search?q=Upper%20Bound%20Analysis." title=" Upper Bound Analysis."> Upper Bound Analysis.</a> </p> <a href="https://publications.waset.org/9764/a-new-integer-programming-formulation-for-the-chinese-postman-problem-with-time-dependent-travel-times" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9764/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9764/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9764/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9764/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9764/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9764/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9764/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9764/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9764/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9764/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9764.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">2740</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3677</span> Feasibility Studies through Quantitative Methods: The Revamping of a Tourist Railway Line in Italy</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Armando%20Carten%C3%AC">Armando Cartenì</a>, <a href="https://publications.waset.org/search?q=Ilaria%20Henke"> Ilaria Henke </a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Recently, the Italian government has approved a new law for public contracts and has been laying the groundwork for restarting a planning phase. The government has adopted the indications given by the European Commission regarding the estimation of the external costs within the Cost-Benefit Analysis, and has been approved the ‘Guidelines for assessment of Investment Projects’. In compliance with the new Italian law, the aim of this research was to perform a feasibility study applying quantitative methods regarding the revamping of an Italian tourist railway line. A Cost-Benefit Analysis was performed starting from the quantification of the passengers’ demand potentially interested in using the revamped rail services. The benefits due to the external costs reduction were also estimated (quantified) in terms of variations (with respect to the not project scenario): climate change, air pollution, noises, congestion, and accidents. Estimations results have been proposed in terms of the Measure of Effectiveness underlying a positive Net Present Value equal to about 27 million of Euros, an Internal Rate of Return much greater the discount rate, a benefit/cost ratio equal to 2 and a PayBack Period of 15 years.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cost-benefit%20analysis" title="Cost-benefit analysis">Cost-benefit analysis</a>, <a href="https://publications.waset.org/search?q=evaluation%20analysis" title=" evaluation analysis"> evaluation analysis</a>, <a href="https://publications.waset.org/search?q=demand%20management" title=" demand management"> demand management</a>, <a href="https://publications.waset.org/search?q=external%20cost" title=" external cost"> external cost</a>, <a href="https://publications.waset.org/search?q=transport%20planning" title=" transport planning"> transport planning</a>, <a href="https://publications.waset.org/search?q=quality." title=" quality."> quality.</a> </p> <a href="https://publications.waset.org/10007837/feasibility-studies-through-quantitative-methods-the-revamping-of-a-tourist-railway-line-in-italy" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10007837/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10007837/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10007837/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10007837/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10007837/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10007837/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10007837/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10007837/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10007837/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10007837/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10007837.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">882</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3676</span> A Nondominated Sorting Genetic Algorithm for Shortest Path Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=C.%20Chitra">C. Chitra</a>, <a href="https://publications.waset.org/search?q=P.%20Subbaraj"> P. Subbaraj</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The shortest path routing problem is a multiobjective nonlinear optimization problem with constraints. This problem has been addressed by considering Quality of service parameters, delay and cost objectives separately or as a weighted sum of both objectives. Multiobjective evolutionary algorithms can find multiple pareto-optimal solutions in one single run and this ability makes them attractive for solving problems with multiple and conflicting objectives. This paper uses an elitist multiobjective evolutionary algorithm based on the Non-dominated Sorting Genetic Algorithm (NSGA), for solving the dynamic shortest path routing problem in computer networks. A priority-based encoding scheme is proposed for population initialization. Elitism ensures that the best solution does not deteriorate in the next generations. Results for a sample test network have been presented to demonstrate the capabilities of the proposed approach to generate well-distributed pareto-optimal solutions of dynamic routing problem in one single run. The results obtained by NSGA are compared with single objective weighting factor method for which Genetic Algorithm (GA) was applied.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Multiobjective%20optimization" title="Multiobjective optimization">Multiobjective optimization</a>, <a href="https://publications.waset.org/search?q=Non-dominated%20Sorting%20Genetic%20Algorithm" title=" Non-dominated Sorting Genetic Algorithm"> Non-dominated Sorting Genetic Algorithm</a>, <a href="https://publications.waset.org/search?q=Routing" title=" Routing"> Routing</a>, <a href="https://publications.waset.org/search?q=Weighted%20sum." title=" Weighted sum."> Weighted sum.</a> </p> <a href="https://publications.waset.org/12113/a-nondominated-sorting-genetic-algorithm-for-shortest-path-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12113/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12113/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12113/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12113/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12113/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12113/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12113/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12113/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12113/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12113/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12113.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">1927</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3675</span> Modeling and Optimization of Part Type Selection and Loading Problem in Flexible Manufacturing System Using Real Coded Genetic Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Wayan%20F.%20Mahmudy">Wayan F. Mahmudy</a>, <a href="https://publications.waset.org/search?q=Romeo%20M.%20Marian"> Romeo M. Marian</a>, <a href="https://publications.waset.org/search?q=Lee%20H.%20S.%20Luong"> Lee H. S. Luong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p> This paper deals with modeling and optimization of two NP-hard problems in production planning of flexible manufacturing system (FMS), part type selection problem and loading problem. The part type selection problem and the loading problem are strongly related and heavily influence the system’s efficiency and productivity. These problems have been modeled and solved simultaneously by using real coded genetic algorithms (RCGA) which uses an array of real numbers as chromosome representation. The novel proposed chromosome representation produces only feasible solutions which minimize a computational time needed by GA to push its population toward feasible search space or repair infeasible chromosomes. The proposed RCGA improves the FMS performance by considering two objectives, maximizing system throughput and maintaining the balance of the system (minimizing system unbalance). The resulted objective values are compared to the optimum values produced by branch-and-bound method. The experiments show that the proposed RCGA could reach near optimum solutions in a reasonable amount of time.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Flexible%20manufacturing%20system" title="Flexible manufacturing system">Flexible manufacturing system</a>, <a href="https://publications.waset.org/search?q=production%20planning" title=" production planning"> production planning</a>, <a href="https://publications.waset.org/search?q=part%20type%20selection%20problem" title=" part type selection problem"> part type selection problem</a>, <a href="https://publications.waset.org/search?q=loading%20problem" title=" loading problem"> loading problem</a>, <a href="https://publications.waset.org/search?q=real-coded%20genetic%20algorithm." title=" real-coded genetic algorithm. "> real-coded genetic algorithm. </a> </p> <a href="https://publications.waset.org/9997084/modeling-and-optimization-of-part-type-selection-and-loading-problem-in-flexible-manufacturing-system-using-real-coded-genetic-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997084/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997084/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997084/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997084/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997084/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997084/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997084/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997084/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997084/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997084/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997084.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">2633</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3674</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/search?q=Adel%20Bouchakhchoukha">Adel Bouchakhchoukha</a>, <a href="https://publications.waset.org/search?q=Hakim%20Akeb"> Hakim Akeb</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <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> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Team%20Orienteering%20Problem" title="Team Orienteering Problem">Team Orienteering Problem</a>, <a href="https://publications.waset.org/search?q=Vehicle%20Routing" title=" Vehicle Routing"> Vehicle Routing</a>, <a href="https://publications.waset.org/search?q=Beam%0D%0ASearch" title=" Beam Search"> Beam Search</a>, <a href="https://publications.waset.org/search?q=Local%20Search." title=" Local Search."> Local Search.</a> </p> <a href="https://publications.waset.org/9999294/a-hybrid-heuristic-for-the-team-orienteering-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9999294/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9999294/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9999294/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9999294/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9999294/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9999294/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9999294/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9999294/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9999294/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9999294/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9999294.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">2639</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3673</span> An Asymptotic Formula for Pricing an American Exchange Option</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Hsuan-Ku%20Liu">Hsuan-Ku Liu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, the American exchange option (AEO) valuation problem is modelled as a free boundary problem. The critical stock price for an AEO is satisfied an integral equation implicitly. When the remaining time is large enough, an asymptotic formula is provided for pricing an AEO. The numerical results reveal that our asymptotic pricing formula is robust and accurate for the long-term AEO.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Integral%20equation" title="Integral equation">Integral equation</a>, <a href="https://publications.waset.org/search?q=asymptotic%20solution" title=" asymptotic solution"> asymptotic solution</a>, <a href="https://publications.waset.org/search?q=free%20boundary%20problem" title=" free boundary problem"> free boundary problem</a>, <a href="https://publications.waset.org/search?q=American%20exchange%20option." title=" American exchange option."> American exchange option.</a> </p> <a href="https://publications.waset.org/13180/an-asymptotic-formula-for-pricing-an-american-exchange-option" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13180/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13180/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13180/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13180/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13180/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13180/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13180/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13180/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13180/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13180/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13180.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">1613</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3672</span> Determining Optimal Production Plan by Revised Surrogate Worth Trade-off Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Tunjo%20Peric">Tunjo Peric</a>, <a href="https://publications.waset.org/search?q=Zoran%20Babic"> Zoran Babic</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The authors of this work indicate by means of a concrete example that it is possible to apply efficaciously the method of multiple criteria programming in dealing with the problem of determining the optimal production plan for a certain period of time. The work presents: (1) the selection of optimization criteria, (2) the setting of the problem of determining an optimal production plan, (3) the setting of the model of multiple criteria programming in finding a solution to a given problem, (4) the revised surrogate trade-off method, (5) generalized multicriteria model for solving production planning problem and problem of choosing technological variants in the metal manufacturing industry. In the final part of this work the authors reflect on the application of the method of multiple criteria programming while determining the optimal production plan in manufacturing enterprises.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=multi-criteria%20programming" title="multi-criteria programming">multi-criteria programming</a>, <a href="https://publications.waset.org/search?q=production%20planning" title=" production planning"> production planning</a>, <a href="https://publications.waset.org/search?q=technological%20variant" title=" technological variant"> technological variant</a>, <a href="https://publications.waset.org/search?q=Surrogate%20Worth%20Trade-off%20Method." title=" Surrogate Worth Trade-off Method."> Surrogate Worth Trade-off Method.</a> </p> <a href="https://publications.waset.org/13011/determining-optimal-production-plan-by-revised-surrogate-worth-trade-off-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13011/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13011/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13011/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13011/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13011/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13011/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13011/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13011/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13011/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13011/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13011.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">1853</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3671</span> Augmented Reality for Maintenance Operator for Problem Inspections</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Chong-Yang%20Qiao">Chong-Yang Qiao</a>, <a href="https://publications.waset.org/search?q=Teeravarunyou%20Sakol"> Teeravarunyou Sakol</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Current production-oriented factories need maintenance operators to work in shifts monitoring and inspecting complex systems and different equipment in the situation of mechanical breakdown. Augmented reality (AR) is an emerging technology that embeds data into the environment for situation awareness to help maintenance operators make decisions and solve problems. An application was designed to identify the problem of steam generators and inspection centrifugal pumps. The objective of this research was to find the best medium of AR and type of problem solving strategies among analogy, focal object method and mean-ends analysis. Two scenarios of inspecting leakage were temperature and vibration. Two experiments were used in usability evaluation and future innovation, which included decision-making process and problem-solving strategy. This study found that maintenance operators prefer build-in magnifier to zoom the components (55.6%), 3D exploded view to track the problem parts (50%), and line chart to find the alter data or information (61.1%). There is a significant difference in the use of analogy (44.4%), focal objects (38.9%) and mean-ends strategy (16.7%). The marked differences between maintainers and operators are of the application of a problem solving strategy. However, future work should explore multimedia information retrieval which supports maintenance operators for decision-making. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Augmented%20reality" title="Augmented reality">Augmented reality</a>, <a href="https://publications.waset.org/search?q=situation%20awareness" title=" situation awareness"> situation awareness</a>, <a href="https://publications.waset.org/search?q=decision-making" title=" decision-making"> decision-making</a>, <a href="https://publications.waset.org/search?q=problem-solving." title=" problem-solving."> problem-solving.</a> </p> <a href="https://publications.waset.org/10005423/augmented-reality-for-maintenance-operator-for-problem-inspections" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10005423/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10005423/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10005423/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10005423/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10005423/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10005423/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10005423/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10005423/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10005423/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10005423/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10005423.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">1345</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3670</span> Quantum Computing: A New Era of Computing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jyoti%20Chaturvedi%20Gursaran">Jyoti Chaturvedi Gursaran</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Nature conducts its action in a very private manner. To reveal these actions classical science has done a great effort. But classical science can experiment only with the things that can be seen with eyes. Beyond the scope of classical science quantum science works very well. It is based on some postulates like qubit, superposition of two states, entanglement, measurement and evolution of states that are briefly described in the present paper. One of the applications of quantum computing i.e. implementation of a novel quantum evolutionary algorithm(QEA) to automate the time tabling problem of Dayalbagh Educational Institute (Deemed University) is also presented in this paper. Making a good timetable is a scheduling problem. It is NP-hard, multi-constrained, complex and a combinatorial optimization problem. The solution of this problem cannot be obtained in polynomial time. The QEA uses genetic operators on the Q-bit as well as updating operator of quantum gate which is introduced as a variation operator to converge toward better solutions.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Quantum%20computing" title="Quantum computing">Quantum computing</a>, <a href="https://publications.waset.org/search?q=qubit" title=" qubit"> qubit</a>, <a href="https://publications.waset.org/search?q=superposition" title=" superposition"> superposition</a>, <a href="https://publications.waset.org/search?q=entanglement" title=" entanglement"> entanglement</a>, <a href="https://publications.waset.org/search?q=measurement%20of%20states" title=" measurement of states"> measurement of states</a>, <a href="https://publications.waset.org/search?q=evolution%20of%20states" title=" evolution of states"> evolution of states</a>, <a href="https://publications.waset.org/search?q=Scheduling%0D%0Aproblem" title=" Scheduling problem"> Scheduling problem</a>, <a href="https://publications.waset.org/search?q=hard%20and%20soft%20constraints" title=" hard and soft constraints"> hard and soft constraints</a>, <a href="https://publications.waset.org/search?q=evolutionary%20algorithm" title=" evolutionary algorithm"> evolutionary algorithm</a>, <a href="https://publications.waset.org/search?q=quantum%0D%0Aevolutionary%20algorithm." title=" quantum evolutionary algorithm."> quantum evolutionary algorithm.</a> </p> <a href="https://publications.waset.org/16516/quantum-computing-a-new-era-of-computing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/16516/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/16516/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/16516/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/16516/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/16516/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/16516/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/16516/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/16516/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/16516/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/16516/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/16516.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">2662</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3669</span> The Frequency Graph for the Traveling Salesman Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Y.%20Wang">Y. Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Traveling salesman problem (TSP) is hard to resolve when the number of cities and routes become large. The frequency graph is constructed to tackle the problem. A frequency graph maintains the topological relationships of the original weighted graph. The numbers on the edges are the frequencies of the edges emulated from the local optimal Hamiltonian paths. The simplest kind of local optimal Hamiltonian paths are computed based on the four vertices and three lines inequality. The search algorithm is given to find the optimal Hamiltonian circuit based on the frequency graph. The experiments show that the method can find the optimal Hamiltonian circuit within several trials. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Traveling%20salesman%20problem" title="Traveling salesman problem">Traveling salesman problem</a>, <a href="https://publications.waset.org/search?q=frequency%20graph" title=" frequency graph"> frequency graph</a>, <a href="https://publications.waset.org/search?q=local%0Aoptimal%20Hamiltonian%20path" title=" local optimal Hamiltonian path"> local optimal Hamiltonian path</a>, <a href="https://publications.waset.org/search?q=four%20vertices%20and%20three%20lines%20inequality." title=" four vertices and three lines inequality."> four vertices and three lines inequality.</a> </p> <a href="https://publications.waset.org/2862/the-frequency-graph-for-the-traveling-salesman-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2862/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2862/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2862/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2862/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2862/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2862/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2862/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2862/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2862/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2862/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2862.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">1771</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3668</span> Identifying an Unknown Source in the Poisson Equation by a Modified Tikhonov Regularization Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ou%20Xie">Ou Xie</a>, <a href="https://publications.waset.org/search?q=Zhenyu%20Zhao"> Zhenyu Zhao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, we consider the problem for identifying the unknown source in the Poisson equation. A modified Tikhonov regularization method is presented to deal with illposedness of the problem and error estimates are obtained with an a priori strategy and an a posteriori choice rule to find the regularization parameter. Numerical examples show that the proposed method is effective and stable.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Ill-posed%20problem" title="Ill-posed problem">Ill-posed problem</a>, <a href="https://publications.waset.org/search?q=Unknown%20source" title=" Unknown source"> Unknown source</a>, <a href="https://publications.waset.org/search?q=Poisson%20equation" title=" Poisson equation"> Poisson equation</a>, <a href="https://publications.waset.org/search?q=Tikhonov%20regularization%20method" title=" Tikhonov regularization method"> Tikhonov regularization method</a>, <a href="https://publications.waset.org/search?q=Discrepancy%20principle" title=" Discrepancy principle"> Discrepancy principle</a> </p> <a href="https://publications.waset.org/892/identifying-an-unknown-source-in-the-poisson-equation-by-a-modified-tikhonov-regularization-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/892/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/892/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/892/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/892/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/892/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/892/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/892/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/892/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/892/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/892/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/892.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">1450</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3667</span> Discrete Time Optimal Solution for the Connection Admission Control Problem </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=C.%20Bruni">C. Bruni</a>, <a href="https://publications.waset.org/search?q=F.%20Delli%20Priscoli"> F. Delli Priscoli</a>, <a href="https://publications.waset.org/search?q=G.%20Koch"> G. Koch</a>, <a href="https://publications.waset.org/search?q=I.%20Marchetti"> I. Marchetti</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The Connection Admission Control (CAC) problem is formulated in this paper as a discrete time optimal control problem. The control variables account for the acceptance/ rejection of new connections and forced dropping of in-progress connections. These variables are constrained to meet suitable conditions which account for the QoS requirements (Link Availability, Blocking Probability, Dropping Probability). The performance index evaluates the total throughput. At each discrete time, the problem is solved as an integer-valued linear programming one. The proposed procedure was successfully tested against suitably simulated data.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Connection%20Admission%20Control" title="Connection Admission Control">Connection Admission Control</a>, <a href="https://publications.waset.org/search?q=Optimal%20Control" title=" Optimal Control"> Optimal Control</a>, <a href="https://publications.waset.org/search?q=Integer%20valued%20Linear%20Programming" title=" Integer valued Linear Programming"> Integer valued Linear Programming</a>, <a href="https://publications.waset.org/search?q=Quality%20of%20Service%20Requirements" title=" Quality of Service Requirements"> Quality of Service Requirements</a>, <a href="https://publications.waset.org/search?q=Robust%20Control." title=" Robust Control."> Robust Control.</a> </p> <a href="https://publications.waset.org/5217/discrete-time-optimal-solution-for-the-connection-admission-control-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5217/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5217/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5217/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5217/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5217/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5217/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5217/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5217/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5217/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5217/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5217.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">1262</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3666</span> Efficacy of Recovery Tech Virtual Reality Rehabilitation System for Shoulder Impingement Syndrome</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kasra%20Afsahi">Kasra Afsahi</a>, <a href="https://publications.waset.org/search?q=Maryam%20Soheilifar"> Maryam Soheilifar</a>, <a href="https://publications.waset.org/search?q=Nazanin%20Vahed"> Nazanin Vahed</a>, <a href="https://publications.waset.org/search?q=Omid%20Seyed%20Esmaeili"> Omid Seyed Esmaeili</a>, <a href="https://publications.waset.org/search?q=S.%20Hossein%20Hosseini"> S. Hossein Hosseini</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The most common cause of shoulder pain occurs when rotator cuff tendons become trapped under the bony area in the shoulder. This pilot study was performed to evaluate the feasibility of Virtual Reality based rehabilitation of shoulder impingement syndrome in athletes. Three consecutive patients with subacromial impingement syndrome were enrolled. The participants were rehabilitated for 5 times a week for 4 weeks, 20 sessions in total (with duration of each session being 60 minutes). In addition to the conventional rehabilitation program, a 10-minute game-based virtual reality exercise was administered. Primary outcome measures were range of motion evaluated with goniometer, pain sensation, disability intensity using ‘The Disabilities of the Arm, Shoulder and Hand Questionnaire’, muscle strength using ‘dynamometer’; pain threshold with 'algometer' and level of satisfaction. There were significant improvements in the range of motion, pain sensation, disability, pain threshold and muscle strength compared to basis (P < 0.05). There were no major adverse effects. This study showed the usefulness of VR therapy as an adjunct to conventional physiotherapy in improving function in patients with shoulder impingement syndrome.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Shoulder%20impingement%20syndrome" title="Shoulder impingement syndrome">Shoulder impingement syndrome</a>, <a href="https://publications.waset.org/search?q=VR%20therapy" title=" VR therapy"> VR therapy</a>, <a href="https://publications.waset.org/search?q=feasibility" title=" feasibility"> feasibility</a>, <a href="https://publications.waset.org/search?q=rehabilitation." title=" rehabilitation."> rehabilitation.</a> </p> <a href="https://publications.waset.org/10013066/efficacy-of-recovery-tech-virtual-reality-rehabilitation-system-for-shoulder-impingement-syndrome" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10013066/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10013066/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10013066/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10013066/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10013066/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10013066/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10013066/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10013066/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10013066/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10013066/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10013066.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">403</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3665</span> Multilevel Fuzzy Decision Support Model for China-s Urban Rail Transit Planning Schemes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jin-Bao%20Zhao">Jin-Bao Zhao</a>, <a href="https://publications.waset.org/search?q=Wei%20Deng"> Wei Deng</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper aims at developing a multilevel fuzzy decision support model for urban rail transit planning schemes in China under the background that China is presently experiencing an unprecedented construction of urban rail transit. In this study, an appropriate model using multilevel fuzzy comprehensive evaluation method is developed. In the decision process, the followings are considered as the influential objectives: traveler attraction, environment protection, project feasibility and operation. In addition, consistent matrix analysis method is used to determine the weights between objectives and the weights between the objectives- sub-indictors, which reduces the work caused by repeated establishment of the decision matrix on the basis of ensuring the consistency of decision matrix. The application results show that multilevel fuzzy decision model can perfectly deal with the multivariable and multilevel decision process, which is particularly useful in the resolution of multilevel decision-making problem of urban rail transit planning schemes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Urban%20rail%20transit" title="Urban rail transit">Urban rail transit</a>, <a href="https://publications.waset.org/search?q=planning%20schemes" title=" planning schemes"> planning schemes</a>, <a href="https://publications.waset.org/search?q=multilevel%20fuzzy%0Adecision%20support%20model" title=" multilevel fuzzy decision support model"> multilevel fuzzy decision support model</a>, <a href="https://publications.waset.org/search?q=consistent%20matrix%20analysis" title=" consistent matrix analysis"> consistent matrix analysis</a> </p> <a href="https://publications.waset.org/3937/multilevel-fuzzy-decision-support-model-for-china-s-urban-rail-transit-planning-schemes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3937/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3937/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3937/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3937/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3937/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3937/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3937/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3937/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3937/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3937/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3937.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">1319</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3664</span> Two-dimensional Differential Transform Method for Solving Linear and Non-linear Goursat Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=H.%20Taghvafard">H. Taghvafard</a>, <a href="https://publications.waset.org/search?q=G.%20H.%20Erjaee"> G. H. Erjaee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A method for solving linear and non-linear Goursat problem is given by using the two-dimensional differential transform method. The approximate solution of this problem is calculated in the form of a series with easily computable terms and also the exact solutions can be achieved by the known forms of the series solutions. The method can easily be applied to many linear and non-linear problems and is capable of reducing the size of computational work. Several examples are given to demonstrate the reliability and the performance of the presented method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Quadrature" title="Quadrature">Quadrature</a>, <a href="https://publications.waset.org/search?q=Spline%20interpolation" title=" Spline interpolation"> Spline interpolation</a>, <a href="https://publications.waset.org/search?q=Trapezoidal%20rule" title=" Trapezoidal rule"> Trapezoidal rule</a>, <a href="https://publications.waset.org/search?q=Numericalintegration" title=" Numericalintegration"> Numericalintegration</a>, <a href="https://publications.waset.org/search?q=Error%20analysis." title=" Error analysis."> Error analysis.</a> </p> <a href="https://publications.waset.org/6124/two-dimensional-differential-transform-method-for-solving-linear-and-non-linear-goursat-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6124/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6124/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6124/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6124/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6124/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6124/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6124/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6124/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6124/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6124/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6124.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">2385</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3663</span> An Algorithm for the Map Labeling Problem with Two Kinds of Priorities</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Noboru%20Abe">Noboru Abe</a>, <a href="https://publications.waset.org/search?q=Yoshinori%20Amai"> Yoshinori Amai</a>, <a href="https://publications.waset.org/search?q=Toshinori%20Nakatake"> Toshinori Nakatake</a>, <a href="https://publications.waset.org/search?q=Sumio%20Masuda"> Sumio Masuda</a>, <a href="https://publications.waset.org/search?q=Kazuaki%20Yamaguchi"> Kazuaki Yamaguchi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>We consider the problem of placing labels of the points on a plane. For each point, its position, the size of its label and a priority are given. Moreover, several candidates of its label positions are prespecified, and each of such label positions is assigned a priority. The objective of our problem is to maximize the total sum of priorities of placed labels and their points. By refining a labeling algorithm that can use these priorities, we propose a new heuristic algorithm which is more suitable for treating the assigned priorities.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Map%20labeling" title="Map labeling">Map labeling</a>, <a href="https://publications.waset.org/search?q=greedy%20algorithm" title=" greedy algorithm"> greedy algorithm</a>, <a href="https://publications.waset.org/search?q=heuristic%20algorithm" title=" heuristic algorithm"> heuristic algorithm</a>, <a href="https://publications.waset.org/search?q=priority." title=" priority."> priority.</a> </p> <a href="https://publications.waset.org/9998264/an-algorithm-for-the-map-labeling-problem-with-two-kinds-of-priorities" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9998264/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9998264/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9998264/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9998264/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9998264/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9998264/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9998264/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9998264/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9998264/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9998264/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9998264.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">1452</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3662</span> Exergetic and Life Cycle Assessment Analyses of Integrated Biowaste Gasification-Combustion System: A Study Case</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Anabel%20Fernandez">Anabel Fernandez</a>, <a href="https://publications.waset.org/search?q=Leandro%20Rodriguez-Ortiz"> Leandro Rodriguez-Ortiz</a>, <a href="https://publications.waset.org/search?q=Rosa%20Rodr%C3%ADguez"> Rosa Rodríguez</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Due to the negative impact of fossil fuels, renewable energies are promising sources to limit global temperature rise and damage to the environment. Also, the development of technology is focused on obtaining energetic products from renewable sources. In this study, a thermodynamic model including exergy balance and a subsequent Life Cycle Assessment (LCA) were carried out for four subsystems of the integrated gasification-combustion of pinewood. Results of exergy analysis and LCA showed the process feasibility in terms of exergy efficiency and global energy efficiency of the life cycle (GEELC). Moreover, the energy return on investment (EROI) index was calculated. The global exergy efficiency resulted in 67%. For pretreatment, reaction, cleaning, and electric generation subsystems, the results were 85%, 59%, 87%, and 29%, respectively. Results of LCA indicated that the emissions from the electric generation caused the most damage to the atmosphere, water, and soil. GEELC resulted in 31.09% for the global process. This result suggested the environmental feasibility of an integrated gasification-combustion system. EROI resulted in 3.15, which determines the sustainability of the process.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Exergy%20analysis" title="Exergy analysis">Exergy analysis</a>, <a href="https://publications.waset.org/search?q=Life%20Cycle%20Assessment" title=" Life Cycle Assessment"> Life Cycle Assessment</a>, <a href="https://publications.waset.org/search?q=LCA" title=" LCA"> LCA</a>, <a href="https://publications.waset.org/search?q=renewability" title=" renewability"> renewability</a>, <a href="https://publications.waset.org/search?q=sustainability." title=" sustainability."> sustainability.</a> </p> <a href="https://publications.waset.org/10012681/exergetic-and-life-cycle-assessment-analyses-of-integrated-biowaste-gasification-combustion-system-a-study-case" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10012681/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10012681/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10012681/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10012681/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10012681/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10012681/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10012681/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10012681/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10012681/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10012681/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10012681.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">464</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3661</span> Using Pattern Search Methods for Minimizing Clustering Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Parvaneh%20Shabanzadeh">Parvaneh Shabanzadeh</a>, <a href="https://publications.waset.org/search?q=Malik%20Hj%20Abu%20Hassan"> Malik Hj Abu Hassan</a>, <a href="https://publications.waset.org/search?q=Leong%20Wah%20June"> Leong Wah June</a>, <a href="https://publications.waset.org/search?q=Maryam%20Mohagheghtabar"> Maryam Mohagheghtabar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Clustering is one of an interesting data mining topics that can be applied in many fields. Recently, the problem of cluster analysis is formulated as a problem of nonsmooth, nonconvex optimization, and an algorithm for solving the cluster analysis problem based on nonsmooth optimization techniques is developed. This optimization problem has a number of characteristics that make it challenging: it has many local minimum, the optimization variables can be either continuous or categorical, and there are no exact analytical derivatives. In this study we show how to apply a particular class of optimization methods known as pattern search methods to address these challenges. These methods do not explicitly use derivatives, an important feature that has not been addressed in previous studies. Results of numerical experiments are presented which demonstrate the effectiveness of the proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Clustering%20functions" title="Clustering functions">Clustering functions</a>, <a href="https://publications.waset.org/search?q=Non-smooth%20Optimization" title=" Non-smooth Optimization"> Non-smooth Optimization</a>, <a href="https://publications.waset.org/search?q=Nonconvex%20Optimization" title=" Nonconvex Optimization"> Nonconvex Optimization</a>, <a href="https://publications.waset.org/search?q=Pattern%20Search%20Method." title=" Pattern Search Method."> Pattern Search Method.</a> </p> <a href="https://publications.waset.org/1125/using-pattern-search-methods-for-minimizing-clustering-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1125/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1125/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1125/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1125/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1125/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1125/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1125/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1125/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1125/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1125/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1125.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">1641</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3660</span> Fuzzy Shortest Paths Approximation for Solving the Fuzzy Steiner Tree Problem in Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Milo%C5%A1%20%C5%A0eda">Miloš Šeda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we deal with the Steiner tree problem (STP) on a graph in which a fuzzy number, instead of a real number, is assigned to each edge. We propose a modification of the shortest paths approximation based on the fuzzy shortest paths (FSP) evaluations. Since a fuzzy min operation using the extension principle leads to nondominated solutions, we propose another approach to solving the FSP using Cheng's centroid point fuzzy ranking method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Steiner%20tree" title="Steiner tree">Steiner tree</a>, <a href="https://publications.waset.org/search?q=single%20shortest%20path%20problem" title=" single shortest path problem"> single shortest path problem</a>, <a href="https://publications.waset.org/search?q=fuzzyranking" title=" fuzzyranking"> fuzzyranking</a>, <a href="https://publications.waset.org/search?q=binary%20heap" title=" binary heap"> binary heap</a>, <a href="https://publications.waset.org/search?q=priority%20queue." title=" priority queue."> priority queue.</a> </p> <a href="https://publications.waset.org/13729/fuzzy-shortest-paths-approximation-for-solving-the-fuzzy-steiner-tree-problem-in-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13729/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13729/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13729/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13729/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13729/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13729/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13729/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13729/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13729/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13729/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13729.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">1695</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3659</span> Loudspeaker Parameters Inverse Problem for Improving Sound Frequency Response Simulation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Y.%20T.%20Tsai">Y. T. Tsai</a>, <a href="https://publications.waset.org/search?q=Jin%20H.%20Huang"> Jin H. Huang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The sound pressure level (SPL) of the moving-coil loudspeaker (MCL) is often simulated and analyzed using the lumped parameter model. However, the SPL of a MCL cannot be simulated precisely in the high frequency region, because the value of cone effective area is changed due to the geometry variation in different mode shapes, it is also related to affect the acoustic radiation mass and resistance. Herein, the paper presents the inverse method which has a high ability to measure the value of cone effective area in various frequency points, also can estimate the MCL electroacoustic parameters simultaneously. The proposed inverse method comprises the direct problem, adjoint problem, and sensitivity problem in collaboration with nonlinear conjugate gradient method. Estimated values from the inverse method are validated experimentally which compared with the measured SPL curve result. Results presented in this paper not only improve the accuracy of lumped parameter model but also provide the valuable information on loudspeaker cone design.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Inverse%20problem" title="Inverse problem">Inverse problem</a>, <a href="https://publications.waset.org/search?q=cone%20effective%20area" title=" cone effective area"> cone effective area</a>, <a href="https://publications.waset.org/search?q=loudspeaker" title=" loudspeaker"> loudspeaker</a>, <a href="https://publications.waset.org/search?q=nonlinear%20conjugate%20gradient%20method." title=" nonlinear conjugate gradient method."> nonlinear conjugate gradient method.</a> </p> <a href="https://publications.waset.org/9999024/loudspeaker-parameters-inverse-problem-for-improving-sound-frequency-response-simulation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9999024/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9999024/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9999024/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9999024/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9999024/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9999024/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9999024/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9999024/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9999024/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9999024/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9999024.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">2554</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3658</span> An Aggregate Production Planning Model for Brass Casting Industry in Fuzzy Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=%C3%96mer%20Faruk%20Bayko%C3%A7">Ömer Faruk Baykoç</a>, <a href="https://publications.waset.org/search?q=%C3%9Cmit%20Sami%20Sakalli"> Ümit Sami Sakalli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a fuzzy aggregate production planning (APP) model for blending problem in a brass factory which is the problem of computing optimal amounts of raw materials for the total production of several types of brass in a period. The model has deterministic and imprecise parameters which follows triangular possibility distributions. The brass casting APP model can not always be solved by using common approaches used in the literature. Therefore a mathematical model is presented for solving this problem. In the proposed model, the Lai and Hwang-s fuzzy ranking concept is relaxed by using one constraint instead of three constraints. An application of the brass casting APP model in a brass factory shows that the proposed model successfully solves the multi-blend problem in casting process and determines the optimal raw material purchasing policies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Aggregate%20production%20planning" title="Aggregate production planning">Aggregate production planning</a>, <a href="https://publications.waset.org/search?q=Blending" title=" Blending"> Blending</a>, <a href="https://publications.waset.org/search?q=brasscasting" title=" brasscasting"> brasscasting</a>, <a href="https://publications.waset.org/search?q=possibilistic%20programming." title=" possibilistic programming."> possibilistic programming.</a> </p> <a href="https://publications.waset.org/10723/an-aggregate-production-planning-model-for-brass-casting-industry-in-fuzzy-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10723/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10723/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10723/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10723/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10723/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10723/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10723/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10723/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10723/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10723/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10723.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">1908</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3657</span> Fourier Spectral Method for Analytic Continuation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Zhenyu%20Zhao">Zhenyu Zhao</a>, <a href="https://publications.waset.org/search?q=Lei%20You"> Lei You</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The numerical analytic continuation of a function f(z) = f(x + iy) on a strip is discussed in this paper. The data are only given approximately on the real axis. The periodicity of given data is assumed. A truncated Fourier spectral method has been introduced to deal with the ill-posedness of the problem. The theoretic results show that the discrepancy principle can work well for this problem. Some numerical results are also given to show the efficiency of the method.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Analytic%20continuation" title="Analytic continuation">Analytic continuation</a>, <a href="https://publications.waset.org/search?q=ill-posed%20problem" title=" ill-posed problem"> ill-posed problem</a>, <a href="https://publications.waset.org/search?q=regularization%20method%20Fourier%20spectral%20method" title=" regularization method Fourier spectral method"> regularization method Fourier spectral method</a>, <a href="https://publications.waset.org/search?q=the%20discrepancy%20principle." title=" the discrepancy principle."> the discrepancy principle.</a> </p> <a href="https://publications.waset.org/9760/fourier-spectral-method-for-analytic-continuation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9760/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9760/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9760/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9760/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9760/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9760/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9760/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9760/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9760/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9760/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9760.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">1499</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3656</span> Centre Of Mass Selection Operator Based Meta-Heuristic For Unbounded Knapsack Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=D.Venkatesan">D.Venkatesan</a>, <a href="https://publications.waset.org/search?q=K.Kannan"> K.Kannan</a>, <a href="https://publications.waset.org/search?q=S.%20Raja%20Balachandar"> S. Raja Balachandar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper a new Genetic Algorithm based on a heuristic operator and Centre of Mass selection operator (CMGA) is designed for the unbounded knapsack problem(UKP), which is NP-Hard combinatorial optimization problem. The proposed genetic algorithm is based on a heuristic operator, which utilizes problem specific knowledge. This center of mass operator when combined with other Genetic Operators forms a competitive algorithm to the existing ones. Computational results show that the proposed algorithm is capable of obtaining high quality solutions for problems of standard randomly generated knapsack instances. Comparative study of CMGA with simple GA in terms of results for unbounded knapsack instances of size up to 200 show the superiority of CMGA. Thus CMGA is an efficient tool of solving UKP and this algorithm is competitive with other Genetic Algorithms also.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20Algorithm" title="Genetic Algorithm">Genetic Algorithm</a>, <a href="https://publications.waset.org/search?q=Unbounded%20Knapsack%20Problem" title=" Unbounded Knapsack Problem"> Unbounded Knapsack Problem</a>, <a href="https://publications.waset.org/search?q=Combinatorial%20Optimization" title=" Combinatorial Optimization"> Combinatorial Optimization</a>, <a href="https://publications.waset.org/search?q=Meta-Heuristic" title=" Meta-Heuristic"> Meta-Heuristic</a>, <a href="https://publications.waset.org/search?q=Center%20of%20Mass" title=" Center of Mass"> Center of Mass</a> </p> <a href="https://publications.waset.org/10903/centre-of-mass-selection-operator-based-meta-heuristic-for-unbounded-knapsack-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10903/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10903/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10903/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10903/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10903/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10903/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10903/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10903/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10903/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10903/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10903.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">1699</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3655</span> Utilization of Demolished Concrete Waste for New Construction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Asif%20Husain">Asif Husain</a>, <a href="https://publications.waset.org/search?q=Majid%20Matouq%20Assas"> Majid Matouq Assas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In recent years demolished concrete waste handling and management is the new primary challenging issue faced by the countries all over the world. It is very challenging and hectic problem that has to be tackled in an indigenous manner, it is desirable to completely recycle demolished concrete waste in order to protect natural resources and reduce environmental pollution. In this research paper an experimental study is carried out to investigate the feasibility and recycling of demolished waste concrete for new construction. The present investigation to be focused on recycling demolished waste materials in order to reduce construction cost and resolving housing problems faced by the low income communities of the world. The crushed demolished concrete wastes is segregated by sieving to obtain required sizes of aggregate, several tests were conducted to determine the aggregate properties before recycling it into new concrete. This research shows that the recycled aggregate that are obtained from site make good quality concrete. The compressive strength test results of partial replacement and full recycled aggregate concrete and are found to be higher than the compressive strength of normal concrete with new aggregate.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Demolished" title="Demolished">Demolished</a>, <a href="https://publications.waset.org/search?q=concrete%20waste" title=" concrete waste"> concrete waste</a>, <a href="https://publications.waset.org/search?q=recycle" title=" recycle"> recycle</a>, <a href="https://publications.waset.org/search?q=new%20concrete" title=" new concrete"> new concrete</a>, <a href="https://publications.waset.org/search?q=fresh%20coarse%20aggregate." title=" fresh coarse aggregate."> fresh coarse aggregate.</a> </p> <a href="https://publications.waset.org/8588/utilization-of-demolished-concrete-waste-for-new-construction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8588/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8588/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8588/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8588/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8588/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8588/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8588/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8588/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8588/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8588/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8588.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">5844</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3654</span> Development of Perez-Du Mortier Calibration Algorithm for Ground-Based Aerosol Optical Depth Measurement with Validation using SMARTS Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jedol%20Dayou">Jedol Dayou</a>, <a href="https://publications.waset.org/search?q=Jackson%20Hian%20Wui%20Chang"> Jackson Hian Wui Chang</a>, <a href="https://publications.waset.org/search?q=Rubena%20Yusoff"> Rubena Yusoff</a>, <a href="https://publications.waset.org/search?q=Ag.%20Sufiyan%20Abd.%20Hamid"> Ag. Sufiyan Abd. Hamid</a>, <a href="https://publications.waset.org/search?q=Fauziah%20Sulaiman"> Fauziah Sulaiman</a>, <a href="https://publications.waset.org/search?q=Justin%20Sentian"> Justin Sentian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Aerosols are small particles suspended in air that have wide varying spatial and temporal distributions. The concentration of aerosol in total columnar atmosphere is normally measured using aerosol optical depth (AOD). In long-term monitoring stations, accurate AOD retrieval is often difficult due to the lack of frequent calibration. To overcome this problem, a near-sea-level Langley calibration algorithm is developed using the combination of clear-sky detection model and statistical filter. It attempts to produce a dataset that consists of only homogenous and stable atmospheric condition for the Langley calibration purposes. In this paper, a radiance-based validation method is performed to further investigate the feasibility and consistency of the proposed algorithm at different location, day, and time. The algorithm is validated using SMARTS model based n DNI value. The overall results confirmed that the proposed calibration algorithm feasible and consistent for measurements taken at different sites and weather conditions.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Aerosol%20optical%20depth" title="Aerosol optical depth">Aerosol optical depth</a>, <a href="https://publications.waset.org/search?q=direct%20normal%20irradiance" title=" direct normal irradiance"> direct normal irradiance</a>, <a href="https://publications.waset.org/search?q=Langley%20calibration" title=" Langley calibration"> Langley calibration</a>, <a href="https://publications.waset.org/search?q=radiance-based%20validation" title=" radiance-based validation"> radiance-based validation</a>, <a href="https://publications.waset.org/search?q=SMARTS." title=" SMARTS. "> SMARTS. </a> </p> <a href="https://publications.waset.org/17241/development-of-perez-du-mortier-calibration-algorithm-for-ground-based-aerosol-optical-depth-measurement-with-validation-using-smarts-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/17241/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/17241/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/17241/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/17241/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/17241/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/17241/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/17241/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/17241/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/17241/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/17241/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/17241.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">1808</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3653</span> Sustainability as a Criterion in the Reconstruction of Libya’s Public Transport Infrastructure</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Haitam%20Emhemad">Haitam Emhemad</a>, <a href="https://publications.waset.org/search?q=Brian%20Agnew"> Brian Agnew</a>, <a href="https://publications.waset.org/search?q=David%20Greenwood"> David Greenwood</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Amongst the many priorities facing Libya following the 2011 uprising is the provision of a transport infrastructure that will meet the nation’s needs and not undermine its prospects for economic prosperity as with many developing economies non-technical issues such as management, planning and financing are the major barriers to the efficient and effective provision of transport infrastructure. This is particularly true in the case of the effective incorporation of sustainability criteria, and the research upon which this paper is based involves the examination of alternative ways of approaching this problem. It is probably fair to say that criteria that relate to sustainability have not, historically, featured strongly in Libya’s approach to the development of its transport infrastructure. However, the current reappraisal of how best to redevelop the country’s transport infrastructure that has been afforded by recent events may offer the opportunity to alter this. The research examines recent case studies from a number of countries to explore ways in which sustainability has been included as a criterion for planning and procurement decisions. There will also be an in-depth investigation into the Libyan planning and legislative context to examine the feasibility of the introduction of such sustainability criteria into the process of planning and procurement of Libya’s transport infrastructure.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Libya%20Reconstruction" title="Libya Reconstruction">Libya Reconstruction</a>, <a href="https://publications.waset.org/search?q=Sustainability%20criteria" title=" Sustainability criteria"> Sustainability criteria</a>, <a href="https://publications.waset.org/search?q=Transport%20Infrastructure." title=" Transport Infrastructure."> Transport Infrastructure.</a> </p> <a href="https://publications.waset.org/9998939/sustainability-as-a-criterion-in-the-reconstruction-of-libyas-public-transport-infrastructure" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9998939/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9998939/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9998939/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9998939/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9998939/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9998939/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9998939/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9998939/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9998939/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9998939/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9998939.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">2269</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3652</span> Fuzzy Multiple Criteria Decision Making for Unmanned Combat Aircraft Selection Using Proximity Measure Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=C.%20Ardil">C. Ardil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Intuitionistic fuzzy sets (IFS), Pythagorean fuzzy sets (PyFS), Picture fuzzy sets (PFS), q-rung orthopair fuzzy sets (q-ROF), Spherical fuzzy sets (SFS), T-spherical FS, and Neutrosophic sets (NS) are reviewed as multidimensional extensions of fuzzy sets in order to more explicitly and informatively describe the opinions of decision-making experts under uncertainty. To handle operations with standard fuzzy sets (SFS), the necessary operators; weighted arithmetic mean (WAM), weighted geometric mean (WGM), and Minkowski distance function are defined. The algorithm of the proposed proximity measure method (PMM) is provided with a multiple criteria group decision making method (MCDM) for use in a standard fuzzy set environment. To demonstrate the feasibility of the proposed method, the problem of selecting the best drone for an Air Force procurement request is used. The proximity measure method (PMM) based multidimensional standard fuzzy sets (SFS) is introduced to demonstrate its use with an issue involving unmanned combat aircraft selection.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=standard%20fuzzy%20sets%20%28SFS%29" title="standard fuzzy sets (SFS)">standard fuzzy sets (SFS)</a>, <a href="https://publications.waset.org/search?q=unmanned%20combat%20aircraft%20selection" title=" unmanned combat aircraft selection"> unmanned combat aircraft selection</a>, <a href="https://publications.waset.org/search?q=multiple%20criteria%20decision%20making%20%28MCDM%29" title=" multiple criteria decision making (MCDM)"> multiple criteria decision making (MCDM)</a>, <a href="https://publications.waset.org/search?q=proximity%20measure%20method%20%28PMM%29." title=" proximity measure method (PMM)."> proximity measure method (PMM).</a> </p> <a href="https://publications.waset.org/10012991/fuzzy-multiple-criteria-decision-making-for-unmanned-combat-aircraft-selection-using-proximity-measure-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10012991/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10012991/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10012991/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10012991/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10012991/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10012991/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10012991/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10012991/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10012991/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10012991/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10012991.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">360</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3651</span> The Use of Minor Setups in an EPQ Model with Constrained Production Period Length</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Behrouz%20Afshar%20Nadjafi">Behrouz Afshar Nadjafi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Extensive research has been devoted to economic production quantity (EPQ) problem. However, no attention has been paid to problems where production period length is constrained. In this paper, we address the problem of deciding the optimal production quantity and the number of minor setups within each cycle, in which, production period length is constrained but a minor setup is possible for pass the constraint. A mathematical model is developed and Iterated Local Search (ILS) is proposed to solve this problem. Finally, solution procedure illustrated with a numerical example and results are analyzed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=EPQ" title="EPQ">EPQ</a>, <a href="https://publications.waset.org/search?q=Inventory%20control" title=" Inventory control"> Inventory control</a>, <a href="https://publications.waset.org/search?q=minor%20setup" title=" minor setup"> minor setup</a>, <a href="https://publications.waset.org/search?q=ILS." title=" ILS."> ILS.</a> </p> <a href="https://publications.waset.org/10987/the-use-of-minor-setups-in-an-epq-model-with-constrained-production-period-length" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10987/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10987/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10987/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10987/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10987/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10987/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10987/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10987/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10987/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10987/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10987.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">1347</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3650</span> Sliding Mode Control with Fuzzy Boundary Layer to Air-Air Interception Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mustafa%20Resa%20Becan">Mustafa Resa Becan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The performance of a type of fuzzy sliding mode control is researched by considering the nonlinear characteristic of a missile-target interception problem to obtain a robust interception process. The variable boundary layer by using fuzzy logic is proposed to reduce the chattering around the switching surface then is applied to the interception model which was derived. The performances of the sliding mode control with constant and fuzzy boundary layer are compared at the end of the study and the results are evaluated.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Sliding%20mode%20control" title="Sliding mode control">Sliding mode control</a>, <a href="https://publications.waset.org/search?q=fuzzy" title=" fuzzy"> fuzzy</a>, <a href="https://publications.waset.org/search?q=boundary%20layer" title=" boundary layer"> boundary layer</a>, <a href="https://publications.waset.org/search?q=interception%20problem." title=" interception problem."> interception problem.</a> </p> <a href="https://publications.waset.org/9908/sliding-mode-control-with-fuzzy-boundary-layer-to-air-air-interception-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9908/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9908/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9908/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9908/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9908/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9908/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9908/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9908/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9908/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9908/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9908.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">2010</span> </span> </div> </div> <ul class="pagination"> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=convex%20feasibility%20problem&page=9" rel="prev">&lsaquo;</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=convex%20feasibility%20problem&page=1">1</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=convex%20feasibility%20problem&page=2">2</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/search?q=convex%20feasibility%20problem&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=convex%20feasibility%20problem&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=convex%20feasibility%20problem&page=9">9</a></li> <li class="page-item active"><span class="page-link">10</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=convex%20feasibility%20problem&page=11">11</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=convex%20feasibility%20problem&page=12">12</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=convex%20feasibility%20problem&page=13">13</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/search?q=convex%20feasibility%20problem&page=131">131</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=convex%20feasibility%20problem&page=132">132</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=convex%20feasibility%20problem&page=11" 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>