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: Solve Elmstahl</title> <meta name="description" content="Search results for: Solve Elmstahl"> <meta name="keywords" content="Solve Elmstahl"> <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="Solve Elmstahl" 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="Solve Elmstahl"> <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> 1731</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: Solve Elmstahl</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1731</span> Family Caregiver Transitions and Health in Old Age: A Longitudinal Perspective </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Cecilia%20Fagerstrom">Cecilia Fagerstrom</a>, <a href="https://publications.waset.org/abstracts/search?q=Solve%20Elmstahl"> Solve Elmstahl</a>, <a href="https://publications.waset.org/abstracts/search?q=Lena%20S.%20Wranker"> Lena S. Wranker</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The conditions of increased morbidity in an aging population cause the need for family care to become more common at an advanced age. The role of family caregivers may well last for a long time but may also change over time, from being caregivers to being non-caregivers or vice versa. Although demands associated with family caring change as individuals enter into, engage with, and exit from this role, the evidence regarding the impact of family caregiving transitions on the health of older carers is still limited. This study comprised individuals (n=2294, 60+years) from the southern part of Sweden included in the project Swedish National study of Aging and Care. Caregiving transitions are discussed in the categories: enter, exit, and continuing during a six-year period. Individuals who exited caregiving during the time were older than those who continued or entered into the role of caregiving. At the six-year follow-up, caregivers who were continuing or had exited caregiving were more often worried about their own health compared to baseline. Resembling findings were not found in those who entered caregiving. Family caregiving transitions of exiting, entering or continuing had no effect on the individuals’ functional, physical and mental health expect for participants who entered in caregiving. For them, entering the role of family caregiving was associated with an improvement in physical health during the six years follow up period. Conclusion: Although the health impact of different caregiving transitions in late life does not differ, individual conditions and health at baseline are important parameters to take into consideration to improve long-term health in family caregivers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=family%20caregiving" title="family caregiving">family caregiving</a>, <a href="https://publications.waset.org/abstracts/search?q=health" title=" health"> health</a>, <a href="https://publications.waset.org/abstracts/search?q=old%20age" title=" old age"> old age</a>, <a href="https://publications.waset.org/abstracts/search?q=transition" title=" transition"> transition</a> </p> <a href="https://publications.waset.org/abstracts/92388/family-caregiver-transitions-and-health-in-old-age-a-longitudinal-perspective" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92388.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">219</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">1730</span> Cutting Plane Methods for Integer Programming: NAZ Cut and Its Variations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Bari">A. Bari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Integer programming is a branch of mathematical programming techniques in operations research in which some or all of the variables are required to be integer valued. Various cuts have been used to solve these problems. We have also developed cuts known as NAZ cut & A-T cut to solve the integer programming problems. These cuts are used to reduce the feasible region and then reaching the optimal solution in minimum number of steps. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Integer%20Programming" title="Integer Programming">Integer Programming</a>, <a href="https://publications.waset.org/abstracts/search?q=NAZ%20cut" title=" NAZ cut"> NAZ cut</a>, <a href="https://publications.waset.org/abstracts/search?q=A-T%20cut" title=" A-T cut"> A-T cut</a>, <a href="https://publications.waset.org/abstracts/search?q=Cutting%20plane%20method" title=" Cutting plane method"> Cutting plane method</a> </p> <a href="https://publications.waset.org/abstracts/8763/cutting-plane-methods-for-integer-programming-naz-cut-and-its-variations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8763.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">364</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">1729</span> Understanding Evolutionary Algorithms through Interactive Graphical Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Javier%20Barrachina">Javier Barrachina</a>, <a href="https://publications.waset.org/abstracts/search?q=Piedad%20Garrido"> Piedad Garrido</a>, <a href="https://publications.waset.org/abstracts/search?q=Manuel%20Fogue"> Manuel Fogue</a>, <a href="https://publications.waset.org/abstracts/search?q=Julio%20A.%20Sanguesa"> Julio A. Sanguesa</a>, <a href="https://publications.waset.org/abstracts/search?q=Francisco%20J.%20Martinez"> Francisco J. Martinez</a> </p> <p class="card-text"><strong>Abstract:</strong></p> It is very common to observe, especially in Computer Science studies that students have difficulties to correctly understand how some mechanisms based on Artificial Intelligence work. In addition, the scope and limitations of most of these mechanisms are usually presented by professors only in a theoretical way, which does not help students to understand them adequately. In this work, we focus on the problems found when teaching Evolutionary Algorithms (EAs), which imitate the principles of natural evolution, as a method to solve parameter optimization problems. Although this kind of algorithms can be very powerful to solve relatively complex problems, students often have difficulties to understand how they work, and how to apply them to solve problems in real cases. In this paper, we present two interactive graphical applications which have been specially designed with the aim of making Evolutionary Algorithms easy to be understood by students. Specifically, we present: (i) TSPS, an application able to solve the ”Traveling Salesman Problem”, and (ii) FotEvol, an application able to reconstruct a given image by using Evolution Strategies. The main objective is that students learn how these techniques can be implemented, and the great possibilities they offer. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=education" title="education">education</a>, <a href="https://publications.waset.org/abstracts/search?q=evolutionary%20algorithms" title=" evolutionary algorithms"> evolutionary algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=evolution%20strategies" title=" evolution strategies"> evolution strategies</a>, <a href="https://publications.waset.org/abstracts/search?q=interactive%20learning%20applications" title=" interactive learning applications"> interactive learning applications</a> </p> <a href="https://publications.waset.org/abstracts/38035/understanding-evolutionary-algorithms-through-interactive-graphical-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/38035.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">338</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">1728</span> Solving Flowshop Scheduling Problems with Ant Colony Optimization Heuristic</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Arshad%20Mehmood%20Ch">Arshad Mehmood Ch</a>, <a href="https://publications.waset.org/abstracts/search?q=Riaz%20Ahmad"> Riaz Ahmad</a>, <a href="https://publications.waset.org/abstracts/search?q=Imran%20Ali%20Ch"> Imran Ali Ch</a>, <a href="https://publications.waset.org/abstracts/search?q=Waqas%20Durrani"> Waqas Durrani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study deals with the application of Ant Colony Optimization (ACO) approach to solve no-wait ﬂowshop scheduling problem (NW-FSSP). ACO algorithm so developed has been coded on Matlab computer application. The paper covers detailed steps to apply ACO and focuses on judging the strength of ACO in relation to other solution techniques previously applied to solve no-wait flowshop problem. The general purpose approach was able to find reasonably accurate solutions for almost all the problems under consideration and was able to handle a fairly large spectrum of problems with far reduced CPU effort. Careful scrutiny of the results reveals that the algorithm presented results better than other approaches like Genetic algorithm and Tabu Search heuristics etc; earlier applied to solve NW-FSSP data sets. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=no-wait" title="no-wait">no-wait</a>, <a href="https://publications.waset.org/abstracts/search?q=%EF%AC%82owshop" title=" ﬂowshop"> ﬂowshop</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20optimization%20%28ACO%29" title=" ant colony optimization (ACO)"> ant colony optimization (ACO)</a>, <a href="https://publications.waset.org/abstracts/search?q=makespan" title=" makespan"> makespan</a> </p> <a href="https://publications.waset.org/abstracts/9974/solving-flowshop-scheduling-problems-with-ant-colony-optimization-heuristic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9974.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">433</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">1727</span> The Relationship among Lifestyles, Accompany Forms, and Children’s Capability to Solve Problems of Modern Families</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tien-Ling%20Yeh">Tien-Ling Yeh</a>, <a href="https://publications.waset.org/abstracts/search?q=Jo-Han%20Chan"> Jo-Han Chan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The percentage of dual-earner couples has become higher and higher each year. Family lifestyles in Taiwan have also been changing. This fact reflects the importance of family communication and parent-child relationship. This study aimed to explore the influences of family lifestyles and accompany forms on children’s capability to solve problems. The research process included two phases: (1) literature review, to explore the characteristics of children’s capability to solve problems and methods to measure this capability; and (2) questionnaire analyses, to explore the influences of lifestyles and accompany time and forms of modern families on their children’s capability to solve problems. The questionnaires were issued in October and November, 2016. A total of 300 questionnaires were retrieved, among which 250 were valid. The findings are summarized below: -The linguistic performances of the children from families of the busy and haggling lifestyle or the intermittent childcare lifestyle were rather good. Besides being interested in learning, these children could solve problems or difficulties independently. -The capability to ‘analyze problems’ of children from families with accompanying time during 19:00-19:30 (family dinner time) or 22:00-23:30 (before bedtime) was good. When facing a complex problem, these children could identify the most important factor in the problem. When seeing a problem, they would first look for the cause. If they encountered a bottleneck while solving a problem, they would review the context of the problem and related conditions to come up with another solution. -According to the literature, learning toys with numbers and symbols to learn to read can help develop children’s logic thinking, which is helpful to solve problems. Interestingly, some study suggested that children playing with fluid constructive toys are less likely to give up what they are doing and more likely to identify problems in their daily life. Some of them can even come up with creative and effective solutions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=accompany" title="accompany">accompany</a>, <a href="https://publications.waset.org/abstracts/search?q=lifestyle" title=" lifestyle"> lifestyle</a>, <a href="https://publications.waset.org/abstracts/search?q=parent-child" title=" parent-child"> parent-child</a>, <a href="https://publications.waset.org/abstracts/search?q=problem-solving" title=" problem-solving"> problem-solving</a> </p> <a href="https://publications.waset.org/abstracts/98462/the-relationship-among-lifestyles-accompany-forms-and-childrens-capability-to-solve-problems-of-modern-families" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/98462.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">117</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">1726</span> Investigation a New Approach "AGM" to Solve of Complicate Nonlinear Partial Differential Equations at All Engineering Field and Basic Science</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammadreza%20Akbari">Mohammadreza Akbari</a>, <a href="https://publications.waset.org/abstracts/search?q=Pooya%20Soleimani%20Besheli"> Pooya Soleimani Besheli</a>, <a href="https://publications.waset.org/abstracts/search?q=Reza%20Khalili"> Reza Khalili</a>, <a href="https://publications.waset.org/abstracts/search?q=Davood%20Domiri%20Danji"> Davood Domiri Danji</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this conference, our aims are accuracy, capabilities and power at solving of the complicated non-linear partial differential. Our purpose is to enhance the ability to solve the mentioned nonlinear differential equations at basic science and engineering field and similar issues with a simple and innovative approach. As we know most of engineering system behavior in practical are nonlinear process (especially basic science and engineering field, etc.) and analytical solving (no numeric) these problems are difficult, complex, and sometimes impossible like (Fluids and Gas wave, these problems can't solve with numeric method, because of no have boundary condition) accordingly in this symposium we are going to exposure an innovative approach which we have named it Akbari-Ganji's Method or AGM in engineering, that can solve sets of coupled nonlinear differential equations (ODE, PDE) with high accuracy and simple solution and so this issue will emerge after comparing the achieved solutions by Numerical method (Runge-Kutta 4th). Eventually, AGM method will be proved that could be created huge evolution for researchers, professors and students in whole over the world, because of AGM coding system, so by using this software we can analytically solve all complicated linear and nonlinear partial differential equations, with help of that there is no difficulty for solving all nonlinear differential equations. Advantages and ability of this method (AGM) as follow: (a) Non-linear Differential equations (ODE, PDE) are directly solvable by this method. (b) In this method (AGM), most of the time, without any dimensionless procedure, we can solve equation(s) by any boundary or initial condition number. (c) AGM method always is convergent in boundary or initial condition. (d) Parameters of exponential, Trigonometric and Logarithmic of the existent in the non-linear differential equation with AGM method no needs Taylor expand which are caused high solve precision. (e) AGM method is very flexible in the coding system, and can solve easily varieties of the non-linear differential equation at high acceptable accuracy. (f) One of the important advantages of this method is analytical solving with high accuracy such as partial differential equation in vibration in solids, waves in water and gas, with minimum initial and boundary condition capable to solve problem. (g) It is very important to present a general and simple approach for solving most problems of the differential equations with high non-linearity in engineering sciences especially at civil engineering, and compare output with numerical method (Runge-Kutta 4th) and Exact solutions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=new%20approach" title="new approach">new approach</a>, <a href="https://publications.waset.org/abstracts/search?q=AGM" title=" AGM"> AGM</a>, <a href="https://publications.waset.org/abstracts/search?q=sets%20of%20coupled%20nonlinear%20differential%20equation" title=" sets of coupled nonlinear differential equation"> sets of coupled nonlinear differential equation</a>, <a href="https://publications.waset.org/abstracts/search?q=exact%20solutions" title=" exact solutions"> exact solutions</a>, <a href="https://publications.waset.org/abstracts/search?q=numerical" title=" numerical"> numerical</a> </p> <a href="https://publications.waset.org/abstracts/32459/investigation-a-new-approach-agm-to-solve-of-complicate-nonlinear-partial-differential-equations-at-all-engineering-field-and-basic-science" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32459.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">463</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">1725</span> A Retrievable Genetic Algorithm for Efficient Solving of Sudoku Puzzles</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seyed%20Mehran%20Kazemi">Seyed Mehran Kazemi</a>, <a href="https://publications.waset.org/abstracts/search?q=Bahare%20Fatemi"> Bahare Fatemi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Sudoku is a logic-based combinatorial puzzle game which is popular among people of different ages. Due to this popularity, computer softwares are being developed to generate and solve Sudoku puzzles with different levels of difficulty. Several methods and algorithms have been proposed and used in different softwares to efficiently solve Sudoku puzzles. Various search methods such as stochastic local search have been applied to this problem. Genetic Algorithm (GA) is one of the algorithms which have been applied to this problem in different forms and in several works in the literature. In these works, chromosomes with little or no information were considered and obtained results were not promising. In this paper, we propose a new way of applying GA to this problem which uses more-informed chromosomes than other works in the literature. We optimize the parameters of our GA using puzzles with different levels of difficulty. Then we use the optimized values of the parameters to solve various puzzles and compare our results to another GA-based method for solving Sudoku puzzles. <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=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=solving%20Sudoku%20puzzles" title=" solving Sudoku puzzles"> solving Sudoku puzzles</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20local%20search" title=" stochastic local search"> stochastic local search</a> </p> <a href="https://publications.waset.org/abstracts/8411/a-retrievable-genetic-algorithm-for-efficient-solving-of-sudoku-puzzles" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8411.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">423</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">1724</span> Metaheuristics to Solve Tasks Scheduling</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rachid%20Ziteuni">Rachid Ziteuni</a>, <a href="https://publications.waset.org/abstracts/search?q=Selt%20Omar"> Selt Omar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a new polynomial metaheuristic elaboration (tabu search) for solving scheduling problems. This method allows us to solve the scheduling problem of n tasks on m identical parallel machines with unavailability periods. This problem is NP-complete in the strong sens and finding an optimal solution appears unlikely. Note that all data in this problem are integer and deterministic. The performance criterion to optimize in this problem which we denote Pm/N-c/summs of (wjCj) is the weighted sum of the end dates of tasks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=scheduling" title="scheduling">scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20identical%20machines" title=" parallel identical machines"> parallel identical machines</a>, <a href="https://publications.waset.org/abstracts/search?q=unavailability%20periods" title=" unavailability periods"> unavailability periods</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristic" title=" metaheuristic"> metaheuristic</a>, <a href="https://publications.waset.org/abstracts/search?q=tabu%20search" title=" tabu search"> tabu search</a> </p> <a href="https://publications.waset.org/abstracts/5635/metaheuristics-to-solve-tasks-scheduling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5635.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">330</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">1723</span> Designing and Evaluating Pedagogic Conversational Agents to Teach Children</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Silvia%20Tamayo-Moreno">Silvia Tamayo-Moreno</a>, <a href="https://publications.waset.org/abstracts/search?q=Diana%20P%C3%A9rez-Mar%C3%ADn"> Diana Pérez-Marín </a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the possibility of children studying by using an interactive learning technology called Pedagogic Conversational Agent is presented. The main benefit is that the agent is able to adapt the dialogue to each student and to provide automatic feedback. Moreover, according to Math teachers, in many cases students are unable to solve the problems even knowing the procedure to solve them, because they do not understand what they have to do. The hypothesis is that if students are helped to understand what they have to solve, they will be able to do it. Taken that into account, we have started the development of Dr. Roland, an agent to help students understand Math problems following a User-Centered Design methodology. The use of this methodology is proposed, for the first time, to design pedagogic agents to teach any subject from Secondary down to Pre-Primary education. The reason behind proposing a methodology is that while working on this project, we noticed the lack of literature to design and evaluate agents. To cover this gap, we describe how User-Centered Design can be applied, and which usability techniques can be applied to evaluate the agent. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pedagogic%20conversational%20agent" title="pedagogic conversational agent">pedagogic conversational agent</a>, <a href="https://publications.waset.org/abstracts/search?q=human-computer%20interaction" title=" human-computer interaction"> human-computer interaction</a>, <a href="https://publications.waset.org/abstracts/search?q=user-centered%20design" title=" user-centered design"> user-centered design</a>, <a href="https://publications.waset.org/abstracts/search?q=natural%20language%20interface" title=" natural language interface"> natural language interface</a> </p> <a href="https://publications.waset.org/abstracts/67170/designing-and-evaluating-pedagogic-conversational-agents-to-teach-children" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67170.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">323</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">1722</span> Scrutiny and Solving Analytically Nonlinear Differential at Engineering Field of Fluids, Heat, Mass and Wave by New Method AGM</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammadreza%20Akbari">Mohammadreza Akbari</a>, <a href="https://publications.waset.org/abstracts/search?q=Sara%20Akbari"> Sara Akbari</a>, <a href="https://publications.waset.org/abstracts/search?q=Davood%20Domiri%20Ganji"> Davood Domiri Ganji</a>, <a href="https://publications.waset.org/abstracts/search?q=Pooya%20Solimani"> Pooya Solimani</a>, <a href="https://publications.waset.org/abstracts/search?q=Reza%20Khalili"> Reza Khalili</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As all experts know most of engineering system behavior in practical are nonlinear process (especially heat, fluid and mass, etc.) and analytical solving (no numeric) these problems are difficult, complex and sometimes impossible like (fluids and gas wave, these problems can't solve with numeric method, because of no have boundary condition) accordingly in this symposium we are going to exposure a innovative approach which we have named it Akbari-Ganji's Method or AGM in engineering, that can solve sets of coupled nonlinear differential equations (ODE, PDE) with high accuracy and simple solution and so this issue will be emerged after comparing the achieved solutions by Numerical method (Runge-Kutte 4th) and so compare to other methods such as HPM, ADM,… and exact solutions. Eventually, AGM method will be proved that could be created huge evolution for researchers, professors and students (engineering and basic science) in whole over the world, because of AGM coding system, so by using this software we can analytically solve all complicated linear and nonlinear differential equations, with help of that there is no difficulty for solving nonlinear differential equations(ODE and PDE). In this paper, we investigate and solve 4 types of the nonlinear differential equation with AGM method : 1-Heat and fluid, 2-Unsteady state of nonlinear partial differential, 3-Coupled nonlinear partial differential in wave equation, and 4-Nonlinear integro-differential equation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=new%20method%20AGM" title="new method AGM">new method AGM</a>, <a href="https://publications.waset.org/abstracts/search?q=sets%20of%20coupled%20nonlinear%20equations%20at%20engineering%20field" title=" sets of coupled nonlinear equations at engineering field"> sets of coupled nonlinear equations at engineering field</a>, <a href="https://publications.waset.org/abstracts/search?q=waves%20equations" title=" waves equations"> waves equations</a>, <a href="https://publications.waset.org/abstracts/search?q=integro-differential" title=" integro-differential"> integro-differential</a>, <a href="https://publications.waset.org/abstracts/search?q=fluid%20and%20thermal" title=" fluid and thermal"> fluid and thermal</a> </p> <a href="https://publications.waset.org/abstracts/36022/scrutiny-and-solving-analytically-nonlinear-differential-at-engineering-field-of-fluids-heat-mass-and-wave-by-new-method-agm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36022.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">546</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">1721</span> A Multidimensional Genetic Algorithm Applicable for Our VRP Variant Dealing with the Problems of Infrastructure Defaults SVRDP-CMTW: “Safety Vehicle Routing Diagnosis Problem with Control and Modified Time Windows”</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ben%20Mansour%20Mouin">Ben Mansour Mouin</a>, <a href="https://publications.waset.org/abstracts/search?q=Elloumi%20Abdelkarim"> Elloumi Abdelkarim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We will discuss the problem of routing a fleet of different vehicles from a central depot to different types of infrastructure-defaults with dynamic maintenance requests, modified time windows, and control of default maintained. For this reason, we propose a modified metaheuristicto to solve our mathematical model. SVRDP-CMTW is a variant VRP of an optimal vehicle plan that facilitates the maintenance task of different types of infrastructure-defaults. This task will be monitored after the maintenance, based on its priorities, the degree of danger associated with each default, and the neighborhood at the black-spots. We will present, in this paper, a multidimensional genetic algorithm “MGA” by detailing its characteristics, proposed mechanisms, and roles in our work. The coding of this algorithm represents the necessary parameters that characterize each infrastructure-default with the objective of minimizing a combination of cost, distance and maintenance times while satisfying the priority levels of the most urgent defaults. The developed algorithm will allow the dynamic integration of newly detected defaults at the execution time. This result will be displayed in our programmed interactive system at the routing time. This multidimensional genetic algorithm replaces N genetic algorithm to solve P different type problems of infrastructure defaults (instead of N algorithm for P problem we can solve in one multidimensional algorithm simultaneously who can solve all these problemsatonce). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mathematical%20model" title="mathematical model">mathematical model</a>, <a href="https://publications.waset.org/abstracts/search?q=VRP" title=" VRP"> VRP</a>, <a href="https://publications.waset.org/abstracts/search?q=multidimensional%20genetic%20algorithm" title=" multidimensional genetic algorithm"> multidimensional genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristics" title=" metaheuristics"> metaheuristics</a> </p> <a href="https://publications.waset.org/abstracts/141979/a-multidimensional-genetic-algorithm-applicable-for-our-vrp-variant-dealing-with-the-problems-of-infrastructure-defaults-svrdp-cmtw-safety-vehicle-routing-diagnosis-problem-with-control-and-modified-time-windows" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/141979.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">196</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">1720</span> A Combined Meta-Heuristic with Hyper-Heuristic Approach to Single Machine Production Scheduling Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=C.%20E.%20Nugraheni">C. E. Nugraheni</a>, <a href="https://publications.waset.org/abstracts/search?q=L.%20Abednego"> L. Abednego</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper is concerned with minimization of mean tardiness and flow time in a real single machine production scheduling problem. Two variants of genetic algorithm as meta-heuristic are combined with hyper-heuristic approach are proposed to solve this problem. These methods are used to solve instances generated with real world data from a company. Encouraging results are reported. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hyper-heuristics" title="hyper-heuristics">hyper-heuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=evolutionary%20algorithms" title=" evolutionary algorithms"> evolutionary algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=production%20scheduling" title=" production scheduling"> production scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=meta-heuristic" title=" meta-heuristic"> meta-heuristic</a> </p> <a href="https://publications.waset.org/abstracts/12732/a-combined-meta-heuristic-with-hyper-heuristic-approach-to-single-machine-production-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12732.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">381</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">1719</span> Study and Solving Partial Differential Equation of Danel Equation in the Vibration Shells </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hesamoddin%20Abdollahpour">Hesamoddin Abdollahpour</a>, <a href="https://publications.waset.org/abstracts/search?q=Roghayeh%20Abdollahpour"> Roghayeh Abdollahpour</a>, <a href="https://publications.waset.org/abstracts/search?q=Elham%20Rahgozar"> Elham Rahgozar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper we deal with an analysis of the free vibrations of the governing partial differential equation that it is Danel equation in the shells. The problem considered represents the governing equation of the nonlinear, large amplitude free vibrations of the hinged shell. A new implementation of the new method is presented to obtain natural frequency and corresponding displacement on the shell. Our purpose is to enhance the ability to solve the mentioned complicated partial differential equation (PDE) with a simple and innovative approach. The results reveal that this new method to solve Danel equation is very effective and simple, and can be applied to other nonlinear partial differential equations. It is necessary to mention that there are some valuable advantages in this way of solving nonlinear differential equations and also most of the sets of partial differential equations can be answered in this manner which in the other methods they have not had acceptable solutions up to now. We can solve equation(s), and consequently, there is no need to utilize similarity solutions which make the solution procedure a time-consuming task. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=large%20amplitude" title="large amplitude">large amplitude</a>, <a href="https://publications.waset.org/abstracts/search?q=free%20vibrations" title=" free vibrations"> free vibrations</a>, <a href="https://publications.waset.org/abstracts/search?q=analytical%20solution" title=" analytical solution"> analytical solution</a>, <a href="https://publications.waset.org/abstracts/search?q=Danell%20Equation" title=" Danell Equation"> Danell Equation</a>, <a href="https://publications.waset.org/abstracts/search?q=diagram%20of%20phase%20plane" title=" diagram of phase plane "> diagram of phase plane </a> </p> <a href="https://publications.waset.org/abstracts/66849/study-and-solving-partial-differential-equation-of-danel-equation-in-the-vibration-shells" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/66849.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">320</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">1718</span> Benders Decomposition Approach to Solve the Hybrid Flow Shop Scheduling Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ebrahim%20Asadi-Gangraj">Ebrahim Asadi-Gangraj</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Hybrid flow shop scheduling problem (HFS) contains sequencing in a flow shop where, at any stage, there exist one or more related or unrelated parallel machines. This production system is a common manufacturing environment in many real industries, such as the steel manufacturing, ceramic tile manufacturing, and car assembly industries. In this research, a mixed integer linear programming (MILP) model is presented for the hybrid flow shop scheduling problem, in which, the objective consists of minimizing the maximum completion time (makespan). For this purpose, a Benders Decomposition (BD) method is developed to solve the research problem. The proposed approach is tested on some test problems, small to moderate scale. The experimental results show that the Benders decomposition approach can solve the hybrid flow shop scheduling problem in a reasonable time, especially for small and moderate-size test problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hybrid%20flow%20shop" title="hybrid flow shop">hybrid flow shop</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20linear%20programming" title=" mixed integer linear programming"> mixed integer linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=Benders%20decomposition" title=" Benders decomposition"> Benders decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=makespan" title=" makespan"> makespan</a> </p> <a href="https://publications.waset.org/abstracts/106041/benders-decomposition-approach-to-solve-the-hybrid-flow-shop-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/106041.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">188</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1717</span> Generic Model for Timetabling Problems by Integer Linear Programmimg Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nur%20Aidya%20Hanum%20Aizam">Nur Aidya Hanum Aizam</a>, <a href="https://publications.waset.org/abstracts/search?q=Vikneswary%20Uvaraja"> Vikneswary Uvaraja</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The agenda of showing the scheduled time for performing certain tasks is known as timetabling. It widely used in many departments such as transportation, education, and production. Some difficulties arise to ensure all tasks happen in the time and place allocated. Therefore, many researchers invented various programming model to solve the scheduling problems from several fields. However, the studies in developing the general integer programming model for many timetabling problems are still questionable. Meanwhile, this thesis describe about creating a general model which solve different types of timetabling problems by considering the basic constraints. Initially, the common basic constraints from five different fields are selected and analyzed. A general basic integer programming model was created and then verified by using the medium set of data obtained randomly which is much similar to realistic data. The mathematical software, AIMMS with CPLEX as a solver has been used to solve the model. The model obtained is significant in solving many timetabling problems easily since it is modifiable to all types of scheduling problems which have same basic constraints. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=AIMMS%20mathematical%20software" title="AIMMS mathematical software">AIMMS mathematical software</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=scheduling%20problems" title=" scheduling problems"> scheduling problems</a>, <a href="https://publications.waset.org/abstracts/search?q=timetabling" title=" timetabling"> timetabling</a> </p> <a href="https://publications.waset.org/abstracts/35712/generic-model-for-timetabling-problems-by-integer-linear-programmimg-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35712.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">436</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">1716</span> Students' Ability to Solve Complex Accounting Problems Using a Framework-Based Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Karen%20Odendaal">Karen Odendaal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Accounting transactions are becoming more complex, and more extensive accounting guidance is provided on a continuous basis. It is widely perceived that conceptual teaching of accounting contributes to lifelong learning. Such a conceptual teaching approach also contributes to effective accounting problem-solving. This framework-based approach is rooted in educational psychologies such as constructivism and Ausubel’s subsumption theory. This study aimed at investigating the ability of students to solve complex accounting problems by using only concepts underlying the Conceptual Framework. An assignment was administered to pre-graduate students at a South African university and this study made use of an interpretative research design which implemented multiple research instruments to investigate the ability of students to solve complex accounting problems using only concepts underlying the Conceptual Framework. Student perceptions were analysed and were aided by a related reflective questionnaire. The importance of the study indicates the necessity of Accounting educators to enhance a conceptual understanding among students as a mechanism for problem-solving of accounting issues. The results indicate that the ability of students to solve accounting problems effectively using only the Conceptual Framework depends on the complexity of the scenario and the students’ familiarity with the problem. The study promotes a balanced and more conceptual (rather than only technical) preference to the problem-solving of complex accounting problems. The study indubitably promotes considerable emphasis on the importance of the Conceptual Framework in accounting education and the promotion of life-long learning in the subject field. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=accounting%20education" title="accounting education">accounting education</a>, <a href="https://publications.waset.org/abstracts/search?q=conceptual%20teaching" title=" conceptual teaching"> conceptual teaching</a>, <a href="https://publications.waset.org/abstracts/search?q=constructivism" title=" constructivism"> constructivism</a>, <a href="https://publications.waset.org/abstracts/search?q=framework-based" title=" framework-based"> framework-based</a>, <a href="https://publications.waset.org/abstracts/search?q=problem-solving" title=" problem-solving"> problem-solving</a> </p> <a href="https://publications.waset.org/abstracts/81391/students-ability-to-solve-complex-accounting-problems-using-a-framework-based-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/81391.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">233</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">1715</span> Comparative Analysis of Two Different Ant Colony Optimization Algorithm for Solving Travelling Salesman Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sourabh%20Joshi">Sourabh Joshi</a>, <a href="https://publications.waset.org/abstracts/search?q=Tarun%20Sharma"> Tarun Sharma</a>, <a href="https://publications.waset.org/abstracts/search?q=Anurag%20Sharma"> Anurag Sharma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Ant Colony Optimization is heuristic Algorithm which has been proven a successful technique applied on number of combinatorial optimization problems. Two variants of Ant Colony Optimization algorithm named Ant System and Max-Min Ant System are implemented in MATLAB to solve travelling Salesman Problem and the results are compared. In, this paper both systems are analyzed by solving the some Travelling Salesman Problem and depict which system solve the problem better in term of cost and time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ant%20Colony%20Optimization" title="Ant Colony Optimization">Ant Colony Optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=Travelling%20Salesman%20Problem" title=" Travelling Salesman Problem"> Travelling Salesman Problem</a>, <a href="https://publications.waset.org/abstracts/search?q=Ant%20System" title=" Ant System"> Ant System</a>, <a href="https://publications.waset.org/abstracts/search?q=Max-Min%20Ant%20System" title=" Max-Min Ant System"> Max-Min Ant System</a> </p> <a href="https://publications.waset.org/abstracts/18457/comparative-analysis-of-two-different-ant-colony-optimization-algorithm-for-solving-travelling-salesman-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18457.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">483</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1714</span> A Metaheuristic Approach for the Pollution-Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=P.%20Parthiban">P. Parthiban</a>, <a href="https://publications.waset.org/abstracts/search?q=Sonu%20Rajak"> Sonu Rajak</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Dhanalakshmi"> R. Dhanalakshmi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an Ant Colony Optimization (ACO) approach, combined with a Speed Optimization Algorithm (SOA) to solve the Vehicle Routing Problem (VRP) with environmental considerations, which is well known as Pollution-Routing Problem (PRP). It consists of routing a number of vehicles to serve a set of customers, and determining fuel consumption, driver wages and their speed on each route segment, while respecting the capacity constraints and time windows. Since VRP is NP-hard problem, so PRP also a NP-hard problem, which requires metaheuristics to solve this type of problems. The proposed solution method consists of two stages. Stage one is to solve a Vehicle Routing Problem with Time Window (VRPTW) using ACO and in the second stage, a SOA is run on the resulting VRPTW solution. Given a vehicle route, the SOA consists of finding the optimal speed on each arc of the route to minimize an objective function comprising fuel consumption costs and driver wages. The proposed algorithm tested on benchmark problem, the preliminary results show that the proposed algorithm can provide good solutions within reasonable computational time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20optimization" title="ant colony optimization">ant colony optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=CO2%20emissions" title=" CO2 emissions"> CO2 emissions</a>, <a href="https://publications.waset.org/abstracts/search?q=speed%20optimization" title=" speed optimization"> speed optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=vehicle%20routing" title=" vehicle routing"> vehicle routing</a> </p> <a href="https://publications.waset.org/abstracts/50237/a-metaheuristic-approach-for-the-pollution-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50237.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">359</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1713</span> A Heuristic for the Integrated Production and Distribution Scheduling Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Christian%20Meinecke">Christian Meinecke</a>, <a href="https://publications.waset.org/abstracts/search?q=Bernd%20Scholz-Reiter"> Bernd Scholz-Reiter</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The integrated problem of production and distribution scheduling is relevant in many industrial applications. Thus, many heuristics to solve this integrated problem have been developed in the last decade. Most of these heuristics use a sequential working principal or a single decomposition and integration approach to separate and solve sub-problems. A heuristic using a multi-step decomposition and integration approach is presented in this paper and evaluated in a case study. The result show significant improved results compared with sequential scheduling heuristics. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=production%20and%20outbound%20distribution" title="production and outbound distribution">production and outbound distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=integrated%20planning" title=" integrated planning"> integrated planning</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic" title=" heuristic"> heuristic</a>, <a href="https://publications.waset.org/abstracts/search?q=decomposition" title=" decomposition"> decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=integration" title=" integration"> integration</a> </p> <a href="https://publications.waset.org/abstracts/4364/a-heuristic-for-the-integrated-production-and-distribution-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4364.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">429</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">1712</span> Use the Null Space to Create Starting Point for Stochastic Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ghussoun%20Al-Jeiroudi">Ghussoun Al-Jeiroudi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Stochastic programming is one of the powerful technique which is used to solve real-life problems. Hence, the data of real-life problems is subject to significant uncertainty. Uncertainty is well studied and modeled by stochastic programming. Each day, problems become bigger and bigger and the need for a tool, which does deal with large scale problems, increase. Interior point method is a perfect tool to solve such problems. Interior point method is widely employed to solve the programs, which arise from stochastic programming. It is an iterative technique, so it is required a starting point. Well design starting point plays an important role in improving the convergence speed. In this paper, we propose a starting point for interior point method for multistage stochastic programming. Usually, the optimal solution of stage k+1 is used as starting point for the stage k. This point has the advantage of being close to the solution of the current program. However, it has a disadvantage; it is not in the feasible region of the current program. So, we suggest to take this point and modifying it. That is by adding to it a vector in the null space of the matrix of the unchanged constraints because the solution will change only in the null space of this matrix. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=interior%20point%20methods" title="interior point methods">interior point methods</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20programming" title=" stochastic programming"> stochastic programming</a>, <a href="https://publications.waset.org/abstracts/search?q=null%20space" title=" null space"> null space</a>, <a href="https://publications.waset.org/abstracts/search?q=starting%20points" title=" starting points"> starting points</a> </p> <a href="https://publications.waset.org/abstracts/54185/use-the-null-space-to-create-starting-point-for-stochastic-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54185.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">418</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">1711</span> Hybridized Simulated Annealing with Chemical Reaction Optimization for Solving to Sequence Alignment Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ernesto%20Linan">Ernesto Linan</a>, <a href="https://publications.waset.org/abstracts/search?q=Linda%20Cruz"> Linda Cruz</a>, <a href="https://publications.waset.org/abstracts/search?q=Lucero%20Becerra"> Lucero Becerra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a new hybridized algorithm based on Chemical Reaction Optimization and Simulated Annealing is proposed to solve the alignment sequence Problem. The Chemical Reaction Optimization is a population-based meta-heuristic algorithm based on the principles of a chemical reaction. Simulated Annealing is applied to solve a large number of combinatorial optimization problems of general-purpose. In this paper, we propose hybridization between Chemical Reaction Optimization algorithm and Simulated Annealing in order to solve the Sequence Alignment Problem. An initial population of molecules is defined at beginning of the proposed algorithm, where each molecule represents a sequence alignment problem. In order to simulate inter-molecule collisions, the process of Chemical Reaction is placed inside the Metropolis Cycle at certain values of temperature. Inside this cycle, change of molecules is done due to collisions; some molecules are accepted by applying Boltzmann probability. The results with the hybrid scheme are better than the results obtained separately. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=chemical%20reaction%20optimization" title="chemical reaction optimization">chemical reaction optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=sequence%20alignment%20problem" title=" sequence alignment problem"> sequence alignment problem</a>, <a href="https://publications.waset.org/abstracts/search?q=simulated%20annealing%20algorithm" title=" simulated annealing algorithm"> simulated annealing algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristics" title=" metaheuristics"> metaheuristics</a> </p> <a href="https://publications.waset.org/abstracts/136324/hybridized-simulated-annealing-with-chemical-reaction-optimization-for-solving-to-sequence-alignment-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/136324.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">1710</span> Operator Splitting Scheme for the Inverse Nagumo Equation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sharon-Yasotha%20Veerayah-Mcgregor">Sharon-Yasotha Veerayah-Mcgregor</a>, <a href="https://publications.waset.org/abstracts/search?q=Valipuram%20Manoranjan"> Valipuram Manoranjan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A backward or inverse problem is known to be an ill-posed problem due to its instability that easily emerges with any slight change within the conditions of the problem. Therefore, only a limited number of numerical approaches are available to solve a backward problem. This paper considers the Nagumo equation, an equation that describes impulse propagation in nerve axons, which also models population growth with the Allee effect. A creative operator splitting numerical scheme is constructed to solve the inverse Nagumo equation. Computational simulations are used to verify that this scheme is stable, accurate, and efficient. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=inverse%2Fbackward%20equation" title="inverse/backward equation">inverse/backward equation</a>, <a href="https://publications.waset.org/abstracts/search?q=operator-splitting" title=" operator-splitting"> operator-splitting</a>, <a href="https://publications.waset.org/abstracts/search?q=Nagumo%20equation" title=" Nagumo equation"> Nagumo equation</a>, <a href="https://publications.waset.org/abstracts/search?q=ill-posed" title=" ill-posed"> ill-posed</a>, <a href="https://publications.waset.org/abstracts/search?q=finite-difference" title=" finite-difference"> finite-difference</a> </p> <a href="https://publications.waset.org/abstracts/182287/operator-splitting-scheme-for-the-inverse-nagumo-equation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/182287.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">97</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">1709</span> Modeling Jordan University of Science and Technology Parking Using Arena Program</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=T.%20Qasim">T. Qasim</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Alqawasmi"> M. Alqawasmi</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Hawash"> M. Hawash</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Betar"> M. Betar</a>, <a href="https://publications.waset.org/abstracts/search?q=W.%20Qasim"> W. Qasim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Over the last decade, the over population that has happened in urban areas has been reflecting on the services that various local institutions provide to car users in the form of car parks, which is becoming a daily necessity in our lives. This study focuses on car parks at Jordan University of Science and Technology, in Irbid, Jordan, to understand the university parking needs. Data regarding arrival and departure times of cars and the parking utilization were collected, to find various options that the university can implement to solve and develop an efficient car parking system. Arena software was used to simulate a parking model. This model allows measuring the different solutions that solve the parking problem at Jordan University of Science and Technology. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=car%20park" title="car park">car park</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=modeling" title=" modeling"> modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=service%20time" title=" service time"> service time</a> </p> <a href="https://publications.waset.org/abstracts/104306/modeling-jordan-university-of-science-and-technology-parking-using-arena-program" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/104306.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">183</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">1708</span> Two Efficient Heuristic Algorithms for the Integrated Production Planning and Warehouse Layout Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Pourmohammadi%20Fallah">Mohammad Pourmohammadi Fallah</a>, <a href="https://publications.waset.org/abstracts/search?q=Maziar%20Salahi"> Maziar Salahi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the literature, a mixed-integer linear programming model for the integrated production planning and warehouse layout problem is proposed. To solve the model, the authors proposed a Lagrangian relax-and-fix heuristic that takes a significant amount of time to stop with gaps above 5$\%$ for large-scale instances. Here, we present two heuristic algorithms to solve the problem. In the first one, we use a greedy approach by allocating warehouse locations with less reservation costs and also less transportation costs from the production area to locations and from locations to the output point to items with higher demands. Then a smaller model is solved. In the second heuristic, first, we sort items in descending order according to the fraction of the sum of the demands for that item in the time horizon plus the maximum demand for that item in the time horizon and the sum of all its demands in the time horizon. Then we categorize the sorted items into groups of 3, 4, or 5 and solve a small-scale optimization problem for each group, hoping to improve the solution of the first heuristic. Our preliminary numerical results show the effectiveness of the proposed heuristics. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=capacitated%20lot-sizing" title="capacitated lot-sizing">capacitated lot-sizing</a>, <a href="https://publications.waset.org/abstracts/search?q=warehouse%20layout" title=" warehouse layout"> warehouse layout</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed-integer%20linear%20programming" title=" mixed-integer linear programming"> mixed-integer linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristics%20algorithm" title=" heuristics algorithm"> heuristics algorithm</a> </p> <a href="https://publications.waset.org/abstracts/154415/two-efficient-heuristic-algorithms-for-the-integrated-production-planning-and-warehouse-layout-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/154415.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">195</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">1707</span> Decision Support System for Solving Multi-Objective Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ismail%20El%20Gayar">Ismail El Gayar</a>, <a href="https://publications.waset.org/abstracts/search?q=Ossama%20Ismail"> Ossama Ismail</a>, <a href="https://publications.waset.org/abstracts/search?q=Yousri%20El%20Gamal"> Yousri El Gamal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presented a technique to solve one of the transportation problems that faces us in real life which is the Bus Scheduling Problem. Most of the countries using buses in schools, companies and traveling offices as an example to transfer multiple passengers from many places to specific place and vice versa. This transferring process can cost time and money, so we build a decision support system that can solve this problem. In this paper, a genetic algorithm with the shortest path technique is used to generate a competitive solution to other well-known techniques. It also presents a comparison between our solution and other solutions for this problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bus%20scheduling%20problem" title="bus scheduling problem">bus scheduling problem</a>, <a href="https://publications.waset.org/abstracts/search?q=decision%20support%20system" title=" decision support system"> decision support system</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=shortest%20path" title=" shortest path"> shortest path</a> </p> <a href="https://publications.waset.org/abstracts/45065/decision-support-system-for-solving-multi-objective-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45065.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">414</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1706</span> The Challenges of Hyper-Textual Learning Approach for Religious Education</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Elham%20Shirvani%E2%80%93Ghadikolaei">Elham Shirvani–Ghadikolaei</a>, <a href="https://publications.waset.org/abstracts/search?q=Seyed%20Mahdi%20Sajjadi"> Seyed Mahdi Sajjadi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> State of the art technology has the tremendous impact on our life, in this situation education system have been influenced as well as. In this paper, tried to compare two space of learning text and hypertext with each other, and some challenges of using hypertext in religious education. Regarding the fact that, hypertext is an undeniable part of learning in this world and it has highly beneficial for the education process from class to office and home. In this paper tried to solve this question: the consequences and challenges of applying hypertext in religious education. Also, the consequences of this survey demonstrate the role of curriculum designer and planner of education to solve this problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hyper-textual" title="Hyper-textual">Hyper-textual</a>, <a href="https://publications.waset.org/abstracts/search?q=learning" title=" learning"> learning</a>, <a href="https://publications.waset.org/abstracts/search?q=religious%20education" title=" religious education"> religious education</a>, <a href="https://publications.waset.org/abstracts/search?q=learning%20text" title=" learning text"> learning text</a> </p> <a href="https://publications.waset.org/abstracts/60101/the-challenges-of-hyper-textual-learning-approach-for-religious-education" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/60101.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">312</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">1705</span> Using Convergent and Divergent Thinking in Creative Problem Solving in Mathematics</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Keng%20Keh%20Lim">Keng Keh Lim</a>, <a href="https://publications.waset.org/abstracts/search?q=Zaleha%20Ismail"> Zaleha Ismail</a>, <a href="https://publications.waset.org/abstracts/search?q=Yudariah%20Mohammad%20Yusof"> Yudariah Mohammad Yusof</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper aims to find out how students using convergent and divergent thinking in creative problem solving to solve mathematical problems creatively. Eight engineering undergraduates in a local university took part in this study. They were divided into two groups. They solved the mathematical problems with the use of creative problem solving skills. Their solutions were collected and analyzed to reveal all the processes of problem solving, namely: problem definition, ideas generation, ideas evaluation, ideas judgment, and solution implementation. The result showed that the students were able to solve the mathematical problem with the use of creative problem solving skills. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convergent%20thinking" title="convergent thinking">convergent thinking</a>, <a href="https://publications.waset.org/abstracts/search?q=divergent%20thinking" title=" divergent thinking"> divergent thinking</a>, <a href="https://publications.waset.org/abstracts/search?q=creative%20problem%20solving" title=" creative problem solving"> creative problem solving</a>, <a href="https://publications.waset.org/abstracts/search?q=creativity" title=" creativity"> creativity</a> </p> <a href="https://publications.waset.org/abstracts/77631/using-convergent-and-divergent-thinking-in-creative-problem-solving-in-mathematics" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/77631.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">349</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">1704</span> Determination of the Minimum Time and the Optimal Trajectory of a Moving Robot Using Picard's Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abbes%20Lounis">Abbes Lounis</a>, <a href="https://publications.waset.org/abstracts/search?q=Kahina%20Louadj"> Kahina Louadj</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Aidene"> Mohamed Aidene</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an optimal control problem applied to a robot; the problem is to determine a command which makes it possible to reach a final state from a given initial state in record time. The approach followed to solve this optimization problem with constraints on the control starts by presenting the equations of motion of the dynamic system then by applying Pontryagin's maximum principle (PMP) to determine the optimal control, and Picard's successive approximation method combined with the shooting method to solve the resulting differential system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=robotics" title="robotics">robotics</a>, <a href="https://publications.waset.org/abstracts/search?q=Pontryagin%27s%20Maximum%20Principle" title=" Pontryagin's Maximum Principle"> Pontryagin's Maximum Principle</a>, <a href="https://publications.waset.org/abstracts/search?q=PMP" title=" PMP"> PMP</a>, <a href="https://publications.waset.org/abstracts/search?q=Picard%27s%20method" title=" Picard's method"> Picard's method</a>, <a href="https://publications.waset.org/abstracts/search?q=shooting%20method" title=" shooting method"> shooting method</a>, <a href="https://publications.waset.org/abstracts/search?q=non-linear%20differential%20systems" title=" non-linear differential systems"> non-linear differential systems</a> </p> <a href="https://publications.waset.org/abstracts/130157/determination-of-the-minimum-time-and-the-optimal-trajectory-of-a-moving-robot-using-picards-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/130157.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">254</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">1703</span> Knowledge Audit Model for Requirement Elicitation Process</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Laleh%20Taheri">Laleh Taheri</a>, <a href="https://publications.waset.org/abstracts/search?q=Noraini%20C.%20Pa"> Noraini C. Pa</a>, <a href="https://publications.waset.org/abstracts/search?q=Rusli%20Abdullah"> Rusli Abdullah</a>, <a href="https://publications.waset.org/abstracts/search?q=Salfarina%20Abdullah"> Salfarina Abdullah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Knowledge plays an important role to the success of any organization. Software development organizations are highly knowledge-intensive organizations especially in their Requirement Elicitation Process (REP). There are several problems regarding communicating and using the knowledge in REP such as misunderstanding, being out of scope, conflicting information and changes of requirements. All of these problems occurred in transmitting the requirements knowledge during REP. Several researches have been done in REP in order to solve the problem towards requirements. Knowledge Audit (KA) approaches were proposed in order to solve managing knowledge in human resources, financial, and manufacturing. There is lack of study applying the KA in requirements elicitation process. Therefore, this paper proposes a KA model for REP in supporting to acquire good requirements. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=knowledge%20audit" title="knowledge audit">knowledge audit</a>, <a href="https://publications.waset.org/abstracts/search?q=requirement%20elicitation%20process" title=" requirement elicitation process"> requirement elicitation process</a>, <a href="https://publications.waset.org/abstracts/search?q=KA%20model" title=" KA model"> KA model</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20in%20requirement%20elicitation" title=" knowledge in requirement elicitation"> knowledge in requirement elicitation</a> </p> <a href="https://publications.waset.org/abstracts/4339/knowledge-audit-model-for-requirement-elicitation-process" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4339.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">345</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">1702</span> Optimization of Maritime Platform Transport Problem of Solid, Special and Dangerous Waste</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ocotl%C3%A1n%20D%C3%ADaz-Parra">Ocotlán Díaz-Parra</a>, <a href="https://publications.waset.org/abstracts/search?q=Jorge%20A.%20Ruiz-Vanoye"> Jorge A. Ruiz-Vanoye</a>, <a href="https://publications.waset.org/abstracts/search?q=Alejandro%20Fuentes-Penna"> Alejandro Fuentes-Penna</a>, <a href="https://publications.waset.org/abstracts/search?q=Beatriz%20Bernabe-Loranca"> Beatriz Bernabe-Loranca</a>, <a href="https://publications.waset.org/abstracts/search?q=Patricia%20Ambrocio-Cruz"> Patricia Ambrocio-Cruz</a>, <a href="https://publications.waset.org/abstracts/search?q=Jos%C3%A9%20J.%20Hern%C3%A1ndez-Flores"> José J. Hernández-Flores</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Maritime Platform Transport Problem of Solid, Special and Dangerous Waste consist of to minimize the monetary value of carry different types of waste from one location to another location using ships. We offer a novel mathematical, the characterization of the problem and the use CPLEX to find the optimal values to solve the Solid, Special and Hazardous Waste Transportation Problem of offshore platforms instances of Mexican state-owned petroleum company (PEMEX). The set of instances used are WTPLib real instances and the tool CPLEX solver to solve the MPTPSSDW problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=oil%20platform" title="oil platform">oil platform</a>, <a href="https://publications.waset.org/abstracts/search?q=transport%20problem" title=" transport problem"> transport problem</a>, <a href="https://publications.waset.org/abstracts/search?q=waste" title=" waste"> waste</a>, <a href="https://publications.waset.org/abstracts/search?q=solid%20waste" title=" solid waste"> solid waste</a> </p> <a href="https://publications.waset.org/abstracts/42738/optimization-of-maritime-platform-transport-problem-of-solid-special-and-dangerous-waste" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42738.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">471</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Solve%20Elmstahl&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Solve%20Elmstahl&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Solve%20Elmstahl&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Solve%20Elmstahl&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Solve%20Elmstahl&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Solve%20Elmstahl&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Solve%20Elmstahl&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Solve%20Elmstahl&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Solve%20Elmstahl&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Solve%20Elmstahl&page=57">57</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Solve%20Elmstahl&page=58">58</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Solve%20Elmstahl&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>