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.
In this paper, we purpose Energy Efficient logical Cubical layered Path Planning Algorithm (EECPPA) and Multiple Sink EECPPA (MSEECPPA) for acoustic 3D Under Water Sensor Networks (UWSNs). EECPPA and MSEECPPA algorithms are completely distributed and highly adoptive in their execution in logical divided 3D networks into multiple cubes. Proposed models are flexible during location variations of sensors...
In this study, we propose an exact method for finding all the Pareto-optimal paths for a multi-criteria constrained shortest path problem. We show that solving the special bi-criteria problem is equivalent to generating at most |P| constrained shortest paths with successive tightened constraints, where |P| is the total number of all Pareto-optimal paths. For the general multi-criteria case, we propose...
In this study, we consider congested situation and edge choosing problem simultaneously in the VRP transportation planning and this problem is called the Time Dependent Alternative Vehicle Routing Problem with Time Windows (TDAVRPTW). Given a multi- graph, the problem can be formulated into a mixed integer programming model with continuous dependent travel time functions. Numerical example shows the...
In this paper, we consider the Three-Dimensional Loading Capacitated Vehicle Routing Problem (3L-CVRP) which combines the routing of a fleet of vehicles and the loading of three dimensional shaped goods into vehicles while minimizing total travel distance. Compared with previous works which mainly focus on improving the performance of solving the routing problem, we propose a new least waste packing...
In the classical vehicle routing problem (VRP), a fleet of vehicles is available to serve a set of customers with known demand. Each customer is visited by exactly one vehicle as well as the objective is to minimize the total distance or the total charge incurred. Recent years have seen increased attention on VRP integrated with additional loading constraints, known as 2L-CVRP or 3L-CVRP. In this...
Resource reserved network can provide guaranteed quality of service to end users, especially those services requiring high bandwidth and short delay, such as video conferencing, video on demand, etc. In this paper, we consider the multicast packing problem, where multiple multicast sessions request network services simultaneously. To maximize the profit, network service provider need to carefully...
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.