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.
On the basis of describing the vehicle routing problem of multi-vehicle in single parking with time windows, this paper sets up the model of the based on natural description. Then this paper sets up a tabu search (TS) algorithm for the problem by presenting a new solution indicating method. The dynamical taboo list is used in TS algorithm, in another words, the length of taboo list is unfixed. In...
Location-routing problem (LRP) is a combinational optimization problem in a logistics system. Most heuristic methods employed for LRP is dividing the problem into location assignment and vehicle routing with a two-phase method, but this method often does not lead to a satisfactory result for the information can not be compressed from one phase to the other efficiently. In this paper we are concerned...
This paper discusses a new way to solve the vehicles routing problems of logistics distribution with the use of TSA (Tabu Search Algorithm). TSA is used to calculate the cost of the dealer or the company of all filiale, which is based on the actuality that there are distribution tasks among filiale (or distribution centers) in the cooperative distribution. A new way here is established considering...
This paper describes the split deliveries vehicle routing problem briefly and presents an improved tabu search algorithm. At each iteration, a neighbor solution at each iteration by removing a customer from a set of routes where it is currently visited and inserting it either into a new route or into an existing route that has enough residual capacity. The algorithm also considers the possibility...
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.