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.
For solving the vehicle routing disruption problem which is caused by vehicles breakdown or traffic accidents in the logistic distribution system, an urgency vehicle scheduling scheme is established based on the theory of disruption management. According to the characteristics of the problem, Lagrangian relaxation approach is applied to simplify and divide the problem into two parts. The column generation...
Considering the specialties of logistics distribution under electronic commerce, the traditional multi-depot vehicle scheduling model is modified in order to reduce the distribution cost; objective function is modified based on minimum expense. At the same time, in order to improve the distribution service quality and market competition, add maximum work time, many vehicle types, and maximum running...
In order to satisfy with the individual and various demand of customer, establish vehicle scheduling with backhauls model. According to the characteristics of model, hybrid genetic heuristic algorithm is used to get the optimization solution. First of all, use natural number coding so as to simplify the problem; retain the best selection so as to guard the diversity of group. Improved ordinal crossover...
The logistics vehicle scheduling problem is a widely existent problem in distribution. In fact, it is the vehicle routing problem with time window. In the vehicle routing problem with time windows (VRPTW), there are two main objectives. The primary objective is to reduce the number of vehicles, the secondary one is to minimize the total distance travelled by all vehicles. This is an NP-complete optimization...
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.