CINXE.COM

Search results for: Size Optimization of Trusses

<!DOCTYPE html> <html lang="en" dir="ltr"> <head> <!-- Google tag (gtag.js) --> <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script> <!-- Yandex.Metrika counter --> <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript> <!-- /Yandex.Metrika counter --> <!-- Matomo --> <!-- End Matomo Code --> <title>Search results for: Size Optimization of Trusses</title> <meta name="description" content="Search results for: Size Optimization of Trusses"> <meta name="keywords" content="Size Optimization of Trusses"> <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="Size Optimization of Trusses" 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="Size Optimization of Trusses"> <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> 3558</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: Size Optimization of Trusses</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3558</span> Improved Hill Climbing and Simulated Annealing Algorithms for Size Optimization of Trusses</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Morteza%20Kazemi%20Torbaghan">Morteza Kazemi Torbaghan</a>, <a href="https://publications.waset.org/search?q=Seyed%20Mehran%20Kazemi"> Seyed Mehran Kazemi</a>, <a href="https://publications.waset.org/search?q=Rahele%20Zhiani"> Rahele Zhiani</a>, <a href="https://publications.waset.org/search?q=Fakhriye%20Hamed"> Fakhriye Hamed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Truss optimization problem has been vastly studied during the past 30 years and many different methods have been proposed for this problem. Even though most of these methods assume that the design variables are continuously valued, in reality, the design variables of optimization problems such as cross-sectional areas are discretely valued. In this paper, an improved hill climbing and an improved simulated annealing algorithm have been proposed to solve the truss optimization problem with discrete values for crosssectional areas. Obtained results have been compared to other methods in the literature and the comparison represents that the proposed methods can be used more efficiently than other proposed methods <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Size%20Optimization%20of%20Trusses" title="Size Optimization of Trusses">Size Optimization of Trusses</a>, <a href="https://publications.waset.org/search?q=Hill%20Climbing" title=" Hill Climbing"> Hill Climbing</a>, <a href="https://publications.waset.org/search?q=Simulated%20Annealing." title=" Simulated Annealing."> Simulated Annealing.</a> </p> <a href="https://publications.waset.org/7358/improved-hill-climbing-and-simulated-annealing-algorithms-for-size-optimization-of-trusses" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7358/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7358/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7358/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7358/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7358/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7358/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7358/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7358/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7358/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7358/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7358.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">3717</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">3557</span> Optimum Design of Trusses by Cuckoo Search </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Saravanan">M. Saravanan</a>, <a href="https://publications.waset.org/search?q=J.%20Raja%20Murugadoss"> J. Raja Murugadoss</a>, <a href="https://publications.waset.org/search?q=V.%20Jayanthi"> V. Jayanthi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Optimal design of structure has a main role in reduction of material usage which leads to deduction in the final cost of construction projects. Evolutionary approaches are found to be more successful techniques for solving size and shape structural optimization problem since it uses a stochastic random search instead of a gradient search. By reviewing the recent literature works the problem found was the optimization of weight. A new meta-heuristic algorithm called as Cuckoo Search (CS) Algorithm has used for the optimization of the total weight of the truss structures. This paper has used set of 10 bars and 25 bars trusses for the testing purpose. The main objective of this work is to reduce the number of iterations, weight and the total time consumption. In order to demonstrate the effectiveness of the present method, minimum weight design of truss structures is performed and the results of the CS are compared with other algorithms.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cuckoo%20search%20algorithm" title="Cuckoo search algorithm">Cuckoo search algorithm</a>, <a href="https://publications.waset.org/search?q=levy%E2%80%99s%20flight" title=" levy’s flight"> levy’s flight</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=optimal%20weight." title=" optimal weight. "> optimal weight. </a> </p> <a href="https://publications.waset.org/9999114/optimum-design-of-trusses-by-cuckoo-search" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9999114/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9999114/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9999114/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9999114/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9999114/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9999114/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9999114/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9999114/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9999114/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9999114/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9999114.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">2105</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">3556</span> Evaluation and Comparison of Seismic Performance of Structural Trusses under Cyclic Loading with Finite Element Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Masoud%20Mahdavi">Masoud Mahdavi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The structure is made using different members and combining them with each other. These members are basically based on technical and engineering principles and are combined in different ways and have their own unique effects on the building. Trusses are one of the most common and important members of the structure, accounting for a large percentage of the power transmission structure in the building. Different types of trusses are based on structural needs and evaluating and making complete comparisons between them is one of the most important engineering analyses. In the present study, four types of trusses have been studied; 1) Hawe truss, 2) Pratt truss, 3) k truss, and 4) warren truss, under cyclic loading for 80 seconds. The trusses are modeled in 3d using st<sub>37</sub> steel. The results showed that Hawe trusses had higher values ​​than all other trusses (k, Pratt and Warren) in all the studied indicators. Indicators examined in the study include; 1) von Mises stresses, 2) displacement, 3) support force, 4) velocity, 5) acceleration, 6) capacity (hysteresis curve) and 7) energy diagram. Pratt truss in indicators; Mises stress, displacement, energy have the least amount compared to other trusses. K truss in indicators; support force, speed and acceleration are the lowest compared to other trusses.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Hawe%20truss" title="Hawe truss">Hawe truss</a>, <a href="https://publications.waset.org/search?q=Pratt%20truss" title=" Pratt truss"> Pratt truss</a>, <a href="https://publications.waset.org/search?q=K%20truss" title=" K truss"> K truss</a>, <a href="https://publications.waset.org/search?q=Warren%20truss" title=" Warren truss"> Warren truss</a>, <a href="https://publications.waset.org/search?q=cyclic%20loading" title=" cyclic loading"> cyclic loading</a>, <a href="https://publications.waset.org/search?q=finite%20element%20method." title=" finite element method."> finite element method.</a> </p> <a href="https://publications.waset.org/10011532/evaluation-and-comparison-of-seismic-performance-of-structural-trusses-under-cyclic-loading-with-finite-element-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10011532/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10011532/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10011532/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10011532/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10011532/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10011532/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10011532/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10011532/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10011532/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10011532/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10011532.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">600</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">3555</span> Elitist Self-Adaptive Step-Size Search in Optimum Sizing of Steel Structures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=O%C4%9Fuzhan%20Hasan%C3%A7ebi">Oğuzhan Hasançebi</a>, <a href="https://publications.waset.org/search?q=Saeid%20Kazemzadeh%20Azad"> Saeid Kazemzadeh Azad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <div>This paper covers application of an elitist selfadaptive</div> <div>step-size search (ESASS) to optimum design of steel</div> <div>skeletal structures. In the ESASS two approaches are considered for</div> <div>improving the convergence accuracy as well as the computational</div> <div>efficiency of the original technique namely the so called selfadaptive</div> <div>step-size search (SASS). Firstly, an additional randomness</div> <div>is incorporated into the sampling step of the technique to preserve</div> <div>exploration capability of the algorithm during the optimization.</div> <div>Moreover, an adaptive sampling scheme is introduced to improve the</div> <div>quality of final solutions. Secondly, computational efficiency of the</div> <div>technique is accelerated via avoiding unnecessary analyses during the</div> <div>optimization process using an upper bound strategy. The numerical</div> <div>results demonstrate the usefulness of the ESASS in the sizing</div> <div>optimization problems of steel truss and frame structures.</div> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Structural%20design%20optimization" title="Structural design optimization">Structural design optimization</a>, <a href="https://publications.waset.org/search?q=optimal%20sizing" title=" optimal sizing"> optimal sizing</a>, <a href="https://publications.waset.org/search?q=metaheuristics" title=" metaheuristics"> metaheuristics</a>, <a href="https://publications.waset.org/search?q=self-adaptive%20step-size%20search" title=" self-adaptive step-size search"> self-adaptive step-size search</a>, <a href="https://publications.waset.org/search?q=steel%20trusses" title=" steel trusses"> steel trusses</a>, <a href="https://publications.waset.org/search?q=steel%0D%0Aframes.%7D" title=" steel frames.}"> steel frames.}</a> </p> <a href="https://publications.waset.org/10003642/elitist-self-adaptive-step-size-search-in-optimum-sizing-of-steel-structures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10003642/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10003642/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10003642/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10003642/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10003642/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10003642/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10003642/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10003642/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10003642/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10003642/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10003642.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">1424</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">3554</span> Reformulations of Big Bang-Big Crunch Algorithm for Discrete Structural Design Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=O.%20Hasan%C3%A7ebi">O. Hasançebi</a>, <a href="https://publications.waset.org/search?q=S.%20Kazemzadeh%20Azad"> S. Kazemzadeh Azad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the present study the efficiency of Big Bang-Big Crunch (BB-BC) algorithm is investigated in discrete structural design optimization. It is shown that a standard version of the BB-BC algorithm is sometimes unable to produce reasonable solutions to problems from discrete structural design optimization. Two reformulations of the algorithm, which are referred to as modified BB-BC (MBB-BC) and exponential BB-BC (EBB-BC), are introduced to enhance the capability of the standard algorithm in locating good solutions for steel truss and frame type structures, respectively. The performances of the proposed algorithms are experimented and compared to its standard version as well as some other algorithms over several practical design examples. In these examples, steel structures are sized for minimum weight subject to stress, stability and displacement limitations according to the provisions of AISC-ASD. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Structural%20optimization" title="Structural optimization">Structural optimization</a>, <a href="https://publications.waset.org/search?q=discrete%20optimization" title=" discrete optimization"> discrete optimization</a>, <a href="https://publications.waset.org/search?q=metaheuristics" title=" metaheuristics"> metaheuristics</a>, <a href="https://publications.waset.org/search?q=big%20bang-big%20crunch%20%28BB-BC%29%20algorithm" title=" big bang-big crunch (BB-BC) algorithm"> big bang-big crunch (BB-BC) algorithm</a>, <a href="https://publications.waset.org/search?q=design%0Aoptimization%20of%20steel%20trusses%20and%20frames." title=" design optimization of steel trusses and frames."> design optimization of steel trusses and frames.</a> </p> <a href="https://publications.waset.org/15869/reformulations-of-big-bang-big-crunch-algorithm-for-discrete-structural-design-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15869/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15869/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15869/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15869/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15869/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15869/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15869/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15869/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15869/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15869/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15869.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">2390</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">3553</span> Periodic Topology and Size Optimization Design of Tower Crane Boom</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Wu%20Qinglong">Wu Qinglong</a>, <a href="https://publications.waset.org/search?q=Zhou%20Qicai"> Zhou Qicai</a>, <a href="https://publications.waset.org/search?q=Xiong%20Xiaolei"> Xiong Xiaolei</a>, <a href="https://publications.waset.org/search?q=Zhang%20Richeng"> Zhang Richeng </a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In order to achieve the layout and size optimization of the web members of tower crane boom, a truss topology and cross section size optimization method based on continuum is proposed considering three typical working conditions. Firstly, the optimization model is established by replacing web members with web plates. And the web plates are divided into several sub-domains so that periodic soft kill option (SKO) method can be carried out for topology optimization of the slender boom. After getting the optimized topology of web plates, the optimized layout of web members is formed through extracting the principal stress distribution. Finally, using the web member radius as design variable, the boom compliance as objective and the material volume of the boom as constraint, the cross section size optimization mathematical model is established. The size optimization criterion is deduced from the mathematical model by Lagrange multiplier method and Kuhn-Tucker condition. By comparing the original boom with the optimal boom, it is identified that this optimization method can effectively lighten the boom and improve its performance.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Tower%20crane%20boom" title="Tower crane boom">Tower crane boom</a>, <a href="https://publications.waset.org/search?q=topology%20optimization" title=" topology optimization"> topology optimization</a>, <a href="https://publications.waset.org/search?q=size%20optimization" title=" size optimization"> size optimization</a>, <a href="https://publications.waset.org/search?q=periodic" title=" periodic"> periodic</a>, <a href="https://publications.waset.org/search?q=soft%20kill%20option" title=" soft kill option"> soft kill option</a>, <a href="https://publications.waset.org/search?q=optimization%20criterion." title=" optimization criterion."> optimization criterion.</a> </p> <a href="https://publications.waset.org/10007635/periodic-topology-and-size-optimization-design-of-tower-crane-boom" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10007635/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10007635/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10007635/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10007635/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10007635/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10007635/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10007635/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10007635/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10007635/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10007635/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10007635.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">1343</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">3552</span> Method for Determining the Probing Points for Efficient Measurement of Freeform Surface</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yi%20Xu">Yi Xu</a>, <a href="https://publications.waset.org/search?q=Zexiang%20Li"> Zexiang Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In inspection and workpiece localization, sampling point data is an important issue. Since the devices for sampling only sample discrete points, not the completely surface, sampling size and location of the points will be taken into consideration. In this paper a method is presented for determining the sampled points size and location for achieving efficient sampling. Firstly, uncertainty analysis of the localization parameters is investigated. A localization uncertainty model is developed to predict the uncertainty of the localization process. Using this model the minimum size of the sampled points is predicted. Secondly, based on the algebra theory an eigenvalue-optimal optimization is proposed. Then a freeform surface is used in the simulation. The proposed optimization is implemented. The simulation result shows its effectivity.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=eigenvalue-optimal%20optimization" title="eigenvalue-optimal optimization">eigenvalue-optimal optimization</a>, <a href="https://publications.waset.org/search?q=freeform%20surface%20inspection" title=" freeform surface inspection"> freeform surface inspection</a>, <a href="https://publications.waset.org/search?q=sampling%20size%20and%20location" title="sampling size and location">sampling size and location</a>, <a href="https://publications.waset.org/search?q=sampled%20points." title=" sampled points."> sampled points.</a> </p> <a href="https://publications.waset.org/6255/method-for-determining-the-probing-points-for-efficient-measurement-of-freeform-surface" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6255/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6255/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6255/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6255/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6255/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6255/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6255/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6255/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6255/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6255/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6255.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">1239</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">3551</span> An Improved Cuckoo Search Algorithm for Voltage Stability Enhancement in Power Transmission Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Reza%20Sirjani">Reza Sirjani</a>, <a href="https://publications.waset.org/search?q=Nobosse%20Tafem%20Bolan"> Nobosse Tafem Bolan </a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Many optimization techniques available in the literature have been developed in order to solve the problem of voltage stability enhancement in power systems. However, there are a number of drawbacks in the use of previous techniques aimed at determining the optimal location and size of reactive compensators in a network. In this paper, an Improved Cuckoo Search algorithm is applied as an appropriate optimization algorithm to determine the optimum location and size of a Static Var Compensator (SVC) in a transmission network. The main objectives are voltage stability improvement and total cost minimization. The results of the presented technique are then compared with other available optimization techniques.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cuckoo%20search%20algorithm" title="Cuckoo search algorithm">Cuckoo search algorithm</a>, <a href="https://publications.waset.org/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/search?q=power%20system" title=" power system"> power system</a>, <a href="https://publications.waset.org/search?q=var%20compensators" title=" var compensators"> var compensators</a>, <a href="https://publications.waset.org/search?q=voltage%20stability." title=" voltage stability. "> voltage stability. </a> </p> <a href="https://publications.waset.org/10004344/an-improved-cuckoo-search-algorithm-for-voltage-stability-enhancement-in-power-transmission-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10004344/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10004344/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10004344/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10004344/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10004344/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10004344/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10004344/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10004344/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10004344/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10004344/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10004344.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">3550</span> Rational Structure of Cable Truss</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=V.%20Goremikins">V. Goremikins</a>, <a href="https://publications.waset.org/search?q=K.%20Rocens"> K. Rocens</a>, <a href="https://publications.waset.org/search?q=D.%20Serdjuks"> D. Serdjuks</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>One of the main problems of suspended cable structures is initial shape change under the action of non uniform load. The problem can be solved by increasing of weight of construction or by using of prestressing. But this methods cause increasing of materials consumption of suspended cable structure. The cable truss usage is another way how the problem of shape change under the action of non uniform load can be fixed. The cable trusses with the vertical and inclined suspensions, cross web and single cable were analyzed as the main load-bearing structures of suspension bridge. It was shown, that usage of cable truss allows to reduce the vertical displacements up to 32% in comparison with the single cable in case of non uniformly distributed load. In case of uniformly distributed load single cable is preferable.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cable%20trusses" title="Cable trusses">Cable trusses</a>, <a href="https://publications.waset.org/search?q=Non%20uniform%20load" title=" Non uniform load"> Non uniform load</a>, <a href="https://publications.waset.org/search?q=Suspension%20bridge" title=" Suspension bridge"> Suspension bridge</a>, <a href="https://publications.waset.org/search?q=Vertical%20displacements." title="Vertical displacements.">Vertical displacements.</a> </p> <a href="https://publications.waset.org/10194/rational-structure-of-cable-truss" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10194/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10194/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10194/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10194/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10194/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10194/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10194/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10194/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10194/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10194/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10194.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">2728</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">3549</span> Particle Swarm Optimization for Design of Water Distribution Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.%20Vasan">A. Vasan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Particle swarm optimization (PSO) technique is applied to design the water distribution pipeline network. A simulation-optimization model is formulated with the objective of minimizing cost and is applied to a benchmark water distribution system optimization problem. The benchmark problem taken for the application of PSO technique to optimize the pipe size of the water distribution network is New York City water supply system problem. The results from the analysis infer that PSO is a potential alternative optimization technique when compared to other heuristic techniques for optimal sizing of water distribution systems.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Water%20distribution%20systems" title="Water distribution systems">Water distribution systems</a>, <a href="https://publications.waset.org/search?q=Optimization" title=" Optimization"> Optimization</a>, <a href="https://publications.waset.org/search?q=Particle%20swarm%20optimization" title=" Particle swarm optimization"> Particle swarm optimization</a>, <a href="https://publications.waset.org/search?q=Swarm%20intelligence" title=" Swarm intelligence"> Swarm intelligence</a>, <a href="https://publications.waset.org/search?q=New%20York%20water%20supply%20system." title=" New York water supply system."> New York water supply system.</a> </p> <a href="https://publications.waset.org/15557/particle-swarm-optimization-for-design-of-water-distribution-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15557/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15557/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15557/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15557/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15557/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15557/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15557/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15557/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15557/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15557/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15557.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">1537</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">3548</span> Improvement of Gregory&#039;s formula using Particle Swarm Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=N.%20Khelil.%20L.%20Djerou">N. Khelil. L. Djerou </a>, <a href="https://publications.waset.org/search?q=A.%20Zerarka"> A. Zerarka</a>, <a href="https://publications.waset.org/search?q=M.%20Batouche"> M. Batouche</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Consider the Gregory integration (G) formula with end corrections where h Δ is the forward difference operator with step size h. In this study we prove that can be optimized by minimizing some of the coefficient k a in the remainder term by particle swarm optimization. Experimental tests prove that can be rendered a powerful formula for library use. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Numerical%20integration" title="Numerical integration">Numerical integration</a>, <a href="https://publications.waset.org/search?q=Gregory%20Formula" title=" Gregory Formula"> Gregory Formula</a>, <a href="https://publications.waset.org/search?q=Particle%20Swarm%20optimization." title=" Particle Swarm optimization."> Particle Swarm optimization.</a> </p> <a href="https://publications.waset.org/14258/improvement-of-gregorys-formula-using-particle-swarm-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14258/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14258/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14258/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14258/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14258/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14258/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14258/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14258/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14258/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14258/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14258.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">1381</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">3547</span> Practical Design Procedures of 3D Reinforced Concrete Shear Wall-Frame Structure Based on Structural Optimization Method </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=H.%20Nikzad">H. Nikzad</a>, <a href="https://publications.waset.org/search?q=S.%20Yoshitomi"> S. Yoshitomi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This study investigates and develops the structural optimization method. The effect of size constraints on practical solution of reinforced concrete (RC) building structure with shear wall is proposed. Cross-sections of beam and column, and thickness of shear wall are considered as design variables. The objective function to be minimized is total cost of the structure by using a simple and efficient automated MATLAB platform structural optimization methodology. With modification of mathematical formulations, the result is compared with optimal solution without size constraints. The most suitable combination of section sizes is selected as for the final design application based on linear static analysis. The findings of this study show that defining higher value of upper bound of sectional sizes significantly affects optimal solution, and defining of size constraints play a vital role in finding of global and practical solution during optimization procedures. The result and effectiveness of proposed method confirm the ability and efficiency of optimal solutions for 3D RC shear wall-frame structure.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Structural%20optimization" title="Structural optimization">Structural optimization</a>, <a href="https://publications.waset.org/search?q=linear%20static%20analysis" title=" linear static analysis"> linear static analysis</a>, <a href="https://publications.waset.org/search?q=ETABS" title=" ETABS"> ETABS</a>, <a href="https://publications.waset.org/search?q=MATLAB" title=" MATLAB"> MATLAB</a>, <a href="https://publications.waset.org/search?q=RC%20shear%20wall-frame%20structures." title=" RC shear wall-frame structures. "> RC shear wall-frame structures. </a> </p> <a href="https://publications.waset.org/10009300/practical-design-procedures-of-3d-reinforced-concrete-shear-wall-frame-structure-based-on-structural-optimization-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10009300/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10009300/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10009300/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10009300/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10009300/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10009300/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10009300/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10009300/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10009300/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10009300/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10009300.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">1300</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">3546</span> Ant Colony Optimization for Optimal Distributed Generation in Distribution Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=I.%20A.%20Farhat">I. A. Farhat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The problem of optimal planning of multiple sources of distributed generation (DG) in distribution networks is treated in this paper using an improved Ant Colony Optimization algorithm (ACO). This objective of this problem is to determine the DG optimal size and location that in order to minimize the network real power losses. Considering the multiple sources of DG, both size and location are simultaneously optimized in a single run of the proposed ACO algorithm. The various practical constraints of the problem are taken into consideration by the problem formulation and the algorithm implementation. A radial power flow algorithm for distribution networks is adopted and applied to satisfy these constraints. To validate the proposed technique and demonstrate its effectiveness, the well-know 69-bus feeder standard test system is employed.cm.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=About%20Ant%20Colony%20Optimization%20%28ACO%29" title="About Ant Colony Optimization (ACO)">About Ant Colony Optimization (ACO)</a>, <a href="https://publications.waset.org/search?q=Distributed%0D%0AGeneration%20%28DG%29." title=" Distributed Generation (DG)."> Distributed Generation (DG).</a> </p> <a href="https://publications.waset.org/16142/ant-colony-optimization-for-optimal-distributed-generation-in-distribution-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/16142/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/16142/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/16142/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/16142/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/16142/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/16142/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/16142/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/16142/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/16142/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/16142/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/16142.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">3280</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">3545</span> Cognitive Virtual Exploration for Optimization Model Reduction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Livier%20Serna">Livier Serna</a>, <a href="https://publications.waset.org/search?q=Xavier%20Fischer"> Xavier Fischer</a>, <a href="https://publications.waset.org/search?q=Fouad%20Bennis"> Fouad Bennis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a decision aid method for preoptimization is presented. The method is called “negotiation", and it is based on the identification, formulation, modeling and use of indicators defined as “negotiation indicators". These negotiation indicators are used to explore the solution space by means of a classbased approach. The classes are subdomains for the negotiation indicators domain. They represent equivalent cognitive solutions in terms of the negotiation indictors being used. By this method, we reduced the size of the solution space and the criteria, thus aiding the optimization methods. We present an example to show the method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Optimization%20Model%20Reduction" title="Optimization Model Reduction">Optimization Model Reduction</a>, <a href="https://publications.waset.org/search?q=Pre-Optimization" title=" Pre-Optimization"> Pre-Optimization</a>, <a href="https://publications.waset.org/search?q=Negotiation%20Process" title="Negotiation Process">Negotiation Process</a>, <a href="https://publications.waset.org/search?q=Class-Making" title=" Class-Making"> Class-Making</a>, <a href="https://publications.waset.org/search?q=Cognition%20Based%20VirtualExploration." title=" Cognition Based VirtualExploration."> Cognition Based VirtualExploration.</a> </p> <a href="https://publications.waset.org/5545/cognitive-virtual-exploration-for-optimization-model-reduction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5545/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5545/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5545/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5545/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5545/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5545/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5545/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5545/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5545/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5545/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5545.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">1426</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">3544</span> Design Parameters Selection and Optimization of Weld Zone Development in Resistance Spot Welding</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Norasiah%20Muhammad">Norasiah Muhammad</a>, <a href="https://publications.waset.org/search?q=Yupiter%20HP%20Manurung"> Yupiter HP Manurung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper investigates the development of weld zone in Resistance Spot Welding (RSW) which focuses on weld nugget and Heat Affected Zone (HAZ). The effects of four factors namely weld current, weld time, electrode force and hold time were studied using a general 24 factorial design augmented by five centre points. The results of the analysis showed that all selected factors except hold time exhibit significant effect on weld nugget radius and HAZ size. Optimization of the welding parameters (weld current, weld time and electrode force) to normalize weld nugget and to minimize HAZ size was then conducted using Central Composite Design (CCD) in Response Surface Methodology (RSM) and the optimum parameters were determined. A regression model for radius of weld nugget and HAZ size was developed and its adequacy was evaluated. The experimental results obtained under optimum operating conditions were then compared with the predicted values and were found to agree satisfactorily with each other <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Factorial%20design" title="Factorial design">Factorial design</a>, <a href="https://publications.waset.org/search?q=Optimization" title=" Optimization"> Optimization</a>, <a href="https://publications.waset.org/search?q=Resistance%20Spot%20Welding%20%28RSW%29" title=" Resistance Spot Welding (RSW)"> Resistance Spot Welding (RSW)</a>, <a href="https://publications.waset.org/search?q=Response%20Surface%20Methodology%20%28RSM%29." title=" Response Surface Methodology (RSM)."> Response Surface Methodology (RSM).</a> </p> <a href="https://publications.waset.org/2447/design-parameters-selection-and-optimization-of-weld-zone-development-in-resistance-spot-welding" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2447/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2447/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2447/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2447/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2447/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2447/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2447/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2447/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2447/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2447/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2447.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">3413</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">3543</span> Experimental Modal Analysis and Model Validation of Antenna Structures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=B.R.%20Potgieter">B.R. Potgieter</a>, <a href="https://publications.waset.org/search?q=G.%20Venter"> G. Venter</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Numerical design optimization is a powerful tool that can be used by engineers during any stage of the design process. There are many different applications for structural optimization. A specific application that will be discussed in the following paper is experimental data matching. Data obtained through tests on a physical structure will be matched with data from a numerical model of that same structure. The data of interest will be the dynamic characteristics of an antenna structure focusing on the mode shapes and modal frequencies. The structure used was a scaled and simplified model of the Karoo Array Telescope-7 (KAT-7) antenna structure. This kind of data matching is a complex and difficult task. This paper discusses how optimization can assist an engineer during the process of correlating a finite element model with vibration test data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Finite%20Element%20Model%20%28FEM%29" title="Finite Element Model (FEM)">Finite Element Model (FEM)</a>, <a href="https://publications.waset.org/search?q=Karoo%20Array%20Telescope%28KAT-7%29" title=" Karoo Array Telescope(KAT-7)"> Karoo Array Telescope(KAT-7)</a>, <a href="https://publications.waset.org/search?q=modal%20frequencies" title=" modal frequencies"> modal frequencies</a>, <a href="https://publications.waset.org/search?q=mode%20shapes" title=" mode shapes"> mode shapes</a>, <a href="https://publications.waset.org/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/search?q=shape%20optimization" title="shape optimization">shape optimization</a>, <a href="https://publications.waset.org/search?q=size%20optimization" title=" size optimization"> size optimization</a>, <a href="https://publications.waset.org/search?q=vibration%20tests" title=" vibration tests"> vibration tests</a> </p> <a href="https://publications.waset.org/11898/experimental-modal-analysis-and-model-validation-of-antenna-structures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11898/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11898/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11898/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11898/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11898/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11898/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11898/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11898/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11898/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11898/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11898.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">1852</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">3542</span> An Adequate Choice of Initial Sample Size for Selection Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mohammad%20H.%20Almomani">Mohammad H. Almomani</a>, <a href="https://publications.waset.org/search?q=Rosmanjawati%20Abdul%20Rahman"> Rosmanjawati Abdul Rahman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we consider the effect of the initial sample size on the performance of a sequential approach that used in selecting a good enough simulated system, when the number of alternatives is very large. We implement a sequential approach on M=M=1 queuing system under some parameter settings, with a different choice of the initial sample sizes to explore the impacts on the performance of this approach. The results show that the choice of the initial sample size does affect the performance of our selection approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Ranking%20and%20Selection" title="Ranking and Selection">Ranking and Selection</a>, <a href="https://publications.waset.org/search?q=Ordinal%20Optimization" title=" Ordinal Optimization"> Ordinal Optimization</a>, <a href="https://publications.waset.org/search?q=Optimal%0AComputing%20Budget%20Allocation" title=" Optimal Computing Budget Allocation"> Optimal Computing Budget Allocation</a>, <a href="https://publications.waset.org/search?q=Subset%20Selection" title=" Subset Selection"> Subset Selection</a>, <a href="https://publications.waset.org/search?q=Indifference-Zone" title=" Indifference-Zone"> Indifference-Zone</a>, <a href="https://publications.waset.org/search?q=Initial%20Sample%20Size." title=" Initial Sample Size."> Initial Sample Size.</a> </p> <a href="https://publications.waset.org/771/an-adequate-choice-of-initial-sample-size-for-selection-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/771/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/771/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/771/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/771/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/771/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/771/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/771/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/771/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/771/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/771/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/771.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">1307</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">3541</span> The Multi-scenario Knapsack Problem: An Adaptive Search Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mhand%20Hifi">Mhand Hifi</a>, <a href="https://publications.waset.org/search?q=Hedi%20Mhalla"> Hedi Mhalla</a>, <a href="https://publications.waset.org/search?q=Mustapha%20Michaphy"> Mustapha Michaphy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, we study the multi-scenario knapsack problem, a variant of the well-known NP-Hard single knapsack problem. We investigate the use of an adaptive algorithm for solving heuristically the problem. The used method combines two complementary phases: a size reduction phase and a dynamic 2- opt procedure one. First, the reduction phase applies a polynomial reduction strategy; that is used for reducing the size problem. Second, the adaptive search procedure is applied in order to attain a feasible solution Finally, the performances of two versions of the proposed algorithm are evaluated on a set of randomly generated instances.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=combinatorial%20optimization" title="combinatorial optimization">combinatorial optimization</a>, <a href="https://publications.waset.org/search?q=max-min%20optimization" title=" max-min optimization"> max-min optimization</a>, <a href="https://publications.waset.org/search?q=knapsack" title=" knapsack"> knapsack</a>, <a href="https://publications.waset.org/search?q=heuristics" title=" heuristics"> heuristics</a>, <a href="https://publications.waset.org/search?q=problem%20reduction" title=" problem reduction"> problem reduction</a> </p> <a href="https://publications.waset.org/11073/the-multi-scenario-knapsack-problem-an-adaptive-search-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11073/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11073/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11073/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11073/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11073/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11073/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11073/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11073/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11073/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11073/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11073.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">1618</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">3540</span> A Short Reflection on the Strengths and Weaknesses of Simulation Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=P.%20Vazan">P. Vazan</a>, <a href="https://publications.waset.org/search?q=P.%20Tanuska"> P. Tanuska</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The paper provides the basic overview of simulation optimization. The procedure of its practical using is demonstrated on the real example in simulator Witness. The simulation optimization is presented as a good tool for solving many problems in real praxis especially in production systems. The authors also characterize their own experiences and they mention the strengths and weakness of simulation optimization.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=discrete%20event%20simulation" title="discrete event simulation">discrete event simulation</a>, <a href="https://publications.waset.org/search?q=simulation%20optimization" title=" simulation optimization"> simulation optimization</a>, <a href="https://publications.waset.org/search?q=Witness" title=" Witness"> Witness</a> </p> <a href="https://publications.waset.org/1628/a-short-reflection-on-the-strengths-and-weaknesses-of-simulation-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1628/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1628/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1628/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1628/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1628/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1628/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1628/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1628/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1628/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1628/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1628.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">2598</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">3539</span> Bee Colony Optimization Applied to the Bin Packing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kenza%20Aida%20Amara">Kenza Aida Amara</a>, <a href="https://publications.waset.org/search?q=Bachir%20Djebbar"> Bachir Djebbar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We treat the two-dimensional bin packing problem which involves packing a given set of rectangles into a minimum number of larger identical rectangles called bins. This combinatorial problem is NP-hard. We propose a pretreatment for the oriented version of the problem that allows the valorization of the lost areas in the bins and the reduction of the size problem. A heuristic method based on the strategy first-fit adapted to this problem is presented. We present an approach of resolution by bee colony optimization. Computational results express a comparison of the number of bins used with and without pretreatment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Bee%20colony%20optimization" title="Bee colony optimization">Bee colony optimization</a>, <a href="https://publications.waset.org/search?q=bin%20packing" title=" bin packing"> bin packing</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=pretreatment." title=" pretreatment."> pretreatment.</a> </p> <a href="https://publications.waset.org/10006577/bee-colony-optimization-applied-to-the-bin-packing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10006577/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10006577/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10006577/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10006577/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10006577/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10006577/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10006577/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10006577/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10006577/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10006577/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10006577.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">1102</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">3538</span> Particle Swarm Optimization with Reduction for Global Optimization Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Michiharu%20Maeda">Michiharu Maeda</a>, <a href="https://publications.waset.org/search?q=Shinya%20Tsuda"> Shinya Tsuda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an algorithm of particle swarm optimization with reduction for global optimization problems. Particle swarm optimization is an algorithm which refers to the collective motion such as birds or fishes, and a multi-point search algorithm which finds a best solution using multiple particles. Particle swarm optimization is so flexible that it can adapt to a number of optimization problems. When an objective function has a lot of local minimums complicatedly, the particle may fall into a local minimum. For avoiding the local minimum, a number of particles are initially prepared and their positions are updated by particle swarm optimization. Particles sequentially reduce to reach a predetermined number of them grounded in evaluation value and particle swarm optimization continues until the termination condition is met. In order to show the effectiveness of the proposed algorithm, we examine the minimum by using test functions compared to existing algorithms. Furthermore the influence of best value on the initial number of particles for our algorithm is discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Particle%20swarm%20optimization" title="Particle swarm optimization">Particle swarm optimization</a>, <a href="https://publications.waset.org/search?q=Global%20optimization" title=" Global optimization"> Global optimization</a>, <a href="https://publications.waset.org/search?q=Metaheuristics" title="Metaheuristics">Metaheuristics</a>, <a href="https://publications.waset.org/search?q=Reduction." title=" Reduction."> Reduction.</a> </p> <a href="https://publications.waset.org/15383/particle-swarm-optimization-with-reduction-for-global-optimization-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15383/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15383/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15383/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15383/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15383/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15383/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15383/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15383/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15383/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15383/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15383.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">1622</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">3537</span> Modeling and Optimization of Aggregate Production Planning - A Genetic Algorithm Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=B.%20Fahimnia">B. Fahimnia</a>, <a href="https://publications.waset.org/search?q=L.H.S.%20Luong"> L.H.S. Luong</a>, <a href="https://publications.waset.org/search?q=R.%20M.%20Marian"> R. M. Marian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Aggregate Production Plan (APP) is a schedule of the organization-s overall operations over a planning horizon to satisfy demand while minimizing costs. It is the baseline for any further planning and formulating the master production scheduling, resources, capacity and raw material planning. This paper presents a methodology to model the Aggregate Production Planning problem, which is combinatorial in nature, when optimized with Genetic Algorithms. This is done considering a multitude of constraints of contradictory nature and the optimization criterion – overall cost, made up of costs with production, work force, inventory, and subcontracting. A case study of substantial size, used to develop the model, is presented, along with the genetic operators. <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=Costs" title=" Costs"> Costs</a>, <a href="https://publications.waset.org/search?q=and%0AOptimization." title=" and Optimization."> and Optimization.</a> </p> <a href="https://publications.waset.org/7426/modeling-and-optimization-of-aggregate-production-planning-a-genetic-algorithm-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7426/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7426/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7426/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7426/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7426/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7426/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7426/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7426/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7426/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7426/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7426.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">2586</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">3536</span> Simulated Annealing Application for Structural Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Farhad%20Kolahan">Farhad Kolahan</a>, <a href="https://publications.waset.org/search?q=M.%20Hossein%20Abolbashari"> M. Hossein Abolbashari</a>, <a href="https://publications.waset.org/search?q=Samaeddin%20Mohitzadeh"> Samaeddin Mohitzadeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Several methods are available for weight and shape optimization of structures, among which Evolutionary Structural Optimization (ESO) is one of the most widely used methods. In ESO, however, the optimization criterion is completely case-dependent. Moreover, only the improving solutions are accepted during the search. In this paper a Simulated Annealing (SA) algorithm is used for structural optimization problem. This algorithm differs from other random search methods by accepting non-improving solutions. The implementation of SA algorithm is done through reducing the number of finite element analyses (function evaluations). Computational results show that SA can efficiently and effectively solve such optimization problems within short search time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Simulated%20annealing" title="Simulated annealing">Simulated annealing</a>, <a href="https://publications.waset.org/search?q=Structural%20optimization" title=" Structural optimization"> Structural optimization</a>, <a href="https://publications.waset.org/search?q=Compliance" title=" Compliance"> Compliance</a>, <a href="https://publications.waset.org/search?q=C.V.%20product." title=" C.V. product."> C.V. product.</a> </p> <a href="https://publications.waset.org/13249/simulated-annealing-application-for-structural-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13249/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13249/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13249/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13249/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13249/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13249/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13249/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13249/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13249/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13249/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13249.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">1956</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">3535</span> Reliability-Based Topology Optimization Based on Evolutionary Structural Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sang-Rak%20Kim">Sang-Rak Kim</a>, <a href="https://publications.waset.org/search?q=Jea-Yong%20Park"> Jea-Yong Park</a>, <a href="https://publications.waset.org/search?q=Won-Goo%20Lee"> Won-Goo Lee</a>, <a href="https://publications.waset.org/search?q=Jin-Shik%20Yu"> Jin-Shik Yu</a>, <a href="https://publications.waset.org/search?q=Seog-Young%20Han"> Seog-Young Han</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a Reliability-Based Topology Optimization (RBTO) based on Evolutionary Structural Optimization (ESO). An actual design involves uncertain conditions such as material property, operational load and dimensional variation. Deterministic Topology Optimization (DTO) is obtained without considering of the uncertainties related to the uncertainty parameters. However, RBTO involves evaluation of probabilistic constraints, which can be done in two different ways, the reliability index approach (RIA) and the performance measure approach (PMA). Limit state function is approximated using Monte Carlo Simulation and Central Composite Design for reliability analysis. ESO, one of the topology optimization techniques, is adopted for topology optimization. Numerical examples are presented to compare the DTO with RBTO. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Evolutionary%20Structural%20Optimization" title="Evolutionary Structural Optimization">Evolutionary Structural Optimization</a>, <a href="https://publications.waset.org/search?q=PerformanceMeasure%20Approach" title=" PerformanceMeasure Approach"> PerformanceMeasure Approach</a>, <a href="https://publications.waset.org/search?q=Reliability-Based%20Topology%20Optimization" title=" Reliability-Based Topology Optimization"> Reliability-Based Topology Optimization</a>, <a href="https://publications.waset.org/search?q=Reliability%20Index%20Approach." title="Reliability Index Approach.">Reliability Index Approach.</a> </p> <a href="https://publications.waset.org/11584/reliability-based-topology-optimization-based-on-evolutionary-structural-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11584/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11584/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11584/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11584/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11584/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11584/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11584/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11584/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11584/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11584/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11584.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">2800</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">3534</span> A Mean–Variance–Skewness Portfolio Optimization Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kostas%20Metaxiotis">Kostas Metaxiotis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Portfolio optimization is one of the most important topics in finance. This paper proposes a mean&ndash;variance&ndash;skewness (MVS) portfolio optimization model. Traditionally, the portfolio optimization problem is solved by using the mean&ndash;variance (MV) framework. In this study, we formulate the proposed model as a three-objective optimization problem, where the portfolio&#39;s expected return and skewness are maximized whereas the portfolio risk is minimized. For solving the proposed three-objective portfolio optimization model we apply an adapted version of the non-dominated sorting genetic algorithm (NSGAII). Finally, we use a real dataset from FTSE-100 for validating the proposed model.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Evolutionary%20algorithms" title="Evolutionary algorithms">Evolutionary algorithms</a>, <a href="https://publications.waset.org/search?q=portfolio%20optimization" title=" portfolio optimization"> portfolio optimization</a>, <a href="https://publications.waset.org/search?q=skewness" title=" skewness"> skewness</a>, <a href="https://publications.waset.org/search?q=stock%20selection." title=" stock selection."> stock selection.</a> </p> <a href="https://publications.waset.org/10010074/a-mean-variance-skewness-portfolio-optimization-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10010074/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10010074/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10010074/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10010074/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10010074/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10010074/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10010074/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10010074/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10010074/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10010074/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10010074.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">1417</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">3533</span> Particle Swarm Optimization Algorithm vs. Genetic Algorithm for Image Watermarking Based Discrete Wavelet Transform</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Omaima%20N.%20Ahmad%20AL-Allaf">Omaima N. Ahmad AL-Allaf</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Over communication networks, images can be easily copied and distributed in an illegal way. The copyright protection for authors and owners is necessary. Therefore, the digital watermarking techniques play an important role as a valid solution for authority problems. Digital image watermarking techniques are used to hide watermarks into images to achieve copyright protection and prevent its illegal copy. Watermarks need to be robust to attacks and maintain data quality. Therefore, we discussed in this paper two approaches for image watermarking, first is based on Particle Swarm Optimization (PSO) and the second approach is based on Genetic Algorithm (GA). Discrete wavelet transformation (DWT) is used with the two approaches separately for embedding process to cover image transformation. Each of PSO and GA is based on co-relation coefficient to detect the high energy coefficient watermark bit in the original image and then hide the watermark in original image. Many experiments were conducted for the two approaches with different values of PSO and GA parameters. From experiments, PSO approach got better results with PSNR equal 53, MSE equal 0.0039. Whereas GA approach got PSNR equal 50.5 and MSE equal 0.0048 when using population size equal to 100, number of iterations equal to 150 and 3&times;3 block. According to the results, we can note that small block size can affect the quality of image watermarking based PSO/GA because small block size can increase the search area of the watermarking image. Better PSO results were obtained when using swarm size equal to 100.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Image%20watermarking" title="Image watermarking">Image watermarking</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=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a>, <a href="https://publications.waset.org/search?q=discrete%20wavelet%20transform." title=" discrete wavelet transform."> discrete wavelet transform.</a> </p> <a href="https://publications.waset.org/10008075/particle-swarm-optimization-algorithm-vs-genetic-algorithm-for-image-watermarking-based-discrete-wavelet-transform" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10008075/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10008075/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10008075/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10008075/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10008075/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10008075/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10008075/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10008075/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10008075/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10008075/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10008075.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">1160</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">3532</span> Combining Ant Colony Optimization and Dynamic Programming for Solving a Dynamic Facility Layout Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.%20Udomsakdigool">A. Udomsakdigool</a>, <a href="https://publications.waset.org/search?q=S.%20Bangsaranthip"> S. Bangsaranthip</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an algorithm which combining ant colony optimization in the dynamic programming for solving a dynamic facility layout problem. The problem is separated into 2 phases, static and dynamic phase. In static phase, ant colony optimization is used to find the best ranked of layouts for each period. Then the dynamic programming (DP) procedure is performed in the dynamic phase to evaluate the layout set during multi-period planning horizon. The proposed algorithm is tested over many problems with size ranging from 9 to 49 departments, 2 and 4 periods. The experimental results show that the proposed method is an alternative way for the plant layout designer to determine the layouts during multi-period planning horizon. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Ant%20colony%20optimization" title="Ant colony optimization">Ant colony optimization</a>, <a href="https://publications.waset.org/search?q=Dynamicprogramming" title=" Dynamicprogramming"> Dynamicprogramming</a>, <a href="https://publications.waset.org/search?q=Dynamic%20facility%20layout%20planning" title=" Dynamic facility layout planning"> Dynamic facility layout planning</a>, <a href="https://publications.waset.org/search?q=Metaheuristic" title="Metaheuristic">Metaheuristic</a> </p> <a href="https://publications.waset.org/7157/combining-ant-colony-optimization-and-dynamic-programming-for-solving-a-dynamic-facility-layout-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7157/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7157/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7157/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7157/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7157/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7157/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7157/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7157/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7157/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7157/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7157.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">1945</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">3531</span> Non-Stationary Stochastic Optimization of an Oscillating Water Column</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mar%C3%ADa%20L.%20Jal%C3%B3n">María L. Jalón</a>, <a href="https://publications.waset.org/search?q=Feargal%20Brennan"> Feargal Brennan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A non-stationary stochastic optimization methodology is applied to an OWC (oscillating water column) to find the design that maximizes the wave energy extraction. Different temporal cycles are considered to represent the long-term variability of the wave climate at the site in the optimization problem. The results of the non-stationary stochastic optimization problem are compared against those obtained by a stationary stochastic optimization problem. The comparative analysis reveals that the proposed non-stationary optimization provides designs with a better fit to reality. However, the stationarity assumption can be adequate when looking at averaged system response. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Non-stationary%20stochastic%20optimization" title="Non-stationary stochastic optimization">Non-stationary stochastic optimization</a>, <a href="https://publications.waset.org/search?q=oscillating%0D%0Awater%20column" title=" oscillating water column"> oscillating water column</a>, <a href="https://publications.waset.org/search?q=temporal%20variability" title=" temporal variability"> temporal variability</a>, <a href="https://publications.waset.org/search?q=wave%20energy." title=" wave energy."> wave energy.</a> </p> <a href="https://publications.waset.org/10007489/non-stationary-stochastic-optimization-of-an-oscillating-water-column" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10007489/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10007489/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10007489/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10007489/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10007489/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10007489/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10007489/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10007489/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10007489/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10007489/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10007489.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">1379</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">3530</span> Selection of an Optimum Configuration of Solar PV Array under Partial Shaded Condition Using Particle Swarm Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=R.%20Ramaprabha">R. Ramaprabha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper presents an extraction of maximum energy from Solar Photovoltaic Array (SPVA) under partial shaded conditions by optimum selection of array size using Particle Swarm Optimization (PSO) technique. In this paper a detailed study on the output reduction of different SPVA configurations under partial shaded conditions have been carried out. A generalized MATLAB M-code based software model has been used for any required array size, configuration, shading patterns and number of bypass diodes. Comparative study has been carried out on different configurations by testing several shading scenarios. While the number of shading patterns and the rate of change are very low for stationary SPVA but these may be quite large for SPVA mounted on a mobile platforms. This paper presents the suitability of PSO technique to select optimum configuration for mobile arrays by calculating the global peak (GP) of different configurations and to transfer maximum power to the load.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Global%20peak" title="Global peak">Global peak</a>, <a href="https://publications.waset.org/search?q=Mobile%20PV%20arrays" title=" Mobile PV arrays"> Mobile PV arrays</a>, <a href="https://publications.waset.org/search?q=Partial%20shading" title=" Partial shading"> Partial shading</a>, <a href="https://publications.waset.org/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/search?q=PSO." title=" PSO."> PSO.</a> </p> <a href="https://publications.waset.org/9997238/selection-of-an-optimum-configuration-of-solar-pv-array-under-partial-shaded-condition-using-particle-swarm-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997238/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997238/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997238/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997238/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997238/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997238/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997238/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997238/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997238/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997238/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997238.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">4235</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">3529</span> Contribution to the Query Optimization in the Object-Oriented Databases</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Minyar%20Sassi">Minyar Sassi</a>, <a href="https://publications.waset.org/search?q=Amel%20Grissa-Touzi"> Amel Grissa-Touzi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Appeared toward 1986, the object-oriented databases management systems had not known successes knew five years after their birth. One of the major difficulties is the query optimization. We propose in this paper a new approach that permits to enrich techniques of query optimization existing in the object-oriented databases. Seen success that knew the query optimization in the relational model, our approach inspires itself of these optimization techniques and enriched it so that they can support the new concepts introduced by the object databases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Query" title="Query">Query</a>, <a href="https://publications.waset.org/search?q=query%20optimization" title=" query optimization"> query optimization</a>, <a href="https://publications.waset.org/search?q=relational%20databases" title=" relational databases"> relational databases</a>, <a href="https://publications.waset.org/search?q=object-oriented%20databases." title=" object-oriented databases."> object-oriented databases.</a> </p> <a href="https://publications.waset.org/13754/contribution-to-the-query-optimization-in-the-object-oriented-databases" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13754/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13754/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13754/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13754/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13754/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13754/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13754/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13754/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13754/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13754/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13754.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">1548</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Size%20Optimization%20of%20Trusses&amp;page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Size%20Optimization%20of%20Trusses&amp;page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Size%20Optimization%20of%20Trusses&amp;page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Size%20Optimization%20of%20Trusses&amp;page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Size%20Optimization%20of%20Trusses&amp;page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Size%20Optimization%20of%20Trusses&amp;page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Size%20Optimization%20of%20Trusses&amp;page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Size%20Optimization%20of%20Trusses&amp;page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Size%20Optimization%20of%20Trusses&amp;page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Size%20Optimization%20of%20Trusses&amp;page=118">118</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Size%20Optimization%20of%20Trusses&amp;page=119">119</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Size%20Optimization%20of%20Trusses&amp;page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">&copy; 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">&times;</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>

Pages: 1 2 3 4 5 6 7 8 9 10