Search Results - (( initial solution case algorithm ) OR ( using codification using algorithm ))

Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

“…This paper investigated the efficiency of six heuristic algorithms from prior studies in the attempt to solve issues related to waste collection, namely: (i) Nearest Greedy (NG), (ii) Further from Depot (FFD), (iii) Different Initial Customer (DIC), (iv) Savings Approach, (v) Sweep Algorithm, and (vi) Different Initial Customer based on Sweep Algorithm. …”
Get full text
Get full text
Get full text

Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

“…This paper investigated the efficiency of six heuristic algorithms from prior studies in the attempt to solve issues related to waste collection, namely: (i) Nearest Greedy (NG), (ii) Further from Depot (FFD), (iii) Different Initial Customer (DIC), (iv) Savings Approach, (v) Sweep Algorithm, and (vi) Different Initial Customer based on Sweep Algorithm. …”
Get full text
Get full text
Get full text

Simulated annealing algorithm for solving chambering student-case assignment problem by Ghazali, Saadiah, Abdul Rahman, Syariza

“…The objective of the study is to minimize the total completion time for all students in solving the given cases.This study employed a minimum cost greedy heuristic in order to construct a feasible initial solution.The search then is preceded with a simulated annealing algorithm for further improvement of solution quality.The analysis of the obtained result has shown that the proposed simulated annealing algorithm has greatly improved the solution constructed by the minimum cost greedy heuristic. …”
Get full text
Get full text
Get full text

Comparison between Newton’s Method and a new Scaling Newton Method / Ramizah Baharuddin by Baharuddin, Ramizah

“…This initial value is often called the “initial guess”. …”
Get full text
Get full text

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

“…Moreover, fifty four benchmark instances have been modified for this case. The initial feasible solutions have been generated for this purpose. …”
Get full text
Get full text
Get full text

The Determination of Pile Capacity Using Artificial Neural-net: An Optimization Approach by Ab. Malik, Rosely, Jamil S., Mohamed

“…Using the developed algorithm, the safety measures involved are such as reliability index and the probability of failure; instead of only factor of safety if conventional deterministic approach is used. …”
Get full text
Get full text

Selecting quality initial random seed for metaheuristic pproaches: a case of timetabling problem by Md Sultan, Abu Bakar, Mahmod, Ramlan, Sulaiman, Md. Nasir, Abu Bakar, Mohd Rizam

Get full text
Get full text
Get full text

Modified Sumudu Transform Analytical Approximate Methods For Solving Boundary Value Problems by Al-Nemrat, Asem Mustafa Moh’ad

“…For the proposed methods, the trial function was employed as an initial approximation to provide more accurate approximate solutions for the considered problems. …”
Get full text
Get full text

Modified Sumudu Transform Analytical Approximate Methods For Solving Boundary Value Problems by Al-Nemrat, Asem Mustafa Moh’ad

“…For the proposed methods, the trial function was employed as an initial approximation to provide more accurate approximate solutions for the considered problems. …”
Get full text
Get full text

A Hybrid ant colony optimization algorithm for solving a highly constrained nurse rostering problem by Ramli, Razamin, Abd Rahman, Rosshairy, Rohim, Nurdalila

“…Specifically, three main phases were involved in developing the hybrid model, which are generating an initial roster, updating the roster through the ACO algorithm, and implementing the hill climbing to further search for a refined solution. …”
Get full text
Get full text
Get full text

Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

“…However, the HKA algorithm has its own flaws. Although it was introduced as a population-based stochastic optimization algorithm, HKA is not exactly a population-based algorithm because it initializes and updates only a single solution. …”
Get full text
Get full text

Direct solutions of N-th order initial value problems in decomposition series by Yahaya F., Hashim I., Ismail E.S., Zulkifle A.K.

“…In this paper, a class of linear and non-linear nth-order initial value problems (IVPs) is considered. The solutions of these IVPs are obtained by adapting the modified Adomian decomposition method (MADM) as an algorithm for approximating the solutions of the equations in a sequence of time intervals (i.e. time steps). …”

Power system network splitting and load frequency control optimization using ABC based algorithms / Kanendra Naidu a/l Vijyakumar by Vijyakumar, Kanendra Naidu

“…The graph theory is used to represent the power system based on interconnection between the buses through the adjacency matrix. The edge reduction algorithm is initially applied to reduce the search space to obtain the initial solution. …”
Get full text
Get full text

A Preliminary Study On Firefly Algorithm Approach For Travelling Salesman Problem by Ismail, Mohd Muzafar, Che Hasan, Mohd Hanif, Mohamad @ Ab Rahman, Syahrul Hisham, Jaafar, Hazriq Izzuan

“…Each firefly in Firefly Algorithm represents a candidate solution of the Travelling Salesman Problem. …”
Get full text
Get full text

Hybrid fuzzy-sliding mode observer design for estimation and advanced control of an ethylene polymerization process / Jarinah Mohd Ali by Jarinah , Mohd Ali

“…The first case is the known initial state without constraint, which is the ideal case for study or more likely for programming validation purposes. …”
Get full text
Get full text
Get full text

A hybrid bat�swarm algorithm for optimizing dam and reservoir operation by Yaseen Z.M., Allawi M.F., Karami H., Ehteram M., Farzin S., Ahmed A.N., Koting S.B., Mohd N.S., Jaafar W.Z.B., Afan H.A., El-Shafie A.

Nearest greedy for solving the waste collection vehicle routing problem: A case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza, Wibowo, Antoni

“…This technique has been widely used to devise initial solutions for issues concerning vehicle routing. …”
Get full text
Get full text

Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

“…This research first proposes an improved continuous MOPSO to address the rapid clustering problem that exists in the basic PSO algorithm using three improvement strategies: re-initialization of particles, systematic switch of best solutions and mutation on global best selection. …”
Get full text
Get full text
Get full text
Get full text

A hybrid bat–swarm algorithm for optimizing dam and reservoir operation by Yaseen, Zaher Mundher, Allawi, Mohammed Falah, Karami, Hojat, Ehteram, Mohammad, Farzin, Saeed, Ahmed, Ali Najah, Koting, Suhana, Mohd, Nuruol Syuhadaa, Jaafar, Wan Zurina Wan, Afan, Haitham Abdulmohsin, El-Shafie, Ahmed

“…In addition, different optimization algorithms from previous studies are investigated to compare the performance of the proposed algorithm with existing algorithms for the same case study. …”
Get full text
Get full text

Vehicle pick-up and drop-off schedule optimization in a university setting by Teo, Chun Kit

“…A simulated annealing-based multi-directional iterative local search algorithm is employed for solution optimization. The initial solution is generated by distributing requests across vehicles, and local searches are performed through request swapping and movement. …”
Get full text
Get full text