The shortest path problem is one of the classic network problems. The objective of this problem is to identify the least cost path through a network from a pre-determined starting node to a pre-determined terminus node. It has many practical applications and can be solved optimally via efficient...

The capacitated arc routing problem is a well-studied problem in the Transportation/Logistics/OR literature. The problem consists of identifying the minimum cost routes required to service (e.g., pickup or deliver) demand located along the edges of a network. Unfortunately, the problem belongs...