engleski

HYBRID CHAINS OF HEURISTIC METHODS FOR VEHICLE ROUTING PROBLEM WITH TIME WINDOWS

Vehicle Routing Problem with Time Windows, (VRPTW)cannot always be solved generally and exactly.In actual applications this problem is solved heuristically.This paper provides proposals of new modifications of the exiting heuristic methods.By combining the methods so that the output of one method becomes the initial solution of another, a hybrid chain of heuristic methods is created.The methods are developed in the environment of Java programming language and tested on the Solomon's testing set of problems.

VRP; optimization; heuristic methods; algorithms

nije evidentirano