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: coherent covering location problem</title> <meta name="description" content="Search results for: coherent covering location problem"> <meta name="keywords" content="coherent covering location problem"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="coherent covering location problem" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="coherent covering location problem"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 9943</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: coherent covering location problem</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9943</span> Searching the Efficient Frontier for the Coherent Covering Location Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Felipe%20Azocar%20Simonet">Felipe Azocar Simonet</a>, <a href="https://publications.waset.org/abstracts/search?q=Luis%20Acosta%20Espejo"> Luis Acosta Espejo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this article, we will try to find an efficient boundary approximation for the bi-objective location problem with coherent coverage for two levels of hierarchy (CCLP). We present the mathematical formulation of the model used. Supported efficient solutions and unsupported efficient solutions are obtained by solving the bi-objective combinatorial problem through the weights method using a Lagrangean heuristic. Subsequently, the results are validated through the DEA analysis with the GEM index (Global efficiency measurement). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=coherent%20covering%20location%20problem" title="coherent covering location problem">coherent covering location problem</a>, <a href="https://publications.waset.org/abstracts/search?q=efficient%20frontier" title=" efficient frontier"> efficient frontier</a>, <a href="https://publications.waset.org/abstracts/search?q=lagragian%20relaxation" title=" lagragian relaxation"> lagragian relaxation</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20envelopment%20analysis" title=" data envelopment analysis"> data envelopment analysis</a> </p> <a href="https://publications.waset.org/abstracts/74509/searching-the-efficient-frontier-for-the-coherent-covering-location-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/74509.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">334</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">9942</span> Genetic Algorithm for Bi-Objective Hub Covering Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abbas%20Mirakhorli">Abbas Mirakhorli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A hub covering problem is a type of hub location problem that tries to maximize the coverage area with the least amount of installed hubs. There have not been many studies in the literature about multi-objective hubs covering location problems. Thus, in this paper, a bi-objective model for the hub covering problem is presented. The two objectives that are considered in this paper are the minimization of total transportation costs and the maximization of coverage of origin-destination nodes. A genetic algorithm is presented to solve the model when the number of nodes is increased. The genetic algorithm is capable of solving the model when the number of nodes increases by more than 20. Moreover, the genetic algorithm solves the model in less amount of time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=facility%20location" title="facility location">facility location</a>, <a href="https://publications.waset.org/abstracts/search?q=hub%20covering" title=" hub covering"> hub covering</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20optimization" title=" multi-objective optimization"> multi-objective optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a> </p> <a href="https://publications.waset.org/abstracts/181401/genetic-algorithm-for-bi-objective-hub-covering-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/181401.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">60</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">9941</span> AM/E/c Queuing Hub Maximal Covering Location Model with Fuzzy Parameter</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20H.%20Fazel%20Zarandi">M. H. Fazel Zarandi</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Moshahedi"> N. Moshahedi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The hub location problem appears in a variety of applications such as medical centers, firefighting facilities, cargo delivery systems and telecommunication network design. The location of service centers has a strong influence on the congestion at each of them, and, consequently, on the quality of service. This paper presents a fuzzy maximal hub covering location problem (FMCHLP) in which travel costs between any pair of nodes is considered as a fuzzy variable. In order to consider the quality of service, we model each hub as a queue. Arrival rate follows Poisson distribution and service rate follows Erlang distribution. In this paper, at first, a nonlinear mathematical programming model is presented. Then, we convert it to the linear one. We solved the linear model using GAMS software up to 25 nodes and for large sizes due to the complexity of hub covering location problems, and simulated annealing algorithm is developed to solve and test the model. Also, we used possibilistic c-means clustering method in order to find an initial solution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20modeling" title="fuzzy modeling">fuzzy modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=location" title=" location"> location</a>, <a href="https://publications.waset.org/abstracts/search?q=possibilistic%20clustering" title=" possibilistic clustering"> possibilistic clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=queuing" title=" queuing"> queuing</a> </p> <a href="https://publications.waset.org/abstracts/49645/amec-queuing-hub-maximal-covering-location-model-with-fuzzy-parameter" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49645.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">394</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">9940</span> Solving the Set Covering Problem Using the Binary Cat Swarm Optimization Metaheuristic</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Broderick%20Crawford">Broderick Crawford</a>, <a href="https://publications.waset.org/abstracts/search?q=Ricardo%20Soto"> Ricardo Soto</a>, <a href="https://publications.waset.org/abstracts/search?q=Natalia%20Berrios"> Natalia Berrios</a>, <a href="https://publications.waset.org/abstracts/search?q=Eduardo%20Olguin"> Eduardo Olguin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present a binary cat swarm optimization for solving the Set covering problem. The set covering problem is a well-known NP-hard problem with many practical applications, including those involving scheduling, production planning and location problems. Binary cat swarm optimization is a recent swarm metaheuristic technique based on the behavior of discrete cats. Domestic cats show the ability to hunt and are curious about moving objects. The cats have two modes of behavior: seeking mode and tracing mode. We illustrate this approach with 65 instances of the problem from the OR-Library. Moreover, we solve this problem with 40 new binarization techniques and we select the technical with the best results obtained. Finally, we make a comparison between results obtained in previous studies and the new binarization technique, that is, with roulette wheel as transfer function and V3 as discretization technique. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=binary%20cat%20swarm%20optimization" title="binary cat swarm optimization">binary cat swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=binarization%20methods" title=" binarization methods"> binarization methods</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristic" title=" metaheuristic"> metaheuristic</a>, <a href="https://publications.waset.org/abstracts/search?q=set%20covering%20problem" title=" set covering problem"> set covering problem</a> </p> <a href="https://publications.waset.org/abstracts/47183/solving-the-set-covering-problem-using-the-binary-cat-swarm-optimization-metaheuristic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47183.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">396</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">9939</span> A New Heuristic Algorithm for Maximization Total Demands of Nodes and Number of Covered Nodes Simultaneously</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ehsan%20Saghehei">Ehsan Saghehei</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahdi%20Eghbali"> Mahdi Eghbali</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The maximal covering location problem (MCLP) was originally developed to determine a set of facility locations which would maximize the total customers' demand serviced by the facilities within a predetermined critical service criterion. However, on some problems that differences between the demand nodes are covered or the number of nodes each node is large, the method of solving MCLP may ignore these differences. In this paper, Heuristic solution based on the ranking of demands in each node and the number of nodes covered by each node according to a predetermined critical value is proposed. The output of this method is to maximize total demands of nodes and number of covered nodes, simultaneously. Furthermore, by providing an example, the solution algorithm is described and its results are compared with Greedy and Lagrange algorithms. Also, the results of the algorithm to solve the larger problem sizes that compared with other methods are provided. A summary and future works conclude the paper. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=heuristic%20solution" title="heuristic solution">heuristic solution</a>, <a href="https://publications.waset.org/abstracts/search?q=maximal%20covering%20location%20problem" title=" maximal covering location problem"> maximal covering location problem</a>, <a href="https://publications.waset.org/abstracts/search?q=ranking" title=" ranking"> ranking</a>, <a href="https://publications.waset.org/abstracts/search?q=set%20covering" title=" set covering"> set covering</a> </p> <a href="https://publications.waset.org/abstracts/29314/a-new-heuristic-algorithm-for-maximization-total-demands-of-nodes-and-number-of-covered-nodes-simultaneously" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29314.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">573</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">9938</span> ATM Location Problem and Cash Management in ATM's</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Erol%20Genevois">M. Erol Genevois</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20Celik"> D. Celik</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20Z.%20Ulukan"> H. Z. Ulukan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Automated teller machines (ATMs) can be considered among one of the most important service facilities in the banking industry. The investment in ATMs and the impact on the banking industry is growing steadily in every part of the world. The banks take into consideration many factors like safety, convenience, visibility, cost in order to determine the optimum locations of ATMs. Today, ATMs are not only available in bank branches but also at retail locations. Another important factor is the cash management in ATMs. A cash demand model for every ATM is needed in order to have an efficient cash management system. This forecasting model is based on historical cash demand data which is highly related to the ATMs location. So, the location and the cash management problem should be considered together. Although the literature survey on facility location models is quite large, it is surprising that there are only few studies which handle together ATMs location and cash management problem. In order to fulfill the gap, this paper provides a general review on studies, efforts and development in ATMs location and cash management problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ATM%20location%20problem" title="ATM location problem">ATM location problem</a>, <a href="https://publications.waset.org/abstracts/search?q=cash%20management%20problem" title=" cash management problem"> cash management problem</a>, <a href="https://publications.waset.org/abstracts/search?q=ATM%20cash%20replenishment%20problem" title=" ATM cash replenishment problem"> ATM cash replenishment problem</a>, <a href="https://publications.waset.org/abstracts/search?q=literature%20review%20in%20ATMs" title=" literature review in ATMs"> literature review in ATMs</a> </p> <a href="https://publications.waset.org/abstracts/32530/atm-location-problem-and-cash-management-in-atms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32530.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">480</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">9937</span> Sequential Covering Algorithm for Nondifferentiable Global Optimization Problem and Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Rahal">Mohamed Rahal</a>, <a href="https://publications.waset.org/abstracts/search?q=Djaouida%20Guetta"> Djaouida Guetta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the one-dimensional unconstrained global optimization problem of continuous functions satifying a Hölder condition is considered. We extend the algorithm of sequential covering SCA for Lipschitz functions to a large class of Hölder functions. The convergence of the method is studied and the algorithm can be applied to systems of nonlinear equations. Finally, some numerical examples are presented and illustrate the efficiency of the present approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=global%20optimization" title="global optimization">global optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=H%C3%B6lder%20functions" title=" Hölder functions"> Hölder functions</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20covering%20method" title=" sequential covering method"> sequential covering method</a>, <a href="https://publications.waset.org/abstracts/search?q=systems%20of%20nonlinear%20equations" title=" systems of nonlinear equations"> systems of nonlinear equations</a> </p> <a href="https://publications.waset.org/abstracts/6507/sequential-covering-algorithm-for-nondifferentiable-global-optimization-problem-and-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6507.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">370</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">9936</span> A Survey of Discrete Facility Location Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Z.%20Ulukan">Z. Ulukan</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Demircio%C4%9Flu"> E. Demircioğlu</a>, <a href="https://publications.waset.org/abstracts/search?q="> </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Facility location is a complex real-world problem which needs a strategic management decision. This paper provides a general review on studies, efforts and developments in Facility Location Problems which are classical optimization problems having a wide-spread applications in various areas such as transportation, distribution, production, supply chain decisions and telecommunication. Our goal is not to review all variants of different studies in FLPs or to describe very detailed computational techniques and solution approaches, but rather to provide a broad overview of major location problems that have been studied, indicating how they are formulated and what are proposed by researchers to tackle the problem. A brief, elucidative table based on a grouping according to “General Problem Type” and “Methods Proposed” used in the studies is also presented at the end of the work. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=discrete%20location%20problems" title="discrete location problems">discrete location problems</a>, <a href="https://publications.waset.org/abstracts/search?q=exact%20methods" title=" exact methods"> exact methods</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic%20algorithms" title=" heuristic algorithms"> heuristic algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=single%20source%20capacitated%20facility%20location%20problems" title=" single source capacitated facility location problems"> single source capacitated facility location problems</a> </p> <a href="https://publications.waset.org/abstracts/32529/a-survey-of-discrete-facility-location-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32529.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">471</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">9935</span> Spin Coherent States Without Squeezing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Dehghani">A. Dehghani</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Shirin"> S. Shirin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose in this article a new configuration of quantum states, |α, β> := |α>×|β>. Which are composed of vector products of two different copies of spin coherent states, |α> and |β>. Some mathematical as well as physical properties of such states are discussed. For instance, it has been shown that the cross products of two coherent vectors remain coherent again. They admit a resolution of the identity through positive definite measures on the complex plane. They represent packets similar to the true coherent states, in other words we would not expect to take spin squeezing in any of the field quadratures Lˆx, Lˆy and Lˆz. Depending on the particular choice of parameters in the above scenarios, they can be converted into the so-called Dicke states which minimize the uncertainty relations of each pair of the angular momentum components. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=vector%20%28Cross-%29products" title="vector (Cross-)products">vector (Cross-)products</a>, <a href="https://publications.waset.org/abstracts/search?q=minimum%20uncertainty" title=" minimum uncertainty"> minimum uncertainty</a>, <a href="https://publications.waset.org/abstracts/search?q=angular%20momentum" title=" angular momentum"> angular momentum</a>, <a href="https://publications.waset.org/abstracts/search?q=measurement" title=" measurement"> measurement</a>, <a href="https://publications.waset.org/abstracts/search?q=Dicke%20states" title=" Dicke states"> Dicke states</a> </p> <a href="https://publications.waset.org/abstracts/30477/spin-coherent-states-without-squeezing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30477.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">412</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9934</span> Multi-Criteria Evaluation for the Selection Process of a Wind Power Plant's Location Using Choquet Integral</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Serhat%20T%C3%BCz%C3%BCn">Serhat Tüzün</a>, <a href="https://publications.waset.org/abstracts/search?q=Tufan%20Demirel"> Tufan Demirel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The objective of the present study is to select the most suitable location for a wind power plant station through Choquet integral method. The problem of selecting the location for a wind power station was considered as a multi-criteria decision-making problem. The essential and sub-criteria were specified and location selection was expressed in a hierarchic structure. Among the main criteria taken into account in this paper are wind potential, technical factors, social factors, transportation, and costs. The problem was solved by using different approaches of Choquet integral and the best location for a wind power station was determined. Then, the priority weights obtained from different Choquet integral approaches are compared and commented on. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-criteria%20decision%20making" title="multi-criteria decision making">multi-criteria decision making</a>, <a href="https://publications.waset.org/abstracts/search?q=choquet%20integral" title=" choquet integral"> choquet integral</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20sets" title=" fuzzy sets"> fuzzy sets</a>, <a href="https://publications.waset.org/abstracts/search?q=location%20of%20a%20wind%20power%20plant" title=" location of a wind power plant"> location of a wind power plant</a> </p> <a href="https://publications.waset.org/abstracts/66874/multi-criteria-evaluation-for-the-selection-process-of-a-wind-power-plants-location-using-choquet-integral" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/66874.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">412</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9933</span> A Robust Optimization Model for the Single-Depot Capacitated Location-Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdolsalam%20Ghaderi">Abdolsalam Ghaderi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve the customers when the parameters may change under different circumstances. This problem has many applications, especially in the area of supply chain management and distribution systems. To get closer to real-world situations, travel time of vehicles, the fixed cost of vehicles usage and customers’ demand are considered as a source of uncertainty. A combined approach including robust optimization and stochastic programming was presented to deal with the uncertainty in the problem at hand. For this purpose, a mixed integer programming model is developed and a heuristic algorithm based on Variable Neighborhood Search(VNS) is presented to solve the model. Finally, the computational results are presented and future research directions are discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=location-routing%20problem" title="location-routing problem">location-routing problem</a>, <a href="https://publications.waset.org/abstracts/search?q=robust%20optimization" title=" robust optimization"> robust optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20programming" title=" stochastic programming"> stochastic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=variable%20neighborhood%20search" title=" variable neighborhood search"> variable neighborhood search</a> </p> <a href="https://publications.waset.org/abstracts/83797/a-robust-optimization-model-for-the-single-depot-capacitated-location-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/83797.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">270</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">9932</span> Evidence Theory Based Emergency Multi-Attribute Group Decision-Making: Application in Facility Location Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bidzina%20Matsaberidze">Bidzina Matsaberidze</a> </p> <p class="card-text"><strong>Abstract:</strong></p> It is known that, in emergency situations, multi-attribute group decision-making (MAGDM) models are characterized by insufficient objective data and a lack of time to respond to the task. Evidence theory is an effective tool for describing such incomplete information in decision-making models when the expert and his knowledge are involved in the estimations of the MAGDM parameters. We consider an emergency decision-making model, where expert assessments on humanitarian aid from distribution centers (HADC) are represented in q-rung ortho-pair fuzzy numbers, and the data structure is described within the data body theory. Based on focal probability construction and experts’ evaluations, an objective function-distribution centers’ selection ranking index is constructed. Our approach for solving the constructed bicriteria partitioning problem consists of two phases. In the first phase, based on the covering’s matrix, we generate a matrix, the columns of which allow us to find all possible partitionings of the HADCs with the service centers. Some constraints are also taken into consideration while generating the matrix. In the second phase, based on the matrix and using our exact algorithm, we find the partitionings -allocations of the HADCs to the centers- which correspond to the Pareto-optimal solutions. For an illustration of the obtained results, a numerical example is given for the facility location-selection problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=emergency%20MAGDM" title="emergency MAGDM">emergency MAGDM</a>, <a href="https://publications.waset.org/abstracts/search?q=q-rung%20orthopair%20fuzzy%20sets" title=" q-rung orthopair fuzzy sets"> q-rung orthopair fuzzy sets</a>, <a href="https://publications.waset.org/abstracts/search?q=evidence%20theory" title=" evidence theory"> evidence theory</a>, <a href="https://publications.waset.org/abstracts/search?q=HADC" title=" HADC"> HADC</a>, <a href="https://publications.waset.org/abstracts/search?q=facility%20location%20problem" title=" facility location problem"> facility location 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=Pareto-optimal%20solutions" title=" Pareto-optimal solutions"> Pareto-optimal solutions</a> </p> <a href="https://publications.waset.org/abstracts/164966/evidence-theory-based-emergency-multi-attribute-group-decision-making-application-in-facility-location-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/164966.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">92</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">9931</span> Temporally Coherent 3D Animation Reconstruction from RGB-D Video Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Salam%20Khalifa">Salam Khalifa</a>, <a href="https://publications.waset.org/abstracts/search?q=Naveed%20Ahmed"> Naveed Ahmed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present a new method to reconstruct a temporally coherent 3D animation from single or multi-view RGB-D video data using unbiased feature point sampling. Given RGB-D video data, in form of a 3D point cloud sequence, our method first extracts feature points using both color and depth information. In the subsequent steps, these feature points are used to match two 3D point clouds in consecutive frames independent of their resolution. Our new motion vectors based dynamic alignment method then fully reconstruct a spatio-temporally coherent 3D animation. We perform extensive quantitative validation using novel error functions to analyze the results. We show that despite the limiting factors of temporal and spatial noise associated to RGB-D data, it is possible to extract temporal coherence to faithfully reconstruct a temporally coherent 3D animation from RGB-D video data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=3D%20video" title="3D video">3D video</a>, <a href="https://publications.waset.org/abstracts/search?q=3D%20animation" title=" 3D animation"> 3D animation</a>, <a href="https://publications.waset.org/abstracts/search?q=RGB-D%20video" title=" RGB-D video"> RGB-D video</a>, <a href="https://publications.waset.org/abstracts/search?q=temporally%20coherent%203D%20animation" title=" temporally coherent 3D animation"> temporally coherent 3D animation</a> </p> <a href="https://publications.waset.org/abstracts/12034/temporally-coherent-3d-animation-reconstruction-from-rgb-d-video-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12034.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> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9930</span> GPS Signal Correction to Improve Vehicle Location during Experimental Campaign</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=L.%20Della%20Ragione">L. Della Ragione</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20Meccariello"> G. Meccariello</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years the progress of the automobile industry in Italy in the field of reduction of emissions values is very remarkable. Nevertheless, their evaluation and reduction is a key problem, especially in the cities, which account for more than 50% of world population. In this paper we dealt with the problem of describing a quantitative approach for the reconstruction of GPS coordinates and altitude, in the context of correlation study between driving cycles / emission / geographical location, during an experimental campaign realized with some instrumented cars. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=air%20pollution" title="air pollution">air pollution</a>, <a href="https://publications.waset.org/abstracts/search?q=driving%20cycles" title=" driving cycles"> driving cycles</a>, <a href="https://publications.waset.org/abstracts/search?q=GPS%20signal" title=" GPS signal"> GPS signal</a>, <a href="https://publications.waset.org/abstracts/search?q=vehicle%20location" title=" vehicle location"> vehicle location</a> </p> <a href="https://publications.waset.org/abstracts/11964/gps-signal-correction-to-improve-vehicle-location-during-experimental-campaign" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/11964.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">428</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9929</span> Analytic Network Process in Location Selection and Its Application to a Real Life Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Eylem%20Ko%C3%A7">Eylem Koç</a>, <a href="https://publications.waset.org/abstracts/search?q=Hasan%20Arda%20Burhan"> Hasan Arda Burhan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Location selection presents a crucial decision problem in today’s business world where strategic decision making processes have critical importance. Thus, location selection has strategic importance for companies in boosting their strength regarding competition, increasing corporate performances and efficiency in addition to lowering production and transportation costs. A right choice in location selection has a direct impact on companies’ commercial success. In this study, a store location selection problem of Carglass Turkey which operates in vehicle glass branch is handled. As this problem includes both tangible and intangible criteria, Analytic Network Process (ANP) was accepted as the main methodology. The model consists of control hierarchy and BOCR subnetworks which include clusters of actors, alternatives and criteria. In accordance with the management’s choices, five different locations were selected. In addition to the literature review, a strict cooperation with the actor group was ensured and maintained while determining the criteria and during whole process. Obtained results were presented to the management as a report and its feasibility was confirmed accordingly. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=analytic%20network%20process%20%28ANP%29" title="analytic network process (ANP)">analytic network process (ANP)</a>, <a href="https://publications.waset.org/abstracts/search?q=BOCR" title=" BOCR"> BOCR</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-actor%20decision%20making" title=" multi-actor decision making"> multi-actor decision making</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-criteria%20decision%20making" title=" multi-criteria decision making"> multi-criteria decision making</a>, <a href="https://publications.waset.org/abstracts/search?q=real-life%20problem" title=" real-life problem"> real-life problem</a>, <a href="https://publications.waset.org/abstracts/search?q=location%20selection" title=" location selection"> location selection</a> </p> <a href="https://publications.waset.org/abstracts/45204/analytic-network-process-in-location-selection-and-its-application-to-a-real-life-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45204.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">470</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">9928</span> Capacitated Multiple Allocation P-Hub Median Problem on a Cluster Based Network under Congestion</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=%C3%87a%C4%9Fr%C4%B1%20%C3%96zg%C3%BCn%20Kibiro%C4%9Flu">Çağrı Özgün Kibiroğlu</a>, <a href="https://publications.waset.org/abstracts/search?q=Zeynep%20Turgut"> Zeynep Turgut</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper considers a hub location problem where the network service area partitioned into predetermined zones (represented by node clusters is given) and potential hub nodes capacity levels are determined a priori as a selection criteria of hub to investigate congestion effect on network. The objective is to design hub network by determining all required hub locations in the node clusters and also allocate non-hub nodes to hubs such that the total cost including transportation cost, opening cost of hubs and penalty cost for exceed of capacity level at hubs is minimized. A mixed integer linear programming model is developed introducing additional constraints to the traditional model of capacitated multiple allocation hub location problem and empirically tested. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hub%20location%20problem" title="hub location problem">hub location problem</a>, <a href="https://publications.waset.org/abstracts/search?q=p-hub%20median%20problem" title=" p-hub median problem"> p-hub median problem</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering" title=" clustering"> clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=congestion" title=" congestion"> congestion</a> </p> <a href="https://publications.waset.org/abstracts/83028/capacitated-multiple-allocation-p-hub-median-problem-on-a-cluster-based-network-under-congestion" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/83028.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">492</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">9927</span> A Metaheuristic for the Layout and Scheduling Problem in a Job Shop Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hern%C3%A1ndez%20Eva%20Selene">Hernández Eva Selene</a>, <a href="https://publications.waset.org/abstracts/search?q=Reyna%20Mary%20Carmen"> Reyna Mary Carmen</a>, <a href="https://publications.waset.org/abstracts/search?q=Rivera%20H%C3%A9ctor"> Rivera Héctor</a>, <a href="https://publications.waset.org/abstracts/search?q=Barrag%C3%A1n%20%20Irving"> Barragán Irving</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose an approach that jointly addresses the layout of a facility and the scheduling of a sequence of jobs. In real production, these two problems are interrelated. However, they are treated separately in the literature. Our approach is an extension of the job shop problem with transportation delay, where the location of the machines is selected among possible sites. The model minimizes the makespan, using the short processing times rule with two algorithms; the first one considers all the permutations for the location of machines, and the second only a heuristic to select some specific permutations that reduces computational time. Some instances are proved and compared with literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=layout%20problem" title="layout problem">layout problem</a>, <a href="https://publications.waset.org/abstracts/search?q=job%20shop%20scheduling%20problem" title=" job shop scheduling problem"> job shop scheduling problem</a>, <a href="https://publications.waset.org/abstracts/search?q=concurrent%20scheduling%20and%20layout%20problem" title=" concurrent scheduling and layout problem"> concurrent scheduling and layout problem</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristic" title=" metaheuristic"> metaheuristic</a> </p> <a href="https://publications.waset.org/abstracts/31639/a-metaheuristic-for-the-layout-and-scheduling-problem-in-a-job-shop-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31639.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">609</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">9926</span> Possibility Theory Based Multi-Attribute Decision-Making: Application in Facility Location-Selection Problem under Uncertain and Extreme Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bezhan%20Ghvaberidze">Bezhan Ghvaberidze</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A fuzzy multi-objective facility location-selection problem (FLSP) under uncertain and extreme environments based on possibility theory is developed. The model’s uncertain parameters in the q-rung orthopair fuzzy values are presented and transformed in the Dempster-Shaper’s belief structure environment. An objective function – distribution centers’ selection ranking index as an extension of Dempster’s extremal expectations under discrimination q-rung orthopair fuzzy information is constructed. Experts evaluate each humanitarian aid from distribution centers (HADC) against each of the uncertain factors. HADCs location problem is reduced to the bicriteria problem of partitioning the set of customers by the set of centers: (1) – Minimization of transportation costs; (2) – Maximization of centers’ selection ranking indexes. Partitioning type constraints are also constructed. For an illustration of the obtained results, a numerical example is created from the facility location-selection problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=FLSP" title="FLSP">FLSP</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=evidence%20theory" title=" evidence theory"> evidence theory</a>, <a href="https://publications.waset.org/abstracts/search?q=HADC" title=" HADC"> HADC</a>, <a href="https://publications.waset.org/abstracts/search?q=q-rung%20orthopair%20fuzzy%20set" title=" q-rung orthopair fuzzy set"> q-rung orthopair fuzzy set</a>, <a href="https://publications.waset.org/abstracts/search?q=possibility%20theory" title=" possibility theory"> possibility theory</a> </p> <a href="https://publications.waset.org/abstracts/161061/possibility-theory-based-multi-attribute-decision-making-application-in-facility-location-selection-problem-under-uncertain-and-extreme-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/161061.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">119</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">9925</span> Optimization of Maritime Platform Transport Problem of Solid, Special and Dangerous Waste</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ocotl%C3%A1n%20D%C3%ADaz-Parra">Ocotlán Díaz-Parra</a>, <a href="https://publications.waset.org/abstracts/search?q=Jorge%20A.%20Ruiz-Vanoye"> Jorge A. Ruiz-Vanoye</a>, <a href="https://publications.waset.org/abstracts/search?q=Alejandro%20Fuentes-Penna"> Alejandro Fuentes-Penna</a>, <a href="https://publications.waset.org/abstracts/search?q=Beatriz%20Bernabe-Loranca"> Beatriz Bernabe-Loranca</a>, <a href="https://publications.waset.org/abstracts/search?q=Patricia%20Ambrocio-Cruz"> Patricia Ambrocio-Cruz</a>, <a href="https://publications.waset.org/abstracts/search?q=Jos%C3%A9%20J.%20Hern%C3%A1ndez-Flores"> José J. Hernández-Flores</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Maritime Platform Transport Problem of Solid, Special and Dangerous Waste consist of to minimize the monetary value of carry different types of waste from one location to another location using ships. We offer a novel mathematical, the characterization of the problem and the use CPLEX to find the optimal values to solve the Solid, Special and Hazardous Waste Transportation Problem of offshore platforms instances of Mexican state-owned petroleum company (PEMEX). The set of instances used are WTPLib real instances and the tool CPLEX solver to solve the MPTPSSDW problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=oil%20platform" title="oil platform">oil platform</a>, <a href="https://publications.waset.org/abstracts/search?q=transport%20problem" title=" transport problem"> transport problem</a>, <a href="https://publications.waset.org/abstracts/search?q=waste" title=" waste"> waste</a>, <a href="https://publications.waset.org/abstracts/search?q=solid%20waste" title=" solid waste"> solid waste</a> </p> <a href="https://publications.waset.org/abstracts/42738/optimization-of-maritime-platform-transport-problem-of-solid-special-and-dangerous-waste" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42738.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">472</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">9924</span> Developing Location-allocation Models in the Three Echelon Supply Chain </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mehdi%20Seifbarghy">Mehdi Seifbarghy</a>, <a href="https://publications.waset.org/abstracts/search?q=Zahra%20Mansouri"> Zahra Mansouri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper a few location-allocation models are developed in a multi-echelon supply chain including suppliers, manufacturers, distributors and retailers. The objectives are maximizing demand coverage, minimizing the total distance of distributors from suppliers, minimizing some facility establishment costs and minimizing the environmental effects. Since nature of the given models is multi-objective, we suggest a number of goal-based solution techniques such L-P metric, goal programming, multi-choice goal programming and goal attainment in order to solve the problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=location" title="location">location</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-echelon%20supply%20chain" title=" multi-echelon supply chain"> multi-echelon supply chain</a>, <a href="https://publications.waset.org/abstracts/search?q=covering" title=" covering"> covering</a>, <a href="https://publications.waset.org/abstracts/search?q=goal%20programming" title=" goal programming"> goal programming</a> </p> <a href="https://publications.waset.org/abstracts/31376/developing-location-allocation-models-in-the-three-echelon-supply-chain" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31376.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">559</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">9923</span> Tsada-MobiMinder: A Location Based Alarm Mobile Reminder</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Marylene%20S.%20Eder">Marylene S. Eder</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Existing location based alarm applications has inability to give information to user’s particular direction to a specified place of destination and does not display a particular scenic spot from its current location going to the destination. With this problem, a location based alarm mobile reminder was developed. The application is implemented on Android based smart phones to provide services like providing routing information, helping to find nearby hotels, restaurants and scenic spots and offer many advantages to the mobile users to retrieve the information about their current location and process that data to get more useful information near to their location. It reminds the user about the location when the user enters some predefined location. All the user needs to have is the mobile phone with android platform with version 4.0 and above, and then the user can select the destination and find the destination on the application. The main objective of the project is to develop a location based application that provides tourists with real time information for scenic spots and provides alarm to a specified place of destination. This mobile application service will act as assistance for the frequent travelers to visit new places around the City. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=location%20based%20alarm" title="location based alarm">location based alarm</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20application" title=" mobile application"> mobile application</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20reminder" title=" mobile reminder"> mobile reminder</a>, <a href="https://publications.waset.org/abstracts/search?q=tourist%E2%80%99s%20spots" title=" tourist’s spots"> tourist’s spots</a> </p> <a href="https://publications.waset.org/abstracts/37282/tsada-mobiminder-a-location-based-alarm-mobile-reminder" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37282.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">382</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">9922</span> Long Wavelength Coherent Pulse of Sound Propagating in Granular Media</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rohit%20Kumar%20Shrivastava">Rohit Kumar Shrivastava</a>, <a href="https://publications.waset.org/abstracts/search?q=Amalia%20Thomas"> Amalia Thomas</a>, <a href="https://publications.waset.org/abstracts/search?q=Nathalie%20Vriend"> Nathalie Vriend</a>, <a href="https://publications.waset.org/abstracts/search?q=Stefan%20Luding"> Stefan Luding</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A mechanical wave or vibration propagating through granular media exhibits a specific signature in time. A coherent pulse or wavefront arrives first with multiply scattered waves (coda) arriving later. The coherent pulse is micro-structure independent i.e. it depends only on the bulk properties of the disordered granular sample, the sound wave velocity of the granular sample and hence bulk and shear moduli. The coherent wavefront attenuates (decreases in amplitude) and broadens with distance from its source. The pulse attenuation and broadening effects are affected by disorder (polydispersity; contrast in size of the granules) and have often been attributed to dispersion and scattering. To study the effect of disorder and initial amplitude (non-linearity) of the pulse imparted to the system on the coherent wavefront, numerical simulations have been carried out on one-dimensional sets of particles (granular chains). The interaction force between the particles is given by a Hertzian contact model. The sizes of particles have been selected randomly from a Gaussian distribution, where the standard deviation of this distribution is the relevant parameter that quantifies the effect of disorder on the coherent wavefront. Since, the coherent wavefront is system configuration independent, ensemble averaging has been used for improving the signal quality of the coherent pulse and removing the multiply scattered waves. The results concerning the width of the coherent wavefront have been formulated in terms of scaling laws. An experimental set-up of photoelastic particles constituting a granular chain is proposed to validate the numerical results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=discrete%20elements" title="discrete elements">discrete elements</a>, <a href="https://publications.waset.org/abstracts/search?q=Hertzian%20contact" title=" Hertzian contact"> Hertzian contact</a>, <a href="https://publications.waset.org/abstracts/search?q=polydispersity" title=" polydispersity"> polydispersity</a>, <a href="https://publications.waset.org/abstracts/search?q=weakly%20nonlinear" title=" weakly nonlinear"> weakly nonlinear</a>, <a href="https://publications.waset.org/abstracts/search?q=wave%20propagation" title=" wave propagation"> wave propagation</a> </p> <a href="https://publications.waset.org/abstracts/73014/long-wavelength-coherent-pulse-of-sound-propagating-in-granular-media" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/73014.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">204</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">9921</span> The Continuous Facility Location Problem and Transportation Mode Selection in the Supply Chain under Sustainability</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdulaziz%20Alageel">Abdulaziz Alageel</a>, <a href="https://publications.waset.org/abstracts/search?q=Martino%20Luis"> Martino Luis</a>, <a href="https://publications.waset.org/abstracts/search?q=Shuya%20Zhong"> Shuya Zhong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The main focus of this research study is on the challenges faced in decision-making in a supply chain network regarding the facility location while considering carbon emissions. The study aims (i) to locate facilities (i.e., distribution centeres) in a continuous space considering limitations of capacity and the costs associated with opening and (ii) to reduce the cost of carbon emissions by selecting the mode of transportation. The problem is formulated as mixed-integer linear programming. This study hybridised a greedy randomised adaptive search (GRASP) and variable neighborhood search (VNS) to deal with the problem. Well-known datasets from the literature (Brimberg et al. 2001) are used and adapted in order to assess the performance of the proposed method. The proposed hybrid method produces encouraging results based on computational analysis. The study also highlights some research avenues for future recommendations. <p class="card-text"><strong>Keywords:</strong> <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=facility%20location" title=" facility location"> facility location</a>, <a href="https://publications.waset.org/abstracts/search?q=weber%20problem" title=" weber problem"> weber problem</a>, <a href="https://publications.waset.org/abstracts/search?q=sustainability" title=" sustainability"> sustainability</a> </p> <a href="https://publications.waset.org/abstracts/160994/the-continuous-facility-location-problem-and-transportation-mode-selection-in-the-supply-chain-under-sustainability" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/160994.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">100</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">9920</span> Extension of a Competitive Location Model Considering a Given Number of Servers and Proposing a Heuristic for Solving</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mehdi%20Seifbarghy">Mehdi Seifbarghy</a>, <a href="https://publications.waset.org/abstracts/search?q=Zahra%20Nasiri"> Zahra Nasiri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Competitive location problem deals with locating new facilities to provide a service (or goods) to the customers of a given geographical area where other facilities (competitors) offering the same service are already present. The new facilities will have to compete with the existing facilities for capturing the market share. This paper proposes a new model to maximize the market share in which customers choose the facilities based on traveling time, waiting time and attractiveness. The attractiveness of a facility is considered as a parameter in the model. A heuristic is proposed to solve the problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=competitive%20location" title="competitive location">competitive location</a>, <a href="https://publications.waset.org/abstracts/search?q=market%20share" title=" market share"> market share</a>, <a href="https://publications.waset.org/abstracts/search?q=facility%20attractiveness" title=" facility attractiveness"> facility attractiveness</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic" title=" heuristic"> heuristic</a> </p> <a href="https://publications.waset.org/abstracts/31377/extension-of-a-competitive-location-model-considering-a-given-number-of-servers-and-proposing-a-heuristic-for-solving" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31377.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">524</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">9919</span> On the Study of All Waterloo Automaton Semilattices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mikhail%20Abramyan">Mikhail Abramyan</a>, <a href="https://publications.waset.org/abstracts/search?q=Boris%20Melnikov"> Boris Melnikov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim is to study the set of subsets of grids of the Waterloo automaton and the set of covering automata defined by the grid subsets. The study was carried out using the library for working with nondeterministic finite automata NFALib implemented by one of the authors (M. Abramyan) in C#. The results are regularities obtained when considering semilattices of covering automata for the Waterloo automaton. A complete description of the obtained semilattices from the point of view of equivalence of the covering automata to the original Waterloo automaton is given, the criterion of equivalence of the covering automaton to the Waterloo automaton in terms of properties of the subset of grids defining the covering automaton is formulated. The relevance of the subject area under consideration is due to the need to research a set of regular languages and, in particular, a description of their various subclasses. Also relevant are the problems that may arise in some subclasses. This will give, among other things, the possibility of describing new algorithms for the equivalent transformation of nondeterministic finite automata. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=nondeterministic%20finite%20automata" title="nondeterministic finite automata">nondeterministic finite automata</a>, <a href="https://publications.waset.org/abstracts/search?q=universal%20automaton" title=" universal automaton"> universal automaton</a>, <a href="https://publications.waset.org/abstracts/search?q=grid" title=" grid"> grid</a>, <a href="https://publications.waset.org/abstracts/search?q=covering%20automaton" title=" covering automaton"> covering automaton</a>, <a href="https://publications.waset.org/abstracts/search?q=equivalent%20transformation%20algorithms" title=" equivalent transformation algorithms"> equivalent transformation algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=the%20Waterloo%20automaton" title=" the Waterloo automaton"> the Waterloo automaton</a> </p> <a href="https://publications.waset.org/abstracts/172838/on-the-study-of-all-waterloo-automaton-semilattices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/172838.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">87</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">9918</span> Localization Problem in Optical Fiber Sensors</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Zyczkowski">M. Zyczkowski</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20Markowski"> P. Markowski</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Karol"> M. Karol</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The security industry is making many efforts to lower the costs of system installation. However, the dominant technique is the application of fiber optic sensors. It is necessary to determine the location of the disorder of long optical fiber cables. For a number of years, many research centers developed their own solutions. The article presents the construction of the sensor systems with the possibility of disorder location. We present a methodology for determining location of the disorder. The aim of investigations is to answer the question of which of optical sensor configuration offer the best performance for location of the disorder. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fiber%20optic%20sensor" title="fiber optic sensor">fiber optic sensor</a>, <a href="https://publications.waset.org/abstracts/search?q=security%20sensor" title=" security sensor"> security sensor</a>, <a href="https://publications.waset.org/abstracts/search?q=fiber%20cables" title=" fiber cables"> fiber cables</a>, <a href="https://publications.waset.org/abstracts/search?q=system%20instillation" title=" system instillation"> system instillation</a> </p> <a href="https://publications.waset.org/abstracts/9236/localization-problem-in-optical-fiber-sensors" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9236.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">636</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">9917</span> An Exact Algorithm for Location–Transportation Problems in Humanitarian Relief</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chansiri%20Singhtaun">Chansiri Singhtaun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a mathematical model and examines the performance of an exact algorithm for a location–transportation problems in humanitarian relief. The model determines the number and location of distribution centers in a relief network, the amount of relief supplies to be stocked at each distribution center and the vehicles to take the supplies to meet the needs of disaster victims under capacity restriction, transportation and budgetary constraints. The computational experiments are conducted on the various sizes of problems that are generated. Branch and bound algorithm is applied for these problems. The results show that this algorithm can solve problem sizes of up to three candidate locations with five demand points and one candidate location with up to twenty demand points without premature termination. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=disaster%20response" title="disaster response">disaster response</a>, <a href="https://publications.waset.org/abstracts/search?q=facility%20location" title=" facility location"> facility location</a>, <a href="https://publications.waset.org/abstracts/search?q=humanitarian%20relief" title=" humanitarian relief"> humanitarian relief</a>, <a href="https://publications.waset.org/abstracts/search?q=transportation" title=" transportation "> transportation </a> </p> <a href="https://publications.waset.org/abstracts/18925/an-exact-algorithm-for-location-transportation-problems-in-humanitarian-relief" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18925.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">451</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">9916</span> Unsupervised Learning of Spatiotemporally Coherent Metrics</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ross%20Goroshin">Ross Goroshin</a>, <a href="https://publications.waset.org/abstracts/search?q=Joan%20Bruna"> Joan Bruna</a>, <a href="https://publications.waset.org/abstracts/search?q=Jonathan%20Tompson"> Jonathan Tompson</a>, <a href="https://publications.waset.org/abstracts/search?q=David%20Eigen"> David Eigen</a>, <a href="https://publications.waset.org/abstracts/search?q=Yann%20LeCun"> Yann LeCun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Current state-of-the-art classification and detection algorithms rely on supervised training. In this work we study unsupervised feature learning in the context of temporally coherent video data. We focus on feature learning from unlabeled video data, using the assumption that adjacent video frames contain semantically similar information. This assumption is exploited to train a convolutional pooling auto-encoder regularized by slowness and sparsity. We establish a connection between slow feature learning to metric learning and show that the trained encoder can be used to define a more temporally and semantically coherent metric. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=machine%20learning" title="machine learning">machine learning</a>, <a href="https://publications.waset.org/abstracts/search?q=pattern%20clustering" title=" pattern clustering"> pattern clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=pooling" title=" pooling"> pooling</a>, <a href="https://publications.waset.org/abstracts/search?q=classification" title=" classification "> classification </a> </p> <a href="https://publications.waset.org/abstracts/29488/unsupervised-learning-of-spatiotemporally-coherent-metrics" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29488.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">456</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">9915</span> Impact of Facility Disruptions on Demand Allocation Strategies in Reliable Facility Location Models</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdulrahman%20R.%20Alenezi">Abdulrahman R. Alenezi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research investigates the effects of facility disruptions on-demand allocation within the context of the Reliable Facility Location Problem (RFLP). We explore two distinct scenarios: one where primary and backup facilities can fail simultaneously and another where such simultaneous failures are not possible. The RFLP model is tailored to reflect these scenarios, incorporating different approaches to transportation cost calculations. Utilizing a Lagrange relaxation method, the model achieves high efficiency, yielding an average optimality gap of 0.1% within 12.2 seconds of CPU time. Findings indicate that primary facilities are typically sited closer to demand points than backup facilities. In cases where simultaneous failures are prohibited, demand points are predominantly assigned to the nearest available facility. Conversely, in scenarios permitting simultaneous failures, demand allocation may prioritize factors beyond mere proximity, such as failure rates. This study highlights the critical influence of facility reliability on strategic location decisions, providing insights for enhancing resilience in supply chain networks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=reliable%20supply%20chain%20network" title="reliable supply chain network">reliable supply chain network</a>, <a href="https://publications.waset.org/abstracts/search?q=facility%20location%20problem" title=" facility location problem"> facility location problem</a>, <a href="https://publications.waset.org/abstracts/search?q=reliable%20facility%20location%20model" title=" reliable facility location model"> reliable facility location model</a>, <a href="https://publications.waset.org/abstracts/search?q=LaGrange%20relaxation" title=" LaGrange relaxation"> LaGrange relaxation</a> </p> <a href="https://publications.waset.org/abstracts/192189/impact-of-facility-disruptions-on-demand-allocation-strategies-in-reliable-facility-location-models" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/192189.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">26</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">9914</span> Manufacturing Facility Location Selection: A Numercal Taxonomy Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seifoddini%20Hamid">Seifoddini Hamid</a>, <a href="https://publications.waset.org/abstracts/search?q=Mardikoraeem%20Mahsa"> Mardikoraeem Mahsa</a>, <a href="https://publications.waset.org/abstracts/search?q=Ghorayshi%20Roya"> Ghorayshi Roya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Manufacturing facility location selection is an important strategic decision for many industrial corporations. In this paper, a new approach to the manufacturing location selection problem is proposed. In this approach, cluster analysis is employed to identify suitable manufacturing locations based on economic, social, environmental, and political factors. These factors are quantified using the existing real world data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=manufacturing%20facility" title="manufacturing facility">manufacturing facility</a>, <a href="https://publications.waset.org/abstracts/search?q=manufacturing%20sites" title=" manufacturing sites"> manufacturing sites</a>, <a href="https://publications.waset.org/abstracts/search?q=real%20world%20data" title=" real world data"> real world data</a> </p> <a href="https://publications.waset.org/abstracts/25361/manufacturing-facility-location-selection-a-numercal-taxonomy-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25361.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">563</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=coherent%20covering%20location%20problem&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=coherent%20covering%20location%20problem&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=coherent%20covering%20location%20problem&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=coherent%20covering%20location%20problem&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=coherent%20covering%20location%20problem&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=coherent%20covering%20location%20problem&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=coherent%20covering%20location%20problem&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=coherent%20covering%20location%20problem&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=coherent%20covering%20location%20problem&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=coherent%20covering%20location%20problem&page=331">331</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=coherent%20covering%20location%20problem&page=332">332</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=coherent%20covering%20location%20problem&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>