With their paper ”Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints” [Discrete Optimization 3, 2006, pp. 255–273] Righini and Salani introduced bounded bidirectional dynamic programming (DP) as an acceleration technique for solving variants of the shortest path problem with resource constraints (SPPRC). SPPRCs must be s...

Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off ...

The recent increase in online orders e-commerce leads to logistical challenges such as low hit rates (proportion of successful deliveries). We consider last-mile vehicle routing and scheduling problems which customer presence probability data are taken into account. aim is reduce the expected cost resulting from by considering both decisions simultaneously planning phase. model problem solve it...

The Vehicle Routing Problem (VRP) has become one of the most studied optimization problems in the transportation and operations research literature, with numerous exciting variants and applications encountered in a large variety of practical contexts. In broad terms, vehicle routing and scheduling problems deal with the optimum assignment of a set of customer orders to a fleet of vehicles and t...

periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. This paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (PVRP). The related results of proposed algorithm are compared with the resu...

A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. O...

Previous work on assigning tasks to robots has proposed extensive categorizations of allocation of tasks with and without constraints. The main contribution of this paper is a more specific categorization of problems that have both temporal and ordering constraints. We propose a novel taxonomy that builds on the existing taxonomy for multi-robot task allocation and organizes the current literat...

For regular patient transportation and emergency transportation with ambulance vehicles a dy-namic dial-a-ride (DARP) problem has to be solved. We analyze two scheduling strategies for theregular dial-a-ride orders in order to minimize routing costs and to maximize transportation qual-ity. Furthermore, we review practical requirements and suggest a conceptual architecture for a<...

Vehicle Routing Problem (VRP) is a key element of many transportation systems which involve routing of fleet of vehicles from a depot to a set of customers node. It is required that these vehicles return to the depot after serving customers’ demand. This paper investigates a relaxed version of VRP, in which the number of visits to the customer is not restricted to be at most one. The relaxed ve...