619 lines
109 KiB
HTML
619 lines
109 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.2"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: routing_flow.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.1</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.2 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('routing__flow_8cc_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle"><div class="title">routing_flow.cc</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="routing__flow_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#include <math.h></span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span> </div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <functional></span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <iterator></span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include <limits></span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include <type_traits></span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include <utility></span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span> </div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include "absl/container/flat_hash_map.h"</span></div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include "absl/container/flat_hash_set.h"</span></div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include "<a class="code" href="int__type_8h.html">ortools/base/int_type.h</a>"</span></div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="preprocessor">#include "<a class="code" href="map__util_8h.html">ortools/base/map_util.h</a>"</span></div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="preprocessor">#include "<a class="code" href="constraint__solver_8h.html">ortools/constraint_solver/constraint_solver.h</a>"</span></div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="preprocessor">#include "<a class="code" href="routing_8h.html">ortools/constraint_solver/routing.h</a>"</span></div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="preprocessor">#include "<a class="code" href="routing__lp__scheduling_8h.html">ortools/constraint_solver/routing_lp_scheduling.h</a>"</span></div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="preprocessor">#include "<a class="code" href="routing__parameters_8pb_8h.html">ortools/constraint_solver/routing_parameters.pb.h</a>"</span></div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span><span class="preprocessor">#include "<a class="code" href="ebert__graph_8h.html">ortools/graph/ebert_graph.h</a>"</span></div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="preprocessor">#include "<a class="code" href="min__cost__flow_8h.html">ortools/graph/min_cost_flow.h</a>"</span></div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="preprocessor">#include "<a class="code" href="saturated__arithmetic_8h.html">ortools/util/saturated_arithmetic.h</a>"</span></div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> </div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> </div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="comment">// Compute set of disjunctions involved in a pickup and delivery pair.</span></div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span><span class="keyword">template</span> <<span class="keyword">typename</span> Disjunctions></div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span><span class="keywordtype">void</span> AddDisjunctionsFromNodes(<span class="keyword">const</span> RoutingModel& <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keyword">const</span> std::vector<int64_t>& <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>,</div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> Disjunctions* disjunctions) {</div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <span class="keywordflow">for</span> (int64_t node : <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>) {</div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> disjunction : <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.GetDisjunctionIndices(node)) {</div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> disjunctions->insert(disjunction);</div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> }</div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> }</div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span>}</div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span>} <span class="comment">// namespace</span></div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> </div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_model.html#ac8347e84488d1b5eb7b5e6972fb32be3"> 55</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#ac8347e84488d1b5eb7b5e6972fb32be3">RoutingModel::IsMatchingModel</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="comment">// TODO(user): Support overlapping disjunctions and disjunctions with</span></div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="comment">// a cardinality > 1.</span></div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> absl::flat_hash_set<int> disjunction_nodes;</div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="keywordflow">for</span> (<a class="code hl_typedef" href="classoperations__research_1_1_routing_model.html#afa7cbbd4db2dd5d0bec3393efc9ebac1">DisjunctionIndex</a> i(0); i < <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9ed1612ddad261cf7e75643534d0aa0">GetNumberOfDisjunctions</a>(); ++i) {</div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a63f303a555e28a1f9aa5c9f710643b9d">GetDisjunctionMaxCardinality</a>(i) > 1) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keywordflow">for</span> (int64_t node : <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#affd6cc6c76adff8e52220cff2c61635b">GetDisjunctionNodeIndices</a>(i)) {</div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordflow">if</span> (!disjunction_nodes.insert(node).second) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> }</div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> }</div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& pd_pairs : <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a251dfaa30251901d13cd2f33a92571ac">GetPickupAndDeliveryPairs</a>()) {</div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> absl::flat_hash_set<DisjunctionIndex> disjunctions;</div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> AddDisjunctionsFromNodes(*<span class="keyword">this</span>, pd_pairs.first, &disjunctions);</div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> AddDisjunctionsFromNodes(*<span class="keyword">this</span>, pd_pairs.second, &disjunctions);</div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="comment">// Pairs involving more than 2 disjunctions are not supported.</span></div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="keywordflow">if</span> (disjunctions.size() > 2) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> }</div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="comment">// Detect if a "unary" dimension prevents from having more than a single</span></div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="comment">// non-start/end node (or a single pickup and delivery pair) on a route.</span></div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="comment">// Binary dimensions are not considered because they would result in a</span></div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="comment">// quadratic check.</span></div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <span class="keyword">const</span> dimension : dimensions_) {</div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="comment">// TODO(user): Support vehicle-dependent dimension callbacks.</span></div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="keywordflow">if</span> (dimension->class_evaluators_.size() != 1) {</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> }</div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="keyword">const</span> <a class="code hl_typedef" href="classoperations__research_1_1_routing_model.html#a204041e5264282d54dfd198011e776d3">TransitCallback1</a>& transit =</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a7bcff3e4ab28854695610b340d5d11c3">UnaryTransitCallbackOrNull</a>(dimension->class_evaluators_[0]);</div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="keywordflow">if</span> (transit == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> }</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> int64_t max_vehicle_capacity = 0;</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="keywordflow">for</span> (int64_t vehicle_capacity : dimension->vehicle_capacities()) {</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> max_vehicle_capacity = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_vehicle_capacity, vehicle_capacity);</div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> }</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> std::vector<int64_t> transits(nexts_.size(),</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>());</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nexts_.size(); ++i) {</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a3582f01eabc65ba4b801215ca6420a7c">IsStart</a>(i) && !<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#acf67dc202e247ce193038850f71306d3">IsEnd</a>(i)) {</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> transits[i] = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(transits[i], transit(i));</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> }</div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> }</div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> int64_t min_transit = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="comment">// Find the minimal accumulated value resulting from a pickup and delivery</span></div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="comment">// pair.</span></div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& pd_pairs : <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a251dfaa30251901d13cd2f33a92571ac">GetPickupAndDeliveryPairs</a>()) {</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="keyword">const</span> <span class="keyword">auto</span> transit_cmp = [&transits](<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j) {</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="keywordflow">return</span> transits[i] < transits[j];</div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> };</div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> min_transit = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> min_transit,</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="comment">// Min transit from pickup.</span></div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> transits[*std::min_element(pd_pairs.first.begin(),</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> pd_pairs.first.end(), transit_cmp)] +</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="comment">// Min transit from delivery.</span></div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> transits[*std::min_element(pd_pairs.second.begin(),</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> pd_pairs.second.end(), transit_cmp)]);</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> }</div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="comment">// Find the minimal accumulated value resulting from a non-pickup/delivery</span></div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="comment">// node.</span></div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < transits.size(); ++i) {</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#ac6d5e197d4c8db922db0b8e2a8b7074e">GetPickupIndexPairs</a>(i).empty() && <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a434b15d056c7e1751925eba475e84c32">GetDeliveryIndexPairs</a>(i).empty()) {</div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> min_transit = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_transit, transits[i]);</div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> }</div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> }</div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <span class="comment">// If there cannot be more than one node or pickup and delivery, a matching</span></div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="comment">// problem has been detected.</span></div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(min_transit, 2) > max_vehicle_capacity) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> }</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span>}</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> </div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span><span class="comment">// Solve matching model using a min-cost flow. Here is the underlyihg flow:</span></div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span><span class="comment">// ---------- Source -------------</span></div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span><span class="comment">// | (1,0) | (N,0)</span></div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span><span class="comment">// V V</span></div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span><span class="comment">// (vehicles) unperformed</span></div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span><span class="comment">// | (1,cost) |</span></div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span><span class="comment">// V |</span></div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span><span class="comment">// (nodes/pickup/deliveries) | (1,penalty)</span></div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span><span class="comment">// | (1,0) |</span></div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span><span class="comment">// V |</span></div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span><span class="comment">// disjunction <---------</span></div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span><span class="comment">// | (1, 0)</span></div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span><span class="comment">// V</span></div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span><span class="comment">// Sink</span></div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span><span class="comment">// On arcs, (,) represents (capacity, cost).</span></div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span><span class="comment">// N: number of disjunctions</span></div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> </div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span><span class="keyword">struct </span>FlowArc {</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"><a class="line" href="routing__flow_8cc.html#a64e7efc5529154ba56903e75f5300990"> 149</a></span> int64_t <a class="code hl_variable" href="routing__flow_8cc.html#a64e7efc5529154ba56903e75f5300990">tail</a>;</div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"><a class="line" href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4"> 150</a></span> int64_t <a class="code hl_variable" href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a>;</div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"><a class="line" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec"> 151</a></span> int64_t <a class="code hl_variable" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>;</div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"><a class="line" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1"> 152</a></span> int64_t <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>;</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span>};</div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span>} <span class="comment">// namespace</span></div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> </div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span><span class="keywordtype">bool</span> RoutingModel::SolveMatchingModel(</div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> Assignment* assignment, <span class="keyword">const</span> RoutingSearchParameters& <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>) {</div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"Solving with flow"</span>;</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> assignment->Clear();</div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> </div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="comment">// Collect dimensions with costs.</span></div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <span class="comment">// TODO(user): If the costs are soft cumul upper (resp. lower) bounds only,</span></div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="comment">// do not use the LP model.</span></div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <span class="keyword">const</span> std::vector<RoutingDimension*> <a class="code hl_variable" href="arc__flow__builder_8cc.html#a85d16954ed793ec11f3250a16cab2a36">dimensions</a> =</div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a6e0fb2d4d5bbda1cad6bf795152cbe13">GetDimensionsWithSoftOrSpanCosts</a>();</div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> std::vector<LocalDimensionCumulOptimizer> optimizers;</div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> optimizers.reserve(<a class="code hl_variable" href="arc__flow__builder_8cc.html#a85d16954ed793ec11f3250a16cab2a36">dimensions</a>.size());</div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> <span class="keywordflow">for</span> (<a class="code hl_friend" href="classoperations__research_1_1_routing_model.html#a50ba9dd11704e0be7edaa9e9f24142ff">RoutingDimension</a>* dimension : <a class="code hl_variable" href="arc__flow__builder_8cc.html#a85d16954ed793ec11f3250a16cab2a36">dimensions</a>) {</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> optimizers.emplace_back(dimension,</div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.continuous_scheduling_solver());</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> }</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> </div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="keywordtype">int</span> num_flow_nodes = 0;</div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> std::vector<std::vector<int64_t>> disjunction_to_flow_nodes;</div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> std::vector<int64_t> disjunction_penalties;</div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> std::vector<bool> in_disjunction(<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">Size</a>(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="comment">// Create pickup and delivery pair flow nodes.</span></div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <span class="comment">// TODO(user): Check pair alternatives correspond exactly to at most two</span></div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="comment">// disjunctions.</span></div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> absl::flat_hash_map<int, std::pair<int64_t, int64_t>> flow_to_pd;</div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& pd_pairs : <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a251dfaa30251901d13cd2f33a92571ac">GetPickupAndDeliveryPairs</a>()) {</div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> disjunction_to_flow_nodes.push_back({});</div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> absl::flat_hash_set<DisjunctionIndex> disjunctions;</div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> AddDisjunctionsFromNodes(*<span class="keyword">this</span>, pd_pairs.first, &disjunctions);</div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> AddDisjunctionsFromNodes(*<span class="keyword">this</span>, pd_pairs.second, &disjunctions);</div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="keywordflow">for</span> (int64_t pickup : pd_pairs.first) {</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> in_disjunction[pickup] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <span class="keywordflow">for</span> (int64_t delivery : pd_pairs.second) {</div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> in_disjunction[delivery] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> flow_to_pd[num_flow_nodes] = {pickup, delivery};</div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> disjunction_to_flow_nodes.back().push_back(num_flow_nodes);</div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> num_flow_nodes++;</div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> }</div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> }</div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <a class="code hl_define" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(disjunctions.size(), 2);</div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> int64_t penalty = 0;</div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> <span class="keywordflow">if</span> (disjunctions.size() < 2) {</div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> penalty = <a class="code hl_variable" href="classoperations__research_1_1_routing_model.html#a5f3df49299b1aaad3bca40b14291aa79">kNoPenalty</a>;</div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> <span class="keywordflow">for</span> (<a class="code hl_typedef" href="classoperations__research_1_1_routing_model.html#afa7cbbd4db2dd5d0bec3393efc9ebac1">DisjunctionIndex</a> <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> : disjunctions) {</div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> <span class="keyword">const</span> int64_t d_penalty = <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a74902abbe8bbfa1c50a80ca8ac83e864">GetDisjunctionPenalty</a>(<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="keywordflow">if</span> (d_penalty == <a class="code hl_variable" href="classoperations__research_1_1_routing_model.html#a5f3df49299b1aaad3bca40b14291aa79">kNoPenalty</a>) {</div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> penalty = <a class="code hl_variable" href="classoperations__research_1_1_routing_model.html#a5f3df49299b1aaad3bca40b14291aa79">kNoPenalty</a>;</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> }</div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> penalty = <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(penalty, d_penalty);</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> }</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> }</div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> disjunction_penalties.push_back(penalty);</div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> }</div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> <span class="comment">// Create non-pickup and delivery flow nodes.</span></div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> absl::flat_hash_map<int, int64_t> flow_to_non_pd;</div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">Size</a>(); ++node) {</div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a3582f01eabc65ba4b801215ca6420a7c">IsStart</a>(node) || in_disjunction[node]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="keyword">const</span> std::vector<DisjunctionIndex>& disjunctions =</div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a9148b93be3892d950af000a9b379940e">GetDisjunctionIndices</a>(node);</div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> <a class="code hl_define" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(disjunctions.size(), 1);</div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> disjunction_to_flow_nodes.push_back({});</div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> disjunction_penalties.push_back(</div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> disjunctions.empty() ? <a class="code hl_variable" href="classoperations__research_1_1_routing_model.html#a5f3df49299b1aaad3bca40b14291aa79">kNoPenalty</a></div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> : <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a74902abbe8bbfa1c50a80ca8ac83e864">GetDisjunctionPenalty</a>(disjunctions.back()));</div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <span class="keywordflow">if</span> (disjunctions.empty()) {</div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> in_disjunction[node] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> flow_to_non_pd[num_flow_nodes] = node;</div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> disjunction_to_flow_nodes.back().push_back(num_flow_nodes);</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> num_flow_nodes++;</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> n : <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#affd6cc6c76adff8e52220cff2c61635b">GetDisjunctionNodeIndices</a>(disjunctions.back())) {</div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> in_disjunction[n] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> flow_to_non_pd[num_flow_nodes] = n;</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> disjunction_to_flow_nodes.back().push_back(num_flow_nodes);</div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> num_flow_nodes++;</div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> }</div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> }</div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> }</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> </div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> std::vector<FlowArc> arcs;</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> </div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> <span class="comment">// Build a flow node for each disjunction and corresponding arcs.</span></div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> <span class="comment">// Each node exits to the sink through a node, for which the outgoing</span></div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> <span class="comment">// capacity is one (only one of the nodes in the disjunction is performed).</span></div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> absl::flat_hash_map<int, int> flow_to_disjunction;</div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < disjunction_to_flow_nodes.size(); ++i) {</div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> <span class="keyword">const</span> std::vector<int64_t>& flow_nodes = disjunction_to_flow_nodes[i];</div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> <span class="keywordflow">if</span> (flow_nodes.size() == 1) {</div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> flow_to_disjunction[flow_nodes.back()] = i;</div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> flow_to_disjunction[num_flow_nodes] = i;</div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> <span class="keywordflow">for</span> (int64_t flow_node : flow_nodes) {</div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> arcs.push_back({flow_node, num_flow_nodes, 1, 0});</div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> }</div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> num_flow_nodes++;</div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> }</div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> }</div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> </div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> <span class="comment">// Build arcs from each vehicle to each non-vehicle flow node; the cost of</span></div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> <span class="comment">// each arc corresponds to:</span></div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> <span class="comment">// start(vehicle) -> pickup -> delivery -> end(vehicle)</span></div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> <span class="comment">// or</span></div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <span class="comment">// start(vehicle) -> node -> end(vehicle)</span></div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> std::vector<int> vehicle_to_flow;</div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> absl::flat_hash_map<int, int> flow_to_vehicle;</div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); ++vehicle) {</div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> <span class="keyword">const</span> int64_t start = <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(vehicle);</div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> <span class="keyword">const</span> int64_t end = <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#afb80fd36c1fb57d2db049403483e2074">End</a>(vehicle);</div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> std::vector<int64_t>& flow_nodes : disjunction_to_flow_nodes) {</div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> <span class="keywordflow">for</span> (int64_t flow_node : flow_nodes) {</div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> std::pair<int64_t, int64_t> pd_pair;</div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> int64_t node = -1;</div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> int64_t <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a> = 0;</div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> <span class="keywordtype">bool</span> add_arc = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="namespacegtl.html#a6a4238d2e35cf819a8e83d60d331ea64">gtl::FindCopy</a>(flow_to_pd, flow_node, &pd_pair)) {</div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> <span class="keyword">const</span> int64_t pickup = pd_pair.first;</div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> <span class="keyword">const</span> int64_t delivery = pd_pair.second;</div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a7d83ad98473be9a287f5ef628b99c929">IsVehicleAllowedForIndex</a>(vehicle, pickup) &&</div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a7d83ad98473be9a287f5ef628b99c929">IsVehicleAllowedForIndex</a>(vehicle, delivery)) {</div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> add_arc = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a> =</div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a8174e01c9a66c00a87cdbe86ccd3655c">GetArcCostForVehicle</a>(start, pickup, vehicle),</div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a8174e01c9a66c00a87cdbe86ccd3655c">GetArcCostForVehicle</a>(pickup, delivery, vehicle),</div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a8174e01c9a66c00a87cdbe86ccd3655c">GetArcCostForVehicle</a>(delivery, end, vehicle)));</div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> <span class="keyword">const</span> absl::flat_hash_map<int64_t, int64_t> nexts = {</div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> {start, pickup}, {pickup, delivery}, {delivery, end}};</div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> <span class="keywordflow">for</span> (LocalDimensionCumulOptimizer& optimizer : optimizers) {</div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> int64_t cumul_cost_value = 0;</div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> <span class="comment">// TODO(user): if the result is RELAXED_OPTIMAL_ONLY, do a</span></div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <span class="comment">// second pass with an MP solver.</span></div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> <span class="keywordflow">if</span> (optimizer.ComputeRouteCumulCostWithoutFixedTransits(</div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> vehicle,</div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> [&nexts](int64_t node) {</div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> return nexts.find(node)->second;</div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> },</div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> &cumul_cost_value) !=</div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a> = <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>, cumul_cost_value);</div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> add_arc = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> }</div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> }</div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> }</div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="namespacegtl.html#a6a4238d2e35cf819a8e83d60d331ea64">gtl::FindCopy</a>(flow_to_non_pd, flow_node, &node)) {</div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a7d83ad98473be9a287f5ef628b99c929">IsVehicleAllowedForIndex</a>(vehicle, node)) {</div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> add_arc = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a> = <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a8174e01c9a66c00a87cdbe86ccd3655c">GetArcCostForVehicle</a>(start, node, vehicle),</div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a8174e01c9a66c00a87cdbe86ccd3655c">GetArcCostForVehicle</a>(node, end, vehicle));</div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> <span class="keyword">const</span> absl::flat_hash_map<int64_t, int64_t> nexts = {{start, node},</div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> {node, end}};</div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> <span class="keywordflow">for</span> (LocalDimensionCumulOptimizer& optimizer : optimizers) {</div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> int64_t cumul_cost_value = 0;</div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> <span class="comment">// TODO(user): if the result is RELAXED_OPTIMAL_ONLY, do a</span></div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> <span class="comment">// second pass with an MP solver.</span></div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> <span class="keywordflow">if</span> (optimizer.ComputeRouteCumulCostWithoutFixedTransits(</div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> vehicle,</div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> [&nexts](int64_t node) {</div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> return nexts.find(node)->second;</div>
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> },</div>
|
|
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> &cumul_cost_value) !=</div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a> = <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>, cumul_cost_value);</div>
|
|
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> add_arc = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> }</div>
|
|
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> }</div>
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> }</div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> }</div>
|
|
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span> <span class="keywordflow">if</span> (add_arc) {</div>
|
|
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span> arcs.push_back({num_flow_nodes, flow_node, 1, <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>});</div>
|
|
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span> }</div>
|
|
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span> }</div>
|
|
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> }</div>
|
|
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> flow_to_vehicle[num_flow_nodes] = vehicle;</div>
|
|
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> vehicle_to_flow.push_back(num_flow_nodes);</div>
|
|
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> num_flow_nodes++;</div>
|
|
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> }</div>
|
|
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> <span class="comment">// Create flow source and sink nodes.</span></div>
|
|
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> <span class="keyword">const</span> <span class="keywordtype">int</span> source = num_flow_nodes + 1;</div>
|
|
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> <span class="keyword">const</span> <span class="keywordtype">int</span> sink = source + 1;</div>
|
|
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> <span class="comment">// Source connected to vehicle nodes.</span></div>
|
|
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); ++vehicle) {</div>
|
|
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> arcs.push_back({source, vehicle_to_flow[vehicle], 1, 0});</div>
|
|
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> }</div>
|
|
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> <span class="comment">// Handle unperformed nodes.</span></div>
|
|
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> <span class="comment">// Create a node to catch unperformed nodes and connect it to source.</span></div>
|
|
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> <span class="keyword">const</span> <span class="keywordtype">int</span> unperformed = num_flow_nodes;</div>
|
|
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> <span class="keyword">const</span> int64_t flow_supply = disjunction_to_flow_nodes.size();</div>
|
|
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> arcs.push_back({source, unperformed, flow_supply, 0});</div>
|
|
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& flow_disjunction_element : flow_to_disjunction) {</div>
|
|
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> <span class="keyword">const</span> <span class="keywordtype">int</span> flow_node = flow_disjunction_element.first;</div>
|
|
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> <span class="keyword">const</span> int64_t penalty =</div>
|
|
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span> disjunction_penalties[flow_disjunction_element.second];</div>
|
|
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> <span class="keywordflow">if</span> (penalty != <a class="code hl_variable" href="classoperations__research_1_1_routing_model.html#a5f3df49299b1aaad3bca40b14291aa79">kNoPenalty</a>) {</div>
|
|
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> arcs.push_back({unperformed, flow_node, 1, penalty});</div>
|
|
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> }</div>
|
|
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> <span class="comment">// Connect non-vehicle flow nodes to sinks.</span></div>
|
|
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> arcs.push_back({flow_node, sink, 1, 0});</div>
|
|
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> }</div>
|
|
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> </div>
|
|
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> <span class="comment">// Rescale costs for min-cost flow; assuming max cost resulting from the</span></div>
|
|
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> <span class="comment">// push-relabel flow algorithm is max_arc_cost * (num_nodes+1) * (num_nodes+1)</span></div>
|
|
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> <span class="comment">// (cost-scaling multiplies arc costs by num_nodes+1 and the flow itself can</span></div>
|
|
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> <span class="comment">// accumulate num_nodes+1 such arcs (with capacity being 1 for costed arcs)).</span></div>
|
|
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> int64_t scale_factor = 1;</div>
|
|
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> <span class="keyword">const</span> FlowArc& arc_with_max_cost = *std::max_element(</div>
|
|
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> arcs.begin(), arcs.end(),</div>
|
|
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> [](<span class="keyword">const</span> FlowArc& <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <span class="keyword">const</span> FlowArc& <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) { return a.cost < b.cost; });</div>
|
|
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> <span class="comment">// SimpleMinCostFlow adds a source and a sink node, so actual number of</span></div>
|
|
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> <span class="comment">// nodes to consider is num_flow_nodes + 3.</span></div>
|
|
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> <span class="keyword">const</span> <span class="keywordtype">int</span> actual_flow_num_nodes = num_flow_nodes + 3;</div>
|
|
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> <span class="keywordflow">if</span> (log(<span class="keyword">static_cast<</span><span class="keywordtype">double</span><span class="keyword">></span>(arc_with_max_cost.cost) + 1) +</div>
|
|
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> 2 * log(actual_flow_num_nodes) ></div>
|
|
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> log(<a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>())) {</div>
|
|
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> scale_factor = <a class="code hl_function" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(actual_flow_num_nodes, actual_flow_num_nodes);</div>
|
|
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> }</div>
|
|
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> </div>
|
|
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> SimpleMinCostFlow flow;</div>
|
|
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span> <span class="comment">// Add arcs to flow.</span></div>
|
|
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> FlowArc& arc : arcs) {</div>
|
|
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> flow.AddArcWithCapacityAndUnitCost(arc.tail, arc.head, arc.capacity,</div>
|
|
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span> arc.cost / scale_factor);</div>
|
|
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span> }</div>
|
|
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span> </div>
|
|
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span> <span class="comment">// Set flow supply (number of non-vehicle nodes or pairs).</span></div>
|
|
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> flow.SetNodeSupply(source, flow_supply);</div>
|
|
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> flow.SetNodeSupply(sink, -flow_supply);</div>
|
|
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span> </div>
|
|
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> <span class="comment">// TODO(user): Take time limit into account.</span></div>
|
|
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> <span class="keywordflow">if</span> (flow.Solve() != <a class="code hl_enumvalue" href="classoperations__research_1_1_min_cost_flow_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad">SimpleMinCostFlow::OPTIMAL</a>) {</div>
|
|
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> }</div>
|
|
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> </div>
|
|
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> <span class="comment">// Map the flow result to assignment, only setting next variables.</span></div>
|
|
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</span> std::vector<bool> used_vehicles(<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span> absl::flat_hash_set<int> used_nodes;</div>
|
|
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < flow.NumArcs(); ++i) {</div>
|
|
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span> <span class="keywordflow">if</span> (flow.Flow(i) > 0 && flow.Tail(i) != source && flow.Head(i) != sink) {</div>
|
|
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span> std::vector<int> <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a0f38add802397fef1f57b7d90ccd5aef">nodes</a>;</div>
|
|
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span> std::pair<int64_t, int64_t> pd_pair;</div>
|
|
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span> <span class="keywordtype">int</span> node = -1;</div>
|
|
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = -1;</div>
|
|
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="namespacegtl.html#a6a4238d2e35cf819a8e83d60d331ea64">gtl::FindCopy</a>(flow_to_pd, flow.Head(i), &pd_pair)) {</div>
|
|
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a0f38add802397fef1f57b7d90ccd5aef">nodes</a>.push_back(pd_pair.first);</div>
|
|
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span> <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a0f38add802397fef1f57b7d90ccd5aef">nodes</a>.push_back(pd_pair.second);</div>
|
|
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="namespacegtl.html#a6a4238d2e35cf819a8e83d60d331ea64">gtl::FindCopy</a>(flow_to_non_pd, flow.Head(i), &node)) {</div>
|
|
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span> <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a0f38add802397fef1f57b7d90ccd5aef">nodes</a>.push_back(node);</div>
|
|
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="namespacegtl.html#a6a4238d2e35cf819a8e83d60d331ea64">gtl::FindCopy</a>(flow_to_disjunction, flow.Head(i), &<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)) {</div>
|
|
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span> <span class="keywordflow">for</span> (int64_t flow_node : disjunction_to_flow_nodes[<a class="code hl_variable" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]) {</div>
|
|
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="namespacegtl.html#a6a4238d2e35cf819a8e83d60d331ea64">gtl::FindCopy</a>(flow_to_pd, flow_node, &pd_pair)) {</div>
|
|
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a0f38add802397fef1f57b7d90ccd5aef">nodes</a>.push_back(pd_pair.first);</div>
|
|
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span> <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a0f38add802397fef1f57b7d90ccd5aef">nodes</a>.push_back(pd_pair.second);</div>
|
|
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"> 414</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="namespacegtl.html#a6a4238d2e35cf819a8e83d60d331ea64">gtl::FindCopy</a>(flow_to_non_pd, flow_node, &node)) {</div>
|
|
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"> 415</span> <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a0f38add802397fef1f57b7d90ccd5aef">nodes</a>.push_back(node);</div>
|
|
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span> }</div>
|
|
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span> }</div>
|
|
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno"> 418</span> }</div>
|
|
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"> 419</span> <span class="keywordtype">int</span> vehicle = -1;</div>
|
|
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span> <span class="keywordflow">if</span> (flow.Tail(i) == unperformed) {</div>
|
|
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</span> <span class="comment">// Head is unperformed.</span></div>
|
|
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno"> 422</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node : <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a0f38add802397fef1f57b7d90ccd5aef">nodes</a>) {</div>
|
|
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno"> 423</span> assignment->Add(<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a5e7fe0d056275b47eccc1b6bfce0b482">NextVar</a>(node))->SetValue(node);</div>
|
|
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno"> 424</span> used_nodes.insert(node);</div>
|
|
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno"> 425</span> }</div>
|
|
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno"> 426</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="namespacegtl.html#a6a4238d2e35cf819a8e83d60d331ea64">gtl::FindCopy</a>(flow_to_vehicle, flow.Tail(i), &vehicle)) {</div>
|
|
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno"> 427</span> <span class="comment">// Head is performed on a vehicle.</span></div>
|
|
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno"> 428</span> used_vehicles[vehicle] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> <span class="keywordtype">int</span> current = <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(vehicle);</div>
|
|
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node : <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a0f38add802397fef1f57b7d90ccd5aef">nodes</a>) {</div>
|
|
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> assignment->Add(<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a5e7fe0d056275b47eccc1b6bfce0b482">NextVar</a>(current))->SetValue(node);</div>
|
|
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> used_nodes.insert(node);</div>
|
|
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> current = node;</div>
|
|
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> }</div>
|
|
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> assignment->Add(<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a5e7fe0d056275b47eccc1b6bfce0b482">NextVar</a>(current))->SetValue(<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#afb80fd36c1fb57d2db049403483e2074">End</a>(vehicle));</div>
|
|
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno"> 436</span> }</div>
|
|
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno"> 437</span> }</div>
|
|
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno"> 438</span> }</div>
|
|
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno"> 439</span> <span class="comment">// Adding unused nodes.</span></div>
|
|
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno"> 440</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">Size</a>(); ++node) {</div>
|
|
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno"> 441</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a3582f01eabc65ba4b801215ca6420a7c">IsStart</a>(node) && used_nodes.count(node) == 0) {</div>
|
|
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno"> 442</span> assignment->Add(<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a5e7fe0d056275b47eccc1b6bfce0b482">NextVar</a>(node))->SetValue(node);</div>
|
|
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno"> 443</span> }</div>
|
|
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"> 444</span> }</div>
|
|
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"> 445</span> <span class="comment">// Adding unused vehicles.</span></div>
|
|
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"> 446</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); ++vehicle) {</div>
|
|
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno"> 447</span> <span class="keywordflow">if</span> (!used_vehicles[vehicle]) {</div>
|
|
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno"> 448</span> assignment->Add(<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a5e7fe0d056275b47eccc1b6bfce0b482">NextVar</a>(<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(vehicle)))->SetValue(<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#afb80fd36c1fb57d2db049403483e2074">End</a>(vehicle));</div>
|
|
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno"> 449</span> }</div>
|
|
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno"> 450</span> }</div>
|
|
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno"> 451</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno"> 452</span>}</div>
|
|
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno"> 453</span> </div>
|
|
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno"> 454</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="aarc__flow__builder_8cc_html_a85d16954ed793ec11f3250a16cab2a36"><div class="ttname"><a href="arc__flow__builder_8cc.html#a85d16954ed793ec11f3250a16cab2a36">dimensions</a></div><div class="ttdeci">std::vector< int > dimensions</div><div class="ttdef"><b>Definition:</b> <a href="arc__flow__builder_8cc_source.html#l00048">arc_flow_builder.cc:48</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a4395e95bab44e222cb2e77251017a0e2"><div class="ttname"><a href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a></div><div class="ttdeci">#define DCHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00888">base/logging.h:888</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00885">base/logging.h:885</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_afcaa7cadd41741bb855c2ada1d2ef927"><div class="ttname"><a href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a></div><div class="ttdeci">#define VLOG(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00979">base/logging.h:979</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_min_cost_flow_base_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad"><div class="ttname"><a href="classoperations__research_1_1_min_cost_flow_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad">operations_research::MinCostFlowBase::OPTIMAL</a></div><div class="ttdeci">@ OPTIMAL</div><div class="ttdef"><b>Definition:</b> <a href="min__cost__flow_8h_source.html#l00197">min_cost_flow.h:197</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html">operations_research::RoutingDimension</a></div><div class="ttdoc">Dimensions represent quantities accumulated at nodes along the routes.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02494">routing.h:2494</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a0f38add802397fef1f57b7d90ccd5aef"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a0f38add802397fef1f57b7d90ccd5aef">operations_research::RoutingModel::nodes</a></div><div class="ttdeci">int nodes() const</div><div class="ttdoc">Sizes and indices Returns the number of nodes in the model.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01456">routing.h:1456</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a204041e5264282d54dfd198011e776d3"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a204041e5264282d54dfd198011e776d3">operations_research::RoutingModel::TransitCallback1</a></div><div class="ttdeci">RoutingTransitCallback1 TransitCallback1</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00238">routing.h:238</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a251dfaa30251901d13cd2f33a92571ac"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a251dfaa30251901d13cd2f33a92571ac">operations_research::RoutingModel::GetPickupAndDeliveryPairs</a></div><div class="ttdeci">const IndexPairs & GetPickupAndDeliveryPairs() const</div><div class="ttdoc">Returns pickup and delivery pairs currently in the model.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00834">routing.h:834</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a3582f01eabc65ba4b801215ca6420a7c"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a3582f01eabc65ba4b801215ca6420a7c">operations_research::RoutingModel::IsStart</a></div><div class="ttdeci">bool IsStart(int64_t index) const</div><div class="ttdoc">Returns true if 'index' represents the first node of a route.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l03452">routing.cc:3452</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a434b15d056c7e1751925eba475e84c32"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a434b15d056c7e1751925eba475e84c32">operations_research::RoutingModel::GetDeliveryIndexPairs</a></div><div class="ttdeci">const std::vector< std::pair< int, int > > & GetDeliveryIndexPairs(int64_t node_index) const</div><div class="ttdoc">Same as above for deliveries.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l01862">routing.cc:1862</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a50ba9dd11704e0be7edaa9e9f24142ff"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a50ba9dd11704e0be7edaa9e9f24142ff">operations_research::RoutingModel::RoutingDimension</a></div><div class="ttdeci">friend class RoutingDimension</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02061">routing.h:2061</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a572bd92c25ebc67c72137fd59e53f6d6"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">operations_research::RoutingModel::Size</a></div><div class="ttdeci">int64_t Size() const</div><div class="ttdoc">Returns the number of next variables in the model.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01460">routing.h:1460</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a5e7fe0d056275b47eccc1b6bfce0b482"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a5e7fe0d056275b47eccc1b6bfce0b482">operations_research::RoutingModel::NextVar</a></div><div class="ttdeci">IntVar * NextVar(int64_t index) const</div><div class="ttdoc">!defined(SWIGPYTHON)</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01304">routing.h:1304</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a5f3df49299b1aaad3bca40b14291aa79"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a5f3df49299b1aaad3bca40b14291aa79">operations_research::RoutingModel::kNoPenalty</a></div><div class="ttdeci">static const int64_t kNoPenalty</div><div class="ttdoc">Constant used to express a hard constraint instead of a soft penalty.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00451">routing.h:451</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a63f303a555e28a1f9aa5c9f710643b9d"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a63f303a555e28a1f9aa5c9f710643b9d">operations_research::RoutingModel::GetDisjunctionMaxCardinality</a></div><div class="ttdeci">int64_t GetDisjunctionMaxCardinality(DisjunctionIndex index) const</div><div class="ttdoc">Returns the maximum number of possible active nodes of the node disjunction of index 'index'.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00751">routing.h:751</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a6e0fb2d4d5bbda1cad6bf795152cbe13"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a6e0fb2d4d5bbda1cad6bf795152cbe13">operations_research::RoutingModel::GetDimensionsWithSoftOrSpanCosts</a></div><div class="ttdeci">std::vector< RoutingDimension * > GetDimensionsWithSoftOrSpanCosts() const</div><div class="ttdoc">Returns dimensions with soft or vehicle span costs.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l04571">routing.cc:4571</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a74902abbe8bbfa1c50a80ca8ac83e864"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a74902abbe8bbfa1c50a80ca8ac83e864">operations_research::RoutingModel::GetDisjunctionPenalty</a></div><div class="ttdeci">int64_t GetDisjunctionPenalty(DisjunctionIndex index) const</div><div class="ttdoc">Returns the penalty of the node disjunction of index 'index'.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00746">routing.h:746</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a7bcff3e4ab28854695610b340d5d11c3"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a7bcff3e4ab28854695610b340d5d11c3">operations_research::RoutingModel::UnaryTransitCallbackOrNull</a></div><div class="ttdeci">const TransitCallback1 & UnaryTransitCallbackOrNull(int callback_index) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00484">routing.h:484</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a7d83ad98473be9a287f5ef628b99c929"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a7d83ad98473be9a287f5ef628b99c929">operations_research::RoutingModel::IsVehicleAllowedForIndex</a></div><div class="ttdeci">bool IsVehicleAllowedForIndex(int vehicle, int64_t index)</div><div class="ttdoc">Returns true if a vehicle is allowed to visit a given node.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00782">routing.h:782</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a8174e01c9a66c00a87cdbe86ccd3655c"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a8174e01c9a66c00a87cdbe86ccd3655c">operations_research::RoutingModel::GetArcCostForVehicle</a></div><div class="ttdeci">int64_t GetArcCostForVehicle(int64_t from_index, int64_t to_index, int64_t vehicle) const</div><div class="ttdoc">Returns the cost of the transit arc between two nodes for a given vehicle.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l03474">routing.cc:3474</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a9148b93be3892d950af000a9b379940e"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a9148b93be3892d950af000a9b379940e">operations_research::RoutingModel::GetDisjunctionIndices</a></div><div class="ttdeci">const std::vector< DisjunctionIndex > & GetDisjunctionIndices(int64_t index) const</div><div class="ttdoc">Returns the indices of the disjunctions to which an index belongs.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00719">routing.h:719</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_aa650ea2c539fab98337ae2f6ca553f3d"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">operations_research::RoutingModel::Start</a></div><div class="ttdeci">int64_t Start(int vehicle) const</div><div class="ttdoc">Model inspection.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01277">routing.h:1277</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_aa9e7ba89833775f29889744fe9480d29"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">operations_research::RoutingModel::vehicles</a></div><div class="ttdeci">int vehicles() const</div><div class="ttdoc">Returns the number of vehicle routes in the model.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01458">routing.h:1458</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_aa9ed1612ddad261cf7e75643534d0aa0"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#aa9ed1612ddad261cf7e75643534d0aa0">operations_research::RoutingModel::GetNumberOfDisjunctions</a></div><div class="ttdeci">int GetNumberOfDisjunctions() const</div><div class="ttdoc">Returns the number of node disjunctions in the model.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00755">routing.h:755</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_ac6d5e197d4c8db922db0b8e2a8b7074e"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#ac6d5e197d4c8db922db0b8e2a8b7074e">operations_research::RoutingModel::GetPickupIndexPairs</a></div><div class="ttdeci">const std::vector< std::pair< int, int > > & GetPickupIndexPairs(int64_t node_index) const</div><div class="ttdoc">Returns pairs for which the node is a pickup; the first element of each pair is the index in the pick...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l01856">routing.cc:1856</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_ac8347e84488d1b5eb7b5e6972fb32be3"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#ac8347e84488d1b5eb7b5e6972fb32be3">operations_research::RoutingModel::IsMatchingModel</a></div><div class="ttdeci">bool IsMatchingModel() const</div><div class="ttdoc">Returns true if a vehicle/node matching problem is detected.</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00055">routing_flow.cc:55</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_acf67dc202e247ce193038850f71306d3"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#acf67dc202e247ce193038850f71306d3">operations_research::RoutingModel::IsEnd</a></div><div class="ttdeci">bool IsEnd(int64_t index) const</div><div class="ttdoc">Returns true if 'index' represents the last node of a route.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01283">routing.h:1283</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_afa7cbbd4db2dd5d0bec3393efc9ebac1"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#afa7cbbd4db2dd5d0bec3393efc9ebac1">operations_research::RoutingModel::DisjunctionIndex</a></div><div class="ttdeci">RoutingDisjunctionIndex DisjunctionIndex</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00236">routing.h:236</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_afb80fd36c1fb57d2db049403483e2074"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#afb80fd36c1fb57d2db049403483e2074">operations_research::RoutingModel::End</a></div><div class="ttdeci">int64_t End(int vehicle) const</div><div class="ttdoc">Returns the variable index of the ending node of a vehicle route.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01279">routing.h:1279</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_affd6cc6c76adff8e52220cff2c61635b"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#affd6cc6c76adff8e52220cff2c61635b">operations_research::RoutingModel::GetDisjunctionNodeIndices</a></div><div class="ttdeci">const std::vector< int64_t > & GetDisjunctionNodeIndices(DisjunctionIndex index) const</div><div class="ttdoc">Returns the variable indices of the nodes in the disjunction of index 'index'.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00740">routing.h:740</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a9293e4d29cac928301645070dd307683"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a></div><div class="ttdeci">int64_t b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00047">constraint_solver/table.cc:47</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_acb18315d548212835cd8ed4287e6c0b6"><div class="ttname"><a href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a></div><div class="ttdeci">int64_t a</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00046">constraint_solver/table.cc:46</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_8h_html"><div class="ttname"><a href="constraint__solver_8h.html">constraint_solver.h</a></div></div>
|
|
<div class="ttc" id="acp__model__fz__solver_8cc_html_a10a1eab179b472c030bdc2a2efef7219"><div class="ttname"><a href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a></div><div class="ttdeci">SatParameters parameters</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__fz__solver_8cc_source.html#l00116">cp_model_fz_solver.cc:116</a></div></div>
|
|
<div class="ttc" id="aebert__graph_8h_html"><div class="ttname"><a href="ebert__graph_8h.html">ebert_graph.h</a></div></div>
|
|
<div class="ttc" id="agurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00273">gurobi_interface.cc:273</a></div></div>
|
|
<div class="ttc" id="aint__type_8h_html"><div class="ttname"><a href="int__type_8h.html">int_type.h</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="amap__util_8h_html"><div class="ttname"><a href="map__util_8h.html">map_util.h</a></div></div>
|
|
<div class="ttc" id="amin__cost__flow_8h_html"><div class="ttname"><a href="min__cost__flow_8h.html">min_cost_flow.h</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_a6a4238d2e35cf819a8e83d60d331ea64"><div class="ttname"><a href="namespacegtl.html#a6a4238d2e35cf819a8e83d60d331ea64">gtl::FindCopy</a></div><div class="ttdeci">bool FindCopy(const Collection &collection, const Key &key, Value *const value)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00185">map_util.h:185</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a111f44b9b9cf67a8e8d83794ac9f5291"><div class="ttname"><a href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">operations_research::CapAdd</a></div><div class="ttdeci">int64_t CapAdd(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00126">saturated_arithmetic.h:126</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93"><div class="ttname"><a href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">operations_research::DimensionSchedulingStatus::INFEASIBLE</a></div><div class="ttdeci">@ INFEASIBLE</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aa64bf49d041052c7cb3f40f7496d7534"><div class="ttname"><a href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">operations_research::CapProd</a></div><div class="ttdeci">int64_t CapProd(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00233">saturated_arithmetic.h:233</a></div></div>
|
|
<div class="ttc" id="apack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00509">pack.cc:509</a></div></div>
|
|
<div class="ttc" id="arouting_8h_html"><div class="ttname"><a href="routing_8h.html">routing.h</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_a2acb49f4df5288066c43610bede123ec"><div class="ttname"><a href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a></div><div class="ttdeci">int64_t capacity</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00151">routing_flow.cc:151</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_a64e7efc5529154ba56903e75f5300990"><div class="ttname"><a href="routing__flow_8cc.html#a64e7efc5529154ba56903e75f5300990">tail</a></div><div class="ttdeci">int64_t tail</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00149">routing_flow.cc:149</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_a75d7b5e4cab1e156cc7a2c5eba1e16f1"><div class="ttname"><a href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a></div><div class="ttdeci">int64_t cost</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00152">routing_flow.cc:152</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_afca32f65388659a4b0956496169488b4"><div class="ttname"><a href="routing__flow_8cc.html#afca32f65388659a4b0956496169488b4">head</a></div><div class="ttdeci">int64_t head</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00150">routing_flow.cc:150</a></div></div>
|
|
<div class="ttc" id="arouting__lp__scheduling_8h_html"><div class="ttname"><a href="routing__lp__scheduling_8h.html">routing_lp_scheduling.h</a></div></div>
|
|
<div class="ttc" id="arouting__parameters_8pb_8h_html"><div class="ttname"><a href="routing__parameters_8pb_8h.html">routing_parameters.pb.h</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_a6b7983ccd32c86cbbc3d4d9cda4cac17"><div class="ttname"><a href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a></div><div class="ttdeci">int nodes</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03686">routing_search.cc:3686</a></div></div>
|
|
<div class="ttc" id="asaturated__arithmetic_8h_html"><div class="ttname"><a href="saturated__arithmetic_8h.html">saturated_arithmetic.h</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_afbb39f66221aac28bbdefd1dca2b2b0.html">constraint_solver</a></li><li class="navelem"><a class="el" href="routing__flow_8cc.html">routing_flow.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.2 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|