Search Results - (( problem based window algorithm ) OR ( java application optimisation algorithm ))

Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows by Zakaria, M.N.

“…This paper presents a stochastic partially optimized cyclic shift crossover operator for the optimization of the multi-objective vehicle routing problem with time windows using genetic algorithms. …”
Get full text
Get full text

Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

“…The system is essentially a three-part development, utilising Android, Java Servlets, and Arduino platforms to create an optimised and automated urban-gardening system. …”
Get full text
Get full text
Get full text

Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows by Pierre, D.M., Zakaria, N.

“…This paper presents a stochastic partially optimized cyclic shift crossover operator for the optimization of the multi-objective vehicle routing problem with time windows using genetic algorithms. …”
Get full text
Get full text

Metaheuristics for the waste collection vehicle routing problem with time windows by Benjamin, Aida Mauziah, Beasley, J. E.

“…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

Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities by Benjamin, Aida Mauziah, Beasley, J. E.

“…We also have a driver rest period.The problem is solved heuristically.A neighbour set is defined for each customer as the set of customers that are close, but with compatible time windows. …”
Get full text
Get full text
Get full text

Examining the round trip time and packet length effect on window size by using the Cuckoo search algorithm by Abubakar, Adamu, Chiroma, Haruna, Khan, Abdullah, Mohamed, Elbaraa Eldaw Elnour

“…This signifies that the training was successful based on the fitted values of the window size. Thus the proposed model trained with the CS algorithm provides a high convergence rate to the true global minimum and a better optimal solution. …”
Get full text
Get full text
Get full text
Get full text

Flexible window-based scheduling with critical worst case latency evaluations for real time traffic in time sensitive networks by Muftah, Shalghum Khaled

“…The first part introduces a flexible window-overlapping scheduling (FWOS) algorithm that allows the TT windows to overlap in GCL implementations. …”
Get full text
Get full text

An enhancement of sliding window algorithm for rainfall forecasting by Azahar, Siti Nor Fathihah, Othman, Mahmod, Saian, Rizauddin

“…Therefore, this study proposed a forecasting rainfall method based on sliding window algorithm (SWA), in order to obtain the best rainfall prediction value. …”
Get full text
Get full text
Get full text

Agent-based extraction algorithm for computational problem solving by Rajabi, Maryam

“…On the other hand, agent-based model offers a good method to solve complex computational problems. …”
Get full text
Get full text

Overview of metaheuristic: classification of population and trajectory by Zainul Rashid, Zarina

Get full text
Get full text

Simulation for dynamic patients scheduling based on many objective optimization and coordinator by Mahmed, Ali Nader, Mohd Nizam, Mohmad Kahar

“…Finally, the role of the coordinator is to select a subset of patients from the window and pass them to the optimization algorithm. …”
Get full text
Get full text
Get full text

CC_TRS: continuous clustering of trajectory stream data based on micro cluster life by Abdulrazzaq, Musaab Riyadh, Mustapha, Norwati, Sulaiman, Md. Nasir, Mohd Sharef, Nurfadhlina

Get full text
Get full text
Get full text

Mathematical models and optimization algorithms for low-carbon Location-Inventory-Routing Problem with uncertainty by Liu, Lihua

“…Further more, an improved non-dominated sorting genetic algorithm with an elite strategy II (IMNSGA-II) has been developed to solve the two bi-objective models, surpassing existing literature’s algorithms such as Pareto Envelope-based Selection Algorithm II (PESA-II) and NSGA-II. …”
Get full text
Get full text
Get full text

Jawi sub-word recognition system using window-based segmentation-free approach / Roslim Mohamad by Mohamad, Roslim

Get full text
Get full text

Fast method to find conflicts in optical multistage interconnection networks by Abed, Farzaneh, Othman, Mohamed

“…In this paper, fast window method based on bitwise operations (BWM) is represented. …”
Get full text
Get full text
Get full text

Non-fiducial based electrocardiogram biometrics with kernel methods by Hejazi, Maryamsadat

“…The effectiveness of this algorithm is investigated by comparing with other AC based feature extraction algorithms involving AC/LDA (Linear Discriminant Analysis) and AC/PCA (Principal Component Analysis). …”
Get full text
Get full text

Fair bandwidth distribution marking and scheduling algorithm in network traffic classification by Al-Kharasani, Ameen Mohammed Abdulkarem

“…Second, propose an Optimized Time Sliding Window based Three Colour Marker. Finally, propose a new method of obtaining optimal parameters dropping functions for Random Early Detection (RED) algorithm. …”
Get full text
Get full text

Investigation of evolutionary multi-objective algorithms in solving view selection problem / Seyed Hamid Talebian by Talebian, Seyed Hamid

“…As a comparative study, the performance of the algorithms was evaluated based on various standard metrics. …”
Get full text
Get full text

Taguchi-Grey Relational Analysis Method for Parameter Tuning of Multi-objective Pareto Ant Colony System Algorithm by Muthana, Shatha Abdulhadi, Ku Mahamud, Ku Ruhana

“…These values can be benchmarked in solving multi-objective GMS problems using the multi-objective PACS algorithm and its variants.…”
Get full text
Get full text
Get full text

Simulation of identifying shortest path walkway in library by using ant colony optimization by Chui Teng, Chan

“…A research is proposed based on Ant Colony Optimization for solving the shortest path problem in library.This is a research that the algorithm is aim to implement on a robot. …”
Get full text
Get full text