Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 847630, 11 pages
Research Article

Optimal Routing for Heterogeneous Fixed Fleets of Multicompartment Vehicles

1Sun Yat-sen Business School, Sun Yat-sen University, Guangzhou 510275, China
2School of Management, Dalian University of Technology, Dalian 116024, China

Received 26 February 2014; Accepted 31 March 2014; Published 30 April 2014

Academic Editor: Tsan-Ming Choi

Copyright © 2014 Qian Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.