engleski

Distributed Solving of the VRPTW with Coefficient Weighted Time Distance and Lambda Local Search Heuristics

Vehicle routing problems with time windows (VRPTW) represent hard combinatorial problems which are in practice usually solved by heuristic and meta-heuristic methods. The principle of solving the VRPTW problems has been described by means of two heuristic methods of which the former one serves to obtain the initial feasible solution, and the latter for its further improvement. The algorithms have been implemented and tested in the developed programming language Mars which facilitates the writing of algorithms for solving VRP problems. In order to speed up the problem solving procedure, the instructions for support to distributed writing of algorithms have been included in the programming language. The concept of distributing CWTDH and Lambda local search algorithms has been presented as well as, solutions of standard test examples from literature, and comparative results of computation times depending on the number of nodes included in the computation.

VRPTW ; distributed computing ; CWTDH ; lambda ; local search ; cluster ; grid ; parallel

nije evidentirano