THE DCSP APPROACH IN OPTIMISING THE REALISATION OF TRANSPORT REQUESTS AND LIMITING CONSEQUENCES OF CRITICAL SITUATIONS

The work focuses on the application of algorithms solving Distributed Constraints Satisfaction Problem to planning and scheduling the realisation of transport requests. The designed system takes into consideration the recognition and reaction to critical situations, for example, vehicle breakdowns, request annulations or incoming of high priority requests In this paper, the overview of solutions of transport problems such as VRPTW or PDPTW using heuristic and multiagent approaches is shown with special attention paid to approaches based on DCSP. Then, the concept of the system to solve transport problems, taking critical situations into consideration, is presented. The results obtained for different numbers of used vehicles and different volume of incoming requests are also presented. The experiments also show the increase of transport costs after the introduction of the following constraints: critical situations, priorities of requests and capacity constraints.