Search

One of the combinatorial optimization problems is Knapsack problem, which aims to maximize the benefit of objects whose weight not exceeding the capacity of knapsack. This paper introduces artificial bee colony algorithm to select a subset of project and represented by knapsack problem to put the best investment plan which achieve the highest profits within a determined costs, this plan is one of the applications of the financial field. The result from the proposed algorithm implemented by matlab (8.3) show the ability to find best solution with precisely and rapidity compared to genetic algorithm http://dx.doi.org/10.25130/tjps.23.2018.039

In many applications, the comparison of the visual appearance of real-world materials is crucial. In this article, we look into the issue of selecting an appropriate colour representation for food photographs, weigh the benefits and drawbacks of several colour spaces, dispel some myths about how to use them, and suggest a number of "best practices" for colour conversion. To put the debate into practice, we created a brand-new dataset of various foods, which we utilized to compare and assess the effectiveness of colour spaces methodically in a methodical manner. According to the results of the investigation, the H component provides more discriminative information about the colour of food items with clearly distinct item pixels than other components

There is a necessity to schedule the system and user processes by the operating system to getting maximum utilization of the CPU and obtaining high throughput. This paper presents a dynamic scheduling algorithm that make use of genetic algorithm operations for scheduling multi non-preemptive task on uniprocessor system to get minimum average waiting time and average turnaround time. The algorithm depend on construct fitness function that take in its consideration the dead time of process to avoid the starvation problem, in addition to obtaining maximum throughput. The results from proposed algorithm simulation by matlab (8.3) illustrates the successful of this method to obtain optimal result by giving the minimum average turnaround time for executing the given processes.