Preferred Language
Articles
/
bsj-5924
Delivery Route Management based on Dijkstra Algorithm
...Show More Authors

For businesses that provide delivery services, the efficiency of the delivery process in terms of punctuality is very important. In addition to increasing customer trust, efficient route management, and selection are required to reduce vehicle fuel costs and expedite delivery. Some small and medium businesses still use conventional methods to manage delivery routes. Decisions to manage delivery schedules and routes do not use any specific methods to expedite the delivery settlement process. This process is inefficient, takes a long time, increases costs and is prone to errors. Therefore, the Dijkstra algorithm has been used to improve the delivery management process. A delivery management system was developed to help managers and drivers schedule efficient ways to deliver product orders to recipients. Based on testing, the Dijkstra algorithm that has been included in the nearest route search function for the delivery process has worked well. This system is expected to improve the efficient management and delivery of orders.

Scopus Clarivate Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Thu Jan 01 2015
Journal Name
Journal Of Al-mansoor College
An Improvement to Face Detection Algorithm for Non-Frontal Faces
...Show More Authors

Publication Date
Mon Jul 01 2019
Journal Name
2019 International Joint Conference On Neural Networks (ijcnn)
A Fast Feature Extraction Algorithm for Image and Video Processing
...Show More Authors

View Publication
Scopus (40)
Crossref (38)
Scopus Clarivate Crossref
Publication Date
Thu Feb 01 2024
Journal Name
Baghdad Science Journal
A Novel Gravity ‎Optimization Algorithm for Extractive Arabic Text Summarization
...Show More Authors

 

An automatic text summarization system mimics how humans summarize by picking the most ‎significant sentences in a source text. However, the complexities of the Arabic language have become ‎challenging to obtain information quickly and effectively. The main disadvantage of the ‎traditional approaches is that they are strictly constrained (especially for the Arabic language) by the ‎accuracy of sentence feature ‎functions, weighting schemes, ‎and similarity calculations. On the other hand, the meta-heuristic search approaches have a feature tha

... Show More
View Publication Preview PDF
Scopus (1)
Scopus Crossref
Publication Date
Sat May 01 2021
Journal Name
Journal Of Physics: Conference Series
A Parallel Adaptive Genetic Algorithm for Job Shop Scheduling Problem
...Show More Authors

Publication Date
Sun Dec 01 2013
Journal Name
2013 Ieee International Rf And Microwave Conference (rfm)
Differential Evolution algorithm for linear frequency modulation radar signal denoising
...Show More Authors

Signal denoising is directly related to sample estimation of received signals, either by estimating the equation parameters for the target reflections or the surrounding noise and clutter accompanying the data of interest. Radar signals recorded using analogue or digital devices are not immune to noise. Random or white noise with no coherency is mainly produced in the form of random electrons, and caused by heat, environment, and stray circuitry loses. These factors influence the output signal voltage, thus creating detectable noise. Differential Evolution (DE) is an effectual, competent, and robust optimisation method used to solve different problems in the engineering and scientific domains, such as in signal processing. This paper looks

... Show More
View Publication
Scopus Crossref
Publication Date
Fri Feb 08 2019
Journal Name
Journal Of The College Of Education For Women
Minimum Spanning Tree Algorithm for Skin Cancer Image Object Detection
...Show More Authors

This paper proposes a new method Object Detection in Skin Cancer Image, the minimum
spanning tree Detection descriptor (MST). This ObjectDetection descriptor builds on the
structure of the minimum spanning tree constructed on the targettraining set of Skin Cancer
Images only. The Skin Cancer Image Detection of test objects relies on their distances to the
closest edge of thattree. Our experimentsshow that the Minimum Spanning Tree (MST) performs
especially well in case of Fogginessimage problems and in highNoisespaces for Skin Cancer
Image.
The proposed method of Object Detection Skin Cancer Image wasimplemented and tested on
different Skin Cancer Images. We obtained very good results . The experiment showed that

... Show More
View Publication Preview PDF
Publication Date
Mon Mar 08 2021
Journal Name
Baghdad Science Journal
Development of six-degree of freedom strapdown terrestrial INS algorithm
...Show More Authors

Many of accurate inertial guided missilc systems need to use more complex mathematical calculations and require a high speed processing to ensure the real-time opreation. This will give rise to the need of developing an effcint

View Publication Preview PDF
Publication Date
Thu May 01 2008
Journal Name
2008 International Conference On Computer And Communication Engineering
A binary Particle Swarm Optimization for attacking knapsacks Cipher Algorithm
...Show More Authors

View Publication
Scopus (11)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Sat Nov 30 2019
Journal Name
Journal Of Engineering And Applied Sciences
Using Particle Swarm Optimization Algorithm to Address the Multicollinearity Problem
...Show More Authors

View Publication
Scopus (2)
Scopus Crossref
Publication Date
Mon May 01 2017
Journal Name
Australian Journal Of Basic And Applied Sciences
Sprite Region Allocation Using Fast Static Sprite Area Detection Algorithm
...Show More Authors

Background: Sprite coding is a very effective technique for clarifying the background video object. The sprite generation is an open issue because of the foreground objects which prevent the precision of camera motion estimation and blurs the created sprite. Objective: In this paper, a quick and basic static method for sprite area detection in video data is presented. Two statistical methods are applied; the mean and standard deviation of every pixel (over all group of video frame) to determine whether the pixel is a piece of the selected static sprite range or not. A binary map array is built for demonstrating the allocated sprite (as 1) while the non-sprite (as 0) pixels valued. Likewise, holes and gaps filling strategy was utilized to re

... Show More
View Publication Preview PDF