Search Results - (( using solution window algorithm ) OR ( java implementation bees algorithm ))

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

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

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

Formulating and solving stochastic truck and trailer routing problems using meta-heuristic algorithms / Seyedmehdi Mirmohammadsadeghi by Seyedmehdi, Mirmohammadsadeghi

“…Twenty one benchmark-instances have been modified for this case and solved by using the aforesaid algorithms. Afterward, the TTRPSD is extended by considering the time window constraints. …”
Get full text
Get full text
Get full text

Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

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

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

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

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. 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

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

“…Therefore, it treats PASP as a multi-objective dynamic optimization of a useful solution. NSGA-II is guaranteed 0.96 percent dominance over NSGA-II and 100 percent dominance of all other algorithms.…”
Get full text
Get full text
Get full text

Memetic Heuristic Approach for Solving Truck and Trailer Routing Problems with Stochastic Demands and Time Windows by Mirmohammadsadeghi, S., Ahmed, S.

“…The results can be compared with the VRPSDTW (vehicle routing problem with stochastic demands (VRSPD) with time windows) solution obtained using large neighbourhood search (LNS) of earlier research. …”
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

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

“…In any metaheuristic, the parameter values strongly affect the efficiency of an algorithm’s search. This research aims to find the optimal parameter values for the Pareto Ant Colony System (PACS) algorithm, which is used to obtain solutions for the generator maintenance scheduling problem. …”
Get full text
Get full text
Get full text

Optimised Crossover Genetic Algorithms for Combinatorial Optimisation Problems by Nazif, Habibeh

“…A Genetic Algorithm is successful in generating near -optimal solutions if it is able to produce o®spring during crossover that is better than the parent solutions. …”
Get full text
Get full text

Bi-objective mixed integer nonlinear programming model for low carbon location-inventory-routing problem with time windows and customer satisfaction by Liu, Lihua, He, Aneng, Tian, Tian, Lee, Lai Soon, Seow, Hsin-Vonn

“…The IMNSGA-II produces the Pareto optimal solution set, and an entropy–TOPSIS method is used to generate an objective ranking of the solution set for decision-makers. …”
Get full text
Get full text
Get full text

Improving collection of data type evidence and the integrity of evidence collected using SHA-256 hashing algorithm for web browsers by Asmawi, Aziah, Md Yasin, Sharifah, Mohd Shah, Nur Hazierah

“…The use of the SHA-256 hash algorithm currently considered secure and resistant to collision attacks. …”
Get full text
Get full text
Get full text

Efficient hardware design for palm-dorsa vein image enhancement by Jusoh@Yusoff, Suhaimi Bahisham

“…The aim of this thesis is to develop hardware design for palm-dorsa vein image enhancement algorithm. The algorithm is designed in hardware using hardware description language for hardware realization. …”
Get full text
Get full text
Get full text

Fast ZeroY algorithm for efficient message routing in optical multistage interconnection networks by Raja Mohd Auzar, Tengku Dian Shahida, Othman, Mohamed, Abdullah, Mohamad Khazani

“…The Bitwise Window Method (BWM) is used to identify potential message conflicts that may further lead to optical crosstalk. …”
Get full text
Get full text

Vehicle routing problem: models and solutions by Liong, Choong Yeun, Wan Rosmanira Ismail, Khairuddin Omar, Mourad Zirour

Get full text
Get full text
Get full text

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

“…The tool is used to evaluate the accuracy of the proposed extraction algorithm to extract the appropriate information which are needed. …”
Get full text
Get full text

Simulation and Visualization of TSP Using Ant Colony Optimization by Tri Basuki, Kurniawan, Misinem, ., Astried, ., Joan Angelina, Widians

“…While naturally, it will require a significant amount of time and effort to finish a lot of complex work by hand such as TSP, one of the most exciting advances in software development is the discovery of optimization algorithms. When we are presented with a difficult assignment, optimization techniques can be used to ensure that the complex work is completed efficiently and quickly, including identifying the best solution to solve it. …”
Get full text
Get full text
Get full text