Search Results - (( java implementation path algorithm ) OR ( problem shift scheduling algorithm ))

Solving security staff scheduling by using genetic algorithm by Ang, Shin Yin

“…Therefore, in this research, a flexible shift scheduling is studied because the scheduling problem should be humanized to follow the trend. …”
Get full text
Get full text
Get full text
Get full text

Garbage truck staff duty roster using genetic algorithm / Nadea Suneeza Zulkifli by Zulkifli, Nadea Suneeza

“…In this research, is intended to address the specific problem of scheduling stafls on daily shifts lor the duration of a month schedule. …”
Get full text
Get full text

Heuristic Algorithm For Nurse Scheduling Problem by Wee, Sze Ming

“…The Nurse Scheduling Problem (NSP) deals with allocating the nurses' required shifts over a scheduling period while taking into consideration several restrictions. …”
Get full text
Get full text

Heuristic method for optimum shift scheduling design by Lee, Kong Weng, Sze, San Nah, Phang, Keat Keong

“…Based on the minimum manpower number and shift criteria’s, the shifts are then assigned to form schedules using our proposed algorithm.The potential schedules are then optimized.Our prototype running data from airline staff shows that the method used can solve the problem efficiently even for large problem instances in seconds.…”
Get full text
Get full text
Get full text

Enhanced evolutionary algorithm with cuckoo search for nurse scheduling and rescheduling problem by Lim, Huai Tein

“…To address some of the issues, utilizing the existing nurses through an effective work schedule is the best alternative. However, there exists a problem of creating undesirable and non-stable nurse schedules for nurses' shift work. …”
Get full text
Get full text
Get full text

Tasks Distribution In Driver Scheduling Using Dynamic Set Of Bandwidth In Harmony Search Algorithm With 2-Opt by Shaffiei, Zatul Alwani

“…This research was focused on driver scheduling problem for university shuttle bus (DSPUSB). …”
Get full text
Get full text
Get full text

Modified Parameters of Harmony Search Algorithm for Better Searching by Nur Farraliza, Mansor, Abas, Z.A, Shibghatullah, A.S., Rahman, A.F.N.A

“…The scheduling and rostering problems are deliberated as integrated due to they depend on each other whereby the input of rostering problems is a scheduling problems. …”
Get full text
Get full text

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

“…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

Optimisation model for scheduling MapReduce jobs in big data processing / Ibrahim Abaker Targio Hashem by Ibrahim Abaker , Targio Hashem

“…The proposed algorithm is evaluated using tasks scheduling in the scheduling load simulator and validated using statistical modeling. …”
Get full text
Get full text
Get full text

Constrained Self-Adaptive Harmony Search Algorithm With 2-Opt Swapping For Driver Scheduling Problem Of University Shuttle Bus by Shaffiei, Zatul Alwani, Abal Abas, Zuraida, Md Yunos, Norhazwani, Amir Hamzah, Amir Syafiq Syamin Syah, Zainal Abidin, Zaheera, Chong, Kuan Eng

“…A constrained self-adaptive harmony search algorithm (CSAHS) with 2-opt swapping (CSAHS-2opt) for driver scheduling problem of university shuttle bus (DSPUSB) was proposed in this study. …”
Get full text
Get full text
Get full text

Optimising police officer schedule at Ibu Pejabat Polis Daerah (IPD) Kuala Muda using goal programming / Nurul Atikah Abdull by Abdull, Nurul Atikah

“…But it is therefore suggested that a hybrid swarm-based optimisation algorithm and a few methods be used to solve scheduling problems instead of goal programming as they provide efficiency and flexibility on the generated schedules.…”
Get full text
Get full text

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

“…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

Enhancing harmony search parameters based on step and linear function for bus driver scheduling and rostering problems by Mansor, Nur Farraliza

“…Optimization is a major challenge in numerous practical world problems.According to the “No Free Lunch (NFL)” theorem,there is no existing single optimizer algorithm that is able to resolve all issues in an effective and efficient manner.It is varied and need to be solved according to the specific capabilities inherent to certain algorithms making it hard to foresee the algorithm that is best suited for each problem.As a result,the heuristic technique is adopted for this research as it has been identified as a potentially suitable algorithm.Alternative heuristic algorithms are also suggested to obtain optimal solutions with reasonable computational effort.However,the heuristic approach failed to produce a solution that nears optimum when the complexity of a problem increases;therefore a type of nature-inspired algorithm known as meta-euristics which utilises an intelligent searching mechanism over a population is considered and consequently used.The meta-heuristic approach is widely used to substitute heuristic terms and is broadly applied to address problems with regards to driver scheduling.However,this meta-heuristic technique is still unable to address the fairness issue in the scheduling and rostering problems.Hence,this research proposes a strategy to adopt an amendment of the harmony search algorithm in order to address the fairness issue which in turn will escalate the level of fairness in driver scheduling and rostering.The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems.In this respect,the three main operators in harmony search,namely the Harmony Memory Consideration Rate (HMCR),Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration.These parameters influence the overall performance of the HS algorithm,and therefore it is crucial to fine-tune them. …”
Get full text
Get full text
Get full text

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

“…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

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

“…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

The use of heuristic ordering and particle swarm optimization for nurse scheduling problem by Mohd Rasip, Norhayati

“…The challenge of nurse scheduling is the substantial amount of time for assigning shifts to a set of nurses that involves a large set of constraints. …”
Get full text
Get full text
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

“…Hence, this study focused on solving those issues arising in nurse rostering problems (NRPs) strategizing on a hybrid of Ant Colony Optimization (ACO) algorithm with a hill climbing technique. …”
Get full text
Get full text
Get full text

Optimization in driver’s scheduling for university shuttle bus using harmony search by Shaffiei, Zatul Alwani, Abal Abas, Zuraida, Abdul Rahman, Ahmad Fadzli Nizam, Shibghatullah, Abdul Samad, Hussin, Burairah

“…This paper is about driver scheduling which is categorized as a difficult combinatorial problem. …”
Get full text
Get full text

Hybrid dynamic scheduling model for flexible manufacturing system with machine availability and new job arrivals by Paslar, Shahla

“…The performance of the schedules as produced by the scheduling/rescheduling algorithms were investigated and compared. …”
Get full text
Get full text

Multi-objective scheduling of MapReduce jobs in big data processing by Hashem, Ibrahim Abaker Targio, Anuar, Nor Badrul, Marjani, Mohsen, Gani, Abdullah, Sangaiah, Arun Kumar, Sakariyah, Adewole Kayode

“…The model consists of two objective functions, namely, (i) completion time and (ii) cost minimization. Second, a scheduling algorithm using earliest finish time scheduling that considers resource allocation and job scheduling in the cloud is proposed. …”
Get full text
Get full text