Search Results - (( using optimization window algorithm ) OR ( using selection path algorithm ))

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

“…The second part proposes an optimized flexible window-overlapping scheduling (OFWOS) algorithm that optimizes the offset difference ( ) between the samepriority TT windows in the adjacent nodes. …”
Get full text
Get full text

A Hybrid Metaheuristic Technique Based on Grey Wolf Optimisation, Symbiotic Organism Search, and Ant Colony Optimisation for Solving Multi-Objective Vehicle Routing Problems by Ary, Maxsi

“…The algorithm was first developed and tested using a standard benchmark dataset (Dantzig42), which was selected due to its standard usage in VRP research and its suitability for performance comparison owing to its structured complexity. …”
Get full text
Get full text
Get full text
Get full text

Optimized crossover genetic algorithm for vehicle routing problem with time windows by Nazif, Habibeh, Lee, Lai Soon

“…Conclusion/Recommendations: This study presented a genetic algorithm for solving vehicle routing problem with time windows using an optimized crossover operator. …”
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 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

Solving multi-objective dynamic vehicle routing problem with time windows using multi-objective algorithm by Khoo, Thau Soon

“…Our algorithm uses non-fitness evolutionary distributed parallelized adaptive large neighbourhood search (NEDPALNS). …”
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

An optimized aggregate marker algorithm for bandwidth fairness improvement in classifying traffic networks by Al-Kharasani, Ameen Mohammed Abdulkarem, Othman, Mohamed, Abdullah, Azizol, Kweh, Yeah Lun

“…This article analyses and evaluates a new time sliding window traffic marker algorithm called the Optimized time sliding window Three Colour Marker (OtswTCM). …”
Get full text
Get full text
Get full text

Automated path testing using the negative selection algorithm by Shayma Mustafa Mohi-Aldeen, Radziah Mohamad, Safaai Deris

“…Negative selection algorithm (NSA) has been used in this paper to generate test data for path testing automatically. …”
Get full text
Get full text

Enhancement on the modified artificial bee colony algorithm to optimize the vehicle routing problem with time windows by Sankor, Salah Mortada Shahen

“…The proposed algorithm was evaluated using benchmark datasets comprising 56 VRPTW instances and 56 Pickup and Delivery Problems with Time Windows (PDPTW). …”
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

Removal of high density salt and pepper noise from image and video based on optimal decision based algorithm by Khammar, Mohammad Reza, Saripan, M. Iqbal, Marhaban, Mohammad Hamiruce, Ishak, Asnor Juraiza

“…Detection is provided by using statistical analysis in each window, then the appropriate replacement for the noisy pixel is conducted from given values inside the current window or adjacent reconstructed pixels based on mean calculation and also, for very high density of noise which density of noise is bigger than 80%, the reconstruction is based on a recursive approach. …”
Get full text
Get full text

Path planning for unmanned aerial vehicles using visibility line-based methods by Omar, Rosli

“…The proposed 2D path planning algorithms, on the contrary, select a relatively smaller number of vertices using the so-called base line (BL), thus they are computationally efficient. …”
Get full text
Get full text

Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

“…Second, both the constructive procedure (CP) and the complementary procedure (CCP) heuristic algorithms computed the optimization considering only the execution path that has been predicted by the runtime path prediction method for criteria selection, eight QoS characteristics are suggested after investigating related works on the area of web service and web service composition. …”
Get full text
Get full text
Get full text
Get full text

Optimisation of Environmental Risk Assessment Architecture using Artificial Intelligence Techniques by Salem S. M. Khalifa

“…By contrast, the results of the safe path selection model were compared with the results obtained using Dijkstra's algorithm and the Floyd-Warshall algorithm. …”

A novel Bezier curve control point search algorithm for autonomous navigation using N-order polynomial search with boundary conditions by Sajith, Akhil Vinayak, Zakaria, M. A., Baarath, K., Anwar, P. P. Abdul Majeed

“…However, the Bezier curve is the most widely used in the curve fitting algorithm for vehicle path planning as it can generate a possible number of path maneuvers. …”
Get full text
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

Single Step Multivariate Solar Power Forecasting using Adaptive Learning Rate LSTM Model with Optimized Window Size by Kunalan D., Krishnan P.S., Permal N.

Route optimization using shortest path method / Muhamad Faisal Amin Shakri by Shakri, Muhamad Faisal Amin

“…This study investigated the implementation and comparison between well known shortest path method which are Dijkstra’s algorithm, Bellman-Ford, and A* algorithm. …”
Get full text
Get full text

A Continuous Overlay Path Probing Algorithm For Overlay Networks by Feily, Maryam

“…Such an in-band probing algorithm reduces measurement overhead on the selected overlay path. …”
Get full text
Get full text

Path planning for visually impaired people in an unfamiliar environment using particle swarm optimization by Yusof, T. S. T., Toha, Siti Fauziah, Md. Yusof, Hazlina

“…Here, in this paper, we propose a path planning with predetermined waypoints method using Particle Swarm Optimization (PSO) algorithm. …”
Get full text
Get full text
Get full text