JOpt.SDK - vehicle routing library - JOpt.SDK is spatial route optimization and planning Java library for automatic resource scheduling and transportation planning. It uses specialized genetic algorithms to calculate an optimized allocation of orders and stops to mobile resources. The algorithm not only provides tours at minimum costs but also considers an arbitrary set of constraints for each tour. JOpt.SDK can solve problems like TSP (travelling salesman problem) or VRPTW (vehicle routing problem).

Enhancements:
Version 2.2.2

n/a

System Requirements:n/a

JOpt.SDK is spatial route optimization and planning Java library for automatic resource scheduling and transportation planning. It uses specialized genetic algorithms to calculate an optimized allocation of orders and stops to mobile resources. The algorithm not only provides tours at minimum costs but also considers an arbitrary set of constraints for each tour. JOpt.SDK can solve problems like TSP (travelling salesman problem) or VRPTW (vehicle routing problem)....

JOpt.SDK - vehicle routing library v2.2.4 release is New Release.

JOpt.SDK - vehicle routing library 2.3.1 offers you a useful application which can serve you as a spatial route optimization and planning Java library for automatic resource scheduling and transportation planning.

It uses specialized genetic algorithms to calculate an optimized allocation of orders and stops to mobile resources. The algorithm not only provides tours at minimum costs but also considers an arbitrary set of constraints for each tour. JOpt.SDK can solve problems like TSP (travelling salesman problem) or VRPTW (vehicle routing problem).

JOpt.SDK can solve nearly any problem that can be classified by one of the following types:

• TSP - Traveling Salesman Problem. JOpt.SDK finds the shortest or fastest path for your mobile resources
• VRPTW - Vehicle routing problem with time windows - like TSP but for a set of vehicles. JOpt.SDK finds an optimal allocation of orders and stops within a vehicle fleet. It may also consider different constraints for vehicles, drivers and stops.

JOpt.SDK functionality can be accessed via Java API and thus fits seamlessly into any JAVA application. Software developers may integrate the JOpt.SDK 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.

Major Features:

1. routing software and automatic dispatching library for solving various route planning problems
2. flexible memetic algorithms for quick adoption to your specific needs
3. available best practices addons for different industries
4. fully Java/J2SE compliant component for easy deployment into JAVA-based applications
5. unlimited number of vehicles and stops
6. allows for multiple time constraints at tour stops
7. includes driver working times and working time rules
8. includes load capacity for each vehicle
9. allows prescribed itinerary (e.g. pick up & devlivery)
10. supports vehicle types and equipments
11. includes driver's attributes or skills
12. plans closed and open routes
13. automatically determines overnight stays for long routes/ long servicetimes

Requirements: n/a

WareSeeker Editor

JOpt.SDK - vehicle routing library 2.3.2 offers an effective tool which helps you to optimize and plan spatial route for automatic resource scheduling and transportation planning. It uses specialized genetic algorithms to calculate an optimized allocation of orders and stops to mobile resources. The algorithm not only provides tours at minimum costs but also considers an arbitrary set of constraints for each tour. JOpt.SDK can solve problems like TSP (travelling salesman problem) or VRPTW (vehicle routing problem).

JOpt.SDK can solve nearly any problem that can be classified by one of the following types:

• TSP - Traveling Salesman Problem. JOpt.SDK finds the shortest or fastest path for your mobile resources
• VRPTW - Vehicle routing problem with time windows - like TSP but for a set of vehicles. JOpt.SDK finds an optimal allocation of orders and stops within a vehicle fleet. It may also consider different constraints for vehicles, drivers and stops.
  

JOpt.SDK functionality can be accessed via Java API and thus fits seamlessly into any JAVA application. Software developers may integrate the JOpt.SDK 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.

Major Features:

1. Routing software and automatic dispatching library for solving various route planning problems
2. Flexible memetic algorithms for quick adoption to your specific needs
3. Available best practices addons for different industries
4. Fully Java/J2SE compliant component for easy deployment into JAVA-based applications
5. Unlimited number of vehicles and stops
6. Allows for multiple time constraints at tour stops
7. Includes driver working times and working time rules
8. Includes load capacity for each vehicle
9. Allows prescribed itinerary (e.g. pick up & devlivery)
10. Supports vehicle types and equipments
11. Includes driver's attributes or skills
12. Plans closed and open routes
13. Automatically determines overnight stays for long routes/ long servicetimes

Enhancements: n/a

Requirements: n/a

JOpt.SDK - vehicle routing library 2.2.8 is a spatial route optimization and planning Java library used for automatic resource scheduling and transportation planning. It uses specialized genetic algorithms to calculate an optimized allocation of orders and stops to mobile resources. The algorithm not only provides tours at minimum costs but also considers an arbitrary set of constraints for each tour. JOpt.SDK can solve problems like TSP (travelling salesman problem) or VRPTW (vehicle routing problem).

Major Features:

1. routing software and automatic dispatching library for solving various route planning problems
2. flexible memetic algorithms for quick adoption to your specific needs
3. available best practices add-on for different industries
4. fully Java/J2SE compliant component for easy deployment into JAVA-based applications
5. unlimited number of vehicles and stops
6. allows for multiple time constraints at tour stops
7. includes driver working times and working time rules
8. includes load capacity for each vehicle
9. allows prescribed itinerary (e.g. pick up & delivery)
10. supports vehicle types and equipments
11. includes driver's attributes or skills
12. plans closed and open routes
13. automatically determines overnight stays for long routes/ long service times

Improvements of this version: n/a

Requirements: n/a

WareSeeker Editor

JOpt.SDK is spatial route optimization and planning Java library for automatic resource scheduling and transportation planning. It uses specialized genetic algorithms to calculate an optimized allocation of orders and stops to mobile resources. The algorithm not only provides tours at minimum costs but also considers an arbitrary set of constraints for each tour. JOpt.SDK can solve problems like TSP (travelling salesman problem) or VRPTW (vehicle routing problem).

System Requirements: n/a

New features in this version:: n/a

JOpt.SDK is spatial route optimization and planning Java library for automatic resource scheduling and transportation planning. It uses specialized genetic algorithms to calculate an optimized allocation of orders and stops to mobile resources. The algorithm not only provides tours at minimum costs but also considers an arbitrary set of constraints for each tour. JOpt.SDK can solve problems like TSP (travelling salesman problem) or VRPTW (vehicle routing problem).

System Requirements: n/a

Enhancements: n/a

JOpt.SDK - vehicle routing library 2.3.0 is known as a spatial route optimization and planning Java library for automatic resource scheduling and transportation planning.

It uses specialized genetic algorithms to calculate an optimized allocation of orders and stops to mobile resources. The algorithm not only provides tours at minimum costs but also considers an arbitrary set of constraints for each tour.

JOpt.SDK can solve problems like TSP (travelling salesman problem) or VRPTW (vehicle routing problem).

Opt is a product-line to perform automatic resource planning and route optimization tasks. Based upon memetic algorithms, the JOpt products are designed to meet the requirements of various optimization problems for different industries.

JOpt.NET is an automated vehicle routing software and resource scheduling component for .NET and can be integrated with C#,C++,VB and J#. JOpt.NET brings route planning and tour optimisation features to your applications with respect to various constraints such as time windows, load capacities and prescribed itinerary. The component is based on flexible memetic algorithms and automatically determines an optimized schedule of vehicels to an arbitrary set of shipments. You may set up 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 - Traveling Salesman Problem. JOpt.NET finds the shortest or fastest path for your mobile resources
• CVRPTW/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 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.

Major Features:

1. Route optimization library for solving various route planning problems
2. Flexible memetic algorithms for quick adoption to your specific needs
3. Available best practices addons for different industries
4. Fully .NET compliant component for easy integration into .NET-based applications
5. Unlimited number of vehicles and stops
6. Allows for multiple time constraints at tour stops
7. Includes driver working times and working time rules
8. Includes load capacity for each vehicle
9. Allows prescribed itinerary (e.g. pick up & delivery)
10. Supports vehicle types and equipments
11. Includes driver's attributes or skills
12. Plans closed and open routes
13. Automatically determines overnight stays for long routes/ long servicetimes
14. V2.2 GREEN enables assessment and optimization of CO2 emission & energy efficiency
15. Intelligent ready-to-use business evolution components
16. Resource & route optimization for logistics, transportation & field forces
17. Enable fleet operators to reduce overall carbon dioxide emission
18. Optimization as a service

Enhancements:

• Version 2.2.2
• n/a
  

JOpt.SDK - vehicle routing library 2.3.0 is a spatial route optimization and planning Java library that is very useful for automatic resource scheduling and transportation planning. It uses specialized genetic algorithms to calculate an optimized allocation of orders and stops to mobile resources. The algorithm not only supplies tours at minimum costs but also considers an arbitrary set of constraints for each tour.

It can solve problems like TSP (travelling salesman problem) or VRPTW (vehicle routing problem).

Opt is a product-line to perform automatic resource planning and route optimization tasks. Based upon memetic algorithms, the JOpt products are designed to meet the requirements of various optimization problems for different industries.

Major Features:

1. Intelligent ready-to-use business evolution components
2. Resource & route optimization for logistics, transportation & field forces
3. Enable fleet operators to reduce overall carbon dioxide emission
4. Optimization as a service

Enhancements: n/a

Requirements: n/a

WareSeeker Editor

JOpt.NET - Vehicle Routing Software Library - JOpt.NET TourPlanner is an automated vehicle routing software and dispatching .NET component for logistic applications that can solve Traveling Salesman Problems (TSP) and Capacitated Vehicle Routing Problems with Time Windows (CVRPTW,VRPTW). JOpt.NET offers route and transport optimisation with respect to various constraints such as time windows, load capacities and pick up and delivery orders. The component is based on genetic algorithms and automatically determines an optimized allocation of vehicels to an arbitrary set of shipments.

Enhancements:
Version 2.2.2

n/a

System Requirements:n/a

JOpt.NET - Vehicle Routing Software Library 2.2.8 is an automated vehicle routing software and dispatching .NET component used for logistic applications that can solve Traveling Salesman Problems (TSP) and Capacitated Vehicle Routing Problems with Time Windows (CVRPTW,VRPTW). JOpt.NET offers route and transport optimization with respect to various constraints such as time windows, load capacities and pick up and delivery orders. The component is based on genetic algorithms and automatically determines an optimized allocation of vehicles to an arbitrary set of shipments.

Major features:

1. route optimization library for solving various route planning problems
2. flexible memetic algorithms for quick adoption to your specific needs
3. available best practices add-ons for different industries
4. fully .NET compliant component for easy integration into .NET-based applications
5. unlimited number of vehicles and stops
6. allows for multiple time constraints at tour stops
7. includes driver working times and working time rules
8. includes load capacity for each vehicle
9. allows prescribed itinerary (e.g. pick up & delivery)
10. supports vehicle types and equipments
11. includes driver's attributes or skills
12. plans closed and open routes
13. automatically determines overnight stays for long routes/ long service times

Improvements of this version: n/a

Requirements: n/a

WareSeeker Editor

JOpt.NET - Vehicle Routing Software Library 2.3.1 offers you a useful tool which can serve you as an automated vehicle routing software and dispatching .NET component for logistic applications that can solve Traveling Salesman Problems (TSP) and Capacitated Vehicle Routing Problems with Time Windows (CVRPTW,VRPTW). JOpt.NET offers route and transport optimisation with respect to various constraints such as time windows, load capacities and pick up and delivery orders.

The component is based on genetic algorithms and automatically determines an optimized allocation of vehicels to an arbitrary set of shipments.

JOpt.NET can solve nearly any problem that can be classified by one of the following types:

• TSP - Traveling Salesman Problem. JOpt.NET finds the shortest or fastest path for your mobile resources
• CVRPTW/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 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.

Major Features:

1. Route optimization library for solving various route planning problems
2. Flexible memetic algorithms for quick adoption to your specific needs
3. Available best practices addons for different industries
4. Fully .NET compliant component for easy integration into .NET-based applications
5. Unlimited number of vehicles and stops
6. Allows for multiple time constraints at tour stops
7. Includes driver working times and working time rules
8. Includes load capacity for each vehicle
9. Allows prescribed itinerary (e.g. pick up & devlivery)
10. Supports vehicle types and equipments
11. Includes driver's attributes or skills
12. Plans closed and open routes
13. Automatically determines overnight stays for long routes/ long servicetimes

Requirements: n/a

JOpt.NET - Vehicle Routing Software Library 2.3.2 offers an effective tool which helps you to solve Traveling Salesman Problems (TSP) and Capacitated Vehicle Routing Problems with Time Windows (CVRPTW,VRPTW). JOpt.NET offers route and transport optimisation with respect to various constraints such as time windows, load capacities and pick up and delivery orders. The component is based on genetic algorithms and automatically determines an optimized allocation of vehicles to an arbitrary set of shipments.

JOpt.NET can solve nearly any problem that can be classified by one of the following types:

• TSP - Traveling Salesman Problem. JOpt.NET finds the shortest or fastest path for your mobile resources
• CVRPTW/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 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.

Major Features:

1. Route optimization library for solving various route planning problems
2. Flexible memetic algorithms for quick adoption to your specific needs
3. Available best practices addons for different industries
4. Fully .NET compliant component for easy integration into .NET-based applications
5. Unlimited number of vehicles and stops
6. Allows for multiple time constraints at tour stops
7. Includes driver working times and working time rules
8. Includes load capacity for each vehicle
9. Allows prescribed itinerary (e.g. pick up & delivery)
10. Supports vehicle types and equipments
11. Includes driver's attributes or skills
12. Plans closed and open routes
13. Automatically determines overnight stays for long routes/ long service times

Enhancements: n/a

Requirements: n/a

JOpt.NET - Vehicle Routing Software Library 2.3.0 is an automated vehicle routing software which is designed for logistic applications that can solve Traveling Salesman Problems (TSP) and Capacitated Vehicle Routing Problems with Time Windows (CVRPTW,VRPTW).

It brings route planning and tour optimisation features to your applications with respect to various constraints like time windows, load capacities and prescribed itinerary. The component depends on flexible memetic algorithms and automatically determines an optimized schedule of vehicles to an arbitrary set of shipments. You may set up 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 - Traveling Salesman Problem. It can find the shortest or fastest path for your mobile resources
• CVRPTW/VRPTW - Capacitated Vehicle Routing Problem with Time Windows - like TSP but for a set of vehicles. JOpt.NET looks for 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 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.

Major Features:

1. Route optimization library for solving various route planning problems
2. Flexible memetic algorithms for quick adoption to your specific needs
3. Available best practices addons for different industries
4. Fully .NET compliant component for easy integration into .NET-based applications
5. Unlimited number of vehicles and stops
6. Allows for multiple time constraints at tour stops
7. Includes driver working times and working time rules
8. Includes load capacity for each vehicle
9. Allows prescribed itinerary (e.g. pick up & devlivery)
10. Supports vehicle types and equipments
11. Includes driver's attributes or skills
12. Plans closed and open routes
13. Automatically determines overnight stays for long routes/ long servicetimes

Enhancements:: n/a

Requirements: n/a

WareSeeker Editor

JOpt.NET - Vehicle Routing Software Library 2.3.0 brings a convenient tool with an automated vehicle routing software and dispatching NET component for logistic applications that can solve Traveling Salesman Problems (TSP) and Capacitated Vehicle Routing Problems with Time Windows (CVRPTW,VRPTW).

JOpt.NET offers route and transport optimisation with respect to various constraints such as time windows, load capacities and pick up and delivery orders. The component is based on genetic algorithms and automatically determines an optimized allocation of vehicels to an arbitrary set of shipments.

You may set up 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 - Traveling Salesman Problem. It can find the shortest or fastest path for your mobile resources
• CVRPTW/VRPTW - Capacitated Vehicle Routing Problem with Time Windows - like TSP but for a set of vehicles. JOpt.NET looks for 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 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.

Major Features:

1. Route optimization library for solving various route planning problems
2. Flexible memetic algorithms for quick adoption to your specific needs
3. Available best practices addons for different industries
4. Fully .NET compliant component for easy integration into .NET-based applications
5. Unlimited number of vehicles and stops
6. Allows for multiple time constraints at tour stops
7. Includes driver working times and working time rules
8. Includes load capacity for each vehicle
9. Allows prescribed itinerary (e.g. pick up & devlivery)
10. Supports vehicle types and equipments
11. Includes driver's attributes or skills
12. Plans closed and open routes
13. Automatically determines overnight stays for long routes/ long servicetimes

Enhancements:

• Version 2.2.2
• n/a
  

JOpt.SDK is a route optimization and planning Java library for automatic resource scheduling and transportation planning. It uses specialized genetic algorithms to calculate an optimized allocation of orders and stops to mobile resources. JOpt.SDK can solve problems like TSP (travelling salesman problem) or VRPTW (vehicle routing problem).

JOpt.NET TourPlanner is an automated vehicle routing software and dispatching .NET component for logistic applications that can solve Traveling Salesman Problems (TSP) and Capacitated Vehicle Routing Problems with Time Windows (CVRPTW,VRPTW). JOpt.NET offers route and transport optimisation with respect to various constraints such as time windows, load capacities and pick up and delivery orders. The component is based on genetic algorithms and automatically determines an optimized allocation of vehicels to an arbitrary set of shipments.

JOpt.NET TourPlanner is an automated vehicle routing software and dispatching .NET component for logistic applications that can solve Traveling Salesman Problems (TSP) and Capacitated Vehicle Routing Problems with Time Windows (CVRPTW,VRPTW). JOpt.NET offers route and transport optimisation with respect to various constraints such as time windows, load capacities and pick up and delivery orders. The component is based on genetic algorithms and automatically determines an optimized allocation of vehicels to an arbitrary set of shipments.

System Requirements: n/a

Enhancements: n/a

JOpt.NET TourPlanner is an automated vehicle routing software and dispatching .NET component for logistic applications that can solve Traveling Salesman Problems (TSP) and Capacitated Vehicle Routing Problems with Time Windows (CVRPTW,VRPTW). JOpt.NET offers route and transport optimisation with respect to various constraints such as time windows, load capacities and pick up and delivery orders. The component is based on genetic algorithms and automatically determines an optimized allocation of vehicels to an arbitrary set of shipments.

System Requirements: n/a

New features in this version:: n/a

JOpt.SDK is a vehicle routing software library for Java that uses specialized genetic algorithms to calculate an optimized allocation of orders and stops to mobile resources. The algorithm not only provides tours at minimum costs but also considers an arbitrary set of constraints for each tour. You may define your own constraints and optimization goals in order to customize JOpt.SDK 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.SDK can solve nearly any problem that can be classified by one of the following types:
TSP - Traveling Salesman Problem. JOpt.SDK finds the shortest or fastest path for your mobile resources
VRPTW - Vehicle routing problem with time windows - like TSP but for a set of vehicles. JOpt.SDK finds an optimal allocation of orders and stops within a vehicle fleet. It may also consider different constraints for vehicles, drivers and stops.
JOpt.SDK functionality can be accessed via Java API and thus fits seamlessly into any JAVA application. Software developers may integrate the JOpt.SDK 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.
product brief
routing software and automatic dispatching library for solving various route planning problems
flexible genetic algorithms for quick adoption to your specific needs
available best practices addons for different industries
fully Java/J2SE compliant component for easy deployment into JAVA-based applications
unlimited number of vehicles and stops
allows for multiple time constraints at tour stops
includes driver working times and working time rules
includes load capacity for each vehicle
allows prescribed itinerary (e.g. pick up & devlivery).