Search Results - (( solution construction path algorithm ) OR ( problem implementation using algorithm ))

An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman by Roslan, Saidatul Aisyah, Mohd Yatim, Siti Norhakimah, Sulaiman, Siti Sarah

Get full text
Get full text

Modeling dynamic weight for 3D navigation routing by Musliman, Ivin Amri, Abdul Rahman, Alias, Coors, Volker

“…The second part presents the 3D dynamic network model and elaborates on the possible solution using SSSP routing algorithm and its implementation. …”
Get full text
Get full text

Problem Solving by Yahaya, Azizi

“…Although well-structured problems may have a clear path to solution, the route to solution may still be difficult to follow. …”
Get full text
Get full text

Development of Hybrid Algorithm for Integrated Aircraft Routing Problem and Crew Pairing Problem by NurulFarihan Mohamed, ZaitulMarlizawati Zainuddin, Said Salhi, Nurul Huda Mohamed, NurulAkmal Mohamed

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

Embedding Malaysian House Red Ant Behavior into an Ant Colony System by Ali Othman, Zulaiha, Md Rais, Helmi, Hamdan, Abdul Razak

“…Problem statement: Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman Problem (TSP). …”
Get full text
Get full text

Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system by Khaksar, Weria, Tang, Sai Hong, Mohamed Sahari, Khairul Salleh, Khaksar, Mansoor, Toressen, Jim

“…In this paper, a novel sampling-based algorithm is proposed which is able to plan in an unknown environment and provides solutions with lower cost in terms of path length, runtime and stability of the results. …”
Get full text
Get full text

Differential evolution optimization for constrained routing in Wireless Mesh Networks by Sanni, Mistura Laide, Hassan Abdalla Hashim, Aisha, Hassan, Wan Haslina, Ahmed, Gharib Subhi Mahmoud, Anwar, Farhat, Zakaria, Omar

“…This solution addresses efficient and optimal routing path construction for cost and quality metrics of the application. …”
Get full text
Get full text
Get full text

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

Ant system with heuristics for capacitated vehicle routing problem by Tan, Wen Fang

“…As a result, the ASH algorithm is a viable alternative for addressing the CVRP with satisfactory solution quality and run time.…”
Get full text
Get full text

Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system by Khaksar W., Hong T.S., Sahari K.S.M., Khaksar M., Torresen J.

Development of a genetic algorithm controller for cartesian robot by Ong, Joo Hun

“…The objective of this project is to design, develop and optimize the performance of a Cartesian robotic arm in terms of its positioning and speed to perform spot welding application. The genetic algorithm (GA) will be introduce, it will be able to look for the optimum sequences to solve its path planning via evolutionary solutions. …”
Get full text
Get full text
Get full text
Get full text

Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

“…The focus of this study is developing a framework of QAPU and hybrid architecture for classical-quantum algorithms. The framework is used to increase the implementation performance of quantum algorithms. …”
Get full text
Get full text

Low-level hybridization scripting language with dynamic parameterization in PSO-GA / Suraya Masrom by Masrom, Suraya

“…However, in many cases, implementing the suitable hybrid algorithms for a given optimization problem is a considerably difficult, which in most cases, is time consuming. …”
Get full text
Get full text

Algebraic Net Class Rewriting Systems, Syntax and Semantics for Knowledge Representation and Automated Problem Solving by Tirri, Seppo Ilari

“…New results are obtained within construction of problem solving systems where solution algorithms are derived parallel with other candidates applied to the same net classes. …”
Get full text
Get full text

Festive season balancing groceries optimization / Fairuz Mohamed Razi by Mohamed Razi, Fairuz

“…This research uses Genetic Algorithms concept and technique to solve an optimization problem in shortage in supply-demand during festive season which is during Hari Raya Aidilfitri. …”
Get full text
Get full text

The Implementation of Genetic Algorithm in Path Optimization by Jumali, Suriana

“…In this project, TSP will be used to model and easy visualize the path optimization problem and Genetic Algorithm (GA) was chosen to be implemented in resolving the problem. …”
Get full text
Get full text

Enhancing Market-Based Scheduling Algorithm on Globally Distributed Web Servers Using Least Suitable Sealed Bid Technique by Al-Ewiwi, Mahmoud

“…Scheduling of a multiple distributed servers is considered as a complex problem.considered as NP-complete problem,where no single efficient algorithm guaranteed to produce optimal results.This thesis investigates on how to find optimal solution for distribute system,by implementing market based scheduling Algorithm(MBSA).On implementing the MBSA, a new auction technique which is the least suitable sealed bid auction will be introduced.it is found that least suitable sealed bid technique will give the close-to-optimum solution.In the implementation, cooperative agents were used as a middleware between web servers and stand-alone schedulers. …”
Get full text
Get full text

A Robust Graph Theoretic Solution of Routing in Intelligent Networks by Qureshi, M.A., Hassan, M.F., Ehsan, M.K., Khan, M.O., Ali, M.Y., Khan, S.

“…That is why a simple and efficient algorithm is the need of the time. A robust routing solution SPT with OV+E time complexity is proposed to supersede the existing landmark. …”
Get full text
Get full text

Diagnosis of eyesight using Improved Clonal Selection Algorithm (ICLONALG) / Nor Khirda Masri by Masri, Nor Khirda

“…This study aims to implement the classification algorithm using the Improved Clonal Selection Algorithm (ICLONALG) to classify the eyesight’s problems. …”
Get full text
Get full text