Notice of Violation of IEEE Publication Principles: A Combining Heuristic Algorithm for the Multi-depot Vehicle Routing Problem with Inter-depot Routes

Notice of Violation of IEEE Publication Principles

"A Combining Heuristic Algorithm for the Multi-depot Vehicle Routing Problem with Inter-Depot Routes"
by Tong Zhen and Qiuwen Zhang
in the Proceedings of the 2009 International Joint Conference on Artificial Intelligence, April 2009, pp. 436-439

After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE's Publication Principles.

This paper contains significant portions of original text from the paper cited below. The original text was copied without attribution (including appropriate references to the original author(s) and/or paper title) and without permission.

Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article:

"The Multi-depot Vehicle Routing Problem with Inter-depot Routes"
by Benoit Crevier, Jean-Francois Cordeau, and Gilbert Laporte
in European Journal of Operational Research, Vol. 176, Issue 2, January 2007, pp. 756-773


The multidepot vehicle routing problem with interdepot routes (MDVRPI) is an extension to the classical vehicle routing problem (VRP); it is the major research topics in the supply chain management field. It is an extension of the multidepot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. In this paper, we propose a heuristic combining the adaptative memory principle, a tabu search method for the solution of subproblems, and integer programming. Tests are conducted on randomly generated instances. The experiment indicates the validity of the technique to MDVRPI with the above-mentioned conditions.