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: uncertain transportation problem</title> <meta name="description" content="Search results for: uncertain transportation problem"> <meta name="keywords" content="uncertain transportation 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="uncertain transportation 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="uncertain transportation 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> 8701</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: uncertain transportation problem</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8701</span> A Method for Solving a Bi-Objective Transportation Problem under Fuzzy Environment </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sukhveer%20Singh">Sukhveer Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Sandeep%20Singh"> Sandeep Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A bi-objective fuzzy transportation problem with the objectives to minimize the total fuzzy cost and fuzzy time of transportation without according priorities to them is considered. To the best of our knowledge, there is no method in the literature to find efficient solutions of the bi-objective transportation problem under uncertainty. In this paper, a bi-objective transportation problem in an uncertain environment has been formulated. An algorithm has been proposed to find efficient solutions of the bi-objective transportation problem under uncertainty. The proposed algorithm avoids the degeneracy and gives the optimal solution faster than other existing algorithms for the given uncertain transportation problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=uncertain%20transportation%20problem" title="uncertain transportation problem">uncertain transportation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=efficient%20solution" title=" efficient solution"> efficient solution</a>, <a href="https://publications.waset.org/abstracts/search?q=ranking%20function" title=" ranking function"> ranking function</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20transportation%20problem" title=" fuzzy transportation problem"> fuzzy transportation problem</a> </p> <a href="https://publications.waset.org/abstracts/73312/a-method-for-solving-a-bi-objective-transportation-problem-under-fuzzy-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/73312.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">525</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8700</span> A Model for Solid Transportation Problem with Three Hierarchical Objectives under Uncertain Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wajahat%20Ali">Wajahat Ali</a>, <a href="https://publications.waset.org/abstracts/search?q=Shakeel%20Javaid"> Shakeel Javaid</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, we have developed a mathematical programming model for a solid transportation problem with three objective functions arranged in hierarchical order. The mathematical programming models with more than one objective function to be solved in hierarchical order is termed as a multi-level programming model. Our study explores a Multi-Level Solid Transportation Problem with Uncertain Parameters (MLSTPWU). The proposed MLSTPWU model consists of three objective functions, viz. minimization of transportation cost, minimization of total transportation time, and minimization of deterioration during transportation. These three objective functions are supposed to be solved by decision-makers at three consecutive levels. Three constraint functions are added to the model, restricting the total availability, total demand, and capacity of modes of transportation. All the parameters involved in the model are assumed to be uncertain in nature. A solution method based on fuzzy logic is also discussed to obtain the compromise solution for the proposed model. Further, a simulated numerical example is discussed to establish the efficiency and applicability of the proposed model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=solid%20transportation%20problem" title="solid transportation problem">solid transportation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-level%20programming" title=" multi-level programming"> multi-level programming</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertain%20variable" title=" uncertain variable"> uncertain variable</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertain%20environment" title=" uncertain environment"> uncertain environment</a> </p> <a href="https://publications.waset.org/abstracts/162056/a-model-for-solid-transportation-problem-with-three-hierarchical-objectives-under-uncertain-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/162056.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">83</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">8699</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">8698</span> Solving the Transportation Problem for Warehouses and Dealers in Bangalore City</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Aditya">S. Aditya</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20T.%20Nideesh"> K. T. Nideesh</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Guruprasad"> N. Guruprasad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Being a subclass of linear programing problem, the Transportation Problem is a classic Operations Research problem where the objective is to determine the schedule for transporting goods from source to destination in a way that minimizes the shipping cost while satisfying supply and demand constraints. In this paper, we are representing the transportation problem for various warehouses along with various dealers situated in Bangalore city to reduce the transportation cost incurred by them as of now. The problem is solved by obtaining the Initial Basic feasible Solution through various methods and further proceeding to obtain optimal cost. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=NW%20method" title="NW method">NW method</a>, <a href="https://publications.waset.org/abstracts/search?q=optimum%20utilization" title=" optimum utilization"> optimum utilization</a>, <a href="https://publications.waset.org/abstracts/search?q=transportation%20problem" title=" transportation problem"> transportation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=Vogel%E2%80%99s%20approximation%20method" title=" Vogel’s approximation method"> Vogel’s approximation method</a> </p> <a href="https://publications.waset.org/abstracts/19160/solving-the-transportation-problem-for-warehouses-and-dealers-in-bangalore-city" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19160.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">437</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">8697</span> Interactive Solutions for the Multi-Objective Capacitated Transportation Problem with Mixed Constraints under Fuzziness</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aquil%20Ahmed">Aquil Ahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=Srikant%20Gupta"> Srikant Gupta</a>, <a href="https://publications.waset.org/abstracts/search?q=Irfan%20Ali"> Irfan Ali</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we study a multi-objective capacitated transportation problem (MOCTP) with mixed constraints. This paper is comprised of the modelling and optimisation of an MOCTP in a fuzzy environment in which some goals are fractional and some are linear. In real life application of the fuzzy goal programming (FGP) problem with multiple objectives, it is difficult for the decision maker(s) to determine the goal value of each objective precisely as the goal values are imprecise or uncertain. Also, we developed the concept of linearization of fractional goal for solving the MOCTP. In this paper, imprecision of the parameter is handled by the concept of fuzzy set theory by considering these parameters as a trapezoidal fuzzy number. α-cut approach is used to get the crisp value of the parameters. Numerical examples are used to illustrate the method for solving MOCTP. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=capacitated%20transportation%20problem" title="capacitated transportation problem">capacitated transportation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=multi%20objective%20linear%20programming" title=" multi objective linear programming"> multi objective linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20fractional%20programming" title=" multi-objective fractional programming"> multi-objective fractional programming</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20goal%20programming" title=" fuzzy goal programming"> fuzzy goal programming</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=trapezoidal%20fuzzy%20number" title=" trapezoidal fuzzy number"> trapezoidal fuzzy number</a> </p> <a href="https://publications.waset.org/abstracts/77380/interactive-solutions-for-the-multi-objective-capacitated-transportation-problem-with-mixed-constraints-under-fuzziness" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/77380.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">434</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">8696</span> An Improved Approach to Solve Two-Level Hierarchical Time Minimization Transportation Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kalpana%20Dahiya">Kalpana Dahiya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper discusses a two-level hierarchical time minimization transportation problem, which is an important class of transportation problems arising in industries. This problem has been studied by various researchers, and a number of polynomial time iterative algorithms are available to find its solution. All the existing algorithms, though efficient, have some shortcomings. The current study proposes an alternate solution algorithm for the problem that is more efficient in terms of computational time than the existing algorithms. The results justifying the underlying theory of the proposed algorithm are given. Further, a detailed comparison of the computational behaviour of all the algorithms for randomly generated instances of this problem of different sizes validates the efficiency of the proposed algorithm. <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=hierarchical%20optimization" title=" hierarchical optimization"> hierarchical optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=transportation%20problem" title=" transportation problem"> transportation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=concave%20minimization" title=" concave minimization"> concave minimization</a> </p> <a href="https://publications.waset.org/abstracts/122713/an-improved-approach-to-solve-two-level-hierarchical-time-minimization-transportation-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/122713.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">162</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">8695</span> Solutions of Fuzzy Transportation Problem Using Best Candidates Method and Different Ranking Techniques</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20S.%20Annie%20Christi">M. S. Annie Christi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Transportation Problem (TP) is based on supply and demand of commodities transported from one source to the different destinations. Usual methods for finding solution of TPs are North-West Corner Rule, Least Cost Method Vogel’s Approximation Method etc. The transportation costs tend to vary at each time. We can use fuzzy numbers which would give solution according to this situation. In this study the Best Candidate Method (BCM) is applied. For ranking Centroid Ranking Technique (CRT) and Robust Ranking Technique have been adopted to transform the fuzzy TP and the above methods are applied to EDWARDS Vacuum Company, Crawley, in West Sussex in the United Kingdom. A Comparative study is also given<strong>.</strong> We see that the transportation cost can be minimized by the application of CRT under BCM. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=best%20candidate%20method" title="best candidate method">best candidate method</a>, <a href="https://publications.waset.org/abstracts/search?q=centroid%20ranking%20technique" title=" centroid ranking technique"> centroid ranking technique</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20transportation%20problem" title=" fuzzy transportation problem"> fuzzy transportation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=robust%20ranking%20technique" title=" robust ranking technique"> robust ranking technique</a>, <a href="https://publications.waset.org/abstracts/search?q=transportation%20problem" title=" transportation problem"> transportation problem</a> </p> <a href="https://publications.waset.org/abstracts/60506/solutions-of-fuzzy-transportation-problem-using-best-candidates-method-and-different-ranking-techniques" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/60506.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">294</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">8694</span> Consideration of Uncertainty in Engineering</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Mohammadi">A. Mohammadi</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Moghimi"> M. Moghimi</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Mohammadi"> S. Mohammadi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Engineers need computational methods which could provide solutions less sensitive to the environmental effects, so the techniques should be used which take the uncertainty to account to control and minimize the risk associated with design and operation. In order to consider uncertainty in engineering problem, the optimization problem should be solved for a suitable range of the each uncertain input variable instead of just one estimated point. Using deterministic optimization problem, a large computational burden is required to consider every possible and probable combination of uncertain input variables. Several methods have been reported in the literature to deal with problems under uncertainty. In this paper, different methods presented and analyzed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=uncertainty" title="uncertainty">uncertainty</a>, <a href="https://publications.waset.org/abstracts/search?q=Monte%20Carlo%20simulated" title=" Monte Carlo simulated"> Monte Carlo simulated</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=scenario%20method" title=" scenario method"> scenario method</a> </p> <a href="https://publications.waset.org/abstracts/7164/consideration-of-uncertainty-in-engineering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7164.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">414</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">8693</span> Selecting Skyline Mash-Ups under Uncertainty</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aymen%20Gammoudi">Aymen Gammoudi</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamza%20Labbaci"> Hamza Labbaci</a>, <a href="https://publications.waset.org/abstracts/search?q=Nizar%20Messai"> Nizar Messai</a>, <a href="https://publications.waset.org/abstracts/search?q=Yacine%20Sam"> Yacine Sam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Web Service Composition (Mash-up) has been considered as a new approach used to offer the user a set of Web Services responding to his request. These approaches can return a set of similar Mash-ups in a given context that makes users unable to select the perfect one. Recent approaches focus on computing the skyline over a set of Quality of Service (QoS) attributes. However, these approaches are not sufficient in a dynamic web service environment where the delivered QoS by a Web service is inherently uncertain. In this paper, we treat the problem of computing the skyline over a set of similar Mash-ups under certain dimension values. We generate dimensions for each Mash-up using aggregation operations applied to the QoS attributes. We then tackle the problem of computing the skyline under uncertain dimensions. We present each dimension value of mash-up using a frame of discernment and introduce the d-dominance using the Evidence Theory. Finally, we propose our experimental results that show both the effectiveness of the introduced skyline extensions and the efficiency of the proposed approaches. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=web%20services" title="web services">web services</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertain%20QoS" title=" uncertain QoS"> uncertain QoS</a>, <a href="https://publications.waset.org/abstracts/search?q=mash-ups" title=" mash-ups"> mash-ups</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertain%20%20dimensions" title=" uncertain dimensions"> uncertain dimensions</a>, <a href="https://publications.waset.org/abstracts/search?q=skyline" title=" skyline"> skyline</a>, <a href="https://publications.waset.org/abstracts/search?q=evidence%20%20theory" title=" evidence theory"> evidence theory</a>, <a href="https://publications.waset.org/abstracts/search?q=d-dominance" title=" d-dominance"> d-dominance</a> </p> <a href="https://publications.waset.org/abstracts/137195/selecting-skyline-mash-ups-under-uncertainty" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/137195.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">234</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">8692</span> An Approach to the Assembly Line Balancing Problem with Uncertain Operation Time</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zhongmin%20Wang">Zhongmin Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Lin%20Wei"> Lin Wei</a>, <a href="https://publications.waset.org/abstracts/search?q=Hengshan%20Zhang"> Hengshan Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Tianhua%20Chen"> Tianhua Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Yimin%20Zhou"> Yimin Zhou</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The assembly line balancing problems are signficant in mass production systems. In order to deal with the uncertainties that practically exist but barely mentioned in the literature, this paper develops a mathematic model with an optimisation algorithm to solve the assembly line balancing problem with uncertainty operation time. The developed model is able to work with a variable number of workstations under the uncertain environment, aiming to obtain the minimal number of workstation and minimal idle time for each workstation. In particular, the proposed approach first introduces the concept of protection time that closely works with the uncertain operation time. Four dominance rules and the mechanism of determining up and low bounds are subsequently put forward, which serve as the basis for the proposed branch and bound algorithm. Experimental results show that the proposed work verified on a benchmark data set is able to solve the uncertainties efficiently. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=assembly%20lines" title="assembly lines">assembly lines</a>, <a href="https://publications.waset.org/abstracts/search?q=SALBP-UOT" title=" SALBP-UOT"> SALBP-UOT</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertain%20operation%20time" title="uncertain operation time">uncertain operation time</a>, <a href="https://publications.waset.org/abstracts/search?q=branch%20and%20bound%20algorithm." title=" branch and bound algorithm."> branch and bound algorithm.</a> </p> <a href="https://publications.waset.org/abstracts/108751/an-approach-to-the-assembly-line-balancing-problem-with-uncertain-operation-time" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/108751.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">171</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">8691</span> Representation Data without Lost Compression Properties in Time Series: A Review</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nabilah%20Filzah%20Mohd%20Radzuan">Nabilah Filzah Mohd Radzuan</a>, <a href="https://publications.waset.org/abstracts/search?q=Zalinda%20Othman"> Zalinda Othman</a>, <a href="https://publications.waset.org/abstracts/search?q=Azuraliza%20Abu%20Bakar"> Azuraliza Abu Bakar</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdul%20Razak%20Hamdan"> Abdul Razak Hamdan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Uncertain data is believed to be an important issue in building up a prediction model. The main objective in the time series uncertainty analysis is to formulate uncertain data in order to gain knowledge and fit low dimensional model prior to a prediction task. This paper discusses the performance of a number of techniques in dealing with uncertain data specifically those which solve uncertain data condition by minimizing the loss of compression properties. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=compression%20properties" title="compression properties">compression properties</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertainty" title=" uncertainty"> uncertainty</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertain%20time%20series" title=" uncertain time series"> uncertain time series</a>, <a href="https://publications.waset.org/abstracts/search?q=mining%20technique" title=" mining technique"> mining technique</a>, <a href="https://publications.waset.org/abstracts/search?q=weather%20prediction" title=" weather prediction"> weather prediction</a> </p> <a href="https://publications.waset.org/abstracts/1419/representation-data-without-lost-compression-properties-in-time-series-a-review" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1419.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">8690</span> A Fuzzy Kernel K-Medoids Algorithm for Clustering Uncertain Data Objects</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Behnam%20Tavakkol">Behnam Tavakkol</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Uncertain data mining algorithms use different ways to consider uncertainty in data such as by representing a data object as a sample of points or a probability distribution. Fuzzy methods have long been used for clustering traditional (certain) data objects. They are used to produce non-crisp cluster labels. For uncertain data, however, besides some uncertain fuzzy k-medoids algorithms, not many other fuzzy clustering methods have been developed. In this work, we develop a fuzzy kernel k-medoids algorithm for clustering uncertain data objects. The developed fuzzy kernel k-medoids algorithm is superior to existing fuzzy k-medoids algorithms in clustering data sets with non-linearly separable clusters. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=clustering%20algorithm" title="clustering algorithm">clustering algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20methods" title=" fuzzy methods"> fuzzy methods</a>, <a href="https://publications.waset.org/abstracts/search?q=kernel%20k-medoids" title=" kernel k-medoids"> kernel k-medoids</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertain%20data" title=" uncertain data"> uncertain data</a> </p> <a href="https://publications.waset.org/abstracts/123501/a-fuzzy-kernel-k-medoids-algorithm-for-clustering-uncertain-data-objects" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/123501.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">215</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">8689</span> Multi-Period Supply Chain Design under Uncertainty</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amir%20Azaron">Amir Azaron</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this research, a stochastic programming approach is developed for designing supply chains with uncertain parameters. Demands and selling prices of products at markets are considered as the uncertain parameters. The proposed mathematical model will be multi-period two-stage stochastic programming, which takes into account the selection of retailer sites, suppliers, production levels, inventory levels, transportation modes to be used for shipping goods, and shipping quantities among the entities of the supply chain network. The objective function is to maximize the chain’s net present value. In order to maximize the chain’s NPV, the sum of first-stage investment costs on retailers, and the expected second-stage processing, inventory-holding and transportation costs should be kept as low as possible over multiple periods. The effects of supply uncertainty where suppliers are unreliable will also be investigated on the efficiency of the supply chain. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=supply%20chain%20management" title="supply chain management">supply chain management</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=multiobjective%20programming" title=" multiobjective programming"> multiobjective programming</a>, <a href="https://publications.waset.org/abstracts/search?q=inventory%20control" title=" inventory control"> inventory control</a> </p> <a href="https://publications.waset.org/abstracts/66297/multi-period-supply-chain-design-under-uncertainty" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/66297.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">295</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">8688</span> Continuous Adaptive Robust Control for Non-Linear Uncertain Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dong%20Sang%20Yoo">Dong Sang Yoo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We consider nonlinear uncertain systems such that a priori information of the uncertainties is not available. For such systems, we assume that the upper bound of the uncertainties is represented as a Fredholm integral equation of the first kind and we propose an adaptation law that is capable of estimating the upper bound and design a continuous robust control which renders nonlinear uncertain systems ultimately bounded. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20control" title="adaptive control">adaptive control</a>, <a href="https://publications.waset.org/abstracts/search?q=estimation" title=" estimation"> estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=Fredholm%20integral" title=" Fredholm integral"> Fredholm integral</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertain%20system" title=" uncertain system"> uncertain system</a> </p> <a href="https://publications.waset.org/abstracts/2581/continuous-adaptive-robust-control-for-non-linear-uncertain-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2581.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">8687</span> A Hybrid Algorithm for Collaborative Transportation Planning among Carriers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Elham%20Jelodari%20Mamaghani">Elham Jelodari Mamaghani</a>, <a href="https://publications.waset.org/abstracts/search?q=Christian%20Prins"> Christian Prins</a>, <a href="https://publications.waset.org/abstracts/search?q=Haoxun%20Chen"> Haoxun Chen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, there is concentration on collaborative transportation planning (CTP) among multiple carriers with pickup and delivery requests and time windows. This problem is a vehicle routing problem with constraints from standard vehicle routing problems and new constraints from a real-world application. In the problem, each carrier has a finite number of vehicles, and each request is a pickup and delivery request with time window. Moreover, each carrier has reserved requests, which must be served by itself, whereas its exchangeable requests can be outsourced to and served by other carriers. This collaboration among carriers can help them to reduce total transportation costs. A mixed integer programming model is proposed to the problem. To solve the model, a hybrid algorithm that combines Genetic Algorithm and Simulated Annealing (GASA) is proposed. This algorithm takes advantages of GASA at the same time. After tuning the parameters of the algorithm with the Taguchi method, the experiments are conducted and experimental results are provided for the hybrid algorithm. The results are compared with those obtained by a commercial solver. The comparison indicates that the GASA significantly outperforms the commercial solver. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=centralized%20collaborative%20transportation" title="centralized collaborative transportation">centralized collaborative transportation</a>, <a href="https://publications.waset.org/abstracts/search?q=collaborative%20transportation%20with%20pickup%20and%20delivery" title=" collaborative transportation with pickup and delivery"> collaborative transportation with pickup and delivery</a>, <a href="https://publications.waset.org/abstracts/search?q=collaborative%20transportation%20with%20time%20windows" title=" collaborative transportation with time windows"> collaborative transportation with time windows</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20algorithm%20of%20GA%20and%20SA" title=" hybrid algorithm of GA and SA"> hybrid algorithm of GA and SA</a> </p> <a href="https://publications.waset.org/abstracts/81528/a-hybrid-algorithm-for-collaborative-transportation-planning-among-carriers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/81528.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">392</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">8686</span> Exponential Spline Solution for Singularly Perturbed Boundary Value Problems with an Uncertain-But-Bounded Parameter </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Waheed%20Zahra">Waheed Zahra</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20El-Beltagy"> Mohamed El-Beltagy</a>, <a href="https://publications.waset.org/abstracts/search?q=Ashraf%20El%20Mhlawy"> Ashraf El Mhlawy</a>, <a href="https://publications.waset.org/abstracts/search?q=Reda%20Elkhadrawy"> Reda Elkhadrawy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we consider singular perturbation reaction-diffusion boundary value problems, which contain a small uncertain perturbation parameter. To solve these problems, we propose a numerical method which is based on an exponential spline and Shishkin mesh discretization. While interval analysis principle is used to deal with the uncertain parameter, sensitivity analysis has been conducted using different methods. Numerical results are provided to show the applicability and efficiency of our method, which is ε-uniform convergence of almost second order. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=singular%20perturbation%20problem" title="singular perturbation problem">singular perturbation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=shishkin%20mesh" title=" shishkin mesh"> shishkin mesh</a>, <a href="https://publications.waset.org/abstracts/search?q=two%20small%20parameters" title=" two small parameters"> two small parameters</a>, <a href="https://publications.waset.org/abstracts/search?q=exponential%20spline" title=" exponential spline"> exponential spline</a>, <a href="https://publications.waset.org/abstracts/search?q=interval%20analysis" title=" interval analysis"> interval analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=sensitivity%20analysis" title=" sensitivity analysis"> sensitivity analysis</a> </p> <a href="https://publications.waset.org/abstracts/91560/exponential-spline-solution-for-singularly-perturbed-boundary-value-problems-with-an-uncertain-but-bounded-parameter" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/91560.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">274</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">8685</span> Multi-Objective Production Planning Problem: A Case Study of Certain and Uncertain Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahteshamul%20Haq">Ahteshamul Haq</a>, <a href="https://publications.waset.org/abstracts/search?q=Srikant%20Gupta"> Srikant Gupta</a>, <a href="https://publications.waset.org/abstracts/search?q=Murshid%20Kamal"> Murshid Kamal</a>, <a href="https://publications.waset.org/abstracts/search?q=Irfan%20Ali"> Irfan Ali</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This case study designs and builds a multi-objective production planning model for a hardware firm with certain & uncertain data. During the time of interaction with the manager of the firm, they indicate some of the parameters may be vague. This vagueness in the formulated model is handled by the concept of fuzzy set theory. Triangular & Trapezoidal fuzzy numbers are used to represent the uncertainty in the collected data. The fuzzy nature is de-fuzzified into the crisp form using well-known defuzzification method via graded mean integration representation method. The proposed model attempts to maximize the production of the firm, profit related to the manufactured items & minimize the carrying inventory costs in both certain & uncertain environment. The recommended optimal plan is determined via fuzzy programming approach, and the formulated models are solved by using optimizing software LINGO 16.0 for getting the optimal production plan. The proposed model yields an efficient compromise solution with the overall satisfaction of decision maker. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=production%20planning%20problem" title="production planning problem">production planning problem</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=fuzzy%20programming" title=" fuzzy programming"> fuzzy programming</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20sets" title=" fuzzy sets"> fuzzy sets</a> </p> <a href="https://publications.waset.org/abstracts/77424/multi-objective-production-planning-problem-a-case-study-of-certain-and-uncertain-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/77424.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">213</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">8684</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">8683</span> A Joint Possibilistic-Probabilistic Tool for Load Flow Uncertainty Assessment-Part II: Case Studies</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Morteza%20Aien">Morteza Aien</a>, <a href="https://publications.waset.org/abstracts/search?q=Masoud%20Rashidinejad"> Masoud Rashidinejad</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahmud%20Fotuhi-Firuzabad"> Mahmud Fotuhi-Firuzabad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Power systems are innately uncertain systems. To face with such uncertain systems, robust uncertainty assessment tools are appealed. This paper inspects the uncertainty assessment formulation of the load flow (LF) problem considering different kinds of uncertainties, developed in its companion paper through some case studies. The proposed methodology is based on the evidence theory and joint propagation of possibilistic and probabilistic uncertainties. The load and wind power generation are considered as probabilistic uncertain variables and the electric vehicles (EVs) and gas turbine distributed generation (DG) units are considered as possibilistic uncertain variables. The cumulative distribution function (CDF) of the system output parameters obtained by the pure probabilistic method lies within the belief and plausibility functions obtained by the joint propagation approach. Furthermore, the imprecision in the DG parameters is explicitly reflected by the gap between the belief and plausibility functions. This gap, due to the epistemic uncertainty on the DG resources parameters grows as the penetration level increases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=electric%20vehicles" title="electric vehicles">electric vehicles</a>, <a href="https://publications.waset.org/abstracts/search?q=joint%20possibilistic-%20probabilistic%20uncertainty%20modeling" title=" joint possibilistic- probabilistic uncertainty modeling"> joint possibilistic- probabilistic uncertainty modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertain%20load%20flow" title=" uncertain load flow"> uncertain load flow</a>, <a href="https://publications.waset.org/abstracts/search?q=wind%20turbine%20generator" title=" wind turbine generator"> wind turbine generator</a> </p> <a href="https://publications.waset.org/abstracts/15353/a-joint-possibilistic-probabilistic-tool-for-load-flow-uncertainty-assessment-part-ii-case-studies" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15353.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">431</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">8682</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">8681</span> Application of Transportation Linear Programming Algorithms to Cost Reduction in Nigeria Soft Drinks Industry</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Salami%20Akeem%20Olanrewaju">Salami Akeem Olanrewaju</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The transportation models or problems are primarily concerned with the optimal (best possible) way in which a product produced at different factories or plants (called supply origins) can be transported to a number of warehouses or customers (called demand destinations). The objective in a transportation problem is to fully satisfy the destination requirements within the operating production capacity constraints at the minimum possible cost. The objective of this study is to determine ways of minimizing transport cost in order to maximum profit. Data were gathered from the records of the Distribution Department of 7-Up Bottling Company Plc. Ilorin, Kwara State, Nigeria. The data were analyzed using SPSS (Statistical Package for Social Sciences) while applying the three methods of solving a transportation problem. The three methods produced the same results; therefore, any of the method can be adopted by the company in transporting its final products to the wholesale dealers in order to minimize total production cost. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cost%20minimization" title="cost minimization">cost minimization</a>, <a href="https://publications.waset.org/abstracts/search?q=resources%20utilization" title=" resources utilization"> resources utilization</a>, <a href="https://publications.waset.org/abstracts/search?q=distribution%20system" title=" distribution system"> distribution system</a>, <a href="https://publications.waset.org/abstracts/search?q=allocation%20problem" title=" allocation problem"> allocation problem</a> </p> <a href="https://publications.waset.org/abstracts/2450/application-of-transportation-linear-programming-algorithms-to-cost-reduction-in-nigeria-soft-drinks-industry" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2450.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">257</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8680</span> Unfolding the Social Clash between Online and Non-Online Transportation Providers in Bandung</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Latifah%20Putti%20Tiananda">Latifah Putti Tiananda</a>, <a href="https://publications.waset.org/abstracts/search?q=Sasti%20Khoirunnisa"> Sasti Khoirunnisa</a>, <a href="https://publications.waset.org/abstracts/search?q=Taniadiana%20Yapwito"> Taniadiana Yapwito</a>, <a href="https://publications.waset.org/abstracts/search?q=Jessica%20Noviena"> Jessica Noviena</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Innovations are often met with two responses, acceptance or rejection. In the past few years, Indonesia is experiencing a revolution of transportation service, which utilizes online platform for its operation. Such improvement is welcomed by consumers and challenged by conventional or ‘non-online’ transportation providers simultaneously. Conflicts arise as the existence of this online transportation mode results in declining income of non-online transportation workers. Physical confrontations and demonstrations demand policing from central authority. However, the obscurity of legal measures from the government persists the social instability. Bandung, a city in West Java with the highest rate of online transportation usage, has recently issued a recommendation withholding the operation of online transportation services to maintain peace and order. Thus, this paper seeks to elaborate the social unrest between the two contesting transportation actors in Bandung and explore community-based approaches to solve this problem. Using qualitative research method, this paper will also feature in-depth interviews with directly involved sources from Bandung. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bandung" title="Bandung">Bandung</a>, <a href="https://publications.waset.org/abstracts/search?q=market%20competition" title=" market competition"> market competition</a>, <a href="https://publications.waset.org/abstracts/search?q=online%20transportation%20services" title=" online transportation services"> online transportation services</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20unrest" title=" social unrest"> social unrest</a> </p> <a href="https://publications.waset.org/abstracts/83161/unfolding-the-social-clash-between-online-and-non-online-transportation-providers-in-bandung" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/83161.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">274</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">8679</span> Status and Proposed Models of Backhauling System in Thailand</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tarathorn%20Podcharathitikull">Tarathorn Podcharathitikull</a>, <a href="https://publications.waset.org/abstracts/search?q=Jirarat%20Teeravaraprug"> Jirarat Teeravaraprug</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Transportation cost is the highest cost in logistics cost of Thailand, and truck transportation is counted as about 90% of the overall transportation cost. The main problem of truck transportation is backhauling. Backhauling has become an attractive cost-saving approach in logistics. To explore such opportunities, this paper investigated the current backhauling systems in Thailand. It was found that the backhauling problem is attracted to both governmental agencies and private sector. They gave attempts to build backhauling systems. This paper investigated two systems built by governmental agencies and one by private sector. Moreover, based on the interviews with the system representatives and users, pros and cons of the systems were found. The obstacles and challenges were obtained. This paper finally proposed a conceptual model of to-be backhauling system in Thailand. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=backhauling%20system" title="backhauling system">backhauling system</a>, <a href="https://publications.waset.org/abstracts/search?q=backhauls" title=" backhauls"> backhauls</a>, <a href="https://publications.waset.org/abstracts/search?q=interview" title=" interview"> interview</a>, <a href="https://publications.waset.org/abstracts/search?q=Thailand" title=" Thailand"> Thailand</a> </p> <a href="https://publications.waset.org/abstracts/51412/status-and-proposed-models-of-backhauling-system-in-thailand" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51412.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">285</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">8678</span> Constraint-Directed Techniques for Transport Scheduling with Capacity Restrictions of Automotive Manufacturing Components</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Martha%20Ndeley">Martha Ndeley</a>, <a href="https://publications.waset.org/abstracts/search?q=John%20Ikome"> John Ikome</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we expand the scope of constraint-directed techniques to deal with the case of transportation schedule with capacity restrictions where the scheduling problem includes alternative activities. That is, not only does the scheduling problem consist of determining when an activity is to be executed, but also determining which set of alternative activities is to be executed at all level of transportation from input to output. Such problems encompass both alternative resource problems and alternative process plan problems. We formulate a constraint-based representation of alternative activities to model problems containing such choices. We then extend existing constraint-directed scheduling heuristic commitment techniques and propagators to reason directly about the fact that an activity does not necessarily have to exist in a final transportation schedule without being completed. Tentative results show that an algorithm using a novel texture-based heuristic commitment technique propagators achieves the best overall performance of the techniques tested. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=production" title="production">production</a>, <a href="https://publications.waset.org/abstracts/search?q=transportation" title=" transportation"> transportation</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=integrated" title=" integrated"> integrated</a> </p> <a href="https://publications.waset.org/abstracts/50638/constraint-directed-techniques-for-transport-scheduling-with-capacity-restrictions-of-automotive-manufacturing-components" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50638.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">362</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">8677</span> Modified Approximation Methods for Finding an Optimal Solution for the Transportation Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20Guruprasad">N. Guruprasad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a modification of approximation method for transportation problems. The initial basic feasible solution can be computed using either Russel's or Vogel's approximation methods. Russell’s approximation method provides another excellent criterion that is still quick to implement on a computer (not manually) In most cases Russel's method yields a better initial solution, though it takes longer than Vogel's method (finding the next entering variable in Russel's method is in O(n1*n2), and in O(n1+n2) for Vogel's method). However, Russel's method normally has a lesser total running time because less pivots are required to reach the optimum for all but small problem sizes (n1+n2=~20). With this motivation behind we have incorporated a variation of the same – what we have proposed it has TMC (Total Modified Cost) to obtain fast and efficient solutions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computation" title="computation">computation</a>, <a href="https://publications.waset.org/abstracts/search?q=efficiency" title=" efficiency"> efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20cost" title=" modified cost"> modified cost</a>, <a href="https://publications.waset.org/abstracts/search?q=Russell%E2%80%99s%20approximation%20method" title=" Russell’s approximation method"> Russell’s approximation method</a>, <a href="https://publications.waset.org/abstracts/search?q=transportation" title=" transportation"> transportation</a>, <a href="https://publications.waset.org/abstracts/search?q=Vogel%E2%80%99s%20approximation%20method" title=" Vogel’s approximation method"> Vogel’s approximation method</a> </p> <a href="https://publications.waset.org/abstracts/19162/modified-approximation-methods-for-finding-an-optimal-solution-for-the-transportation-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19162.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">547</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">8676</span> Review of Transportation Modeling Software</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hassan%20M.%20Al-Ahmadi">Hassan M. Al-Ahmadi</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamad%20Bader%20Almobayedh"> Hamad Bader Almobayedh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Planning for urban transportation is essential for developing effective and sustainable transportation networks that meet the needs of various communities. Advanced modeling software is required for effective transportation planning, management, and optimization. This paper compares PTV VISUM, Aimsun, TransCAD, and Emme, four industry-leading software tools for transportation planning and modeling. Each software has strengths and limitations, and the project's needs, financial constraints, and level of technical expertise influence the choice of software. Transportation experts can design and improve urban transportation systems that are effective, sustainable, and meet the changing needs of their communities by utilizing these software tools. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=PTV%20VISUM" title="PTV VISUM">PTV VISUM</a>, <a href="https://publications.waset.org/abstracts/search?q=Aimsun" title=" Aimsun"> Aimsun</a>, <a href="https://publications.waset.org/abstracts/search?q=TransCAD" title=" TransCAD"> TransCAD</a>, <a href="https://publications.waset.org/abstracts/search?q=transportation%20modeling%20software" title=" transportation modeling software"> transportation modeling software</a> </p> <a href="https://publications.waset.org/abstracts/187721/review-of-transportation-modeling-software" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/187721.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">31</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">8675</span> A Combined High Gain-Higher Order Sliding Mode Controller for a Class of Uncertain Nonlinear Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abderraouf%20Gaaloul">Abderraouf Gaaloul</a>, <a href="https://publications.waset.org/abstracts/search?q=Faouzi%20Msahli"> Faouzi Msahli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The use of standard sliding mode controller, usually, leads to the appearing of an undesirable chattering phenomenon affecting the control signal. Such problem can be overcome using a higher-order sliding mode controller (HOSMC) which preserves the main properties of the standard sliding mode and deliberately increases the control smoothness. In this paper, we propose a new HOSMC for a class of uncertain multi-input multi-output nonlinear systems. Based on high gain and integral sliding mode paradigms, the established control scheme removes theoretically the chattering phenomenon and provides the stability of the control system. Numerical simulations are developed to show the effectiveness of the proposed controller when applied to solve a control problem of two water levels into a quadruple-tank process. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20systems" title="nonlinear systems">nonlinear systems</a>, <a href="https://publications.waset.org/abstracts/search?q=sliding%20mode%20control" title=" sliding mode control"> sliding mode control</a>, <a href="https://publications.waset.org/abstracts/search?q=high%20gain" title=" high gain"> high gain</a>, <a href="https://publications.waset.org/abstracts/search?q=higher%20order" title=" higher order"> higher order</a> </p> <a href="https://publications.waset.org/abstracts/84589/a-combined-high-gain-higher-order-sliding-mode-controller-for-a-class-of-uncertain-nonlinear-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/84589.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">327</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8674</span> A Joint Possibilistic-Probabilistic Tool for Load Flow Uncertainty Assessment-Part I: Formulation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Morteza%20Aien">Morteza Aien</a>, <a href="https://publications.waset.org/abstracts/search?q=Masoud%20Rashidinejad"> Masoud Rashidinejad</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahmud%20Fotuhi-Firuzabad"> Mahmud Fotuhi-Firuzabad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As energetic and environmental issues are getting more and more attention all around the world, the penetration of distributed energy resources (DERs) mainly those harvesting renewable energies (REs) ascends with an unprecedented rate. This matter causes more uncertainties to appear in the power system context; ergo, the uncertainty analysis of the system performance is an obligation. The uncertainties of any system can be represented probabilistically or possibilistically. Since sufficient historical data about all the system variables is not available, therefore, they do not have a probability density function (PDF) and must be represented possibilistiacally. When some of system uncertain variables are probabilistic and some are possibilistic, neither the conventional pure probabilistic nor pure possibilistic methods can be implemented. Hence, a combined solution is appealed. The first of this two-paper series formulates a new possibilistic-probabilistic tool for the load flow uncertainty assessment. The proposed methodology is based on the evidence theory and joint propagation of possibilistic and probabilistic uncertainties. This possibilistic- probabilistic formulation is solved in the second companion paper in an uncertain load flow (ULF) study problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=probabilistic%20uncertainty%20modeling" title="probabilistic uncertainty modeling">probabilistic uncertainty modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=possibilistic%20uncertainty%20modeling" title=" possibilistic uncertainty modeling"> possibilistic uncertainty modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertain%20load%20flow" title=" uncertain load flow"> uncertain load flow</a>, <a href="https://publications.waset.org/abstracts/search?q=wind%20turbine%20generator" title=" wind turbine generator"> wind turbine generator</a> </p> <a href="https://publications.waset.org/abstracts/15352/a-joint-possibilistic-probabilistic-tool-for-load-flow-uncertainty-assessment-part-i-formulation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15352.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">561</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">8673</span> Similarity Based Membership of Elements to Uncertain Concept in Information System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Kamel%20El-Sayed">M. Kamel El-Sayed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The process of determining the degree of membership for an element to an uncertain concept has been found in many ways, using equivalence and symmetry relations in information systems. In the case of similarity, these methods did not take into account the degree of symmetry between elements. In this paper, we use a new definition for finding the membership based on the degree of symmetry. We provide an example to clarify the suggested methods and compare it with previous methods. This method opens the door to more accurate decisions in information systems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=information%20system" title="information system">information system</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertain%20concept" title=" uncertain concept"> uncertain concept</a>, <a href="https://publications.waset.org/abstracts/search?q=membership%20function" title=" membership function"> membership function</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20relation" title=" similarity relation"> similarity relation</a>, <a href="https://publications.waset.org/abstracts/search?q=degree%20of%20similarity" title=" degree of similarity"> degree of similarity</a> </p> <a href="https://publications.waset.org/abstracts/88086/similarity-based-membership-of-elements-to-uncertain-concept-in-information-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/88086.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">223</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">8672</span> Integration of Big Data to Predict Transportation for Smart Cities</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sun-Young%20Jang">Sun-Young Jang</a>, <a href="https://publications.waset.org/abstracts/search?q=Sung-Ah%20Kim"> Sung-Ah Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Dongyoun%20Shin"> Dongyoun Shin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Intelligent transportation system is essential to build smarter cities. Machine learning based transportation prediction could be highly promising approach by delivering invisible aspect visible. In this context, this research aims to make a prototype model that predicts transportation network by using big data and machine learning technology. In detail, among urban transportation systems this research chooses bus system.  The research problem that existing headway model cannot response dynamic transportation conditions. Thus, bus delay problem is often occurred. To overcome this problem, a prediction model is presented to fine patterns of bus delay by using a machine learning implementing the following data sets; traffics, weathers, and bus statues. This research presents a flexible headway model to predict bus delay and analyze the result. The prototyping model is composed by real-time data of buses. The data are gathered through public data portals and real time Application Program Interface (API) by the government. These data are fundamental resources to organize interval pattern models of bus operations as traffic environment factors (road speeds, station conditions, weathers, and bus information of operating in real-time). The prototyping model is designed by the machine learning tool (RapidMiner Studio) and conducted tests for bus delays prediction. This research presents experiments to increase prediction accuracy for bus headway by analyzing the urban big data. The big data analysis is important to predict the future and to find correlations by processing huge amount of data. Therefore, based on the analysis method, this research represents an effective use of the machine learning and urban big data to understand urban dynamics. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=big%20data" title="big data">big data</a>, <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=smart%20city" title=" smart city"> smart city</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20cost" title=" social cost"> social cost</a>, <a href="https://publications.waset.org/abstracts/search?q=transportation%20network" title=" transportation network"> transportation network</a> </p> <a href="https://publications.waset.org/abstracts/76004/integration-of-big-data-to-predict-transportation-for-smart-cities" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/76004.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">260</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=uncertain%20transportation%20problem&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=uncertain%20transportation%20problem&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=uncertain%20transportation%20problem&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=uncertain%20transportation%20problem&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=uncertain%20transportation%20problem&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=uncertain%20transportation%20problem&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=uncertain%20transportation%20problem&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=uncertain%20transportation%20problem&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=uncertain%20transportation%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=uncertain%20transportation%20problem&page=290">290</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=uncertain%20transportation%20problem&page=291">291</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=uncertain%20transportation%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>