Salama A. Mostafa

Solving vehicle routing problem by using improved genetic algorithm for optimal solution

Abstract Context The Vehicle Routing Problem (VRP) has numerous applications in real life. It clarifies in a wide area of transportation and distribution such as transportation of individuals and items, conveyance service and garbage collection. Thus, an appropriate selecting of vehicle routing has an extensive influence role to improve the economic interests and appropriateness of logistics planning. Problem In this study the problem is as follows: Universiti Tenaga Nasional (UNITEN) has eight buses which are used for transporting students within the campus. Each bus starts from a main location at different times every day. The bus picks up students from eight locations inside the campus in two different routes and returns back to the main location at specific times every day, starting from early morning until the end of official working hours, on the following conditions: Every location will be visited once in each route and the capacity of each bus is enough for all students included in each route. Objectives Our paper attempt to find an optimal route result for VRP of UNITEN by using genetic algorithm. To achieve an optimal solution for VRP of UNITEN with the accompanying targets: To reduce the time consuming and distance for all paths. which leads to the speedy transportation of students to their locations, to reduce the transportation costs such as fuel utilization and additionally the vehicle upkeep costs, to implement the Capacitated Vehicle Routing Problem (CVRP) model for optimizing UNITEN’s shuttle bus services. To implement the algorithm which can be used and applied for any problems in the like of UNITEN VRP. Approach The Approach has been presented based on two phases: firstly, find the shortest route for VRP to help UNITEN University reduce student’s transportation costs by genetic algorithm is used to solve this problem as it is capable of solving many complex problems; secondly, identify The CVRP model is implemented for optimizing UNITEN shuttle bus services. Finding The findings outcome from this study have shown that: (1) A comprehensive listed of active GACVRP; (2) Identified and established an evaluation criterion for GACVRP of UNITEN; (3) Highlight the methods, based on hybrid crossover operation, for selecting the best way (4) genetic algorithm finds a shorter distance for route A and route B. The proportion of reduction the distance for each route is relatively short, but the savings in the distance becomes greater when calculating the total distances traveled by all buses daily or monthly. This applies also to the time factor that has been reduced slightly based on the rate of reduction in the distances of the routes.

A Dynamic Measurement of Agent Autonomy in the Layered Adjustable Autonomy Model

In a dynamically interactive systems that contain a mix of humans’ and software agents’ intelligence, managing autonomy is a challenging task. Giving an agent a complete control over its autonomy is a risky practice while manually setting the agent’s autonomy level is an inefficient approach. In this paper, we propose an autonomy measurement mechanism and its related formulae for the Layered Adjustable Autonomy (LAA) model. Our model provides a mechanism that optimizes autonomy distribution, consequently, enabling global control of the autonomous agents that guides or even withholds them whenever necessary. This is achieved by formulating intervention rules on the agents’ decision-making capabilities through autonomy measurement criteria. Our aim is to create an autonomy model that is flexible and reliable.

Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution

Abstract Context Vehicle routing problem (VRP) is one of the many difficult issues that have no perfect solutions yet. Many researchers over the last few decades have established numerous researches and used many methods with different techniques to handle it. But, for all research, finding the lowest cost is very complex. However, they have managed to come up with approximate solutions that differ in efficiencies depending on the search space. Problem In this study the problem is as follows: have a number of vehicles which are used for transporting applications to instance place. Each vehicle starts from a main location at different times every day. The vehicle picks up applications from start locations to the instance place in many different routes and return back to the start location in at specific times every day, starting from early morning until the end of official working hours, on the following conditions: (1) Every location will be visited once in each route, and (2) The capacity of each vehicle is enough for all applications included in each route. Objectives Our paper attempt to find an optimal route result for VRP by using K-Nearest Neighbor Algorithm (KNNA). To achieve an optimal solution for VRP with the accompanying targets: (1) To reduce the distance and the time for all paths this leads to speedy the transportation of customers to their locations, (2) To implement the capacitated vehicle routing problem (CVRP) model for optimizing the solutions. Approach The approach has been presented based on two phases: firstly, the algorithms have been adapted to solve the research problem, where its procedure is different than the common algorithm. The structure of the algorithm is designed so that the program does not require a large database to store the population, which speeds up the implementation of the program execution to obtain the solution; secondly, the algorithm has proven its success in solving the problem and finds a shortest route. For the purpose of testing the algorithm’s capability and reliability, it was applied to solve the same problem online validated and it achieved success in finding a shorter route. Finding The findings outcome from this study have shown that: (1) A universal listed of dynamic KNNACVRP; (2) Identified and built up an assessment measure for KNNACVRP; (3) Highlight the strategies, based KNNA operations, for choosing the most ideal way (4) KNNA finds a shorter route for VRP paths. The extent of lessening the distance for each route is generally short, but the savings in the distance becomes more noteworthy while figuring the aggregate distances traveled by all transports day by day or month to month. This applies likewise to the time calculate that has been decreased marginally in view of the rate of reduction in the distances of the paths.

A conceptual model of layered adjustable autonomy

Autonomy and autonomous agents are currently the most researched topics in autonomous systems. Issues like autonomy adjustment, autonomy level, and the required degree of autonomy to be performed are investigated. Abstracting an autonomy model poses the problem of identifying specific aspects that merit an autonomous system. In this paper, we propose another model of autonomy that conceptualizes autonomy as a spectrum, which is constructed in a layered structure of a multi-agent environment called Layered Adjustable Autonomy (LAA). The autonomy spectrum of the LAA is divided into adjustable-leveled layers. Each of which has distinct attributes and properties that assist an agent in managing the influences of the environment during its decision-making process. The LAA structure is designed to endorse an agent’s qualification to make a decision by setting the degree of autonomy to the agent’s choice of decision-making. An Autonomy Analysis Module (AAM) is also proposed to control and delegate the agent’s actions at specific autonomy levels. Hence, the AAM determines the threshold of the agent autonomy level to act in its qualified layer. Ultimately, the proposed LAA model will be implemented on an air drone for the purpose of testing and refinement.

A Dynamically Adjustable Autonomic Agent Framework

The design and development of autonomous software agents is still a challenging task and needs further investigation. Giving an agent the maximum autonomous capabilities may not necessarily produce satisfactory agent behavior. Consequently, adjustable autonomy has become the hallmark of autonomous systems development that influences an agent to exhibit satisfactory behavior. To perform such influences, however, a dynamic adjustment mechanism is needed to be configured. The influences are costly in time and implementation especially for systems with time-critical domain. They might negatively influence agent decisions and cause system disturbance. In this paper, we propose a framework to govern an agent autonomy adjustment and minimize system disturbance. The main components of the proposed framework are the Planner, Scheduler and Controller (PSC) that conform to the current trends in automated systems. Two modules are also suggested which are Autonomy Analysis Module (AAM) and Situation Awareness Module (SAM). They are accordingly used to distribute the autonomy and provide balance to the system so that it’s local and global desires do not conflict.

Decision support system for nasopharyngeal carcinoma discrimination from endoscopic images using artificial neural network

The segregation among benign and malignant nasopharyngeal carcinoma (NPC) from endoscopic images is one of the most challenging issues in cancer diagnosis because of the many conceivable shapes, regions, and image intensities, hence, a proper scientific technique is required to extract the features of cancerous NPC tumors. In the present research, a neural network-based automated discrimination system was implemented for the identification of malignant NPC tumors. In the proposed technique, five different types of qualities, such as local binary pattern, gray-level co-occurrence matrix, histogram of oriented gradients, fractal dimension, and entropy, were first determined from the endoscopic images of NPC tumors and then the following steps were executed: (1) an enhanced adaptive approach was employed as the post-processing method for the classification of NPC tumors, (2) an assessment foundation was created for the automated identification of malignant NPC tumors, (3) the benign and cancerous cases were discriminated by using region growing method and artificial neural network (ANN) approach, and (4) the efficiency of the outcomes was evaluated by comparing the results of ANN. In addition, it was found that texture features had significant effects on isolating benign tumors from malignant cases. It can be concluded that in our proposed method texture features acted as a pointer as well as a help instrument to diagnose the malignant NPC tumors. In order to examine the accuracy of our proposed approach, 159 abnormal and 222 normal cases endoscopic images were acquired from 249 patients, and the classifier yielded 95.66% precision, 95.43% sensitivity, and 95.78% specificity.

Genetic case-based reasoning for improved mobile phone faults diagnosis

Abstract Different types of fault diagnostic applications that utilize case-based reasoning (CBR) are applied in the diagnosis process. However, CBR cannot provide solutions to unanticipated or unknown problems. Therefore, further investigation of the retrieval and revision mechanisms of CBR is essential in improving the diagnosis accuracy and precision of the method. This study proposes a hybrid scheme that combines the genetic algorithm and CBR (GCBR) to improve CBR diagnosis. CBR applies experience and knowledge on existing cases of fault diagnosis to newly provided cases. The genetic algorithm aggregates and revises relevant cases to provide solutions to unknown cases. GCBR is implemented in a mobile phone fault diagnosis application. This domain is a good testing environment because mobile phones are of various types and models. Test results show that GCBR can detect several mobile phone faults with average accuracy 98.7%.

Trainable model for segmenting and identifying Nasopharyngeal carcinoma

Abstract Nasopharyngeal carcinoma (NPC) is a multifaceted cancer tumor that makes its diagnosis challenging. NPC has a consistently diffusive enlargement that makes its resection exceptionally challenging. The pathological identification of NPC and comparing typical and anomalous tissues require a set of advanced strategies for the extraction of features. The use of medical images to diagnoses NPC tumor depends on tumor shape, region, and intensity. This paper proposes a novel approach for diagnosing NPC from endoscopic images. The approach includes a trainable segmentation for identifying NPC tissues, genetic algorithm for selecting the best features, and support vector machine for classifying NPC. The proposed approach is validated by comparing the number of classified NPC cases against the manual approach of ENT specialists. The approach shows a high precision of 95.15%, sensitivity of 94.80%, and specificity of 95.20%. Additionally, the optimized feature selection provides straightforward and efficient classification results.

Formulating Dynamic Agents’ Operational State via Situation Awareness Assessment

Managing autonomy in a dynamic interactive system that contains a mix of human and software agent intelligence is a challenging task. In such systems, giving an agent a complete control over its autonomy is a risky practice while manually setting the agent’s autonomy level is an inefficient approach. This paper addresses this issue via formulating a Situation Awareness Assessment (SAA) technique to assist in determining an appropriate agents’ operational state. We propose four operational states of agents’ execution cycles; proceed, halt, block and terminate, each of which is determined based on the agents’ performance. We apply the SAA technique in a proposed Layered Adjustable Autonomy (LAA) model. The LAA conceptualizes autonomy as a spectrum and is constructed in a layered structure. The SAA and the LAA notions are applicable to humans’ and agents’ collaborative environment. We provide an experimental scenario to test and validate the proposed notions in a real-time application.

The emergence of collective intelligence

Intelligence is the logical ability of an entity to pursue its goal and ultimately achieving it successfully. Consequently, by comprehending and applying such ability in a collective environment, optimum results in goal attainment can be achieved. Such evidence is visible through the model of swarm intelligence in which entomological studies have been made to identify the social interactive behavior of ant and bee colonies. Harvesting successful collective behavior among these insects with such low level logical ability instigates further research on capturing the collective behavior of humans, who possess much higher state of intelligence. In this paper, we investigate and identify the emergence of collective intelligence amongst humans. This is done through the observation of face-to-face meetings in which two or more human entities are involved in formal and informal discussions. In this paper, the term personal intelligence is introduced to describe its influence in generating successful Collective Intelligence. Finally, a preliminary theory is introduced to support the concept of Collective Intelligence.