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.
Logistics service suppliers are expected to make a reasonable collection routes to reduce service cost and improve service level. In this paper, the vehicle scheduling and routing model is proposed to choose optimal collection routes and to minimize the total cost which is composed by transport cost, overtime cost, punitive fine and inventory cost. A modified saving algorithm which takes the total...
We study a split vehicle routing problem (VRP) with simultaneous pickup and delivery. Our problem is motivated by the logistics operations practice of a third-party logistics provider (3PL) who serves the inbound logistics for an automobile manufacturing company. We develop several greedy algorithms and a competitive decision algorithm to solve the problem, and conduct computational experiments to...
This paper considers the problem of planning the logistics of distributing medication to points of dispensing (PODs), which will give medication to the public. Previous work on a two-stage routing and scheduling approach showed that it can generate solutions with reasonable minimum slack. This paper presents a delivery volume improvement algorithm that can increase the minimum slack of a given solution.
In the previous work, we developed a model for inventory routing problem with split delivery and proposed a hybrid approach based on Lagrangian relaxation to solve the model. Numerical experiments show that the proposed hybrid approach can find a high quality near-optimal solution for the problems with up to 200 customers in a reasonable computation time. In this paper, we further improve and simplify...
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.