2 results
Search Results
Now showing 1 - 2 of 2
Article Citation - Scopus: 1Analyzing Students' Academic Success in Pre-requisite Course Chains: A Case Study in Turkey(Tempus Publications, 2018) Karakaya, Murat; Eryilmaz, Meltem; Ceyhan, Ulas; Computer EngineeringThere are several principles which have been accepted as approaches to successful curriculum development. In spite of the differences in the proposed sequencing of topics, all approaches basically depend on the pre-requisite chains to implement their educational approach in the curriculum development for specifying the order of the subjects. In this research, two prerequisite chains representing two different curriculum development approaches are taken into consideration in a case study. The first research question considered is whether academic success in a follow-up course is positively related to success attained in the pre-requisite course. The second one is whether or not the selected curriculum development approach for deciding the chains has a significant impact on the academic success relationships between a pre-requisite and its follow-up course. To answer these questions, course data of 441 undergraduate students who graduated from the Atilim University between Fall 2001 and Spring 2015 semesters were collected and analyzed. The results indicate that the succes levels gained in a pre-requisite and its follow-up course are corelated. Moreover, different cirriculum development methods can affect this corelation. Thus, cirriculum developers should consider appropriate approaches to improve student success for deciding chaining courses and their contents.Article Citation - WoS: 71Citation - Scopus: 87Efficient Route Planning for an Unmanned Air Vehicle Deployed on a Moving Carrier(Springer, 2016) Savuran, Halil; Karakaya, MuratVehicle routing problem (VRP) is a constrained extension of the well-known traveling salesman problem (TSP). Emerging from the current conceptual trends in operations field, a new constraint to be included to the existing VRP parameters is the depot mobility. A practical example of such a problem is planning a route for an Unmanned air vehicle (UAV) deployed on a mobile platform to visit fixed targets. Furthermore, the range constraint of the UAV becomes another constraint within this sample case as well. In this paper, we define new VRP variants by introducing depot mobility (Mobile Depot VRP: MoDVRP) and extending it with capacity constraint (Capacitated MoDVRP: C-MoDVRP). As a sample use case, we study route planning for a UAV deployed on a moving carrier. To deal with the C-MoDVRP, we propose a Genetic Algorithm that is adapted to satisfy the constraints of depot mobility and range, while maximizing the number of targets visited by the UAV. To examine the success of our approach, we compare the individual performances of our proposed genetic operators with conventional ones and the performance of our overall solution with the Nearest Neighbor and Hill Climbing heuristics, on some well-known TSP benchmark problems, and receive successful results.
