Optimized route to clear diverging diamond interchange using discrete optimization method

Interchanges and intersections are the most complex part of a roadway network very challenging for snow plowing operators. The objective study is to test if empirical best route clear diverging diamond interchange (DDI) recommended by Clear Roads also mathematically optimized. A discrete optimization method was employed find shortest route. In study, DDI represented as directed graph model. task clearing all lanes treated well-known Chinese postman problem, which then solved an existing algorithm upon appropriate modification. results showed that practice one computed optimal routes with efficiency index 2/3. approach proposed in can be applied other interchanges help agencies achieve cost-effective control operations.