An algorithm for optimizing the routes of a set of vehicles used for the collection and removal of municipal solid waste in a metropolis is proposed. The algorithm eliminates the problem of applying heuristic methods for multi-agent optimization, which is NP non-deterministic polynomial-time-hard. The application of the algorithm leads to a guaranteed exact solution. Through the application of restrictions on the carrying capacity of vehicles, the size of the input matrix representing the transport network can be reduced to an adequate size. This process uses statistical information about the filling levels of container waste bins. The algorithm is applied to an example of two megacities. The shortest routes are built for different numbers of points (from 12 to 72) on the route. The dependence of the total mileage on the number of involved vehicles is studied.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
We introduce an algebra of data linkages. Data linkages are intended for modelling the states of computations in which dynamic data structures are involved. We present a simple model of computation in which states of computations are modelled as data linkages and state changes take place by means of certain actions. We describe the state changes and replies that result from performing those actions by means of a term rewriting system with rule priorities. The model in question is an upgrade of molecular dynamics. The upgrading is mainly concerned with the features to deal with values and the features to reclaim garbage.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.