Rural postman problemTime-space network modelTime-dependent networkGenetic algorithmIn this paper, a new time-space network model is proposed for addressing the time-dependent rural postman problem (TDRPP) of a single vehicle. The proposed model follows the idea of arc-path alternation to form a...
In this research, we focus on the windy rural postman problem with the additional option to zigzag street segments during certain times of the day. If a street is narrow or traffic is light, it is possible (and often desirable) to service both sides of the street in a single pass by ...
Rescheduling after vehicle failures in the multi-depot rural postman problem with rechargeable and reusable vehicles 上传人:leo_wyoming·上传时间:2024-12-08 0% 0% 0% 0% 0% 继续阅读
When addressing the problem of snow removal for secondary roads, a tool for solving the rural postman problem can be very useful. We present some ideas for heuristics for this problem. The heuristics are of the same type as the classical Frederickson heuristic. The ideas concern the order of ...
To solve the problem, we present a graph transformation from a directed rural postman problem with turn penalties to an asymmetric traveling salesman problem. We then make the following modifications to the metaheuristics to better handle the constraints: development of new neighborhood operators, ...
Sanchis, Min- Max K-vehicles windy rural postman problem, Networks 54 (2009), 216-226.E. Benavent, A´ . Corber´an, I. Plana and J.M. Sanchis, "New facets and an enhanced branch-and-cut for the min-max K-vehicles windy rural postman problem," Networks (to appear)....
(PRPP) on an undirected graph. In this problem, every required edge must be serviced a given number of times over anm-day planning period in such a way that service days are equally spaced. ThePRPPcontains the rural postman problem (RPP) as a special case. For this NP-hard problem, ...
In this research, we formulate this routing problem as a Min-Max Multiple-Depot Rural Postman Problem (MMMDRPP). To solve this routing problem, we develop an efficient tabu-search-based algorithm and propose three novel lower bounds to evaluate the routes. To demonstrate its practical usefulness...
In the other words, the problem can be stated as a maximization of the profit which can be calculated by the difference between a incomes gained from servicing customers and the total cost. We call this problem the Directed Profitable Rural Postman Problem (DPRPP). We solve the problem with...
The min-max k-vehicles windy rural postman problem consists of minimizing the maximal distance traveled by a vehicle to find a set of balanced routes that jointly service all the required edges in a windy graph. This is a very difficult problem, for which a branch-and-cut algorithm has alre...