Optimal Routing for Heterogeneous Fixed Fleets of Multicompartment Vehicles

Abstract EN

We present a metaheuristic called the reactive guided tabu search (RGTS) to solve the heterogeneous fleet multicompartment vehicle routing problem (MCVRP), where a single vehicle is required for cotransporting multiple customer orders.

MCVRP is commonly found in delivery of fashion apparel, petroleum distribution, food distribution, and waste collection.

In searching the optimum solution of MCVRP, we need to handle a large amount of local optima in the solution spaces.

To overcome this problem, we design three guiding mechanisms in which the search history is used to guide the search.

The three mechanisms are experimentally demonstrated to be more efficient than the ones which only apply the known distance information.

Armed with the guiding mechanisms and the well-known reactive mechanism, the RGTS can produce remarkable solutions in a reasonable computation time.