Search Results - (( problem using window algorithm ) OR ( java applications optimization algorithm ))
Search alternatives:
- applications optimization »
- java applications »
- window algorithm »
- using window »
-
1
Optimized crossover genetic algorithm for vehicle routing problem with time windows
Published 2010“…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
Article -
2
Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network
Published 2005“…This routing problem is an NPhard problem. Many algorithms are designed by many researchers to perform this routing such as window method, sequential algorithm, degree-descending algorithm, simulated annealing algorithm, genetic algorithm and ant colony algorithm.This thesis explores two approaches, sequential and parallel approaches. …”
Get full text
Get full text
Thesis -
3
Optimisation of vehicle routing problem with time windows using Harris Hawks optimiser
Published 2022“…The main objective of the study is to minimise the number of vehicles to be assigned for the routing problem subjected to the given time windows. The problem was optimised using a new algorithm known as Harris Hawks Optimiser (HHO). …”
Get full text
Get full text
Get full text
Article -
4
Solving multi-objective dynamic vehicle routing problem with time windows using multi-objective algorithm
Published 2022“…During the past decade, there is an increasing trend of published papers dealing with dynamic vehicle routing problems with time windows (DVRPTW) but not on multi-objective dynamic vehicle routing problems with time windows (MODVRPTW). …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
5
Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows
Published 2017“…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
Article -
6
Optimization of blood vessel detection in retina images using multithreading and native code for portable devices
Published 2013Get full text
Get full text
Conference or Workshop Item -
7
Performance evaluation of real-time multiprocessor scheduling algorithms
Published 2016“…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
Get full text
Get full text
Conference or Workshop Item -
8
Enhancement on the modified artificial bee colony algorithm to optimize the vehicle routing problem with time windows
Published 2022“…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
Thesis -
9
Parallel Optical Window Algorithm Applied to Optical Multistage Interconnection Network
Published 2008“…In this paper, a new parallel algorithm of the window method is developed called the Balanced Parallel Window Method (BPWM) algorithm. …”
Get full text
Get full text
Article -
10
Improving the efficiency of clustering algorithm for duplicates detection
Published 2023“…Window algorithms suffer from the window size. The larger the window, the greater the number of unnecessary comparisons, and the smaller the window size may prevent the detection of duplicates that are supposed to be within the window. …”
Get full text
Get full text
Get full text
Get full text
Article -
11
Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows
Published 2017“…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
Article -
12
Route Optimization System
Published 2005“…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
Get full text
Get full text
Final Year Project -
13
Formulating and solving stochastic truck and trailer routing problems using meta-heuristic algorithms / Seyedmehdi Mirmohammadsadeghi
Published 2015“…For solving this problem, the aforesaid algorithms have been applied. …”
Get full text
Get full text
Get full text
Thesis -
14
-
15
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…Enhance hybrid genetic algorithm and particle Swarm optimization are developed to select the optimal device in either fog or cloud. …”
Get full text
Get full text
Article -
16
Metaheuristics with disposal facility positioning for the waste collection VRP with time windows
Published 2013“…This paper improves heuristic algorithms presented in Benjamin and Beasley (Comput Oper Res 37(12):2270–2280, 2010) for solving the waste collection vehicle routing problem with time windows, particularly the real life waste collection benchmark problems from Kim et al.…”
Get full text
Get full text
Article -
17
Examining the round trip time and packet length effect on window size by using the Cuckoo search algorithm
Published 2016“…Round trip time (RTT) and packet length were captured over several network sessions. They were used as input and their effects were evaluated on window size as the output. …”
Get full text
Get full text
Get full text
Get full text
Article -
18
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 -
19
Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities
Published 2010“…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
Article -
20
An enhancement of sliding window algorithm for rainfall forecasting
Published 2017“…The validation analysis shows that the proposed method has a higher forecasting accuracy than the previous method of sliding window algorithm.…”
Get full text
Get full text
Get full text
Conference or Workshop Item
