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
|
/*PGR-GNU*****************************************************************
File: tsp.hpp
Copyright (c) 2015 pgRouting developers
Mail: project@pgrouting.org
Copyright (c) 2021 Celia Virginia Vergara Castillo
------
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*/
#ifndef INCLUDE_TSP_TSP_HPP_
#define INCLUDE_TSP_TSP_HPP_
#pragma once
#include <map>
#include <string>
#include <utility>
#include <deque>
#include <vector>
#include <boost/config.hpp>
#include <boost/graph/adjacency_list.hpp>
#include "c_types/iid_t_rt.h"
#include "c_types/coordinate_t.h"
#include "cpp_common/pgr_messages.h"
#include "cpp_common/pgr_assert.h"
namespace pgrouting {
namespace algorithm {
class TSP : public Pgr_messages {
public:
using TSP_Graph =
boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS,
boost::property<boost::vertex_index_t, int>,
boost::property<boost::edge_weight_t, double>,
boost::no_property>;
using V = boost::graph_traits<TSP_Graph>::vertex_descriptor;
using E = boost::graph_traits<TSP_Graph>::edge_descriptor;
using V_it = boost::graph_traits<TSP_Graph>::vertex_iterator;
using E_it = boost::graph_traits<TSP_Graph>::edge_iterator;
using Eout_it = boost::graph_traits<TSP_Graph>::out_edge_iterator;
public:
/** @brief just a TSP value **/
std::deque<std::pair<int64_t, double>> tsp();
/** @brief order the results with a start vertex */
std::deque<std::pair<int64_t, double>> tsp(int64_t);
/** @brief order the results with a start vertex and an endig vertex*/
std::deque<std::pair<int64_t, double>> tsp(int64_t, int64_t, int);
/** @brief crossover optimization **/
std::deque<std::pair<int64_t, double>> crossover_optimize(
std::deque<std::pair<int64_t, double>> result,
size_t limit, int cycles);
TSP(IID_t_rt *, size_t, bool);
TSP(Coordinate_t *, size_t, bool);
TSP() = delete;
#if Boost_VERSION_MACRO >= 106800
friend std::ostream& operator<<(std::ostream &, const TSP&);
#endif
bool has_vertex(int64_t id) const;
private:
std::deque<std::pair<int64_t, double>> eval_tour(const std::vector<V>&);
double eval_tour(std::deque<std::pair<int64_t, double>>&tsp_tour);
V get_boost_vertex(int64_t id) const;
int64_t get_vertex_id(V v) const;
int64_t get_edge_id(E e) const;
private:
TSP_Graph graph;
std::map<int64_t, V> id_to_V;
std::map<V, int64_t> V_to_id;
std::map<E, int64_t> E_to_id;
};
} // namespace algorithm
} // namespace pgrouting
#endif // INCLUDE_TSP_TSP_HPP_
|
