584 lines
101 KiB
HTML
584 lines
101 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.1"/>
|
|
<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">8.2</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(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 name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2018 Google LLC</span></div>
|
|
<div class="line"><a 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 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 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 name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a 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 name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a 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 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 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 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 name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "<a class="code" href="routing_8h.html">ortools/constraint_solver/routing.h</a>"</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</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 name="l00016"></a><span class="lineno"> 16</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 name="l00017"></a><span class="lineno"> 17</span>  </div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>  </div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// Compute set of disjunctions involved in a pickup and delivery pair.</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Disjunctions></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="keywordtype">void</span> AddDisjunctionsFromNodes(<span class="keyword">const</span> RoutingModel& <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  <span class="keyword">const</span> std::vector<int64>& nodes,</div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  Disjunctions* disjunctions) {</div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node : nodes) {</div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> disjunction : <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.GetDisjunctionIndices(node)) {</div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  disjunctions->insert(disjunction);</div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  }</div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  }</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> }</div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  </div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_model.html#ac8347e84488d1b5eb7b5e6972fb32be3"> 34</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_routing_model.html#ac8347e84488d1b5eb7b5e6972fb32be3">RoutingModel::IsMatchingModel</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="comment">// TODO(user): Support overlapping disjunctions and disjunctions with</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="comment">// a cardinality > 1.</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  absl::flat_hash_set<int> disjunction_nodes;</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_routing_model.html#afa7cbbd4db2dd5d0bec3393efc9ebac1">DisjunctionIndex</a> i(0); i < <a class="code" href="classoperations__research_1_1_routing_model.html#aa9ed1612ddad261cf7e75643534d0aa0">GetNumberOfDisjunctions</a>(); ++i) {</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_model.html#a1090dab71b48b49153d70b9e6c299c25">GetDisjunctionMaxCardinality</a>(i) > 1) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node : <a class="code" href="classoperations__research_1_1_routing_model.html#a89b2c610c22a3223f1cac10233d7992d">GetDisjunctionIndices</a>(i)) {</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</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 name="l00042"></a><span class="lineno"> 42</span>  }</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  }</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& pd_pairs : <a class="code" href="classoperations__research_1_1_routing_model.html#a9e42e15bdb23d63ae78137b97a4882de">GetPickupAndDeliveryPairs</a>()) {</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  absl::flat_hash_set<DisjunctionIndex> disjunctions;</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  AddDisjunctionsFromNodes(*<span class="keyword">this</span>, pd_pairs.first, &disjunctions);</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  AddDisjunctionsFromNodes(*<span class="keyword">this</span>, pd_pairs.second, &disjunctions);</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="comment">// Pairs involving more than 2 disjunctions are not supported.</span></div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">if</span> (disjunctions.size() > 2) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  }</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="comment">// Detect if a "unary" dimension prevents from having more than a single</span></div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="comment">// non-start/end node (or a single pickup and delivery pair) on a route.</span></div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="comment">// Binary dimensions are not considered because they would result in a</span></div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="comment">// quadratic check.</span></div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <span class="keyword">const</span> dimension : dimensions_) {</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="comment">// TODO(user): Support vehicle-dependent dimension callbacks.</span></div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">if</span> (dimension->class_evaluators_.size() != 1) {</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  }</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html#a204041e5264282d54dfd198011e776d3">TransitCallback1</a>& transit =</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <a class="code" href="classoperations__research_1_1_routing_model.html#a44afcc03d5cb68c01acefa253de9edcf">UnaryTransitCallbackOrNull</a>(dimension->class_evaluators_[0]);</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordflow">if</span> (transit == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  }</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> max_vehicle_capacity = 0;</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> vehicle_capacity : dimension->vehicle_capacities()) {</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  max_vehicle_capacity = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(max_vehicle_capacity, vehicle_capacity);</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  }</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  std::vector<int64> transits(nexts_.size(), <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>);</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nexts_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_routing_model.html#ae1adbc353c105572655ae866124c61b6">IsStart</a>(i) && !<a class="code" href="classoperations__research_1_1_routing_model.html#ae2530e17cabaf267e12929ca0ee1bee0">IsEnd</a>(i)) {</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  transits[i] = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(transits[i], transit(i));</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  }</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  }</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> min_transit = <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>;</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// Find the minimal accumulated value resulting from a pickup and delivery</span></div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">// pair.</span></div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& pd_pairs : <a class="code" href="classoperations__research_1_1_routing_model.html#a9e42e15bdb23d63ae78137b97a4882de">GetPickupAndDeliveryPairs</a>()) {</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</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 name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">return</span> transits[i] < transits[j];</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  };</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  min_transit = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  min_transit,</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">// Min transit from pickup.</span></div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  transits[*std::min_element(pd_pairs.first.begin(),</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  pd_pairs.first.end(), transit_cmp)] +</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">// Min transit from delivery.</span></div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  transits[*std::min_element(pd_pairs.second.begin(),</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  pd_pairs.second.end(), transit_cmp)]);</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  }</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">// Find the minimal accumulated value resulting from a non-pickup/delivery</span></div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">// node.</span></div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < transits.size(); ++i) {</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_model.html#ae82492179600550970bd0b0dccf0b3f1">GetPickupIndexPairs</a>(i).empty() && <a class="code" href="classoperations__research_1_1_routing_model.html#afad671d4876daa753d520bf2adceafbd">GetDeliveryIndexPairs</a>(i).empty()) {</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  min_transit = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(min_transit, transits[i]);</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  }</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  }</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="comment">// If there cannot be more than one node or pickup and delivery, a matching</span></div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">// problem has been detected.</span></div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(min_transit, 2) > max_vehicle_capacity) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  }</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> }</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  </div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment">// Solve matching model using a min-cost flow. Here is the underlyihg flow:</span></div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment">// ---------- Source -------------</span></div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment">// | (1,0) | (N,0)</span></div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment">// V V</span></div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment">// (vehicles) unperformed</span></div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment">// | (1,cost) |</span></div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment">// V |</span></div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment">// (nodes/pickup/deliveries) | (1,penalty)</span></div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment">// | (1,0) |</span></div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="comment">// V |</span></div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment">// disjunction <---------</span></div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment">// | (1, 0)</span></div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment">// V</span></div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment">// Sink</span></div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment">// On arcs, (,) represents (capacity, cost).</span></div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment">// N: number of disjunctions</span></div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  </div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="keyword">struct </span>FlowArc {</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"><a class="line" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f"> 127</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>;</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"><a class="line" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888"> 128</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>;</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"><a class="line" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf"> 129</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>;</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"><a class="line" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4"> 130</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>;</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span> };</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  </div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="keywordtype">bool</span> RoutingModel::SolveMatchingModel(</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  Assignment* assignment, <span class="keyword">const</span> RoutingSearchParameters& <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>) {</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"Solving with flow"</span>;</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  assignment->Clear();</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  </div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="comment">// Collect dimensions with costs.</span></div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="comment">// TODO(user): If the costs are soft cumul upper (resp. lower) bounds only,</span></div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="comment">// do not use the LP model.</span></div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keyword">const</span> std::vector<RoutingDimension*> dimensions =</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <a class="code" href="classoperations__research_1_1_routing_model.html#a6e0fb2d4d5bbda1cad6bf795152cbe13">GetDimensionsWithSoftOrSpanCosts</a>();</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  std::vector<LocalDimensionCumulOptimizer> optimizers;</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  optimizers.reserve(dimensions.size());</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_routing_model.html#a50ba9dd11704e0be7edaa9e9f24142ff">RoutingDimension</a>* dimension : dimensions) {</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  optimizers.emplace_back(dimension,</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.continuous_scheduling_solver());</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  }</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  </div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordtype">int</span> num_flow_nodes = 0;</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  std::vector<std::vector<int64>> disjunction_to_flow_nodes;</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  std::vector<int64> disjunction_penalties;</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  std::vector<bool> in_disjunction(<a class="code" href="classoperations__research_1_1_routing_model.html#a354dd8c252cf59b748602b342db6019d">Size</a>(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="comment">// Create pickup and delivery pair flow nodes.</span></div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="comment">// TODO(user): Check pair alternatives correspond exactly to at most two</span></div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="comment">// disjunctions.</span></div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  absl::flat_hash_map<int, std::pair<int64, int64>> flow_to_pd;</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& pd_pairs : <a class="code" href="classoperations__research_1_1_routing_model.html#a9e42e15bdb23d63ae78137b97a4882de">GetPickupAndDeliveryPairs</a>()) {</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  disjunction_to_flow_nodes.push_back({});</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  absl::flat_hash_set<DisjunctionIndex> disjunctions;</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  AddDisjunctionsFromNodes(*<span class="keyword">this</span>, pd_pairs.first, &disjunctions);</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  AddDisjunctionsFromNodes(*<span class="keyword">this</span>, pd_pairs.second, &disjunctions);</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup : pd_pairs.first) {</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  in_disjunction[pickup] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery : pd_pairs.second) {</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  in_disjunction[delivery] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  flow_to_pd[num_flow_nodes] = {pickup, delivery};</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  disjunction_to_flow_nodes.back().push_back(num_flow_nodes);</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  num_flow_nodes++;</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  }</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  }</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(disjunctions.size(), 2);</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> penalty = 0;</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">if</span> (disjunctions.size() < 2) {</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  penalty = <a class="code" href="classoperations__research_1_1_routing_model.html#a89db28c1da47c5aef8a0aa380a1800ec">kNoPenalty</a>;</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_routing_model.html#afa7cbbd4db2dd5d0bec3393efc9ebac1">DisjunctionIndex</a> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> : disjunctions) {</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> d_penalty = <a class="code" href="classoperations__research_1_1_routing_model.html#a276086c8aada62b6301aa44e4289347d">GetDisjunctionPenalty</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">if</span> (d_penalty == <a class="code" href="classoperations__research_1_1_routing_model.html#a89db28c1da47c5aef8a0aa380a1800ec">kNoPenalty</a>) {</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  penalty = <a class="code" href="classoperations__research_1_1_routing_model.html#a89db28c1da47c5aef8a0aa380a1800ec">kNoPenalty</a>;</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  }</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  penalty = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(penalty, d_penalty);</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  }</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  }</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  disjunction_penalties.push_back(penalty);</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  }</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="comment">// Create non-pickup and delivery flow nodes.</span></div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  absl::flat_hash_map<int, int64> flow_to_non_pd;</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < <a class="code" href="classoperations__research_1_1_routing_model.html#a354dd8c252cf59b748602b342db6019d">Size</a>(); ++node) {</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_model.html#ae1adbc353c105572655ae866124c61b6">IsStart</a>(node) || in_disjunction[node]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keyword">const</span> std::vector<DisjunctionIndex>& disjunctions =</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <a class="code" href="classoperations__research_1_1_routing_model.html#a89b2c610c22a3223f1cac10233d7992d">GetDisjunctionIndices</a>(node);</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(disjunctions.size(), 1);</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  disjunction_to_flow_nodes.push_back({});</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  disjunction_penalties.push_back(</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  disjunctions.empty() ? <a class="code" href="classoperations__research_1_1_routing_model.html#a89db28c1da47c5aef8a0aa380a1800ec">kNoPenalty</a></div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  : <a class="code" href="classoperations__research_1_1_routing_model.html#a276086c8aada62b6301aa44e4289347d">GetDisjunctionPenalty</a>(disjunctions.back()));</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordflow">if</span> (disjunctions.empty()) {</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  in_disjunction[node] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  flow_to_non_pd[num_flow_nodes] = node;</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  disjunction_to_flow_nodes.back().push_back(num_flow_nodes);</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  num_flow_nodes++;</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> n : <a class="code" href="classoperations__research_1_1_routing_model.html#a89b2c610c22a3223f1cac10233d7992d">GetDisjunctionIndices</a>(disjunctions.back())) {</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  in_disjunction[n] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  flow_to_non_pd[num_flow_nodes] = n;</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  disjunction_to_flow_nodes.back().push_back(num_flow_nodes);</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  num_flow_nodes++;</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  }</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  }</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  }</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  </div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  std::vector<FlowArc> arcs;</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  </div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="comment">// Build a flow node for each disjunction and corresponding arcs.</span></div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="comment">// Each node exits to the sink through a node, for which the outgoing</span></div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="comment">// capacity is one (only one of the nodes in the disjunction is performed).</span></div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  absl::flat_hash_map<int, int> flow_to_disjunction;</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</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 name="l00222"></a><span class="lineno"> 222</span>  <span class="keyword">const</span> std::vector<int64>& flow_nodes = disjunction_to_flow_nodes[i];</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordflow">if</span> (flow_nodes.size() == 1) {</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  flow_to_disjunction[flow_nodes.back()] = i;</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  flow_to_disjunction[num_flow_nodes] = i;</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> flow_node : flow_nodes) {</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  arcs.push_back({flow_node, num_flow_nodes, 1, 0});</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  }</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  num_flow_nodes++;</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  }</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  }</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  </div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="comment">// Build arcs from each vehicle to each non-vehicle flow node; the cost of</span></div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="comment">// each arc corresponds to:</span></div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="comment">// start(vehicle) -> pickup -> delivery -> end(vehicle)</span></div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="comment">// or</span></div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="comment">// start(vehicle) -> node -> end(vehicle)</span></div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  std::vector<int> vehicle_to_flow;</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  absl::flat_hash_map<int, int> flow_to_vehicle;</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); ++vehicle) {</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> start = <a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(vehicle);</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> end = <a class="code" href="classoperations__research_1_1_routing_model.html#a1dc8d32892f78532c8ee7a7186158e07">End</a>(vehicle);</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::vector<int64>& flow_nodes : disjunction_to_flow_nodes) {</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> flow_node : flow_nodes) {</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  std::pair<int64, int64> pd_pair;</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = -1;</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a> = 0;</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordtype">bool</span> add_arc = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">if</span> (<a class="code" href="namespacegtl.html#a6a4238d2e35cf819a8e83d60d331ea64">gtl::FindCopy</a>(flow_to_pd, flow_node, &pd_pair)) {</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup = pd_pair.first;</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery = pd_pair.second;</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_model.html#a43c49fc1660ae71cdb30ae93bcac80d7">IsVehicleAllowedForIndex</a>(vehicle, pickup) &&</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <a class="code" href="classoperations__research_1_1_routing_model.html#a43c49fc1660ae71cdb30ae93bcac80d7">IsVehicleAllowedForIndex</a>(vehicle, delivery)) {</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  add_arc = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a> =</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="classoperations__research_1_1_routing_model.html#a50dd6fccc1cca84aa10efc8f3ece396c">GetArcCostForVehicle</a>(start, pickup, vehicle),</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="classoperations__research_1_1_routing_model.html#a50dd6fccc1cca84aa10efc8f3ece396c">GetArcCostForVehicle</a>(pickup, delivery, vehicle),</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <a class="code" href="classoperations__research_1_1_routing_model.html#a50dd6fccc1cca84aa10efc8f3ece396c">GetArcCostForVehicle</a>(delivery, end, vehicle)));</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keyword">const</span> absl::flat_hash_map<int64, int64> nexts = {</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  {start, pickup}, {pickup, delivery}, {delivery, end}};</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordflow">for</span> (LocalDimensionCumulOptimizer& optimizer : optimizers) {</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_cost_value = 0;</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="comment">// TODO(user): if the result is RELAXED_OPTIMAL_ONLY, do a</span></div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="comment">// second pass with an MP solver.</span></div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordflow">if</span> (optimizer.ComputeRouteCumulCostWithoutFixedTransits(</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  vehicle,</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  [&nexts](<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node) { return nexts.find(node)->second; },</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  &cumul_cost_value) !=</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a> = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>, cumul_cost_value);</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  add_arc = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  }</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  }</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  }</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="namespacegtl.html#a6a4238d2e35cf819a8e83d60d331ea64">gtl::FindCopy</a>(flow_to_non_pd, flow_node, &node)) {</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_model.html#a43c49fc1660ae71cdb30ae93bcac80d7">IsVehicleAllowedForIndex</a>(vehicle, node)) {</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  add_arc = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a> = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="classoperations__research_1_1_routing_model.html#a50dd6fccc1cca84aa10efc8f3ece396c">GetArcCostForVehicle</a>(start, node, vehicle),</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <a class="code" href="classoperations__research_1_1_routing_model.html#a50dd6fccc1cca84aa10efc8f3ece396c">GetArcCostForVehicle</a>(node, end, vehicle));</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keyword">const</span> absl::flat_hash_map<int64, int64> nexts = {{start, node},</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  {node, end}};</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keywordflow">for</span> (LocalDimensionCumulOptimizer& optimizer : optimizers) {</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_cost_value = 0;</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="comment">// TODO(user): if the result is RELAXED_OPTIMAL_ONLY, do a</span></div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="comment">// second pass with an MP solver.</span></div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordflow">if</span> (optimizer.ComputeRouteCumulCostWithoutFixedTransits(</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  vehicle,</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  [&nexts](<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node) { return nexts.find(node)->second; },</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  &cumul_cost_value) !=</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a> = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>, cumul_cost_value);</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  add_arc = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  }</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  }</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  }</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  }</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keywordflow">if</span> (add_arc) {</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  arcs.push_back({num_flow_nodes, flow_node, 1, <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>});</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  }</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  }</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  }</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  flow_to_vehicle[num_flow_nodes] = vehicle;</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  vehicle_to_flow.push_back(num_flow_nodes);</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  num_flow_nodes++;</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  }</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="comment">// Create flow source and sink nodes.</span></div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> source = num_flow_nodes + 1;</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> sink = source + 1;</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="comment">// Source connected to vehicle nodes.</span></div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); ++vehicle) {</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  arcs.push_back({source, vehicle_to_flow[vehicle], 1, 0});</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  }</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="comment">// Handle unperformed nodes.</span></div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="comment">// Create a node to catch unperformed nodes and connect it to source.</span></div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> unperformed = num_flow_nodes;</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> flow_supply = disjunction_to_flow_nodes.size();</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  arcs.push_back({source, unperformed, flow_supply, 0});</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</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 name="l00326"></a><span class="lineno"> 326</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> flow_node = flow_disjunction_element.first;</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> penalty =</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  disjunction_penalties[flow_disjunction_element.second];</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keywordflow">if</span> (penalty != <a class="code" href="classoperations__research_1_1_routing_model.html#a89db28c1da47c5aef8a0aa380a1800ec">kNoPenalty</a>) {</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  arcs.push_back({unperformed, flow_node, 1, penalty});</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  }</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="comment">// Connect non-vehicle flow nodes to sinks.</span></div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  arcs.push_back({flow_node, sink, 1, 0});</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  }</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  </div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="comment">// Rescale costs for min-cost flow; assuming max cost resulting from the</span></div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="comment">// push-relabel flow algorithm is max_arc_cost * (num_nodes+1) * (num_nodes+1)</span></div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="comment">// (cost-scaling multiplies arc costs by num_nodes+1 and the flow itself can</span></div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="comment">// accumulate num_nodes+1 such arcs (with capacity being 1 for costed arcs)).</span></div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> scale_factor = 1;</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keyword">const</span> FlowArc& arc_with_max_cost = *std::max_element(</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  arcs.begin(), arcs.end(),</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  [](<span class="keyword">const</span> FlowArc& <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <span class="keyword">const</span> FlowArc& <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) { return a.cost < b.cost; });</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="comment">// SimpleMinCostFlow adds a source and a sink node, so actual number of</span></div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="comment">// nodes to consider is num_flow_nodes + 3.</span></div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> actual_flow_num_nodes = num_flow_nodes + 3;</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</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 name="l00348"></a><span class="lineno"> 348</span>  2 * log(actual_flow_num_nodes) ></div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  log(<a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::numeric_limits<int64>::max</a>())) {</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  scale_factor = <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(actual_flow_num_nodes, actual_flow_num_nodes);</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  }</div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  </div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  SimpleMinCostFlow flow;</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="comment">// Add arcs to flow.</span></div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> FlowArc& arc : arcs) {</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  flow.AddArcWithCapacityAndUnitCost(arc.tail, arc.head, arc.capacity,</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  arc.cost / scale_factor);</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  }</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  </div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="comment">// Set flow supply (number of non-vehicle nodes or pairs).</span></div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  flow.SetNodeSupply(source, flow_supply);</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  flow.SetNodeSupply(sink, -flow_supply);</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  </div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="comment">// TODO(user): Take time limit into account.</span></div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordflow">if</span> (flow.Solve() != <a class="code" href="classoperations__research_1_1_min_cost_flow_base.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad">SimpleMinCostFlow::OPTIMAL</a>) {</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  }</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  </div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="comment">// Map the flow result to assignment, only setting next variables.</span></div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  std::vector<bool> used_vehicles(<a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  absl::flat_hash_set<int> used_nodes;</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < flow.NumArcs(); ++i) {</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keywordflow">if</span> (flow.Flow(i) > 0 && flow.Tail(i) != source && flow.Head(i) != sink) {</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  std::vector<int> <a class="code" href="classoperations__research_1_1_routing_model.html#a0f38add802397fef1f57b7d90ccd5aef">nodes</a>;</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  std::pair<int64, int64> pd_pair;</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keywordtype">int</span> node = -1;</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = -1;</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keywordflow">if</span> (<a class="code" href="namespacegtl.html#a6a4238d2e35cf819a8e83d60d331ea64">gtl::FindCopy</a>(flow_to_pd, flow.Head(i), &pd_pair)) {</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <a class="code" href="classoperations__research_1_1_routing_model.html#a0f38add802397fef1f57b7d90ccd5aef">nodes</a>.push_back(pd_pair.first);</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <a class="code" href="classoperations__research_1_1_routing_model.html#a0f38add802397fef1f57b7d90ccd5aef">nodes</a>.push_back(pd_pair.second);</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="namespacegtl.html#a6a4238d2e35cf819a8e83d60d331ea64">gtl::FindCopy</a>(flow_to_non_pd, flow.Head(i), &node)) {</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <a class="code" href="classoperations__research_1_1_routing_model.html#a0f38add802397fef1f57b7d90ccd5aef">nodes</a>.push_back(node);</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="namespacegtl.html#a6a4238d2e35cf819a8e83d60d331ea64">gtl::FindCopy</a>(flow_to_disjunction, flow.Head(i), &<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)) {</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> flow_node : disjunction_to_flow_nodes[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]) {</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">if</span> (<a class="code" href="namespacegtl.html#a6a4238d2e35cf819a8e83d60d331ea64">gtl::FindCopy</a>(flow_to_pd, flow_node, &pd_pair)) {</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <a class="code" href="classoperations__research_1_1_routing_model.html#a0f38add802397fef1f57b7d90ccd5aef">nodes</a>.push_back(pd_pair.first);</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <a class="code" href="classoperations__research_1_1_routing_model.html#a0f38add802397fef1f57b7d90ccd5aef">nodes</a>.push_back(pd_pair.second);</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="namespacegtl.html#a6a4238d2e35cf819a8e83d60d331ea64">gtl::FindCopy</a>(flow_to_non_pd, flow_node, &node)) {</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <a class="code" href="classoperations__research_1_1_routing_model.html#a0f38add802397fef1f57b7d90ccd5aef">nodes</a>.push_back(node);</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  }</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  }</div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  }</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keywordtype">int</span> vehicle = -1;</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keywordflow">if</span> (flow.Tail(i) == unperformed) {</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="comment">// Head is unperformed.</span></div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node : <a class="code" href="classoperations__research_1_1_routing_model.html#a0f38add802397fef1f57b7d90ccd5aef">nodes</a>) {</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  assignment->Add(<a class="code" href="classoperations__research_1_1_routing_model.html#a66fb44c05f9875685e9c332fbdfb643b">NextVar</a>(node))->SetValue(node);</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  used_nodes.insert(node);</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  }</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="namespacegtl.html#a6a4238d2e35cf819a8e83d60d331ea64">gtl::FindCopy</a>(flow_to_vehicle, flow.Tail(i), &vehicle)) {</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="comment">// Head is performed on a vehicle.</span></div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  used_vehicles[vehicle] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keywordtype">int</span> current = <a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(vehicle);</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node : <a class="code" href="classoperations__research_1_1_routing_model.html#a0f38add802397fef1f57b7d90ccd5aef">nodes</a>) {</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  assignment->Add(<a class="code" href="classoperations__research_1_1_routing_model.html#a66fb44c05f9875685e9c332fbdfb643b">NextVar</a>(current))->SetValue(node);</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  used_nodes.insert(node);</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  current = node;</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  }</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  assignment->Add(<a class="code" href="classoperations__research_1_1_routing_model.html#a66fb44c05f9875685e9c332fbdfb643b">NextVar</a>(current))->SetValue(<a class="code" href="classoperations__research_1_1_routing_model.html#a1dc8d32892f78532c8ee7a7186158e07">End</a>(vehicle));</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  }</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  }</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  }</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="comment">// Adding unused nodes.</span></div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < <a class="code" href="classoperations__research_1_1_routing_model.html#a354dd8c252cf59b748602b342db6019d">Size</a>(); ++node) {</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_routing_model.html#ae1adbc353c105572655ae866124c61b6">IsStart</a>(node) && used_nodes.count(node) == 0) {</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  assignment->Add(<a class="code" href="classoperations__research_1_1_routing_model.html#a66fb44c05f9875685e9c332fbdfb643b">NextVar</a>(node))->SetValue(node);</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  }</div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  }</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="comment">// Adding unused vehicles.</span></div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); ++vehicle) {</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keywordflow">if</span> (!used_vehicles[vehicle]) {</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  assignment->Add(<a class="code" href="classoperations__research_1_1_routing_model.html#a66fb44c05f9875685e9c332fbdfb643b">NextVar</a>(<a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(vehicle)))->SetValue(<a class="code" href="classoperations__research_1_1_routing_model.html#a1dc8d32892f78532c8ee7a7186158e07">End</a>(vehicle));</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  }</div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  }</div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span> }</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  </div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a021e695f54a13bd809c34b2f4ca87c37"><div class="ttname"><a href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">min</a></div><div class="ttdeci">int64 min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00138">alldiff_cst.cc:138</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a9d0c202d5fdd62f4fa2c613339ff168a"><div class="ttname"><a href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">max</a></div><div class="ttdeci">int64 max</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="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#l00887">base/logging.h:887</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#l00884">base/logging.h:884</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#l00978">base/logging.h:978</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#l00196">min_cost_flow.h:196</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#l02368">routing.h:2368</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#l01343">routing.h:1343</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a1090dab71b48b49153d70b9e6c299c25"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a1090dab71b48b49153d70b9e6c299c25">operations_research::RoutingModel::GetDisjunctionMaxCardinality</a></div><div class="ttdeci">int64 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#l00663">routing.h:663</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a1dc8d32892f78532c8ee7a7186158e07"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a1dc8d32892f78532c8ee7a7186158e07">operations_research::RoutingModel::End</a></div><div class="ttdeci">int64 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#l01182">routing.h:1182</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#l00242">routing.h:242</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a276086c8aada62b6301aa44e4289347d"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a276086c8aada62b6301aa44e4289347d">operations_research::RoutingModel::GetDisjunctionPenalty</a></div><div class="ttdeci">int64 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#l00658">routing.h:658</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a354dd8c252cf59b748602b342db6019d"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a354dd8c252cf59b748602b342db6019d">operations_research::RoutingModel::Size</a></div><div class="ttdeci">int64 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#l01347">routing.h:1347</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a43c49fc1660ae71cdb30ae93bcac80d7"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a43c49fc1660ae71cdb30ae93bcac80d7">operations_research::RoutingModel::IsVehicleAllowedForIndex</a></div><div class="ttdeci">bool IsVehicleAllowedForIndex(int vehicle, int64 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#l00694">routing.h:694</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a44afcc03d5cb68c01acefa253de9edcf"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a44afcc03d5cb68c01acefa253de9edcf">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#l00417">routing.h:417</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#l01936">routing.h:1936</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a50dd6fccc1cca84aa10efc8f3ece396c"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a50dd6fccc1cca84aa10efc8f3ece396c">operations_research::RoutingModel::GetArcCostForVehicle</a></div><div class="ttdeci">int64 GetArcCostForVehicle(int64 from_index, int64 to_index, int64 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#l03918">routing.cc:3918</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a66fb44c05f9875685e9c332fbdfb643b"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a66fb44c05f9875685e9c332fbdfb643b">operations_research::RoutingModel::NextVar</a></div><div class="ttdeci">IntVar * NextVar(int64 index) const</div><div class="ttdoc">!defined(SWIGPYTHON)</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01207">routing.h:1207</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#l04996">routing.cc:4996</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a89b2c610c22a3223f1cac10233d7992d"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a89b2c610c22a3223f1cac10233d7992d">operations_research::RoutingModel::GetDisjunctionIndices</a></div><div class="ttdeci">const std::vector< DisjunctionIndex > & GetDisjunctionIndices(int64 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#l00631">routing.h:631</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a89db28c1da47c5aef8a0aa380a1800ec"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a89db28c1da47c5aef8a0aa380a1800ec">operations_research::RoutingModel::kNoPenalty</a></div><div class="ttdeci">static const int64 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#l00384">routing.h:384</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a9e42e15bdb23d63ae78137b97a4882de"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a9e42e15bdb23d63ae78137b97a4882de">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#l00746">routing.h:746</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#l01345">routing.h:1345</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#l00667">routing.h:667</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#l00034">routing_flow.cc:34</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_acbdbdfc9491ef0586459d38cc5ef4cb8"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">operations_research::RoutingModel::Start</a></div><div class="ttdeci">int64 Start(int vehicle) const</div><div class="ttdoc">Model inspection.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01180">routing.h:1180</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_ae1adbc353c105572655ae866124c61b6"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#ae1adbc353c105572655ae866124c61b6">operations_research::RoutingModel::IsStart</a></div><div class="ttdeci">bool IsStart(int64 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#l03896">routing.cc:3896</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_ae2530e17cabaf267e12929ca0ee1bee0"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#ae2530e17cabaf267e12929ca0ee1bee0">operations_research::RoutingModel::IsEnd</a></div><div class="ttdeci">bool IsEnd(int64 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#l01186">routing.h:1186</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_ae82492179600550970bd0b0dccf0b3f1"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#ae82492179600550970bd0b0dccf0b3f1">operations_research::RoutingModel::GetPickupIndexPairs</a></div><div class="ttdeci">const std::vector< std::pair< int, int > > & GetPickupIndexPairs(int64 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#l01707">routing.cc:1707</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#l00240">routing.h:240</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_afad671d4876daa753d520bf2adceafbd"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#afad671d4876daa753d520bf2adceafbd">operations_research::RoutingModel::GetDeliveryIndexPairs</a></div><div class="ttdeci">const std::vector< std::pair< int, int > > & GetDeliveryIndexPairs(int64 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#l01713">routing.cc:1713</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a344010e26426d6a13411648d988bc9b6"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a></div><div class="ttdeci">int64 b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00043">constraint_solver/table.cc:43</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_af730895c6c6ef6e03caaf6251192dfd2"><div class="ttname"><a href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a></div><div class="ttdeci">int64 a</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00042">constraint_solver/table.cc:42</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#l00108">cp_model_fz_solver.cc:108</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#l00272">gurobi_interface.cc:272</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a74ea76ea27f48fb1b6e148e1577b3719"><div class="ttname"><a href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a></div><div class="ttdeci">static const int64 kint64max</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00053">integral_types.h:53</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a7cde0074dfd288f2d70c0e035dacb28a"><div class="ttname"><a href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a></div><div class="ttdeci">int64_t int64</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00034">integral_types.h:34</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#l00155">map_util.h:155</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">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...</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_a99264812cf177270e521f226a5c012c3"><div class="ttname"><a href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">operations_research::CapAdd</a></div><div class="ttdeci">int64 CapAdd(int64 x, int64 y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00124">saturated_arithmetic.h:124</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_ab216763dccd16f5060d2fbcfb08173fb"><div class="ttname"><a href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">operations_research::CapProd</a></div><div class="ttdeci">int64 CapProd(int64 x, int64 y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00231">saturated_arithmetic.h:231</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#l00508">pack.cc:508</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_a10b672faee4b99c6a02feb0e343f3b0f"><div class="ttname"><a href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a></div><div class="ttdeci">int64 tail</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00127">routing_flow.cc:127</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_a26a8cbbc7bcf4117c2bf65104b4a54b4"><div class="ttname"><a href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a></div><div class="ttdeci">int64 cost</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00130">routing_flow.cc:130</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_ac891d9f514e55ec8ee1212757a147888"><div class="ttname"><a href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a></div><div class="ttdeci">int64 head</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00128">routing_flow.cc:128</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_adf3be22c64f10c0783c0cf277e857adf"><div class="ttname"><a href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a></div><div class="ttdeci">int64 capacity</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00129">routing_flow.cc:129</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><!-- 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.1 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|