期刊名称：International Journal of Universal Computer Sciences
印刷版ISSN：1737-9296
电子版ISSN：1737-930X
出版年度：2010
卷号：1
期号：1
页码：10-18
出版社：HyperSciences Publisher
摘要：This paper describes a Tabu Search heuristic with Ejection chains neighborhood to solve the Vehicle Routing Problem with Private fleet and common Carrier (VRPPC). The VRPPC is a variant of the well-known Vehicle Routing Problem in which a fixed internal fleet (Private fleet) is available at the warehouse in the presence of an external Transporter. Numerical experimentations show that the proposed Tabu Search algorithm provides competitive quality solutions compared to other heuristics proposed in the literature and it provides the best-known solutions to a well-known benchmark problem set.
