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
|
/*PGR-GNU*****************************************************************
File: pd_orders.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_PD_ORDERS_HPP_
#define INCLUDE_VRP_PD_ORDERS_HPP_
#pragma once
#include <vector>
#include <memory>
#include <utility>
#include "cpp_common/orders_t.hpp"
#include "cpp_common/identifiers.hpp"
#include "vrp/pd_problem.hpp"
#include "vrp/order.hpp"
#include "vrp/vehicle_node.hpp"
namespace pgrouting {
namespace vrp {
class PD_Orders {
/** PD_rpblem needs access to set up the problem pointer */
friend class PD_problem;
typedef std::vector<Order> Orders;
public:
typedef Orders::iterator o_iterator;
typedef Orders::const_iterator o_const_iterator;
public:
/*! @name constructors
* @{
*/
PD_Orders() = default;
explicit PD_Orders(const std::vector<Orders_t>&);
/*!@}*/
void set_compatibles(double speed);
size_t find_best_J(Identifiers<size_t> &within_this_set) const;
size_t find_best_I(Identifiers<size_t> &within_this_set) const;
/*! @name std container functions
* functions with same "meaning" as an std container
* @{
*/
Order& operator[](size_t o);
const Order& operator[](size_t o) const;
size_t size() const {return m_orders.size();}
o_iterator begin() {return m_orders.begin();}
o_iterator end() {return m_orders.end();}
o_const_iterator begin() const {return m_orders.begin();}
o_const_iterator end() const {return m_orders.end();}
/*!@}*/
private:
void build_orders(
const std::vector<Orders_t> &pd_orders);
void add_order(
const Orders_t &,
const Vehicle_node&,
const Vehicle_node&);
private:
Orders m_orders;
/** @brief Access to the problem's message */
Pgr_messages& msg() const;
/** The problem */
static Pgr_pickDeliver* problem;
};
} // namespace vrp
} // namespace pgrouting
#endif // INCLUDE_VRP_PD_ORDERS_HPP_
|
