Search Results - (( based evaluation path algorithm ) OR ( using optimization max algorithm ))

A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem by Odili, Julius Beneoluchi, Noraziah, Ahmad, Zarina, M.

“…The comparative algorithms in this study employ different techniques in their search for solutions to ATSP: the African Buffalo Optimization employs the modified Karp–Steele mechanism, Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO) employs the path construction with patching technique, Cooperative Genetic Ant System uses natural selection and ordering; Randomized Insertion Algorithm uses the random insertion approach, and the Improved Extremal Optimization uses the grid search strategy. …”
Get full text
Get full text
Get full text

A new strategy to improve the search performance of Max-Min Ant Aystem Algorithm when solving the Quadratic Assignment Problems by Phen, Chiak See

Get full text

An improvement of stochastic gradient descent approach for mean-variance portfolio optimization problem by S. W. Su, Stephanie, Kek, Sie Long

“…Furthermore, the applicability of SGD, Adam, AdaMax, Nadam, AMSGrad, and AdamSE algorithms in solving the mean-variance portfolio optimization problem is validated.…”
Get full text
Get full text
Get full text

Reactive max-min ant system: An experimental analysis of the combination with K-OPT local searches by Sagban, Rafid, Ku-Mahamud, Ku Ruhana, Abu Bakar, Muhamad Shahbani

“…The exploration versus exploitation dilemma rises in ACO search.Reactive max-min ant system algorithm is a recent proposition to automate the exploration and exploitation.It memorizes the search regions in terms of reactive heuristics to be harnessed after restart, which is to avoid the arbitrary exploration later.This paper examined the assumption that local heuristics are useless when combined with local search especially when it applied for combinatorial optimization problems with rugged fitness landscape.Results showed that coupling reactive heuristics with k-Opt local search algorithms produces higher quality solutions and more robust search than max-min ant system algorithm.Well-known combinatorial optimization problems are used in experiments, i.e. traveling salesman and quadratic assignment problems. …”
Get full text
Get full text
Get full text

A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

“…The motion planning problem poses the question of how a robot can move from an initial to a final position. Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
Get full text
Get full text

An optimal tasks scheduling algorithm based on QoS in cloud computing network by Alhakimi, Mohammed Ameen Mohammed Abdo

“…This study presents an optimal task scheduling algorithm by enhancing Max-Min and TS algorithm. …”
Get full text
Get full text

Multi-robot path planning based on the improved nutcracker optimization algorithm and the dynamic window approach by Zhao, Jiangrong, Ding, Hongwei, Zhu, Yuanjing, Yang, Zhijun, Hu, Peng, Wang, Zongshan

Get full text
Get full text
Get full text

Comparative Study of Weighted Product–Dijkstra’s Algorithm and All Possible Path Approach Based on Multiple Criteria and Multi-Dimensions by Ting Kien Hua, Noraini Abdullah

“…All Possible Path Algorithm (APPA) was another algorithm that was also used to rank all the alternatives path based on multiple criteria. …”
Get full text
Get full text
Get full text

Maximum 2-satisfiability in radial basis function neural network by Shehab Abdulhabib Alzaeemi, Saratha Sathasivam, Mohd Shareduwan Mohd Kasihmuddin, Mohd. Asyraf Mansor

“…This paper presents a new paradigm in using MAX2SAT by implementing in Radial Basis Function Neural Network (RBFNN). …”
Get full text
Get full text
Get full text

A comparative evaluation of heuristic and metaheuristic job scheduling algorithms for optimized resource management in cloud environments by Haque, Najmul, Zafril Rizal, M. Azmi, Murad, Saydul Akbar

“…The CloudSim simulator is applied to evaluate each algorithm using key performance metrics, including makespan, average flow time, and the number of cloudlets that fail to meet deadlines. …”
Get full text
Get full text
Get full text

Shortest Path Trajectory System Based on Dijkstra Algorithm by Putri, Indah Pratiwi

“…In the master project, the researcher discussed the shortest path solution to a single source problem based on Dijkstra algorithm as resolving the basic concepts. …”
Get full text
Get full text
Get full text
Get full text

Fair uplink bandwidth allocation and latency guarantee for mobile WiMAX using fuzzy adaptive deficit round robin by Alsahag, Ali Mohammed, Mohd Ali, Borhanuddin, Noordin, Nor Kamariah, Mohamad, Hafizal

“…In this paper, an efficient bandwidth allocation algorithm for the uplink traffic in mobile WiMAX is proposed. …”
Get full text
Get full text
Get full text

Cross-layer design using multi-channel system in WiMAX mesh networks by Al-Hemyari, Ali, Ng, Chee Kyun, Noordin, Nor Kamariah, Ismail, Alyani, Khatun, Sabira, Jamuar, Sudhanshu Shekhar

Get full text
Get full text

Wide area measurement system in the IEEE-14 bus system using multiobjective shortest path algorithm for fault analysis by Awalin, Lilik J., Syahirah, Abd Halim, Jafferi, Jamaludin, Nor Azuana, Ramli

“…The IEEE-14 bus system was modeled in PSCAD software for simulating nineteen types of fault based on multi-objective shortest path algorithm. …”
Get full text
Get full text
Get full text

Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria by Ting, Kien Hua, Noraini Abdullah

“…Dijkstra’s Algorithm is a shortest path algorithm that considers a single criterion only. …”
Get full text
Get full text
Get full text

A new minimum pheromone threshold strategy (MPTS) for max-min ant system by Wong, Kuan Yew, See, Phen Chiak

“…Among others is the ant colony optimization (ACO) algorithm, which was inspired by the foraging behavior of ants. …”
Get full text
Get full text

An exploration technique for the interacted multiple ant colonies optimization framework by Aljanaby A., Ku-Mahamud K.R., Norwawi N.Md.

OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

“…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”

Performance comparison of differential evolution and particle swarm optimization in constrained optimization by Iwan, Mahmud, Akmeliawati, Rini, Faisal, Tarig, Al-Assadi, Hayder M.A.A.

“…This paper presents a comparative study for min-max constrained optimization using PSO and DE. Here, the constrained optimization is represented by some selected standard benchmark functions. …”
Get full text
Get full text
Get full text

Link utilization of GA-based QoS routing algorithm by Yussof S., See O.H.

“…In the previous work, a GA-based QoS routing algorithm has been proposed and the performance of the algorithm with respect to its ability to a find a feasible path has been evaluated. …”