Obtained timing for a partial problem. More...
#include <DataStructures.h>
Collaboration diagram for OptimalTiming:
Public Attributes | |
| double | totalEnergy |
| Energy consumption of a robotic cell for this timing. | |
| std::vector< std::vector< double > > | startLocs |
| Start times assigned to static activities' locations. | |
| std::vector< std::vector< double > > | durLocs |
| Durations assigned to static activities' locations. | |
| std::vector< std::vector< double > > | startMvs |
| Start times assigned to dynamic activities' movements. | |
| std::vector< std::vector< double > > | durMvs |
| Durations assigned to dynamic activities' movements. | |
| std::map< Activity *, std::pair< double, double > > | actToStartAndDur |
| Activity to the assigned start time and duration. | |
| std::map< ActivityMode *, std::pair< double, double > > | modeToStartAndDur |
| Selected location/movement to the assigned start time and duration. | |
Detailed Description
Obtained timing for a partial problem.
A partial problem (see PartialSolution) is evaluated by Linear Programming and the assigned timing is converted to this data structure. The order of elements in vectors is determined by the order of operations. The size of *Locs vectors is about one bigger than *Mvs ones since the first and the last location are the same (closing activity).
Definition at line 148 of file DataStructures.h.
The documentation for this struct was generated from the following file:
- /home/bukatlib/Downloads/SolverEquationsGeneratedAsImages/inc/HeuristicSolver/DataStructures.h
