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.
Capacitated Vehicle Routing Problem (CVRP) is a variant of Vehicle Routing Problem (VRP), where CVRP is only considered the capacity restrictions, and the object is to minimize the cost of the vehicles serve all customers. In this study, we proposed an approach which is hybrid two-phase sweep algorithm (SA) and greedy search for solving CVRP. At the first stage of SA, all customers are clustered by...
In this paper, we consider a Prize Colleting Vehicle Routing Problem (PCVRP). Prize collecting Vehicle Routing Problem is a Variant of Vehicle routing Problem. One of the major concerns of the Prize collecting Vehicle routing problem is that all customers need not to be visited compulsory, but prize must be collected from each customer visited and a penalty has to be paid for every unvisited customer...
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.