The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Capacitated Vehicle Routing Problem (CVRP) is a real life constrain satisfaction problem in which customers are optimally assign to individual vehicles (considering their capacity) to keep total travel distance of the vehicles as minimum as possible while serving customers. Various methods are investigated to solve CVRP in last few decades, the most popular way of solving CVRP is splitting the task...
The Pickup and Delivery Problems (PDP) represent an important class of Vehicle Routing Problems (VRP) in which goods must be collected and distributed. In this paper, we propose an approach which is based on the combination of Genetic Algorithm (GA) with the clustering algorithm for the optimization of multi-vehicles, multi-depots, pickup and delivery problem (m-MDPDP). The main contribution is to...
Vehicle Routing Problem (VRP) has wide applications in logistics and supply chain management and thus is one of the widely studied problems in the field of Operational Research. It is also a NP-hard combinatorial optimization problem and many different kinds of algorithms and techniques have been proposed to solve VRP. There are many types of VRP and this paper concentrates on two variants: Multiple-Depot...
Although many carpooling systems have been proposed, most of them lack various levels of automation, functionality, practicality, and solution quality. While Genetic Algorithms (GAs) have been successfully adopted for solving combinatorial optimization problems, their use is still rare in carpooling problems. Motivated to propose a solution for the many to many carpooling scenario, we present in this...
One of the great aspirations of machine learning is the clustering methods. It consists on categorized a set of similar data into different groups based on related properties. The clustering ensemble is used in aim to improve the performance and the stability of the unsupervised classification methods through the concept of weighting. One of the major problems in clustering ensembles is the consensus...
In this paper is a solution to the School Bus Routing Problem by the application of a bio-inspired algorithm in the vertical transfer of genetic material to offspring or the inheritance of genes by subsequent generations. The vertical transfer algorithm or Genetic algorithm uses the clusterization population pre-selection operator, tournament selection, crossover-k operator and an intelligent mutation...
In this paper, we present a transgenic computer algorithm based on the transformation mechanism of horizontal gene transfer to solve the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW is the problem of minimising transportation costs while satisfying some restrictions as the time, vehicle capacity and the demand of each client. Horizontal gene artificial transfer is a form of genetic...
In this work is defined a scheme of two stages for sending population segments of one Parallel Genetic Algorithm (PGA) to the nodes of an experimental grid called “Tarántula miniGrid”. The technique used to link the clusters and to configure the Tarántula mini Grid is described and the effects of latency in the communications between these clusters and the behavior of the speedup are discussed....
An improved vehicle coordination strategy for vehicle routing problem (VRP) based on SWEEP was proposed in order to solving single-depot VRP with stochastic demands. In this strategy, the vehicle routing that customers were not served by basic vehicle (BV) is re-optimized using SWEEP rules, then these customers are severed by SWEEP vehicle (SV) in order that the total serve time will be less and the...
The traditional vehicle scheduling is not easy to satisfy with the real demand of logistics distribution under electronic commerce. Therefore, according to the particularity of logistic distribution under electronic commerce, multi-depot vehicle routing problem with time windows model is built. For MDVRPTW is NP puzzle, the improved Two-Phase Algorithm needs to be adopted to get solutions. Namely,...
In order to solve the problem of distribution area segmentation of tobacco distribution, an improved k-means clustering algorithm was proposed in this paper. Firstly, the density of every node was calculated, and the first K nodes with the highest density were selected as initial clustering centers. Then the marginal nodes were prioritized to avoid the bad effect that marginal nodes might cause on...
According to the situation that modern large enterprise builds multiple depots and multi-type vehicles with the limited number are in the depots, multi-depot vehicle routing problem with time windows (MDVRPTW) where limited number of vehicles and multi-type vehicle limits is given. Mathematical model of the above problem is constructed, which reflects the feature of the multi-type vehicle limit and...
This paper improves the mathematical model for the vehicle routing problem with time windows where a limited number of vehicles is given, which not only reflects the feature of the limited number of vehicles in the depot, but also is compatible with VRPTW; redefines the distance between the customers used in the customer clustering, designs the customer clustering assignment algorithm, which can help...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.