Over the last few years, the interior designer has been given the ability to access many innovative tools for new forms of unprecedented diversity and efficiency. Some design experts have described the new parametric procedures they are introducing to create new interior projects as a radical transformation that carries all the elements of a qualitative shift in interior design. The best of these parametric procedures is the technical capabilities offered by us to create new forms that are different from what has been discussed in everything that has been produced by designers and architects since modernity and even before it to the present time, which returns our design products through a series of computer programs that perform the pro

Abstract  

  In this work, two algorithms of Metaheuristic algorithms were hybridized. The first is Invasive Weed Optimization algorithm (IWO) it is a numerical stochastic optimization algorithm and the second is Whale Optimization Algorithm (WOA) it is an algorithm based on the intelligence of swarms and community intelligence. Invasive Weed Optimization Algorithm (IWO) is an algorithm inspired by nature and specifically from the colonizing weeds behavior of weeds, first proposed in 2006 by Mehrabian and Lucas. Due to their strength and adaptability, weeds pose a serious threat to cultivated plants, making them a threat to the cultivation process. The behavior of these weeds has been simulated and used in Invas

0

The research aims to find approximate solutions for two dimensions Fredholm linear integral equation. Using the two-variables of the Bernstein polynomials we find a solution to the approximate linear integral equation of the type two dimensions. Two examples have been discussed in detail.

In this paper a modified approach have been used to find the approximate solution of ordinary delay differential equations with constant delay using the collocation method based on Bernstien polynomials.

The university course timetable problem (UCTP) is typically a combinatorial optimization problem. Manually achieving a useful timetable requires many days of effort, and the results are still unsatisfactory. unsatisfactory. Various states of art methods (heuristic, meta-heuristic) are used to satisfactorily solve UCTP. However, these approaches typically represent the instance-specific solutions. The hyper-heuristic framework adequately addresses this complex problem. This research proposed Particle Swarm Optimizer-based Hyper Heuristic (HH PSO) to solve UCTP efficiently. PSO is used as a higher-level method that selects low-level heuristics (LLH) sequence which further generates an optimal solution. The proposed a