Search Results - (( java application customization algorithm ) OR ( construct solution using algorithm ))

Design and statistical analysis of initial solution construction approach in curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

“…To produce a population of initial solution require algorithm that can produce multiple feasible solutions and these solutions must be diverse. …”
Get full text
Get full text

Enhanced Intelligent Water Drops Algorithm for University Examination Timetabling Problems by Bashar AbedAl Mohdi Talal AlDeeb

“…This thesis presents an investigation of using the Intelligent Water Drops (IWD) algorithm to construct and produce good quality solutions for the UETP. …”

Sequential constructive algorithm incorporate with fuzzy logic for solving real world course timetabling problem by Tan, Li June, Joe H. Obit, Leau, Yu Beng, Jetol Bolongkikit, Rayner Alfred

“…The proposed method will be used to generate feasible solution as well as improve the quality of the solution. …”
Get full text
Get full text
Get full text

A negotiation algorithm for decision-making in the construction domain by Idrus A., Mahmoud M.A., Ahmad M.S., Yahya A., Husen H.

Sequential Constructive Algorithm incorporate with Fuzzy Logic for Solving Real World Course Timetabling Problem by Tan, Li June, Joe Henry Obit, Leau, Yu Beng, Jetol Bolongkikit, Rayner Alfred

“…The proposed method will be used to generate feasible solution as well as improve the quality of the solution. …”
Get full text
Get full text
Get full text
Get full text
Get full text

A hybrid adaptive harmony search with modified great deluge algorithm for school timetabling by Arbaoui, Billel

“…In Phase 1, heuristic rules refine the time assignment stage to improve an existing construction algorithm. Phase 2 adaptively tunes parameters based on iteration position, solution number, behavioral status, and parameter linkages. …”
Get full text
Get full text

Optimised Crossover Genetic Algorithms for Combinatorial Optimisation Problems by Nazif, Habibeh

“…A Genetic Algorithm is successful in generating near -optimal solutions if it is able to produce o®spring during crossover that is better than the parent solutions. …”
Get full text
Get full text

Development of a scheduling tool for constructing a Malaysian school timetable using genetic algorithms / Salihin Farag Shoeeb by Salihin Farag , Shoeeb

“…A recent approach to derive a near-optimal solution is to use evolutionary or genetic algorithms. …”
Get full text
Get full text

The Anglerfish algorithm: a derivation of randomized incremental construction technique for solving the traveling salesman problem by Pook, Mei Foong, Ramlan, Effirul Ikhwan

“…Benchmarking is conducted using the traveling salesman problem. The results are comparable with the results of advanced metaheuristic algorithms. …”
Get full text
Get full text

Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

“…Results of the experiments that were conducted using various data sets showed that the proposed algorithm produced better course schedule solution than the Greedy Algorithm, Genetic Algorithm, and other variants of Ant System Algorithm.…”
Get full text
Get full text
Get full text

Development of Hybrid Algorithm for Integrated Aircraft Routing Problem and Crew Pairing Problem by NurulFarihan Mohamed, ZaitulMarlizawati Zainuddin, Said Salhi, Nurul Huda Mohamed, NurulAkmal Mohamed

A Hybrid of Ant Colony Optimization Algorithm and Simulated Annealing for Classification Rules by Rizauddin, Saian

“…The second proposed algorithm uses SA to optimize the terms selection while constructing a rule. …”
Get full text
Get full text
Get full text
Get full text

Simulated annealing algorithm for solving chambering student-case assignment problem by Ghazali, Saadiah, Abdul Rahman, Syariza

“…The objective of the study is to minimize the total completion time for all students in solving the given cases.This study employed a minimum cost greedy heuristic in order to construct a feasible initial solution.The search then is preceded with a simulated annealing algorithm for further improvement of solution quality.The analysis of the obtained result has shown that the proposed simulated annealing algorithm has greatly improved the solution constructed by the minimum cost greedy heuristic. …”
Get full text
Get full text
Get full text

Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics by Wahid, Juliana, Mohd Hussin, Naimah

“…The construction of population of initial solution is a crucial task in population-based metaheuristic approach for solving curriculum-based university course timetabling problem because it can affect the convergence speed and also the quality of the final solution.This paper presents an exploration on combination of graph heuristics in construction approach in curriculum based course timetabling problem to produce a population of initial solutions.The graph heuristics were set as single and combination of two heuristics.In addition, several ways of assigning courses into room and timeslot are implemented.All settings of heuristics are then tested on the same curriculum based course timetabling problem instances and are compared with each other in terms of number of population produced.The result shows that combination of largest degree followed by saturation degree heuristic produce the highest number of population of initial solutions.The results from this study can be used in the improvement phase of algorithm that uses population of initial solutions…”
Get full text
Get full text
Get full text

Harmony annealing algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

“…An attempt to solve these problems was made via an approach broken down into two parts; first, constructive algorithm with saturation degree approach was used to ensure a feasible solution, where the hard constraints are satisfied.Secondly, Harmony annealing algorithm was used to further improve the results obtained.The algorithm produced results that were not comparatively better than those previously known as best solution.With proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.…”
Get full text
Get full text
Get full text

Integrated optimal control and parameter estimation algorithms for discrete-time nonlinear stochastic dynamical systems by Kek, Sie Long

“…Furthermore, the accuracy of the state estimate with the smallest state error covariance is enhanced by using the Kalman filtering theory. This enhancement produces the filtering solution by using the second sub-algorithm. …”
Get full text
Get full text

Performance analyses of graph heuristics and selected trajectory metaheuristics on examination timetable problem by Mandal, Ashis Kumar, M. N. M., Kahar

“…To deal with the problem effectually, frequently heuristics are used for constructing feasible examination timetable while meta-heuristics are applied for improving the solution quality. …”
Get full text
Get full text
Get full text

Hybrid genetic algorithm for uncapacitated university examination timetabling problem by Ishak, Suhada

“…All proposed algorithms are coded in C using Microsoft Visual C++ 6.0 as the compiler. …”
Get full text
Get full text

Hybrid tabu search – strawberry algorithm for multidimensional knapsack problem by Wong, Jerng Foong

“…The Greedy heuristics by ratio was employed to construct an initial solution. Next, the solution was enhanced by using the hybrid TS-SBA. …”
Get full text
Get full text
Get full text

Ball surface representations using partial differential equations by Kherd, Ahmad Saleh Abdullah

“…Hence, this new algorithm is a viable alternative for constructing generalized Ball surfaces. …”
Get full text
Get full text
Get full text