Computer Science and Information Technology Vol. 2(2), pp. 108 - 119
DOI: 10.13189/csit.2014.020208
Reprint (PDF) (508Kb)

Three Strategies Tabu Search for Vehicle Routing Problem with Time Windows

Abdel-Rahman Hedar ¹, Mohammed Abdallah Bakr ^2,*
1 Faculty of Computers and Information, Assiut University, Assiut, 71526, Egypt
² Faculty of Science, Assiut University, Assiut, 71526, Egypt

ABSTRACT

In the vehicle routing problem with time window (VRPTW), the objective is to minimize the number of vehicles and then minimize the total time travelled. Each route starts at the depot and ends at a customer, visiting a number of customers, each once, en route, without returning to the depot. The demand of each customer must be completely fulfilled by a single vehicle. The total demand serviced by each vehicle must not exceed vehicle capacity. An effective tabu search for vehicle routing with time window (TSTS-VRPTW) heuristic for this problem is proposed. The TSTS-VRPTW is based on three function MOVE, EXCHANGE, SWAP. Computational results on Solomon′s benchmarks that consist of six different datasets show that the proposed TSTS-VRPTW is comparable in terms of solution quality to the best performing published heuristics.

KEYWORDS
Vehicle Routing, Time Windows, Service Costs

Cite This Paper in IEEE or APA Citation Styles
(a). IEEE Format:
[1] Abdel-Rahman Hedar , Mohammed Abdallah Bakr , "Three Strategies Tabu Search for Vehicle Routing Problem with Time Windows," Computer Science and Information Technology, Vol. 2, No. 2, pp. 108 - 119, 2014. DOI: 10.13189/csit.2014.020208.

(b). APA Format:
Abdel-Rahman Hedar , Mohammed Abdallah Bakr (2014). Three Strategies Tabu Search for Vehicle Routing Problem with Time Windows. Computer Science and Information Technology, 2(2), 108 - 119. DOI: 10.13189/csit.2014.020208.