In this paper, two of the local search algorithms are used (genetic algorithm and particle swarm optimization), in scheduling number of products (n jobs) on a single machine to minimize a multi-objective function which is denoted as  (total completion time, total tardiness, total earliness and the total late work). A branch and bound (BAB) method is used for comparing the results for (n) jobs starting from (5-18). The results show that the two algorithms have found the optimal and near optimal solutions in an appropriate times.

Each organization struggles to exploit each possible opportunity for gaining success and continuing with its work carrier. In this field, organization success can be concluded by fulfilling end user requirements combined with optimizing available resources usage within a specified time and acceptable quality level to gain maximum profit. The project ranking process is governed by the multi-criteria environment, which is more difficult for the governmental organization because other organizations' main target is maximizing profit constrained with available resources. The governmental organization should consider human, social, economic and many more factors. This paper focused on building a multi-criteria optimizing proje

In this research, the problem of multi- objective modal transport was formulated with mixed constraints to find the optimal solution. The foggy approach of the Multi-objective Transfer Model (MOTP) was applied. There are three objectives to reduce costs to the minimum cost of transportation, administrative cost and cost of the goods. The linear membership function, the Exponential membership function, and the Hyperbolic membership function. Where the proposed model was used in the General Company for the manufacture of grain to reduce the cost of transport to the minimum and to find the best plan to transfer the product according to the restrictions imposed on the model.

High vehicular mobility causes frequent changes in the density of vehicles, discontinuity in inter-vehicle communication, and constraints for routing protocols in vehicular ad hoc networks (VANETs). The routing must avoid forwarding packets through segments with low network density and high scale of network disconnections that may result in packet loss, delays, and increased communication overhead in route recovery. Therefore, both traffic and segment status must be considered. This paper presents real-time intersection-based segment aware routing (RTISAR), an intersection-based segment aware algorithm for geographic routing in VANETs. This routing algorithm provides an optimal route for forwarding the data packets toward their destination

The makers of strife exist in every era and time. They differ in how these temptations are created and the methods used in doing so. In our modern era, they are more; This is due to the presence of information technology and its easy availability at their fingertips, as well as the spread of social networking sites, which are rapidly spreading among ignorant groups and groups that are deficient in their use. Which led the makers of sedition to exploit these matters and create various temptations and spread them among peoples and societies. Today, we cannot predict the future of humanity in light of this huge amount of temptation. What the Holy Qur’an mentioned about the types of temptations in its noble verses and their embodiment in seve

     Financial fraud remains an ever-increasing problem in the financial industry with numerous consequences. The detection of fraudulent online transactions via credit cards has always been done using data mining (DM) techniques. However, fraud detection on credit card transactions (CCTs), which on its own, is a DM problem, has become a serious challenge because of two major reasons, (i) the frequent changes in the pattern of normal and fraudulent online activities, and (ii) the skewed nature of credit card fraud datasets. The detection of fraudulent CCTs mainly depends on the data sampling approach. This paper proposes a combined SVM- MPSO-MMPSO technique for credit card fraud detection. The dataset of CCTs which co

In this paper, membrane-based computing image segmentation, both region-based and edge-based, is proposed for medical images that involve two types of neighborhood relations between pixels. These neighborhood relations—namely, 4-adjacency and 8-adjacency of a membrane computing approach—construct a family of tissue-like P systems for segmenting actual 2D medical images in a constant number of steps; the two types of adjacency were compared using different hardware platforms. The process involves the generation of membrane-based segmentation rules for 2D medical images. The rules are written in the P-Lingua format and appended to the input image for visualization. The findings show that the neighborhood relations between pixels o

Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-ho