Spider offers a huge potential for savings in transportation planning. Planning tasks include strategic, tactical and operational planning, such as transportation network design, fleet dimensioning, dynamic fleet management, and dynamic cheapest path calculations. The algorithms used for optimal planning in Spider are based on state-of-the-art metaheuristics for the solution of Vehicle Routing Problems (VRP) and an extremely efficient optimization method for the Dynamic Shortest Path Problem (SPP). Good co-ordination of transportation activities can improve customer service, improve resource utilization and give environmental and economical savings. Spider is a versatile and robust software product that easily extends to meet special requirements, making it an ideal tool as a planning kernel for real-world application development.

Spider consists of three modules:

• Plan administration. This module contains the data structures and functions needed to administrate plans and input data.
• Optimization. This module's main function is to create initial plans and optimize the plans by means of an iterative improvement process.
• Topology. The topology module calculates time and distance information for use in the optimization module. The information can be based on tables, calculations based on coordinates (e.g. Euclidean distance) or on exact calculations based on digital road map information.

Spider is developed and owned by SINTEF Applied Mathematics. It is the optimization core of for instance the scheduling tool Spider Designer, which is distributed and developed by Spider Solutions AS. It is also the VRP solver integrated in the web solution of Distribution Innovation AS for distribution management in the media product business. Both Spider and Spider Designer are developed in close collaboration with the industrial users. For customers with special challenges, we develop high quality, tailor-made solutions in a cost-effective way.

 Contact: