CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: route optimization</title> <meta name="description" content="Search results for: route optimization"> <meta name="keywords" content="route optimization"> <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="route optimization" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="route optimization"> <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> 3918</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: route optimization</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3918</span> An Ant Colony Optimization Approach for the Pollution Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=P.%20Parthiban">P. Parthiban</a>, <a href="https://publications.waset.org/abstracts/search?q=Sonu%20Rajak"> Sonu Rajak</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Kannan"> N. Kannan</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Dhanalakshmi"> R. Dhanalakshmi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with the Vehicle Routing Problem (VRP) with environmental considerations which is called Pollution Routing Problem (PRP). The objective is to minimize the operational and environmental costs. It consists of routing a number of vehicles to serve a set of customers, and determining fuel consumption, driver wages and their speed on each route segment, while respecting the capacity constraints and time windows. In this context, we presented an Ant Colony Optimization (ACO) approach, combined with a Speed Optimization Algorithm (SOA) to solve the PRP. The proposed solution method consists of two stages. Stage one is to solve a Vehicle Routing Problem with Time Window (VRPTW) using ACO and in the second stage a SOA is run on the resulting VRPTW solutions. Given a vehicle route, the SOA consists of finding the optimal speed on each arc of the route in order to minimize an objective function comprising fuel consumption costs and driver wages. The proposed algorithm tested on benchmark problem, the preliminary results show that the proposed algorithm is able to provide good solutions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20optimization" title="ant colony optimization">ant colony optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=CO2%20emissions" title=" CO2 emissions"> CO2 emissions</a>, <a href="https://publications.waset.org/abstracts/search?q=combinatorial%20optimization" title=" combinatorial optimization"> combinatorial optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=speed%20optimization" title=" speed optimization"> speed optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=vehicle%20routing" title=" vehicle routing"> vehicle routing</a> </p> <a href="https://publications.waset.org/abstracts/52973/an-ant-colony-optimization-approach-for-the-pollution-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52973.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">322</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3917</span> A Metaheuristic Approach for the Pollution-Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=P.%20Parthiban">P. Parthiban</a>, <a href="https://publications.waset.org/abstracts/search?q=Sonu%20Rajak"> Sonu Rajak</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Dhanalakshmi"> R. Dhanalakshmi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an Ant Colony Optimization (ACO) approach, combined with a Speed Optimization Algorithm (SOA) to solve the Vehicle Routing Problem (VRP) with environmental considerations, which is well known as Pollution-Routing Problem (PRP). It consists of routing a number of vehicles to serve a set of customers, and determining fuel consumption, driver wages and their speed on each route segment, while respecting the capacity constraints and time windows. Since VRP is NP-hard problem, so PRP also a NP-hard problem, which requires metaheuristics to solve this type of problems. The proposed solution method consists of two stages. Stage one is to solve a Vehicle Routing Problem with Time Window (VRPTW) using ACO and in the second stage, a SOA is run on the resulting VRPTW solution. Given a vehicle route, the SOA consists of finding the optimal speed on each arc of the route to minimize an objective function comprising fuel consumption costs and driver wages. The proposed algorithm tested on benchmark problem, the preliminary results show that the proposed algorithm can provide good solutions within reasonable computational time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20optimization" title="ant colony optimization">ant colony optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=CO2%20emissions" title=" CO2 emissions"> CO2 emissions</a>, <a href="https://publications.waset.org/abstracts/search?q=speed%20optimization" title=" speed optimization"> speed optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=vehicle%20routing" title=" vehicle routing"> vehicle routing</a> </p> <a href="https://publications.waset.org/abstracts/50237/a-metaheuristic-approach-for-the-pollution-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50237.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">359</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3916</span> Internet of Things: Route Search Optimization Applying Ant Colony Algorithm and Theory of Computer Science</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tushar%20Bhardwaj">Tushar Bhardwaj</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Internet of Things (IoT) possesses a dynamic network where the network nodes (mobile devices) are added and removed constantly and randomly, hence the traffic distribution in the network is quite variable and irregular. The basic but very important part in any network is route searching. We have many conventional route searching algorithms like link-state, and distance vector algorithms but they are restricted to the static point to point network topology. In this paper we propose a model that uses the Ant Colony Algorithm for route searching. It is dynamic in nature and has positive feedback mechanism that conforms to the route searching. We have also embedded the concept of Non-Deterministic Finite Automata [NDFA] minimization to reduce the network to increase the performance. Results show that Ant Colony Algorithm gives the shortest path from the source to destination node and NDFA minimization reduces the broadcasting storm effectively. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=routing" title="routing">routing</a>, <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20algorithm" title=" ant colony algorithm"> ant colony algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=NDFA" title=" NDFA"> NDFA</a>, <a href="https://publications.waset.org/abstracts/search?q=IoT" title=" IoT"> IoT</a> </p> <a href="https://publications.waset.org/abstracts/1965/internet-of-things-route-search-optimization-applying-ant-colony-algorithm-and-theory-of-computer-science" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1965.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">444</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3915</span> Benefit Of Waste Collection Route Optimisation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bojana%20Tot">Bojana Tot</a>, <a href="https://publications.waset.org/abstracts/search?q=Goran%20Bo%C5%A1Kovi%C4%87"> Goran BošKović</a>, <a href="https://publications.waset.org/abstracts/search?q=Goran%20%20Vuji%C4%87"> Goran Vujić</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Route optimisation is a process of planning one or multiple routes, with the purpose of minimizing overall costs, while achieving the highest possible performance under a set of given constraints. It combines routing or route planning, which is the process of creating the most cost-effective route by minimizing the distance or travelled time necessary to reach a set of planned stops, and route scheduling, which is the process of assigning an arrival and service time for each stop, with drivers being given shifts that adhere to their working hours. The objective of this paper is to provide benefits on the implementation of waste collection route optimisation and thus achieve economic efficiency for public utility companies, better service for citizens and positive environment and health. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=waste%20management" title="waste management">waste management</a>, <a href="https://publications.waset.org/abstracts/search?q=environment" title=" environment"> environment</a>, <a href="https://publications.waset.org/abstracts/search?q=collection%20route%20optimisation" title=" collection route optimisation"> collection route optimisation</a>, <a href="https://publications.waset.org/abstracts/search?q=GIS" title=" GIS"> GIS</a> </p> <a href="https://publications.waset.org/abstracts/125329/benefit-of-waste-collection-route-optimisation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/125329.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">160</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3914</span> CERD: Cost Effective Route Discovery in Mobile Ad Hoc Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anuradha%20Banerjee">Anuradha Banerjee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A mobile ad hoc network is an infrastructure less network, where nodes are free to move independently in any direction. The nodes have limited battery power; hence, we require energy efficient route discovery technique to enhance their lifetime and network performance. In this paper, we propose an energy-efficient route discovery technique CERD that greatly reduces the number of route requests flooded into the network and also gives priority to the route request packets sent from the routers that has communicated with the destination very recently, in single or multi-hop paths. This does not only enhance the lifetime of nodes but also decreases the delay in tracking the destination. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ad%20hoc%20network" title="ad hoc network">ad hoc network</a>, <a href="https://publications.waset.org/abstracts/search?q=energy%20efficiency" title=" energy efficiency"> energy efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=flooding" title=" flooding"> flooding</a>, <a href="https://publications.waset.org/abstracts/search?q=node%20lifetime" title=" node lifetime"> node lifetime</a>, <a href="https://publications.waset.org/abstracts/search?q=route%20discovery" title=" route discovery"> route discovery</a> </p> <a href="https://publications.waset.org/abstracts/20336/cerd-cost-effective-route-discovery-in-mobile-ad-hoc-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20336.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">347</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3913</span> Signal Strength Based Multipath Routing for Mobile Ad Hoc Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chothmal">Chothmal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present a route discovery process which uses the signal strength on a link as a parameter of its inclusion in the route discovery method. The proposed signal-to-interference and noise ratio (SINR) based multipath reactive routing protocol is named as SINR-MP protocol. The proposed SINR-MP routing protocols has two following two features: a) SINR-MP protocol selects routes based on the SINR of the links during the route discovery process therefore it select the routes which has long lifetime and low frame error rate for data transmission, and b) SINR-MP protocols route discovery process is multipath which discovers more than one SINR based route between a given source destination pair. The multiple routes selected by our SINR-MP protocol are node-disjoint in nature which increases their robustness against link failures, as failure of one route will not affect the other route. The secondary route is very useful in situations where the primary route is broken because we can now use the secondary route without causing a new route discovery process. Due to this, the network overhead caused by a route discovery process is avoided. This increases the network performance greatly. The proposed SINR-MP routing protocol is implemented in the trail version of network simulator called Qualnet. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ad%20hoc%20networks" title="ad hoc networks">ad hoc networks</a>, <a href="https://publications.waset.org/abstracts/search?q=quality%20of%20service" title=" quality of service"> quality of service</a>, <a href="https://publications.waset.org/abstracts/search?q=video%20streaming" title=" video streaming"> video streaming</a>, <a href="https://publications.waset.org/abstracts/search?q=H.264%2FSVC" title=" H.264/SVC"> H.264/SVC</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20routes" title=" multiple routes"> multiple routes</a>, <a href="https://publications.waset.org/abstracts/search?q=video%20traces" title=" video traces"> video traces</a> </p> <a href="https://publications.waset.org/abstracts/46573/signal-strength-based-multipath-routing-for-mobile-ad-hoc-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46573.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">249</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3912</span> Route Planning for Optimization Approach PSO_GA Sharing System (Scooter Sharing-Public Transportation) with Hybrid Optimization Approach PSO_GA</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Ali%20Farrokhpour">Mohammad Ali Farrokhpour</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the current decade and sustainable transportation systems, scooter sharing has attracted widespread attention as an environmentally-friendly means of public transportation which can help develop public transportation. The combination of scooters and subway in the area of sustainable transportation systems can provide a great many opportunities for developing access to public transportation. Of the challenges which have arisen and initiated discussions of interest about the implementation of a scooter-subway system to replace personal vehicles is the issue of routing in the aforementioned system. This has been chosen as the main subject of the present paper. Thus, the present paper provides an account for routing in this system. Because the issue of routing includes multiple factors such as time, costs, traffic, green spaces, etc., the above-mentioned problem is considered to be a multi-objective NP-hard optimization problem. For this purpose, the hybrid optimization approach of PSO-GA has been put forward in the present paper for the provided answers to be of higher accuracy and validity than those of normal optimization methods. The results obtained from modeling and problem solving for the case study in the MATLAB software are indicative of the efficiency and desirability of the model and the proposed approach for solving the model <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=route%20planning" title="route planning">route planning</a>, <a href="https://publications.waset.org/abstracts/search?q=scooter%20sharing" title=" scooter sharing"> scooter sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=public%20transportation" title=" public transportation"> public transportation</a>, <a href="https://publications.waset.org/abstracts/search?q=sharing%20system" title=" sharing system"> sharing system</a> </p> <a href="https://publications.waset.org/abstracts/140393/route-planning-for-optimization-approach-pso-ga-sharing-system-scooter-sharing-public-transportation-with-hybrid-optimization-approach-pso-ga" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/140393.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">84</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3911</span> Statistical Analysis to Select Evacuation Route</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zaky%20Musyarof">Zaky Musyarof</a>, <a href="https://publications.waset.org/abstracts/search?q=Dwi%20Yono%20Sutarto"> Dwi Yono Sutarto</a>, <a href="https://publications.waset.org/abstracts/search?q=Dwima%20Rindy%20Atika"> Dwima Rindy Atika</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20B.%20Fajriya%20Hakim"> R. B. Fajriya Hakim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Each country should be responsible for the safety of people, especially responsible for the safety of people living in disaster-prone areas. One of those services is provides evacuation route for them. But all this time, the selection of evacuation route is seem doesn’t well organized, it could be seen that when a disaster happen, there will be many accumulation of people on the steps of evacuation route. That condition is dangerous to people because hampers evacuation process. By some methods in Statistical analysis, author tries to give a suggestion how to prepare evacuation route which is organized and based on people habit. Those methods are association rules, sequential pattern mining, hierarchical cluster analysis and fuzzy logic. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=association%20rules" title="association rules">association rules</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20pattern%20mining" title=" sequential pattern mining"> sequential pattern mining</a>, <a href="https://publications.waset.org/abstracts/search?q=cluster%20analysis" title=" cluster analysis"> cluster analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20logic" title=" fuzzy logic"> fuzzy logic</a>, <a href="https://publications.waset.org/abstracts/search?q=evacuation%20route" title=" evacuation route"> evacuation route</a> </p> <a href="https://publications.waset.org/abstracts/21873/statistical-analysis-to-select-evacuation-route" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21873.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">504</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3910</span> Energy Efficient Clustering with Adaptive Particle Swarm Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=KumarShashvat">KumarShashvat</a>, <a href="https://publications.waset.org/abstracts/search?q=ArshpreetKaur"> ArshpreetKaur</a>, <a href="https://publications.waset.org/abstracts/search?q=RajeshKumar"> RajeshKumar</a>, <a href="https://publications.waset.org/abstracts/search?q=Raman%20Chadha"> Raman Chadha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless sensor networks have principal characteristic of having restricted energy and with limitation that energy of the nodes cannot be replenished. To increase the lifetime in this scenario WSN route for data transmission is opted such that utilization of energy along the selected route is negligible. For this energy efficient network, dandy infrastructure is needed because it impinges the network lifespan. Clustering is a technique in which nodes are grouped into disjoints and non–overlapping sets. In this technique data is collected at the cluster head. In this paper, Adaptive-PSO algorithm is proposed which forms energy aware clusters by minimizing the cost of locating the cluster head. The main concern is of the suitability of the swarms by adjusting the learning parameters of PSO. Particle Swarm Optimization converges quickly at the beginning stage of the search but during the course of time, it becomes stable and may be trapped in local optima. In suggested network model swarms are given the intelligence of the spiders which makes them capable enough to avoid earlier convergence and also help them to escape from the local optima. Comparison analysis with traditional PSO shows that new algorithm considerably enhances the performance where multi-dimensional functions are taken into consideration. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Particle%20Swarm%20Optimization" title="Particle Swarm Optimization">Particle Swarm Optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20%E2%80%93%20PSO" title=" adaptive – PSO"> adaptive – PSO</a>, <a href="https://publications.waset.org/abstracts/search?q=comparison%20between%20PSO%20and%20A-PSO" title=" comparison between PSO and A-PSO"> comparison between PSO and A-PSO</a>, <a href="https://publications.waset.org/abstracts/search?q=energy%20efficient%20clustering" title=" energy efficient clustering"> energy efficient clustering</a> </p> <a href="https://publications.waset.org/abstracts/46415/energy-efficient-clustering-with-adaptive-particle-swarm-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46415.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">246</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3909</span> Speed Optimization Model for Reducing Fuel Consumption Based on Shipping Log Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ayudhia%20P.%20Gusti">Ayudhia P. Gusti</a>, <a href="https://publications.waset.org/abstracts/search?q=Semin"> Semin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> It is known that total operating cost of a vessel is dominated by the cost of fuel consumption. How to reduce the fuel cost of ship so that the operational costs of fuel can be minimized is the question that arises. As the basis of these kinds of problem, sailing speed determination is an important factor to be considered by a shipping company. Optimal speed determination will give a significant influence on the route and berth schedule of ships, which also affect vessel operating costs. The purpose of this paper is to clarify some important issues about ship speed optimization. Sailing speed, displacement, sailing time, and specific fuel consumption were obtained from shipping log data to be further analyzed for modeling the speed optimization. The presented speed optimization model is expected to affect the fuel consumption and to reduce the cost of fuel consumption. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=maritime%20transportation" title="maritime transportation">maritime transportation</a>, <a href="https://publications.waset.org/abstracts/search?q=reducing%20fuel" title=" reducing fuel"> reducing fuel</a>, <a href="https://publications.waset.org/abstracts/search?q=shipping%20log%20data" title=" shipping log data"> shipping log data</a>, <a href="https://publications.waset.org/abstracts/search?q=speed%20optimization" title=" speed optimization"> speed optimization</a> </p> <a href="https://publications.waset.org/abstracts/61808/speed-optimization-model-for-reducing-fuel-consumption-based-on-shipping-log-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/61808.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">568</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3908</span> IACOP - Route Optimization in Wireless Networks Using Improved Ant Colony Optimization Protocol</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Vasundra">S. Vasundra</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20Venkatesh"> D. Venkatesh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless networks have gone through an extraordinary growth in the past few years, and will keep on playing a crucial role in future data communication. The present wireless networks aim to make communication possible anywhere and anytime. With the converging of mobile and wireless communications with Internet services, the boundary between mobile personal telecommunications and wireless computer networks is disappearing. Wireless networks of the next generation need the support of all the advances on new architectures, standards, and protocols. Since an ad hoc network may consist of a large number of mobile hosts, this imposes a significant challenge on the design of an effective and efficient routing protocol that can work well in an environment with frequent topological changes. This paper proposes improved ant colony optimization (IACO) technique. It also maintains load balancing in wireless networks. The simulation results show that the proposed IACO performs better than existing routing techniques. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=wireless%20networks" title="wireless networks">wireless networks</a>, <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20optimization" title=" ant colony optimization"> ant colony optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=load%20balancing" title=" load balancing"> load balancing</a>, <a href="https://publications.waset.org/abstracts/search?q=architecture" title=" architecture"> architecture</a> </p> <a href="https://publications.waset.org/abstracts/43366/iacop-route-optimization-in-wireless-networks-using-improved-ant-colony-optimization-protocol" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43366.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">421</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3907</span> Roullete Wheel Selection Mechanism for Solving Travelling Salesman Problem in Ant Colony Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sourabh%20Joshi">Sourabh Joshi</a>, <a href="https://publications.waset.org/abstracts/search?q=Geetinder%20Kaur"> Geetinder Kaur</a>, <a href="https://publications.waset.org/abstracts/search?q=Sarabjit%20Kaur"> Sarabjit Kaur</a>, <a href="https://publications.waset.org/abstracts/search?q=Gulwatanpreet%20Singh"> Gulwatanpreet Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Geetika%20Mannan"> Geetika Mannan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we have use an algorithm that able to obtain an optimal solution to travelling salesman problem from a huge search space, quickly. This algorithm is based upon the ant colony optimization technique and employees roulette wheel selection mechanism. To illustrate it more clearly, a program has been implemented which is based upon this algorithm, that presents the changing process of route iteration in a more intuitive way. In the event, we had find the optimal path between hundred cities and also calculate the distance between two cities. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ant%20colony" title="ant colony">ant colony</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=travelling%20salesman%20problem" title=" travelling salesman problem"> travelling salesman problem</a>, <a href="https://publications.waset.org/abstracts/search?q=roulette%20wheel%20selection" title=" roulette wheel selection"> roulette wheel selection</a> </p> <a href="https://publications.waset.org/abstracts/15736/roullete-wheel-selection-mechanism-for-solving-travelling-salesman-problem-in-ant-colony-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15736.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">441</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3906</span> Geospatial Network Analysis Using Particle Swarm Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Varun%20Singh">Varun Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Mainak%20Bandyopadhyay"> Mainak Bandyopadhyay</a>, <a href="https://publications.waset.org/abstracts/search?q=Maharana%20Pratap%20Singh"> Maharana Pratap Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The shortest path (SP) problem concerns with finding the shortest path from a specific origin to a specified destination in a given network while minimizing the total cost associated with the path. This problem has widespread applications. Important applications of the SP problem include vehicle routing in transportation systems particularly in the field of in-vehicle Route Guidance System (RGS) and traffic assignment problem (in transportation planning). Well known applications of evolutionary methods like Genetic Algorithms (GA), Ant Colony Optimization, Particle Swarm Optimization (PSO) have come up to solve complex optimization problems to overcome the shortcomings of existing shortest path analysis methods. It has been reported by various researchers that PSO performs better than other evolutionary optimization algorithms in terms of success rate and solution quality. Further Geographic Information Systems (GIS) have emerged as key information systems for geospatial data analysis and visualization. This research paper is focused towards the application of PSO for solving the shortest path problem between multiple points of interest (POI) based on spatial data of Allahabad City and traffic speed data collected using GPS. Geovisualization of results of analysis is carried out in GIS. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title="particle swarm optimization">particle swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=GIS" title=" GIS"> GIS</a>, <a href="https://publications.waset.org/abstracts/search?q=traffic%20data" title=" traffic data"> traffic data</a>, <a href="https://publications.waset.org/abstracts/search?q=outliers" title=" outliers"> outliers</a> </p> <a href="https://publications.waset.org/abstracts/13181/geospatial-network-analysis-using-particle-swarm-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13181.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">483</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3905</span> Printed Thai Character Recognition Using Particle Swarm Optimization Algorithm </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Phawin%20Sangsuvan">Phawin Sangsuvan</a>, <a href="https://publications.waset.org/abstracts/search?q=Chutimet%20Srinilta"> Chutimet Srinilta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This Paper presents the applications of Particle Swarm Optimization (PSO) Method for Thai optical character recognition (OCR). OCR consists of the pre-processing, character recognition and post-processing. Before enter into recognition process. The Character must be “Prepped” by pre-processing process. The PSO is an optimization method that belongs to the swarm intelligence family based on the imitation of social behavior patterns of animals. Route of each particle is determined by an individual data among neighborhood particles. The interaction of the particles with neighbors is the advantage of Particle Swarm to determine the best solution. So PSO is interested by a lot of researchers in many difficult problems including character recognition. As the previous this research used a Projection Histogram to extract printed digits features and defined the simple Fitness Function for PSO. The results reveal that PSO gives 67.73% for testing dataset. So in the future there can be explored enhancement the better performance of PSO with improve the Fitness Function. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=character%20recognition" title="character recognition">character recognition</a>, <a href="https://publications.waset.org/abstracts/search?q=histogram%20projection" title=" histogram projection"> histogram projection</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=pattern%20recognition%20techniques" title=" pattern recognition techniques "> pattern recognition techniques </a> </p> <a href="https://publications.waset.org/abstracts/25613/printed-thai-character-recognition-using-particle-swarm-optimization-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25613.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">477</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3904</span> A Novel Solution Methodology for Transit Route Network Design Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ghada%20Moussa">Ghada Moussa</a>, <a href="https://publications.waset.org/abstracts/search?q=Mamoud%20Owais"> Mamoud Owais</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Transit Route Network Design Problem (TrNDP) is the most important component in Transit planning, in which the overall cost of the public transportation system highly depends on it. The main purpose of this study is to develop a novel solution methodology for the TrNDP, which goes beyond pervious traditional sophisticated approaches. The novelty of the solution methodology, adopted in this paper, stands on the deterministic operators which are tackled to construct bus routes. The deterministic manner of the TrNDP solution relies on using linear and integer mathematical formulations that can be solved exactly with their standard solvers. The solution methodology has been tested through Mandl’s benchmark network problem. The test results showed that the methodology developed in this research is able to improve the given network solution in terms of number of constructed routes, direct transit service coverage, transfer directness and solution reliability. Although the set of routes resulted from the methodology would stand alone as a final efficient solution for TrNDP, it could be used as an initial solution for meta-heuristic procedures to approach global optimal. Based on the presented methodology, a more robust network optimization tool would be produced for public transportation planning purposes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=integer%20programming" title="integer programming">integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=transit%20route%20design" title=" transit route design"> transit route design</a>, <a href="https://publications.waset.org/abstracts/search?q=transportation" title=" transportation"> transportation</a>, <a href="https://publications.waset.org/abstracts/search?q=urban%20planning" title=" urban planning"> urban planning</a> </p> <a href="https://publications.waset.org/abstracts/5927/a-novel-solution-methodology-for-transit-route-network-design-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5927.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">273</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3903</span> Optimization of Feeder Bus Routes at Urban Rail Transit Stations Based on Link Growth Probability</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yu%20Song">Yu Song</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuefei%20Jin"> Yuefei Jin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Urban public transportation can be integrated when there is an efficient connection between urban rail lines, however, there are currently no effective or quick solutions being investigated for this connection. This paper analyzes the space-time distribution and travel demand of passenger connection travel based on taxi track data and data from the road network, excavates potential bus connection stations based on potential connection demand data, and introduces the link growth probability model in the complex network to solve the basic connection bus lines in order to ascertain the direction of the bus lines that are the most connected given the demand characteristics. Then, a tree view exhaustive approach based on constraints is suggested based on graph theory, which can hasten the convergence of findings while doing chain calculations. This study uses WEI QU NAN Station, the Xi'an Metro Line 2 terminal station in Shaanxi Province, as an illustration, to evaluate the model's and the solution method's efficacy. According to the findings, 153 prospective stations have been dug up in total, the feeder bus network for the entire line has been laid out, and the best route adjustment strategy has been found. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=feeder%20bus" title="feeder bus">feeder bus</a>, <a href="https://publications.waset.org/abstracts/search?q=route%20optimization" title=" route optimization"> route optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=link%20growth%20probability" title=" link growth probability"> link growth probability</a>, <a href="https://publications.waset.org/abstracts/search?q=the%20graph%20theory" title=" the graph theory"> the graph theory</a> </p> <a href="https://publications.waset.org/abstracts/163356/optimization-of-feeder-bus-routes-at-urban-rail-transit-stations-based-on-link-growth-probability" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/163356.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">77</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3902</span> Optimal Wheat Straw to Bioethanol Supply Chain Models</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdul%20Halim%20Abdul%20Razik">Abdul Halim Abdul Razik</a>, <a href="https://publications.waset.org/abstracts/search?q=Ali%20Elkamel"> Ali Elkamel</a>, <a href="https://publications.waset.org/abstracts/search?q=Leonardo%20Simon"> Leonardo Simon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wheat straw is one of the alternative feedstocks that may be utilized for bioethanol production especially when sustainability criteria are the major concerns. To increase market competitiveness, optimal supply chain plays an important role since wheat straw is a seasonal agricultural residue. In designing the supply chain optimization model, economic profitability of the thermochemical and biochemical conversion routes options were considered. It was found that torrefied pelletization with gasification route to be the most profitable option to produce bioethanol from the lignocellulosic source of wheat straw. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bio-ethanol" title="bio-ethanol">bio-ethanol</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=supply%20chain" title=" supply chain"> supply chain</a>, <a href="https://publications.waset.org/abstracts/search?q=wheat%20straw" title=" wheat straw"> wheat straw</a> </p> <a href="https://publications.waset.org/abstracts/27560/optimal-wheat-straw-to-bioethanol-supply-chain-models" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27560.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">736</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3901</span> Delivery System Design of the Local Part to Reduce the Logistic Costs in an Automotive Industry</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alesandro%20Romero">Alesandro Romero</a>, <a href="https://publications.waset.org/abstracts/search?q=Inaki%20Maulida%20Hakim"> Inaki Maulida Hakim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research was conducted in an automotive company in Indonesia to overcome the problem of high logistics cost. The problem causes high of additional truck delivery. From the breakdown of the problem, chosen one route, which has the highest gap value, namely for RE-04. Research methodology will be started from calculating the ideal condition, making simulation, calculating the ideal logistic cost, and proposing an improvement. From the calculation of the ideal condition, box arrangement was done on the truck; the average efficiency was 97,4 % with three trucks delivery per day. Route simulation making uses Tecnomatix Plant Simulation software as a visualization for the company about how the system is occurred on route RE-04 in ideal condition. Furthermore, from the calculation of logistics cost of the ideal condition, it brings savings of Rp53.011.800,00 in a month. The last step is proposing improvements on the area of route RE-04. The route arrangement is done by Saving Method and sequence of each supplier with the Nearest Neighbor. The results of the proposed improvements are three new route groups, where was expected to decrease logistics cost Rp3.966.559,40 per day, and increase the average of the truck efficiency 8,78% per day. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=efficiency" title="efficiency">efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=logistic%20cost" title=" logistic cost"> logistic cost</a>, <a href="https://publications.waset.org/abstracts/search?q=milkrun" title=" milkrun"> milkrun</a>, <a href="https://publications.waset.org/abstracts/search?q=saving%20methode" title=" saving methode"> saving methode</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a> </p> <a href="https://publications.waset.org/abstracts/35239/delivery-system-design-of-the-local-part-to-reduce-the-logistic-costs-in-an-automotive-industry" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35239.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">446</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3900</span> Dynamic Route Optimization in Vehicle Adhoc Networks: A Heuristics Routing Protocol</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rafi%20Ullah">Rafi Ullah</a>, <a href="https://publications.waset.org/abstracts/search?q=Shah%20Muhammad%20Emaduddin"> Shah Muhammad Emaduddin</a>, <a href="https://publications.waset.org/abstracts/search?q=Taha%20Jilani"> Taha Jilani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Vehicle Adhoc Networks (VANET) belongs to a special class of Mobile Adhoc Network (MANET) with high mobility. Network is created by road side vehicles equipped with communication devices like GPS and Wifi etc. Since the environment is highly dynamic due to difference in speed and high mobility of vehicles and weak stability of the network connection, it is a challenging task to design an efficient routing protocol for such an unstable environment. Our proposed algorithm uses heuristic for the calculation of optimal path for routing the packet efficiently in collaboration with several other parameters like geographical location, speed, priority, the distance among the vehicles, communication range, and networks congestion. We have incorporated probabilistic, heuristic and machine learning based approach inconsistency with the relay function of the memory buffer to keep the packet moving towards the destination. These parameters when used in collaboration provide us a very strong and admissible heuristics. We have mathematically proved that the proposed technique is efficient for the routing of packets, especially in a medical emergency situation. These networks can be used for medical emergency, security, entertainment and routing purposes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=heuristics%20routing" title="heuristics routing">heuristics routing</a>, <a href="https://publications.waset.org/abstracts/search?q=intelligent%20routing" title=" intelligent routing"> intelligent routing</a>, <a href="https://publications.waset.org/abstracts/search?q=VANET" title=" VANET"> VANET</a>, <a href="https://publications.waset.org/abstracts/search?q=route%20optimization" title=" route optimization"> route optimization</a> </p> <a href="https://publications.waset.org/abstracts/101651/dynamic-route-optimization-in-vehicle-adhoc-networks-a-heuristics-routing-protocol" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/101651.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">176</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3899</span> On the Application of Heuristics of the Traveling Salesman Problem for the Task of Restoring the DNA Matrix</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Boris%20Melnikov">Boris Melnikov</a>, <a href="https://publications.waset.org/abstracts/search?q=Dmitrii%20Chaikovskii"> Dmitrii Chaikovskii</a>, <a href="https://publications.waset.org/abstracts/search?q=Elena%20Melnikova"> Elena Melnikova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The traveling salesman problem (TSP) is a well-known optimization problem that seeks to find the shortest possible route that visits a set of points and returns to the starting point. In this paper, we apply some heuristics of the TSP for the task of restoring the DNA matrix. This restoration problem is often considered in biocybernetics. For it, we must recover the matrix of distances between DNA sequences if not all the elements of the matrix under consideration are known at the input. We consider the possibility of using this method in the testing of distance calculation algorithms between a pair of DNAs to restore the partially filled matrix. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimization%20problems" title="optimization problems">optimization problems</a>, <a href="https://publications.waset.org/abstracts/search?q=DNA%20matrix" title=" DNA matrix"> DNA matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=partially%20filled%20matrix" title=" partially filled matrix"> partially filled matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=traveling%20salesman%20problem" title=" traveling salesman problem"> traveling salesman problem</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic%20algorithms" title=" heuristic algorithms"> heuristic algorithms</a> </p> <a href="https://publications.waset.org/abstracts/172868/on-the-application-of-heuristics-of-the-traveling-salesman-problem-for-the-task-of-restoring-the-dna-matrix" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/172868.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">150</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3898</span> The Water-Way Route Management for Cultural Tourism Promotion at Angsila District: Challenge and Opportunity</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Teera%20Intararuang">Teera Intararuang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The purpose of this research is to study on the challenge and opportunity for waterway route management for promoting cultural tourism in Angsila District, Chonburi Province. To accomplish the goals and objectives, qualitative research will be applied. The research instruments used are observation, basic interviews, in-depth interviews, and interview key local performance. The study also uses both primary data and secondary data. From research result, it is revealed that all respondents had appreciated and strongly agree to promote their waterway route tourism as an intend for further increase for their income. However, it has some challenges to success this project due to natural obstacles such as water level, seasons and high temperature. Moreover, they lack financial support from government sectors also. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Angsila%20community" title="Angsila community">Angsila community</a>, <a href="https://publications.waset.org/abstracts/search?q=waterway%20tourism%20route" title=" waterway tourism route"> waterway tourism route</a>, <a href="https://publications.waset.org/abstracts/search?q=cultural%20tourism" title=" cultural tourism"> cultural tourism</a>, <a href="https://publications.waset.org/abstracts/search?q=way%20of%20life" title=" way of life"> way of life</a> </p> <a href="https://publications.waset.org/abstracts/47348/the-water-way-route-management-for-cultural-tourism-promotion-at-angsila-district-challenge-and-opportunity" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47348.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">248</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3897</span> Study of a Complete Free Route Implementation in the European Airspace</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Cesar%20A.%20Nava-Gaxiola">Cesar A. Nava-Gaxiola</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20Barrado"> C. Barrado</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Harmonized with SESAR (Single European Sky Research) initiatives, a new concept related with airspace structures have been introduced in Europe, the Free Route Airspace. The key of free route is based in an airspace where users may freely plan a route between a defined entry and exit waypoint, with the possibility of routing via intermediate points, the free route flights remain subject to air traffic control (ATC) for the established separations. Free route airspace does not present anymore fixed airways to airspace users, as a consequence it brings a new paradigm for managing safe separations of aircrafts inside these airspace blocks . Nowadays, several European nations have been introduced the concept, some of them in a complete or partial stage, but finally offering limited benefits to airspace users for this condition. This research evaluates the future scenario of free route implementation across Europe, considering a unique airspace block configuration with a complete upper airspace with free route. The paper is centered in investigating the benefits for airspace users, and the study of possible increments of Air Traffic Controllers task loads with a full application. In this research, fast time simulations are carrying out for discovering how much flight time and distance aircrafts can save with an overall free route establishment. In the other side, the paper explains the evolution of conflicts derivate from possible separation losses between aircrafts in this new environment. Free route conflicts can emerges in any points of the airspace, requiring a great effort for solving it, in comparison with fixed airways, where conflicts normally were found by controllers in known waypoints, and they solved using the fixed network as reference. The airspace configuration modelled in this study take into account the actual navigation waypoints structure, moving into a future scenario, where new ones waypoints are added and new traffic flow patterns appears. In this sense, this research explores the advantages and unknown difficulties that a large scale application of free route concept can carry out in the European airspace. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ATC%20conflicts" title="ATC conflicts">ATC conflicts</a>, <a href="https://publications.waset.org/abstracts/search?q=efficiency" title=" efficiency"> efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=free%20route%20airspace" title=" free route airspace"> free route airspace</a>, <a href="https://publications.waset.org/abstracts/search?q=SESAR" title=" SESAR"> SESAR</a> </p> <a href="https://publications.waset.org/abstracts/81131/study-of-a-complete-free-route-implementation-in-the-european-airspace" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/81131.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">188</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3896</span> Curve Fitting by Cubic Bezier Curves Using Migrating Birds Optimization Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mitat%20Uysal">Mitat Uysal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A new met heuristic optimization algorithm called as Migrating Birds Optimization is used for curve fitting by rational cubic Bezier Curves. This requires solving a complicated multivariate optimization problem. In this study, the solution of this optimization problem is achieved by Migrating Birds Optimization algorithm that is a powerful met heuristic nature-inspired algorithm well appropriate for optimization. The results of this study show that the proposed method performs very well and being able to fit the data points to cubic Bezier Curves with a high degree of accuracy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=algorithms" title="algorithms">algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=Bezier%20curves" title=" Bezier curves"> Bezier curves</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic%20optimization" title=" heuristic optimization"> heuristic optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=migrating%20birds%20optimization" title=" migrating birds optimization"> migrating birds optimization</a> </p> <a href="https://publications.waset.org/abstracts/78026/curve-fitting-by-cubic-bezier-curves-using-migrating-birds-optimization-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/78026.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">336</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3895</span> Optimization of Lubricant Distribution with Alternative Coordinates and Number of Warehouses Considering Truck Capacity and Time Windows</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Taufik%20Rizkiandi">Taufik Rizkiandi</a>, <a href="https://publications.waset.org/abstracts/search?q=Teuku%20Yuri%20M.%20Zagloel"> Teuku Yuri M. Zagloel</a>, <a href="https://publications.waset.org/abstracts/search?q=Andri%20Dwi%20Setiawan"> Andri Dwi Setiawan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Distribution and growth in the transportation and warehousing business sector decreased by 15,04%. There was a decrease in Gross Domestic Product (GDP) contribution level from rank 7 of 4,41% in 2019 to 3,81% in rank 8 in 2020. A decline in the transportation and warehousing business sector contributes to GDP, resulting in oil and gas companies implementing an efficient supply chain strategy to ensure the availability of goods, especially lubricants. Fluctuating demand for lubricants and warehouse service time limits are essential things that are taken into account in determining an efficient route. Add depots points as a solution so that demand for lubricants is fulfilled (not stock out). However, adding a depot will increase operating costs and storage costs. Therefore, it is necessary to optimize the addition of depots using the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW). This research case study was conducted at an oil and gas company that produces lubricants from 2019 to 2021. The study results obtained the optimal route and the addition of a depot with a minimum additional cost. The total cost remains efficient with the addition of a depot when compared to one depot from Jakarta. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CVRPTW" title="CVRPTW">CVRPTW</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20route" title=" optimal route"> optimal route</a>, <a href="https://publications.waset.org/abstracts/search?q=depot" title=" depot"> depot</a>, <a href="https://publications.waset.org/abstracts/search?q=tabu%20search%20algorithm" title=" tabu search algorithm"> tabu search algorithm</a> </p> <a href="https://publications.waset.org/abstracts/149006/optimization-of-lubricant-distribution-with-alternative-coordinates-and-number-of-warehouses-considering-truck-capacity-and-time-windows" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/149006.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">136</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3894</span> General Time-Dependent Sequenced Route Queries in Road Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Hossein%20Ahmadi">Mohammad Hossein Ahmadi</a>, <a href="https://publications.waset.org/abstracts/search?q=Vahid%20Haghighatdoost"> Vahid Haghighatdoost</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Spatial databases have been an active area of research over years. In this paper, we study how to answer the General Time-Dependent Sequenced Route queries. Given the origin and destination of a user over a time-dependent road network graph, an ordered list of categories of interests and a departure time interval, our goal is to find the minimum travel time path along with the best departure time that minimizes the total travel time from the source location to the given destination passing through a sequence of points of interests belonging to each of the specified categories of interest. The challenge of this problem is the added complexity to the optimal sequenced route queries, where we assume that first the road network is time dependent, and secondly the user defines a departure time interval instead of one single departure time instance. For processing general time-dependent sequenced route queries, we propose two solutions as Discrete-Time and Continuous-Time Sequenced Route approaches, finding approximate and exact solutions, respectively. Our proposed approaches traverse the road network based on A*-search paradigm equipped with an efficient heuristic function, for shrinking the search space. Extensive experiments are conducted to verify the efficiency of our proposed approaches. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=trip%20planning" title="trip planning">trip planning</a>, <a href="https://publications.waset.org/abstracts/search?q=time%20dependent" title=" time dependent"> time dependent</a>, <a href="https://publications.waset.org/abstracts/search?q=sequenced%20route%20query" title=" sequenced route query"> sequenced route query</a>, <a href="https://publications.waset.org/abstracts/search?q=road%20networks" title=" road networks"> road networks</a> </p> <a href="https://publications.waset.org/abstracts/72792/general-time-dependent-sequenced-route-queries-in-road-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72792.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">321</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3893</span> Fuzzy Approach for the Evaluation of Feasibility Levels of Vehicle Movement on the Disaster-Streaking Zone’s Roads</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gia%20Sirbiladze">Gia Sirbiladze</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Route planning problems are among the activities that have the highest impact on logistical planning, transportation, and distribution because of their effects on efficiency in resource management, service levels, and client satisfaction. In extreme conditions, the difficulty of vehicle movement between different customers causes the imprecision of time of movement and the uncertainty of the feasibility of movement. A feasibility level of vehicle movement on the closed route of the disaster-streaking zone is defined for the construction of an objective function. Experts’ evaluations of the uncertain parameters in q-rung ortho-pair fuzzy numbers (q-ROFNs) are presented. A fuzzy bi-objective combinatorial optimization problem of fuzzy vehicle routine problem (FVRP) is constructed based on the technique of possibility theory. The FVRP is reduced to the bi-criteria partitioning problem for the so-called “promising” routes which were selected from the all-admissible closed routes. The convenient selection of the “promising” routes allows us to solve the reduced problem in real-time computing. For the numerical solution of the bi-criteria partitioning problem, the -constraint approach is used. The main results' support software is designed. The constructed model is illustrated with a numerical example. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=q-rung%20ortho-pair%20fuzzy%20sets" title="q-rung ortho-pair fuzzy sets">q-rung ortho-pair fuzzy sets</a>, <a href="https://publications.waset.org/abstracts/search?q=facility%20location%20selection%20problem" title=" facility location selection problem"> facility location selection problem</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20combinatorial%20optimization%20problem" title=" multi-objective combinatorial optimization problem"> multi-objective combinatorial optimization problem</a>, <a href="https://publications.waset.org/abstracts/search?q=partitioning%20problem" title=" partitioning problem"> partitioning problem</a> </p> <a href="https://publications.waset.org/abstracts/160984/fuzzy-approach-for-the-evaluation-of-feasibility-levels-of-vehicle-movement-on-the-disaster-streaking-zones-roads" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/160984.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">134</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3892</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/abstracts/search?q=Kostas%20Metaxiotis">Kostas Metaxiotis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Portfolio optimization is one of the most important topics in finance. This paper proposes a mean–variance–skewness (MVS) portfolio optimization model. Traditionally, the portfolio optimization problem is solved by using the mean–variance (MV) framework. In this study, we formulate the proposed model as a three-objective optimization problem, where the portfolio'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 class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=evolutionary%20algorithms" title="evolutionary algorithms">evolutionary algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=portfolio%20optimization" title=" portfolio optimization"> portfolio optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=skewness" title=" skewness"> skewness</a>, <a href="https://publications.waset.org/abstracts/search?q=stock%20selection" title=" stock selection"> stock selection</a> </p> <a href="https://publications.waset.org/abstracts/102472/a-mean-variance-skewness-portfolio-optimization-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/102472.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">198</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3891</span> Improved Whale Algorithm Based on Information Entropy and Its Application in Truss Structure Optimization Design</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Serges%20Mendomo%20%20Meye">Serges Mendomo Meye</a>, <a href="https://publications.waset.org/abstracts/search?q=Li%20Guowei"> Li Guowei</a>, <a href="https://publications.waset.org/abstracts/search?q=Shen%20Zhenzhong"> Shen Zhenzhong</a>, <a href="https://publications.waset.org/abstracts/search?q=Gan%20Lei"> Gan Lei</a>, <a href="https://publications.waset.org/abstracts/search?q=Xu%20Liqun"> Xu Liqun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Given the limitations of the original whale optimization algorithm (WAO) in local optimum and low convergence accuracy in truss structure optimization problems, based on the fundamental whale algorithm, an improved whale optimization algorithm (SWAO) based on information entropy is proposed. The information entropy itself is an uncertain measure. It is used to control the range of whale searches in path selection. It can overcome the shortcomings of the basic whale optimization algorithm (WAO) and can improve the global convergence speed of the algorithm. Taking truss structure as the optimization research object, the mathematical model of truss structure optimization is established; the cross-sectional area of truss is taken as the design variable; the objective function is the weight of truss structure; and an improved whale optimization algorithm (SWAO) is used for optimization design, which provides a new idea and means for its application in large and complex engineering structure optimization design. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=information%20entropy" title="information entropy">information entropy</a>, <a href="https://publications.waset.org/abstracts/search?q=structural%20optimization" title=" structural optimization"> structural optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=truss%20structure" title=" truss structure"> truss structure</a>, <a href="https://publications.waset.org/abstracts/search?q=whale%20algorithm" title=" whale algorithm"> whale algorithm</a> </p> <a href="https://publications.waset.org/abstracts/139986/improved-whale-algorithm-based-on-information-entropy-and-its-application-in-truss-structure-optimization-design" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/139986.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">249</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3890</span> Improved Particle Swarm Optimization with Cellular Automata and Fuzzy Cellular Automata</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ramin%20Javadzadeh">Ramin Javadzadeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The particle swarm optimization are Meta heuristic optimization method, which are used for clustering and pattern recognition applications are abundantly. These algorithms in multimodal optimization problems are more efficient than genetic algorithms. A major drawback in these algorithms is their slow convergence to global optimum and their weak stability can be considered in various running of these algorithms. In this paper, improved Particle swarm optimization is introduced for the first time to overcome its problems. The fuzzy cellular automata is used for improving the algorithm efficiently. The credibility of the proposed approach is evaluated by simulations, and it is shown that the proposed approach achieves better results can be achieved compared to the Particle swarm optimization algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cellular%20automata" title="cellular automata">cellular automata</a>, <a href="https://publications.waset.org/abstracts/search?q=cellular%20learning%20automata" title=" cellular learning automata"> cellular learning automata</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20search" title=" local search"> local search</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a> </p> <a href="https://publications.waset.org/abstracts/24739/improved-particle-swarm-optimization-with-cellular-automata-and-fuzzy-cellular-automata" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24739.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">606</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3889</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/abstracts/search?q=Mar%C3%ADa%20L.%20Jal%C3%B3n">María L. Jalón</a>, <a href="https://publications.waset.org/abstracts/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/abstracts/search?q=non-stationary%20stochastic%20optimization" title="non-stationary stochastic optimization">non-stationary stochastic optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=oscillating%20water" title=" oscillating water"> oscillating water</a>, <a href="https://publications.waset.org/abstracts/search?q=temporal%20variability" title=" temporal variability"> temporal variability</a>, <a href="https://publications.waset.org/abstracts/search?q=wave%20energy" title=" wave energy"> wave energy</a> </p> <a href="https://publications.waset.org/abstracts/75300/non-stationary-stochastic-optimization-of-an-oscillating-water-column" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/75300.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">373</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=route%20optimization&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=route%20optimization&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=route%20optimization&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=route%20optimization&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=route%20optimization&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=route%20optimization&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=route%20optimization&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=route%20optimization&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=route%20optimization&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=route%20optimization&page=130">130</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=route%20optimization&page=131">131</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=route%20optimization&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>