1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
|
/*PGR-GNU*****************************************************************
File: solution.hpp
Copyright (c) 2015 pgRouting developers
Mail: project@pgrouting.org
------
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
********************************************************************PGR-GNU*/
/*! @file */
#ifndef INCLUDE_VRP_SOLUTION_HPP_
#define INCLUDE_VRP_SOLUTION_HPP_
#pragma once
#include <deque>
#include <tuple>
#include <string>
#include <vector>
#include "vrp/vehicle_pickDeliver.hpp"
#include "vrp/fleet.hpp"
using Schedule_rt = struct Schedule_rt;
namespace pgrouting {
namespace vrp {
class Solution {
friend class Optimize;
friend class PD_problem;
protected:
double EPSILON;
std::deque<Vehicle_pickDeliver> fleet;
/* this solution belongs to this problem*/
Fleet trucks;
public:
std::vector<Schedule_rt>
get_postgres_result() const;
/* @brief constructor
*
*/
Solution();
/* @brief copy constructor */
Solution(const Solution &sol) :
EPSILON(0.0001),
fleet(sol.fleet),
trucks(sol.trucks)
{};
/* @brief copy assignment */
Solution& operator = (const Solution& sol) {
EPSILON = 0.0001,
fleet = sol.fleet;
trucks = sol.trucks;
return *this;
};
Initials_code get_kind() const;
std::string cost_str() const;
std::string tau(const std::string &title = "Tau") const;
friend std::ostream& operator<<(
std::ostream &log,
const Solution &solution);
bool operator <(const Solution &s_rhs) const;
bool is_feasable() const;
double duration() const;
double wait_time() const;
double total_travel_time() const;
double total_service_time() const;
int twvTot() const;
int cvTot() const;
/*
* Cost in terms of a tuple
* <0> time window violations
* <1> capacity violations
* <2> fleet size TODO
* <3> wait_time
* <4> duration
*/
Vehicle::Cost cost() const;
/** The problem's message */
static Pgr_messages& msg();
private:
/** this solution belongs to this problem */
static Pgr_pickDeliver* problem;
};
} // namespace vrp
} // namespace pgrouting
#endif // INCLUDE_VRP_SOLUTION_HPP_
|
