They are node insertion, node exchange, arc exchange and path exchange. The
proposed heuristic for searching the neighbourhood for a more
economical solution (neighbourhood decent) randomly selects
one of the four operations to search the neighbourhood solutions.
The use of multiple operations can make the solution space search
more extensive (Chen et al., 2010). The details of the four operations
are introduced in the following sections.