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.
This paper applies Particle Swarm Optimization algorithm (PSO) in a Multi-objective Vehicle Routing Problem with Time Window (MVRPTW). Firstly, through the problem analysis, establish a versatile mathematical model. Secondly, introduce an effective particle code to successfully implement the algorithm. Finally, examples prove that PSO can be obtained the optimal solution quickly and efficiently of...
The paper expanded study on traditional VRP by introducing the concepts of economical distribution area and distribution outsourcing according to actual distribution demand, and established decision models of distribution outsourcing from the perspective of economical distribution. It provided a dynamic particle swarm optimization algorithm based on subgroup collaboration for solving the models. Finally,...
Vehicle routing problem (VRP) is an important and well-known combinatorial optimization problem encountered in many transport logistics and distribution systems. The VRP has several variants depending on tasks performed and on some restrictions, such as time windows, multiple vehicles, backhauls, simultaneous delivery and pick-up, etc. In this paper, we consider vehicle routing problem with simultaneous...
Analysis the general vehicle routing problem (VRP) of distribution in logistics, and the corresponding mathematical model is established. The adaptive hybrid sequences niche artificial fish swarm algorithm (AHSN-AFSA) is introduced, and study on how to apply the algorithm to solve the vehicle routing problem. The concept of ecological niche is also being introduced in order to overcome the shortcoming...
In this study, we consider the application of a hybrid particle swarm algorithm to the grain logistics vehicle routing problem with time windows (VRPTW). VRPTW is a variant of the well-known well-studied vehicle routing problem (VRP), which the objective is to use the limited vehicles so that the maximum number of jobs can be completed with minimum cost. Aiming at the characteristics of the large...
Grain logistics vehicle routing problem is derived from vehicle routing problem, they have been a focus of research in the grain logistics managements recently, which the aim is to use the limited vehicles to a large number of jobs so that the maximum number of jobs can be completed with minimum cost. Aiming at the characteristics of the large batch and multi-point to multi-point transportation of...
In order to solve the modern logistics problem of vehicle distribution, a particle swarm optimization (PSO) algorithm based on clustering analysis is proposed in this paper. This algorithm clusters the target points in need of distribution primarily by DBSCAN algorithm, and then weighted k-means algorithm is used to cluster the target points finally based on the primary clustering. Corresponding vehicles...
Vehicle routing problems (VRP) arise in many real-life applications within transportation and logistics. This paper considers vehicle routing models in grain logistics (GLVRP) and its intelligent algorithm. The objective of GLVRP is to use a fleet of vehicles with specific capacity to serve a number of customers with fixed demand and time window constraints. In this paper, a novel real number encoding...
Vehicle routing problems (VRP) arise in many real-life applications within transportation and logistics. This paper considers vehicle routing models in grain logistics (GLVRP) and its hybrid intelligent algorithm. The objective of GLVRP is to use a fleet of vehicles with specific capacity to serve a number of customers with fixed demand and time window constraints. A hybrid intelligent algorithm base...
Grain logistics vehicle routing problem is a kind of combination NP-hard problem. According to the large batch and multi-point to multi-point transportation of grain logistics, this paper considers vehicle routing problem with time windows and its intelligent algorithm. An algorithm of PSO for VRPTW is proposed in this work, experiments are made to compare the algorithm with GA on solving this problem...
Based on traditional vehicle routing problem, grain logistics vehicle routing problem with time windows and the characteristics of grain logistics are fully considered in this paper. A model for grain logistics VRPTM was established, where the aim is to complete the maximum tasks with minimum cost. A PSO algorithm is proposed to solve the grain logistics VRPTW, the comparative experiments were made...
The location-routing problem is one of the problems in distribution network designing and logistic management, whose mathematical model is proposed in this paper firstly. Since finding the optimal solution for this model is an NP(non-polynomial)problem, we divide the original problem into two sub-problems, i.e., one is the location-allocation problem and the other is general vehicle routing problem...
Scheduling and batching delivery are the key knots of logistics. This paper focuses on the batching delivery problem with soft time windows and its impact on the production scheduling in manufacturing plants. The motivation for introducing soft time windows is to obtain better routes and reduce the transportation cost by allowing controlled time window violations for some customers. We consider the...
This paper based on the manipulation of full vehicle logistic network and integrated inventory, in order to optimize automobile logistics network and reduce costs, the integrated optimization model was presented, which provided an integrated view of transportation economies-of-scale, inventory and facility costs as well as service quality, and at the same time a complicated multi-customer network...
The distribution of finished products from depots to customers is a practical and challenging problem in logistics management. Better routing and scheduling decisions can result in higher level of customer satisfaction. The distribution problem is generally formulated as the vehicle routing problem (VRP). Nevertheless, there is a rigid assumption that there is only one depot. In cases, for instance,...
The intelligent optimization algorithm PBIL is applied to VRP. Faced to the concrete problem that the objective function is to minimize the cost and meet the time restriction. And the probability statistics for the road traffic status distributed in working hours is considered to decide the routing. The probability matrix of PBIL algorithm is modified with the quick velocity update strategy of particle...
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.