Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Journal of Computational Physics
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Vehicle Routing for Urban Snow Plowing Operations
Transportation Science
Computers and Operations Research
Computers and Operations Research
An adaptive large neighborhood search heuristic for a snow plowing problem with synchronized routes
INOC'11 Proceedings of the 5th international conference on Network optimization
The synchronized arc and node routing problem: Application to road marking
Computers and Operations Research
Hi-index | 0.01 |
This paper introduces a synchronized arc routing problem for snow plowing operations. In this problem, routes must be designed in such a way that street segments with two or more lanes in the same direction are plowed simultaneously by different synchronized vehicles. A mixed integer formulation and an adaptive large neighborhood search heuristic are proposed. The performance of the proposed algorithm is evaluated over a large instance set, including artificial and real data. Computational results confirm the efficiency of the algorithm.