A New Ant Colony Optimization Algorithm to Solve the Periodic Capacitated Arc Routing Problem with Continuous Moves

Abstract

This paper describes a variant of the Periodic Capacitated Arc Routing Problem for inspections in a railroad network. Inspections are performed by vehicles over a time horizon on which some stretches need evaluation more frequently than others due to its use. Each car can evaluate one stretch per day without being attached to a depot; at each day, the shift may start and end at different locations. This characterizes the problem as the Periodic Capacitated Arc Routing Problem with Continuous Moves in which firstly the delays on attendances are minimized and, second, the displacement costs. We present a mathematical model and an Ant Colony Optimization algorithm to solve the problem. The use of a local search procedure and some principles of Granular Tabu Search is crucial for the algorithm’s performance. The numerical results are promising, especially for critical situations where the arcs’ needs are close to the total vehicles’ capacity.

[Retracted] Automatic Film Label Acquisition Method Based on Improved Neural Networks Optimized by Mutation Ant Colony Algorithm

“…As ant individuals of ant colony algorithm, in the process of collectively foraging for paths, the communication and movement rules of all ants participating in problem search only need to include the following aspects [ 23 , 24 ]: Foraging principle of ant colony. All ants participating in the search of combinatorial optimization problems to be solved can only search for paths and retain secretory pheromones within the limited range they can perceive.…”

Dynamic Capacitated Arc Routing Problem in E-Bike Sharing System: A Monte Carlo Tree Search Approach

“…In equation (7), M[e i , e i ] is a submatrix of M which consists of the jth row and column of M where e ij � 1, representing the adjacent matrix of edges in set E i . e Connected(M[e i , e i ]) function is used to determine whether the subgraph induced by the adjacent matrix M[e i , e i ] is connected (e.g., according to the depth-first search algorithm).…”

“…Although there is a large amount of studies related to the dynamic capacitated vehicle routing problem, which was surveyed by Pillac et al [2] and Psaraftis et al [3], direct studies on DCARP are relatively few. Some literatures [4][5][6][7] investigated the periodic CARP in certain scenarios and proposed various heuristic algorithms; some literatures [8][9][10][11][12] studied the dynamic case where the demand or deadheading cost of each arc is stochastic and proposed some repair operators or adaptive algorithms rather than just an initial static solution.…”

On the periodic hierarchical Chinese postman problem

“…Considering the solution strategies, most of the abovementioned studies have developed heuristic approaches to solve the particular variant of the periodic arc routing problem under exam. Population-based metaheuristics have also been adopted and have shown to be very effective in solving such problems (Lacomme et al 2005;Chu et al 2006;Mei et al 2011;Zhang et al 2017;and Batista et al 2019). Moreover, decomposition approaches that exploit the problem's structure to reduce its complexity have been suggested by (Triki 2017), Chen and Hao (2018) and Oliveira and Scarpin (2020).…”