Enhancing Solutions Of Capacity Vehicle Routing Problem Based On An Improvement Ant Colony System Algorithm

The Vehicle Routing Problem (VRP) is a famous routing issue and combinatorial optimization problem. It serves an important task in logistics and supply procession administration appropriate toward its wide applications in transport, product delivery, and services. VRP is one of the major important issues have no perfect solutions yet. Several authors over the last only some decades have recognized many types of research and used several algorithms with various methods to solve it. In this work the problem of the VRP work is described as follows: the vehicles which are used for transportation products toward instance place. Each vehicle begins from a major area at various times every day. The capacitated vehicle routing problem (CVRP) is described as toward service a set of delivery customers by means of well-known demands, the aim of CVRP is toward giving every vehicle with a series of delivers so with the purpose of each and every one of customers are serviced, and the cost of traveling for vehicles are decreased. The paper aims to discover an optimal route for VRP by using Improvement Ant Colony System Algorithm (IACS). Optimal routes are founded based on to decrease the distance and the time for each and every one route which directs to quickest the moving of customers to their locations, also based on developing the CVRP model for optimizing the routing issues. The IACS method has been mostly considered recently for handling several combinatorial optimization issues. In this paper, the IACS has been introduced for solving the CVRP. A wide numerical experiment has been performed on benchmark issues available in recent work. The results have been shown the IACS algorithm is better when compared to conventional metaheuristic methods for handling CVRP

An Efficient Improvement Of Ant Colony System Algorithm For Handling Capacity Vehicle Routing Problem

Capacitated Vehicle Routing Problem (CVRP) is considered as one of the most famous specialized forms of VRP that has attracted considerable attention from researchers. This problem belongs to complex combinatorial optimization problems included in the NP-Hard Problem category, which is a problem that needs difficult computation. This paper presents an improvement of Ant Colony System (ACS) to solve this problem. In this study, the problem deals with a few vehicles which are used for transporting products to specific places. Each vehicle starts from a main location at different times every day. The capacitated vehicle routing problem (CVRP) is defined to serve a group of delivery customers with known demands. The proposed study seeks to find the best solution of CVRP by using improvement ACS with the accompanying targets: (1) To decrease the distance as long distances negatively affect the course of the process since it consumes a great time to visit all customers. (2) To implement the improvement of ACS algorithm on new data from the database of CVRP. Through the implementation of the proposed algorithm better results were obtained from the results of other methods and the results were compared

Thematic textual hadith classification: an experiment in rapidminer using support vector machine (SVM) and naïve bayes algorithm

There are many existing problems in Hadith studies trending in the study field. The issues are changeable from the digitalization of the Hadith data to an exact case study of estimation of narrators’ chain for a particular Hadith. However, in this paper, we are not concentrating on the such learning of estimating, confirming or authenticating a Hadith. It focuses more on the data mining use to the Hadith dataset. We put on the Hadith dataset onto one of machine learning tools which is text classification. The Hadith dataset is put into experiment for Hadith textual classification. It concentrates on the thematic classification based on the themes and words occurrences from the Hadith text (matn). The Hadith textual classification does not trace on the hukm and position or class of Hadith. This research does not categorize the Hadith into hukm Sahih, Hasan, Dhaif, or Mawdhoo’. However, the Hadith thematic dataset of this study use only Hadith from Sahih Bukhari, where all Hadith in the Book is categorized as sahih by Imam Al-Bukhari. The classification for this thematic Hadith dataset is implemented using Rapidminer, a machine learning tool using Naïve Bayes and Support Vector Machine (SVM) methods. From the results, the different value of accuracy for both SVM and Naïve Bayes Algorithm was 2.4%. The Naïve Bayes Algorithm displayed better result comparing to SVM. We believe that the result could be better by improving the data, algorithms, algorithm tuning or ensemble methods for the future experiment

Using Experimental Design In Assistive Learning Technology Trials: An Experience-Based Review

Assistive learning technologies are products that are aimed at assisting people with disabilities in improving their learning with minimum intervention of caregivers. Their efficacy has been assessed by means of experimental research trials.An experiment is characterized by the treatments and experimental units to be used,the way treatments are assigned to units,and the responses that are measured.The treatments and experimental units require representative participants or sample.However, because of the limits of numbers of participants or sample sizes,such kinds of studies have been delicate but challenging experiences.This paper attempts to review such valuable research experiences

Multi-Objectives Ant Colony System For Solving Multi-Objectives Capacitated Vehicle Routing Problem

As a combinatorial optimization problem, the capacitated vehicle routing problem (CVRP) is a vital one in the domains of distribution, transportation and logistics. Despite the fact that many researchers have solved the problem using a single objective, only little attention has been given to multi-objective optimization. As compared to multi-objectives, the comparison of solutions is easier with single-objective optimization fitness function. In this paper, the following objectives were achieved: (i) in view of the domain of the multiobjective CVRP, the total distance traveled by the vehicles and the total number of vehicles used are reduced, and (ii) in the view of the technique, a multi-objective Ant Colony System is proposed to solve the multiobjective of CVRP based on the experience of sub-paths. The proposed algorithm was evaluated using some standard benchmark problems of CVRP. The results show that the algorithm which has been proposed in this study is highly competitive and quite effective for multi-objective optimization of CVR

Prediction of the Lithium-ion Cell Performance via Concentration Profile Simulation

This paper presents the lithium-ion concentration profile simulation in the cathode for the half cell to predict the performance of the lithium-ion cell. By utilizing the mathematical model from the identified theoretical principles, the lithium-ion cell system in the solution phase is used to describe the discharge behavior of the rechargeable cell based on the simulated concentration profile. For this work, the cathode is the positive electrode employing LiMn2O4 as the active material. In addition, the numerical technique namely Finite Difference Method is used to solve the material balances equation of lithium-ion cell. This method is compared to other methods to identify the concentration profile. Nevertheless, the solutions in this paper merely focus on the concentration profile of lithium-ion in the cathode under galvanostatic discharge in the half cell

Scheduling for vehicle inspection based on specific constraints and simulation

Appointment scheduling is very popular in healthcare where long waiting times for treatment in the outpatient department of internal medicine; followed by short consultations has long been a complaint of patients. This issue is becoming increasingly important with the progressively aging society. The same thing goes for vehicle appointment scheduling. Here, we present two parts of major scopes where analysis in spreadsheet is performed first then followed by simulation of service scheduling using one of popular package for simulation, ProModel 7. For the first part of this paper, we describe the analytical work being done using spreadsheet where the data analysis is a series of steps to extract the data collected where we introduced waiting time to avoid clash between vehicles. In this study, both quantitative and qualitative data were used. Previous studies proved that large amounts of qualitative work have usually been prerequisite to fruitful quantification in the physical sciences. The continuity of the analysis and modeling then presented as the verification part of the analysis using simulation technique. At the end of this paper, we compare and discuss the hypothesis and result obtained from the spreadsheet and simulation for this scope of study

Using Experimental Design in Assistive Learning Technology Trials: An Experience-Based Review

Assistive learning technologies are products that are aimed at assisting people with disabilities in improving their learning with minimum intervention of caregivers. Their efficacy has been assessed by means of experimental research trials. An experiment is characterized by the treatments and experimental units to be used, the way treatments are assigned to units, and the responses that are measured. The treatments and experimental units require representative participants or sample. However, because of the limits of numbers of participants or sample sizes, such kinds of studies have been delicate but challenging experiences. This paper attempts to review such valuable research experiences