Heuristic methods in vehicle routing systems/Euristiniu metodu taikymas transporto marsrutizavimo sistemose

In this study used in urban transport system with a service by passing the pre-determined route, and these services cost the most effective way to minimize an application for a route has been developed. Is close to the best route for vehicle detection with Genetic Algorithms or Ant Colony Optimization methods can be performed. Determination of the route will be shown on a map, driving directions, the user will be done visually. In addition, if requested via mail or other media rotation information can be transported to users. Internet users access the application and the position you want to go through the map by checking the system to process and route calculation and drawing during can see. The calculation process can be done with Genetic Algorithms or Ant Colony Optimization. Ill. 8, bibl. 25, tabl. 1 (in English; abstracts in English and Lithuanian). Aprasyta miesto transporto sistema su is anksto numatytais marsrutais. Transporto valdymo sistema papildyta funkcijomis, gebanciomis apskaiciuoti trumpiausia atstuma. Trumpiausiam atstumui nustatyti gali buti taikomi genetiniai algoritmai ar skruzdziu kolonijos optimizavimo metodai. Nustatytas marsrutas gali buti pateiktas zemelapyje su vairavimo nuorodomis. Taip pat yra galimybe pateikti informacija vartotojams tiesiogiai, jei uzklausa buvo atlikta elektroniniu pastu ar pan. Marsrutas gali buti apskaiciuotas ir nurodytas bei parodytas tiesiogiai jungiantis prie sistemos internetu. Il. 8, bibl. 25, lent. 1 (anglu kalba; santraukos anglu ir lietuviu k.).