Search Results - (( solution construction phase algorithm ) OR ( java implementation path algorithm ))

Search alternatives:

Refine Results
  1. 1
    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    A hybrid adaptive harmony search with modified great deluge algorithm for school timetabling

    A hybrid adaptive harmony search with modified great deluge algorithm for school timetabling by Arbaoui, Billel

    Published 2025
    “…In Phase 1, heuristic rules refine the time assignment stage to improve an existing construction algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Smart appointment organizer for mobile application / Mohd Syafiq Adam

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Design and statistical analysis of initial solution construction approach in curriculum based course timetabling problem

    Design and statistical analysis of initial solution construction approach in curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2017
    “…To produce a population of initial solution require algorithm that can produce multiple feasible solutions and these solutions must be diverse. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  7. 7
    Enhancing the Sorting Layers in the Initial Stage of High School Timetabling

    Enhancing the Sorting Layers in the Initial Stage of High School Timetabling by Arbaoui, Billel, Wahid, Juliana, Abdul-Rahman, Syariza

    Published 2020
    “…Generally, NP-Complete problem was solved firstly by constructing the initial solution, in the construction phase. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  8. 8
    Constructing population of initial solutions for curriculum – based course timetabling problem

    Constructing population of initial solutions for curriculum – based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2012
    “…Future work will use the best settings of heuristics to the improvement phase in population-based improvement algorithm.…”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  9. 9
    Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics

    Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2016
    “…The construction of population of initial solution is a crucial task in population-based metaheuristic approach for solving curriculum-based university course timetabling problem because it can affect the convergence speed and also the quality of the final solution.This paper presents an exploration on combination of graph heuristics in construction approach in curriculum based course timetabling problem to produce a population of initial solutions.The graph heuristics were set as single and combination of two heuristics.In addition, several ways of assigning courses into room and timeslot are implemented.All settings of heuristics are then tested on the same curriculum based course timetabling problem instances and are compared with each other in terms of number of population produced.The result shows that combination of largest degree followed by saturation degree heuristic produce the highest number of population of initial solutions.The results from this study can be used in the improvement phase of algorithm that uses population of initial solutions…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem

    Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem by Nurhazwani, Ahmad Razak

    Published 2021
    “…The methodology consists of three phases. First, the profitable cells were constructed by applying ECBA. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Embedding Malaysian House Red Ant Behavior into an Ant Colony System

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

    Published 2008
    “…The three level phases of pheromone updates are: local construction, local reinforcement and global reinforcement. …”
    Get full text
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  12. 12
    Development of two matheuristics for production-inventory-distribution routing problem / Dicky Lim Teik Kyee

    Development of two matheuristics for production-inventory-distribution routing problem / Dicky Lim Teik Kyee by Dicky Lim , Teik Kyee

    Published 2018
    “…Phase 2 uses VNS and we utilize both phases in an interactive manner. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    A MODIFIED PARTICLE SWARM OPTIMIZATION ALGORITHM FOR WELLBORE TRAJECTORY DESIGN

    A MODIFIED PARTICLE SWARM OPTIMIZATION ALGORITHM FOR WELLBORE TRAJECTORY DESIGN by BISWAS, KALLOL

    Published 2021
    “…The improvements of the original PSO algorithm are proposed by updating its exploitation phase by incorporating the GWO algorithm because of its strong exploitation capability and the exploration phase using a cellular automaton due to its ability to explore more area by constructing new neighbours. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    A Tabu Search Approach with Embedded Nurse Preferences for Solving Nurse Rostering Problem

    A Tabu Search Approach with Embedded Nurse Preferences for Solving Nurse Rostering Problem by Ramli, Razamin, Ahmad, Siti Nurin Ima, Abdul-Rahman, Syariza, Wibowo, Antoni

    Published 2020
    “…The methodology consists of two phases: initialization and neighborhood. The semi-random initialization is employed for finding a good initial solution during the initialization phase which avoids the violation of hard constraints, while the neighborhood phase is established for further improving the solution quality with a special representation and innovative neighborhood generations within TS algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    A tabu search approach with embedded nurse preferences for solving nurse rostering problem

    A tabu search approach with embedded nurse preferences for solving nurse rostering problem by Ramli, Razamin, Ahmad, Siti Nurin Ima, Abdul-Rahman, Syariza, Wibowo, Antoni

    Published 2020
    “…The methodology consists of two phases: initialization and neighborhood. The semi-random initialization is employed for finding a good initial solution during the initialization phase which avoids the violation of hard constraints, while the neighborhood phase is established for further improving the solution quality with a special representation and innovative neighborhood generations within TS algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Generic DNA encoding design scheme to solve combinatorial problems

    Generic DNA encoding design scheme to solve combinatorial problems by Rofilde, Hasudungan

    Published 2015
    “…However, DNA computing can solve the problem in linear time since the parallel processing power of DNA computing is able to generate a solution in a single process. DNA encoding is the first important step in DNA computing phases. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Development of a Negotiation Support Model for Value Management in Construction

    Development of a Negotiation Support Model for Value Management in Construction by UTOMO, CHRISTIONO

    Published 2009
    “…In such situation where the designer, project manager, facility manager and others are involved in choosing a single alternative from a set of solutions, a negotiation support is required to evaluate and rank the solution before engaging into negotiation. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  18. 18
    Development of process framework for ontology construction through ontology mapping / Syerina Azlin Md Nasir

    Development of process framework for ontology construction through ontology mapping / Syerina Azlin Md Nasir by Md Nasir, Syerina Azlin

    Published 2016
    “…Automated mapping through the use various existing algorithms offers an efficient solution but suffers in knowledge loss. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Sentiment analysis for malay newspaper (SAMNews) using negative selection algorithm / Nur Amalina Redzuan

    Sentiment analysis for malay newspaper (SAMNews) using negative selection algorithm / Nur Amalina Redzuan by Redzuan, Nur Amalina

    Published 2013
    “…Sentiment Analysis for Malay Newspaper (SAMNews) is constructed using the negative selection algorithm which is able to classify the sentiment in newspaper’s sentences into the polarity (positive, negative or neutral) automatically repose on detectors word. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Ant colony optimization for container loading problem.

    Ant colony optimization for container loading problem. by Yap, Ching Nei, Lee, Lai Soon, Abdul Majid, Zanariah, Seow, Hsin Vonn

    Published 2012
    “…In the first phase, ACO with its probabilistic decision rule was used to construct a sequence of boxes. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: