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.
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...
The Robust Vehicle Routing problem (RVRP) with discrete scenarios is studied here to handle uncertain traveling time, where a scenario represents a possible discretization of the travel time observed on each arc at a given traffic hour. The goal is to build a set of routes considering the minimization of the worst total cost over all scenarios. A Genetic Algorithm (GA) is proposed for the RVRP considering...
Many distribution companies must deliver and pick up goods to satisfy customers. This problem is called the Vehicle Routing Problem with Mixed linehauls and Backhauls (VRPMB) which considers that some goods must be delivered from a depot to linehaul customers, while others must be picked up at backhaul customers to be brought to the depot. This paper studies an enriched version called Heterogeneous...
The aim of the sectoring-arc routing problem (SARP) is to partition a large region into a given number of smaller sub-regions (sectors) and to build a set of trips in each sector, such that the total duration of the trips is minimized. A graph partition is made to simplify the organization of the activities that must be executed. The SARP arises here in the context of waste collection. A heuristic...
In this working paper we consider the problem of opening one or more depots on a given set of a priori defined depot locations and to design for each opened depot a number of routes in order to supply a given set of customers. With each location is associated a fixed cost for opening a depot and a depot-capacity that limits the quantity that can be delivered to customers. All vehicles are identical...
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.