2. Statement of the solvable task 1

     Here we use the following notations:

  • HCS — housing and communal services;
  • DBRN — database of roads network;
  • MRT — a mobile repair team;
  • TV — a transport vehicle for delivering MRT to the right place;
  • TP — a target point, which can be:
    • initial or final state for TV;
    • HCS object.

     Given:

  • DBRN of required city;
  • number of TPs;
  • number of the initial TP for TV;
  • optional parameter: number of the final TP;
  • a fine for one kilometer milage of TV;
  • a fine for one hour stay in the way of TV;
  • for each TP are given the following parameters:
    • its address;
    • expected time of its service;
    • a fine for one hour waiting service (i.e. waiting repair of a broken object, placed in this TP);
    • optional parameter: limiting priority of passing this TP by TV relative to other TPs.

     Minimized criterion of quality: total losses from serving HCS broken objects by one MRT, which include the following three possible components: 1) losses of fuel consumption for TV passage; 2) losses of using MRT and TV; 3) losses of waiting TPs service.