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.
As part of solutions to the technical problem of logistics distribution, vehicle routing problem (VRP) is getting more and more attention in academics and enterprises, it belongs to the NP-hard problem theoretically. VRP with time windows and capacity constraint in stochastic traffic network was studied based on travel time reliability . Firstly, travel time was expressed as a random variable according...
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 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...
The capacitated location-routing problem (CLRP) belongs to the field of logistics of transportation. The CLRP appears as a combination of two difficult problems: the facility location problem (FLP) and the vehicle routing problem (VRP).It is an NP-hard problem. In order to solve practical large scale capacitated LRP, We propose a hybrid ant colony algorithm to solve the CLRP. To compare the proposed...
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.