 |
vrpRouting
0.3
|
Go to the documentation of this file.
28 #ifndef INCLUDE_PROBLEM_SOLUTION_H_
29 #define INCLUDE_PROBLEM_SOLUTION_H_
70 std::vector<Short_vehicle>
get_stops()
const;
77 for (
const auto& vehicle : solution.
m_fleet) log << vehicle;
78 log <<
"\n SOLUTION:\n\n " << solution.
tau();
83 std::string
tau(
const std::string &title =
"Tau")
const;
113 std::tuple<int, int, size_t, TInterval, TInterval, TInterval>
cost()
const;
136 #endif // INCLUDE_PROBLEM_SOLUTION_H_
const Orders & orders() const
TInterval total_service_time() const
Total service time of the solution.
double objective() const
Get the value of the objective function.
std::deque< Vehicle_pickDeliver > m_fleet
The current solution.
int cvTot() const
Total number of capacity constraint violations of the solution.
bool operator<(const Solution &) const
TInterval total_travel_time() const
Total travel time of the solution.
int twvTot() const
Total number of time windows constraint violations of the solution.
Solution()=delete
constructor
TInterval wait_time() const
Total waiting time of the solution.
TInterval duration() const
Total duration of the solution.
std::vector< Solution_rt > get_postgres_result() const
get solution like postgres needs it
Solution & operator=(const Solution &sol)=default
copy assignment
Solution schedule when twv & cw are hard restrictions.
const std::deque< Vehicle_pickDeliver > & fleet() const
Get the current fleet solution.
std::string tau(const std::string &title="Tau") const
writing the solution in compact form into a string
std::tuple< int, int, size_t, TInterval, TInterval, TInterval > cost() const
Get all statistics in one cycle.
bool is_feasible() const
is the solution feasible?
friend std::ostream & operator<<(std::ostream &log, const Solution &solution)
printing function
Solution(P *p_problem)
constructor
Orders m_orders
the problem info
std::vector< Short_vehicle > get_stops() const
get solution like postgres needs it
std::string cost_str() const