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: bus scheduling problem</title> <meta name="description" content="Search results for: bus scheduling problem"> <meta name="keywords" content="bus scheduling 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="bus scheduling 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="bus scheduling 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> 7414</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: bus scheduling problem</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7144</span> A Matheuristic Algorithm for the School Bus Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Cagri%20Memis">Cagri Memis</a>, <a href="https://publications.waset.org/abstracts/search?q=Muzaffer%20Kapanoglu"> Muzaffer Kapanoglu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The school bus routing problem (SBRP) is a variant of the Vehicle Routing Problem (VRP) classified as a location-allocation-routing problem. In this study, the SBRP is decomposed into two sub-problems: (1) bus route generation and (2) bus stop selection to solve large instances of the SBRP in reasonable computational times. To solve the first sub-problem, we propose a genetic algorithm to generate bus routes. Once the routes have been fixed, a sub-problem remains of allocating students to stops considering the capacity of the buses and the walkability constraints of the students. While the exact method solves small-scale problems, treating large-scale problems with the exact method becomes complex due to computational problems, a deficiency that the genetic algorithm can overcome. Results obtained from the proposed approach on 150 instances up to 250 stops show that the matheuristic algorithm provides better solutions in reasonable computational times with respect to benchmark algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title="genetic algorithm">genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=matheuristic" title=" matheuristic"> matheuristic</a>, <a href="https://publications.waset.org/abstracts/search?q=school%20bus%20routing%20problem" title=" school bus routing problem"> school bus routing problem</a>, <a href="https://publications.waset.org/abstracts/search?q=vehicle%20routing%20problem" title=" vehicle routing problem"> vehicle routing problem</a> </p> <a href="https://publications.waset.org/abstracts/168676/a-matheuristic-algorithm-for-the-school-bus-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/168676.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">71</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">7143</span> Tabu Search to Draw Evacuation Plans in Emergency Situations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Nasri">S. Nasri</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20Bouziri"> H. Bouziri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Disasters are quite experienced in our days. They are caused by floods, landslides, and building fires that is the main objective of this study. To cope with these unexpected events, precautions must be taken to protect human lives. The emphasis on disposal work focuses on the resolution of the evacuation problem in case of no-notice disaster. The problem of evacuation is listed as a dynamic network flow problem. Particularly, we model the evacuation problem as an earliest arrival flow problem with load dependent transit time. This problem is classified as NP-Hard. Our challenge here is to propose a metaheuristic solution for solving the evacuation problem. We define our objective as the maximization of evacuees during earliest periods of a time horizon T. The objective provides the evacuation of persons as soon as possible. We performed an experimental study on emergency evacuation from the tunisian children’s hospital. This work prompts us to look for evacuation plans corresponding to several situations where the network dynamically changes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamic%20network%20flow" title="dynamic network flow">dynamic network flow</a>, <a href="https://publications.waset.org/abstracts/search?q=load%20dependent%20transit%20time" title=" load dependent transit time"> load dependent transit time</a>, <a href="https://publications.waset.org/abstracts/search?q=evacuation%20strategy" title=" evacuation strategy"> evacuation strategy</a>, <a href="https://publications.waset.org/abstracts/search?q=earliest%20arrival%20flow%20problem" title=" earliest arrival flow problem"> earliest arrival flow problem</a>, <a href="https://publications.waset.org/abstracts/search?q=tabu%20search%20metaheuristic" title=" tabu search metaheuristic"> tabu search metaheuristic</a> </p> <a href="https://publications.waset.org/abstracts/12984/tabu-search-to-draw-evacuation-plans-in-emergency-situations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12984.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">372</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">7142</span> Enhancing Throughput for Wireless Multihop Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=K.%20Kalaiarasan">K. Kalaiarasan</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Pandeeswari"> B. Pandeeswari</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Arockia%20John%20Francis"> A. Arockia John Francis </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wireless, Multi-hop networks consist of one or more intermediate nodes along the path that receive and forward packets via wireless links. The backpressure algorithm provides throughput optimal routing and scheduling decisions for multi-hop networks with dynamic traffic. Xpress, a cross-layer backpressure architecture was designed to reach the capacity of wireless multi-hop networks and it provides well coordination between layers of network by turning a mesh network into a wireless switch. Transmission over the network is scheduled using a throughput-optimal backpressure algorithm. But this architecture operates much below their capacity due to out-of-order packet delivery and variable packet size. In this paper, we present Xpress-T, a throughput optimal backpressure architecture with TCP support designed to reach maximum throughput of wireless multi-hop networks. Xpress-T operates at the IP layer, and therefore any transport protocol, including TCP, can run on top of Xpress-T. The proposed design not only avoids bottlenecks but also handles out-of-order packet delivery and variable packet size, optimally load-balances traffic across them when needed, improving fairness among competing flows. Our simulation results shows that Xpress-T gives 65% more throughput than Xpress. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=backpressure%20scheduling%20and%20routing" title="backpressure scheduling and routing">backpressure scheduling and routing</a>, <a href="https://publications.waset.org/abstracts/search?q=TCP" title=" TCP"> TCP</a>, <a href="https://publications.waset.org/abstracts/search?q=congestion%20control" title=" congestion control"> congestion control</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20multihop%20network" title=" wireless multihop network"> wireless multihop network</a> </p> <a href="https://publications.waset.org/abstracts/30049/enhancing-throughput-for-wireless-multihop-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30049.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">518</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">7141</span> Reconstruction of Binary Matrices Satisfying Neighborhood Constraints by Simulated Annealing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Divyesh%20Patel">Divyesh Patel</a>, <a href="https://publications.waset.org/abstracts/search?q=Tanuja%20Srivastava"> Tanuja Srivastava</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper considers the NP-hard problem of reconstructing binary matrices satisfying exactly-1-4-adjacency constraint from its row and column projections. This problem is formulated into a maximization problem. The objective function gives a measure of adjacency constraint for the binary matrices. The maximization problem is solved by the simulated annealing algorithm and experimental results are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=discrete%20tomography" title="discrete tomography">discrete tomography</a>, <a href="https://publications.waset.org/abstracts/search?q=exactly-1-4-adjacency" title=" exactly-1-4-adjacency"> exactly-1-4-adjacency</a>, <a href="https://publications.waset.org/abstracts/search?q=simulated%20annealing" title=" simulated annealing"> simulated annealing</a>, <a href="https://publications.waset.org/abstracts/search?q=binary%20matrices" title=" binary matrices"> binary matrices</a> </p> <a href="https://publications.waset.org/abstracts/8505/reconstruction-of-binary-matrices-satisfying-neighborhood-constraints-by-simulated-annealing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8505.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">406</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">7140</span> Method and Apparatus for Optimized Job Scheduling in the High-Performance Computing Cloud Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Subodh%20Kumar">Subodh Kumar</a>, <a href="https://publications.waset.org/abstracts/search?q=Amit%20Varde"> Amit Varde</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Typical on-premises high-performance computing (HPC) environments consist of a fixed number and a fixed set of computing hardware. During the design of the HPC environment, the hardware components, including but not limited to CPU, Memory, GPU, and networking, are carefully chosen from select vendors for optimal performance. High capital cost for building the environment is a prime factor influencing the design environment. A class of software called “Job Schedulers” are critical to maximizing these resources and running multiple workloads to extract the maximum value for the high capital cost. In principle, schedulers work by preventing workloads and users from monopolizing the finite hardware resources by queuing jobs in a workload. A cloud-based HPC environment does not have the limitations of fixed (type of and quantity of) hardware resources. In theory, users and workloads could spin up any number and type of hardware resource. This paper discusses the limitations of using traditional scheduling algorithms for cloud-based HPC workloads. It proposes a new set of features, called “HPC optimizers,” for maximizing the benefits of the elasticity and scalability of the cloud with the goal of cost-performance optimization of the workload. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=high%20performance%20computing" title="high performance computing">high performance computing</a>, <a href="https://publications.waset.org/abstracts/search?q=HPC" title=" HPC"> HPC</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title=" cloud computing"> cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=schedulers" title=" schedulers"> schedulers</a> </p> <a href="https://publications.waset.org/abstracts/155107/method-and-apparatus-for-optimized-job-scheduling-in-the-high-performance-computing-cloud-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/155107.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">93</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">7139</span> Comparative Evaluation of Root Uptake Models for Developing Moisture Uptake Based Irrigation Schedules for Crops </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vijay%20Shankar">Vijay Shankar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the era of water scarcity, effective use of water via irrigation requires good methods for determining crop water needs. Implementation of irrigation scheduling programs requires an accurate estimate of water use by the crop. Moisture depletion from the root zone represents the consequent crop evapotranspiration (ET). A numerical model for simulating soil water depletion in the root zone has been developed by taking into consideration soil physical properties, crop and climatic parameters. The governing differential equation for unsaturated flow of water in the soil is solved numerically using the fully implicit finite difference technique. The water uptake by plants is simulated by using three different sink functions. The non-linear model predictions are in good agreement with field data and thus it is possible to schedule irrigations more effectively. The present paper describes irrigation scheduling based on moisture depletion from the different layers of the root zone, obtained using different sink functions for three cash, oil and forage crops: cotton, safflower and barley, respectively. The soil is considered at a moisture level equal to field capacity prior to planting. Two soil moisture regimes are then imposed for irrigated treatment, one wherein irrigation is applied whenever soil moisture content is reduced to 50% of available soil water; and other wherein irrigation is applied whenever soil moisture content is reduced to 75% of available soil water. For both the soil moisture regimes it has been found that the model incorporating a non-linear sink function which provides best agreement of computed root zone moisture depletion with field data, is most effective in scheduling irrigations. Simulation runs with this moisture uptake function result in saving 27.3 to 45.5% & 18.7 to 37.5%, 12.5 to 25% % &16.7 to 33.3% and 16.7 to 33.3% & 20 to 40% irrigation water for cotton, safflower and barley respectively, under 50 & 75% moisture depletion regimes over other moisture uptake functions considered in the study. Simulation developed can be used for an optimized irrigation planning for different crops, choosing a suitable soil moisture regime depending upon the irrigation water availability and crop requirements. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=irrigation%20water" title="irrigation water">irrigation water</a>, <a href="https://publications.waset.org/abstracts/search?q=evapotranspiration" title=" evapotranspiration"> evapotranspiration</a>, <a href="https://publications.waset.org/abstracts/search?q=root%20uptake%20models" title=" root uptake models"> root uptake models</a>, <a href="https://publications.waset.org/abstracts/search?q=water%20scarcity" title=" water scarcity"> water scarcity</a> </p> <a href="https://publications.waset.org/abstracts/9891/comparative-evaluation-of-root-uptake-models-for-developing-moisture-uptake-based-irrigation-schedules-for-crops" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9891.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">331</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">7138</span> Constant Factor Approximation Algorithm for p-Median Network Design Problem with Multiple Cable Types</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chaghoub%20Soraya">Chaghoub Soraya</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhang%20Xiaoyan"> Zhang Xiaoyan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research presents the first constant approximation algorithm to the p-median network design problem with multiple cable types. This problem was addressed with a single cable type and there is a bifactor approximation algorithm for the problem. To the best of our knowledge, the algorithm proposed in this paper is the first constant approximation algorithm for the p-median network design with multiple cable types. The addressed problem is a combination of two well studied problems which are p-median problem and network design problem. The introduced algorithm is a random sampling approximation algorithm of constant factor which is conceived by using some random sampling techniques form the literature. It is based on a redistribution Lemma from the literature and a steiner tree problem as a subproblem. This algorithm is simple, and it relies on the notions of random sampling and probability. The proposed approach gives an approximation solution with one constant ratio without violating any of the constraints, in contrast to the one proposed in the literature. This paper provides a (21 + 2)-approximation algorithm for the p-median network design problem with multiple cable types using random sampling techniques. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximation%20algorithms" title="approximation algorithms">approximation algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=buy-at-bulk" title=" buy-at-bulk"> buy-at-bulk</a>, <a href="https://publications.waset.org/abstracts/search?q=combinatorial%20optimization" title=" combinatorial optimization"> combinatorial optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20design" title=" network design"> network design</a>, <a href="https://publications.waset.org/abstracts/search?q=p-median" title=" p-median"> p-median</a> </p> <a href="https://publications.waset.org/abstracts/127337/constant-factor-approximation-algorithm-for-p-median-network-design-problem-with-multiple-cable-types" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/127337.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">203</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">7137</span> Hybrid GA-PSO Based Pitch Controller Design for Aircraft Control System </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vaibhav%20Singh%20%20Rajput">Vaibhav Singh Rajput</a>, <a href="https://publications.waset.org/abstracts/search?q=Ravi%20Kumar%20Jatoth"> Ravi Kumar Jatoth</a>, <a href="https://publications.waset.org/abstracts/search?q=Nagu%20Bhookya"> Nagu Bhookya</a>, <a href="https://publications.waset.org/abstracts/search?q=Bhasker%20Boda"> Bhasker Boda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper proportional, integral, derivative (PID) controller is used to control the pitch angle of the aircraft when the elevation angle is changed or modified. The pitch angle is dependent on elevation angle; a change in one corresponds to a change in the other. The PID controller helps in restricted change of pitch rate in response to the elevation angle. The PID controller is dependent on different parameters like Kp, Ki, Kd which change the pitch rate as they change. Various methodologies are used for changing those parameters for getting a perfect time response pitch angle, as desired or wished by a concerned person. While reckoning the values of those parameters, trial and guessing may prove to be futile in order to provide comfort to passengers. So, using some metaheuristic techniques can be useful in handling these errors. Hybrid GA-PSO is one such powerful algorithm which can improve transient and steady state response and can give us more reliable results for PID gain scheduling problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pitch%20rate" title="pitch rate">pitch rate</a>, <a href="https://publications.waset.org/abstracts/search?q=elevation%20angle" title=" elevation angle"> elevation angle</a>, <a href="https://publications.waset.org/abstracts/search?q=PID%20controller" title=" PID controller"> PID controller</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=phugoid" title=" phugoid"> phugoid</a> </p> <a href="https://publications.waset.org/abstracts/64457/hybrid-ga-pso-based-pitch-controller-design-for-aircraft-control-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/64457.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">7136</span> Expert and Novice Problem-Solvers Differences: A Discourse for Effective Teaching Delivery in Physics Classrooms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abubakar%20Sa%E2%80%99adatu%20Mohammed">Abubakar Sa’adatu Mohammed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper reports on a study of problem solving differences between expert and novice Problem solvers for effective physics teaching. Significant differences were found both at the conceptual level and at the level of critical thinking, creative thinking and reasoning. It is suggested for a successful solution of a problem, conceptual knowledge alone may not be sufficient. There is the need of the knowledge of how the conceptual knowledge should be applied (problem solving skills). It is hoped that this research might contribute to efforts of exploring ways for students to acquire a powerful conceptual toolkit based on experts like problem solvers approach for effective teaching delivery. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=conceptual%20knowledge" title="conceptual knowledge">conceptual knowledge</a>, <a href="https://publications.waset.org/abstracts/search?q=procedural%20knowledge" title=" procedural knowledge"> procedural knowledge</a>, <a href="https://publications.waset.org/abstracts/search?q=critical%20thinking" title=" critical thinking"> critical thinking</a>, <a href="https://publications.waset.org/abstracts/search?q=creative%20thinking" title=" creative thinking"> creative thinking</a>, <a href="https://publications.waset.org/abstracts/search?q=reasoning%20ability" title=" reasoning ability"> reasoning ability</a> </p> <a href="https://publications.waset.org/abstracts/37987/expert-and-novice-problem-solvers-differences-a-discourse-for-effective-teaching-delivery-in-physics-classrooms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37987.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">299</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">7135</span> Developing the Morphological Field of Problem Context to Assist Multi-Methodology in Operations Research</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mahnaz%20Hosseinzadeh">Mahnaz Hosseinzadeh</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Reza%20Mehregan"> Mohammad Reza Mehregan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we have developed a morphological field to assist multi- methodology (combining methodologies together in whole or part) in Operations Research (OR) for the problem contexts in Iranian organizations. So, we have attempted to identify some dimensions for problem context according to Iranian organizational problems. Then, a general morphological program is designed which helps the OR practitioner to determine the suitable OR methodology as output for any configuration of conditions in a problem context as input and to reveal the fields necessary to be improved in OR. Applying such a program would have interesting results for OR practitioners. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hard" title="hard">hard</a>, <a href="https://publications.waset.org/abstracts/search?q=soft%20and%20emancipatory%20operations%20research" title=" soft and emancipatory operations research"> soft and emancipatory operations research</a>, <a href="https://publications.waset.org/abstracts/search?q=General%20Morphological%20Analysis%20%28GMA%29" title=" General Morphological Analysis (GMA)"> General Morphological Analysis (GMA)</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-methodology" title=" multi-methodology"> multi-methodology</a>, <a href="https://publications.waset.org/abstracts/search?q=problem%20context" title=" problem context"> problem context</a> </p> <a href="https://publications.waset.org/abstracts/75075/developing-the-morphological-field-of-problem-context-to-assist-multi-methodology-in-operations-research" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/75075.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">298</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">7134</span> Solving Stochastic Eigenvalue Problem of Wick Type</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hassan%20Manouzi">Hassan Manouzi</a>, <a href="https://publications.waset.org/abstracts/search?q=Taous-Meriem%20Laleg-Kirati"> Taous-Meriem Laleg-Kirati</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we study mathematically the eigenvalue problem for stochastic elliptic partial differential equation of Wick type. Using the Wick-product and the Wiener-Ito chaos expansion, the stochastic eigenvalue problem is reformulated as a system of an eigenvalue problem for a deterministic partial differential equation and elliptic partial differential equations by using the Fredholm alternative. To reduce the computational complexity of this system, we shall use a decomposition-coordination method. Once this approximation is performed, the statistics of the numerical solution can be easily evaluated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=eigenvalue%20problem" title="eigenvalue problem">eigenvalue problem</a>, <a href="https://publications.waset.org/abstracts/search?q=Wick%20product" title=" Wick product"> Wick product</a>, <a href="https://publications.waset.org/abstracts/search?q=SPDEs" title=" SPDEs"> SPDEs</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20element" title=" finite element"> finite element</a>, <a href="https://publications.waset.org/abstracts/search?q=Wiener-Ito%20chaos%20expansion" title=" Wiener-Ito chaos expansion"> Wiener-Ito chaos expansion</a> </p> <a href="https://publications.waset.org/abstracts/7652/solving-stochastic-eigenvalue-problem-of-wick-type" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7652.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">358</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">7133</span> Strength of Gratitude Determining Subjective Well-Being: Evidence for Mediating Role of Problem-Solving Styles</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sarwat%20Sultan">Sarwat Sultan</a>, <a href="https://publications.waset.org/abstracts/search?q=Shahzad%20Gul"> Shahzad Gul</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study was carried out to see the mediating role of problem solving styles (sensing, intuitive, feeling, and thinking) in the predictive relationship of gratitude with subjective well-being. A sample of 454 college students aged 20-26 years old participated in this study and provided data on the measures of gratitude, problem solving styles, and subjective well-being. Results indicated the significant relationships of gratitude with subjective well-being and problem solving styles of intuitive and thinking. Results further indicated the positive link of intuitive and thinking styles with subjective well-being. Findings also provided the evidence for the significant mediating role of problem solving styles in the relationship of gratitude with subjective well-being. The implication for this study is likely to enhance the medium to long term effects of gratitude on subjective well-being among students and as well as assessing its value in promoting psychological health and problem solving strategies among students. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=gratitude" title="gratitude">gratitude</a>, <a href="https://publications.waset.org/abstracts/search?q=subjective%20well-being" title=" subjective well-being"> subjective well-being</a>, <a href="https://publications.waset.org/abstracts/search?q=problem%20solving%20styles" title=" problem solving styles"> problem solving styles</a>, <a href="https://publications.waset.org/abstracts/search?q=college%20students" title=" college students"> college students</a> </p> <a href="https://publications.waset.org/abstracts/27115/strength-of-gratitude-determining-subjective-well-being-evidence-for-mediating-role-of-problem-solving-styles" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27115.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">425</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">7132</span> Pavement Failures and Its Maintenance</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maulik%20L.%20Sisodia">Maulik L. Sisodia</a>, <a href="https://publications.waset.org/abstracts/search?q=Tirth%20K.%20Raval"> Tirth K. Raval</a>, <a href="https://publications.waset.org/abstracts/search?q=Aarsh%20S.%20Mistry"> Aarsh S. Mistry</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper summarizes the ongoing researches about the defects in both flexible and rigid pavement and the maintenance in both flexible and rigid pavements. Various defects in pavements have been identified since the existence of both flexible and rigid pavement. Flexible Pavement failure is defined in terms of decreasing serviceability caused by the development of cracks, ruts, potholes etc. Flexible Pavement structure can be destroyed in a single season due to water penetration. Defects in flexible pavements is a problem of multiple dimensions, phenomenal growth of vehicular traffic (in terms of no. of axle loading of commercial vehicles), the rapid expansion in the road network, non-availability of suitable technology, material, equipment, skilled labor and poor funds allocation have all added complexities to the problem of flexible pavements. In rigid pavements due to different type of destress the failure like joint spalling, faulting, shrinkage cracking, punch out, corner break etc. Application of correction in the existing surface will enhance the life of maintenance works as well as that of strengthening layer. Maintenance of a road network involves a variety of operations, i.e., identification of deficiencies and planning, programming and scheduling for actual implementation in the field and monitoring. The essential objective should be to keep the road surface and appurtenances in good condition and to extend the life of the road assets to its design life. The paper describes lessons learnt from pavement failures and problems experienced during the last few years on a number of projects in India. Broadly, the activities include identification of defects and the possible cause there off, determination of appropriate remedial measures; implement these in the field and monitoring of the results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Flexible%20Pavements" title="Flexible Pavements">Flexible Pavements</a>, <a href="https://publications.waset.org/abstracts/search?q=Rigid%20Pavements" title=" Rigid Pavements"> Rigid Pavements</a>, <a href="https://publications.waset.org/abstracts/search?q=Defects" title=" Defects"> Defects</a>, <a href="https://publications.waset.org/abstracts/search?q=Maintenance" title=" Maintenance"> Maintenance</a> </p> <a href="https://publications.waset.org/abstracts/120797/pavement-failures-and-its-maintenance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/120797.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">7131</span> An Approximation Algorithm for the Non Orthogonal Cutting Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20Ouafi">R. Ouafi</a>, <a href="https://publications.waset.org/abstracts/search?q=F.%20Ouafi"> F. Ouafi </a> </p> <p class="card-text"><strong>Abstract:</strong></p> We study the problem of cutting a rectangular material entity into smaller sub-entities of trapezoidal forms with minimum waste of the material. This problem will be denoted TCP (Trapezoidal Cutting Problem). The TCP has many applications in manufacturing processes of various industries: pipe line design (petro chemistry), the design of airfoil (aeronautical) or cuts of the components of textile products. We introduce an orthogonal build to provide the optimal horizontal and vertical homogeneous strips. In this paper we develop a general heuristic search based upon orthogonal build. By solving two one-dimensional knapsack problems, we combine the horizontal and vertical homogeneous strips to give a non orthogonal cutting pattern. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=combinatorial%20optimization" title="combinatorial optimization">combinatorial optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=cutting%20problem" title=" cutting problem"> cutting problem</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic" title=" heuristic"> heuristic</a> </p> <a href="https://publications.waset.org/abstracts/19497/an-approximation-algorithm-for-the-non-orthogonal-cutting-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19497.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">541</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">7130</span> Immersive Block Scheduling in Higher Education: A Case Study in Curriculum Reform and Increased Student Success</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Thomas%20Roche">Thomas Roche</a>, <a href="https://publications.waset.org/abstracts/search?q=Erica%20Wilson"> Erica Wilson</a>, <a href="https://publications.waset.org/abstracts/search?q=Elizabeth%20Goode"> Elizabeth Goode</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Universities across the globe are considering how to effect meaningful change in their higher education (HE) delivery in the face of increasingly diverse student cohorts and shifting student learning preferences. This paper reports on a descriptive case study of whole-of-institution curriculum reform at one regional Australian university, where more traditional 13-week semesters were replaced with a 6-week immersive block model drawing on active learning pedagogy. Based on a synthesis of literature in best practice HE pedagogy and principles, the case study draws on student performance data and senior management staff interviews (N = 5) to outline the key changes necessary for successful HE transformation to deliver increased student pass rates and retention. The findings from this case study indicate that an institutional transformation to an immersive block model requires both a considered change in institutional policy and process as well as the appropriate resourcing of roles, governance committees, technical solutions, and, importantly, communities of practice. Implications for practice at higher education institutions considering reforming their curriculum model are also discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=student%20retention" title="student retention">student retention</a>, <a href="https://publications.waset.org/abstracts/search?q=immersive%20scheduling" title=" immersive scheduling"> immersive scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=block%20model" title=" block model"> block model</a>, <a href="https://publications.waset.org/abstracts/search?q=curriculum%20reform" title=" curriculum reform"> curriculum reform</a>, <a href="https://publications.waset.org/abstracts/search?q=active%20learning" title=" active learning"> active learning</a>, <a href="https://publications.waset.org/abstracts/search?q=higher%20education%20pedagogy" title=" higher education pedagogy"> higher education pedagogy</a>, <a href="https://publications.waset.org/abstracts/search?q=higher%20education%20policy" title=" higher education policy"> higher education policy</a> </p> <a href="https://publications.waset.org/abstracts/176657/immersive-block-scheduling-in-higher-education-a-case-study-in-curriculum-reform-and-increased-student-success" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/176657.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">74</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">7129</span> Study on Resource Allocation of Cloud Operating System Based on Multi-Tenant Data Resource Sharing Technology</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lin%20Yunuo">Lin Yunuo</a>, <a href="https://publications.waset.org/abstracts/search?q=Seow%20Xing%20Quan"> Seow Xing Quan</a>, <a href="https://publications.waset.org/abstracts/search?q=Burra%20Venkata%20Durga%20Kumar"> Burra Venkata Durga Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this modern era, the cloud operating system is the world trend applied in various industries such as business, healthy, etc. In order to deal with the large capacity of requirements in cloud computing, research come up with multi-tenant cloud computing to maximize the benefits of server providers and clients. However, there are still issues in multi-tenant cloud computing especially regarding resource allocation. Issues such as inefficient resource utilization, large latency, lack of scalability and elasticity and poor data isolation had caused inefficient resource allocation in multi-tenant cloud computing. Without a doubt, these issues prevent multitenancy reaches its best condition. In fact, there are multiple studies conducted to determine the optimal resource allocation to solve these problems these days. This article will briefly introduce the cloud operating system, Multi-tenant cloud computing and resource allocation in cloud computing. It then discusses resource allocation in multi-tenant cloud computing and the current challenges it faces. According to the issue ‘ineffective resource utilization’, we will discuss an efficient dynamic scheduling technique for multitenancy, namely Multi-tenant Dynamic Resource Scheduling Model (MTDRSM). Moreover, there also have some recommendations to improve the shortcoming of this model in this paper’s final section. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title="cloud computing">cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud%20operation%20system" title=" cloud operation system"> cloud operation system</a>, <a href="https://publications.waset.org/abstracts/search?q=multitenancy" title=" multitenancy"> multitenancy</a>, <a href="https://publications.waset.org/abstracts/search?q=resource%20allocation" title=" resource allocation"> resource allocation</a>, <a href="https://publications.waset.org/abstracts/search?q=utilization%20of%20cloud%20resources" title=" utilization of cloud resources"> utilization of cloud resources</a> </p> <a href="https://publications.waset.org/abstracts/168893/study-on-resource-allocation-of-cloud-operating-system-based-on-multi-tenant-data-resource-sharing-technology" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/168893.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">7128</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">7127</span> Illegal Immigrants of Bangladesh in Malaysia and Present Situation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Md.%20Zahidul%20Islam">Md. Zahidul Islam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Illegal immigrants’ problem is a big problem all over the world including America. Malaysia is also facing this problem. Nowadays, it is turned into a major problem for Malaysia. Many illegal immigrants are staying in Malaysia from different countries such as Bangladesh, Myanmar, India, Pakistan, Indonesia, Vietnam, Thailand, Philippine, Nigeria. This article is only focusing on the present situation of illegal immigrants of Bangladesh. The aim of this article is to highlight how the Bangladeshi nationals are becoming an illegal immigrant in Malaysia. In the same time, this article also tries to identify the present situation of Bangladeshi illegal immigrants in Malaysia. The research will adopt qualitative methods of research. Both countries have to find a solution to solve this problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=illegal%20immigrants" title="illegal immigrants">illegal immigrants</a>, <a href="https://publications.waset.org/abstracts/search?q=present%20situation" title=" present situation"> present situation</a>, <a href="https://publications.waset.org/abstracts/search?q=Bangladesh" title=" Bangladesh"> Bangladesh</a>, <a href="https://publications.waset.org/abstracts/search?q=Malaysia" title=" Malaysia"> Malaysia</a> </p> <a href="https://publications.waset.org/abstracts/60512/illegal-immigrants-of-bangladesh-in-malaysia-and-present-situation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/60512.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">253</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">7126</span> On Transferring of Transient Signals along Hollow Waveguide</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=E.%20Eroglu">E. Eroglu</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Semsit"> S. Semsit</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Sener"> E. Sener</a>, <a href="https://publications.waset.org/abstracts/search?q=U.S.%20Sener"> U.S. Sener</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In Electromagnetics, there are three canonical boundary value problem with given initial conditions for the electromagnetic field sought, namely: Cavity Problem, Waveguide Problem, and External Problem. The Cavity Problem and Waveguide Problem were rigorously studied and new results were arised at original works in the past decades. In based on studies of an analytical time domain method Evolutionary Approach to Electromagnetics (EAE), electromagnetic field strength vectors produced by a time dependent source function are sought. The fields are took place in L2 Hilbert space. The source function that performs signal transferring, energy and surplus of energy has been demonstrated with all clarity. Depth of the method and ease of applications are emerged needs of gathering obtained results. Main discussion is about perfect electric conductor and hollow waveguide. Even if well studied time-domain modes problems are mentioned, specifically, the modes which have a hollow (i.e., medium-free) cross-section domain are considered. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=evolutionary%20approach%20to%20electromagnetics" title="evolutionary approach to electromagnetics">evolutionary approach to electromagnetics</a>, <a href="https://publications.waset.org/abstracts/search?q=time-domain%20waveguide%20mode" title=" time-domain waveguide mode"> time-domain waveguide mode</a>, <a href="https://publications.waset.org/abstracts/search?q=Neumann%20problem" title=" Neumann problem"> Neumann problem</a>, <a href="https://publications.waset.org/abstracts/search?q=Dirichlet%20boundary%20value%20problem" title=" Dirichlet boundary value problem"> Dirichlet boundary value problem</a>, <a href="https://publications.waset.org/abstracts/search?q=Klein-Gordon" title=" Klein-Gordon"> Klein-Gordon</a> </p> <a href="https://publications.waset.org/abstracts/42378/on-transferring-of-transient-signals-along-hollow-waveguide" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42378.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">329</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">7125</span> The Malfatti’s Problem in Reuleaux Triangle</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ching-Shoei%20Chiang">Ching-Shoei Chiang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Malfatti’s Problem is to ask for fitting 3 circles into a right triangle such that they are tangent to each other, and each circle is also tangent to a pair of the triangle’s side. This problem has been extended to any triangle (called general Malfatti’s Problem). Furthermore, the problem has been extended to have 1+2+…+n circles, we call it extended general Malfatti’s problem, these circles whose tangency graph, using the center of circles as vertices and the edge connect two circles center if these two circles tangent to each other, has the structure as Pascal’s triangle, and the exterior circles of these circles tangent to three sides of the triangle. In the extended general Malfatti’s problem, there are closed-form solutions for n=1, 2, and the problem becomes complex when n is greater than 2. In solving extended general Malfatti’s problem (n>2), we initially give values to the radii of all circles. From the tangency graph and current radii, we can compute angle value between two vectors. These vectors are from the center of the circle to the tangency points with surrounding elements, and these surrounding elements can be the boundary of the triangle or other circles. For each circle C, there are vectors from its center c to its tangency point with its neighbors (count clockwise) pi, i=0, 1,2,..,n. We add all angles between cpi to cp(i+1) mod (n+1), i=0,1,..,n, call it sumangle(C) for circle C. Using sumangle(C), we can reduce/enlarge the radii for all circles in next iteration, until sumangle(C) is equal to 2πfor all circles. With a similar idea, this paper proposed an algorithm to find the radii of circles whose tangency has the structure of Pascal’s triangle, and the exterior circles of these circles are tangent to the unit Realeaux Triangle. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Malfatti%E2%80%99s%20problem" title="Malfatti’s problem">Malfatti’s problem</a>, <a href="https://publications.waset.org/abstracts/search?q=geometric%20constraint%20solver" title=" geometric constraint solver"> geometric constraint solver</a>, <a href="https://publications.waset.org/abstracts/search?q=computer-aided%20geometric%20design" title=" computer-aided geometric design"> computer-aided geometric design</a>, <a href="https://publications.waset.org/abstracts/search?q=circle%20packing" title=" circle packing"> circle packing</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20visualization" title=" data visualization"> data visualization</a> </p> <a href="https://publications.waset.org/abstracts/148477/the-malfattis-problem-in-reuleaux-triangle" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/148477.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">131</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">7124</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">333</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">7123</span> Solution for Rider Ring Wear Problem in Boil off Gas Reciprocating Compressor: A Case Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hessam%20Mortezaei">Hessam Mortezaei</a>, <a href="https://publications.waset.org/abstracts/search?q=Saeid%20Joudakian"> Saeid Joudakian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the wear problem on rider rings of boil off gas compressor has been studied. This kind of oil free double acting compressor has free floating piston (FFP) technology and as a result of that it should have the lowest possible wear on its rider rings. But a design problem had caused a complete wear of rider rings after one month of continuous operation. In this case study, the source of this problem was recognized and solved. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=piston%20rider" title="piston rider">piston rider</a>, <a href="https://publications.waset.org/abstracts/search?q=rings" title=" rings"> rings</a>, <a href="https://publications.waset.org/abstracts/search?q=gas%20distribution" title=" gas distribution"> gas distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=pressure%20wear" title=" pressure wear"> pressure wear</a> </p> <a href="https://publications.waset.org/abstracts/3024/solution-for-rider-ring-wear-problem-in-boil-off-gas-reciprocating-compressor-a-case-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3024.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">366</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">7122</span> A Polynomial Time Clustering Algorithm for Solving the Assignment Problem in the Vehicle Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lydia%20Wahid">Lydia Wahid</a>, <a href="https://publications.waset.org/abstracts/search?q=Mona%20F.%20Ahmed"> Mona F. Ahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=Nevin%20Darwish"> Nevin Darwish</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The vehicle routing problem (VRP) consists of a group of customers that needs to be served. Each customer has a certain demand of goods. A central depot having a fleet of vehicles is responsible for supplying the customers with their demands. The problem is composed of two subproblems: The first subproblem is an assignment problem where the number of vehicles that will be used as well as the customers assigned to each vehicle are determined. The second subproblem is the routing problem in which for each vehicle having a number of customers assigned to it, the order of visits of the customers is determined. Optimal number of vehicles, as well as optimal total distance, should be achieved. In this paper, an approach for solving the first subproblem (the assignment problem) is presented. In the approach, a clustering algorithm is proposed for finding the optimal number of vehicles by grouping the customers into clusters where each cluster is visited by one vehicle. Finding the optimal number of clusters is NP-hard. This work presents a polynomial time clustering algorithm for finding the optimal number of clusters and solving the assignment problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=vehicle%20routing%20problems" title="vehicle routing problems">vehicle routing problems</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering%20algorithms" title=" clustering algorithms"> clustering algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=Clarke%20and%20Wright%20Saving%20Method" title=" Clarke and Wright Saving Method"> Clarke and Wright Saving Method</a>, <a href="https://publications.waset.org/abstracts/search?q=agglomerative%20hierarchical%20clustering" title=" agglomerative hierarchical clustering"> agglomerative hierarchical clustering</a> </p> <a href="https://publications.waset.org/abstracts/85552/a-polynomial-time-clustering-algorithm-for-solving-the-assignment-problem-in-the-vehicle-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/85552.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">393</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">7121</span> Mathematical Modeling for the Break-Even Point Problem in a Non-homogeneous System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Filipe%20Cardoso%20de%20Oliveira">Filipe Cardoso de Oliveira</a>, <a href="https://publications.waset.org/abstracts/search?q=Lino%20Marcos%20da%20Silva"> Lino Marcos da Silva</a>, <a href="https://publications.waset.org/abstracts/search?q=Ademar%20Nogueira%20do%20Nascimento"> Ademar Nogueira do Nascimento</a>, <a href="https://publications.waset.org/abstracts/search?q=Cristiano%20Hora%20de%20Oliveira%20Fontes"> Cristiano Hora de Oliveira Fontes</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This article presents a mathematical formulation for the production Break-Even Point problem in a non-homogeneous system. The optimization problem aims to obtain the composition of the best product mix in a non-homogeneous industrial plant, with the lowest cost until the breakeven point is reached. The problem constraints represent real limitations of a generic non-homogeneous industrial plant for n different products. The proposed model is able to solve the equilibrium point problem simultaneously for all products, unlike the existing approaches that propose a resolution in a sequential way, considering each product in isolation and providing a sub-optimal solution to the problem. The results indicate that the product mix found through the proposed model has economical advantages over the traditional approach used. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=branch%20and%20bound" title="branch and bound">branch and bound</a>, <a href="https://publications.waset.org/abstracts/search?q=break-even%20point" title=" break-even point"> break-even point</a>, <a href="https://publications.waset.org/abstracts/search?q=non-homogeneous%20production%20system" title=" non-homogeneous production system"> non-homogeneous production system</a>, <a href="https://publications.waset.org/abstracts/search?q=integer%20linear%20programming" title=" integer linear programming"> integer linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=management%20accounting" title=" management accounting"> management accounting</a> </p> <a href="https://publications.waset.org/abstracts/143328/mathematical-modeling-for-the-break-even-point-problem-in-a-non-homogeneous-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/143328.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">211</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">7120</span> Discrete Swarm with Passive Congregation for Cost Minimization of the Multiple Vehicle Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tarek%20Aboueldahab">Tarek Aboueldahab</a>, <a href="https://publications.waset.org/abstracts/search?q=Hanan%20Farag"> Hanan Farag</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cost minimization of Multiple Vehicle Routing Problem becomes a critical issue in the field of transportation because it is NP-hard optimization problem and the search space is complex. Many researches use the hybridization of artificial intelligence (AI) models to solve this problem; however, it can not guarantee to reach the best solution due to the difficulty of searching the whole search space. To overcome this problem, we introduce the hybrid model of Discrete Particle Swarm Optimization (DPSO) with a passive congregation which enable searching the whole search space to compromise between both local and global search. The practical experiment shows that our model obviously outperforms other hybrid models in cost minimization. <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=multi-vehicle%20routing%20problem" title=" multi-vehicle routing problem"> multi-vehicle routing problem</a>, <a href="https://publications.waset.org/abstracts/search?q=passive%20congregation" title=" passive congregation"> passive congregation</a>, <a href="https://publications.waset.org/abstracts/search?q=discrete%20swarm" title=" discrete swarm"> discrete swarm</a>, <a href="https://publications.waset.org/abstracts/search?q=passive%20congregation" title=" passive congregation"> passive congregation</a> </p> <a href="https://publications.waset.org/abstracts/157025/discrete-swarm-with-passive-congregation-for-cost-minimization-of-the-multiple-vehicle-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/157025.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">98</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">7119</span> Optimal Power Distribution and Power Trading Control among Loads in a Smart Grid Operated Industry</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vivek%20Upadhayay">Vivek Upadhayay</a>, <a href="https://publications.waset.org/abstracts/search?q=Siddharth%20Deshmukh"> Siddharth Deshmukh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years utilization of renewable energy sources has increased majorly because of the increase in global warming concerns. Organization these days are generally operated by Micro grid or smart grid on a small level. Power optimization and optimal load tripping is possible in a smart grid based industry. In any plant or industry loads can be divided into different categories based on their importance to the plant and power requirement pattern in the working days. Coming up with an idea to divide loads in different such categories and providing different power management algorithm to each category of load can reduce the power cost and can come handy in balancing stability and reliability of power. An objective function is defined which is subjected to a variable that we are supposed to minimize. Constraint equations are formed taking difference between the power usages pattern of present day and same day of previous week. By considering the objectives of minimal load tripping and optimal power distribution the proposed problem formulation is a multi-object optimization problem. Through normalization of each objective function, the multi-objective optimization is transformed to single-objective optimization. As a result we are getting the optimized values of power required to each load for present day by use of the past values of the required power for the same day of last week. It is quite a demand response scheduling of power. These minimized values then will be distributed to each load through an algorithm used to optimize the power distribution at a greater depth. In case of power storage exceeding the power requirement, profit can be made by selling exceeding power to the main grid. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=power%20flow%20optimization" title="power flow optimization">power flow optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20trading%20enhancement" title=" power trading enhancement"> power trading enhancement</a>, <a href="https://publications.waset.org/abstracts/search?q=smart%20grid" title=" smart grid"> smart grid</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-object%20optimization" title=" multi-object optimization"> multi-object optimization</a> </p> <a href="https://publications.waset.org/abstracts/21601/optimal-power-distribution-and-power-trading-control-among-loads-in-a-smart-grid-operated-industry" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21601.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">7118</span> Pre-Service Teachers’ Experiences and Attitude towards Children’s Problem Solving Strategies in Early Mathematics Learning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Temitayo%20%20Ogunsanwo">Temitayo Ogunsanwo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Problem-solving is an important way of learning way of learning because it propels children to use previous experiences to deal with new situations. The purpose of this study is to find out the attitude of pre-service teachers to problem-solving as a strategy for promoting early mathematics learning in children. This qualitative study employed a descriptive design to investigate the experiences of twenty second-year undergraduate early childhood education Pre-service teachers in a teaching practice and their attitude towards five-year-old children’s problem-solving strategies in mathematics. Pre-service teachers were exposed to different strategies for teaching children how to solve problems in mathematics. They were taken through a micro teaching in class using different strategies to teach problem-solving in different topics in the five-year-old mathematics curriculum. The students were then made to teach five-year-olds in neighbouring schools for three weeks, working in pairs, observing and recording children’s problem-solving activities and strategies. After the three weeks exercise, their experiences and attitude towards children’s problem-solving strategies were collected using open-ended questions and analysed in themes. Findings were discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=attitude" title="attitude">attitude</a>, <a href="https://publications.waset.org/abstracts/search?q=early%20mathematics%20learning" title=" early mathematics learning"> early mathematics learning</a>, <a href="https://publications.waset.org/abstracts/search?q=experience" title=" experience"> experience</a>, <a href="https://publications.waset.org/abstracts/search?q=pre-service%20teachers" title=" pre-service teachers"> pre-service teachers</a>, <a href="https://publications.waset.org/abstracts/search?q=problem-solving" title=" problem-solving"> problem-solving</a>, <a href="https://publications.waset.org/abstracts/search?q=strategies" title=" strategies"> strategies</a> </p> <a href="https://publications.waset.org/abstracts/60439/pre-service-teachers-experiences-and-attitude-towards-childrens-problem-solving-strategies-in-early-mathematics-learning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/60439.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">347</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">7117</span> Quoting Jobshops Due Dates Subject to Exogenous Factors in Developing Nations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Idris%20M.%20Olatunde">Idris M. Olatunde</a>, <a href="https://publications.waset.org/abstracts/search?q=Kareem%20B."> Kareem B.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In manufacturing systems, especially job shops, service performance is a key factor that determines customer satisfaction. Service performance depends not only on the quality of the output but on the delivery lead times as well. Besides product quality enhancement, delivery lead time must be minimized for optimal patronage. Quoting accurate due dates is sine quo non for job shop operational survival in a global competitive environment. Quoting accurate due dates in job shops has been a herculean task that nearly defiled solutions from many methods employed due to complex jobs routing nature of the system. This class of NP-hard problems possessed no rigid algorithms that can give an optimal solution. Jobshop operational problem is more complex in developing nations due to some peculiar factors. Operational complexity in job shops emanated from political instability, poor economy, technological know-how, and the non-promising socio-political environment. The mentioned exogenous factors were hardly considered in the previous studies on scheduling problem related to due date determination in job shops. This study has filled the gap created in the past studies by developing a dynamic model that incorporated the exogenous factors for accurate determination of due dates for varying jobs complexity. Real data from six job shops selected from the different part of Nigeria, were used to test the efficacy of the model, and the outcomes were analyzed statistically. The results of the analyzes showed that the model is more promising in determining accurate due dates than the traditional models deployed by many job shops in terms of patronage and lead times minimization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=due%20dates%20prediction" title="due dates prediction">due dates prediction</a>, <a href="https://publications.waset.org/abstracts/search?q=improved%20performance" title=" improved performance"> improved performance</a>, <a href="https://publications.waset.org/abstracts/search?q=customer%20satisfaction" title=" customer satisfaction"> customer satisfaction</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20model" title=" dynamic model"> dynamic model</a>, <a href="https://publications.waset.org/abstracts/search?q=exogenous%20factors" title=" exogenous factors"> exogenous factors</a>, <a href="https://publications.waset.org/abstracts/search?q=job%20shops" title=" job shops"> job shops</a> </p> <a href="https://publications.waset.org/abstracts/32968/quoting-jobshops-due-dates-subject-to-exogenous-factors-in-developing-nations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32968.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">7116</span> A New Approach for Generalized First Derivative of Nonsmooth Functions Using Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Mehdi%20Mazarei">Mohammad Mehdi Mazarei</a>, <a href="https://publications.waset.org/abstracts/search?q=Ali%20Asghar%20Behroozpoor"> Ali Asghar Behroozpoor</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we define an optimization problem corresponding to smooth and nonsmooth functions which its optimal solution is the first derivative of these functions in a domain. For this purpose, a linear programming problem corresponding to optimization problem is obtained. The optimal solution of this linear programming problem is the approximate generalized first derivative. In fact, we approximate generalized first derivative of nonsmooth functions as tailor series. We show the efficiency of our approach by some smooth and nonsmooth functions in some examples. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=general%20derivative" title="general derivative">general derivative</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20programming" title=" linear programming"> linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization%20problem" title=" optimization problem"> optimization problem</a>, <a href="https://publications.waset.org/abstracts/search?q=smooth%20and%20nonsmooth%20functions" title=" smooth and nonsmooth functions"> smooth and nonsmooth functions</a> </p> <a href="https://publications.waset.org/abstracts/19425/a-new-approach-for-generalized-first-derivative-of-nonsmooth-functions-using-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19425.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">557</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">7115</span> A Novel Meta-Heuristic Algorithm Based on Cloud Theory for Redundancy Allocation Problem under Realistic Condition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=H.%20Mousavi">H. Mousavi</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Sharifi"> M. Sharifi</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20Pourvaziri"> H. Pourvaziri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Redundancy Allocation Problem (RAP) is a well-known mathematical problem for modeling series-parallel systems. It is a combinatorial optimization problem which focuses on determining an optimal assignment of components in a system design. In this paper, to be more practical, we have considered the problem of redundancy allocation of series system with interval valued reliability of components. Therefore, during the search process, the reliabilities of the components are considered as a stochastic variable with a lower and upper bounds. In order to optimize the problem, we proposed a simulated annealing based on cloud theory (CBSAA). Also, the Monte Carlo simulation (MCS) is embedded to the CBSAA to handle the random variable components’ reliability. This novel approach has been investigated by numerical examples and the experimental results have shown that the CBSAA combining MCS is an efficient tool to solve the RAP of systems with interval-valued component reliabilities. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=redundancy%20allocation%20problem" title="redundancy allocation problem">redundancy allocation problem</a>, <a href="https://publications.waset.org/abstracts/search?q=simulated%20annealing" title=" simulated annealing"> simulated annealing</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud%20theory" title=" cloud theory"> cloud theory</a>, <a href="https://publications.waset.org/abstracts/search?q=monte%20carlo%20simulation" title=" monte carlo simulation"> monte carlo simulation</a> </p> <a href="https://publications.waset.org/abstracts/33681/a-novel-meta-heuristic-algorithm-based-on-cloud-theory-for-redundancy-allocation-problem-under-realistic-condition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33681.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> <ul class="pagination"> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bus%20scheduling%20problem&page=9" rel="prev">&lsaquo;</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bus%20scheduling%20problem&page=1">1</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bus%20scheduling%20problem&page=2">2</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bus%20scheduling%20problem&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bus%20scheduling%20problem&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bus%20scheduling%20problem&page=9">9</a></li> <li class="page-item active"><span class="page-link">10</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bus%20scheduling%20problem&page=11">11</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bus%20scheduling%20problem&page=12">12</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bus%20scheduling%20problem&page=13">13</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bus%20scheduling%20problem&page=247">247</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bus%20scheduling%20problem&page=248">248</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bus%20scheduling%20problem&page=11" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>