The Service Network Desgin For Highway Daily Maintenance Management

Since the development of the highway network in China is rapid but no scientific theoretical basis supports the planning and decision-making of the daily maintenance management of a highway network,the scientific planning techniques matter a lot.This thesis mainly discusses two problems from the daily maintenance management of the large-scale expressway network: the service sector design problem and robust arc routing problem with time duration.The sectors design problem consists of determining depots' locations,their respective service sectors and routing schedule within each sector.The problem without considering the characteristics of sectors is formulated as a location-allocation arc routing problem and is solved by a branch-and-cut algorithm.A three-stage heuristic algorithm with sector design component is developed to determine the partition with evaluation considerations.The experiments demonstrate that the three-stage heuristic algorithm is computationally more tractable than the branch-and-cut algorithm and could yield high quality solution with compact and good shaped sectors as the scale of the network grows.The robust arc routing problem with time duration can be applied into sectors when the sector partitions are determined.After proposing the deterministic mathematical formulation for the ARPTD and defining the general polyhedral uncertainty set of service and deadheading times,the robust counterpart of the deterministic formulation is developed and then solved.The experiments demonstrate that the RARPTD of small-sized network can be solved to optimality quickly.Besides,the robustness of the optimal solution can be improved by paying the price of robustness or adjusting the allocation of required edges.