This paper introduces a modified Max-Min Ant System (MMAS) algorithm to solve the Vehicle Routing Problemwith Time Windows (VRPTW). The VRPTW can be described as the problem of designing least cost routesfrom one depot to a set of geographically scattered points. The routes must be designed in such a way thateach point is visited only once by exactly one vehicle within a given time interval, all routes start and end at thedepot, and the total demands of all points on one particular route must not exceed the capacity of the vehicle.Many meta-heuristic approaches like Simulated Annealing (SA), Genetic Algorithm (GA), Tabu Search (TS), ahybrid Ant System algorithm for VRP (HAS-VRP), a multiple Ant Colony System to vehicle routing problem withtime windows (MACS-VRPTW) and a hybrid Ant System algorithm and Simulated Annealing (IACS-SA). In thisresearch, we proposed a MMAS-VRPTW algorithm with local search approaches. Experiments on variousaspects of Solomon’s 56 benchmark problems are other meta-heuristic and show that our results arecompetitive.
Max-Min Ant System (MMAS) for Vehicle Routing Problem with Time Windows
2013-04-09
Engineering and Applied Science Research; Vol 38 No 3 (2011); 313-323 ; 2539-6218 ; 2539-6161
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
DDC: | 629 |
Agents Toward Vehicle Routing Problem With Time Windows
Taylor & Francis Verlag | 2015
|