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...
We call this problem the Directed Profitable Rural Postman Problem (DPRPP). We solve the problem with two meta-heuristic algorithms including Tabu search (TS) and Genetic algorithm (GA). Then, computational experiments are conducted and two algorithms are compared. The obtained results show the ...
These are also valid for the Rural Postman Problem. A separation algorithm is given for a subset of these inequalities which runs in polynomial time... AN Letchford - 《European Journal of Operational Research》 被引量: 78发表: 1997年 Solving the hierarchical Chinese postman problem as a rural...
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).E. Benavent, A´ . Corber´an and J.M. Sanchis, "An heuristic algorithm for the Min-Max K...
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...
Rural Postman Problem – branch-and-cut – polyhedralanalysis – facets1. IntroductionThe purpose of this article is to present a new formulation, polyhedral properties anda branch-and-cut algorithm for the Undirected Rural Postman Problem (RPP) definedas follows. Let G(V, E) be an undirected...
The PRPP contains the rural postman problem (RPP) as a special case. For this NP-hard problem, the authors propose a heuristic algorithm. Chu, Labadi, Prins, 2004, Chu, Labadi, Prins, 2005, Chu, Labadi, Prins, 2006 and Lacomme, Prins, and Ramdane-Chérif (2005) refer to the multi-...
A branch-and-cut algorithm for the Undirected Rural Postman Problem The well-known Undirected Rural Postman Problem is considered and a binary linear problem using new dominance relations is presented. Polyhedral properties... G Ghiani,G Laporte - 《Mathematical Programming》 被引量: 131发表: 2000...
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...
The windy rural postman problem with a time-dependent zigzag optionWindy rural postman problemTime windowRoutingIn 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...