Search Results - (( java implementation cell algorithm ) OR ( programming problem where algorithm ))
Search alternatives:
- java implementation »
- implementation cell »
- where algorithm »
- cell algorithm »
-
1
Comparison Between Linear Programming And Integer Linear Programming: A Review
Published 2018“…Meanwhile, heuristics outperform exact algorithms in solving large sized problem where it can obtain near optimal solution in an acceptable computational time. …”
Get full text
Get full text
Get full text
Article -
2
Deterministic and stochastic inventory routing problems with backorders using artificial bee colony / Huda Zuhrah Ab Halim
Published 2019“…A new MILP for DSIRPB is formulated and used within the algorithm. The DSIRPB is modeled as stochastic dynamic programming and solved using hybrid rollout algorithm. …”
Get full text
Get full text
Get full text
Thesis -
3
Development of dynamic programming algorithm for maintenance scheduling problem
Published 2020“…The objectives of this research are to develop a dynamic programming algorithm for the maintenance scheduling problem that can deal with the uncertainty and to determine the optimum maintenance schedule that will change according to the uncertainty that happened. …”
Get full text
Get full text
Thesis -
4
An artificial bee colony-based double layered neural network approach for solving quadratic Bi-level programming problems
Published 2020“…In the current work, we devised a hybrid method involving a Double-Layer Neural Network (DLNN) for solving a quadratic Bi-Level Programming Problem (BLPP). For an efficient and effective solution of such problems, the proposed potential methodology includes an improved Artificial Bee Colony (ABC) algorithm, a Hopfield Network (HN), and a Boltzmann Machine (BM). …”
Get full text
Get full text
Article -
5
Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms
Published 2008“…This thesis presents a new approach to optimize the performance of a dual beam optical scanning system in terms of its scanning combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the scanning tasks need to be segregated and assigned for each scanner head, and path planning where the best combinatorial paths for each scanner are determined in order to minimize the total motion of scanning time. …”
Get full text
Get full text
Thesis -
6
A method for group formation using genetic algorithm
Published 2010“…Due to the increasing of complexity in software projects, group work is becoming more important in order to ensure quality software products can be delivered on time.Thus, in universities, group work is seen as a good preparation for students to enter industry because by working in group, it can reduce the individual workload, improve the ability to manage a project and enhance the problem solving skills. However, due to lack of programming skills especially in Java programming language, most of the students’ software project cannot be delivered successfully.To solve this problem, systematic group formation is one of the initial factors that should be considered to ensure that every group consists of quality individuals who are good in programming.This paper presents a method for group formation using genetic algorithm, where the members for each group will be generated based on the students’ programming skill.…”
Get full text
Get full text
Get full text
Article -
7
Enhancement of Ant System Algorithm for Course Timetabling Problem
Published 2009“…As a member of the NP Problem, an exact algorithm to solve the course scheduling problem is not available to date. …”
Get full text
Get full text
Get full text
Thesis -
8
-
9
Agent-based extraction algorithm for computational problem solving
Published 2015“…Modeling Computational Problem Solving (CPS) is the main issue in teaching programming where the given text is needed to be transformed into a model then later into a programming language. …”
Get full text
Get full text
Thesis -
10
-
11
-
12
The solution of 2048 puzzle game using A* algorithm / Zafhira Ismail
Published 2017“…The input data of this project is retrieved from the game’s rule itself and implemented with the proposed algorithm which is A* algorithm. The output of this project is the best solution to achieve the goal using A* algorithm. …”
Get full text
Get full text
Thesis -
13
-
14
-
15
A genetic algorithm approach for timetabling problem: the time group strategy
Published 2004“…The university timetabling problems (TTP) deal with the scheduling of the teaching program. …”
Get full text
Get full text
Get full text
Article -
16
Group formation using genetic algorithm
Published 2009“…Due to the increasing of complexity in software projects, group work is becoming more important in order to ensure quality software products can be delivered on time.Thus, in universities, group work is seen as a good preparation for students to industry because by working in group, it can reduce the individual workload,improve the ability to manage a project and enhance the problem solving skills. However, due to lack of programming skills especially in Java programming language and the inability to have meetings frequently among the group members,most of the students’ software project cannot be delivered successfully.To solve this problem, systematic group formation is one of the initial factors that should be considered to ensure that every group consists of quality individuals who are good in Java programming and also to ensure that every group member in a group are staying closer to each other.In this research, we propose a method for group formation using Genetic Algorithms, where the members for each group will be generated based on the students’ programming skill and location of residential colleges.…”
Get full text
Get full text
Get full text
Get full text
Monograph -
17
Genetic Algorithm for vehicle routing problem / W.Nurfahizul Ifwah W.Alias, Mohd Shaiful Sharipudin and Shamsunarnie Mohamed Zukri.
Published 2012“…The vehicle routing problem (VRP) is the m-Travelling Salesman Problem, where a demand is associated with each city or customer and each vehicle has a certain capacity. …”
Get full text
Get full text
Research Reports -
18
Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module
Published 2006“…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
Get full text
Get full text
Get full text
Article -
19
Thalassaemia detection using CBR Algorithm via mobile device
Published 2011“…Moreover,this application will be using the programming language Visual Basic. Net applied in Visual Studio 2008.The methodology has chosen is rapid application development (RAD) where this method is the archive with apparel search requirement. …”
Get full text
Get full text
Undergraduates Project Papers -
20