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.
The vehicle routing problem is an important problem in logistics. And it has taken as the NP hard problem. Most of the researchers want to get the best resources by many kinds of ways. But the real-world problem is much more difficult than the VRP. In order to make the model and get the solving strategy for the real-world VRP, the paper analysis the customers' demands and divides the problem into...
Assigning and scheduling vehicle routes in stochastic traffic network is a crucial management problem. Vehicle routing problem (VRP) is a combinational optimization problem, it belongs to the NP-hard problem theoretically. VRP with time windows and capacity constraint in stochastic traffic network was studied considering the state of traffic network changing randomly under the action of external factors...
Particle Swarm Optimizer (PSO) has several shortages when it is used for searching the best route of combinatorial optimization problems including vehicle routing and scheduling problems (VRSP), such as the premature convergence and easily limited to local optimal solution. The article proposed an improved PSO to overcome these shortcomings and improve its performance. The proposed algorithm integrates...
Location-routing problem is a kind of hard combinatorial optimization problem arose in supply chain and logistics system. The deterministic location-routing problems in which all data are known in advance have been researched sufficiently, and the conventional method of solving the deterministic problems is to divide the problems into location-allocation problems and vehicle routing problems. The...
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.