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.
Open vehicle routing problem (OVRP) is considered as a variant of vehicle routing problem (VRP), which has two hierarchical objectives, i.e., to minimize the number of routes, and to minimize the total cost measured by travel distances. Since the split delivery vehicle routing problem (SDVRP) has been studied extensively, and demonstrated that it can reduce the cost by at most 50% by allowing to split...
The Cumulative Capacitated Vehicle Routing Problem with Time-Dependent Demand(CCVRP-TDD) is a novel problem in humanitarian logistics where the demand is dynamic and the objective is to minimize the sum of arrival times at critical nodes due to the emergency of the situation. Critical nodes are the nodes closest to the source, from which people try to flee to seek first aid, food, etc. This mobilization...
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...
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...
Vehicle routing problem with time windows (VRPTW) is an NP-complete optimization problem. The objective of VRPTW is to use a fleet of vehicles with specific capacity to serve a number of customers with fixed demand and time window constraints. A hybrid ant colony system (DSACA-VRPTW) is proposed to solve this problem. Firstly, each antpsilas solution might be improved by dynamic sweep algorithm which...
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.