| Article ID: | iaor2007714 |
| Country: | China |
| Volume: | 9 |
| Issue: | 4 |
| Start Page Number: | 67 |
| End Page Number: | 73 |
| Publication Date: | Dec 2005 |
| Journal: | OR Transactions |
| Authors: | He Guoguang, Zhong Shiquan |
| Keywords: | heuristics: tabu search, transportation: general |
Two kinds of techniques are presented to the multi-depots vehicle scheduling problem (MDVSP). We also introduce some methods to deal with complex limits. An improved Tabu Search algorithm (TS) is proposed to optimize the MDVSP with weight, time windows and multi-type vehicle limits. A representative result and the analysis are given. The experiment indicates the validity of the technique to MDVSP with the above-mentioned conditions.