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 studies a strategic level decision problem for disaster relief facility network planning in metropolises. This problem is concerned with some long-term decisions on locating the emergency shelters, locating the supply and medical centers, and maintaining fleets of ambulances and transportation vehicles. These established facilities and deployed vehicles constitute a humanitarian logistic...
In the vehicle routing problem (VRP), it is usually difficult to confederate the cargo and arrange vehicles path. Due to performance reasons, the traditional shortest path algorithm can not be applied to the large scale of VRP. On the basis of the VRP mathematical model, this paper constructs a mixed climbing particle swarm algorithms to solve the problem. First, through coding, the VRP problem is...
Ant colony algorithm is a kind of novel simulation-biological evolution algorithm. An improved ant colony algorithm was utilized to solve the vehicle routing problem in emergency logistics. Genetic algorithm was utilized to optimize the parameters of ant colony algorithm. The algorithm possesses some characteristics such as strong total researching ability. The experimental results show that the improved...
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...
In recent years, logistics distribution vehicle routing problem is a hot topic in logistics research. It is a NP problem and hard to get an optimal and satisfactory solution. The paper introduces removing-addition operator and excellent individual memory mechanism to the traditional genetic algorithm, so that the improved genetic algorithm can kee excellent individuals and maintain the population...
This paper proposes a method for solving Capacitated Vehicle Routing Problem with Hard Time Window (CVRPTW). This method combines the traditional Genetic Algorithm which is frequently used in solving NP-hard problems and the idea of Chaotic Search together to work for a better result. The Logistic Mapping mechanism is adopted to create more new genes and contribute to diversity. In addition, Tabu...
The Vehicle Routing Problem (VRP) is of considerable economic significance in logistic systems as it manages the distribution of goods to make an efficient transportation system. Considering a practical application, this paper solves a vehicle routing problem with stochastic demand (VRPSD) in which the customer demand has been modeled as a stochastic variable as opposed to conventional VRP. To deal...
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 logistic distribution vehicle scheduling problem in e-commerce environment, a method was proposed by modifying particle swarm optimization algorithm. In the method, a novel particle presentation for the vehicle scheduling problem was proposed. Simulation results have shown that the algorithm is effective and efficient for the vehicle scheduling problem.
This paper considers the problem of planning the logistics of distributing medication to points of dispensing (PODs), which will give medication to the public. Previous work on a two-stage routing and scheduling approach showed that it can generate solutions with reasonable minimum slack. This paper presents a delivery volume improvement algorithm that can increase the minimum slack of a given solution.
Collaborative logistics is achieved when two or more carriers or shippers form partnerships to optimize their transportation operations by sharing vehicle capacities and delivery tasks in order to cut empty back hauls and to increase vehicle utilization rate. This paper studies collaborative logistics in less than truckload transportation and develops a general mathematical model and a Lagrangian...
Vehicle routing optimization problem with time constraint is researched in this paper and a hybrid optimization algorithm-PBIL combined with ant algorithm is proposed and applied to VRP. The objective function is to minimize the cost and reduce the loss caused by customerspsila time restriction. The probability matrix of PBIL algorithm is modified with the positive feedback and information disappearing...
This paper studies the delivery and pickup vehicle routing problem with time windows. The vehicle routing problems with delivery and pickup are divided into five categories. The existing papers studied mainly the anterior four categories and this paper studies the fifth category. In the problem, each customer has two time windows and the pickup and delivery at each customer can be fulfilled by being...
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.