The fractional calculus numerical algorithms and its application to the viscoelastic material problem
This paper studied the fractional calculus, given three types of numerical methods
Articles, journals and conferences in one search. An exact title, DOI or ISSN is listed first.
In the search box: "exact phrase" · -leave out · OR · prefix* · title: author: journal:
This paper studied the fractional calculus, given three types of numerical methods
random exploration method (Mutation). In this research work, application of genetic algorithms was explored for the optimization problem embodied in the transit problem of agricultural extension agents or workers…
present a algorithm based on the PSS splitting for the saddle-point problems in this paper, and analysis the convergence of the new method. The results supported by numerical experiments
presents a novel and improved method for solving the Non Convex Economic Dispatch (ELD) problems with valve-point effects and Multiple Fuels, by integrating the particle swarm optimization (PSO) with ... clearly show…
This same multitude of responsive classifications becomes substantial, but rather a mutation
produce chicken, is introduced. Laying chicken algorithm (LCA) is used for solving different kinds of linear and non-linear programming problems. The presented approach gives efficient and feasible solutions
mean tardiness is considered as the objective to develop the optimal scheduling algorithm. Characteristics of our considered problem leads to the complexity of problem. First, no-wait operations. Second, setup…
this paper, a multi-objective flexible dynamic job shop scheduling problem (MO-FDJSPM) with maintenance constraint is studied. The objectives of the scheduling are maximizing the completion time, mean ... genetic…
problems. This paper presents the mathematical formulation of different bi-criteria multistage transportation problem, and an algorithm for solving a class of them. This class can be solved using
capacities, fixed and variable costs. Due to its complexity, there’s no exact algorithm for this problem. A new scheme based on a clustering genetic algorithm heuristic for the HVRP
been developed to solve job shop scheduling problems and machines process scheduling problem. Implementation of genetic algorithm for operating system process scheduling is a new idea . Genetic Algorithm ... operating…
Statement of the Problem: MRI scans in patients with cardiac MRI conditional devices (pacemakers and ICDs) are exponentially growing. All devices require pre-scan interrogation and accordingly reprograming ... order to…
shop scheduling problem (FJSSP) which is NP-hard in nature, one needs to connect different aspects of many optimization approaches. This paper proposes differential evolution algorithm (DE) to show hybrid
Jahedsani H and Azimi P PDF Share this article
allows in general to develop the consequent theoretical approach for resolving the inverse DXTT problem. As an example, using the one 2D projection data with inclination angles ... function f (r-r0) the simulated…
operates using qubits, the basic units of quantum information, which enable quantum algorithms to solve complex problems that classical computers cannot efficiently handle. This review provides a comparative analysis
computers. By utilizing quantum bits (qubits), superposition, and entanglement, quantum computers can process complex problems more efficiently than traditional systems. This technology has the potential to…
solving complex problems in various domains such as computer networks, social networks, transportation systems, and biology. Graph Theory has evolved significantly with the development of advanced algorithms and…
complex AI problems. Further applications extend to efficient data processing in image classification, robust financial time series prediction, and accelerated linear equation solving. Additionally, quantum-inspired…
Artificial Intelligence (AI) has significantly transformed various industries by offering innovative solutions
For authors and organisers
Find the right journal for your paper and submit your manuscript.