Search Results - (( variables solution search algorithm ) OR ( java application interface algorithm ))
Search alternatives:
- variables solution »
- java application »
- solution search »
-
1
Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data
Published 2023“…The literature contains various meta-heuristic algorithms with variable length searching. All of them enable searching in high dimensional problems. …”
Get full text
Get full text
Get full text
Article -
2
Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data
Published 2023“…The literature contains various meta-heuristic algorithms with variable length searching. All of them enable searching in high dimensional problems. …”
Get full text
Get full text
Get full text
Article -
3
Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data
Published 2023“…The literature contains various meta-heuristic algorithms with variable length searching. All of them enable searching in high dimensional problems. …”
Get full text
Get full text
Get full text
Article -
4
Variable Neighbourhood Search Algorithm for Vehicle Routing Problem with Backhaul
Published 2023“…It is one of the most popular solutions to solve a complex problem. Thus, a heuristic approach based on the Variable Neighbourhood Search (VNS) is proposed. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
5
An improved electromagnetism-like mechanism algorithm for the optimization of maximum power point tracking / Tan Jian Ding
Published 2017“…The Electromagnetism-Like Mechanism algorithm (EM) is a meta-heuristic algorithm designed to search for global optimum solutions using bounded variables. …”
Get full text
Get full text
Get full text
Thesis -
6
Seed disperser ant algorithm for optimization / Chang Wen Liang
Published 2018“…The genotype of every ant is represented in binary form as the variables. These binary variables are used to locally search for optimum solution. …”
Get full text
Get full text
Get full text
Thesis -
7
A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem
Published 2016“…In this paper, an adaptive variable neighbourhood search (AVNS) algorithm that incorporates large neighbourhood search (LNS) as a diversification strategy is proposed and applied to the capacitated vehicle routing problem. …”
Get full text
Get full text
Get full text
Article -
8
Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities
Published 2010“…A procedure that attempts to fully utilise a vehicle is used to obtain an initial solution, with this initial solution being improved using an interchange procedure.We present two metaheuristic algorithms using tabu search and variable neighbourhood search that are based around the neighbour sets.We also present a metaheuristic based on variable neighbourhood tabu search, where the variable neighbourhood is searched via tabu search.Computational results are presented for publicly available waste collection problems involving up to 2092 customers and 19 waste disposal facilities, which indicate that our algorithms produce better quality solutions than previous work presented in the literature.…”
Get full text
Get full text
Get full text
Article -
9
Metaheuristics for the waste collection vehicle routing problem with time windows
Published 2010“…In this problem there is a set of customers which waste is collected by vehicles.Vehicles can visit waste disposal facilities during their working day to empty collected waste and hence continue to collect from customers.The vehicles start and end their routes at a single depot empty.We take into consideration time windows associated with customers, disposal facilities and the depot.Here, we also have a driver rest period.The problem is solved using a number of metaheuristic algorithms namely tabu search (TS) and variable neighbourhood search (VNS).More over, we also present a combined metaheuristic algorithm based on variable neighbourhood tabu search (VNTS).Where the variable neighbourhood is searched via tabu search.Computational experiments on ten publicly available waste collection benchmark problems involving up to 2092 customers and 19 waste disposal facilities indicates that the proposed algorithms are able to find better quality solutions than previous work presented in literature within reasonable computation times.…”
Get full text
Get full text
Conference or Workshop Item -
10
Electricity demand forecasting in Turkey and Indonesia using linear and nonlinear models based on real-value genetic algorithm and extended Nelder-Mead local search
Published 2014“…Hybrid genetic algorithm (GA) and Nelder-Mead local search mode 1 has been used to minimize demand estimation errors. …”
Get full text
Get full text
Get full text
Thesis -
11
Neutralisation state driven single-agent search strategy for solving constraint satisfaction problem / Saajid Akram Ahmed Abuluaih
Published 2019“…Therefore, most of the recent research in the field is devoted to improving the problem solvers that utilize search strategies and techniques. Since Constraint Satisfaction Problem (CSP) is an NP-complete problem, brute-force search algorithms such as Backtracking algorithm (BT) are required as the guarantee to find a solution, when there is one. …”
Get full text
Get full text
Thesis -
12
Single and Multiple variables control using Tree Physiology Optimization
Published 2017Get full text
Get full text
Article -
13
The use of heuristic ordering and particle swarm optimization for nurse scheduling problem
Published 2017“…The comparison of the result of HOPSO, harmony search algorithm (HSA) and heuristic variable neighborhood search (HVNS) is presented. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
14
A new algorithm for normal and large-scale optimization problems: Nomadic People Optimizer
Published 2019“…The proposed and the benchmark algorithms are tested for large-scale optimization problems which are associated with high-dimensional variability. …”
Get full text
Get full text
Get full text
Get full text
Article -
15
Hybrid tabu search – strawberry algorithm for multidimensional knapsack problem
Published 2022“…It is also used extensively in experiments to test the performances of metaheuristic algorithms and their hybrids. For example, Tabu Search (TS) has been successfully hybridized with other techniques, including particle swarm optimization (PSO) algorithm and the two-stage TS algorithm to solve MKP. …”
Get full text
Get full text
Get full text
Thesis -
16
Real-time algorithmic music composition application.
Published 2022“…In addition, the system also utilises JavaFx and jFugue for its graphical user interface and music programming respectively. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
17
Application-Programming Interface (API) for Song Recognition Systems
Published 2024“…In addition the implementation is done by algorithm using Java’s programming language, executed through an application developed in the Android operating system. …”
Article -
18
Solving the vehicle routing problem with stochastic demands via hybrid genetic algorithm-tabu search
Published 2008“…Results from the experiment show the advantages of the proposed algorithm that are its robustness and better solution qualities resulted…”
Get full text
Get full text
Article -
19
Application of Multi-objective Genetic Algorithm (MOGA) optimization in machining processes
Published 2020“…It is suitable for solving multi-objective optimization related problems with the capability to explore the diverse regions of the solution space. Thus, it is possible to search a diverse set of solutions with more variables that can be optimized at one time. …”
Get full text
Get full text
Get full text
Get full text
Book Chapter -
20
Long-term electrical energy consumption: Formulating and forecasting via optimized gene expression programming / Seyed Hamidreza Aghay Kaboli
Published 2018“…In the developed feature selection approach, multi-objective binary-valued backtracking search algorithm (MOBBSA) is used as an efficient evolutionary search algorithm to search within different combinations of input variables and selects the non-dominated feature subsets, which minimize simultaneously both the estimation error and the number of features. …”
Get full text
Get full text
Get full text
Thesis
