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 proposes an ant colony optimization (ACO) to solve the full-truckload selective multi-depot vehicle routing problem under time windows constraints (denoted by FT-SMDVRPTW). The objective is to construct a solution composed of a set of routes associated with the trucks, aiming at maximizing the total profit. Each order is a pickup and delivery order associated with an origin, a destination,...
Aiming at simultaneous delivery and pickup cargo that was vehicle routing problem with simultaneous delivery and pickup (VRPSDP) existed in logistics area, an adaptive ant colony algorithm was proposed to minimize the path length. According to the characteristics of the vehicle routing problem, a mathematical model was proposed to solve the problem. In order to prevent ant colony algorithm from falling...
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.