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
|
/*PGR-GNU*****************************************************************
File: fleet.hpp
Copyright (c) 2017 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_FLEET_HPP_
#define INCLUDE_VRP_FLEET_HPP_
#pragma once
#include <iosfwd>
#include <vector>
#include <memory>
#include <utility>
#include "cpp_common/identifiers.hpp"
#include "vrp/pd_problem.hpp"
#include "vrp/vehicle_pickDeliver.hpp"
namespace pgrouting {
namespace vrp {
class Pgr_pickDeliver;
class PD_Orders;
class Fleet {
friend class PD_problem;
public:
typedef std::vector<Vehicle_pickDeliver>::iterator iterator;
public:
/*! @name constructor
* @{
*/
Fleet() = default;
Fleet(const std::vector<Vehicle_t> &vehicles, double factor);
Fleet(const Fleet &fleet);
/*!@}*/
Fleet& operator=(const Fleet &fleet);
void set_compatibles(const PD_Orders &orders);
bool is_fleet_ok() const;
bool is_order_ok(const Order &order) const;
Vehicle_pickDeliver get_truck();
Vehicle_pickDeliver get_truck(size_t order);
/*! @name vector like functions
* @{
*/
size_t size() const {return m_trucks.size();}
Vehicle_pickDeliver& operator[](size_t i);
iterator begin() {return m_trucks.begin();}
iterator end() {return m_trucks.end();}
/*!@}*/
friend std::ostream& operator << (std::ostream &log, const Fleet &v);
private:
std::vector<Vehicle_pickDeliver> m_trucks;
Identifiers<size_t> m_used;
Identifiers<size_t> m_un_used;
/*! @brief build the fleet */
bool build_fleet(std::vector<Vehicle_t>, double);
void add_vehicle(
Vehicle_t,
double factor,
const Vehicle_node&,
const Vehicle_node&);
/** @brief the problem message */
static Pgr_messages& msg();
/** The problem */
static Pgr_pickDeliver* problem;
};
} // namespace vrp
} // namespace pgrouting
#endif // INCLUDE_VRP_FLEET_HPP_
|
