ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Literature
Languages
Biology
Technology
Pure sciences
Research
Social Sciences
Chemistry
Philosophy
all records (74)

Languages
English
Spanish
Portuguese
German

Countries
Indonesia
Brazil
USA
South Africa
Ukraine
Spain
Turkey, Turkish Republic
Poland
Colombia
Argentina
all records (75)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
75.012  Articles
1 of 7.502 pages  |  10  records  |  more records»
Vehicle routing problem (VRP) is a Nondeterministic Polynomial Hard combinatorial optimization problem to serve the consumers from central depots and returned back to the originated depots with given vehicles. Furthermore, two of the most important extens... see more

Capacitated Vehicle Routing Problem (CVRP) is among transportation problems that are of the foremost concerns in logistics. Ensuring an effective product distribution over a large distribution network while reducing the required costs represents the scope... see more

The increasing exploration of alternative methods for solving optimization problems causes that parallelization and modification of the existing algorithms are necessary. Obtaining the right solution using the meta-heuristic algorithm may require long ope... see more

Genetic algorithm (GA) and differential evolution (DE) are meta-heuristic algorithms which have shown a favourable performance in the optimization of the complex problems. In recent years, only GA has been widely used for single-objective optimal design o... see more

A central issue in systems biology is the study of efficient methods inferring fluxes of biological reactions by starting from experimental data. Among the different techniques proposed in the last years, the theory of Metabolic P systems, which is based ... see more

Permasalahan knapsack merupakan salah satu masalah optimisasi. Masalah knapsack merupakan suatu permasalahan bagaimana memilih objek dari beberapa objek yang akan dimasukkan ke media penyimpanan dengan masing-masing objek memiliki bobot dan total bobot da... see more

Metaheuristic algorithms are computational intelligence paradigms especially used for solving different optimization issues.  Metaheuristics examine a collection of solutions otherwise really be wide to be thoroughly addressed or discussed in any oth... see more

Examination Timetabling Problem is one of the optimization and combinatorial problems. It is proved to be a non-deterministic polynomial (NP)-hard problem. On a large scale of data, the examination timetabling problem becomes a complex problem and takes t... see more

Moving Target Traveling Salesman Problem is the problem of destruction of targets moving at certain angles and speeds by a constant velocity pursuer. The problem is applied in many areas, mainly production, defense and surveillance systems. Military opera... see more

1 of 7.502 pages  |  10  records  |  more records»