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

Improvement of Centralized Routing and Scheduling Using Cross-Layer Design and Multi-Slot Assignment in Wimax Mesh Networks by Al-Humairi, Ali Zuhair Abdulameer

“…This thesis also proposes a centralized scheduling algorithm that can avoid the collision by constructing routing path with multi-slot single transceiver system for WiMAX mesh networks. …”
Get full text
Get full text

Interference avoidance routing and scheduling using multiple transceivers for IEEE 802.16 mesh network by Qasem, Yaaqob Ali Ahmed

“…This algorithm looks for a short path from the subscriber station (SS) node to BS, while the optimal path is achieved when the whole path has the lowest EbMR. …”
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

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

Autonomous path planning robot using geographical information by Ismail Ishaq Ibrahim

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

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

A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

“…The suggested algorithm outperforms the competition in terms of improving path cost, smoothness, and search time. …”
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

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

Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

“…Finally, the performances of both algorithms were analyzed and evaluated based on the required criteria. …”
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.

Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed by Aneesa Ali, Ali Saeed

“…A model-driven approach was used for generating abstract test cases from the feasible paths. This model driven approach was integrated with the proposed infeasible path detection method which based on analyzing various OCL constructs and operations. …”
Get full text
Get full text
Get full text

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

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

“…The objectives of this study are to construct the distance matrix and sequence matrix based on the network layout and to find the shortest path to collect the item in the warehouse. …”
Get full text
Get full text