JOpt.NET is an automated shipment planning and dispatching component for .NET and thus can be integrated with C#,C++,VB and J#. JOpt.NET offers route and transport optimisation for logistic planning applications with respect to various constraints such as time windows, load capacities and prescribed itinerary. The component is based on genetic algorithms and automatically determines an optimized allocation of vehicels to an arbitrary set of shipments. You may define your own constraints and optimization goals in order to customize JOpt.NET to your specific planning needs or you decide to use one of our best practices addons in order to achieve a fast application of our optimization algorithms to selected industries. JOpt.NET can solve nearly any problem that can be classified by one of the following types: * TSP - Travelling Salesman Problem. JOpt.NET finds the shortest or fastest path for your mobile resources * CVRP/VRPTW - Capacitated Vehicle Routing Problem with Time Windows - like TSP but for a set of vehicles. JOpt.NET finds an optimal allocation of orders and stops within a vehicle fleet. It may also consider different constraints for vehicles, drivers and stops. JOpt.NET functionality can be accessed via .NET API and thus fits seamlessly into any .NET application. Software developers may integrate the JOpt.NET component into their application in order to offer their customers a consistent solution including optimization of mobile workforce schedules. A seamless integration into your software allows the look and feel of one piece of software for your customer.