6770 lines
1.3 MiB
6770 lines
1.3 MiB
<!-- 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_search.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__search_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_search.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="routing__search_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="comment">// Implementation of all classes related to routing and search.</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// This includes decision builders, local search neighborhood operators</span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// and local search filters.</span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// TODO(user): Move all existing routing search code here.</span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span>  </div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <cstdlib></span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <map></span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <numeric></span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <set></span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <utility></span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  </div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "absl/container/flat_hash_map.h"</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "absl/container/flat_hash_set.h"</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "<a class="code" href="iterator__adaptors_8h.html">ortools/base/iterator_adaptors.h</a>"</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "<a class="code" href="map__util_8h.html">ortools/base/map_util.h</a>"</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "<a class="code" href="small__map_8h.html">ortools/base/small_map.h</a>"</span></div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#include "<a class="code" href="small__ordered__set_8h.html">ortools/base/small_ordered_set.h</a>"</span></div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include "<a class="code" href="stl__util_8h.html">ortools/base/stl_util.h</a>"</span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include "<a class="code" href="strong__vector_8h.html">ortools/base/strong_vector.h</a>"</span></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include "<a class="code" href="constraint__solveri_8h.html">ortools/constraint_solver/constraint_solveri.h</a>"</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</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="l00037"></a><span class="lineno"> 37</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="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#include "<a class="code" href="routing__types_8h.html">ortools/constraint_solver/routing_types.h</a>"</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#include "<a class="code" href="christofides_8h.html">ortools/graph/christofides.h</a>"</span></div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="preprocessor">#include "<a class="code" href="bitset_8h.html">ortools/util/bitset.h</a>"</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor">#include "<a class="code" href="saturated__arithmetic_8h.html">ortools/util/saturated_arithmetic.h</a>"</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  </div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"><a class="line" href="routing__search_8cc.html#a60696653bee60d2186d1ea5850f64567"> 43</a></span> <a class="code" href="routing__search_8cc.html#a60696653bee60d2186d1ea5850f64567">ABSL_FLAG</a>(<span class="keywordtype">bool</span>, routing_strong_debug_checks, <span class="keyword">false</span>,</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="stringliteral">"Run stronger checks in debug; these stronger tests might change "</span></div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="stringliteral">"the complexity of the code in particular."</span>);</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"><a class="line" href="routing__search_8cc.html#acc95d14bc59afe35d789e11bbacfab6f"> 46</a></span> <a class="code" href="routing__search_8cc.html#a60696653bee60d2186d1ea5850f64567">ABSL_FLAG</a>(<span class="keywordtype">bool</span>, routing_shift_insertion_cost_by_penalty, <span class="keyword">true</span>,</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="stringliteral">"Shift insertion costs by the penalty of the inserted node(s)."</span>);</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  </div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</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="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  </div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment">// Max active vehicles filter.</span></div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  </div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="keyword">class </span>MaxActiveVehiclesFilter : <span class="keyword">public</span> IntVarLocalSearchFilter {</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keyword">explicit</span> MaxActiveVehiclesFilter(<span class="keyword">const</span> RoutingModel& routing_model)</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  : IntVarLocalSearchFilter(routing_model.Nexts()),</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  routing_model_(routing_model),</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  is_active_(routing_model.vehicles(), false),</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  active_vehicles_(0) {}</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordtype">bool</span> Accept(<span class="keyword">const</span> Assignment* <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>, <span class="keyword">const</span> Assignment* deltadelta,</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_min, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_max)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a> = -1;</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_assignment.html#ace2db6f9700f6a2159db104f5df1dc8f">Assignment::IntContainer</a>& container = <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>->IntVarContainer();</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> delta_size = container.Size();</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordtype">int</span> current_active_vehicles = active_vehicles_;</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < delta_size; ++i) {</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keyword">const</span> IntVarElement& new_element = container.Element(i);</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = new_element.Var();</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a>;</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordflow">if</span> (FindIndex(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, &<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) && routing_model_.IsStart(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)) {</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">if</span> (new_element.Min() != new_element.Max()) {</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">// LNS detected.</span></div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  }</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = routing_model_.VehicleIndex(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_active =</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  (new_element.Min() != routing_model_.End(vehicle));</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">if</span> (is_active && !is_active_[vehicle]) {</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  ++current_active_vehicles;</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!is_active && is_active_[vehicle]) {</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  --current_active_vehicles;</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  }</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  }</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  }</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">return</span> current_active_vehicles <=</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  routing_model_.GetMaximumNumberOfActiveVehicles();</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  }</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="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordtype">void</span> OnSynchronize(<span class="keyword">const</span> Assignment* <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  active_vehicles_ = 0;</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < routing_model_.vehicles(); ++i) {</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = routing_model_.Start(i);</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">if</span> (IsVarSynced(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) && <a class="code" href="namespaceoperations__research_1_1sat.html#a3f1a1b8a7a1a488e263a2e74f45d2a59">Value</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) != routing_model_.End(i)) {</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  is_active_[i] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  ++active_vehicles_;</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  is_active_[i] = <span class="keyword">false</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>  }</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="keyword">const</span> RoutingModel& routing_model_;</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  std::vector<bool> is_active_;</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordtype">int</span> active_vehicles_;</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> };</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  </div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#aa2ef113e19924b88159b114a929b3358"> 111</a></span> <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html">IntVarLocalSearchFilter</a>* <a class="code" href="namespaceoperations__research.html#aa2ef113e19924b88159b114a929b3358">MakeMaxActiveVehiclesFilter</a>(</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>& routing_model) {</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keywordflow">return</span> routing_model.<a class="code" href="classoperations__research_1_1_routing_model.html#a5f32c22c620c811754ba7b6f977db864">solver</a>()-><a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keyword">new</span> MaxActiveVehiclesFilter(routing_model));</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span> }</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  </div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  </div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment">// Node disjunction filter class.</span></div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  </div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="keyword">class </span>NodeDisjunctionFilter : <span class="keyword">public</span> IntVarLocalSearchFilter {</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keyword">explicit</span> NodeDisjunctionFilter(<span class="keyword">const</span> RoutingModel& routing_model)</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  : IntVarLocalSearchFilter(routing_model.Nexts()),</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  routing_model_(routing_model),</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  active_per_disjunction_(routing_model.GetNumberOfDisjunctions(), 0),</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  inactive_per_disjunction_(routing_model.GetNumberOfDisjunctions(), 0),</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  synchronized_objective_value_(<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>),</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  accepted_objective_value_(<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>) {}</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  </div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keywordtype">bool</span> Accept(<span class="keyword">const</span> Assignment* <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>, <span class="keyword">const</span> Assignment* deltadelta,</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_min, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_max)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a> = -1;</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_assignment.html#ace2db6f9700f6a2159db104f5df1dc8f">Assignment::IntContainer</a>& container = <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>->IntVarContainer();</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> delta_size = container.Size();</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <a class="code" href="classgtl_1_1small__map.html">gtl::small_map<std::map<RoutingModel::DisjunctionIndex, int></a>></div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  disjunction_active_deltas;</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <a class="code" href="classgtl_1_1small__map.html">gtl::small_map<std::map<RoutingModel::DisjunctionIndex, int></a>></div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  disjunction_inactive_deltas;</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordtype">bool</span> lns_detected = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="comment">// Update active/inactive count per disjunction for each element of delta.</span></div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < delta_size; ++i) {</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keyword">const</span> IntVarElement& new_element = container.Element(i);</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = new_element.Var();</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a>;</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">if</span> (FindIndex(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, &<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)) {</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_inactive =</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  (new_element.Min() <= <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> && new_element.Max() >= <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordflow">if</span> (new_element.Min() != new_element.Max()) {</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  lns_detected = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  }</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html#afa7cbbd4db2dd5d0bec3393efc9ebac1">RoutingModel::DisjunctionIndex</a> disjunction_index :</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  routing_model_.GetDisjunctionIndices(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)) {</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> active_state_changed =</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  !IsVarSynced(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) || (<a class="code" href="namespaceoperations__research_1_1sat.html#a3f1a1b8a7a1a488e263a2e74f45d2a59">Value</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) == <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) != is_inactive;</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">if</span> (active_state_changed) {</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">if</span> (!is_inactive) {</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  ++<a class="code" href="namespacegtl.html#a7a0f8dc4187504b814d8a8be463b517c">gtl::LookupOrInsert</a>(&disjunction_active_deltas,</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  disjunction_index, 0);</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">if</span> (IsVarSynced(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)) {</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  --<a class="code" href="namespacegtl.html#a7a0f8dc4187504b814d8a8be463b517c">gtl::LookupOrInsert</a>(&disjunction_inactive_deltas,</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  disjunction_index, 0);</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  }</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  ++<a class="code" href="namespacegtl.html#a7a0f8dc4187504b814d8a8be463b517c">gtl::LookupOrInsert</a>(&disjunction_inactive_deltas,</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  disjunction_index, 0);</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordflow">if</span> (IsVarSynced(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)) {</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  --<a class="code" href="namespacegtl.html#a7a0f8dc4187504b814d8a8be463b517c">gtl::LookupOrInsert</a>(&disjunction_active_deltas,</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  disjunction_index, 0);</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  }</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>  }</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  }</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  }</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="comment">// Check if any disjunction has too many active nodes.</span></div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::pair<RoutingModel::DisjunctionIndex, int></div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  disjunction_active_delta : disjunction_active_deltas) {</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> current_active_nodes =</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  active_per_disjunction_[disjunction_active_delta.first];</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> active_nodes =</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  current_active_nodes + disjunction_active_delta.second;</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> max_cardinality = routing_model_.GetDisjunctionMaxCardinality(</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  disjunction_active_delta.first);</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="comment">// Too many active nodes.</span></div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">if</span> (active_nodes > max_cardinality) {</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</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>  }</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">// Update penalty costs for disjunctions.</span></div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  accepted_objective_value_ = synchronized_objective_value_;</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::pair<RoutingModel::DisjunctionIndex, int></div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  disjunction_inactive_delta : disjunction_inactive_deltas) {</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> penalty = routing_model_.GetDisjunctionPenalty(</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  disjunction_inactive_delta.first);</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordflow">if</span> (penalty != 0 && !lns_detected) {</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html#afa7cbbd4db2dd5d0bec3393efc9ebac1">RoutingModel::DisjunctionIndex</a> disjunction_index =</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  disjunction_inactive_delta.first;</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> current_inactive_nodes =</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  inactive_per_disjunction_[disjunction_index];</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> inactive_nodes =</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  current_inactive_nodes + disjunction_inactive_delta.second;</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> max_inactive_cardinality =</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  routing_model_.GetDisjunctionIndices(disjunction_index).size() -</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  routing_model_.GetDisjunctionMaxCardinality(disjunction_index);</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="comment">// Too many inactive nodes.</span></div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keywordflow">if</span> (inactive_nodes > max_inactive_cardinality) {</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">if</span> (penalty < 0) {</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="comment">// Nodes are mandatory, i.e. exactly max_cardinality nodes must be</span></div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="comment">// performed, so the move is not acceptable.</span></div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (current_inactive_nodes <= max_inactive_cardinality) {</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="comment">// Add penalty if there were not too many inactive nodes before the</span></div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="comment">// move.</span></div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  accepted_objective_value_ =</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(accepted_objective_value_, penalty);</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  }</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (current_inactive_nodes > max_inactive_cardinality) {</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="comment">// Remove penalty if there were too many inactive nodes before the</span></div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="comment">// move and there are not too many after the move.</span></div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  accepted_objective_value_ =</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(accepted_objective_value_, penalty);</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  }</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  }</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  }</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keywordflow">if</span> (lns_detected) {</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  accepted_objective_value_ = 0;</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="comment">// Only compare to max as a cost lower bound is computed.</span></div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordflow">return</span> accepted_objective_value_ <= objective_max;</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>  std::string DebugString()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> <span class="stringliteral">"NodeDisjunctionFilter"</span>; }</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> GetSynchronizedObjectiveValue()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">return</span> synchronized_objective_value_;</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  }</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> GetAcceptedObjectiveValue()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keywordflow">return</span> accepted_objective_value_;</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  }</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  </div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keywordtype">void</span> OnSynchronize(<span class="keyword">const</span> Assignment* <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  synchronized_objective_value_ = 0;</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_routing_model.html#afa7cbbd4db2dd5d0bec3393efc9ebac1">RoutingModel::DisjunctionIndex</a> i(0);</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  i < active_per_disjunction_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  active_per_disjunction_[i] = 0;</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  inactive_per_disjunction_[i] = 0;</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keyword">const</span> std::vector<int64>& disjunction_indices =</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  routing_model_.GetDisjunctionIndices(i);</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> : disjunction_indices) {</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> index_synced = IsVarSynced(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keywordflow">if</span> (index_synced) {</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research_1_1sat.html#a3f1a1b8a7a1a488e263a2e74f45d2a59">Value</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) != <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  ++active_per_disjunction_[i];</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  ++inactive_per_disjunction_[i];</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  }</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  }</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  }</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> penalty = routing_model_.GetDisjunctionPenalty(i);</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> max_cardinality =</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  routing_model_.GetDisjunctionMaxCardinality(i);</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordflow">if</span> (inactive_per_disjunction_[i] ></div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  disjunction_indices.size() - max_cardinality &&</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  penalty > 0) {</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  synchronized_objective_value_ =</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(synchronized_objective_value_, penalty);</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  }</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  }</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  }</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  </div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keyword">const</span> RoutingModel& routing_model_;</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  </div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<RoutingModel::DisjunctionIndex, int></a></div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  active_per_disjunction_;</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<RoutingModel::DisjunctionIndex, int></a></div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  inactive_per_disjunction_;</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> synchronized_objective_value_;</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> accepted_objective_value_;</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span> };</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  </div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#aeb15e4444582a925522843bb414de9c3"> 284</a></span> <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html">IntVarLocalSearchFilter</a>* <a class="code" href="namespaceoperations__research.html#aeb15e4444582a925522843bb414de9c3">MakeNodeDisjunctionFilter</a>(</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>& routing_model) {</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">return</span> routing_model.<a class="code" href="classoperations__research_1_1_routing_model.html#a5f32c22c620c811754ba7b6f977db864">solver</a>()-><a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keyword">new</span> NodeDisjunctionFilter(routing_model));</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span> }</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  </div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span> <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_base_path_filter.html#a33b6c2ef668063ee2d9f9c30071b1b7e">BasePathFilter::kUnassigned</a> = -1;</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  </div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_base_path_filter.html#a7c22021d1ebcfa7e3b8bbe36d0dcac7c"> 292</a></span> <a class="code" href="classoperations__research_1_1_base_path_filter.html#a7c22021d1ebcfa7e3b8bbe36d0dcac7c">BasePathFilter::BasePathFilter</a>(<span class="keyword">const</span> std::vector<IntVar*>& nexts,</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordtype">int</span> next_domain_size)</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  : <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html">IntVarLocalSearchFilter</a>(nexts),</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  node_path_starts_(next_domain_size, <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a>),</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  paths_(nexts.size(), -1),</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  new_synchronized_unperformed_nodes_(nexts.size()),</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  new_nexts_(nexts.size(), <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a>),</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  touched_paths_(nexts.size()),</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  touched_path_chain_start_ends_(nexts.size(), {<a class="code" href="classoperations__research_1_1_base_path_filter.html#a33b6c2ef668063ee2d9f9c30071b1b7e">kUnassigned</a>, <a class="code" href="classoperations__research_1_1_base_path_filter.html#a33b6c2ef668063ee2d9f9c30071b1b7e">kUnassigned</a>}),</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  ranks_(next_domain_size, -1),</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  status_(BasePathFilter::UNKNOWN) {}</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  </div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_base_path_filter.html#a511cf14b54c83cffc0a673985db90643"> 304</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_base_path_filter.html#a511cf14b54c83cffc0a673985db90643">BasePathFilter::Accept</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_assignment.html">Assignment</a>* <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>,</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_assignment.html">Assignment</a>* deltadelta, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_min,</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_max) {</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_base_path_filter.html#a8869de3e40b0eeee56470a8fc0cd4528">IsDisabled</a>()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> touched : delta_touched_) {</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  new_nexts_[touched] = <a class="code" href="classoperations__research_1_1_base_path_filter.html#a33b6c2ef668063ee2d9f9c30071b1b7e">kUnassigned</a>;</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  }</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  delta_touched_.clear();</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_assignment_container.html">Assignment::IntContainer</a>& container = <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>->IntVarContainer();</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> delta_size = container.<a class="code" href="classoperations__research_1_1_assignment_container.html#a24926108b770033792d015cb86aeffb3">Size</a>();</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  delta_touched_.reserve(delta_size);</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="comment">// Determining touched paths and their touched chain start and ends (a node is</span></div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="comment">// touched if it corresponds to an element of delta or that an element of</span></div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="comment">// delta points to it).</span></div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="comment">// The start and end of a touched path subchain will have remained on the same</span></div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="comment">// path and will correspond to the min and max ranks of touched nodes in the</span></div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="comment">// current assignment.</span></div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> touched_path : touched_paths_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">PositionsSetAtLeastOnce</a>()) {</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  touched_path_chain_start_ends_[touched_path] = {<a class="code" href="classoperations__research_1_1_base_path_filter.html#a33b6c2ef668063ee2d9f9c30071b1b7e">kUnassigned</a>, <a class="code" href="classoperations__research_1_1_base_path_filter.html#a33b6c2ef668063ee2d9f9c30071b1b7e">kUnassigned</a>};</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  }</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  touched_paths_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ab4bc8236a9bfe59526e353800a0f0470">SparseClearAll</a>();</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  </div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keyword">const</span> <span class="keyword">auto</span> update_touched_path_chain_start_end = [<span class="keyword">this</span>](<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</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> start = node_path_starts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keywordflow">if</span> (start == <a class="code" href="classoperations__research_1_1_base_path_filter.html#a33b6c2ef668063ee2d9f9c30071b1b7e">kUnassigned</a>) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  touched_paths_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(start);</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  </div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>& chain_start = touched_path_chain_start_ends_[start].first;</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordflow">if</span> (chain_start == <a class="code" href="classoperations__research_1_1_base_path_filter.html#a33b6c2ef668063ee2d9f9c30071b1b7e">kUnassigned</a> || ranks_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] < ranks_[chain_start]) {</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  chain_start = <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</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>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>& chain_end = touched_path_chain_start_ends_[start].second;</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keywordflow">if</span> (chain_end == <a class="code" href="classoperations__research_1_1_base_path_filter.html#a33b6c2ef668063ee2d9f9c30071b1b7e">kUnassigned</a> || ranks_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] > ranks_[chain_end]) {</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  chain_end = <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  }</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  };</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  </div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < delta_size; ++i) {</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_int_var_element.html">IntVarElement</a>& new_element = container.<a class="code" href="classoperations__research_1_1_assignment_container.html#a907ce7f41938cc755b6b1f4a55b5cd27">Element</a>(i);</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <a class="code" href="classoperations__research_1_1_int_var.html">IntVar</a>* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = new_element.<a class="code" href="classoperations__research_1_1_int_var_element.html#a8052ccc3aba839f3befd553cc05b85a0">Var</a>();</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = <a class="code" href="classoperations__research_1_1_base_path_filter.html#a33b6c2ef668063ee2d9f9c30071b1b7e">kUnassigned</a>;</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#a1907b3ee12b9e6e2bfc69e1a69b5baf0">FindIndex</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, &<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)) {</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keywordflow">if</span> (!new_element.<a class="code" href="classoperations__research_1_1_int_var_element.html#a4bead74295e1e5675c0984fcc91ef057">Bound</a>()) {</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="comment">// LNS detected</span></div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  }</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  new_nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = new_element.<a class="code" href="classoperations__research_1_1_int_var_element.html#aeabf4572ab5bf48ec3e07660c9587385">Value</a>();</div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  delta_touched_.push_back(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  update_touched_path_chain_start_end(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  update_touched_path_chain_start_end(new_nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]);</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  }</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  }</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="comment">// Checking feasibility of touched paths.</span></div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  InitializeAcceptPath();</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keywordtype">bool</span> accept = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> touched_start : touched_paths_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">PositionsSetAtLeastOnce</a>()) {</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keyword">const</span> std::pair<int64, int64> start_end =</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  touched_path_chain_start_ends_[touched_start];</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordflow">if</span> (!AcceptPath(touched_start, start_end.first, start_end.second)) {</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  accept = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</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>  <span class="comment">// NOTE: FinalizeAcceptPath() is only called if all paths are accepted.</span></div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordflow">return</span> accept && FinalizeAcceptPath(<a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>, objective_min, objective_max);</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span> }</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  </div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span> <span class="keywordtype">void</span> BasePathFilter::ComputePathStarts(std::vector<int64>* path_starts,</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  std::vector<int>* index_to_path) {</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  path_starts->clear();</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> nexts_size = <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#a24926108b770033792d015cb86aeffb3">Size</a>();</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  index_to_path->assign(nexts_size, <a class="code" href="classoperations__research_1_1_base_path_filter.html#a33b6c2ef668063ee2d9f9c30071b1b7e">kUnassigned</a>);</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <a class="code" href="classoperations__research_1_1_bitset64.html">Bitset64<></a> has_prevs(nexts_size);</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nexts_size; ++i) {</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#af295b14439014798b1fd34faffd3b5e7">IsVarSynced</a>(i)) {</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  has_prevs.Set(i);</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#acc37407ddda743886d3cb40298914f0d">Value</a>(i);</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> < nexts_size) {</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  has_prevs.Set(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  }</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  }</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  }</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nexts_size; ++i) {</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keywordflow">if</span> (!has_prevs[i]) {</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  (*index_to_path)[i] = path_starts->size();</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  path_starts->push_back(i);</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>  }</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span> }</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  </div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span> <span class="keywordtype">bool</span> BasePathFilter::HavePathsChanged() {</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  std::vector<int64> path_starts;</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  std::vector<int> index_to_path(<a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#a24926108b770033792d015cb86aeffb3">Size</a>(), <a class="code" href="classoperations__research_1_1_base_path_filter.html#a33b6c2ef668063ee2d9f9c30071b1b7e">kUnassigned</a>);</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  ComputePathStarts(&path_starts, &index_to_path);</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keywordflow">if</span> (path_starts.size() != starts_.size()) {</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  }</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < path_starts.size(); ++i) {</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keywordflow">if</span> (path_starts[i] != starts_[i]) {</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  }</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  }</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#a24926108b770033792d015cb86aeffb3">Size</a>(); ++i) {</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keywordflow">if</span> (index_to_path[i] != paths_[i]) {</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keywordflow">return</span> <span class="keyword">true</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="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span> }</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  </div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span> <span class="keywordtype">void</span> BasePathFilter::SynchronizeFullAssignment() {</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="comment">// Subclasses of BasePathFilter might not propagate injected objective values</span></div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="comment">// so making sure it is done here (can be done again by the subclass if</span></div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="comment">// needed).</span></div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  ComputePathStarts(&starts_, &paths_);</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0; <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#a24926108b770033792d015cb86aeffb3">Size</a>(); <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>++) {</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#af295b14439014798b1fd34faffd3b5e7">IsVarSynced</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) && <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#acc37407ddda743886d3cb40298914f0d">Value</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) == <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> &&</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  node_path_starts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] != <a class="code" href="classoperations__research_1_1_base_path_filter.html#a33b6c2ef668063ee2d9f9c30071b1b7e">kUnassigned</a>) {</div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="comment">// index was performed before and is now unperformed.</span></div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  new_synchronized_unperformed_nodes_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</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">// Marking unactive nodes (which are not on a path).</span></div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  node_path_starts_.assign(node_path_starts_.size(), <a class="code" href="classoperations__research_1_1_base_path_filter.html#a33b6c2ef668063ee2d9f9c30071b1b7e">kUnassigned</a>);</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="comment">// Marking nodes on a path and storing next values.</span></div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> nexts_size = <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#a24926108b770033792d015cb86aeffb3">Size</a>();</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> start : starts_) {</div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <span class="keywordtype">int</span> node = start;</div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  node_path_starts_[node] = start;</div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#af295b14439014798b1fd34faffd3b5e7">IsVarSynced</a>(node));</div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keywordtype">int</span> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#acc37407ddda743886d3cb40298914f0d">Value</a>(node);</div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="keywordflow">while</span> (<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> < nexts_size) {</div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  node = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  node_path_starts_[node] = start;</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#af295b14439014798b1fd34faffd3b5e7">IsVarSynced</a>(node));</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#acc37407ddda743886d3cb40298914f0d">Value</a>(node);</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  }</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  node_path_starts_[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>] = start;</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  }</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  OnBeforeSynchronizePaths();</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  UpdateAllRanks();</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  OnAfterSynchronizePaths();</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span> }</div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  </div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_base_path_filter.html#af5591ad1889b7e23b8461a1fb68d1d48"> 450</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_base_path_filter.html#af5591ad1889b7e23b8461a1fb68d1d48">BasePathFilter::OnSynchronize</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_assignment.html">Assignment</a>* <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>) {</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keywordflow">if</span> (status_ == BasePathFilter::UNKNOWN) {</div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  status_ =</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  DisableFiltering() ? BasePathFilter::DISABLED : BasePathFilter::ENABLED;</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  }</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_base_path_filter.html#a8869de3e40b0eeee56470a8fc0cd4528">IsDisabled</a>()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  new_synchronized_unperformed_nodes_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#aa7d76b766faf39c1652b6617eac5fe20">ClearAll</a>();</div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a> == <span class="keyword">nullptr</span> || <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>->Empty() || starts_.empty()) {</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  SynchronizeFullAssignment();</div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  }</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="comment">// Subclasses of BasePathFilter might not propagate injected objective values</span></div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="comment">// so making sure it is done here (can be done again by the subclass if</span></div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="comment">// needed).</span></div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="comment">// This code supposes that path starts didn't change.</span></div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!absl::GetFlag(FLAGS_routing_strong_debug_checks) ||</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  !HavePathsChanged());</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_assignment_container.html">Assignment::IntContainer</a>& container = <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>->IntVarContainer();</div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  touched_paths_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ab4bc8236a9bfe59526e353800a0f0470">SparseClearAll</a>();</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < container.<a class="code" href="classoperations__research_1_1_assignment_container.html#a24926108b770033792d015cb86aeffb3">Size</a>(); ++i) {</div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_int_var_element.html">IntVarElement</a>& new_element = container.<a class="code" href="classoperations__research_1_1_assignment_container.html#a907ce7f41938cc755b6b1f4a55b5cd27">Element</a>(i);</div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = <a class="code" href="classoperations__research_1_1_base_path_filter.html#a33b6c2ef668063ee2d9f9c30071b1b7e">kUnassigned</a>;</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#a1907b3ee12b9e6e2bfc69e1a69b5baf0">FindIndex</a>(new_element.<a class="code" href="classoperations__research_1_1_int_var_element.html#a8052ccc3aba839f3befd553cc05b85a0">Var</a>(), &<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)) {</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> start = node_path_starts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="keywordflow">if</span> (start != <a class="code" href="classoperations__research_1_1_base_path_filter.html#a33b6c2ef668063ee2d9f9c30071b1b7e">kUnassigned</a>) {</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  touched_paths_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(start);</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#acc37407ddda743886d3cb40298914f0d">Value</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) == <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="comment">// New unperformed node (its previous start isn't unassigned).</span></div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, new_nexts_.size());</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  new_synchronized_unperformed_nodes_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  node_path_starts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = <a class="code" href="classoperations__research_1_1_base_path_filter.html#a33b6c2ef668063ee2d9f9c30071b1b7e">kUnassigned</a>;</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  }</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  }</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  }</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  }</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  OnBeforeSynchronizePaths();</div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> touched_start : touched_paths_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">PositionsSetAtLeastOnce</a>()) {</div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = touched_start;</div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keywordflow">while</span> (node < <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#a24926108b770033792d015cb86aeffb3">Size</a>()) {</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  node_path_starts_[node] = touched_start;</div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  node = <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#acc37407ddda743886d3cb40298914f0d">Value</a>(node);</div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  }</div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  node_path_starts_[node] = touched_start;</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  UpdatePathRanksFromStart(touched_start);</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  OnSynchronizePathFromStart(touched_start);</div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  }</div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  OnAfterSynchronizePaths();</div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span> }</div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  </div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span> <span class="keywordtype">void</span> BasePathFilter::UpdateAllRanks() {</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < ranks_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  ranks_[i] = <a class="code" href="classoperations__research_1_1_base_path_filter.html#a33b6c2ef668063ee2d9f9c30071b1b7e">kUnassigned</a>;</div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  }</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> r = 0; r < <a class="code" href="classoperations__research_1_1_base_path_filter.html#a0d16eaa2f4cc0dbde0c88126021ec34e">NumPaths</a>(); ++r) {</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  UpdatePathRanksFromStart(<a class="code" href="classoperations__research_1_1_base_path_filter.html#a345e688ef627db8fdda23c4b6b45ac0f">Start</a>(r));</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  OnSynchronizePathFromStart(<a class="code" href="classoperations__research_1_1_base_path_filter.html#a345e688ef627db8fdda23c4b6b45ac0f">Start</a>(r));</div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  }</div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span> }</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  </div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span> <span class="keywordtype">void</span> BasePathFilter::UpdatePathRanksFromStart(<span class="keywordtype">int</span> start) {</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keywordtype">int</span> rank = 0;</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = start;</div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keywordflow">while</span> (node < <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#a24926108b770033792d015cb86aeffb3">Size</a>()) {</div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  ranks_[node] = rank;</div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  rank++;</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  node = <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#acc37407ddda743886d3cb40298914f0d">Value</a>(node);</div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  }</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  ranks_[node] = rank;</div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span> }</div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  </div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  </div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span> <span class="keyword">class </span>VehicleAmortizedCostFilter : <span class="keyword">public</span> BasePathFilter {</div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keyword">explicit</span> VehicleAmortizedCostFilter(<span class="keyword">const</span> RoutingModel& routing_model);</div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  ~VehicleAmortizedCostFilter()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keywordflow">return</span> <span class="stringliteral">"VehicleAmortizedCostFilter"</span>;</div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  }</div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> GetSynchronizedObjectiveValue()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keywordflow">return</span> current_vehicle_cost_;</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  }</div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> GetAcceptedObjectiveValue()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keywordflow">return</span> delta_vehicle_cost_;</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  }</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  </div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="keywordtype">void</span> OnSynchronizePathFromStart(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> start) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="keywordtype">void</span> OnAfterSynchronizePaths() <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <span class="keywordtype">void</span> InitializeAcceptPath() <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="keywordtype">bool</span> AcceptPath(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_start, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_start,</div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_end) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="keywordtype">bool</span> FinalizeAcceptPath(<span class="keyword">const</span> Assignment* <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_min,</div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_max) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  </div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> current_vehicle_cost_;</div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delta_vehicle_cost_;</div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  std::vector<int> current_route_lengths_;</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  std::vector<int64> start_to_end_;</div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  std::vector<int> start_to_vehicle_;</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  std::vector<int64> vehicle_to_start_;</div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="keyword">const</span> std::vector<int64>& linear_cost_factor_of_vehicle_;</div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keyword">const</span> std::vector<int64>& quadratic_cost_factor_of_vehicle_;</div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span> };</div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  </div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span> VehicleAmortizedCostFilter::VehicleAmortizedCostFilter(</div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keyword">const</span> RoutingModel& routing_model)</div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  : BasePathFilter(routing_model.Nexts(),</div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  routing_model.Size() + routing_model.vehicles()),</div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  current_vehicle_cost_(0),</div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  delta_vehicle_cost_(0),</div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  current_route_lengths_(Size(), -1),</div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  linear_cost_factor_of_vehicle_(</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  routing_model.GetAmortizedLinearCostFactorOfVehicles()),</div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  quadratic_cost_factor_of_vehicle_(</div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  routing_model.GetAmortizedQuadraticCostFactorOfVehicles()) {</div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  start_to_end_.resize(<a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#a24926108b770033792d015cb86aeffb3">Size</a>(), -1);</div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  start_to_vehicle_.resize(<a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#a24926108b770033792d015cb86aeffb3">Size</a>(), -1);</div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  vehicle_to_start_.resize(routing_model.vehicles());</div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> v = 0; v < routing_model.vehicles(); v++) {</div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> start = routing_model.Start(v);</div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  start_to_vehicle_[start] = v;</div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  start_to_end_[start] = routing_model.End(v);</div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  vehicle_to_start_[v] = start;</div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  }</div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span> }</div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  </div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span> <span class="keywordtype">void</span> VehicleAmortizedCostFilter::OnSynchronizePathFromStart(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> start) {</div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> end = start_to_end_[start];</div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(end, 0);</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> route_length = Rank(end) - 1;</div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(route_length, 0);</div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  current_route_lengths_[start] = route_length;</div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span> }</div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  </div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span> <span class="keywordtype">void</span> VehicleAmortizedCostFilter::OnAfterSynchronizePaths() {</div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  current_vehicle_cost_ = 0;</div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < vehicle_to_start_.size(); vehicle++) {</div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> start = vehicle_to_start_[vehicle];</div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(vehicle, start_to_vehicle_[start]);</div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  </div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> route_length = current_route_lengths_[start];</div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(route_length, 0);</div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  </div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keywordflow">if</span> (route_length == 0) {</div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="comment">// The path is empty.</span></div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  }</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  </div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> linear_cost_factor = linear_cost_factor_of_vehicle_[vehicle];</div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> route_length_cost =</div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(quadratic_cost_factor_of_vehicle_[vehicle],</div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  route_length * route_length);</div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  </div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  current_vehicle_cost_ = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(</div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  current_vehicle_cost_, <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(linear_cost_factor, route_length_cost));</div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  }</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span> }</div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  </div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span> <span class="keywordtype">void</span> VehicleAmortizedCostFilter::InitializeAcceptPath() {</div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  delta_vehicle_cost_ = current_vehicle_cost_;</div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span> }</div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  </div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span> <span class="keywordtype">bool</span> VehicleAmortizedCostFilter::AcceptPath(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_start, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_start,</div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_end) {</div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="comment">// Number of nodes previously between chain_start and chain_end</span></div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> previous_chain_nodes = Rank(chain_end) - 1 - Rank(chain_start);</div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(previous_chain_nodes, 0);</div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="keywordtype">int</span> new_chain_nodes = 0;</div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = GetNext(chain_start);</div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="keywordflow">while</span> (node != chain_end) {</div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  new_chain_nodes++;</div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  node = GetNext(node);</div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  }</div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  </div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> previous_route_length = current_route_lengths_[path_start];</div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(previous_route_length, 0);</div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> new_route_length =</div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  previous_route_length - previous_chain_nodes + new_chain_nodes;</div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  </div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = start_to_vehicle_[path_start];</div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(vehicle, 0);</div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(path_start, vehicle_to_start_[vehicle]);</div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  </div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  <span class="comment">// Update the cost related to used vehicles.</span></div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="comment">// TODO(user): Handle possible overflows.</span></div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="keywordflow">if</span> (previous_route_length == 0) {</div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="comment">// The route was empty before, it is no longer the case (changed path).</span></div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(new_route_length, 0);</div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  delta_vehicle_cost_ =</div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(delta_vehicle_cost_, linear_cost_factor_of_vehicle_[vehicle]);</div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (new_route_length == 0) {</div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="comment">// The route is now empty.</span></div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  delta_vehicle_cost_ =</div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(delta_vehicle_cost_, linear_cost_factor_of_vehicle_[vehicle]);</div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  }</div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  </div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <span class="comment">// Update the cost related to the sum of the squares of the route lengths.</span></div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> quadratic_cost_factor =</div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  quadratic_cost_factor_of_vehicle_[vehicle];</div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  delta_vehicle_cost_ =</div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(delta_vehicle_cost_,</div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(quadratic_cost_factor,</div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  previous_route_length * previous_route_length));</div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  delta_vehicle_cost_ = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(</div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  delta_vehicle_cost_,</div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(quadratic_cost_factor, new_route_length * new_route_length));</div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  </div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span> }</div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  </div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span> <span class="keywordtype">bool</span> VehicleAmortizedCostFilter::FinalizeAcceptPath(<span class="keyword">const</span> Assignment* <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>,</div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_min,</div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_max) {</div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  <span class="keywordflow">return</span> delta_vehicle_cost_ <= objective_max;</div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span> }</div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  </div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  </div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a4bbb86ef97d259aabe86e0abde4759e3"> 669</a></span> <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html">IntVarLocalSearchFilter</a>* <a class="code" href="namespaceoperations__research.html#a4bbb86ef97d259aabe86e0abde4759e3">MakeVehicleAmortizedCostFilter</a>(</div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>& routing_model) {</div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <span class="keywordflow">return</span> routing_model.<a class="code" href="classoperations__research_1_1_routing_model.html#a5f32c22c620c811754ba7b6f977db864">solver</a>()-><a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(</div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="keyword">new</span> VehicleAmortizedCostFilter(routing_model));</div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span> }</div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  </div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  </div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span> <span class="keyword">class </span>TypeRegulationsFilter : <span class="keyword">public</span> BasePathFilter {</div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="keyword">explicit</span> TypeRegulationsFilter(<span class="keyword">const</span> RoutingModel& <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  ~TypeRegulationsFilter()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  std::string DebugString()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> <span class="stringliteral">"TypeRegulationsFilter"</span>; }</div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  </div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="keywordtype">void</span> OnSynchronizePathFromStart(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> start) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="keywordtype">bool</span> AcceptPath(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_start, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_start,</div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_end) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  </div>
|
|
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="keywordtype">bool</span> HardIncompatibilitiesRespected(<span class="keywordtype">int</span> vehicle, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_start,</div>
|
|
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_end);</div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  </div>
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="keyword">const</span> RoutingModel& routing_model_;</div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  std::vector<int> start_to_vehicle_;</div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="comment">// The following vector is used to keep track of the type counts for hard</span></div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="comment">// incompatibilities.</span></div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  std::vector<std::vector<int>> hard_incompatibility_type_counts_per_vehicle_;</div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="comment">// Used to verify the temporal incompatibilities and requirements.</span></div>
|
|
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  TypeIncompatibilityChecker temporal_incompatibility_checker_;</div>
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  TypeRequirementChecker requirement_checker_;</div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span> };</div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  </div>
|
|
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span> TypeRegulationsFilter::TypeRegulationsFilter(<span class="keyword">const</span> RoutingModel& <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)</div>
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  : BasePathFilter(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.Nexts(), <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.Size() + <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.vehicles()),</div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  routing_model_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>),</div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  start_to_vehicle_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.Size(), -1),</div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  temporal_incompatibility_checker_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div>
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="comment">/*check_hard_incompatibilities*/</span> false),</div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  requirement_checker_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vehicles = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.vehicles();</div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> has_hard_type_incompatibilities =</div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.HasHardTypeIncompatibilities();</div>
|
|
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <span class="keywordflow">if</span> (has_hard_type_incompatibilities) {</div>
|
|
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  hard_incompatibility_type_counts_per_vehicle_.resize(num_vehicles);</div>
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  }</div>
|
|
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_visit_types = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.GetNumberOfVisitTypes();</div>
|
|
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < num_vehicles; vehicle++) {</div>
|
|
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> start = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.Start(vehicle);</div>
|
|
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  start_to_vehicle_[start] = vehicle;</div>
|
|
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  <span class="keywordflow">if</span> (has_hard_type_incompatibilities) {</div>
|
|
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  hard_incompatibility_type_counts_per_vehicle_[vehicle].resize(</div>
|
|
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  num_visit_types, 0);</div>
|
|
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  }</div>
|
|
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  }</div>
|
|
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span> }</div>
|
|
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  </div>
|
|
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span> <span class="keywordtype">void</span> TypeRegulationsFilter::OnSynchronizePathFromStart(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> start) {</div>
|
|
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="keywordflow">if</span> (!routing_model_.HasHardTypeIncompatibilities()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  </div>
|
|
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = start_to_vehicle_[start];</div>
|
|
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(vehicle, 0);</div>
|
|
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  std::vector<int>& type_counts =</div>
|
|
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  hard_incompatibility_type_counts_per_vehicle_[vehicle];</div>
|
|
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  std::fill(type_counts.begin(), type_counts.end(), 0);</div>
|
|
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_types = type_counts.size();</div>
|
|
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  </div>
|
|
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = start;</div>
|
|
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="keywordflow">while</span> (node < Size()) {</div>
|
|
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsVarSynced(node));</div>
|
|
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> type = routing_model_.GetVisitType(node);</div>
|
|
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  <span class="keywordflow">if</span> (type >= 0 && routing_model_.GetVisitTypePolicy(node) !=</div>
|
|
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  RoutingModel::ADDED_TYPE_REMOVED_FROM_VEHICLE) {</div>
|
|
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(type, num_types);</div>
|
|
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  type_counts[type]++;</div>
|
|
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  }</div>
|
|
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  node = <a class="code" href="namespaceoperations__research_1_1sat.html#a3f1a1b8a7a1a488e263a2e74f45d2a59">Value</a>(node);</div>
|
|
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  }</div>
|
|
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span> }</div>
|
|
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  </div>
|
|
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span> <span class="keywordtype">bool</span> TypeRegulationsFilter::HardIncompatibilitiesRespected(<span class="keywordtype">int</span> vehicle,</div>
|
|
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_start,</div>
|
|
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_end) {</div>
|
|
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="keywordflow">if</span> (!routing_model_.HasHardTypeIncompatibilities()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  </div>
|
|
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  <span class="keyword">const</span> std::vector<int>& previous_type_counts =</div>
|
|
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  hard_incompatibility_type_counts_per_vehicle_[vehicle];</div>
|
|
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  </div>
|
|
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  absl::flat_hash_map<<span class="comment">/*type*/</span> int, <span class="comment">/*new_count*/</span> <span class="keywordtype">int</span>> new_type_counts;</div>
|
|
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  absl::flat_hash_set<int> types_to_check;</div>
|
|
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  </div>
|
|
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="comment">// Go through the new nodes on the path and increment their type counts.</span></div>
|
|
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = GetNext(chain_start);</div>
|
|
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="keywordflow">while</span> (node != chain_end) {</div>
|
|
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> type = routing_model_.GetVisitType(node);</div>
|
|
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="keywordflow">if</span> (type >= 0 && routing_model_.GetVisitTypePolicy(node) !=</div>
|
|
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  RoutingModel::ADDED_TYPE_REMOVED_FROM_VEHICLE) {</div>
|
|
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(type, previous_type_counts.size());</div>
|
|
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  <span class="keywordtype">int</span>& type_count = <a class="code" href="namespacegtl.html#a7a0f8dc4187504b814d8a8be463b517c">gtl::LookupOrInsert</a>(&new_type_counts, type,</div>
|
|
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  previous_type_counts[type]);</div>
|
|
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  <span class="keywordflow">if</span> (type_count++ == 0) {</div>
|
|
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <span class="comment">// New type on the route, mark to check its incompatibilities.</span></div>
|
|
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  types_to_check.insert(type);</div>
|
|
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  }</div>
|
|
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  }</div>
|
|
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  node = GetNext(node);</div>
|
|
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  }</div>
|
|
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  </div>
|
|
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="comment">// Update new_type_counts by decrementing the occurrence of the types of the</span></div>
|
|
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  <span class="comment">// nodes no longer on the route.</span></div>
|
|
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  node = <a class="code" href="namespaceoperations__research_1_1sat.html#a3f1a1b8a7a1a488e263a2e74f45d2a59">Value</a>(chain_start);</div>
|
|
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  <span class="keywordflow">while</span> (node != chain_end) {</div>
|
|
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> type = routing_model_.GetVisitType(node);</div>
|
|
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  <span class="keywordflow">if</span> (type >= 0 && routing_model_.GetVisitTypePolicy(node) !=</div>
|
|
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  RoutingModel::ADDED_TYPE_REMOVED_FROM_VEHICLE) {</div>
|
|
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(type, previous_type_counts.size());</div>
|
|
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <span class="keywordtype">int</span>& type_count = <a class="code" href="namespacegtl.html#a7a0f8dc4187504b814d8a8be463b517c">gtl::LookupOrInsert</a>(&new_type_counts, type,</div>
|
|
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  previous_type_counts[type]);</div>
|
|
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(type_count, 1);</div>
|
|
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  type_count--;</div>
|
|
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  }</div>
|
|
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  node = <a class="code" href="namespaceoperations__research_1_1sat.html#a3f1a1b8a7a1a488e263a2e74f45d2a59">Value</a>(node);</div>
|
|
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  }</div>
|
|
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  </div>
|
|
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="comment">// Check the incompatibilities for types in types_to_check.</span></div>
|
|
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> type : types_to_check) {</div>
|
|
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> incompatible_type :</div>
|
|
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  routing_model_.GetHardTypeIncompatibilitiesOfType(type)) {</div>
|
|
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <span class="keywordflow">if</span> (<a class="code" href="namespacegtl.html#abc18f60961e36340e64e428827c0e38e">gtl::FindWithDefault</a>(new_type_counts, incompatible_type,</div>
|
|
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  previous_type_counts[incompatible_type]) > 0) {</div>
|
|
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  }</div>
|
|
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  }</div>
|
|
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  }</div>
|
|
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span> }</div>
|
|
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  </div>
|
|
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span> <span class="keywordtype">bool</span> TypeRegulationsFilter::AcceptPath(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_start, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_start,</div>
|
|
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_end) {</div>
|
|
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = start_to_vehicle_[path_start];</div>
|
|
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(vehicle, 0);</div>
|
|
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <span class="keyword">const</span> <span class="keyword">auto</span> next_accessor = [<span class="keyword">this</span>](<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node) { <span class="keywordflow">return</span> GetNext(node); };</div>
|
|
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="keywordflow">return</span> HardIncompatibilitiesRespected(vehicle, chain_start, chain_end) &&</div>
|
|
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  temporal_incompatibility_checker_.CheckVehicle(vehicle,</div>
|
|
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  next_accessor) &&</div>
|
|
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  requirement_checker_.CheckVehicle(vehicle, next_accessor);</div>
|
|
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span> }</div>
|
|
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  </div>
|
|
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  </div>
|
|
<div class="line"><a name="l00818"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ada7da4059546f5ef90de0b2f8bada19a"> 818</a></span> <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html">IntVarLocalSearchFilter</a>* <a class="code" href="namespaceoperations__research.html#ada7da4059546f5ef90de0b2f8bada19a">MakeTypeRegulationsFilter</a>(</div>
|
|
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>& routing_model) {</div>
|
|
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  <span class="keywordflow">return</span> routing_model.<a class="code" href="classoperations__research_1_1_routing_model.html#a5f32c22c620c811754ba7b6f977db864">solver</a>()-><a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(</div>
|
|
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  <span class="keyword">new</span> TypeRegulationsFilter(routing_model));</div>
|
|
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span> }</div>
|
|
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  </div>
|
|
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  </div>
|
|
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span> <span class="comment">// ChainCumul filter. Version of dimension path filter which is O(delta) rather</span></div>
|
|
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span> <span class="comment">// than O(length of touched paths). Currently only supports dimensions without</span></div>
|
|
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span> <span class="comment">// costs (global and local span cost, soft bounds) and with unconstrained</span></div>
|
|
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span> <span class="comment">// cumul variables except overall capacity and cumul variables of path ends.</span></div>
|
|
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  </div>
|
|
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span> <span class="keyword">class </span>ChainCumulFilter : <span class="keyword">public</span> BasePathFilter {</div>
|
|
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  ChainCumulFilter(<span class="keyword">const</span> RoutingModel& routing_model,</div>
|
|
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="keyword">const</span> RoutingDimension& dimension);</div>
|
|
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  ~ChainCumulFilter()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  <span class="keywordflow">return</span> <span class="stringliteral">"ChainCumulFilter("</span> + name_ + <span class="stringliteral">")"</span>;</div>
|
|
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  }</div>
|
|
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  </div>
|
|
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  <span class="keywordtype">void</span> OnSynchronizePathFromStart(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> start) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="keywordtype">bool</span> AcceptPath(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_start, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_start,</div>
|
|
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_end) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  </div>
|
|
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  <span class="keyword">const</span> std::vector<IntVar*> <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>;</div>
|
|
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  std::vector<int64> start_to_vehicle_;</div>
|
|
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  std::vector<int64> start_to_end_;</div>
|
|
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  std::vector<const RoutingModel::TransitCallback2*> evaluators_;</div>
|
|
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="keyword">const</span> std::vector<int64> vehicle_capacities_;</div>
|
|
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  std::vector<int64> current_path_cumul_mins_;</div>
|
|
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  std::vector<int64> current_max_of_path_end_cumul_mins_;</div>
|
|
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  std::vector<int64> old_nexts_;</div>
|
|
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  std::vector<int> old_vehicles_;</div>
|
|
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  std::vector<int64> current_transits_;</div>
|
|
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  <span class="keyword">const</span> std::string name_;</div>
|
|
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span> };</div>
|
|
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  </div>
|
|
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span> ChainCumulFilter::ChainCumulFilter(<span class="keyword">const</span> RoutingModel& routing_model,</div>
|
|
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <span class="keyword">const</span> RoutingDimension& dimension)</div>
|
|
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  : BasePathFilter(routing_model.Nexts(), dimension.cumuls().size()),</div>
|
|
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>(dimension.cumuls()),</div>
|
|
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  evaluators_(routing_model.vehicles(), nullptr),</div>
|
|
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  vehicle_capacities_(dimension.vehicle_capacities()),</div>
|
|
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  current_path_cumul_mins_(dimension.cumuls().size(), 0),</div>
|
|
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  current_max_of_path_end_cumul_mins_(dimension.cumuls().size(), 0),</div>
|
|
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  old_nexts_(routing_model.Size(), <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a>),</div>
|
|
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  old_vehicles_(routing_model.Size(), <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a>),</div>
|
|
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  current_transits_(routing_model.Size(), 0),</div>
|
|
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  name_(dimension.<a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>()) {</div>
|
|
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  start_to_vehicle_.resize(Size(), -1);</div>
|
|
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  start_to_end_.resize(Size(), -1);</div>
|
|
<div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < routing_model.vehicles(); ++i) {</div>
|
|
<div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  start_to_vehicle_[routing_model.Start(i)] = i;</div>
|
|
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  start_to_end_[routing_model.Start(i)] = routing_model.End(i);</div>
|
|
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  evaluators_[i] = &dimension.transit_evaluator(i);</div>
|
|
<div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  }</div>
|
|
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span> }</div>
|
|
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  </div>
|
|
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span> <span class="comment">// On synchronization, maintain "propagated" cumul mins and max level of cumul</span></div>
|
|
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span> <span class="comment">// from each node to the end of the path; to be used by AcceptPath to</span></div>
|
|
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span> <span class="comment">// incrementally check feasibility.</span></div>
|
|
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span> <span class="keywordtype">void</span> ChainCumulFilter::OnSynchronizePathFromStart(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> start) {</div>
|
|
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = start_to_vehicle_[start];</div>
|
|
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  std::vector<int64> path_nodes;</div>
|
|
<div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = start;</div>
|
|
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[node]->Min();</div>
|
|
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  <span class="keywordflow">while</span> (node < Size()) {</div>
|
|
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  path_nodes.push_back(node);</div>
|
|
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  current_path_cumul_mins_[node] = cumul;</div>
|
|
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#a3f1a1b8a7a1a488e263a2e74f45d2a59">Value</a>(node);</div>
|
|
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> != old_nexts_[node] || vehicle != old_vehicles_[node]) {</div>
|
|
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  old_nexts_[node] = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  old_vehicles_[node] = vehicle;</div>
|
|
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  current_transits_[node] = (*evaluators_[vehicle])(node, <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  }</div>
|
|
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  cumul = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(cumul, current_transits_[node]);</div>
|
|
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  cumul = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(<a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>]->Min(), cumul);</div>
|
|
<div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  node = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  }</div>
|
|
<div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  path_nodes.push_back(node);</div>
|
|
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  current_path_cumul_mins_[node] = cumul;</div>
|
|
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> max_cumuls = cumul;</div>
|
|
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = path_nodes.size() - 1; i >= 0; --i) {</div>
|
|
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = path_nodes[i];</div>
|
|
<div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  max_cumuls = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(max_cumuls, current_path_cumul_mins_[node]);</div>
|
|
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  current_max_of_path_end_cumul_mins_[node] = max_cumuls;</div>
|
|
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  }</div>
|
|
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span> }</div>
|
|
<div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  </div>
|
|
<div class="line"><a name="l00910"></a><span class="lineno"> 910</span> <span class="comment">// The complexity of the method is O(size of chain (chain_start...chain_end).</span></div>
|
|
<div class="line"><a name="l00911"></a><span class="lineno"> 911</span> <span class="keywordtype">bool</span> ChainCumulFilter::AcceptPath(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_start, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_start,</div>
|
|
<div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_end) {</div>
|
|
<div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = start_to_vehicle_[path_start];</div>
|
|
<div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a> = vehicle_capacities_[vehicle];</div>
|
|
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = chain_start;</div>
|
|
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul = current_path_cumul_mins_[node];</div>
|
|
<div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  <span class="keywordflow">while</span> (node != chain_end) {</div>
|
|
<div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = GetNext(node);</div>
|
|
<div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  <span class="keywordflow">if</span> (IsVarSynced(node) && <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> == <a class="code" href="namespaceoperations__research_1_1sat.html#a3f1a1b8a7a1a488e263a2e74f45d2a59">Value</a>(node) &&</div>
|
|
<div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  vehicle == old_vehicles_[node]) {</div>
|
|
<div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  cumul = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(cumul, current_transits_[node]);</div>
|
|
<div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  cumul = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(cumul, (*evaluators_[vehicle])(node, <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>));</div>
|
|
<div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  }</div>
|
|
<div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  cumul = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(<a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>]->Min(), cumul);</div>
|
|
<div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  <span class="keywordflow">if</span> (cumul > <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  node = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  }</div>
|
|
<div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> end = start_to_end_[path_start];</div>
|
|
<div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> end_cumul_delta =</div>
|
|
<div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(current_path_cumul_mins_[end], current_path_cumul_mins_[node]);</div>
|
|
<div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> after_chain_cumul_delta =</div>
|
|
<div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(current_max_of_path_end_cumul_mins_[node],</div>
|
|
<div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  current_path_cumul_mins_[node]);</div>
|
|
<div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(cumul, after_chain_cumul_delta) <= <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a> &&</div>
|
|
<div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(cumul, end_cumul_delta) <= <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[end]->Max();</div>
|
|
<div class="line"><a name="l00937"></a><span class="lineno"> 937</span> }</div>
|
|
<div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  </div>
|
|
<div class="line"><a name="l00939"></a><span class="lineno"> 939</span> <span class="comment">// PathCumul filter.</span></div>
|
|
<div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  </div>
|
|
<div class="line"><a name="l00941"></a><span class="lineno"> 941</span> <span class="keyword">class </span>PathCumulFilter : <span class="keyword">public</span> BasePathFilter {</div>
|
|
<div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  PathCumulFilter(<span class="keyword">const</span> RoutingModel& routing_model,</div>
|
|
<div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  <span class="keyword">const</span> RoutingDimension& dimension,</div>
|
|
<div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <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="l00946"></a><span class="lineno"> 946</span>  <span class="keywordtype">bool</span> propagate_own_objective_value,</div>
|
|
<div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  <span class="keywordtype">bool</span> filter_objective_cost, <span class="keywordtype">bool</span> can_use_lp);</div>
|
|
<div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  ~PathCumulFilter()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  <span class="keywordflow">return</span> <span class="stringliteral">"PathCumulFilter("</span> + name_ + <span class="stringliteral">")"</span>;</div>
|
|
<div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  }</div>
|
|
<div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> GetSynchronizedObjectiveValue()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  <span class="keywordflow">return</span> propagate_own_objective_value_ ? synchronized_objective_value_ : 0;</div>
|
|
<div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  }</div>
|
|
<div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> GetAcceptedObjectiveValue()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  <span class="keywordflow">return</span> propagate_own_objective_value_ ? accepted_objective_value_ : 0;</div>
|
|
<div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  }</div>
|
|
<div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  </div>
|
|
<div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  <span class="comment">// This structure stores the "best" path cumul value for a solution, the path</span></div>
|
|
<div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  <span class="comment">// supporting this value, and the corresponding path cumul values for all</span></div>
|
|
<div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  <span class="comment">// paths.</span></div>
|
|
<div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  <span class="keyword">struct </span>SupportedPathCumul {</div>
|
|
<div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  SupportedPathCumul() : <a class="code" href="routing__search_8cc.html#a437b1dcf96372e200f82e9f039054290">cumul_value</a>(0), <a class="code" href="routing__search_8cc.html#a08c9dc4849de8d21da6a13824e98fcdc">cumul_value_support</a>(0) {}</div>
|
|
<div class="line"><a name="l00965"></a><span class="lineno"><a class="line" href="routing__search_8cc.html#a437b1dcf96372e200f82e9f039054290"> 965</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__search_8cc.html#a437b1dcf96372e200f82e9f039054290">cumul_value</a>;</div>
|
|
<div class="line"><a name="l00966"></a><span class="lineno"><a class="line" href="routing__search_8cc.html#a08c9dc4849de8d21da6a13824e98fcdc"> 966</a></span>  <span class="keywordtype">int</span> <a class="code" href="routing__search_8cc.html#a08c9dc4849de8d21da6a13824e98fcdc">cumul_value_support</a>;</div>
|
|
<div class="line"><a name="l00967"></a><span class="lineno"><a class="line" href="routing__search_8cc.html#a1743d739ea2e9ff0e1362984ae1fb586"> 967</a></span>  std::vector<int64> <a class="code" href="routing__search_8cc.html#a1743d739ea2e9ff0e1362984ae1fb586">path_values</a>;</div>
|
|
<div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  };</div>
|
|
<div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  </div>
|
|
<div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  <span class="keyword">struct </span>SoftBound {</div>
|
|
<div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  SoftBound() : <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a>(-1), <a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a>(0) {}</div>
|
|
<div class="line"><a name="l00972"></a><span class="lineno"><a class="line" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8"> 972</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a>;</div>
|
|
<div class="line"><a name="l00973"></a><span class="lineno"><a class="line" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb"> 973</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a>;</div>
|
|
<div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  };</div>
|
|
<div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  </div>
|
|
<div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  <span class="comment">// This class caches transit values between nodes of paths. Transit and path</span></div>
|
|
<div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  <span class="comment">// nodes are to be added in the order in which they appear on a path.</span></div>
|
|
<div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  <span class="keyword">class </span>PathTransits {</div>
|
|
<div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  <span class="keywordtype">void</span> Clear() {</div>
|
|
<div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  paths_.clear();</div>
|
|
<div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  transits_.clear();</div>
|
|
<div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  }</div>
|
|
<div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  <span class="keywordtype">void</span> ClearPath(<span class="keywordtype">int</span> path) {</div>
|
|
<div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  paths_[path].clear();</div>
|
|
<div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  transits_[path].clear();</div>
|
|
<div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  }</div>
|
|
<div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  <span class="keywordtype">int</span> AddPaths(<span class="keywordtype">int</span> num_paths) {</div>
|
|
<div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> first_path = paths_.size();</div>
|
|
<div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  paths_.resize(first_path + num_paths);</div>
|
|
<div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  transits_.resize(first_path + num_paths);</div>
|
|
<div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  <span class="keywordflow">return</span> first_path;</div>
|
|
<div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  }</div>
|
|
<div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  <span class="keywordtype">void</span> ReserveTransits(<span class="keywordtype">int</span> path, <span class="keywordtype">int</span> number_of_route_arcs) {</div>
|
|
<div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  transits_[path].reserve(number_of_route_arcs);</div>
|
|
<div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  paths_[path].reserve(number_of_route_arcs + 1);</div>
|
|
<div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  }</div>
|
|
<div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  <span class="comment">// Stores the transit between node and next on path. For a given non-empty</span></div>
|
|
<div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  <span class="comment">// path, node must correspond to next in the previous call to PushTransit.</span></div>
|
|
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  <span class="keywordtype">void</span> PushTransit(<span class="keywordtype">int</span> path, <span class="keywordtype">int</span> node, <span class="keywordtype">int</span> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> transit) {</div>
|
|
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  transits_[path].push_back(transit);</div>
|
|
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  <span class="keywordflow">if</span> (paths_[path].empty()) {</div>
|
|
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  paths_[path].push_back(node);</div>
|
|
<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  }</div>
|
|
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(paths_[path].back(), node);</div>
|
|
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  paths_[path].push_back(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  }</div>
|
|
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  <span class="keywordtype">int</span> NumPaths()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> paths_.size(); }</div>
|
|
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  <span class="keywordtype">int</span> PathSize(<span class="keywordtype">int</span> path)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> paths_[path].size(); }</div>
|
|
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  <span class="keywordtype">int</span> Node(<span class="keywordtype">int</span> path, <span class="keywordtype">int</span> position)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> paths_[path][position]; }</div>
|
|
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> Transit(<span class="keywordtype">int</span> path, <span class="keywordtype">int</span> position)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  <span class="keywordflow">return</span> transits_[path][position];</div>
|
|
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  }</div>
|
|
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  </div>
|
|
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  <span class="comment">// paths_[r][i] is the ith node on path r.</span></div>
|
|
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  std::vector<std::vector<int64>> paths_;</div>
|
|
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  <span class="comment">// transits_[r][i] is the transit value between nodes path_[i] and</span></div>
|
|
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  <span class="comment">// path_[i+1] on path r.</span></div>
|
|
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  std::vector<std::vector<int64>> transits_;</div>
|
|
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  };</div>
|
|
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  </div>
|
|
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  <span class="keywordtype">void</span> InitializeAcceptPath()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  cumul_cost_delta_ = total_current_cumul_cost_value_;</div>
|
|
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  node_with_precedence_to_delta_min_max_cumuls_.clear();</div>
|
|
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  <span class="comment">// Cleaning up for the new delta.</span></div>
|
|
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  delta_max_end_cumul_ = <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>;</div>
|
|
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  delta_paths_.clear();</div>
|
|
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  delta_path_transits_.Clear();</div>
|
|
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  lns_detected_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  delta_nodes_with_precedences_and_changed_cumul_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#aa7d76b766faf39c1652b6617eac5fe20">ClearAll</a>();</div>
|
|
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  }</div>
|
|
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  <span class="keywordtype">bool</span> AcceptPath(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_start, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_start,</div>
|
|
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_end) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  <span class="keywordtype">bool</span> FinalizeAcceptPath(<span class="keyword">const</span> Assignment* <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_min,</div>
|
|
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_max) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  <span class="keywordtype">void</span> OnBeforeSynchronizePaths() <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  </div>
|
|
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  <span class="keywordtype">bool</span> FilterSpanCost()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> global_span_cost_coefficient_ != 0; }</div>
|
|
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  </div>
|
|
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  <span class="keywordtype">bool</span> FilterSlackCost()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  <span class="keywordflow">return</span> has_nonzero_vehicle_span_cost_coefficients_ ||</div>
|
|
<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  has_vehicle_span_upper_bounds_;</div>
|
|
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  }</div>
|
|
<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  </div>
|
|
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  <span class="keywordtype">bool</span> FilterBreakCost(<span class="keywordtype">int</span> vehicle)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  <span class="keywordflow">return</span> dimension_.HasBreakConstraints() &&</div>
|
|
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  !dimension_.GetBreakIntervalsOfVehicle(vehicle).empty();</div>
|
|
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  }</div>
|
|
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  </div>
|
|
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  <span class="keywordtype">bool</span> FilterCumulSoftBounds()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> !cumul_soft_bounds_.empty(); }</div>
|
|
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  </div>
|
|
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> GetCumulSoftCost(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__search_8cc.html#a437b1dcf96372e200f82e9f039054290">cumul_value</a>) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  </div>
|
|
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  <span class="keywordtype">bool</span> FilterCumulPiecewiseLinearCosts()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  <span class="keywordflow">return</span> !cumul_piecewise_linear_costs_.empty();</div>
|
|
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  }</div>
|
|
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  </div>
|
|
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  <span class="keywordtype">bool</span> FilterWithDimensionCumulOptimizerForVehicle(<span class="keywordtype">int</span> vehicle)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  <span class="keywordflow">if</span> (!can_use_lp_ || FilterCumulPiecewiseLinearCosts()) {</div>
|
|
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  }</div>
|
|
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  </div>
|
|
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  <span class="keywordtype">int</span> num_linear_constraints = 0;</div>
|
|
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  <span class="keywordflow">if</span> (dimension_.GetSpanCostCoefficientForVehicle(vehicle) > 0)</div>
|
|
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  ++num_linear_constraints;</div>
|
|
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  <span class="keywordflow">if</span> (FilterSoftSpanCost(vehicle)) ++num_linear_constraints;</div>
|
|
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  <span class="keywordflow">if</span> (FilterCumulSoftLowerBounds()) ++num_linear_constraints;</div>
|
|
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  <span class="keywordflow">if</span> (FilterCumulSoftBounds()) ++num_linear_constraints;</div>
|
|
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  <span class="keywordflow">if</span> (vehicle_span_upper_bounds_[vehicle] < <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>)</div>
|
|
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  ++num_linear_constraints;</div>
|
|
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> has_breaks = FilterBreakCost(vehicle);</div>
|
|
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  <span class="keywordflow">if</span> (has_breaks) ++num_linear_constraints;</div>
|
|
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  </div>
|
|
<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  <span class="comment">// The DimensionCumulOptimizer is used to compute a more precise value of</span></div>
|
|
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  <span class="comment">// the cost related to the cumul values (soft bounds and span costs).</span></div>
|
|
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  <span class="comment">// It is also used to garantee feasibility with complex mixes of constraints</span></div>
|
|
<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  <span class="comment">// and in particular in the presence of break requests along other</span></div>
|
|
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  <span class="comment">// constraints.</span></div>
|
|
<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  <span class="comment">// Therefore, without breaks, we only use the optimizer when the costs are</span></div>
|
|
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  <span class="comment">// actually used to filter the solutions, i.e. when filter_objective_cost_</span></div>
|
|
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  <span class="comment">// is true.</span></div>
|
|
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  <span class="keywordflow">return</span> num_linear_constraints >= 2 &&</div>
|
|
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  (has_breaks || filter_objective_cost_);</div>
|
|
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  }</div>
|
|
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  </div>
|
|
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  <span class="keywordtype">bool</span> FilterDimensionForbiddenIntervals()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> SortedDisjointIntervalList& intervals :</div>
|
|
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  dimension_.forbidden_intervals()) {</div>
|
|
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  <span class="comment">// TODO(user): Change the following test to check intervals within</span></div>
|
|
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  <span class="comment">// the domain of the corresponding variables.</span></div>
|
|
<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  <span class="keywordflow">if</span> (intervals.NumIntervals() > 0) {</div>
|
|
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  }</div>
|
|
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  }</div>
|
|
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  }</div>
|
|
<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  </div>
|
|
<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> GetCumulPiecewiseLinearCost(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__search_8cc.html#a437b1dcf96372e200f82e9f039054290">cumul_value</a>) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  </div>
|
|
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <span class="keywordtype">bool</span> FilterCumulSoftLowerBounds()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  <span class="keywordflow">return</span> !cumul_soft_lower_bounds_.empty();</div>
|
|
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  }</div>
|
|
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  </div>
|
|
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  <span class="keywordtype">bool</span> FilterPrecedences()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> !node_index_to_precedences_.empty(); }</div>
|
|
<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  </div>
|
|
<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  <span class="keywordtype">bool</span> FilterSoftSpanCost()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  <span class="keywordflow">return</span> dimension_.HasSoftSpanUpperBounds();</div>
|
|
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  }</div>
|
|
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  <span class="keywordtype">bool</span> FilterSoftSpanCost(<span class="keywordtype">int</span> vehicle)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  <span class="keywordflow">return</span> dimension_.HasSoftSpanUpperBounds() &&</div>
|
|
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  dimension_.GetSoftSpanUpperBoundForVehicle(vehicle).cost > 0;</div>
|
|
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  }</div>
|
|
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  <span class="keywordtype">bool</span> FilterSoftSpanQuadraticCost()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  <span class="keywordflow">return</span> dimension_.HasQuadraticCostSoftSpanUpperBounds();</div>
|
|
<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  }</div>
|
|
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  <span class="keywordtype">bool</span> FilterSoftSpanQuadraticCost(<span class="keywordtype">int</span> vehicle)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  <span class="keywordflow">return</span> dimension_.HasQuadraticCostSoftSpanUpperBounds() &&</div>
|
|
<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  dimension_.GetQuadraticCostSoftSpanUpperBoundForVehicle(vehicle)</div>
|
|
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  .cost > 0;</div>
|
|
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  }</div>
|
|
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  </div>
|
|
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> GetCumulSoftLowerBoundCost(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__search_8cc.html#a437b1dcf96372e200f82e9f039054290">cumul_value</a>) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  </div>
|
|
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> GetPathCumulSoftLowerBoundCost(<span class="keyword">const</span> PathTransits& path_transits,</div>
|
|
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  <span class="keywordtype">int</span> path) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  </div>
|
|
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  <span class="keywordtype">void</span> InitializeSupportedPathCumul(SupportedPathCumul* supported_cumul,</div>
|
|
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> default_value);</div>
|
|
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  </div>
|
|
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  <span class="comment">// Given the vector of minimum cumuls on the path, determines if the pickup to</span></div>
|
|
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  <span class="comment">// delivery limits for this dimension (if there are any) can be respected by</span></div>
|
|
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  <span class="comment">// this path.</span></div>
|
|
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  <span class="comment">// Returns true if for every pickup/delivery nodes visited on this path,</span></div>
|
|
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  <span class="comment">// min_cumul_value(delivery) - max_cumul_value(pickup) is less than the limit</span></div>
|
|
<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  <span class="comment">// set for this pickup to delivery.</span></div>
|
|
<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  <span class="comment">// TODO(user): Verify if we should filter the pickup/delivery limits using</span></div>
|
|
<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  <span class="comment">// the LP, for a perfect filtering.</span></div>
|
|
<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  <span class="keywordtype">bool</span> PickupToDeliveryLimitsRespected(</div>
|
|
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  <span class="keyword">const</span> PathTransits& path_transits, <span class="keywordtype">int</span> path,</div>
|
|
<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  <span class="keyword">const</span> std::vector<int64>& min_path_cumuls) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  </div>
|
|
<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  <span class="comment">// Computes the maximum cumul value of nodes along the path using</span></div>
|
|
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  <span class="comment">// [current|delta]_path_transits_, and stores the min/max cumul</span></div>
|
|
<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  <span class="comment">// related to each node in the corresponding vector</span></div>
|
|
<div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  <span class="comment">// [current|delta]_[min|max]_node_cumuls_.</span></div>
|
|
<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  <span class="comment">// The boolean is_delta indicates if the computations should take place on the</span></div>
|
|
<div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  <span class="comment">// "delta" or "current" members. When true, the nodes for which the min/max</span></div>
|
|
<div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  <span class="comment">// cumul has changed from the current value are marked in</span></div>
|
|
<div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  <span class="comment">// delta_nodes_with_precedences_and_changed_cumul_.</span></div>
|
|
<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  <span class="keywordtype">void</span> StoreMinMaxCumulOfNodesOnPath(<span class="keywordtype">int</span> path,</div>
|
|
<div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  <span class="keyword">const</span> std::vector<int64>& min_path_cumuls,</div>
|
|
<div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  <span class="keywordtype">bool</span> is_delta);</div>
|
|
<div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  </div>
|
|
<div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  <span class="comment">// Compute the max start cumul value for a given path and a given minimal end</span></div>
|
|
<div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  <span class="comment">// cumul value.</span></div>
|
|
<div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  <span class="comment">// NOTE: Since this function is used to compute a lower bound on the span of</span></div>
|
|
<div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  <span class="comment">// the routes, we don't "jump" over the forbidden intervals with this min end</span></div>
|
|
<div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  <span class="comment">// cumul value. We do however concurrently compute the max possible start</span></div>
|
|
<div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  <span class="comment">// given the max end cumul, for which we can "jump" over forbidden intervals,</span></div>
|
|
<div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  <span class="comment">// and return the minimum of the two.</span></div>
|
|
<div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> ComputePathMaxStartFromEndCumul(<span class="keyword">const</span> PathTransits& path_transits,</div>
|
|
<div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  <span class="keywordtype">int</span> path, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_start,</div>
|
|
<div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> min_end_cumul) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  </div>
|
|
<div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  <span class="keyword">const</span> RoutingModel& routing_model_;</div>
|
|
<div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  <span class="keyword">const</span> RoutingDimension& dimension_;</div>
|
|
<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  <span class="keyword">const</span> std::vector<IntVar*> <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>;</div>
|
|
<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  <span class="keyword">const</span> std::vector<IntVar*> slacks_;</div>
|
|
<div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  std::vector<int64> start_to_vehicle_;</div>
|
|
<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  std::vector<const RoutingModel::TransitCallback2*> evaluators_;</div>
|
|
<div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  std::vector<int64> vehicle_span_upper_bounds_;</div>
|
|
<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  <span class="keywordtype">bool</span> has_vehicle_span_upper_bounds_;</div>
|
|
<div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> total_current_cumul_cost_value_;</div>
|
|
<div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> synchronized_objective_value_;</div>
|
|
<div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> accepted_objective_value_;</div>
|
|
<div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  <span class="comment">// Map between paths and path soft cumul bound costs. The paths are indexed</span></div>
|
|
<div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  <span class="comment">// by the index of the start node of the path.</span></div>
|
|
<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  absl::flat_hash_map<int64, int64> current_cumul_cost_values_;</div>
|
|
<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_cost_delta_;</div>
|
|
<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  <span class="comment">// Cumul cost values for paths in delta, indexed by vehicle.</span></div>
|
|
<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  std::vector<int64> delta_path_cumul_cost_values_;</div>
|
|
<div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> global_span_cost_coefficient_;</div>
|
|
<div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  std::vector<SoftBound> cumul_soft_bounds_;</div>
|
|
<div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  std::vector<SoftBound> cumul_soft_lower_bounds_;</div>
|
|
<div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  std::vector<const PiecewiseLinearFunction*> cumul_piecewise_linear_costs_;</div>
|
|
<div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  std::vector<int64> vehicle_span_cost_coefficients_;</div>
|
|
<div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  <span class="keywordtype">bool</span> has_nonzero_vehicle_span_cost_coefficients_;</div>
|
|
<div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  <span class="keyword">const</span> std::vector<int64> vehicle_capacities_;</div>
|
|
<div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  <span class="comment">// node_index_to_precedences_[node_index] contains all NodePrecedence elements</span></div>
|
|
<div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  <span class="comment">// with node_index as either "first_node" or "second_node".</span></div>
|
|
<div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  <span class="comment">// This vector is empty if there are no precedences on the dimension_.</span></div>
|
|
<div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  std::vector<std::vector<RoutingDimension::NodePrecedence>></div>
|
|
<div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  node_index_to_precedences_;</div>
|
|
<div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  <span class="comment">// Data reflecting information on paths and cumul variables for the solution</span></div>
|
|
<div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  <span class="comment">// to which the filter was synchronized.</span></div>
|
|
<div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  SupportedPathCumul current_min_start_;</div>
|
|
<div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  SupportedPathCumul current_max_end_;</div>
|
|
<div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  PathTransits current_path_transits_;</div>
|
|
<div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  <span class="comment">// Current min/max cumul values, indexed by node.</span></div>
|
|
<div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  std::vector<std::pair<int64, int64>> current_min_max_node_cumuls_;</div>
|
|
<div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  <span class="comment">// Data reflecting information on paths and cumul variables for the "delta"</span></div>
|
|
<div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  <span class="comment">// solution (aka neighbor solution) being examined.</span></div>
|
|
<div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  PathTransits delta_path_transits_;</div>
|
|
<div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delta_max_end_cumul_;</div>
|
|
<div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  SparseBitset<int64> delta_nodes_with_precedences_and_changed_cumul_;</div>
|
|
<div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  absl::flat_hash_map<int64, std::pair<int64, int64>></div>
|
|
<div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  node_with_precedence_to_delta_min_max_cumuls_;</div>
|
|
<div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  <span class="comment">// Note: small_ordered_set only support non-hash sets.</span></div>
|
|
<div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  <a class="code" href="classgtl_1_1small__ordered__set.html">gtl::small_ordered_set<std::set<int></a>> delta_paths_;</div>
|
|
<div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  <span class="keyword">const</span> std::string name_;</div>
|
|
<div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  </div>
|
|
<div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  LocalDimensionCumulOptimizer* optimizer_;</div>
|
|
<div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  std::unique_ptr<LocalDimensionCumulOptimizer> internal_optimizer_;</div>
|
|
<div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  LocalDimensionCumulOptimizer* mp_optimizer_;</div>
|
|
<div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  std::unique_ptr<LocalDimensionCumulOptimizer> internal_mp_optimizer_;</div>
|
|
<div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> filter_objective_cost_;</div>
|
|
<div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  <span class="comment">// This boolean indicates if the LP optimizer can be used if necessary to</span></div>
|
|
<div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  <span class="comment">// optimize the dimension cumuls, and is only used for testing purposes.</span></div>
|
|
<div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> can_use_lp_;</div>
|
|
<div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> propagate_own_objective_value_;</div>
|
|
<div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  </div>
|
|
<div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  <span class="comment">// Used to do span lower bounding in presence of vehicle breaks.</span></div>
|
|
<div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  DisjunctivePropagator disjunctive_propagator_;</div>
|
|
<div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  DisjunctivePropagator::Tasks tasks_;</div>
|
|
<div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>  TravelBounds travel_bounds_;</div>
|
|
<div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  std::vector<int64> current_path_;</div>
|
|
<div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  </div>
|
|
<div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  <span class="keywordtype">bool</span> lns_detected_;</div>
|
|
<div class="line"><a name="l01230"></a><span class="lineno"> 1230</span> };</div>
|
|
<div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  </div>
|
|
<div class="line"><a name="l01232"></a><span class="lineno"> 1232</span> PathCumulFilter::PathCumulFilter(<span class="keyword">const</span> RoutingModel& routing_model,</div>
|
|
<div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  <span class="keyword">const</span> RoutingDimension& dimension,</div>
|
|
<div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  <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="l01235"></a><span class="lineno"> 1235</span>  <span class="keywordtype">bool</span> propagate_own_objective_value,</div>
|
|
<div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  <span class="keywordtype">bool</span> filter_objective_cost, <span class="keywordtype">bool</span> can_use_lp)</div>
|
|
<div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  : BasePathFilter(routing_model.Nexts(), dimension.cumuls().size()),</div>
|
|
<div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  routing_model_(routing_model),</div>
|
|
<div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  dimension_(dimension),</div>
|
|
<div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>(dimension.cumuls()),</div>
|
|
<div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  slacks_(dimension.slacks()),</div>
|
|
<div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  evaluators_(routing_model.vehicles(), nullptr),</div>
|
|
<div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  vehicle_span_upper_bounds_(dimension.vehicle_span_upper_bounds()),</div>
|
|
<div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  has_vehicle_span_upper_bounds_(false),</div>
|
|
<div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  total_current_cumul_cost_value_(0),</div>
|
|
<div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  synchronized_objective_value_(0),</div>
|
|
<div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  accepted_objective_value_(0),</div>
|
|
<div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  current_cumul_cost_values_(),</div>
|
|
<div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  cumul_cost_delta_(0),</div>
|
|
<div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  delta_path_cumul_cost_values_(routing_model.vehicles(), <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>),</div>
|
|
<div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>  global_span_cost_coefficient_(dimension.global_span_cost_coefficient()),</div>
|
|
<div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  vehicle_span_cost_coefficients_(</div>
|
|
<div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  dimension.vehicle_span_cost_coefficients()),</div>
|
|
<div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  has_nonzero_vehicle_span_cost_coefficients_(false),</div>
|
|
<div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  vehicle_capacities_(dimension.vehicle_capacities()),</div>
|
|
<div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  delta_max_end_cumul_(0),</div>
|
|
<div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  delta_nodes_with_precedences_and_changed_cumul_(routing_model.Size()),</div>
|
|
<div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  name_(dimension.<a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>()),</div>
|
|
<div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  optimizer_(routing_model.GetMutableLocalCumulOptimizer(dimension)),</div>
|
|
<div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  mp_optimizer_(routing_model.GetMutableLocalCumulMPOptimizer(dimension)),</div>
|
|
<div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  filter_objective_cost_(filter_objective_cost),</div>
|
|
<div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  can_use_lp_(can_use_lp),</div>
|
|
<div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  propagate_own_objective_value_(propagate_own_objective_value),</div>
|
|
<div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  lns_detected_(false) {</div>
|
|
<div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> upper_bound : vehicle_span_upper_bounds_) {</div>
|
|
<div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  <span class="keywordflow">if</span> (upper_bound != <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>) {</div>
|
|
<div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  has_vehicle_span_upper_bounds_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  }</div>
|
|
<div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  }</div>
|
|
<div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a> : vehicle_span_cost_coefficients_) {</div>
|
|
<div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  <span class="keywordflow">if</span> (<a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a> != 0) {</div>
|
|
<div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  has_nonzero_vehicle_span_cost_coefficients_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  }</div>
|
|
<div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>  }</div>
|
|
<div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>  cumul_soft_bounds_.resize(<a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>.size());</div>
|
|
<div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  cumul_soft_lower_bounds_.resize(<a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>.size());</div>
|
|
<div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  cumul_piecewise_linear_costs_.resize(<a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>.size());</div>
|
|
<div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  <span class="keywordtype">bool</span> has_cumul_soft_bounds = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  <span class="keywordtype">bool</span> has_cumul_soft_lower_bounds = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  <span class="keywordtype">bool</span> has_cumul_piecewise_linear_costs = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  <span class="keywordtype">bool</span> has_cumul_hard_bounds = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntVar* <span class="keyword">const</span> slack : slacks_) {</div>
|
|
<div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  <span class="keywordflow">if</span> (slack->Min() > 0) {</div>
|
|
<div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  has_cumul_hard_bounds = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  }</div>
|
|
<div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>  }</div>
|
|
<div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>.size(); ++i) {</div>
|
|
<div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>  <span class="keywordflow">if</span> (dimension.HasCumulVarSoftUpperBound(i)) {</div>
|
|
<div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  has_cumul_soft_bounds = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  cumul_soft_bounds_[i].bound = dimension.GetCumulVarSoftUpperBound(i);</div>
|
|
<div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  cumul_soft_bounds_[i].coefficient =</div>
|
|
<div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  dimension.GetCumulVarSoftUpperBoundCoefficient(i);</div>
|
|
<div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  }</div>
|
|
<div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  <span class="keywordflow">if</span> (dimension.HasCumulVarSoftLowerBound(i)) {</div>
|
|
<div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  has_cumul_soft_lower_bounds = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  cumul_soft_lower_bounds_[i].bound =</div>
|
|
<div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  dimension.GetCumulVarSoftLowerBound(i);</div>
|
|
<div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  cumul_soft_lower_bounds_[i].coefficient =</div>
|
|
<div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  dimension.GetCumulVarSoftLowerBoundCoefficient(i);</div>
|
|
<div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  }</div>
|
|
<div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>  <span class="keywordflow">if</span> (dimension.HasCumulVarPiecewiseLinearCost(i)) {</div>
|
|
<div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  has_cumul_piecewise_linear_costs = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  cumul_piecewise_linear_costs_[i] =</div>
|
|
<div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>  dimension.GetCumulVarPiecewiseLinearCost(i);</div>
|
|
<div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  }</div>
|
|
<div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>  IntVar* <span class="keyword">const</span> cumul_var = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[i];</div>
|
|
<div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  <span class="keywordflow">if</span> (cumul_var->Min() > 0 || cumul_var->Max() < <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>) {</div>
|
|
<div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  has_cumul_hard_bounds = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  }</div>
|
|
<div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  }</div>
|
|
<div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>  <span class="keywordflow">if</span> (!has_cumul_soft_bounds) {</div>
|
|
<div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>  cumul_soft_bounds_.clear();</div>
|
|
<div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  }</div>
|
|
<div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  <span class="keywordflow">if</span> (!has_cumul_soft_lower_bounds) {</div>
|
|
<div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>  cumul_soft_lower_bounds_.clear();</div>
|
|
<div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  }</div>
|
|
<div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  <span class="keywordflow">if</span> (!has_cumul_piecewise_linear_costs) {</div>
|
|
<div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  cumul_piecewise_linear_costs_.clear();</div>
|
|
<div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  }</div>
|
|
<div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  <span class="keywordflow">if</span> (!has_cumul_hard_bounds) {</div>
|
|
<div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  <span class="comment">// Slacks don't need to be constrained if the cumuls don't have hard bounds;</span></div>
|
|
<div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  <span class="comment">// therefore we can ignore the vehicle span cost coefficient (note that the</span></div>
|
|
<div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>  <span class="comment">// transit part is already handled by the arc cost filters).</span></div>
|
|
<div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>  <span class="comment">// This doesn't concern the global span filter though.</span></div>
|
|
<div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  vehicle_span_cost_coefficients_.assign(routing_model.vehicles(), 0);</div>
|
|
<div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  has_nonzero_vehicle_span_cost_coefficients_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  }</div>
|
|
<div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  start_to_vehicle_.resize(Size(), -1);</div>
|
|
<div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < routing_model.vehicles(); ++i) {</div>
|
|
<div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>  start_to_vehicle_[routing_model.Start(i)] = i;</div>
|
|
<div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  evaluators_[i] = &dimension.transit_evaluator(i);</div>
|
|
<div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  }</div>
|
|
<div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  </div>
|
|
<div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  <span class="keyword">const</span> std::vector<RoutingDimension::NodePrecedence>& node_precedences =</div>
|
|
<div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  dimension.GetNodePrecedences();</div>
|
|
<div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  <span class="keywordflow">if</span> (!node_precedences.empty()) {</div>
|
|
<div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  current_min_max_node_cumuls_.resize(<a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>.size(), {-1, -1});</div>
|
|
<div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  node_index_to_precedences_.resize(<a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>.size());</div>
|
|
<div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& node_precedence : node_precedences) {</div>
|
|
<div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  node_index_to_precedences_[node_precedence.first_node].push_back(</div>
|
|
<div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  node_precedence);</div>
|
|
<div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  node_index_to_precedences_[node_precedence.second_node].push_back(</div>
|
|
<div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  node_precedence);</div>
|
|
<div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  }</div>
|
|
<div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  }</div>
|
|
<div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  <span class="comment">// NOTE(user): The model's local optimizer for this dimension could be</span></div>
|
|
<div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  <span class="comment">// null because the finalizer is using a global optimizer, so we create a</span></div>
|
|
<div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  <span class="comment">// separate optimizer for the PathCumulFilter if we need it.</span></div>
|
|
<div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  <span class="keywordflow">if</span> (can_use_lp_ && optimizer_ == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(mp_optimizer_ == <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < routing_model.vehicles(); vehicle++) {</div>
|
|
<div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  <span class="keywordflow">if</span> (!FilterWithDimensionCumulOptimizerForVehicle(vehicle)) {</div>
|
|
<div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  }</div>
|
|
<div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>  <span class="keywordflow">if</span> (optimizer_ == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>  <span class="comment">// NOTE: The optimizer_ might have already been set in the for loop,</span></div>
|
|
<div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>  <span class="comment">// since we continue scanning vehicles in case one of them needs the</span></div>
|
|
<div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  <span class="comment">// the mp_optimizer_ for break constraints.</span></div>
|
|
<div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  internal_optimizer_ = absl::make_unique<LocalDimensionCumulOptimizer>(</div>
|
|
<div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>  &dimension, <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.continuous_scheduling_solver());</div>
|
|
<div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  optimizer_ = internal_optimizer_.get();</div>
|
|
<div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>  }</div>
|
|
<div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>  <span class="keywordflow">if</span> (FilterBreakCost(vehicle) || FilterDimensionForbiddenIntervals()) {</div>
|
|
<div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>  internal_mp_optimizer_ =</div>
|
|
<div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  absl::make_unique<LocalDimensionCumulOptimizer>(</div>
|
|
<div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  &dimension, <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.mixed_integer_scheduling_solver());</div>
|
|
<div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  mp_optimizer_ = internal_mp_optimizer_.get();</div>
|
|
<div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>  }</div>
|
|
<div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  }</div>
|
|
<div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  }</div>
|
|
<div class="line"><a name="l01375"></a><span class="lineno"> 1375</span> }</div>
|
|
<div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>  </div>
|
|
<div class="line"><a name="l01377"></a><span class="lineno"> 1377</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> PathCumulFilter::GetCumulSoftCost(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__search_8cc.html#a437b1dcf96372e200f82e9f039054290">cumul_value</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  <span class="keywordflow">if</span> (node < cumul_soft_bounds_.size()) {</div>
|
|
<div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a> = cumul_soft_bounds_[node].bound;</div>
|
|
<div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a> = cumul_soft_bounds_[node].coefficient;</div>
|
|
<div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>  <span class="keywordflow">if</span> (<a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a> > 0 && <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a> < <a class="code" href="routing__search_8cc.html#a437b1dcf96372e200f82e9f039054290">cumul_value</a>) {</div>
|
|
<div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(<a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(<a class="code" href="routing__search_8cc.html#a437b1dcf96372e200f82e9f039054290">cumul_value</a>, <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a>), <a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a>);</div>
|
|
<div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  }</div>
|
|
<div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  }</div>
|
|
<div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>  <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a name="l01386"></a><span class="lineno"> 1386</span> }</div>
|
|
<div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>  </div>
|
|
<div class="line"><a name="l01388"></a><span class="lineno"> 1388</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> PathCumulFilter::GetCumulPiecewiseLinearCost(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node,</div>
|
|
<div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__search_8cc.html#a437b1dcf96372e200f82e9f039054290">cumul_value</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  <span class="keywordflow">if</span> (node < cumul_piecewise_linear_costs_.size()) {</div>
|
|
<div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>  <span class="keyword">const</span> PiecewiseLinearFunction* <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a> = cumul_piecewise_linear_costs_[node];</div>
|
|
<div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  <span class="keywordflow">if</span> (<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a> != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>  <span class="keywordflow">return</span> <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>->Value(<a class="code" href="routing__search_8cc.html#a437b1dcf96372e200f82e9f039054290">cumul_value</a>);</div>
|
|
<div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  }</div>
|
|
<div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>  }</div>
|
|
<div class="line"><a name="l01396"></a><span class="lineno"> 1396</span>  <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a name="l01397"></a><span class="lineno"> 1397</span> }</div>
|
|
<div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>  </div>
|
|
<div class="line"><a name="l01399"></a><span class="lineno"> 1399</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> PathCumulFilter::GetCumulSoftLowerBoundCost(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node,</div>
|
|
<div class="line"><a name="l01400"></a><span class="lineno"> 1400</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__search_8cc.html#a437b1dcf96372e200f82e9f039054290">cumul_value</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01401"></a><span class="lineno"> 1401</span>  <span class="keywordflow">if</span> (node < cumul_soft_lower_bounds_.size()) {</div>
|
|
<div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a> = cumul_soft_lower_bounds_[node].bound;</div>
|
|
<div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a> = cumul_soft_lower_bounds_[node].coefficient;</div>
|
|
<div class="line"><a name="l01404"></a><span class="lineno"> 1404</span>  <span class="keywordflow">if</span> (<a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a> > 0 && <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a> > <a class="code" href="routing__search_8cc.html#a437b1dcf96372e200f82e9f039054290">cumul_value</a>) {</div>
|
|
<div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(<a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(<a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a>, <a class="code" href="routing__search_8cc.html#a437b1dcf96372e200f82e9f039054290">cumul_value</a>), <a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a>);</div>
|
|
<div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>  }</div>
|
|
<div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>  }</div>
|
|
<div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>  <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a name="l01409"></a><span class="lineno"> 1409</span> }</div>
|
|
<div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>  </div>
|
|
<div class="line"><a name="l01411"></a><span class="lineno"> 1411</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> PathCumulFilter::GetPathCumulSoftLowerBoundCost(</div>
|
|
<div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>  <span class="keyword">const</span> PathTransits& path_transits, <span class="keywordtype">int</span> path)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = path_transits.Node(path, path_transits.PathSize(path) - 1);</div>
|
|
<div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[node]->Max();</div>
|
|
<div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> current_cumul_cost_value = GetCumulSoftLowerBoundCost(node, cumul);</div>
|
|
<div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = path_transits.PathSize(path) - 2; i >= 0; --i) {</div>
|
|
<div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>  node = path_transits.Node(path, i);</div>
|
|
<div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>  cumul = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(cumul, path_transits.Transit(path, i));</div>
|
|
<div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>  cumul = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(<a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[node]->Max(), cumul);</div>
|
|
<div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>  current_cumul_cost_value = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(current_cumul_cost_value,</div>
|
|
<div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>  GetCumulSoftLowerBoundCost(node, cumul));</div>
|
|
<div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>  }</div>
|
|
<div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>  <span class="keywordflow">return</span> current_cumul_cost_value;</div>
|
|
<div class="line"><a name="l01424"></a><span class="lineno"> 1424</span> }</div>
|
|
<div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>  </div>
|
|
<div class="line"><a name="l01426"></a><span class="lineno"> 1426</span> <span class="keywordtype">void</span> PathCumulFilter::OnBeforeSynchronizePaths() {</div>
|
|
<div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>  total_current_cumul_cost_value_ = 0;</div>
|
|
<div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>  cumul_cost_delta_ = 0;</div>
|
|
<div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>  current_cumul_cost_values_.clear();</div>
|
|
<div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>  <span class="keywordflow">if</span> (NumPaths() > 0 &&</div>
|
|
<div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  (FilterSpanCost() || FilterCumulSoftBounds() || FilterSlackCost() ||</div>
|
|
<div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>  FilterCumulSoftLowerBounds() || FilterCumulPiecewiseLinearCosts() ||</div>
|
|
<div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>  FilterPrecedences() || FilterSoftSpanCost() ||</div>
|
|
<div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  FilterSoftSpanQuadraticCost())) {</div>
|
|
<div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>  InitializeSupportedPathCumul(&current_min_start_, <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>);</div>
|
|
<div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>  InitializeSupportedPathCumul(&current_max_end_, <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>);</div>
|
|
<div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>  current_path_transits_.Clear();</div>
|
|
<div class="line"><a name="l01438"></a><span class="lineno"> 1438</span>  current_path_transits_.AddPaths(NumPaths());</div>
|
|
<div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>  <span class="comment">// For each path, compute the minimum end cumul and store the max of these.</span></div>
|
|
<div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> r = 0; r < NumPaths(); ++r) {</div>
|
|
<div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = Start(r);</div>
|
|
<div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = start_to_vehicle_[Start(r)];</div>
|
|
<div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>  <span class="comment">// First pass: evaluating route length to reserve memory to store route</span></div>
|
|
<div class="line"><a name="l01444"></a><span class="lineno"> 1444</span>  <span class="comment">// information.</span></div>
|
|
<div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>  <span class="keywordtype">int</span> number_of_route_arcs = 0;</div>
|
|
<div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>  <span class="keywordflow">while</span> (node < Size()) {</div>
|
|
<div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>  ++number_of_route_arcs;</div>
|
|
<div class="line"><a name="l01448"></a><span class="lineno"> 1448</span>  node = <a class="code" href="namespaceoperations__research_1_1sat.html#a3f1a1b8a7a1a488e263a2e74f45d2a59">Value</a>(node);</div>
|
|
<div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>  }</div>
|
|
<div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>  current_path_transits_.ReserveTransits(r, number_of_route_arcs);</div>
|
|
<div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>  <span class="comment">// Second pass: update cumul, transit and cost values.</span></div>
|
|
<div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>  node = Start(r);</div>
|
|
<div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[node]->Min();</div>
|
|
<div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>  std::vector<int64> min_path_cumuls;</div>
|
|
<div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>  min_path_cumuls.reserve(number_of_route_arcs + 1);</div>
|
|
<div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>  min_path_cumuls.push_back(cumul);</div>
|
|
<div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>  </div>
|
|
<div class="line"><a name="l01458"></a><span class="lineno"> 1458</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> current_cumul_cost_value = GetCumulSoftCost(node, cumul);</div>
|
|
<div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>  current_cumul_cost_value = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(</div>
|
|
<div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>  current_cumul_cost_value, GetCumulPiecewiseLinearCost(node, cumul));</div>
|
|
<div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>  </div>
|
|
<div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> total_transit = 0;</div>
|
|
<div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>  <span class="keywordflow">while</span> (node < Size()) {</div>
|
|
<div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#a3f1a1b8a7a1a488e263a2e74f45d2a59">Value</a>(node);</div>
|
|
<div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> transit = (*evaluators_[vehicle])(node, <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>  total_transit = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(total_transit, transit);</div>
|
|
<div class="line"><a name="l01467"></a><span class="lineno"> 1467</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> transit_slack = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(transit, slacks_[node]->Min());</div>
|
|
<div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>  current_path_transits_.PushTransit(r, node, <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, transit_slack);</div>
|
|
<div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>  cumul = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(cumul, transit_slack);</div>
|
|
<div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>  cumul =</div>
|
|
<div class="line"><a name="l01471"></a><span class="lineno"> 1471</span>  dimension_.GetFirstPossibleGreaterOrEqualValueForNode(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, cumul);</div>
|
|
<div class="line"><a name="l01472"></a><span class="lineno"> 1472</span>  cumul = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(<a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>]->Min(), cumul);</div>
|
|
<div class="line"><a name="l01473"></a><span class="lineno"> 1473</span>  min_path_cumuls.push_back(cumul);</div>
|
|
<div class="line"><a name="l01474"></a><span class="lineno"> 1474</span>  node = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l01475"></a><span class="lineno"> 1475</span>  current_cumul_cost_value =</div>
|
|
<div class="line"><a name="l01476"></a><span class="lineno"> 1476</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(current_cumul_cost_value, GetCumulSoftCost(node, cumul));</div>
|
|
<div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>  current_cumul_cost_value = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(</div>
|
|
<div class="line"><a name="l01478"></a><span class="lineno"> 1478</span>  current_cumul_cost_value, GetCumulPiecewiseLinearCost(node, cumul));</div>
|
|
<div class="line"><a name="l01479"></a><span class="lineno"> 1479</span>  }</div>
|
|
<div class="line"><a name="l01480"></a><span class="lineno"> 1480</span>  <span class="keywordflow">if</span> (FilterPrecedences()) {</div>
|
|
<div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>  StoreMinMaxCumulOfNodesOnPath(<span class="comment">/*path=*/</span>r, min_path_cumuls,</div>
|
|
<div class="line"><a name="l01482"></a><span class="lineno"> 1482</span>  <span class="comment">/*is_delta=*/</span><span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l01483"></a><span class="lineno"> 1483</span>  }</div>
|
|
<div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>  <span class="keywordflow">if</span> (number_of_route_arcs == 1 &&</div>
|
|
<div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>  !routing_model_.AreEmptyRouteCostsConsideredForVehicle(vehicle)) {</div>
|
|
<div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>  <span class="comment">// This is an empty route (single start->end arc) which we don't take</span></div>
|
|
<div class="line"><a name="l01487"></a><span class="lineno"> 1487</span>  <span class="comment">// into account for costs.</span></div>
|
|
<div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>  current_cumul_cost_values_[Start(r)] = 0;</div>
|
|
<div class="line"><a name="l01489"></a><span class="lineno"> 1489</span>  current_path_transits_.ClearPath(r);</div>
|
|
<div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>  }</div>
|
|
<div class="line"><a name="l01492"></a><span class="lineno"> 1492</span>  <span class="keywordflow">if</span> (FilterSlackCost() || FilterSoftSpanCost() ||</div>
|
|
<div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>  FilterSoftSpanQuadraticCost()) {</div>
|
|
<div class="line"><a name="l01494"></a><span class="lineno"> 1494</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> start = ComputePathMaxStartFromEndCumul(</div>
|
|
<div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>  current_path_transits_, r, Start(r), cumul);</div>
|
|
<div class="line"><a name="l01496"></a><span class="lineno"> 1496</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> span_lower_bound = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(cumul, start);</div>
|
|
<div class="line"><a name="l01497"></a><span class="lineno"> 1497</span>  <span class="keywordflow">if</span> (FilterSlackCost()) {</div>
|
|
<div class="line"><a name="l01498"></a><span class="lineno"> 1498</span>  current_cumul_cost_value =</div>
|
|
<div class="line"><a name="l01499"></a><span class="lineno"> 1499</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(current_cumul_cost_value,</div>
|
|
<div class="line"><a name="l01500"></a><span class="lineno"> 1500</span>  <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(vehicle_span_cost_coefficients_[vehicle],</div>
|
|
<div class="line"><a name="l01501"></a><span class="lineno"> 1501</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(span_lower_bound, total_transit)));</div>
|
|
<div class="line"><a name="l01502"></a><span class="lineno"> 1502</span>  }</div>
|
|
<div class="line"><a name="l01503"></a><span class="lineno"> 1503</span>  <span class="keywordflow">if</span> (FilterSoftSpanCost()) {</div>
|
|
<div class="line"><a name="l01504"></a><span class="lineno"> 1504</span>  <span class="keyword">const</span> SimpleBoundCosts::BoundCost bound_cost =</div>
|
|
<div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>  dimension_.GetSoftSpanUpperBoundForVehicle(vehicle);</div>
|
|
<div class="line"><a name="l01506"></a><span class="lineno"> 1506</span>  <span class="keywordflow">if</span> (bound_cost.bound < span_lower_bound) {</div>
|
|
<div class="line"><a name="l01507"></a><span class="lineno"> 1507</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> violation = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(span_lower_bound, bound_cost.bound);</div>
|
|
<div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>  current_cumul_cost_value = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(</div>
|
|
<div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>  current_cumul_cost_value, <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(bound_cost.cost, violation));</div>
|
|
<div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>  }</div>
|
|
<div class="line"><a name="l01511"></a><span class="lineno"> 1511</span>  }</div>
|
|
<div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>  <span class="keywordflow">if</span> (FilterSoftSpanQuadraticCost()) {</div>
|
|
<div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>  <span class="keyword">const</span> SimpleBoundCosts::BoundCost bound_cost =</div>
|
|
<div class="line"><a name="l01514"></a><span class="lineno"> 1514</span>  dimension_.GetQuadraticCostSoftSpanUpperBoundForVehicle(vehicle);</div>
|
|
<div class="line"><a name="l01515"></a><span class="lineno"> 1515</span>  <span class="keywordflow">if</span> (bound_cost.bound < span_lower_bound) {</div>
|
|
<div class="line"><a name="l01516"></a><span class="lineno"> 1516</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> violation = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(span_lower_bound, bound_cost.bound);</div>
|
|
<div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>  current_cumul_cost_value =</div>
|
|
<div class="line"><a name="l01518"></a><span class="lineno"> 1518</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(current_cumul_cost_value,</div>
|
|
<div class="line"><a name="l01519"></a><span class="lineno"> 1519</span>  <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(bound_cost.cost, <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(violation, violation)));</div>
|
|
<div class="line"><a name="l01520"></a><span class="lineno"> 1520</span>  }</div>
|
|
<div class="line"><a name="l01521"></a><span class="lineno"> 1521</span>  }</div>
|
|
<div class="line"><a name="l01522"></a><span class="lineno"> 1522</span>  }</div>
|
|
<div class="line"><a name="l01523"></a><span class="lineno"> 1523</span>  <span class="keywordflow">if</span> (FilterCumulSoftLowerBounds()) {</div>
|
|
<div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>  current_cumul_cost_value =</div>
|
|
<div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(current_cumul_cost_value,</div>
|
|
<div class="line"><a name="l01526"></a><span class="lineno"> 1526</span>  GetPathCumulSoftLowerBoundCost(current_path_transits_, r));</div>
|
|
<div class="line"><a name="l01527"></a><span class="lineno"> 1527</span>  }</div>
|
|
<div class="line"><a name="l01528"></a><span class="lineno"> 1528</span>  <span class="keywordflow">if</span> (FilterWithDimensionCumulOptimizerForVehicle(vehicle)) {</div>
|
|
<div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>  <span class="comment">// TODO(user): Return a status from the optimizer to detect failures</span></div>
|
|
<div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>  <span class="comment">// The only admissible failures here are because of LP timeout.</span></div>
|
|
<div class="line"><a name="l01531"></a><span class="lineno"> 1531</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> lp_cumul_cost_value = 0;</div>
|
|
<div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>  LocalDimensionCumulOptimizer* <span class="keyword">const</span> optimizer =</div>
|
|
<div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>  FilterBreakCost(vehicle) ? mp_optimizer_ : optimizer_;</div>
|
|
<div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(optimizer != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> status =</div>
|
|
<div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>  optimizer->ComputeRouteCumulCostWithoutFixedTransits(</div>
|
|
<div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>  vehicle, [<span class="keyword">this</span>](<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node) { <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a3f1a1b8a7a1a488e263a2e74f45d2a59">Value</a>(node); },</div>
|
|
<div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>  &lp_cumul_cost_value);</div>
|
|
<div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>  <span class="keywordflow">switch</span> (status) {</div>
|
|
<div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>  <span class="keywordflow">case</span> <a class="code" href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a2884fa43446c0cbc9c7a9b74d41d7483">DimensionSchedulingStatus::INFEASIBLE</a>:</div>
|
|
<div class="line"><a name="l01541"></a><span class="lineno"> 1541</span>  lp_cumul_cost_value = 0;</div>
|
|
<div class="line"><a name="l01542"></a><span class="lineno"> 1542</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01543"></a><span class="lineno"> 1543</span>  <span class="keywordflow">case</span> DimensionSchedulingStatus::RELAXED_OPTIMAL_ONLY:</div>
|
|
<div class="line"><a name="l01544"></a><span class="lineno"> 1544</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(mp_optimizer_ != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l01545"></a><span class="lineno"> 1545</span>  <span class="keywordflow">if</span> (mp_optimizer_->ComputeRouteCumulCostWithoutFixedTransits(</div>
|
|
<div class="line"><a name="l01546"></a><span class="lineno"> 1546</span>  vehicle, [<span class="keyword">this</span>](<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node) { return Value(node); },</div>
|
|
<div class="line"><a name="l01547"></a><span class="lineno"> 1547</span>  &lp_cumul_cost_value) ==</div>
|
|
<div class="line"><a name="l01548"></a><span class="lineno"> 1548</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a2884fa43446c0cbc9c7a9b74d41d7483">DimensionSchedulingStatus::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a name="l01549"></a><span class="lineno"> 1549</span>  lp_cumul_cost_value = 0;</div>
|
|
<div class="line"><a name="l01550"></a><span class="lineno"> 1550</span>  }</div>
|
|
<div class="line"><a name="l01551"></a><span class="lineno"> 1551</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01552"></a><span class="lineno"> 1552</span>  <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a name="l01553"></a><span class="lineno"> 1553</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(status == <a class="code" href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a2579881e7c83261bc21bafb5a5c92cad">DimensionSchedulingStatus::OPTIMAL</a>);</div>
|
|
<div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>  }</div>
|
|
<div class="line"><a name="l01555"></a><span class="lineno"> 1555</span>  current_cumul_cost_value =</div>
|
|
<div class="line"><a name="l01556"></a><span class="lineno"> 1556</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(current_cumul_cost_value, lp_cumul_cost_value);</div>
|
|
<div class="line"><a name="l01557"></a><span class="lineno"> 1557</span>  }</div>
|
|
<div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>  current_cumul_cost_values_[Start(r)] = current_cumul_cost_value;</div>
|
|
<div class="line"><a name="l01559"></a><span class="lineno"> 1559</span>  current_max_end_.path_values[r] = cumul;</div>
|
|
<div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>  <span class="keywordflow">if</span> (current_max_end_.cumul_value < cumul) {</div>
|
|
<div class="line"><a name="l01561"></a><span class="lineno"> 1561</span>  current_max_end_.cumul_value = cumul;</div>
|
|
<div class="line"><a name="l01562"></a><span class="lineno"> 1562</span>  current_max_end_.cumul_value_support = r;</div>
|
|
<div class="line"><a name="l01563"></a><span class="lineno"> 1563</span>  }</div>
|
|
<div class="line"><a name="l01564"></a><span class="lineno"> 1564</span>  total_current_cumul_cost_value_ =</div>
|
|
<div class="line"><a name="l01565"></a><span class="lineno"> 1565</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(total_current_cumul_cost_value_, current_cumul_cost_value);</div>
|
|
<div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>  }</div>
|
|
<div class="line"><a name="l01567"></a><span class="lineno"> 1567</span>  <span class="keywordflow">if</span> (FilterPrecedences()) {</div>
|
|
<div class="line"><a name="l01568"></a><span class="lineno"> 1568</span>  <span class="comment">// Update the min/max node cumuls of new unperformed nodes.</span></div>
|
|
<div class="line"><a name="l01569"></a><span class="lineno"> 1569</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node : GetNewSynchronizedUnperformedNodes()) {</div>
|
|
<div class="line"><a name="l01570"></a><span class="lineno"> 1570</span>  current_min_max_node_cumuls_[node] = {-1, -1};</div>
|
|
<div class="line"><a name="l01571"></a><span class="lineno"> 1571</span>  }</div>
|
|
<div class="line"><a name="l01572"></a><span class="lineno"> 1572</span>  }</div>
|
|
<div class="line"><a name="l01573"></a><span class="lineno"> 1573</span>  <span class="comment">// Use the max of the path end cumul mins to compute the corresponding</span></div>
|
|
<div class="line"><a name="l01574"></a><span class="lineno"> 1574</span>  <span class="comment">// maximum start cumul of each path; store the minimum of these.</span></div>
|
|
<div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> r = 0; r < NumPaths(); ++r) {</div>
|
|
<div class="line"><a name="l01576"></a><span class="lineno"> 1576</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> start = ComputePathMaxStartFromEndCumul(</div>
|
|
<div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>  current_path_transits_, r, Start(r), current_max_end_.cumul_value);</div>
|
|
<div class="line"><a name="l01578"></a><span class="lineno"> 1578</span>  current_min_start_.path_values[r] = start;</div>
|
|
<div class="line"><a name="l01579"></a><span class="lineno"> 1579</span>  <span class="keywordflow">if</span> (current_min_start_.cumul_value > start) {</div>
|
|
<div class="line"><a name="l01580"></a><span class="lineno"> 1580</span>  current_min_start_.cumul_value = start;</div>
|
|
<div class="line"><a name="l01581"></a><span class="lineno"> 1581</span>  current_min_start_.cumul_value_support = r;</div>
|
|
<div class="line"><a name="l01582"></a><span class="lineno"> 1582</span>  }</div>
|
|
<div class="line"><a name="l01583"></a><span class="lineno"> 1583</span>  }</div>
|
|
<div class="line"><a name="l01584"></a><span class="lineno"> 1584</span>  }</div>
|
|
<div class="line"><a name="l01585"></a><span class="lineno"> 1585</span>  <span class="comment">// Initialize this before considering any deltas (neighbor).</span></div>
|
|
<div class="line"><a name="l01586"></a><span class="lineno"> 1586</span>  delta_max_end_cumul_ = <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>;</div>
|
|
<div class="line"><a name="l01587"></a><span class="lineno"> 1587</span>  lns_detected_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01588"></a><span class="lineno"> 1588</span>  </div>
|
|
<div class="line"><a name="l01589"></a><span class="lineno"> 1589</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(current_max_end_.cumul_value, current_min_start_.cumul_value);</div>
|
|
<div class="line"><a name="l01590"></a><span class="lineno"> 1590</span>  synchronized_objective_value_ =</div>
|
|
<div class="line"><a name="l01591"></a><span class="lineno"> 1591</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(total_current_cumul_cost_value_,</div>
|
|
<div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>  <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(global_span_cost_coefficient_,</div>
|
|
<div class="line"><a name="l01593"></a><span class="lineno"> 1593</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(current_max_end_.cumul_value,</div>
|
|
<div class="line"><a name="l01594"></a><span class="lineno"> 1594</span>  current_min_start_.cumul_value)));</div>
|
|
<div class="line"><a name="l01595"></a><span class="lineno"> 1595</span> }</div>
|
|
<div class="line"><a name="l01596"></a><span class="lineno"> 1596</span>  </div>
|
|
<div class="line"><a name="l01597"></a><span class="lineno"> 1597</span> <span class="keywordtype">bool</span> PathCumulFilter::AcceptPath(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_start, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_start,</div>
|
|
<div class="line"><a name="l01598"></a><span class="lineno"> 1598</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_end) {</div>
|
|
<div class="line"><a name="l01599"></a><span class="lineno"> 1599</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = path_start;</div>
|
|
<div class="line"><a name="l01600"></a><span class="lineno"> 1600</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[node]->Min();</div>
|
|
<div class="line"><a name="l01601"></a><span class="lineno"> 1601</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_cost_delta = 0;</div>
|
|
<div class="line"><a name="l01602"></a><span class="lineno"> 1602</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> total_transit = 0;</div>
|
|
<div class="line"><a name="l01603"></a><span class="lineno"> 1603</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> path = delta_path_transits_.AddPaths(1);</div>
|
|
<div class="line"><a name="l01604"></a><span class="lineno"> 1604</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = start_to_vehicle_[path_start];</div>
|
|
<div class="line"><a name="l01605"></a><span class="lineno"> 1605</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a> = vehicle_capacities_[vehicle];</div>
|
|
<div class="line"><a name="l01606"></a><span class="lineno"> 1606</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> filter_vehicle_costs =</div>
|
|
<div class="line"><a name="l01607"></a><span class="lineno"> 1607</span>  !routing_model_.IsEnd(GetNext(node)) ||</div>
|
|
<div class="line"><a name="l01608"></a><span class="lineno"> 1608</span>  routing_model_.AreEmptyRouteCostsConsideredForVehicle(vehicle);</div>
|
|
<div class="line"><a name="l01609"></a><span class="lineno"> 1609</span>  <span class="keywordflow">if</span> (filter_vehicle_costs) {</div>
|
|
<div class="line"><a name="l01610"></a><span class="lineno"> 1610</span>  cumul_cost_delta = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(GetCumulSoftCost(node, cumul),</div>
|
|
<div class="line"><a name="l01611"></a><span class="lineno"> 1611</span>  GetCumulPiecewiseLinearCost(node, cumul));</div>
|
|
<div class="line"><a name="l01612"></a><span class="lineno"> 1612</span>  }</div>
|
|
<div class="line"><a name="l01613"></a><span class="lineno"> 1613</span>  <span class="comment">// Evaluating route length to reserve memory to store transit information.</span></div>
|
|
<div class="line"><a name="l01614"></a><span class="lineno"> 1614</span>  <span class="keywordtype">int</span> number_of_route_arcs = 0;</div>
|
|
<div class="line"><a name="l01615"></a><span class="lineno"> 1615</span>  <span class="keywordflow">while</span> (node < Size()) {</div>
|
|
<div class="line"><a name="l01616"></a><span class="lineno"> 1616</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = GetNext(node);</div>
|
|
<div class="line"><a name="l01617"></a><span class="lineno"> 1617</span>  <span class="comment">// TODO(user): This shouldn't be needed anymore as such deltas should</span></div>
|
|
<div class="line"><a name="l01618"></a><span class="lineno"> 1618</span>  <span class="comment">// have been filtered already.</span></div>
|
|
<div class="line"><a name="l01619"></a><span class="lineno"> 1619</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> == <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a>) {</div>
|
|
<div class="line"><a name="l01620"></a><span class="lineno"> 1620</span>  <span class="comment">// LNS detected, return true since other paths were ok up to now.</span></div>
|
|
<div class="line"><a name="l01621"></a><span class="lineno"> 1621</span>  lns_detected_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01622"></a><span class="lineno"> 1622</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01623"></a><span class="lineno"> 1623</span>  }</div>
|
|
<div class="line"><a name="l01624"></a><span class="lineno"> 1624</span>  ++number_of_route_arcs;</div>
|
|
<div class="line"><a name="l01625"></a><span class="lineno"> 1625</span>  node = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l01626"></a><span class="lineno"> 1626</span>  }</div>
|
|
<div class="line"><a name="l01627"></a><span class="lineno"> 1627</span>  delta_path_transits_.ReserveTransits(path, number_of_route_arcs);</div>
|
|
<div class="line"><a name="l01628"></a><span class="lineno"> 1628</span>  std::vector<int64> min_path_cumuls;</div>
|
|
<div class="line"><a name="l01629"></a><span class="lineno"> 1629</span>  min_path_cumuls.reserve(number_of_route_arcs + 1);</div>
|
|
<div class="line"><a name="l01630"></a><span class="lineno"> 1630</span>  min_path_cumuls.push_back(cumul);</div>
|
|
<div class="line"><a name="l01631"></a><span class="lineno"> 1631</span>  <span class="comment">// Check that the path is feasible with regards to cumul bounds, scanning</span></div>
|
|
<div class="line"><a name="l01632"></a><span class="lineno"> 1632</span>  <span class="comment">// the paths from start to end (caching path node sequences and transits</span></div>
|
|
<div class="line"><a name="l01633"></a><span class="lineno"> 1633</span>  <span class="comment">// for further span cost filtering).</span></div>
|
|
<div class="line"><a name="l01634"></a><span class="lineno"> 1634</span>  node = path_start;</div>
|
|
<div class="line"><a name="l01635"></a><span class="lineno"> 1635</span>  <span class="keywordflow">while</span> (node < Size()) {</div>
|
|
<div class="line"><a name="l01636"></a><span class="lineno"> 1636</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = GetNext(node);</div>
|
|
<div class="line"><a name="l01637"></a><span class="lineno"> 1637</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> transit = (*evaluators_[vehicle])(node, <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a name="l01638"></a><span class="lineno"> 1638</span>  total_transit = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(total_transit, transit);</div>
|
|
<div class="line"><a name="l01639"></a><span class="lineno"> 1639</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> transit_slack = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(transit, slacks_[node]->Min());</div>
|
|
<div class="line"><a name="l01640"></a><span class="lineno"> 1640</span>  delta_path_transits_.PushTransit(path, node, <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, transit_slack);</div>
|
|
<div class="line"><a name="l01641"></a><span class="lineno"> 1641</span>  cumul = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(cumul, transit_slack);</div>
|
|
<div class="line"><a name="l01642"></a><span class="lineno"> 1642</span>  cumul = dimension_.GetFirstPossibleGreaterOrEqualValueForNode(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, cumul);</div>
|
|
<div class="line"><a name="l01643"></a><span class="lineno"> 1643</span>  <span class="keywordflow">if</span> (cumul > <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>]->Max())) {</div>
|
|
<div class="line"><a name="l01644"></a><span class="lineno"> 1644</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01645"></a><span class="lineno"> 1645</span>  }</div>
|
|
<div class="line"><a name="l01646"></a><span class="lineno"> 1646</span>  cumul = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(<a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>]->Min(), cumul);</div>
|
|
<div class="line"><a name="l01647"></a><span class="lineno"> 1647</span>  min_path_cumuls.push_back(cumul);</div>
|
|
<div class="line"><a name="l01648"></a><span class="lineno"> 1648</span>  node = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>  <span class="keywordflow">if</span> (filter_vehicle_costs) {</div>
|
|
<div class="line"><a name="l01650"></a><span class="lineno"> 1650</span>  cumul_cost_delta =</div>
|
|
<div class="line"><a name="l01651"></a><span class="lineno"> 1651</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(cumul_cost_delta, GetCumulSoftCost(node, cumul));</div>
|
|
<div class="line"><a name="l01652"></a><span class="lineno"> 1652</span>  cumul_cost_delta =</div>
|
|
<div class="line"><a name="l01653"></a><span class="lineno"> 1653</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(cumul_cost_delta, GetCumulPiecewiseLinearCost(node, cumul));</div>
|
|
<div class="line"><a name="l01654"></a><span class="lineno"> 1654</span>  }</div>
|
|
<div class="line"><a name="l01655"></a><span class="lineno"> 1655</span>  }</div>
|
|
<div class="line"><a name="l01656"></a><span class="lineno"> 1656</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> min_end = cumul;</div>
|
|
<div class="line"><a name="l01657"></a><span class="lineno"> 1657</span>  </div>
|
|
<div class="line"><a name="l01658"></a><span class="lineno"> 1658</span>  <span class="keywordflow">if</span> (!PickupToDeliveryLimitsRespected(delta_path_transits_, path,</div>
|
|
<div class="line"><a name="l01659"></a><span class="lineno"> 1659</span>  min_path_cumuls)) {</div>
|
|
<div class="line"><a name="l01660"></a><span class="lineno"> 1660</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01661"></a><span class="lineno"> 1661</span>  }</div>
|
|
<div class="line"><a name="l01662"></a><span class="lineno"> 1662</span>  <span class="keywordflow">if</span> (FilterSlackCost() || FilterBreakCost(vehicle) ||</div>
|
|
<div class="line"><a name="l01663"></a><span class="lineno"> 1663</span>  FilterSoftSpanCost(vehicle) || FilterSoftSpanQuadraticCost(vehicle)) {</div>
|
|
<div class="line"><a name="l01664"></a><span class="lineno"> 1664</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> slack_max = <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>;</div>
|
|
<div class="line"><a name="l01665"></a><span class="lineno"> 1665</span>  <span class="keywordflow">if</span> (vehicle_span_upper_bounds_[vehicle] < <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>) {</div>
|
|
<div class="line"><a name="l01666"></a><span class="lineno"> 1666</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> span_max = vehicle_span_upper_bounds_[vehicle];</div>
|
|
<div class="line"><a name="l01667"></a><span class="lineno"> 1667</span>  slack_max = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(slack_max, <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(span_max, total_transit));</div>
|
|
<div class="line"><a name="l01668"></a><span class="lineno"> 1668</span>  }</div>
|
|
<div class="line"><a name="l01669"></a><span class="lineno"> 1669</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> max_start_from_min_end = ComputePathMaxStartFromEndCumul(</div>
|
|
<div class="line"><a name="l01670"></a><span class="lineno"> 1670</span>  delta_path_transits_, path, path_start, min_end);</div>
|
|
<div class="line"><a name="l01671"></a><span class="lineno"> 1671</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> span_lb = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(min_end, max_start_from_min_end);</div>
|
|
<div class="line"><a name="l01672"></a><span class="lineno"> 1672</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> min_total_slack = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(span_lb, total_transit);</div>
|
|
<div class="line"><a name="l01673"></a><span class="lineno"> 1673</span>  <span class="keywordflow">if</span> (min_total_slack > slack_max) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01674"></a><span class="lineno"> 1674</span>  </div>
|
|
<div class="line"><a name="l01675"></a><span class="lineno"> 1675</span>  <span class="keywordflow">if</span> (dimension_.HasBreakConstraints()) {</div>
|
|
<div class="line"><a name="l01676"></a><span class="lineno"> 1676</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> [limit, min_break_duration] :</div>
|
|
<div class="line"><a name="l01677"></a><span class="lineno"> 1677</span>  dimension_.GetBreakDistanceDurationOfVehicle(vehicle)) {</div>
|
|
<div class="line"><a name="l01678"></a><span class="lineno"> 1678</span>  <span class="comment">// Minimal number of breaks depends on total transit:</span></div>
|
|
<div class="line"><a name="l01679"></a><span class="lineno"> 1679</span>  <span class="comment">// 0 breaks for 0 <= total transit <= limit,</span></div>
|
|
<div class="line"><a name="l01680"></a><span class="lineno"> 1680</span>  <span class="comment">// 1 break for limit + 1 <= total transit <= 2 * limit,</span></div>
|
|
<div class="line"><a name="l01681"></a><span class="lineno"> 1681</span>  <span class="comment">// i breaks for i * limit + 1 <= total transit <= (i+1) * limit, ...</span></div>
|
|
<div class="line"><a name="l01682"></a><span class="lineno"> 1682</span>  <span class="keywordflow">if</span> (limit == 0 || total_transit == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01683"></a><span class="lineno"> 1683</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_breaks_lb = (total_transit - 1) / limit;</div>
|
|
<div class="line"><a name="l01684"></a><span class="lineno"> 1684</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> slack_lb = <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(num_breaks_lb, min_break_duration);</div>
|
|
<div class="line"><a name="l01685"></a><span class="lineno"> 1685</span>  <span class="keywordflow">if</span> (slack_lb > slack_max) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01686"></a><span class="lineno"> 1686</span>  min_total_slack = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(min_total_slack, slack_lb);</div>
|
|
<div class="line"><a name="l01687"></a><span class="lineno"> 1687</span>  }</div>
|
|
<div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>  <span class="comment">// Compute a lower bound of the amount of break that must be made inside</span></div>
|
|
<div class="line"><a name="l01689"></a><span class="lineno"> 1689</span>  <span class="comment">// the route. We compute a mandatory interval (might be empty)</span></div>
|
|
<div class="line"><a name="l01690"></a><span class="lineno"> 1690</span>  <span class="comment">// [max_start, min_end[ during which the route will have to happen,</span></div>
|
|
<div class="line"><a name="l01691"></a><span class="lineno"> 1691</span>  <span class="comment">// then the duration of break that must happen during this interval.</span></div>
|
|
<div class="line"><a name="l01692"></a><span class="lineno"> 1692</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> min_total_break = 0;</div>
|
|
<div class="line"><a name="l01693"></a><span class="lineno"> 1693</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> max_path_end = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[routing_model_.End(vehicle)]->Max();</div>
|
|
<div class="line"><a name="l01694"></a><span class="lineno"> 1694</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> max_start = ComputePathMaxStartFromEndCumul(</div>
|
|
<div class="line"><a name="l01695"></a><span class="lineno"> 1695</span>  delta_path_transits_, path, path_start, max_path_end);</div>
|
|
<div class="line"><a name="l01696"></a><span class="lineno"> 1696</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntervalVar* br :</div>
|
|
<div class="line"><a name="l01697"></a><span class="lineno"> 1697</span>  dimension_.GetBreakIntervalsOfVehicle(vehicle)) {</div>
|
|
<div class="line"><a name="l01698"></a><span class="lineno"> 1698</span>  <span class="keywordflow">if</span> (!br->MustBePerformed()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01699"></a><span class="lineno"> 1699</span>  <span class="keywordflow">if</span> (max_start < br->EndMin() && br->StartMax() < min_end) {</div>
|
|
<div class="line"><a name="l01700"></a><span class="lineno"> 1700</span>  min_total_break = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(min_total_break, br->DurationMin());</div>
|
|
<div class="line"><a name="l01701"></a><span class="lineno"> 1701</span>  }</div>
|
|
<div class="line"><a name="l01702"></a><span class="lineno"> 1702</span>  }</div>
|
|
<div class="line"><a name="l01703"></a><span class="lineno"> 1703</span>  <span class="keywordflow">if</span> (min_total_break > slack_max) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01704"></a><span class="lineno"> 1704</span>  min_total_slack = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(min_total_slack, min_total_break);</div>
|
|
<div class="line"><a name="l01705"></a><span class="lineno"> 1705</span>  }</div>
|
|
<div class="line"><a name="l01706"></a><span class="lineno"> 1706</span>  <span class="keywordflow">if</span> (filter_vehicle_costs) {</div>
|
|
<div class="line"><a name="l01707"></a><span class="lineno"> 1707</span>  cumul_cost_delta = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(</div>
|
|
<div class="line"><a name="l01708"></a><span class="lineno"> 1708</span>  cumul_cost_delta,</div>
|
|
<div class="line"><a name="l01709"></a><span class="lineno"> 1709</span>  <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(vehicle_span_cost_coefficients_[vehicle], min_total_slack));</div>
|
|
<div class="line"><a name="l01710"></a><span class="lineno"> 1710</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> span_lower_bound = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(total_transit, min_total_slack);</div>
|
|
<div class="line"><a name="l01711"></a><span class="lineno"> 1711</span>  <span class="keywordflow">if</span> (FilterSoftSpanCost()) {</div>
|
|
<div class="line"><a name="l01712"></a><span class="lineno"> 1712</span>  <span class="keyword">const</span> SimpleBoundCosts::BoundCost bound_cost =</div>
|
|
<div class="line"><a name="l01713"></a><span class="lineno"> 1713</span>  dimension_.GetSoftSpanUpperBoundForVehicle(vehicle);</div>
|
|
<div class="line"><a name="l01714"></a><span class="lineno"> 1714</span>  <span class="keywordflow">if</span> (bound_cost.bound < span_lower_bound) {</div>
|
|
<div class="line"><a name="l01715"></a><span class="lineno"> 1715</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> violation = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(span_lower_bound, bound_cost.bound);</div>
|
|
<div class="line"><a name="l01716"></a><span class="lineno"> 1716</span>  cumul_cost_delta =</div>
|
|
<div class="line"><a name="l01717"></a><span class="lineno"> 1717</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(cumul_cost_delta, <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(bound_cost.cost, violation));</div>
|
|
<div class="line"><a name="l01718"></a><span class="lineno"> 1718</span>  }</div>
|
|
<div class="line"><a name="l01719"></a><span class="lineno"> 1719</span>  }</div>
|
|
<div class="line"><a name="l01720"></a><span class="lineno"> 1720</span>  <span class="keywordflow">if</span> (FilterSoftSpanQuadraticCost()) {</div>
|
|
<div class="line"><a name="l01721"></a><span class="lineno"> 1721</span>  <span class="keyword">const</span> SimpleBoundCosts::BoundCost bound_cost =</div>
|
|
<div class="line"><a name="l01722"></a><span class="lineno"> 1722</span>  dimension_.GetQuadraticCostSoftSpanUpperBoundForVehicle(vehicle);</div>
|
|
<div class="line"><a name="l01723"></a><span class="lineno"> 1723</span>  <span class="keywordflow">if</span> (bound_cost.bound < span_lower_bound) {</div>
|
|
<div class="line"><a name="l01724"></a><span class="lineno"> 1724</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> violation = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(span_lower_bound, bound_cost.bound);</div>
|
|
<div class="line"><a name="l01725"></a><span class="lineno"> 1725</span>  cumul_cost_delta =</div>
|
|
<div class="line"><a name="l01726"></a><span class="lineno"> 1726</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(cumul_cost_delta,</div>
|
|
<div class="line"><a name="l01727"></a><span class="lineno"> 1727</span>  <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(bound_cost.cost, <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(violation, violation)));</div>
|
|
<div class="line"><a name="l01728"></a><span class="lineno"> 1728</span>  }</div>
|
|
<div class="line"><a name="l01729"></a><span class="lineno"> 1729</span>  }</div>
|
|
<div class="line"><a name="l01730"></a><span class="lineno"> 1730</span>  }</div>
|
|
<div class="line"><a name="l01731"></a><span class="lineno"> 1731</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(total_transit, min_total_slack) ></div>
|
|
<div class="line"><a name="l01732"></a><span class="lineno"> 1732</span>  vehicle_span_upper_bounds_[vehicle]) {</div>
|
|
<div class="line"><a name="l01733"></a><span class="lineno"> 1733</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01734"></a><span class="lineno"> 1734</span>  }</div>
|
|
<div class="line"><a name="l01735"></a><span class="lineno"> 1735</span>  }</div>
|
|
<div class="line"><a name="l01736"></a><span class="lineno"> 1736</span>  <span class="keywordflow">if</span> (FilterCumulSoftLowerBounds() && filter_vehicle_costs) {</div>
|
|
<div class="line"><a name="l01737"></a><span class="lineno"> 1737</span>  cumul_cost_delta =</div>
|
|
<div class="line"><a name="l01738"></a><span class="lineno"> 1738</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(cumul_cost_delta,</div>
|
|
<div class="line"><a name="l01739"></a><span class="lineno"> 1739</span>  GetPathCumulSoftLowerBoundCost(delta_path_transits_, path));</div>
|
|
<div class="line"><a name="l01740"></a><span class="lineno"> 1740</span>  }</div>
|
|
<div class="line"><a name="l01741"></a><span class="lineno"> 1741</span>  <span class="keywordflow">if</span> (FilterPrecedences()) {</div>
|
|
<div class="line"><a name="l01742"></a><span class="lineno"> 1742</span>  StoreMinMaxCumulOfNodesOnPath(path, min_path_cumuls, <span class="comment">/*is_delta=*/</span><span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l01743"></a><span class="lineno"> 1743</span>  }</div>
|
|
<div class="line"><a name="l01744"></a><span class="lineno"> 1744</span>  <span class="keywordflow">if</span> (!filter_vehicle_costs) {</div>
|
|
<div class="line"><a name="l01745"></a><span class="lineno"> 1745</span>  <span class="comment">// If this route's costs should't be taken into account, reset the</span></div>
|
|
<div class="line"><a name="l01746"></a><span class="lineno"> 1746</span>  <span class="comment">// cumul_cost_delta and delta_path_transits_ for this path.</span></div>
|
|
<div class="line"><a name="l01747"></a><span class="lineno"> 1747</span>  cumul_cost_delta = 0;</div>
|
|
<div class="line"><a name="l01748"></a><span class="lineno"> 1748</span>  delta_path_transits_.ClearPath(path);</div>
|
|
<div class="line"><a name="l01749"></a><span class="lineno"> 1749</span>  }</div>
|
|
<div class="line"><a name="l01750"></a><span class="lineno"> 1750</span>  <span class="keywordflow">if</span> (FilterSpanCost() || FilterCumulSoftBounds() || FilterSlackCost() ||</div>
|
|
<div class="line"><a name="l01751"></a><span class="lineno"> 1751</span>  FilterCumulSoftLowerBounds() || FilterCumulPiecewiseLinearCosts() ||</div>
|
|
<div class="line"><a name="l01752"></a><span class="lineno"> 1752</span>  FilterSoftSpanCost(vehicle) || FilterSoftSpanQuadraticCost(vehicle)) {</div>
|
|
<div class="line"><a name="l01753"></a><span class="lineno"> 1753</span>  delta_paths_.insert(GetPath(path_start));</div>
|
|
<div class="line"><a name="l01754"></a><span class="lineno"> 1754</span>  delta_path_cumul_cost_values_[vehicle] = cumul_cost_delta;</div>
|
|
<div class="line"><a name="l01755"></a><span class="lineno"> 1755</span>  cumul_cost_delta =</div>
|
|
<div class="line"><a name="l01756"></a><span class="lineno"> 1756</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(cumul_cost_delta, current_cumul_cost_values_[path_start]);</div>
|
|
<div class="line"><a name="l01757"></a><span class="lineno"> 1757</span>  <span class="keywordflow">if</span> (filter_vehicle_costs) {</div>
|
|
<div class="line"><a name="l01758"></a><span class="lineno"> 1758</span>  delta_max_end_cumul_ = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(delta_max_end_cumul_, min_end);</div>
|
|
<div class="line"><a name="l01759"></a><span class="lineno"> 1759</span>  }</div>
|
|
<div class="line"><a name="l01760"></a><span class="lineno"> 1760</span>  }</div>
|
|
<div class="line"><a name="l01761"></a><span class="lineno"> 1761</span>  cumul_cost_delta_ = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(cumul_cost_delta_, cumul_cost_delta);</div>
|
|
<div class="line"><a name="l01762"></a><span class="lineno"> 1762</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01763"></a><span class="lineno"> 1763</span> }</div>
|
|
<div class="line"><a name="l01764"></a><span class="lineno"> 1764</span>  </div>
|
|
<div class="line"><a name="l01765"></a><span class="lineno"> 1765</span> <span class="keywordtype">bool</span> PathCumulFilter::FinalizeAcceptPath(<span class="keyword">const</span> Assignment* <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>,</div>
|
|
<div class="line"><a name="l01766"></a><span class="lineno"> 1766</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_min,</div>
|
|
<div class="line"><a name="l01767"></a><span class="lineno"> 1767</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_max) {</div>
|
|
<div class="line"><a name="l01768"></a><span class="lineno"> 1768</span>  <span class="keywordflow">if</span> ((!FilterSpanCost() && !FilterCumulSoftBounds() && !FilterSlackCost() &&</div>
|
|
<div class="line"><a name="l01769"></a><span class="lineno"> 1769</span>  !FilterCumulSoftLowerBounds() && !FilterCumulPiecewiseLinearCosts() &&</div>
|
|
<div class="line"><a name="l01770"></a><span class="lineno"> 1770</span>  !FilterPrecedences() && !FilterSoftSpanCost() &&</div>
|
|
<div class="line"><a name="l01771"></a><span class="lineno"> 1771</span>  !FilterSoftSpanQuadraticCost()) ||</div>
|
|
<div class="line"><a name="l01772"></a><span class="lineno"> 1772</span>  lns_detected_) {</div>
|
|
<div class="line"><a name="l01773"></a><span class="lineno"> 1773</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01774"></a><span class="lineno"> 1774</span>  }</div>
|
|
<div class="line"><a name="l01775"></a><span class="lineno"> 1775</span>  <span class="keywordflow">if</span> (FilterPrecedences()) {</div>
|
|
<div class="line"><a name="l01776"></a><span class="lineno"> 1776</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node : delta_nodes_with_precedences_and_changed_cumul_</div>
|
|
<div class="line"><a name="l01777"></a><span class="lineno"> 1777</span>  .PositionsSetAtLeastOnce()) {</div>
|
|
<div class="line"><a name="l01778"></a><span class="lineno"> 1778</span>  <span class="keyword">const</span> std::pair<int64, int64> node_min_max_cumul_in_delta =</div>
|
|
<div class="line"><a name="l01779"></a><span class="lineno"> 1779</span>  <a class="code" href="namespacegtl.html#abc18f60961e36340e64e428827c0e38e">gtl::FindWithDefault</a>(node_with_precedence_to_delta_min_max_cumuls_,</div>
|
|
<div class="line"><a name="l01780"></a><span class="lineno"> 1780</span>  node, {-1, -1});</div>
|
|
<div class="line"><a name="l01781"></a><span class="lineno"> 1781</span>  <span class="comment">// NOTE: This node was seen in delta, so its delta min/max cumul should be</span></div>
|
|
<div class="line"><a name="l01782"></a><span class="lineno"> 1782</span>  <span class="comment">// stored in the map.</span></div>
|
|
<div class="line"><a name="l01783"></a><span class="lineno"> 1783</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(node_min_max_cumul_in_delta.first >= 0 &&</div>
|
|
<div class="line"><a name="l01784"></a><span class="lineno"> 1784</span>  node_min_max_cumul_in_delta.second >= 0);</div>
|
|
<div class="line"><a name="l01785"></a><span class="lineno"> 1785</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> RoutingDimension::NodePrecedence& precedence :</div>
|
|
<div class="line"><a name="l01786"></a><span class="lineno"> 1786</span>  node_index_to_precedences_[node]) {</div>
|
|
<div class="line"><a name="l01787"></a><span class="lineno"> 1787</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> node_is_first = (precedence.first_node == node);</div>
|
|
<div class="line"><a name="l01788"></a><span class="lineno"> 1788</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> other_node =</div>
|
|
<div class="line"><a name="l01789"></a><span class="lineno"> 1789</span>  node_is_first ? precedence.second_node : precedence.first_node;</div>
|
|
<div class="line"><a name="l01790"></a><span class="lineno"> 1790</span>  <span class="keywordflow">if</span> (GetNext(other_node) == <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a> ||</div>
|
|
<div class="line"><a name="l01791"></a><span class="lineno"> 1791</span>  GetNext(other_node) == other_node) {</div>
|
|
<div class="line"><a name="l01792"></a><span class="lineno"> 1792</span>  <span class="comment">// The other node is unperformed, so the precedence constraint is</span></div>
|
|
<div class="line"><a name="l01793"></a><span class="lineno"> 1793</span>  <span class="comment">// inactive.</span></div>
|
|
<div class="line"><a name="l01794"></a><span class="lineno"> 1794</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01795"></a><span class="lineno"> 1795</span>  }</div>
|
|
<div class="line"><a name="l01796"></a><span class="lineno"> 1796</span>  <span class="comment">// max_cumul[second_node] should be greater or equal than</span></div>
|
|
<div class="line"><a name="l01797"></a><span class="lineno"> 1797</span>  <span class="comment">// min_cumul[first_node] + offset.</span></div>
|
|
<div class="line"><a name="l01798"></a><span class="lineno"> 1798</span>  <span class="keyword">const</span> std::pair<int64, int64>& other_min_max_cumul_in_delta =</div>
|
|
<div class="line"><a name="l01799"></a><span class="lineno"> 1799</span>  <a class="code" href="namespacegtl.html#abc18f60961e36340e64e428827c0e38e">gtl::FindWithDefault</a>(node_with_precedence_to_delta_min_max_cumuls_,</div>
|
|
<div class="line"><a name="l01800"></a><span class="lineno"> 1800</span>  other_node,</div>
|
|
<div class="line"><a name="l01801"></a><span class="lineno"> 1801</span>  current_min_max_node_cumuls_[other_node]);</div>
|
|
<div class="line"><a name="l01802"></a><span class="lineno"> 1802</span>  </div>
|
|
<div class="line"><a name="l01803"></a><span class="lineno"> 1803</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> first_min_cumul = node_is_first</div>
|
|
<div class="line"><a name="l01804"></a><span class="lineno"> 1804</span>  ? node_min_max_cumul_in_delta.first</div>
|
|
<div class="line"><a name="l01805"></a><span class="lineno"> 1805</span>  : other_min_max_cumul_in_delta.first;</div>
|
|
<div class="line"><a name="l01806"></a><span class="lineno"> 1806</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> second_max_cumul = node_is_first</div>
|
|
<div class="line"><a name="l01807"></a><span class="lineno"> 1807</span>  ? other_min_max_cumul_in_delta.second</div>
|
|
<div class="line"><a name="l01808"></a><span class="lineno"> 1808</span>  : node_min_max_cumul_in_delta.second;</div>
|
|
<div class="line"><a name="l01809"></a><span class="lineno"> 1809</span>  </div>
|
|
<div class="line"><a name="l01810"></a><span class="lineno"> 1810</span>  <span class="keywordflow">if</span> (second_max_cumul < first_min_cumul + precedence.offset) {</div>
|
|
<div class="line"><a name="l01811"></a><span class="lineno"> 1811</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01812"></a><span class="lineno"> 1812</span>  }</div>
|
|
<div class="line"><a name="l01813"></a><span class="lineno"> 1813</span>  }</div>
|
|
<div class="line"><a name="l01814"></a><span class="lineno"> 1814</span>  }</div>
|
|
<div class="line"><a name="l01815"></a><span class="lineno"> 1815</span>  }</div>
|
|
<div class="line"><a name="l01816"></a><span class="lineno"> 1816</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> new_max_end = delta_max_end_cumul_;</div>
|
|
<div class="line"><a name="l01817"></a><span class="lineno"> 1817</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> new_min_start = <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>;</div>
|
|
<div class="line"><a name="l01818"></a><span class="lineno"> 1818</span>  <span class="keywordflow">if</span> (FilterSpanCost()) {</div>
|
|
<div class="line"><a name="l01819"></a><span class="lineno"> 1819</span>  <span class="keywordflow">if</span> (new_max_end < current_max_end_.cumul_value) {</div>
|
|
<div class="line"><a name="l01820"></a><span class="lineno"> 1820</span>  <span class="comment">// Delta max end is lower than the current solution one.</span></div>
|
|
<div class="line"><a name="l01821"></a><span class="lineno"> 1821</span>  <span class="comment">// If the path supporting the current max end has been modified, we need</span></div>
|
|
<div class="line"><a name="l01822"></a><span class="lineno"> 1822</span>  <span class="comment">// to check all paths to find the largest max end.</span></div>
|
|
<div class="line"><a name="l01823"></a><span class="lineno"> 1823</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a>(delta_paths_,</div>
|
|
<div class="line"><a name="l01824"></a><span class="lineno"> 1824</span>  current_max_end_.cumul_value_support)) {</div>
|
|
<div class="line"><a name="l01825"></a><span class="lineno"> 1825</span>  new_max_end = current_max_end_.cumul_value;</div>
|
|
<div class="line"><a name="l01826"></a><span class="lineno"> 1826</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01827"></a><span class="lineno"> 1827</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < current_max_end_.path_values.size(); ++i) {</div>
|
|
<div class="line"><a name="l01828"></a><span class="lineno"> 1828</span>  <span class="keywordflow">if</span> (current_max_end_.path_values[i] > new_max_end &&</div>
|
|
<div class="line"><a name="l01829"></a><span class="lineno"> 1829</span>  !<a class="code" href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a>(delta_paths_, i)) {</div>
|
|
<div class="line"><a name="l01830"></a><span class="lineno"> 1830</span>  new_max_end = current_max_end_.path_values[i];</div>
|
|
<div class="line"><a name="l01831"></a><span class="lineno"> 1831</span>  }</div>
|
|
<div class="line"><a name="l01832"></a><span class="lineno"> 1832</span>  }</div>
|
|
<div class="line"><a name="l01833"></a><span class="lineno"> 1833</span>  }</div>
|
|
<div class="line"><a name="l01834"></a><span class="lineno"> 1834</span>  }</div>
|
|
<div class="line"><a name="l01835"></a><span class="lineno"> 1835</span>  <span class="comment">// Now that the max end cumul has been found, compute the corresponding</span></div>
|
|
<div class="line"><a name="l01836"></a><span class="lineno"> 1836</span>  <span class="comment">// min start cumul, first from the delta, then if the max end cumul has</span></div>
|
|
<div class="line"><a name="l01837"></a><span class="lineno"> 1837</span>  <span class="comment">// changed, from the unchanged paths as well.</span></div>
|
|
<div class="line"><a name="l01838"></a><span class="lineno"> 1838</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> r = 0; r < delta_path_transits_.NumPaths(); ++r) {</div>
|
|
<div class="line"><a name="l01839"></a><span class="lineno"> 1839</span>  new_min_start =</div>
|
|
<div class="line"><a name="l01840"></a><span class="lineno"> 1840</span>  <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(ComputePathMaxStartFromEndCumul(delta_path_transits_, r,</div>
|
|
<div class="line"><a name="l01841"></a><span class="lineno"> 1841</span>  Start(r), new_max_end),</div>
|
|
<div class="line"><a name="l01842"></a><span class="lineno"> 1842</span>  new_min_start);</div>
|
|
<div class="line"><a name="l01843"></a><span class="lineno"> 1843</span>  }</div>
|
|
<div class="line"><a name="l01844"></a><span class="lineno"> 1844</span>  <span class="keywordflow">if</span> (new_max_end != current_max_end_.cumul_value) {</div>
|
|
<div class="line"><a name="l01845"></a><span class="lineno"> 1845</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> r = 0; r < NumPaths(); ++r) {</div>
|
|
<div class="line"><a name="l01846"></a><span class="lineno"> 1846</span>  <span class="keywordflow">if</span> (<a class="code" href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a>(delta_paths_, r)) {</div>
|
|
<div class="line"><a name="l01847"></a><span class="lineno"> 1847</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01848"></a><span class="lineno"> 1848</span>  }</div>
|
|
<div class="line"><a name="l01849"></a><span class="lineno"> 1849</span>  new_min_start = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(new_min_start, ComputePathMaxStartFromEndCumul(</div>
|
|
<div class="line"><a name="l01850"></a><span class="lineno"> 1850</span>  current_path_transits_, r,</div>
|
|
<div class="line"><a name="l01851"></a><span class="lineno"> 1851</span>  Start(r), new_max_end));</div>
|
|
<div class="line"><a name="l01852"></a><span class="lineno"> 1852</span>  }</div>
|
|
<div class="line"><a name="l01853"></a><span class="lineno"> 1853</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (new_min_start > current_min_start_.cumul_value) {</div>
|
|
<div class="line"><a name="l01854"></a><span class="lineno"> 1854</span>  <span class="comment">// Delta min start is greater than the current solution one.</span></div>
|
|
<div class="line"><a name="l01855"></a><span class="lineno"> 1855</span>  <span class="comment">// If the path supporting the current min start has been modified, we need</span></div>
|
|
<div class="line"><a name="l01856"></a><span class="lineno"> 1856</span>  <span class="comment">// to check all paths to find the smallest min start.</span></div>
|
|
<div class="line"><a name="l01857"></a><span class="lineno"> 1857</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a>(delta_paths_,</div>
|
|
<div class="line"><a name="l01858"></a><span class="lineno"> 1858</span>  current_min_start_.cumul_value_support)) {</div>
|
|
<div class="line"><a name="l01859"></a><span class="lineno"> 1859</span>  new_min_start = current_min_start_.cumul_value;</div>
|
|
<div class="line"><a name="l01860"></a><span class="lineno"> 1860</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01861"></a><span class="lineno"> 1861</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < current_min_start_.path_values.size(); ++i) {</div>
|
|
<div class="line"><a name="l01862"></a><span class="lineno"> 1862</span>  <span class="keywordflow">if</span> (current_min_start_.path_values[i] < new_min_start &&</div>
|
|
<div class="line"><a name="l01863"></a><span class="lineno"> 1863</span>  !<a class="code" href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a>(delta_paths_, i)) {</div>
|
|
<div class="line"><a name="l01864"></a><span class="lineno"> 1864</span>  new_min_start = current_min_start_.path_values[i];</div>
|
|
<div class="line"><a name="l01865"></a><span class="lineno"> 1865</span>  }</div>
|
|
<div class="line"><a name="l01866"></a><span class="lineno"> 1866</span>  }</div>
|
|
<div class="line"><a name="l01867"></a><span class="lineno"> 1867</span>  }</div>
|
|
<div class="line"><a name="l01868"></a><span class="lineno"> 1868</span>  }</div>
|
|
<div class="line"><a name="l01869"></a><span class="lineno"> 1869</span>  }</div>
|
|
<div class="line"><a name="l01870"></a><span class="lineno"> 1870</span>  </div>
|
|
<div class="line"><a name="l01871"></a><span class="lineno"> 1871</span>  <span class="comment">// Filtering on objective value, calling LPs and MIPs if needed..</span></div>
|
|
<div class="line"><a name="l01872"></a><span class="lineno"> 1872</span>  accepted_objective_value_ =</div>
|
|
<div class="line"><a name="l01873"></a><span class="lineno"> 1873</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(cumul_cost_delta_, <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(global_span_cost_coefficient_,</div>
|
|
<div class="line"><a name="l01874"></a><span class="lineno"> 1874</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(new_max_end, new_min_start)));</div>
|
|
<div class="line"><a name="l01875"></a><span class="lineno"> 1875</span>  </div>
|
|
<div class="line"><a name="l01876"></a><span class="lineno"> 1876</span>  <span class="keywordflow">if</span> (can_use_lp_ && optimizer_ != <span class="keyword">nullptr</span> &&</div>
|
|
<div class="line"><a name="l01877"></a><span class="lineno"> 1877</span>  accepted_objective_value_ <= objective_max) {</div>
|
|
<div class="line"><a name="l01878"></a><span class="lineno"> 1878</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> num_touched_paths = GetTouchedPathStarts().size();</div>
|
|
<div class="line"><a name="l01879"></a><span class="lineno"> 1879</span>  std::vector<int64> path_delta_cost_values(num_touched_paths, 0);</div>
|
|
<div class="line"><a name="l01880"></a><span class="lineno"> 1880</span>  std::vector<bool> requires_mp(num_touched_paths, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l01881"></a><span class="lineno"> 1881</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_touched_paths; ++i) {</div>
|
|
<div class="line"><a name="l01882"></a><span class="lineno"> 1882</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> start = GetTouchedPathStarts()[i];</div>
|
|
<div class="line"><a name="l01883"></a><span class="lineno"> 1883</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = start_to_vehicle_[start];</div>
|
|
<div class="line"><a name="l01884"></a><span class="lineno"> 1884</span>  <span class="keywordflow">if</span> (!FilterWithDimensionCumulOptimizerForVehicle(vehicle)) {</div>
|
|
<div class="line"><a name="l01885"></a><span class="lineno"> 1885</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01886"></a><span class="lineno"> 1886</span>  }</div>
|
|
<div class="line"><a name="l01887"></a><span class="lineno"> 1887</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_delta_cost_with_lp = 0;</div>
|
|
<div class="line"><a name="l01888"></a><span class="lineno"> 1888</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> status =</div>
|
|
<div class="line"><a name="l01889"></a><span class="lineno"> 1889</span>  optimizer_->ComputeRouteCumulCostWithoutFixedTransits(</div>
|
|
<div class="line"><a name="l01890"></a><span class="lineno"> 1890</span>  vehicle, [<span class="keyword">this</span>](<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node) { <span class="keywordflow">return</span> GetNext(node); },</div>
|
|
<div class="line"><a name="l01891"></a><span class="lineno"> 1891</span>  &path_delta_cost_with_lp);</div>
|
|
<div class="line"><a name="l01892"></a><span class="lineno"> 1892</span>  <span class="keywordflow">if</span> (status == <a class="code" href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a2884fa43446c0cbc9c7a9b74d41d7483">DimensionSchedulingStatus::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a name="l01893"></a><span class="lineno"> 1893</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01894"></a><span class="lineno"> 1894</span>  }</div>
|
|
<div class="line"><a name="l01895"></a><span class="lineno"> 1895</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a>(delta_paths_, GetPath(start)));</div>
|
|
<div class="line"><a name="l01896"></a><span class="lineno"> 1896</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_cost_diff_with_lp = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(</div>
|
|
<div class="line"><a name="l01897"></a><span class="lineno"> 1897</span>  path_delta_cost_with_lp, delta_path_cumul_cost_values_[vehicle]);</div>
|
|
<div class="line"><a name="l01898"></a><span class="lineno"> 1898</span>  <span class="keywordflow">if</span> (path_cost_diff_with_lp > 0) {</div>
|
|
<div class="line"><a name="l01899"></a><span class="lineno"> 1899</span>  path_delta_cost_values[i] = path_delta_cost_with_lp;</div>
|
|
<div class="line"><a name="l01900"></a><span class="lineno"> 1900</span>  accepted_objective_value_ =</div>
|
|
<div class="line"><a name="l01901"></a><span class="lineno"> 1901</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(accepted_objective_value_, path_cost_diff_with_lp);</div>
|
|
<div class="line"><a name="l01902"></a><span class="lineno"> 1902</span>  <span class="keywordflow">if</span> (accepted_objective_value_ > objective_max) {</div>
|
|
<div class="line"><a name="l01903"></a><span class="lineno"> 1903</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01904"></a><span class="lineno"> 1904</span>  }</div>
|
|
<div class="line"><a name="l01905"></a><span class="lineno"> 1905</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01906"></a><span class="lineno"> 1906</span>  path_delta_cost_values[i] = delta_path_cumul_cost_values_[vehicle];</div>
|
|
<div class="line"><a name="l01907"></a><span class="lineno"> 1907</span>  }</div>
|
|
<div class="line"><a name="l01908"></a><span class="lineno"> 1908</span>  <span class="keywordflow">if</span> (mp_optimizer_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l01909"></a><span class="lineno"> 1909</span>  requires_mp[i] =</div>
|
|
<div class="line"><a name="l01910"></a><span class="lineno"> 1910</span>  FilterBreakCost(vehicle) ||</div>
|
|
<div class="line"><a name="l01911"></a><span class="lineno"> 1911</span>  (status == DimensionSchedulingStatus::RELAXED_OPTIMAL_ONLY);</div>
|
|
<div class="line"><a name="l01912"></a><span class="lineno"> 1912</span>  }</div>
|
|
<div class="line"><a name="l01913"></a><span class="lineno"> 1913</span>  }</div>
|
|
<div class="line"><a name="l01914"></a><span class="lineno"> 1914</span>  <span class="keywordflow">if</span> (mp_optimizer_ == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l01915"></a><span class="lineno"> 1915</span>  <span class="keywordflow">return</span> accepted_objective_value_ <= objective_max;</div>
|
|
<div class="line"><a name="l01916"></a><span class="lineno"> 1916</span>  }</div>
|
|
<div class="line"><a name="l01917"></a><span class="lineno"> 1917</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_touched_paths; ++i) {</div>
|
|
<div class="line"><a name="l01918"></a><span class="lineno"> 1918</span>  <span class="keywordflow">if</span> (!requires_mp[i]) {</div>
|
|
<div class="line"><a name="l01919"></a><span class="lineno"> 1919</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01920"></a><span class="lineno"> 1920</span>  }</div>
|
|
<div class="line"><a name="l01921"></a><span class="lineno"> 1921</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> start = GetTouchedPathStarts()[i];</div>
|
|
<div class="line"><a name="l01922"></a><span class="lineno"> 1922</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = start_to_vehicle_[start];</div>
|
|
<div class="line"><a name="l01923"></a><span class="lineno"> 1923</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_delta_cost_with_mp = 0;</div>
|
|
<div class="line"><a name="l01924"></a><span class="lineno"> 1924</span>  <span class="keywordflow">if</span> (mp_optimizer_->ComputeRouteCumulCostWithoutFixedTransits(</div>
|
|
<div class="line"><a name="l01925"></a><span class="lineno"> 1925</span>  vehicle, [<span class="keyword">this</span>](<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node) { return GetNext(node); },</div>
|
|
<div class="line"><a name="l01926"></a><span class="lineno"> 1926</span>  &path_delta_cost_with_mp) ==</div>
|
|
<div class="line"><a name="l01927"></a><span class="lineno"> 1927</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a2884fa43446c0cbc9c7a9b74d41d7483">DimensionSchedulingStatus::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a name="l01928"></a><span class="lineno"> 1928</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01929"></a><span class="lineno"> 1929</span>  }</div>
|
|
<div class="line"><a name="l01930"></a><span class="lineno"> 1930</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a>(delta_paths_, GetPath(start)));</div>
|
|
<div class="line"><a name="l01931"></a><span class="lineno"> 1931</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_cost_diff_with_mp =</div>
|
|
<div class="line"><a name="l01932"></a><span class="lineno"> 1932</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(path_delta_cost_with_mp, path_delta_cost_values[i]);</div>
|
|
<div class="line"><a name="l01933"></a><span class="lineno"> 1933</span>  <span class="keywordflow">if</span> (path_cost_diff_with_mp > 0) {</div>
|
|
<div class="line"><a name="l01934"></a><span class="lineno"> 1934</span>  accepted_objective_value_ =</div>
|
|
<div class="line"><a name="l01935"></a><span class="lineno"> 1935</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(accepted_objective_value_, path_cost_diff_with_mp);</div>
|
|
<div class="line"><a name="l01936"></a><span class="lineno"> 1936</span>  <span class="keywordflow">if</span> (accepted_objective_value_ > objective_max) {</div>
|
|
<div class="line"><a name="l01937"></a><span class="lineno"> 1937</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01938"></a><span class="lineno"> 1938</span>  }</div>
|
|
<div class="line"><a name="l01939"></a><span class="lineno"> 1939</span>  }</div>
|
|
<div class="line"><a name="l01940"></a><span class="lineno"> 1940</span>  }</div>
|
|
<div class="line"><a name="l01941"></a><span class="lineno"> 1941</span>  }</div>
|
|
<div class="line"><a name="l01942"></a><span class="lineno"> 1942</span>  </div>
|
|
<div class="line"><a name="l01943"></a><span class="lineno"> 1943</span>  <span class="keywordflow">return</span> accepted_objective_value_ <= objective_max;</div>
|
|
<div class="line"><a name="l01944"></a><span class="lineno"> 1944</span> }</div>
|
|
<div class="line"><a name="l01945"></a><span class="lineno"> 1945</span>  </div>
|
|
<div class="line"><a name="l01946"></a><span class="lineno"> 1946</span> <span class="keywordtype">void</span> PathCumulFilter::InitializeSupportedPathCumul(</div>
|
|
<div class="line"><a name="l01947"></a><span class="lineno"> 1947</span>  SupportedPathCumul* supported_cumul, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> default_value) {</div>
|
|
<div class="line"><a name="l01948"></a><span class="lineno"> 1948</span>  supported_cumul->cumul_value = default_value;</div>
|
|
<div class="line"><a name="l01949"></a><span class="lineno"> 1949</span>  supported_cumul->cumul_value_support = -1;</div>
|
|
<div class="line"><a name="l01950"></a><span class="lineno"> 1950</span>  supported_cumul->path_values.resize(NumPaths(), default_value);</div>
|
|
<div class="line"><a name="l01951"></a><span class="lineno"> 1951</span> }</div>
|
|
<div class="line"><a name="l01952"></a><span class="lineno"> 1952</span>  </div>
|
|
<div class="line"><a name="l01953"></a><span class="lineno"> 1953</span> <span class="keywordtype">bool</span> PathCumulFilter::PickupToDeliveryLimitsRespected(</div>
|
|
<div class="line"><a name="l01954"></a><span class="lineno"> 1954</span>  <span class="keyword">const</span> PathTransits& path_transits, <span class="keywordtype">int</span> path,</div>
|
|
<div class="line"><a name="l01955"></a><span class="lineno"> 1955</span>  <span class="keyword">const</span> std::vector<int64>& min_path_cumuls)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01956"></a><span class="lineno"> 1956</span>  <span class="keywordflow">if</span> (!dimension_.HasPickupToDeliveryLimits()) {</div>
|
|
<div class="line"><a name="l01957"></a><span class="lineno"> 1957</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01958"></a><span class="lineno"> 1958</span>  }</div>
|
|
<div class="line"><a name="l01959"></a><span class="lineno"> 1959</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_pairs = routing_model_.GetPickupAndDeliveryPairs().size();</div>
|
|
<div class="line"><a name="l01960"></a><span class="lineno"> 1960</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(num_pairs, 0);</div>
|
|
<div class="line"><a name="l01961"></a><span class="lineno"> 1961</span>  std::vector<std::pair<int, int64>> visited_delivery_and_min_cumul_per_pair(</div>
|
|
<div class="line"><a name="l01962"></a><span class="lineno"> 1962</span>  num_pairs, {-1, -1});</div>
|
|
<div class="line"><a name="l01963"></a><span class="lineno"> 1963</span>  </div>
|
|
<div class="line"><a name="l01964"></a><span class="lineno"> 1964</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> path_size = path_transits.PathSize(path);</div>
|
|
<div class="line"><a name="l01965"></a><span class="lineno"> 1965</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(min_path_cumuls.size(), path_size);</div>
|
|
<div class="line"><a name="l01966"></a><span class="lineno"> 1966</span>  </div>
|
|
<div class="line"><a name="l01967"></a><span class="lineno"> 1967</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> max_cumul = min_path_cumuls.back();</div>
|
|
<div class="line"><a name="l01968"></a><span class="lineno"> 1968</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = path_transits.PathSize(path) - 2; i >= 0; i--) {</div>
|
|
<div class="line"><a name="l01969"></a><span class="lineno"> 1969</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> node_index = path_transits.Node(path, i);</div>
|
|
<div class="line"><a name="l01970"></a><span class="lineno"> 1970</span>  max_cumul = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(max_cumul, path_transits.Transit(path, i));</div>
|
|
<div class="line"><a name="l01971"></a><span class="lineno"> 1971</span>  max_cumul = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(<a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[node_index]->Max(), max_cumul);</div>
|
|
<div class="line"><a name="l01972"></a><span class="lineno"> 1972</span>  </div>
|
|
<div class="line"><a name="l01973"></a><span class="lineno"> 1973</span>  <span class="keyword">const</span> std::vector<std::pair<int, int>>& pickup_index_pairs =</div>
|
|
<div class="line"><a name="l01974"></a><span class="lineno"> 1974</span>  routing_model_.GetPickupIndexPairs(node_index);</div>
|
|
<div class="line"><a name="l01975"></a><span class="lineno"> 1975</span>  <span class="keyword">const</span> std::vector<std::pair<int, int>>& delivery_index_pairs =</div>
|
|
<div class="line"><a name="l01976"></a><span class="lineno"> 1976</span>  routing_model_.GetDeliveryIndexPairs(node_index);</div>
|
|
<div class="line"><a name="l01977"></a><span class="lineno"> 1977</span>  <span class="keywordflow">if</span> (!pickup_index_pairs.empty()) {</div>
|
|
<div class="line"><a name="l01978"></a><span class="lineno"> 1978</span>  <span class="comment">// The node is a pickup. Check that it is not a delivery and that it</span></div>
|
|
<div class="line"><a name="l01979"></a><span class="lineno"> 1979</span>  <span class="comment">// appears in a single pickup/delivery pair (as required when limits are</span></div>
|
|
<div class="line"><a name="l01980"></a><span class="lineno"> 1980</span>  <span class="comment">// set on dimension cumuls for pickup and deliveries).</span></div>
|
|
<div class="line"><a name="l01981"></a><span class="lineno"> 1981</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(delivery_index_pairs.empty());</div>
|
|
<div class="line"><a name="l01982"></a><span class="lineno"> 1982</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(pickup_index_pairs.size(), 1);</div>
|
|
<div class="line"><a name="l01983"></a><span class="lineno"> 1983</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> pair_index = pickup_index_pairs[0].first;</div>
|
|
<div class="line"><a name="l01984"></a><span class="lineno"> 1984</span>  <span class="comment">// Get the delivery visited for this pair.</span></div>
|
|
<div class="line"><a name="l01985"></a><span class="lineno"> 1985</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> delivery_index =</div>
|
|
<div class="line"><a name="l01986"></a><span class="lineno"> 1986</span>  visited_delivery_and_min_cumul_per_pair[pair_index].first;</div>
|
|
<div class="line"><a name="l01987"></a><span class="lineno"> 1987</span>  <span class="keywordflow">if</span> (delivery_index < 0) {</div>
|
|
<div class="line"><a name="l01988"></a><span class="lineno"> 1988</span>  <span class="comment">// No delivery visited after this pickup for this pickup/delivery pair.</span></div>
|
|
<div class="line"><a name="l01989"></a><span class="lineno"> 1989</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01990"></a><span class="lineno"> 1990</span>  }</div>
|
|
<div class="line"><a name="l01991"></a><span class="lineno"> 1991</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_diff_limit = dimension_.GetPickupToDeliveryLimitForPair(</div>
|
|
<div class="line"><a name="l01992"></a><span class="lineno"> 1992</span>  pair_index, pickup_index_pairs[0].second, delivery_index);</div>
|
|
<div class="line"><a name="l01993"></a><span class="lineno"> 1993</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(visited_delivery_and_min_cumul_per_pair[pair_index].second,</div>
|
|
<div class="line"><a name="l01994"></a><span class="lineno"> 1994</span>  max_cumul) > cumul_diff_limit) {</div>
|
|
<div class="line"><a name="l01995"></a><span class="lineno"> 1995</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01996"></a><span class="lineno"> 1996</span>  }</div>
|
|
<div class="line"><a name="l01997"></a><span class="lineno"> 1997</span>  }</div>
|
|
<div class="line"><a name="l01998"></a><span class="lineno"> 1998</span>  <span class="keywordflow">if</span> (!delivery_index_pairs.empty()) {</div>
|
|
<div class="line"><a name="l01999"></a><span class="lineno"> 1999</span>  <span class="comment">// The node is a delivery. Check that it's not a pickup and it belongs to</span></div>
|
|
<div class="line"><a name="l02000"></a><span class="lineno"> 2000</span>  <span class="comment">// a single pair.</span></div>
|
|
<div class="line"><a name="l02001"></a><span class="lineno"> 2001</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(pickup_index_pairs.empty());</div>
|
|
<div class="line"><a name="l02002"></a><span class="lineno"> 2002</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(delivery_index_pairs.size(), 1);</div>
|
|
<div class="line"><a name="l02003"></a><span class="lineno"> 2003</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> pair_index = delivery_index_pairs[0].first;</div>
|
|
<div class="line"><a name="l02004"></a><span class="lineno"> 2004</span>  std::pair<int, int64>& delivery_index_and_cumul =</div>
|
|
<div class="line"><a name="l02005"></a><span class="lineno"> 2005</span>  visited_delivery_and_min_cumul_per_pair[pair_index];</div>
|
|
<div class="line"><a name="l02006"></a><span class="lineno"> 2006</span>  <span class="keywordtype">int</span>& delivery_index = delivery_index_and_cumul.first;</div>
|
|
<div class="line"><a name="l02007"></a><span class="lineno"> 2007</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(delivery_index, -1);</div>
|
|
<div class="line"><a name="l02008"></a><span class="lineno"> 2008</span>  delivery_index = delivery_index_pairs[0].second;</div>
|
|
<div class="line"><a name="l02009"></a><span class="lineno"> 2009</span>  delivery_index_and_cumul.second = min_path_cumuls[i];</div>
|
|
<div class="line"><a name="l02010"></a><span class="lineno"> 2010</span>  }</div>
|
|
<div class="line"><a name="l02011"></a><span class="lineno"> 2011</span>  }</div>
|
|
<div class="line"><a name="l02012"></a><span class="lineno"> 2012</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02013"></a><span class="lineno"> 2013</span> }</div>
|
|
<div class="line"><a name="l02014"></a><span class="lineno"> 2014</span>  </div>
|
|
<div class="line"><a name="l02015"></a><span class="lineno"> 2015</span> <span class="keywordtype">void</span> PathCumulFilter::StoreMinMaxCumulOfNodesOnPath(</div>
|
|
<div class="line"><a name="l02016"></a><span class="lineno"> 2016</span>  <span class="keywordtype">int</span> path, <span class="keyword">const</span> std::vector<int64>& min_path_cumuls, <span class="keywordtype">bool</span> is_delta) {</div>
|
|
<div class="line"><a name="l02017"></a><span class="lineno"> 2017</span>  <span class="keyword">const</span> PathTransits& path_transits =</div>
|
|
<div class="line"><a name="l02018"></a><span class="lineno"> 2018</span>  is_delta ? delta_path_transits_ : current_path_transits_;</div>
|
|
<div class="line"><a name="l02019"></a><span class="lineno"> 2019</span>  </div>
|
|
<div class="line"><a name="l02020"></a><span class="lineno"> 2020</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> path_size = path_transits.PathSize(path);</div>
|
|
<div class="line"><a name="l02021"></a><span class="lineno"> 2021</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(min_path_cumuls.size(), path_size);</div>
|
|
<div class="line"><a name="l02022"></a><span class="lineno"> 2022</span>  </div>
|
|
<div class="line"><a name="l02023"></a><span class="lineno"> 2023</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> max_cumul = <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[path_transits.Node(path, path_size - 1)]->Max();</div>
|
|
<div class="line"><a name="l02024"></a><span class="lineno"> 2024</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = path_size - 1; i >= 0; i--) {</div>
|
|
<div class="line"><a name="l02025"></a><span class="lineno"> 2025</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> node_index = path_transits.Node(path, i);</div>
|
|
<div class="line"><a name="l02026"></a><span class="lineno"> 2026</span>  </div>
|
|
<div class="line"><a name="l02027"></a><span class="lineno"> 2027</span>  <span class="keywordflow">if</span> (i < path_size - 1) {</div>
|
|
<div class="line"><a name="l02028"></a><span class="lineno"> 2028</span>  max_cumul = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(max_cumul, path_transits.Transit(path, i));</div>
|
|
<div class="line"><a name="l02029"></a><span class="lineno"> 2029</span>  max_cumul = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(<a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[node_index]->Max(), max_cumul);</div>
|
|
<div class="line"><a name="l02030"></a><span class="lineno"> 2030</span>  }</div>
|
|
<div class="line"><a name="l02031"></a><span class="lineno"> 2031</span>  </div>
|
|
<div class="line"><a name="l02032"></a><span class="lineno"> 2032</span>  <span class="keywordflow">if</span> (is_delta && node_index_to_precedences_[node_index].empty()) {</div>
|
|
<div class="line"><a name="l02033"></a><span class="lineno"> 2033</span>  <span class="comment">// No need to update the delta cumul map for nodes without precedences.</span></div>
|
|
<div class="line"><a name="l02034"></a><span class="lineno"> 2034</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02035"></a><span class="lineno"> 2035</span>  }</div>
|
|
<div class="line"><a name="l02036"></a><span class="lineno"> 2036</span>  </div>
|
|
<div class="line"><a name="l02037"></a><span class="lineno"> 2037</span>  std::pair<int64, int64>& min_max_cumuls =</div>
|
|
<div class="line"><a name="l02038"></a><span class="lineno"> 2038</span>  is_delta ? node_with_precedence_to_delta_min_max_cumuls_[node_index]</div>
|
|
<div class="line"><a name="l02039"></a><span class="lineno"> 2039</span>  : current_min_max_node_cumuls_[node_index];</div>
|
|
<div class="line"><a name="l02040"></a><span class="lineno"> 2040</span>  min_max_cumuls.first = min_path_cumuls[i];</div>
|
|
<div class="line"><a name="l02041"></a><span class="lineno"> 2041</span>  min_max_cumuls.second = max_cumul;</div>
|
|
<div class="line"><a name="l02042"></a><span class="lineno"> 2042</span>  </div>
|
|
<div class="line"><a name="l02043"></a><span class="lineno"> 2043</span>  <span class="keywordflow">if</span> (is_delta && !routing_model_.IsEnd(node_index) &&</div>
|
|
<div class="line"><a name="l02044"></a><span class="lineno"> 2044</span>  (min_max_cumuls.first !=</div>
|
|
<div class="line"><a name="l02045"></a><span class="lineno"> 2045</span>  current_min_max_node_cumuls_[node_index].first ||</div>
|
|
<div class="line"><a name="l02046"></a><span class="lineno"> 2046</span>  max_cumul != current_min_max_node_cumuls_[node_index].second)) {</div>
|
|
<div class="line"><a name="l02047"></a><span class="lineno"> 2047</span>  delta_nodes_with_precedences_and_changed_cumul_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(node_index);</div>
|
|
<div class="line"><a name="l02048"></a><span class="lineno"> 2048</span>  }</div>
|
|
<div class="line"><a name="l02049"></a><span class="lineno"> 2049</span>  }</div>
|
|
<div class="line"><a name="l02050"></a><span class="lineno"> 2050</span> }</div>
|
|
<div class="line"><a name="l02051"></a><span class="lineno"> 2051</span>  </div>
|
|
<div class="line"><a name="l02052"></a><span class="lineno"> 2052</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> PathCumulFilter::ComputePathMaxStartFromEndCumul(</div>
|
|
<div class="line"><a name="l02053"></a><span class="lineno"> 2053</span>  <span class="keyword">const</span> PathTransits& path_transits, <span class="keywordtype">int</span> path, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_start,</div>
|
|
<div class="line"><a name="l02054"></a><span class="lineno"> 2054</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> min_end_cumul)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l02055"></a><span class="lineno"> 2055</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_from_min_end = min_end_cumul;</div>
|
|
<div class="line"><a name="l02056"></a><span class="lineno"> 2056</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_from_max_end =</div>
|
|
<div class="line"><a name="l02057"></a><span class="lineno"> 2057</span>  <a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[routing_model_.End(start_to_vehicle_[path_start])]->Max();</div>
|
|
<div class="line"><a name="l02058"></a><span class="lineno"> 2058</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = path_transits.PathSize(path) - 2; i >= 0; --i) {</div>
|
|
<div class="line"><a name="l02059"></a><span class="lineno"> 2059</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> transit = path_transits.Transit(path, i);</div>
|
|
<div class="line"><a name="l02060"></a><span class="lineno"> 2060</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = path_transits.Node(path, i);</div>
|
|
<div class="line"><a name="l02061"></a><span class="lineno"> 2061</span>  cumul_from_min_end =</div>
|
|
<div class="line"><a name="l02062"></a><span class="lineno"> 2062</span>  <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(<a class="code" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[node]->Max(), <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(cumul_from_min_end, transit));</div>
|
|
<div class="line"><a name="l02063"></a><span class="lineno"> 2063</span>  cumul_from_max_end = dimension_.GetLastPossibleLessOrEqualValueForNode(</div>
|
|
<div class="line"><a name="l02064"></a><span class="lineno"> 2064</span>  node, <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(cumul_from_max_end, transit));</div>
|
|
<div class="line"><a name="l02065"></a><span class="lineno"> 2065</span>  }</div>
|
|
<div class="line"><a name="l02066"></a><span class="lineno"> 2066</span>  <span class="keywordflow">return</span> <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(cumul_from_min_end, cumul_from_max_end);</div>
|
|
<div class="line"><a name="l02067"></a><span class="lineno"> 2067</span> }</div>
|
|
<div class="line"><a name="l02068"></a><span class="lineno"> 2068</span>  </div>
|
|
<div class="line"><a name="l02069"></a><span class="lineno"> 2069</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l02070"></a><span class="lineno"> 2070</span>  </div>
|
|
<div class="line"><a name="l02071"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a216af1fa4181c4020916828eeeba1591"> 2071</a></span> <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html">IntVarLocalSearchFilter</a>* <a class="code" href="namespaceoperations__research.html#a216af1fa4181c4020916828eeeba1591">MakePathCumulFilter</a>(</div>
|
|
<div class="line"><a name="l02072"></a><span class="lineno"> 2072</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>& dimension,</div>
|
|
<div class="line"><a name="l02073"></a><span class="lineno"> 2073</span>  <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="l02074"></a><span class="lineno"> 2074</span>  <span class="keywordtype">bool</span> propagate_own_objective_value, <span class="keywordtype">bool</span> filter_objective_cost,</div>
|
|
<div class="line"><a name="l02075"></a><span class="lineno"> 2075</span>  <span class="keywordtype">bool</span> can_use_lp) {</div>
|
|
<div class="line"><a name="l02076"></a><span class="lineno"> 2076</span>  <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>& <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a> = *dimension.<a class="code" href="classoperations__research_1_1_routing_dimension.html#a35a576bb3ea6814f122593d44a3c391e">model</a>();</div>
|
|
<div class="line"><a name="l02077"></a><span class="lineno"> 2077</span>  <span class="keywordflow">return</span> <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.solver()->RevAlloc(<span class="keyword">new</span> PathCumulFilter(</div>
|
|
<div class="line"><a name="l02078"></a><span class="lineno"> 2078</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, dimension, <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>, propagate_own_objective_value,</div>
|
|
<div class="line"><a name="l02079"></a><span class="lineno"> 2079</span>  filter_objective_cost, can_use_lp));</div>
|
|
<div class="line"><a name="l02080"></a><span class="lineno"> 2080</span> }</div>
|
|
<div class="line"><a name="l02081"></a><span class="lineno"> 2081</span>  </div>
|
|
<div class="line"><a name="l02082"></a><span class="lineno"> 2082</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l02083"></a><span class="lineno"> 2083</span>  </div>
|
|
<div class="line"><a name="l02084"></a><span class="lineno"> 2084</span> <span class="keywordtype">bool</span> DimensionHasCumulCost(<span class="keyword">const</span> RoutingDimension& dimension) {</div>
|
|
<div class="line"><a name="l02085"></a><span class="lineno"> 2085</span>  <span class="keywordflow">if</span> (dimension.global_span_cost_coefficient() != 0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02086"></a><span class="lineno"> 2086</span>  <span class="keywordflow">if</span> (dimension.HasSoftSpanUpperBounds()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02087"></a><span class="lineno"> 2087</span>  <span class="keywordflow">if</span> (dimension.HasQuadraticCostSoftSpanUpperBounds()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02088"></a><span class="lineno"> 2088</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a> : dimension.vehicle_span_cost_coefficients()) {</div>
|
|
<div class="line"><a name="l02089"></a><span class="lineno"> 2089</span>  <span class="keywordflow">if</span> (<a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a> != 0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02090"></a><span class="lineno"> 2090</span>  }</div>
|
|
<div class="line"><a name="l02091"></a><span class="lineno"> 2091</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < dimension.cumuls().size(); ++i) {</div>
|
|
<div class="line"><a name="l02092"></a><span class="lineno"> 2092</span>  <span class="keywordflow">if</span> (dimension.HasCumulVarSoftUpperBound(i)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02093"></a><span class="lineno"> 2093</span>  <span class="keywordflow">if</span> (dimension.HasCumulVarSoftLowerBound(i)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02094"></a><span class="lineno"> 2094</span>  <span class="keywordflow">if</span> (dimension.HasCumulVarPiecewiseLinearCost(i)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02095"></a><span class="lineno"> 2095</span>  }</div>
|
|
<div class="line"><a name="l02096"></a><span class="lineno"> 2096</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02097"></a><span class="lineno"> 2097</span> }</div>
|
|
<div class="line"><a name="l02098"></a><span class="lineno"> 2098</span>  </div>
|
|
<div class="line"><a name="l02099"></a><span class="lineno"> 2099</span> <span class="keywordtype">bool</span> DimensionHasCumulConstraint(<span class="keyword">const</span> RoutingDimension& dimension) {</div>
|
|
<div class="line"><a name="l02100"></a><span class="lineno"> 2100</span>  <span class="keywordflow">if</span> (dimension.HasBreakConstraints()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02101"></a><span class="lineno"> 2101</span>  <span class="keywordflow">if</span> (dimension.HasPickupToDeliveryLimits()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02102"></a><span class="lineno"> 2102</span>  <span class="keywordflow">if</span> (!dimension.GetNodePrecedences().empty()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02103"></a><span class="lineno"> 2103</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> upper_bound : dimension.vehicle_span_upper_bounds()) {</div>
|
|
<div class="line"><a name="l02104"></a><span class="lineno"> 2104</span>  <span class="keywordflow">if</span> (upper_bound != <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02105"></a><span class="lineno"> 2105</span>  }</div>
|
|
<div class="line"><a name="l02106"></a><span class="lineno"> 2106</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntVar* <span class="keyword">const</span> slack : dimension.slacks()) {</div>
|
|
<div class="line"><a name="l02107"></a><span class="lineno"> 2107</span>  <span class="keywordflow">if</span> (slack->Min() > 0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02108"></a><span class="lineno"> 2108</span>  }</div>
|
|
<div class="line"><a name="l02109"></a><span class="lineno"> 2109</span>  <span class="keyword">const</span> std::vector<IntVar*>& cumuls = dimension.cumuls();</div>
|
|
<div class="line"><a name="l02110"></a><span class="lineno"> 2110</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < cumuls.size(); ++i) {</div>
|
|
<div class="line"><a name="l02111"></a><span class="lineno"> 2111</span>  IntVar* <span class="keyword">const</span> cumul_var = cumuls[i];</div>
|
|
<div class="line"><a name="l02112"></a><span class="lineno"> 2112</span>  <span class="keywordflow">if</span> (cumul_var->Min() > 0 && cumul_var->Max() < <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a> &&</div>
|
|
<div class="line"><a name="l02113"></a><span class="lineno"> 2113</span>  !dimension.model()->IsEnd(i)) {</div>
|
|
<div class="line"><a name="l02114"></a><span class="lineno"> 2114</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02115"></a><span class="lineno"> 2115</span>  }</div>
|
|
<div class="line"><a name="l02116"></a><span class="lineno"> 2116</span>  <span class="keywordflow">if</span> (dimension.forbidden_intervals()[i].NumIntervals() > 0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02117"></a><span class="lineno"> 2117</span>  }</div>
|
|
<div class="line"><a name="l02118"></a><span class="lineno"> 2118</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02119"></a><span class="lineno"> 2119</span> }</div>
|
|
<div class="line"><a name="l02120"></a><span class="lineno"> 2120</span>  </div>
|
|
<div class="line"><a name="l02121"></a><span class="lineno"> 2121</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l02122"></a><span class="lineno"> 2122</span>  </div>
|
|
<div class="line"><a name="l02123"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ae2219dbffeee11e9bca17cc1e8217747"> 2123</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research.html#ae2219dbffeee11e9bca17cc1e8217747">AppendLightWeightDimensionFilters</a>(</div>
|
|
<div class="line"><a name="l02124"></a><span class="lineno"> 2124</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_path_state.html">PathState</a>* path_state,</div>
|
|
<div class="line"><a name="l02125"></a><span class="lineno"> 2125</span>  <span class="keyword">const</span> std::vector<RoutingDimension*>& dimensions,</div>
|
|
<div class="line"><a name="l02126"></a><span class="lineno"> 2126</span>  std::vector<LocalSearchFilterManager::FilterEvent>* filters) {</div>
|
|
<div class="line"><a name="l02127"></a><span class="lineno"> 2127</span>  <span class="comment">// For every dimension that fits, add a UnaryDimensionChecker.</span></div>
|
|
<div class="line"><a name="l02128"></a><span class="lineno"> 2128</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* dimension : dimensions) {</div>
|
|
<div class="line"><a name="l02129"></a><span class="lineno"> 2129</span>  <span class="comment">// Skip dimension if not unary.</span></div>
|
|
<div class="line"><a name="l02130"></a><span class="lineno"> 2130</span>  <span class="keywordflow">if</span> (dimension->GetUnaryTransitEvaluator(0) == <span class="keyword">nullptr</span>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02131"></a><span class="lineno"> 2131</span>  </div>
|
|
<div class="line"><a name="l02132"></a><span class="lineno"> 2132</span>  <span class="keyword">using</span> Intervals = std::vector<UnaryDimensionChecker::Interval>;</div>
|
|
<div class="line"><a name="l02133"></a><span class="lineno"> 2133</span>  <span class="comment">// Fill path capacities and classes.</span></div>
|
|
<div class="line"><a name="l02134"></a><span class="lineno"> 2134</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vehicles = dimension->model()->vehicles();</div>
|
|
<div class="line"><a name="l02135"></a><span class="lineno"> 2135</span>  Intervals path_capacity(num_vehicles);</div>
|
|
<div class="line"><a name="l02136"></a><span class="lineno"> 2136</span>  std::vector<int> path_class(num_vehicles);</div>
|
|
<div class="line"><a name="l02137"></a><span class="lineno"> 2137</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> v = 0; v < num_vehicles; ++v) {</div>
|
|
<div class="line"><a name="l02138"></a><span class="lineno"> 2138</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& vehicle_capacities = dimension->vehicle_capacities();</div>
|
|
<div class="line"><a name="l02139"></a><span class="lineno"> 2139</span>  path_capacity[v] = {0, vehicle_capacities[v]};</div>
|
|
<div class="line"><a name="l02140"></a><span class="lineno"> 2140</span>  path_class[v] = dimension->vehicle_to_class(v);</div>
|
|
<div class="line"><a name="l02141"></a><span class="lineno"> 2141</span>  }</div>
|
|
<div class="line"><a name="l02142"></a><span class="lineno"> 2142</span>  <span class="comment">// For each class, retrieve the demands of each node.</span></div>
|
|
<div class="line"><a name="l02143"></a><span class="lineno"> 2143</span>  <span class="comment">// Dimension store evaluators with a double indirection for compacity:</span></div>
|
|
<div class="line"><a name="l02144"></a><span class="lineno"> 2144</span>  <span class="comment">// vehicle -> vehicle_class -> evaluator_index.</span></div>
|
|
<div class="line"><a name="l02145"></a><span class="lineno"> 2145</span>  <span class="comment">// We replicate this in UnaryDimensionChecker,</span></div>
|
|
<div class="line"><a name="l02146"></a><span class="lineno"> 2146</span>  <span class="comment">// except we expand evaluator_index to an array of values for all nodes.</span></div>
|
|
<div class="line"><a name="l02147"></a><span class="lineno"> 2147</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vehicle_classes =</div>
|
|
<div class="line"><a name="l02148"></a><span class="lineno"> 2148</span>  1 + *std::max_element(path_class.begin(), path_class.end());</div>
|
|
<div class="line"><a name="l02149"></a><span class="lineno"> 2149</span>  std::vector<Intervals> demands(num_vehicle_classes);</div>
|
|
<div class="line"><a name="l02150"></a><span class="lineno"> 2150</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_cumuls = dimension->cumuls().size();</div>
|
|
<div class="line"><a name="l02151"></a><span class="lineno"> 2151</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_slacks = dimension->slacks().size();</div>
|
|
<div class="line"><a name="l02152"></a><span class="lineno"> 2152</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < num_vehicles; ++vehicle) {</div>
|
|
<div class="line"><a name="l02153"></a><span class="lineno"> 2153</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle_class = path_class[vehicle];</div>
|
|
<div class="line"><a name="l02154"></a><span class="lineno"> 2154</span>  <span class="keywordflow">if</span> (!demands[vehicle_class].empty()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02155"></a><span class="lineno"> 2155</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& evaluator = dimension->GetUnaryTransitEvaluator(vehicle);</div>
|
|
<div class="line"><a name="l02156"></a><span class="lineno"> 2156</span>  Intervals class_demands(num_cumuls);</div>
|
|
<div class="line"><a name="l02157"></a><span class="lineno"> 2157</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < num_cumuls; ++node) {</div>
|
|
<div class="line"><a name="l02158"></a><span class="lineno"> 2158</span>  <span class="keywordflow">if</span> (node < num_slacks) {</div>
|
|
<div class="line"><a name="l02159"></a><span class="lineno"> 2159</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> demand_min = evaluator(node);</div>
|
|
<div class="line"><a name="l02160"></a><span class="lineno"> 2160</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> slack_max = dimension->SlackVar(node)->Max();</div>
|
|
<div class="line"><a name="l02161"></a><span class="lineno"> 2161</span>  class_demands[node] = {demand_min, <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(demand_min, slack_max)};</div>
|
|
<div class="line"><a name="l02162"></a><span class="lineno"> 2162</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02163"></a><span class="lineno"> 2163</span>  class_demands[node] = {0, 0};</div>
|
|
<div class="line"><a name="l02164"></a><span class="lineno"> 2164</span>  }</div>
|
|
<div class="line"><a name="l02165"></a><span class="lineno"> 2165</span>  }</div>
|
|
<div class="line"><a name="l02166"></a><span class="lineno"> 2166</span>  demands[vehicle_class] = std::move(class_demands);</div>
|
|
<div class="line"><a name="l02167"></a><span class="lineno"> 2167</span>  }</div>
|
|
<div class="line"><a name="l02168"></a><span class="lineno"> 2168</span>  <span class="comment">// Fill node capacities.</span></div>
|
|
<div class="line"><a name="l02169"></a><span class="lineno"> 2169</span>  Intervals node_capacity(num_cumuls);</div>
|
|
<div class="line"><a name="l02170"></a><span class="lineno"> 2170</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < num_cumuls; ++node) {</div>
|
|
<div class="line"><a name="l02171"></a><span class="lineno"> 2171</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_int_var.html">IntVar</a>* cumul = dimension->CumulVar(node);</div>
|
|
<div class="line"><a name="l02172"></a><span class="lineno"> 2172</span>  node_capacity[node] = {cumul-><a class="code" href="classoperations__research_1_1_int_expr.html#ac4a4f30badcd311075302a4efcfaee0a">Min</a>(), cumul-><a class="code" href="classoperations__research_1_1_int_expr.html#a6dc4d5cdc2ed0da18452a65c5bf69e0d">Max</a>()};</div>
|
|
<div class="line"><a name="l02173"></a><span class="lineno"> 2173</span>  }</div>
|
|
<div class="line"><a name="l02174"></a><span class="lineno"> 2174</span>  <span class="comment">// Make the dimension checker and pass ownership to the filter.</span></div>
|
|
<div class="line"><a name="l02175"></a><span class="lineno"> 2175</span>  <span class="keyword">auto</span> checker = absl::make_unique<UnaryDimensionChecker>(</div>
|
|
<div class="line"><a name="l02176"></a><span class="lineno"> 2176</span>  path_state, std::move(path_capacity), std::move(path_class),</div>
|
|
<div class="line"><a name="l02177"></a><span class="lineno"> 2177</span>  std::move(demands), std::move(node_capacity));</div>
|
|
<div class="line"><a name="l02178"></a><span class="lineno"> 2178</span>  <span class="keyword">const</span> <span class="keyword">auto</span> kAccept = LocalSearchFilterManager::FilterEventType::kAccept;</div>
|
|
<div class="line"><a name="l02179"></a><span class="lineno"> 2179</span>  <a class="code" href="classoperations__research_1_1_local_search_filter.html">LocalSearchFilter</a>* filter = <a class="code" href="namespaceoperations__research.html#ac2bc88830e25267bc0c6a662c1aaa814">MakeUnaryDimensionFilter</a>(</div>
|
|
<div class="line"><a name="l02180"></a><span class="lineno"> 2180</span>  dimension->model()->solver(), std::move(checker));</div>
|
|
<div class="line"><a name="l02181"></a><span class="lineno"> 2181</span>  filters->push_back({filter, kAccept});</div>
|
|
<div class="line"><a name="l02182"></a><span class="lineno"> 2182</span>  }</div>
|
|
<div class="line"><a name="l02183"></a><span class="lineno"> 2183</span> }</div>
|
|
<div class="line"><a name="l02184"></a><span class="lineno"> 2184</span>  </div>
|
|
<div class="line"><a name="l02185"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_dimension.html#a0e3e4445c55d0c59ef4edbaf7acbd3a8"> 2185</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research.html#a0e3e4445c55d0c59ef4edbaf7acbd3a8">AppendDimensionCumulFilters</a>(</div>
|
|
<div class="line"><a name="l02186"></a><span class="lineno"> 2186</span>  <span class="keyword">const</span> std::vector<RoutingDimension*>& dimensions,</div>
|
|
<div class="line"><a name="l02187"></a><span class="lineno"> 2187</span>  <span class="keyword">const</span> RoutingSearchParameters& <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>, <span class="keywordtype">bool</span> filter_objective_cost,</div>
|
|
<div class="line"><a name="l02188"></a><span class="lineno"> 2188</span>  std::vector<LocalSearchFilterManager::FilterEvent>* filters) {</div>
|
|
<div class="line"><a name="l02189"></a><span class="lineno"> 2189</span>  <span class="keyword">const</span> <span class="keyword">auto</span> kAccept = LocalSearchFilterManager::FilterEventType::kAccept;</div>
|
|
<div class="line"><a name="l02190"></a><span class="lineno"> 2190</span>  <span class="comment">// NOTE: We first sort the dimensions by increasing complexity of filtering:</span></div>
|
|
<div class="line"><a name="l02191"></a><span class="lineno"> 2191</span>  <span class="comment">// - Dimensions without any cumul-related costs or constraints will have a</span></div>
|
|
<div class="line"><a name="l02192"></a><span class="lineno"> 2192</span>  <span class="comment">// ChainCumulFilter.</span></div>
|
|
<div class="line"><a name="l02193"></a><span class="lineno"> 2193</span>  <span class="comment">// - Dimensions with cumul costs or constraints, but no global span cost</span></div>
|
|
<div class="line"><a name="l02194"></a><span class="lineno"> 2194</span>  <span class="comment">// and/or precedences will have a PathCumulFilter.</span></div>
|
|
<div class="line"><a name="l02195"></a><span class="lineno"> 2195</span>  <span class="comment">// - Dimensions with a global span cost coefficient and/or precedences will</span></div>
|
|
<div class="line"><a name="l02196"></a><span class="lineno"> 2196</span>  <span class="comment">// have a global LP filter.</span></div>
|
|
<div class="line"><a name="l02197"></a><span class="lineno"> 2197</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_dimensions = dimensions.size();</div>
|
|
<div class="line"><a name="l02198"></a><span class="lineno"> 2198</span>  </div>
|
|
<div class="line"><a name="l02199"></a><span class="lineno"> 2199</span>  std::vector<bool> use_path_cumul_filter(num_dimensions);</div>
|
|
<div class="line"><a name="l02200"></a><span class="lineno"> 2200</span>  std::vector<bool> use_cumul_bounds_propagator_filter(num_dimensions);</div>
|
|
<div class="line"><a name="l02201"></a><span class="lineno"> 2201</span>  std::vector<bool> use_global_lp_filter(num_dimensions);</div>
|
|
<div class="line"><a name="l02202"></a><span class="lineno"> 2202</span>  std::vector<int> filtering_difficulty(num_dimensions);</div>
|
|
<div class="line"><a name="l02203"></a><span class="lineno"> 2203</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> d = 0; d < num_dimensions; d++) {</div>
|
|
<div class="line"><a name="l02204"></a><span class="lineno"> 2204</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>& dimension = *dimensions[d];</div>
|
|
<div class="line"><a name="l02205"></a><span class="lineno"> 2205</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> has_cumul_cost = DimensionHasCumulCost(dimension);</div>
|
|
<div class="line"><a name="l02206"></a><span class="lineno"> 2206</span>  use_path_cumul_filter[d] =</div>
|
|
<div class="line"><a name="l02207"></a><span class="lineno"> 2207</span>  has_cumul_cost || DimensionHasCumulConstraint(dimension);</div>
|
|
<div class="line"><a name="l02208"></a><span class="lineno"> 2208</span>  </div>
|
|
<div class="line"><a name="l02209"></a><span class="lineno"> 2209</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> can_use_cumul_bounds_propagator_filter =</div>
|
|
<div class="line"><a name="l02210"></a><span class="lineno"> 2210</span>  !dimension.<a class="code" href="classoperations__research_1_1_routing_dimension.html#a6debc638c02bfb2b4afe0afccdd98ca5">HasBreakConstraints</a>() &&</div>
|
|
<div class="line"><a name="l02211"></a><span class="lineno"> 2211</span>  (!filter_objective_cost || !has_cumul_cost);</div>
|
|
<div class="line"><a name="l02212"></a><span class="lineno"> 2212</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> has_precedences = !dimension.<a class="code" href="classoperations__research_1_1_routing_dimension.html#ae4b40d046de51f0ace9138a3692b0090">GetNodePrecedences</a>().empty();</div>
|
|
<div class="line"><a name="l02213"></a><span class="lineno"> 2213</span>  use_global_lp_filter[d] =</div>
|
|
<div class="line"><a name="l02214"></a><span class="lineno"> 2214</span>  (has_precedences && !can_use_cumul_bounds_propagator_filter) ||</div>
|
|
<div class="line"><a name="l02215"></a><span class="lineno"> 2215</span>  (filter_objective_cost && dimension.<a class="code" href="classoperations__research_1_1_routing_dimension.html#a1faf1ea53b992b47f60d0622e42f7a50">global_span_cost_coefficient</a>() > 0);</div>
|
|
<div class="line"><a name="l02216"></a><span class="lineno"> 2216</span>  </div>
|
|
<div class="line"><a name="l02217"></a><span class="lineno"> 2217</span>  use_cumul_bounds_propagator_filter[d] =</div>
|
|
<div class="line"><a name="l02218"></a><span class="lineno"> 2218</span>  has_precedences && !use_global_lp_filter[d];</div>
|
|
<div class="line"><a name="l02219"></a><span class="lineno"> 2219</span>  </div>
|
|
<div class="line"><a name="l02220"></a><span class="lineno"> 2220</span>  filtering_difficulty[d] = 4 * use_global_lp_filter[d] +</div>
|
|
<div class="line"><a name="l02221"></a><span class="lineno"> 2221</span>  2 * use_cumul_bounds_propagator_filter[d] +</div>
|
|
<div class="line"><a name="l02222"></a><span class="lineno"> 2222</span>  use_path_cumul_filter[d];</div>
|
|
<div class="line"><a name="l02223"></a><span class="lineno"> 2223</span>  }</div>
|
|
<div class="line"><a name="l02224"></a><span class="lineno"> 2224</span>  </div>
|
|
<div class="line"><a name="l02225"></a><span class="lineno"> 2225</span>  std::vector<int> sorted_dimension_indices(num_dimensions);</div>
|
|
<div class="line"><a name="l02226"></a><span class="lineno"> 2226</span>  std::iota(sorted_dimension_indices.begin(), sorted_dimension_indices.end(),</div>
|
|
<div class="line"><a name="l02227"></a><span class="lineno"> 2227</span>  0);</div>
|
|
<div class="line"><a name="l02228"></a><span class="lineno"> 2228</span>  std::sort(sorted_dimension_indices.begin(), sorted_dimension_indices.end(),</div>
|
|
<div class="line"><a name="l02229"></a><span class="lineno"> 2229</span>  [&filtering_difficulty](<span class="keywordtype">int</span> d1, <span class="keywordtype">int</span> d2) {</div>
|
|
<div class="line"><a name="l02230"></a><span class="lineno"> 2230</span>  return filtering_difficulty[d1] < filtering_difficulty[d2];</div>
|
|
<div class="line"><a name="l02231"></a><span class="lineno"> 2231</span>  });</div>
|
|
<div class="line"><a name="l02232"></a><span class="lineno"> 2232</span>  </div>
|
|
<div class="line"><a name="l02233"></a><span class="lineno"> 2233</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> d : sorted_dimension_indices) {</div>
|
|
<div class="line"><a name="l02234"></a><span class="lineno"> 2234</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>& dimension = *dimensions[d];</div>
|
|
<div class="line"><a name="l02235"></a><span class="lineno"> 2235</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>& <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a> = *dimension.<a class="code" href="classoperations__research_1_1_routing_dimension.html#a35a576bb3ea6814f122593d44a3c391e">model</a>();</div>
|
|
<div class="line"><a name="l02236"></a><span class="lineno"> 2236</span>  <span class="comment">// NOTE: We always add the [Chain|Path]CumulFilter to filter each route's</span></div>
|
|
<div class="line"><a name="l02237"></a><span class="lineno"> 2237</span>  <span class="comment">// feasibility separately to try and cut bad decisions earlier in the</span></div>
|
|
<div class="line"><a name="l02238"></a><span class="lineno"> 2238</span>  <span class="comment">// search, but we don't propagate the computed cost if the LPCumulFilter is</span></div>
|
|
<div class="line"><a name="l02239"></a><span class="lineno"> 2239</span>  <span class="comment">// already doing it.</span></div>
|
|
<div class="line"><a name="l02240"></a><span class="lineno"> 2240</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> use_global_lp = use_global_lp_filter[d];</div>
|
|
<div class="line"><a name="l02241"></a><span class="lineno"> 2241</span>  <span class="keywordflow">if</span> (use_path_cumul_filter[d]) {</div>
|
|
<div class="line"><a name="l02242"></a><span class="lineno"> 2242</span>  filters->push_back(</div>
|
|
<div class="line"><a name="l02243"></a><span class="lineno"> 2243</span>  {<a class="code" href="namespaceoperations__research.html#a216af1fa4181c4020916828eeeba1591">MakePathCumulFilter</a>(dimension, <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>, !use_global_lp,</div>
|
|
<div class="line"><a name="l02244"></a><span class="lineno"> 2244</span>  filter_objective_cost),</div>
|
|
<div class="line"><a name="l02245"></a><span class="lineno"> 2245</span>  kAccept});</div>
|
|
<div class="line"><a name="l02246"></a><span class="lineno"> 2246</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02247"></a><span class="lineno"> 2247</span>  filters->push_back(</div>
|
|
<div class="line"><a name="l02248"></a><span class="lineno"> 2248</span>  {<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.solver()->RevAlloc(<span class="keyword">new</span> ChainCumulFilter(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, dimension)),</div>
|
|
<div class="line"><a name="l02249"></a><span class="lineno"> 2249</span>  kAccept});</div>
|
|
<div class="line"><a name="l02250"></a><span class="lineno"> 2250</span>  }</div>
|
|
<div class="line"><a name="l02251"></a><span class="lineno"> 2251</span>  </div>
|
|
<div class="line"><a name="l02252"></a><span class="lineno"> 2252</span>  <span class="keywordflow">if</span> (use_global_lp) {</div>
|
|
<div class="line"><a name="l02253"></a><span class="lineno"> 2253</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.GetMutableGlobalCumulOptimizer(dimension) != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l02254"></a><span class="lineno"> 2254</span>  filters->push_back({<a class="code" href="namespaceoperations__research.html#a2781a8c44a6af7c07abf923678a18697">MakeGlobalLPCumulFilter</a>(</div>
|
|
<div class="line"><a name="l02255"></a><span class="lineno"> 2255</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.GetMutableGlobalCumulOptimizer(dimension),</div>
|
|
<div class="line"><a name="l02256"></a><span class="lineno"> 2256</span>  filter_objective_cost),</div>
|
|
<div class="line"><a name="l02257"></a><span class="lineno"> 2257</span>  kAccept});</div>
|
|
<div class="line"><a name="l02258"></a><span class="lineno"> 2258</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (use_cumul_bounds_propagator_filter[d]) {</div>
|
|
<div class="line"><a name="l02259"></a><span class="lineno"> 2259</span>  filters->push_back({<a class="code" href="namespaceoperations__research.html#a21d884ccc65aaa3278b977df560d31a0">MakeCumulBoundsPropagatorFilter</a>(dimension), kAccept});</div>
|
|
<div class="line"><a name="l02260"></a><span class="lineno"> 2260</span>  }</div>
|
|
<div class="line"><a name="l02261"></a><span class="lineno"> 2261</span>  }</div>
|
|
<div class="line"><a name="l02262"></a><span class="lineno"> 2262</span> }</div>
|
|
<div class="line"><a name="l02263"></a><span class="lineno"> 2263</span>  </div>
|
|
<div class="line"><a name="l02264"></a><span class="lineno"> 2264</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l02265"></a><span class="lineno"> 2265</span>  </div>
|
|
<div class="line"><a name="l02266"></a><span class="lineno"> 2266</span> <span class="comment">// Filter for pickup/delivery precedences.</span></div>
|
|
<div class="line"><a name="l02267"></a><span class="lineno"> 2267</span> <span class="keyword">class </span>PickupDeliveryFilter : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1_base_path_filter.html">BasePathFilter</a> {</div>
|
|
<div class="line"><a name="l02268"></a><span class="lineno"> 2268</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l02269"></a><span class="lineno"> 2269</span>  PickupDeliveryFilter(<span class="keyword">const</span> std::vector<IntVar*>& nexts, <span class="keywordtype">int</span> next_domain_size,</div>
|
|
<div class="line"><a name="l02270"></a><span class="lineno"> 2270</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html#a76874cd778ea1b9220673e019f9e7abe">RoutingModel::IndexPairs</a>& pairs,</div>
|
|
<div class="line"><a name="l02271"></a><span class="lineno"> 2271</span>  <span class="keyword">const</span> std::vector<RoutingModel::PickupAndDeliveryPolicy>&</div>
|
|
<div class="line"><a name="l02272"></a><span class="lineno"> 2272</span>  vehicle_policies);</div>
|
|
<div class="line"><a name="l02273"></a><span class="lineno"> 2273</span>  ~PickupDeliveryFilter()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l02274"></a><span class="lineno"> 2274</span>  <span class="keywordtype">bool</span> AcceptPath(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_start, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_start,</div>
|
|
<div class="line"><a name="l02275"></a><span class="lineno"> 2275</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_end) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l02276"></a><span class="lineno"> 2276</span>  std::string <a class="code" href="classoperations__research_1_1_base_object.html#a8eba5d533fa9df4617c1868d3ec2afc4">DebugString</a>()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> <span class="stringliteral">"PickupDeliveryFilter"</span>; }</div>
|
|
<div class="line"><a name="l02277"></a><span class="lineno"> 2277</span>  </div>
|
|
<div class="line"><a name="l02278"></a><span class="lineno"> 2278</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l02279"></a><span class="lineno"> 2279</span>  <span class="keywordtype">bool</span> AcceptPathDefault(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_start);</div>
|
|
<div class="line"><a name="l02280"></a><span class="lineno"> 2280</span>  <span class="keyword">template</span> <<span class="keywordtype">bool</span> lifo></div>
|
|
<div class="line"><a name="l02281"></a><span class="lineno"> 2281</span>  <span class="keywordtype">bool</span> AcceptPathOrdered(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_start);</div>
|
|
<div class="line"><a name="l02282"></a><span class="lineno"> 2282</span>  </div>
|
|
<div class="line"><a name="l02283"></a><span class="lineno"> 2283</span>  std::vector<int> pair_firsts_;</div>
|
|
<div class="line"><a name="l02284"></a><span class="lineno"> 2284</span>  std::vector<int> pair_seconds_;</div>
|
|
<div class="line"><a name="l02285"></a><span class="lineno"> 2285</span>  <span class="keyword">const</span> RoutingModel::IndexPairs pairs_;</div>
|
|
<div class="line"><a name="l02286"></a><span class="lineno"> 2286</span>  SparseBitset<> visited_;</div>
|
|
<div class="line"><a name="l02287"></a><span class="lineno"> 2287</span>  std::deque<int> visited_deque_;</div>
|
|
<div class="line"><a name="l02288"></a><span class="lineno"> 2288</span>  <span class="keyword">const</span> std::vector<RoutingModel::PickupAndDeliveryPolicy> vehicle_policies_;</div>
|
|
<div class="line"><a name="l02289"></a><span class="lineno"> 2289</span> };</div>
|
|
<div class="line"><a name="l02290"></a><span class="lineno"> 2290</span>  </div>
|
|
<div class="line"><a name="l02291"></a><span class="lineno"> 2291</span> PickupDeliveryFilter::PickupDeliveryFilter(</div>
|
|
<div class="line"><a name="l02292"></a><span class="lineno"> 2292</span>  <span class="keyword">const</span> std::vector<IntVar*>& nexts, <span class="keywordtype">int</span> next_domain_size,</div>
|
|
<div class="line"><a name="l02293"></a><span class="lineno"> 2293</span>  <span class="keyword">const</span> RoutingModel::IndexPairs& pairs,</div>
|
|
<div class="line"><a name="l02294"></a><span class="lineno"> 2294</span>  <span class="keyword">const</span> std::vector<RoutingModel::PickupAndDeliveryPolicy>& vehicle_policies)</div>
|
|
<div class="line"><a name="l02295"></a><span class="lineno"> 2295</span>  : BasePathFilter(nexts, next_domain_size),</div>
|
|
<div class="line"><a name="l02296"></a><span class="lineno"> 2296</span>  pair_firsts_(next_domain_size, <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a>),</div>
|
|
<div class="line"><a name="l02297"></a><span class="lineno"> 2297</span>  pair_seconds_(next_domain_size, <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a>),</div>
|
|
<div class="line"><a name="l02298"></a><span class="lineno"> 2298</span>  pairs_(pairs),</div>
|
|
<div class="line"><a name="l02299"></a><span class="lineno"> 2299</span>  visited_(Size()),</div>
|
|
<div class="line"><a name="l02300"></a><span class="lineno"> 2300</span>  vehicle_policies_(vehicle_policies) {</div>
|
|
<div class="line"><a name="l02301"></a><span class="lineno"> 2301</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < pairs.size(); ++i) {</div>
|
|
<div class="line"><a name="l02302"></a><span class="lineno"> 2302</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& index_pair = pairs[i];</div>
|
|
<div class="line"><a name="l02303"></a><span class="lineno"> 2303</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> first : index_pair.first) {</div>
|
|
<div class="line"><a name="l02304"></a><span class="lineno"> 2304</span>  pair_firsts_[first] = i;</div>
|
|
<div class="line"><a name="l02305"></a><span class="lineno"> 2305</span>  }</div>
|
|
<div class="line"><a name="l02306"></a><span class="lineno"> 2306</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> second : index_pair.second) {</div>
|
|
<div class="line"><a name="l02307"></a><span class="lineno"> 2307</span>  pair_seconds_[second] = i;</div>
|
|
<div class="line"><a name="l02308"></a><span class="lineno"> 2308</span>  }</div>
|
|
<div class="line"><a name="l02309"></a><span class="lineno"> 2309</span>  }</div>
|
|
<div class="line"><a name="l02310"></a><span class="lineno"> 2310</span> }</div>
|
|
<div class="line"><a name="l02311"></a><span class="lineno"> 2311</span>  </div>
|
|
<div class="line"><a name="l02312"></a><span class="lineno"> 2312</span> <span class="keywordtype">bool</span> PickupDeliveryFilter::AcceptPath(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_start, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_start,</div>
|
|
<div class="line"><a name="l02313"></a><span class="lineno"> 2313</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_end) {</div>
|
|
<div class="line"><a name="l02314"></a><span class="lineno"> 2314</span>  <span class="keywordflow">switch</span> (vehicle_policies_[GetPath(path_start)]) {</div>
|
|
<div class="line"><a name="l02315"></a><span class="lineno"> 2315</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1_routing_model.html#aa5cff2ee7fbe3a9c5c701bfba7460c83a2fecd02405f5ff0769292822ad17a955">RoutingModel::PICKUP_AND_DELIVERY_NO_ORDER</a>:</div>
|
|
<div class="line"><a name="l02316"></a><span class="lineno"> 2316</span>  <span class="keywordflow">return</span> AcceptPathDefault(path_start);</div>
|
|
<div class="line"><a name="l02317"></a><span class="lineno"> 2317</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1_routing_model.html#aa5cff2ee7fbe3a9c5c701bfba7460c83a272376ed085de7d28d36fa1013394cc8">RoutingModel::PICKUP_AND_DELIVERY_LIFO</a>:</div>
|
|
<div class="line"><a name="l02318"></a><span class="lineno"> 2318</span>  <span class="keywordflow">return</span> AcceptPathOrdered<true>(path_start);</div>
|
|
<div class="line"><a name="l02319"></a><span class="lineno"> 2319</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1_routing_model.html#aa5cff2ee7fbe3a9c5c701bfba7460c83a5c55a9aa52a754be8eb1b9d29af97a8a">RoutingModel::PICKUP_AND_DELIVERY_FIFO</a>:</div>
|
|
<div class="line"><a name="l02320"></a><span class="lineno"> 2320</span>  <span class="keywordflow">return</span> AcceptPathOrdered<false>(path_start);</div>
|
|
<div class="line"><a name="l02321"></a><span class="lineno"> 2321</span>  <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a name="l02322"></a><span class="lineno"> 2322</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02323"></a><span class="lineno"> 2323</span>  }</div>
|
|
<div class="line"><a name="l02324"></a><span class="lineno"> 2324</span> }</div>
|
|
<div class="line"><a name="l02325"></a><span class="lineno"> 2325</span>  </div>
|
|
<div class="line"><a name="l02326"></a><span class="lineno"> 2326</span> <span class="keywordtype">bool</span> PickupDeliveryFilter::AcceptPathDefault(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_start) {</div>
|
|
<div class="line"><a name="l02327"></a><span class="lineno"> 2327</span>  visited_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#aa7d76b766faf39c1652b6617eac5fe20">ClearAll</a>();</div>
|
|
<div class="line"><a name="l02328"></a><span class="lineno"> 2328</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = path_start;</div>
|
|
<div class="line"><a name="l02329"></a><span class="lineno"> 2329</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_length = 1;</div>
|
|
<div class="line"><a name="l02330"></a><span class="lineno"> 2330</span>  <span class="keywordflow">while</span> (node < Size()) {</div>
|
|
<div class="line"><a name="l02331"></a><span class="lineno"> 2331</span>  <span class="comment">// Detect sub-cycles (path is longer than longest possible path).</span></div>
|
|
<div class="line"><a name="l02332"></a><span class="lineno"> 2332</span>  <span class="keywordflow">if</span> (path_length > Size()) {</div>
|
|
<div class="line"><a name="l02333"></a><span class="lineno"> 2333</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02334"></a><span class="lineno"> 2334</span>  }</div>
|
|
<div class="line"><a name="l02335"></a><span class="lineno"> 2335</span>  <span class="keywordflow">if</span> (pair_firsts_[node] != <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a>) {</div>
|
|
<div class="line"><a name="l02336"></a><span class="lineno"> 2336</span>  <span class="comment">// Checking on pair firsts is not actually necessary (inconsistencies</span></div>
|
|
<div class="line"><a name="l02337"></a><span class="lineno"> 2337</span>  <span class="comment">// will get caught when checking pair seconds); doing it anyway to</span></div>
|
|
<div class="line"><a name="l02338"></a><span class="lineno"> 2338</span>  <span class="comment">// cut checks early.</span></div>
|
|
<div class="line"><a name="l02339"></a><span class="lineno"> 2339</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> second : pairs_[pair_firsts_[node]].second) {</div>
|
|
<div class="line"><a name="l02340"></a><span class="lineno"> 2340</span>  <span class="keywordflow">if</span> (visited_[second]) {</div>
|
|
<div class="line"><a name="l02341"></a><span class="lineno"> 2341</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02342"></a><span class="lineno"> 2342</span>  }</div>
|
|
<div class="line"><a name="l02343"></a><span class="lineno"> 2343</span>  }</div>
|
|
<div class="line"><a name="l02344"></a><span class="lineno"> 2344</span>  }</div>
|
|
<div class="line"><a name="l02345"></a><span class="lineno"> 2345</span>  <span class="keywordflow">if</span> (pair_seconds_[node] != <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a>) {</div>
|
|
<div class="line"><a name="l02346"></a><span class="lineno"> 2346</span>  <span class="keywordtype">bool</span> found_first = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02347"></a><span class="lineno"> 2347</span>  <span class="keywordtype">bool</span> some_synced = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02348"></a><span class="lineno"> 2348</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> first : pairs_[pair_seconds_[node]].first) {</div>
|
|
<div class="line"><a name="l02349"></a><span class="lineno"> 2349</span>  <span class="keywordflow">if</span> (visited_[first]) {</div>
|
|
<div class="line"><a name="l02350"></a><span class="lineno"> 2350</span>  found_first = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02351"></a><span class="lineno"> 2351</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l02352"></a><span class="lineno"> 2352</span>  }</div>
|
|
<div class="line"><a name="l02353"></a><span class="lineno"> 2353</span>  <span class="keywordflow">if</span> (IsVarSynced(first)) {</div>
|
|
<div class="line"><a name="l02354"></a><span class="lineno"> 2354</span>  some_synced = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02355"></a><span class="lineno"> 2355</span>  }</div>
|
|
<div class="line"><a name="l02356"></a><span class="lineno"> 2356</span>  }</div>
|
|
<div class="line"><a name="l02357"></a><span class="lineno"> 2357</span>  <span class="keywordflow">if</span> (!found_first && some_synced) {</div>
|
|
<div class="line"><a name="l02358"></a><span class="lineno"> 2358</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02359"></a><span class="lineno"> 2359</span>  }</div>
|
|
<div class="line"><a name="l02360"></a><span class="lineno"> 2360</span>  }</div>
|
|
<div class="line"><a name="l02361"></a><span class="lineno"> 2361</span>  visited_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(node);</div>
|
|
<div class="line"><a name="l02362"></a><span class="lineno"> 2362</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = GetNext(node);</div>
|
|
<div class="line"><a name="l02363"></a><span class="lineno"> 2363</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> == <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a>) {</div>
|
|
<div class="line"><a name="l02364"></a><span class="lineno"> 2364</span>  <span class="comment">// LNS detected, return true since path was ok up to now.</span></div>
|
|
<div class="line"><a name="l02365"></a><span class="lineno"> 2365</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02366"></a><span class="lineno"> 2366</span>  }</div>
|
|
<div class="line"><a name="l02367"></a><span class="lineno"> 2367</span>  node = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l02368"></a><span class="lineno"> 2368</span>  ++path_length;</div>
|
|
<div class="line"><a name="l02369"></a><span class="lineno"> 2369</span>  }</div>
|
|
<div class="line"><a name="l02370"></a><span class="lineno"> 2370</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node : visited_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">PositionsSetAtLeastOnce</a>()) {</div>
|
|
<div class="line"><a name="l02371"></a><span class="lineno"> 2371</span>  <span class="keywordflow">if</span> (pair_firsts_[node] != <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a>) {</div>
|
|
<div class="line"><a name="l02372"></a><span class="lineno"> 2372</span>  <span class="keywordtype">bool</span> found_second = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02373"></a><span class="lineno"> 2373</span>  <span class="keywordtype">bool</span> some_synced = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02374"></a><span class="lineno"> 2374</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> second : pairs_[pair_firsts_[node]].second) {</div>
|
|
<div class="line"><a name="l02375"></a><span class="lineno"> 2375</span>  <span class="keywordflow">if</span> (visited_[second]) {</div>
|
|
<div class="line"><a name="l02376"></a><span class="lineno"> 2376</span>  found_second = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02377"></a><span class="lineno"> 2377</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l02378"></a><span class="lineno"> 2378</span>  }</div>
|
|
<div class="line"><a name="l02379"></a><span class="lineno"> 2379</span>  <span class="keywordflow">if</span> (IsVarSynced(second)) {</div>
|
|
<div class="line"><a name="l02380"></a><span class="lineno"> 2380</span>  some_synced = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02381"></a><span class="lineno"> 2381</span>  }</div>
|
|
<div class="line"><a name="l02382"></a><span class="lineno"> 2382</span>  }</div>
|
|
<div class="line"><a name="l02383"></a><span class="lineno"> 2383</span>  <span class="keywordflow">if</span> (!found_second && some_synced) {</div>
|
|
<div class="line"><a name="l02384"></a><span class="lineno"> 2384</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02385"></a><span class="lineno"> 2385</span>  }</div>
|
|
<div class="line"><a name="l02386"></a><span class="lineno"> 2386</span>  }</div>
|
|
<div class="line"><a name="l02387"></a><span class="lineno"> 2387</span>  }</div>
|
|
<div class="line"><a name="l02388"></a><span class="lineno"> 2388</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02389"></a><span class="lineno"> 2389</span> }</div>
|
|
<div class="line"><a name="l02390"></a><span class="lineno"> 2390</span>  </div>
|
|
<div class="line"><a name="l02391"></a><span class="lineno"> 2391</span> <span class="keyword">template</span> <<span class="keywordtype">bool</span> lifo></div>
|
|
<div class="line"><a name="l02392"></a><span class="lineno"> 2392</span> <span class="keywordtype">bool</span> PickupDeliveryFilter::AcceptPathOrdered(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_start) {</div>
|
|
<div class="line"><a name="l02393"></a><span class="lineno"> 2393</span>  visited_deque_.clear();</div>
|
|
<div class="line"><a name="l02394"></a><span class="lineno"> 2394</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = path_start;</div>
|
|
<div class="line"><a name="l02395"></a><span class="lineno"> 2395</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_length = 1;</div>
|
|
<div class="line"><a name="l02396"></a><span class="lineno"> 2396</span>  <span class="keywordflow">while</span> (node < Size()) {</div>
|
|
<div class="line"><a name="l02397"></a><span class="lineno"> 2397</span>  <span class="comment">// Detect sub-cycles (path is longer than longest possible path).</span></div>
|
|
<div class="line"><a name="l02398"></a><span class="lineno"> 2398</span>  <span class="keywordflow">if</span> (path_length > Size()) {</div>
|
|
<div class="line"><a name="l02399"></a><span class="lineno"> 2399</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02400"></a><span class="lineno"> 2400</span>  }</div>
|
|
<div class="line"><a name="l02401"></a><span class="lineno"> 2401</span>  <span class="keywordflow">if</span> (pair_firsts_[node] != <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a>) {</div>
|
|
<div class="line"><a name="l02402"></a><span class="lineno"> 2402</span>  <span class="keywordflow">if</span> (lifo) {</div>
|
|
<div class="line"><a name="l02403"></a><span class="lineno"> 2403</span>  visited_deque_.push_back(node);</div>
|
|
<div class="line"><a name="l02404"></a><span class="lineno"> 2404</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02405"></a><span class="lineno"> 2405</span>  visited_deque_.push_front(node);</div>
|
|
<div class="line"><a name="l02406"></a><span class="lineno"> 2406</span>  }</div>
|
|
<div class="line"><a name="l02407"></a><span class="lineno"> 2407</span>  }</div>
|
|
<div class="line"><a name="l02408"></a><span class="lineno"> 2408</span>  <span class="keywordflow">if</span> (pair_seconds_[node] != <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a>) {</div>
|
|
<div class="line"><a name="l02409"></a><span class="lineno"> 2409</span>  <span class="keywordtype">bool</span> found_first = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02410"></a><span class="lineno"> 2410</span>  <span class="keywordtype">bool</span> some_synced = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02411"></a><span class="lineno"> 2411</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> first : pairs_[pair_seconds_[node]].first) {</div>
|
|
<div class="line"><a name="l02412"></a><span class="lineno"> 2412</span>  <span class="keywordflow">if</span> (!visited_deque_.empty() && visited_deque_.back() == first) {</div>
|
|
<div class="line"><a name="l02413"></a><span class="lineno"> 2413</span>  found_first = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02414"></a><span class="lineno"> 2414</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l02415"></a><span class="lineno"> 2415</span>  }</div>
|
|
<div class="line"><a name="l02416"></a><span class="lineno"> 2416</span>  <span class="keywordflow">if</span> (IsVarSynced(first)) {</div>
|
|
<div class="line"><a name="l02417"></a><span class="lineno"> 2417</span>  some_synced = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02418"></a><span class="lineno"> 2418</span>  }</div>
|
|
<div class="line"><a name="l02419"></a><span class="lineno"> 2419</span>  }</div>
|
|
<div class="line"><a name="l02420"></a><span class="lineno"> 2420</span>  <span class="keywordflow">if</span> (!found_first && some_synced) {</div>
|
|
<div class="line"><a name="l02421"></a><span class="lineno"> 2421</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02422"></a><span class="lineno"> 2422</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!visited_deque_.empty()) {</div>
|
|
<div class="line"><a name="l02423"></a><span class="lineno"> 2423</span>  visited_deque_.pop_back();</div>
|
|
<div class="line"><a name="l02424"></a><span class="lineno"> 2424</span>  }</div>
|
|
<div class="line"><a name="l02425"></a><span class="lineno"> 2425</span>  }</div>
|
|
<div class="line"><a name="l02426"></a><span class="lineno"> 2426</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = GetNext(node);</div>
|
|
<div class="line"><a name="l02427"></a><span class="lineno"> 2427</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> == <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a>) {</div>
|
|
<div class="line"><a name="l02428"></a><span class="lineno"> 2428</span>  <span class="comment">// LNS detected, return true since path was ok up to now.</span></div>
|
|
<div class="line"><a name="l02429"></a><span class="lineno"> 2429</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02430"></a><span class="lineno"> 2430</span>  }</div>
|
|
<div class="line"><a name="l02431"></a><span class="lineno"> 2431</span>  node = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l02432"></a><span class="lineno"> 2432</span>  ++path_length;</div>
|
|
<div class="line"><a name="l02433"></a><span class="lineno"> 2433</span>  }</div>
|
|
<div class="line"><a name="l02434"></a><span class="lineno"> 2434</span>  <span class="keywordflow">while</span> (!visited_deque_.empty()) {</div>
|
|
<div class="line"><a name="l02435"></a><span class="lineno"> 2435</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> second : pairs_[pair_firsts_[visited_deque_.back()]].second) {</div>
|
|
<div class="line"><a name="l02436"></a><span class="lineno"> 2436</span>  <span class="keywordflow">if</span> (IsVarSynced(second)) {</div>
|
|
<div class="line"><a name="l02437"></a><span class="lineno"> 2437</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02438"></a><span class="lineno"> 2438</span>  }</div>
|
|
<div class="line"><a name="l02439"></a><span class="lineno"> 2439</span>  }</div>
|
|
<div class="line"><a name="l02440"></a><span class="lineno"> 2440</span>  visited_deque_.pop_back();</div>
|
|
<div class="line"><a name="l02441"></a><span class="lineno"> 2441</span>  }</div>
|
|
<div class="line"><a name="l02442"></a><span class="lineno"> 2442</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02443"></a><span class="lineno"> 2443</span> }</div>
|
|
<div class="line"><a name="l02444"></a><span class="lineno"> 2444</span>  </div>
|
|
<div class="line"><a name="l02445"></a><span class="lineno"> 2445</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l02446"></a><span class="lineno"> 2446</span>  </div>
|
|
<div class="line"><a name="l02447"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ad03cbd2a51a0688c1fd08d3a7c1754c9"> 2447</a></span> <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html">IntVarLocalSearchFilter</a>* <a class="code" href="namespaceoperations__research.html#ad03cbd2a51a0688c1fd08d3a7c1754c9">MakePickupDeliveryFilter</a>(</div>
|
|
<div class="line"><a name="l02448"></a><span class="lineno"> 2448</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>& routing_model, <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html#a76874cd778ea1b9220673e019f9e7abe">RoutingModel::IndexPairs</a>& pairs,</div>
|
|
<div class="line"><a name="l02449"></a><span class="lineno"> 2449</span>  <span class="keyword">const</span> std::vector<RoutingModel::PickupAndDeliveryPolicy>&</div>
|
|
<div class="line"><a name="l02450"></a><span class="lineno"> 2450</span>  vehicle_policies) {</div>
|
|
<div class="line"><a name="l02451"></a><span class="lineno"> 2451</span>  <span class="keywordflow">return</span> routing_model.<a class="code" href="classoperations__research_1_1_routing_model.html#a5f32c22c620c811754ba7b6f977db864">solver</a>()-><a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> PickupDeliveryFilter(</div>
|
|
<div class="line"><a name="l02452"></a><span class="lineno"> 2452</span>  routing_model.<a class="code" href="classoperations__research_1_1_routing_model.html#aad154b31953d2b467bbac3e4ac696cd6">Nexts</a>(), routing_model.<a class="code" href="classoperations__research_1_1_routing_model.html#a354dd8c252cf59b748602b342db6019d">Size</a>() + routing_model.<a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(),</div>
|
|
<div class="line"><a name="l02453"></a><span class="lineno"> 2453</span>  pairs, vehicle_policies));</div>
|
|
<div class="line"><a name="l02454"></a><span class="lineno"> 2454</span> }</div>
|
|
<div class="line"><a name="l02455"></a><span class="lineno"> 2455</span>  </div>
|
|
<div class="line"><a name="l02456"></a><span class="lineno"> 2456</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l02457"></a><span class="lineno"> 2457</span>  </div>
|
|
<div class="line"><a name="l02458"></a><span class="lineno"> 2458</span> <span class="comment">// Vehicle variable filter</span></div>
|
|
<div class="line"><a name="l02459"></a><span class="lineno"> 2459</span> <span class="keyword">class </span>VehicleVarFilter : <span class="keyword">public</span> BasePathFilter {</div>
|
|
<div class="line"><a name="l02460"></a><span class="lineno"> 2460</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l02461"></a><span class="lineno"> 2461</span>  <span class="keyword">explicit</span> VehicleVarFilter(<span class="keyword">const</span> RoutingModel& routing_model);</div>
|
|
<div class="line"><a name="l02462"></a><span class="lineno"> 2462</span>  ~VehicleVarFilter()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l02463"></a><span class="lineno"> 2463</span>  <span class="keywordtype">bool</span> AcceptPath(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_start, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_start,</div>
|
|
<div class="line"><a name="l02464"></a><span class="lineno"> 2464</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_end) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l02465"></a><span class="lineno"> 2465</span>  std::string DebugString()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> <span class="stringliteral">"VehicleVariableFilter"</span>; }</div>
|
|
<div class="line"><a name="l02466"></a><span class="lineno"> 2466</span>  </div>
|
|
<div class="line"><a name="l02467"></a><span class="lineno"> 2467</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l02468"></a><span class="lineno"> 2468</span>  <span class="keywordtype">bool</span> DisableFiltering() <span class="keyword">const override</span>;</div>
|
|
<div class="line"><a name="l02469"></a><span class="lineno"> 2469</span>  <span class="keywordtype">bool</span> IsVehicleVariableConstrained(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l02470"></a><span class="lineno"> 2470</span>  </div>
|
|
<div class="line"><a name="l02471"></a><span class="lineno"> 2471</span>  std::vector<int64> start_to_vehicle_;</div>
|
|
<div class="line"><a name="l02472"></a><span class="lineno"> 2472</span>  std::vector<IntVar*> vehicle_vars_;</div>
|
|
<div class="line"><a name="l02473"></a><span class="lineno"> 2473</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> unconstrained_vehicle_var_domain_size_;</div>
|
|
<div class="line"><a name="l02474"></a><span class="lineno"> 2474</span> };</div>
|
|
<div class="line"><a name="l02475"></a><span class="lineno"> 2475</span>  </div>
|
|
<div class="line"><a name="l02476"></a><span class="lineno"> 2476</span> VehicleVarFilter::VehicleVarFilter(<span class="keyword">const</span> RoutingModel& routing_model)</div>
|
|
<div class="line"><a name="l02477"></a><span class="lineno"> 2477</span>  : BasePathFilter(routing_model.Nexts(),</div>
|
|
<div class="line"><a name="l02478"></a><span class="lineno"> 2478</span>  routing_model.Size() + routing_model.vehicles()),</div>
|
|
<div class="line"><a name="l02479"></a><span class="lineno"> 2479</span>  vehicle_vars_(routing_model.VehicleVars()),</div>
|
|
<div class="line"><a name="l02480"></a><span class="lineno"> 2480</span>  unconstrained_vehicle_var_domain_size_(routing_model.vehicles()) {</div>
|
|
<div class="line"><a name="l02481"></a><span class="lineno"> 2481</span>  start_to_vehicle_.resize(Size(), -1);</div>
|
|
<div class="line"><a name="l02482"></a><span class="lineno"> 2482</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < routing_model.vehicles(); ++i) {</div>
|
|
<div class="line"><a name="l02483"></a><span class="lineno"> 2483</span>  start_to_vehicle_[routing_model.Start(i)] = i;</div>
|
|
<div class="line"><a name="l02484"></a><span class="lineno"> 2484</span>  }</div>
|
|
<div class="line"><a name="l02485"></a><span class="lineno"> 2485</span> }</div>
|
|
<div class="line"><a name="l02486"></a><span class="lineno"> 2486</span>  </div>
|
|
<div class="line"><a name="l02487"></a><span class="lineno"> 2487</span> <span class="keywordtype">bool</span> VehicleVarFilter::AcceptPath(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> path_start, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_start,</div>
|
|
<div class="line"><a name="l02488"></a><span class="lineno"> 2488</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> chain_end) {</div>
|
|
<div class="line"><a name="l02489"></a><span class="lineno"> 2489</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> vehicle = start_to_vehicle_[path_start];</div>
|
|
<div class="line"><a name="l02490"></a><span class="lineno"> 2490</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = chain_start;</div>
|
|
<div class="line"><a name="l02491"></a><span class="lineno"> 2491</span>  <span class="keywordflow">while</span> (node != chain_end) {</div>
|
|
<div class="line"><a name="l02492"></a><span class="lineno"> 2492</span>  <span class="keywordflow">if</span> (!vehicle_vars_[node]->Contains(vehicle)) {</div>
|
|
<div class="line"><a name="l02493"></a><span class="lineno"> 2493</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02494"></a><span class="lineno"> 2494</span>  }</div>
|
|
<div class="line"><a name="l02495"></a><span class="lineno"> 2495</span>  node = GetNext(node);</div>
|
|
<div class="line"><a name="l02496"></a><span class="lineno"> 2496</span>  }</div>
|
|
<div class="line"><a name="l02497"></a><span class="lineno"> 2497</span>  <span class="keywordflow">return</span> vehicle_vars_[node]->Contains(vehicle);</div>
|
|
<div class="line"><a name="l02498"></a><span class="lineno"> 2498</span> }</div>
|
|
<div class="line"><a name="l02499"></a><span class="lineno"> 2499</span>  </div>
|
|
<div class="line"><a name="l02500"></a><span class="lineno"> 2500</span> <span class="keywordtype">bool</span> VehicleVarFilter::DisableFiltering()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l02501"></a><span class="lineno"> 2501</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < vehicle_vars_.size(); ++i) {</div>
|
|
<div class="line"><a name="l02502"></a><span class="lineno"> 2502</span>  <span class="keywordflow">if</span> (IsVehicleVariableConstrained(i)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02503"></a><span class="lineno"> 2503</span>  }</div>
|
|
<div class="line"><a name="l02504"></a><span class="lineno"> 2504</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02505"></a><span class="lineno"> 2505</span> }</div>
|
|
<div class="line"><a name="l02506"></a><span class="lineno"> 2506</span>  </div>
|
|
<div class="line"><a name="l02507"></a><span class="lineno"> 2507</span> <span class="keywordtype">bool</span> VehicleVarFilter::IsVehicleVariableConstrained(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l02508"></a><span class="lineno"> 2508</span>  <span class="keyword">const</span> IntVar* <span class="keyword">const</span> vehicle_var = vehicle_vars_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l02509"></a><span class="lineno"> 2509</span>  <span class="comment">// If vehicle variable contains -1 (optional node), then we need to</span></div>
|
|
<div class="line"><a name="l02510"></a><span class="lineno"> 2510</span>  <span class="comment">// add it to the "unconstrained" domain. Impact we don't filter mandatory</span></div>
|
|
<div class="line"><a name="l02511"></a><span class="lineno"> 2511</span>  <span class="comment">// nodes made inactive here, but it is covered by other filters.</span></div>
|
|
<div class="line"><a name="l02512"></a><span class="lineno"> 2512</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> adjusted_unconstrained_vehicle_var_domain_size =</div>
|
|
<div class="line"><a name="l02513"></a><span class="lineno"> 2513</span>  vehicle_var->Min() >= 0 ? unconstrained_vehicle_var_domain_size_</div>
|
|
<div class="line"><a name="l02514"></a><span class="lineno"> 2514</span>  : unconstrained_vehicle_var_domain_size_ + 1;</div>
|
|
<div class="line"><a name="l02515"></a><span class="lineno"> 2515</span>  <span class="keywordflow">return</span> vehicle_var->Size() != adjusted_unconstrained_vehicle_var_domain_size;</div>
|
|
<div class="line"><a name="l02516"></a><span class="lineno"> 2516</span> }</div>
|
|
<div class="line"><a name="l02517"></a><span class="lineno"> 2517</span>  </div>
|
|
<div class="line"><a name="l02518"></a><span class="lineno"> 2518</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l02519"></a><span class="lineno"> 2519</span>  </div>
|
|
<div class="line"><a name="l02520"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ab962de016b1a14868457ac876eadf008"> 2520</a></span> <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html">IntVarLocalSearchFilter</a>* <a class="code" href="namespaceoperations__research.html#ab962de016b1a14868457ac876eadf008">MakeVehicleVarFilter</a>(</div>
|
|
<div class="line"><a name="l02521"></a><span class="lineno"> 2521</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>& routing_model) {</div>
|
|
<div class="line"><a name="l02522"></a><span class="lineno"> 2522</span>  <span class="keywordflow">return</span> routing_model.<a class="code" href="classoperations__research_1_1_routing_model.html#a5f32c22c620c811754ba7b6f977db864">solver</a>()-><a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> VehicleVarFilter(routing_model));</div>
|
|
<div class="line"><a name="l02523"></a><span class="lineno"> 2523</span> }</div>
|
|
<div class="line"><a name="l02524"></a><span class="lineno"> 2524</span>  </div>
|
|
<div class="line"><a name="l02525"></a><span class="lineno"> 2525</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l02526"></a><span class="lineno"> 2526</span>  </div>
|
|
<div class="line"><a name="l02527"></a><span class="lineno"> 2527</span> <span class="keyword">class </span>CumulBoundsPropagatorFilter : <span class="keyword">public</span> IntVarLocalSearchFilter {</div>
|
|
<div class="line"><a name="l02528"></a><span class="lineno"> 2528</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l02529"></a><span class="lineno"> 2529</span>  <span class="keyword">explicit</span> CumulBoundsPropagatorFilter(<span class="keyword">const</span> RoutingDimension& dimension);</div>
|
|
<div class="line"><a name="l02530"></a><span class="lineno"> 2530</span>  <span class="keywordtype">bool</span> Accept(<span class="keyword">const</span> Assignment* <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>, <span class="keyword">const</span> Assignment* deltadelta,</div>
|
|
<div class="line"><a name="l02531"></a><span class="lineno"> 2531</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_min, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_max) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l02532"></a><span class="lineno"> 2532</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l02533"></a><span class="lineno"> 2533</span>  <span class="keywordflow">return</span> <span class="stringliteral">"CumulBoundsPropagatorFilter("</span> + propagator_.dimension().name() +</div>
|
|
<div class="line"><a name="l02534"></a><span class="lineno"> 2534</span>  <span class="stringliteral">")"</span>;</div>
|
|
<div class="line"><a name="l02535"></a><span class="lineno"> 2535</span>  }</div>
|
|
<div class="line"><a name="l02536"></a><span class="lineno"> 2536</span>  </div>
|
|
<div class="line"><a name="l02537"></a><span class="lineno"> 2537</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l02538"></a><span class="lineno"> 2538</span>  CumulBoundsPropagator propagator_;</div>
|
|
<div class="line"><a name="l02539"></a><span class="lineno"> 2539</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_offset_;</div>
|
|
<div class="line"><a name="l02540"></a><span class="lineno"> 2540</span>  SparseBitset<int64> delta_touched_;</div>
|
|
<div class="line"><a name="l02541"></a><span class="lineno"> 2541</span>  std::vector<int64> delta_nexts_;</div>
|
|
<div class="line"><a name="l02542"></a><span class="lineno"> 2542</span> };</div>
|
|
<div class="line"><a name="l02543"></a><span class="lineno"> 2543</span>  </div>
|
|
<div class="line"><a name="l02544"></a><span class="lineno"> 2544</span> CumulBoundsPropagatorFilter::CumulBoundsPropagatorFilter(</div>
|
|
<div class="line"><a name="l02545"></a><span class="lineno"> 2545</span>  <span class="keyword">const</span> RoutingDimension& dimension)</div>
|
|
<div class="line"><a name="l02546"></a><span class="lineno"> 2546</span>  : IntVarLocalSearchFilter(dimension.<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->Nexts()),</div>
|
|
<div class="line"><a name="l02547"></a><span class="lineno"> 2547</span>  propagator_(&dimension),</div>
|
|
<div class="line"><a name="l02548"></a><span class="lineno"> 2548</span>  cumul_offset_(dimension.GetGlobalOptimizerOffset()),</div>
|
|
<div class="line"><a name="l02549"></a><span class="lineno"> 2549</span>  delta_touched_(Size()),</div>
|
|
<div class="line"><a name="l02550"></a><span class="lineno"> 2550</span>  delta_nexts_(Size()) {}</div>
|
|
<div class="line"><a name="l02551"></a><span class="lineno"> 2551</span>  </div>
|
|
<div class="line"><a name="l02552"></a><span class="lineno"> 2552</span> <span class="keywordtype">bool</span> CumulBoundsPropagatorFilter::Accept(<span class="keyword">const</span> Assignment* <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>,</div>
|
|
<div class="line"><a name="l02553"></a><span class="lineno"> 2553</span>  <span class="keyword">const</span> Assignment* deltadelta,</div>
|
|
<div class="line"><a name="l02554"></a><span class="lineno"> 2554</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_min,</div>
|
|
<div class="line"><a name="l02555"></a><span class="lineno"> 2555</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_max) {</div>
|
|
<div class="line"><a name="l02556"></a><span class="lineno"> 2556</span>  delta_touched_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#aa7d76b766faf39c1652b6617eac5fe20">ClearAll</a>();</div>
|
|
<div class="line"><a name="l02557"></a><span class="lineno"> 2557</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntVarElement& delta_element :</div>
|
|
<div class="line"><a name="l02558"></a><span class="lineno"> 2558</span>  <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>->IntVarContainer().elements()) {</div>
|
|
<div class="line"><a name="l02559"></a><span class="lineno"> 2559</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = -1;</div>
|
|
<div class="line"><a name="l02560"></a><span class="lineno"> 2560</span>  <span class="keywordflow">if</span> (FindIndex(delta_element.Var(), &<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)) {</div>
|
|
<div class="line"><a name="l02561"></a><span class="lineno"> 2561</span>  <span class="keywordflow">if</span> (!delta_element.Bound()) {</div>
|
|
<div class="line"><a name="l02562"></a><span class="lineno"> 2562</span>  <span class="comment">// LNS detected</span></div>
|
|
<div class="line"><a name="l02563"></a><span class="lineno"> 2563</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02564"></a><span class="lineno"> 2564</span>  }</div>
|
|
<div class="line"><a name="l02565"></a><span class="lineno"> 2565</span>  delta_touched_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l02566"></a><span class="lineno"> 2566</span>  delta_nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = delta_element.Value();</div>
|
|
<div class="line"><a name="l02567"></a><span class="lineno"> 2567</span>  }</div>
|
|
<div class="line"><a name="l02568"></a><span class="lineno"> 2568</span>  }</div>
|
|
<div class="line"><a name="l02569"></a><span class="lineno"> 2569</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& next_accessor = [<span class="keyword">this</span>](<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l02570"></a><span class="lineno"> 2570</span>  <span class="keywordflow">return</span> delta_touched_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] ? delta_nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] : <a class="code" href="namespaceoperations__research_1_1sat.html#a3f1a1b8a7a1a488e263a2e74f45d2a59">Value</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l02571"></a><span class="lineno"> 2571</span>  };</div>
|
|
<div class="line"><a name="l02572"></a><span class="lineno"> 2572</span>  </div>
|
|
<div class="line"><a name="l02573"></a><span class="lineno"> 2573</span>  <span class="keywordflow">return</span> propagator_.PropagateCumulBounds(next_accessor, cumul_offset_);</div>
|
|
<div class="line"><a name="l02574"></a><span class="lineno"> 2574</span> }</div>
|
|
<div class="line"><a name="l02575"></a><span class="lineno"> 2575</span>  </div>
|
|
<div class="line"><a name="l02576"></a><span class="lineno"> 2576</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l02577"></a><span class="lineno"> 2577</span>  </div>
|
|
<div class="line"><a name="l02578"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a21d884ccc65aaa3278b977df560d31a0"> 2578</a></span> <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html">IntVarLocalSearchFilter</a>* <a class="code" href="namespaceoperations__research.html#a21d884ccc65aaa3278b977df560d31a0">MakeCumulBoundsPropagatorFilter</a>(</div>
|
|
<div class="line"><a name="l02579"></a><span class="lineno"> 2579</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>& dimension) {</div>
|
|
<div class="line"><a name="l02580"></a><span class="lineno"> 2580</span>  <span class="keywordflow">return</span> dimension.<a class="code" href="classoperations__research_1_1_routing_dimension.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a5f32c22c620c811754ba7b6f977db864">solver</a>()-><a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(</div>
|
|
<div class="line"><a name="l02581"></a><span class="lineno"> 2581</span>  <span class="keyword">new</span> CumulBoundsPropagatorFilter(dimension));</div>
|
|
<div class="line"><a name="l02582"></a><span class="lineno"> 2582</span> }</div>
|
|
<div class="line"><a name="l02583"></a><span class="lineno"> 2583</span>  </div>
|
|
<div class="line"><a name="l02584"></a><span class="lineno"> 2584</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l02585"></a><span class="lineno"> 2585</span>  </div>
|
|
<div class="line"><a name="l02586"></a><span class="lineno"> 2586</span> <span class="keyword">class </span>LPCumulFilter : <span class="keyword">public</span> IntVarLocalSearchFilter {</div>
|
|
<div class="line"><a name="l02587"></a><span class="lineno"> 2587</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l02588"></a><span class="lineno"> 2588</span>  LPCumulFilter(<span class="keyword">const</span> std::vector<IntVar*>& nexts,</div>
|
|
<div class="line"><a name="l02589"></a><span class="lineno"> 2589</span>  GlobalDimensionCumulOptimizer* optimizer,</div>
|
|
<div class="line"><a name="l02590"></a><span class="lineno"> 2590</span>  <span class="keywordtype">bool</span> filter_objective_cost);</div>
|
|
<div class="line"><a name="l02591"></a><span class="lineno"> 2591</span>  <span class="keywordtype">bool</span> Accept(<span class="keyword">const</span> Assignment* <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>, <span class="keyword">const</span> Assignment* deltadelta,</div>
|
|
<div class="line"><a name="l02592"></a><span class="lineno"> 2592</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_min, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_max) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l02593"></a><span class="lineno"> 2593</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> GetAcceptedObjectiveValue() <span class="keyword">const override</span>;</div>
|
|
<div class="line"><a name="l02594"></a><span class="lineno"> 2594</span>  <span class="keywordtype">void</span> OnSynchronize(<span class="keyword">const</span> Assignment* <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l02595"></a><span class="lineno"> 2595</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> GetSynchronizedObjectiveValue() <span class="keyword">const override</span>;</div>
|
|
<div class="line"><a name="l02596"></a><span class="lineno"> 2596</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l02597"></a><span class="lineno"> 2597</span>  <span class="keywordflow">return</span> <span class="stringliteral">"LPCumulFilter("</span> + optimizer_.dimension()->name() + <span class="stringliteral">")"</span>;</div>
|
|
<div class="line"><a name="l02598"></a><span class="lineno"> 2598</span>  }</div>
|
|
<div class="line"><a name="l02599"></a><span class="lineno"> 2599</span>  </div>
|
|
<div class="line"><a name="l02600"></a><span class="lineno"> 2600</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l02601"></a><span class="lineno"> 2601</span>  GlobalDimensionCumulOptimizer& optimizer_;</div>
|
|
<div class="line"><a name="l02602"></a><span class="lineno"> 2602</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> filter_objective_cost_;</div>
|
|
<div class="line"><a name="l02603"></a><span class="lineno"> 2603</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> synchronized_cost_without_transit_;</div>
|
|
<div class="line"><a name="l02604"></a><span class="lineno"> 2604</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delta_cost_without_transit_;</div>
|
|
<div class="line"><a name="l02605"></a><span class="lineno"> 2605</span>  SparseBitset<int64> delta_touched_;</div>
|
|
<div class="line"><a name="l02606"></a><span class="lineno"> 2606</span>  std::vector<int64> delta_nexts_;</div>
|
|
<div class="line"><a name="l02607"></a><span class="lineno"> 2607</span> };</div>
|
|
<div class="line"><a name="l02608"></a><span class="lineno"> 2608</span>  </div>
|
|
<div class="line"><a name="l02609"></a><span class="lineno"> 2609</span> LPCumulFilter::LPCumulFilter(<span class="keyword">const</span> std::vector<IntVar*>& nexts,</div>
|
|
<div class="line"><a name="l02610"></a><span class="lineno"> 2610</span>  GlobalDimensionCumulOptimizer* optimizer,</div>
|
|
<div class="line"><a name="l02611"></a><span class="lineno"> 2611</span>  <span class="keywordtype">bool</span> filter_objective_cost)</div>
|
|
<div class="line"><a name="l02612"></a><span class="lineno"> 2612</span>  : IntVarLocalSearchFilter(nexts),</div>
|
|
<div class="line"><a name="l02613"></a><span class="lineno"> 2613</span>  optimizer_(*optimizer),</div>
|
|
<div class="line"><a name="l02614"></a><span class="lineno"> 2614</span>  filter_objective_cost_(filter_objective_cost),</div>
|
|
<div class="line"><a name="l02615"></a><span class="lineno"> 2615</span>  synchronized_cost_without_transit_(-1),</div>
|
|
<div class="line"><a name="l02616"></a><span class="lineno"> 2616</span>  delta_cost_without_transit_(-1),</div>
|
|
<div class="line"><a name="l02617"></a><span class="lineno"> 2617</span>  delta_touched_(Size()),</div>
|
|
<div class="line"><a name="l02618"></a><span class="lineno"> 2618</span>  delta_nexts_(Size()) {}</div>
|
|
<div class="line"><a name="l02619"></a><span class="lineno"> 2619</span>  </div>
|
|
<div class="line"><a name="l02620"></a><span class="lineno"> 2620</span> <span class="keywordtype">bool</span> LPCumulFilter::Accept(<span class="keyword">const</span> Assignment* <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>,</div>
|
|
<div class="line"><a name="l02621"></a><span class="lineno"> 2621</span>  <span class="keyword">const</span> Assignment* deltadelta, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_min,</div>
|
|
<div class="line"><a name="l02622"></a><span class="lineno"> 2622</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_max) {</div>
|
|
<div class="line"><a name="l02623"></a><span class="lineno"> 2623</span>  delta_touched_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#aa7d76b766faf39c1652b6617eac5fe20">ClearAll</a>();</div>
|
|
<div class="line"><a name="l02624"></a><span class="lineno"> 2624</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntVarElement& delta_element :</div>
|
|
<div class="line"><a name="l02625"></a><span class="lineno"> 2625</span>  <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>->IntVarContainer().elements()) {</div>
|
|
<div class="line"><a name="l02626"></a><span class="lineno"> 2626</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = -1;</div>
|
|
<div class="line"><a name="l02627"></a><span class="lineno"> 2627</span>  <span class="keywordflow">if</span> (FindIndex(delta_element.Var(), &<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)) {</div>
|
|
<div class="line"><a name="l02628"></a><span class="lineno"> 2628</span>  <span class="keywordflow">if</span> (!delta_element.Bound()) {</div>
|
|
<div class="line"><a name="l02629"></a><span class="lineno"> 2629</span>  <span class="comment">// LNS detected</span></div>
|
|
<div class="line"><a name="l02630"></a><span class="lineno"> 2630</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02631"></a><span class="lineno"> 2631</span>  }</div>
|
|
<div class="line"><a name="l02632"></a><span class="lineno"> 2632</span>  delta_touched_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l02633"></a><span class="lineno"> 2633</span>  delta_nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = delta_element.Value();</div>
|
|
<div class="line"><a name="l02634"></a><span class="lineno"> 2634</span>  }</div>
|
|
<div class="line"><a name="l02635"></a><span class="lineno"> 2635</span>  }</div>
|
|
<div class="line"><a name="l02636"></a><span class="lineno"> 2636</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& next_accessor = [<span class="keyword">this</span>](<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l02637"></a><span class="lineno"> 2637</span>  <span class="keywordflow">return</span> delta_touched_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] ? delta_nexts_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] : <a class="code" href="namespaceoperations__research_1_1sat.html#a3f1a1b8a7a1a488e263a2e74f45d2a59">Value</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l02638"></a><span class="lineno"> 2638</span>  };</div>
|
|
<div class="line"><a name="l02639"></a><span class="lineno"> 2639</span>  </div>
|
|
<div class="line"><a name="l02640"></a><span class="lineno"> 2640</span>  <span class="keywordflow">if</span> (!filter_objective_cost_) {</div>
|
|
<div class="line"><a name="l02641"></a><span class="lineno"> 2641</span>  <span class="comment">// No need to compute the cost of the LP, only verify its feasibility.</span></div>
|
|
<div class="line"><a name="l02642"></a><span class="lineno"> 2642</span>  delta_cost_without_transit_ = 0;</div>
|
|
<div class="line"><a name="l02643"></a><span class="lineno"> 2643</span>  <span class="keywordflow">return</span> optimizer_.IsFeasible(next_accessor);</div>
|
|
<div class="line"><a name="l02644"></a><span class="lineno"> 2644</span>  }</div>
|
|
<div class="line"><a name="l02645"></a><span class="lineno"> 2645</span>  </div>
|
|
<div class="line"><a name="l02646"></a><span class="lineno"> 2646</span>  <span class="keywordflow">if</span> (!optimizer_.ComputeCumulCostWithoutFixedTransits(</div>
|
|
<div class="line"><a name="l02647"></a><span class="lineno"> 2647</span>  next_accessor, &delta_cost_without_transit_)) {</div>
|
|
<div class="line"><a name="l02648"></a><span class="lineno"> 2648</span>  <span class="comment">// Infeasible.</span></div>
|
|
<div class="line"><a name="l02649"></a><span class="lineno"> 2649</span>  delta_cost_without_transit_ = <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>;</div>
|
|
<div class="line"><a name="l02650"></a><span class="lineno"> 2650</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02651"></a><span class="lineno"> 2651</span>  }</div>
|
|
<div class="line"><a name="l02652"></a><span class="lineno"> 2652</span>  <span class="keywordflow">return</span> delta_cost_without_transit_ <= objective_max;</div>
|
|
<div class="line"><a name="l02653"></a><span class="lineno"> 2653</span> }</div>
|
|
<div class="line"><a name="l02654"></a><span class="lineno"> 2654</span>  </div>
|
|
<div class="line"><a name="l02655"></a><span class="lineno"> 2655</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> LPCumulFilter::GetAcceptedObjectiveValue()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l02656"></a><span class="lineno"> 2656</span>  <span class="keywordflow">return</span> delta_cost_without_transit_;</div>
|
|
<div class="line"><a name="l02657"></a><span class="lineno"> 2657</span> }</div>
|
|
<div class="line"><a name="l02658"></a><span class="lineno"> 2658</span>  </div>
|
|
<div class="line"><a name="l02659"></a><span class="lineno"> 2659</span> <span class="keywordtype">void</span> LPCumulFilter::OnSynchronize(<span class="keyword">const</span> Assignment* <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>) {</div>
|
|
<div class="line"><a name="l02660"></a><span class="lineno"> 2660</span>  <span class="comment">// TODO(user): Try to optimize this so the LP is not called when the last</span></div>
|
|
<div class="line"><a name="l02661"></a><span class="lineno"> 2661</span>  <span class="comment">// computed delta cost corresponds to the solution being synchronized.</span></div>
|
|
<div class="line"><a name="l02662"></a><span class="lineno"> 2662</span>  <span class="keyword">const</span> RoutingModel& <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a> = *optimizer_.dimension()->model();</div>
|
|
<div class="line"><a name="l02663"></a><span class="lineno"> 2663</span>  <span class="keywordflow">if</span> (!optimizer_.ComputeCumulCostWithoutFixedTransits(</div>
|
|
<div class="line"><a name="l02664"></a><span class="lineno"> 2664</span>  [<span class="keyword">this</span>, &<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>](<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l02665"></a><span class="lineno"> 2665</span>  return IsVarSynced(index) ? Value(index)</div>
|
|
<div class="line"><a name="l02666"></a><span class="lineno"> 2666</span>  : model.IsStart(index) ? model.End(model.VehicleIndex(index))</div>
|
|
<div class="line"><a name="l02667"></a><span class="lineno"> 2667</span>  : index;</div>
|
|
<div class="line"><a name="l02668"></a><span class="lineno"> 2668</span>  },</div>
|
|
<div class="line"><a name="l02669"></a><span class="lineno"> 2669</span>  &synchronized_cost_without_transit_)) {</div>
|
|
<div class="line"><a name="l02670"></a><span class="lineno"> 2670</span>  <span class="comment">// TODO(user): This should only happen if the LP solver times out.</span></div>
|
|
<div class="line"><a name="l02671"></a><span class="lineno"> 2671</span>  <span class="comment">// DCHECK the fail wasn't due to an infeasible model.</span></div>
|
|
<div class="line"><a name="l02672"></a><span class="lineno"> 2672</span>  synchronized_cost_without_transit_ = 0;</div>
|
|
<div class="line"><a name="l02673"></a><span class="lineno"> 2673</span>  }</div>
|
|
<div class="line"><a name="l02674"></a><span class="lineno"> 2674</span> }</div>
|
|
<div class="line"><a name="l02675"></a><span class="lineno"> 2675</span>  </div>
|
|
<div class="line"><a name="l02676"></a><span class="lineno"> 2676</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> LPCumulFilter::GetSynchronizedObjectiveValue()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l02677"></a><span class="lineno"> 2677</span>  <span class="keywordflow">return</span> synchronized_cost_without_transit_;</div>
|
|
<div class="line"><a name="l02678"></a><span class="lineno"> 2678</span> }</div>
|
|
<div class="line"><a name="l02679"></a><span class="lineno"> 2679</span>  </div>
|
|
<div class="line"><a name="l02680"></a><span class="lineno"> 2680</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l02681"></a><span class="lineno"> 2681</span>  </div>
|
|
<div class="line"><a name="l02682"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a2781a8c44a6af7c07abf923678a18697"> 2682</a></span> <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html">IntVarLocalSearchFilter</a>* <a class="code" href="namespaceoperations__research.html#a2781a8c44a6af7c07abf923678a18697">MakeGlobalLPCumulFilter</a>(</div>
|
|
<div class="line"><a name="l02683"></a><span class="lineno"> 2683</span>  <a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html">GlobalDimensionCumulOptimizer</a>* optimizer, <span class="keywordtype">bool</span> filter_objective_cost) {</div>
|
|
<div class="line"><a name="l02684"></a><span class="lineno"> 2684</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>& <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a> = *optimizer-><a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>()-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a35a576bb3ea6814f122593d44a3c391e">model</a>();</div>
|
|
<div class="line"><a name="l02685"></a><span class="lineno"> 2685</span>  <span class="keywordflow">return</span> <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.solver()->RevAlloc(</div>
|
|
<div class="line"><a name="l02686"></a><span class="lineno"> 2686</span>  <span class="keyword">new</span> LPCumulFilter(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.Nexts(), optimizer, filter_objective_cost));</div>
|
|
<div class="line"><a name="l02687"></a><span class="lineno"> 2687</span> }</div>
|
|
<div class="line"><a name="l02688"></a><span class="lineno"> 2688</span>  </div>
|
|
<div class="line"><a name="l02689"></a><span class="lineno"> 2689</span> <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">CPFeasibilityFilter::kUnassigned</a> = -1;</div>
|
|
<div class="line"><a name="l02690"></a><span class="lineno"> 2690</span>  </div>
|
|
<div class="line"><a name="l02691"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_c_p_feasibility_filter.html#aa5d1e2c6c49b99c19285356f01d924b5"> 2691</a></span> CPFeasibilityFilter::CPFeasibilityFilter(<a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* routing_model)</div>
|
|
<div class="line"><a name="l02692"></a><span class="lineno"> 2692</span>  : <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html">IntVarLocalSearchFilter</a>(routing_model->Nexts()),</div>
|
|
<div class="line"><a name="l02693"></a><span class="lineno"> 2693</span>  model_(routing_model),</div>
|
|
<div class="line"><a name="l02694"></a><span class="lineno"> 2694</span>  solver_(routing_model->solver()),</div>
|
|
<div class="line"><a name="l02695"></a><span class="lineno"> 2695</span>  assignment_(solver_->MakeAssignment()),</div>
|
|
<div class="line"><a name="l02696"></a><span class="lineno"> 2696</span>  temp_assignment_(solver_->MakeAssignment()),</div>
|
|
<div class="line"><a name="l02697"></a><span class="lineno"> 2697</span>  restore_(solver_->MakeRestoreAssignment(temp_assignment_)),</div>
|
|
<div class="line"><a name="l02698"></a><span class="lineno"> 2698</span>  <a class="code" href="expressions_8cc.html#a3c46258b924243eeeb3608b2df18db4f">limit_</a>(solver_->MakeCustomLimit(</div>
|
|
<div class="line"><a name="l02699"></a><span class="lineno"> 2699</span>  [routing_model]() { <span class="keywordflow">return</span> routing_model-><a class="code" href="classoperations__research_1_1_routing_model.html#a3f5d70fe48cb54cbc5d8f6bba55b007d">CheckLimit</a>(); })) {</div>
|
|
<div class="line"><a name="l02700"></a><span class="lineno"> 2700</span>  assignment_-><a class="code" href="classoperations__research_1_1_assignment.html#ae8ff1d18d50b93a2499ccd7130addecb">Add</a>(routing_model->Nexts());</div>
|
|
<div class="line"><a name="l02701"></a><span class="lineno"> 2701</span> }</div>
|
|
<div class="line"><a name="l02702"></a><span class="lineno"> 2702</span>  </div>
|
|
<div class="line"><a name="l02703"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_c_p_feasibility_filter.html#a511cf14b54c83cffc0a673985db90643"> 2703</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_c_p_feasibility_filter.html#a511cf14b54c83cffc0a673985db90643">CPFeasibilityFilter::Accept</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_assignment.html">Assignment</a>* <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>,</div>
|
|
<div class="line"><a name="l02704"></a><span class="lineno"> 2704</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_assignment.html">Assignment</a>* deltadelta,</div>
|
|
<div class="line"><a name="l02705"></a><span class="lineno"> 2705</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_min, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> objective_max) {</div>
|
|
<div class="line"><a name="l02706"></a><span class="lineno"> 2706</span>  temp_assignment_-><a class="code" href="classoperations__research_1_1_assignment.html#ac97eab84adb6cc33ae0124c944a4f8c7">Copy</a>(assignment_);</div>
|
|
<div class="line"><a name="l02707"></a><span class="lineno"> 2707</span>  AddDeltaToAssignment(<a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>, temp_assignment_);</div>
|
|
<div class="line"><a name="l02708"></a><span class="lineno"> 2708</span>  </div>
|
|
<div class="line"><a name="l02709"></a><span class="lineno"> 2709</span>  <span class="keywordflow">return</span> solver_-><a class="code" href="classoperations__research_1_1_solver.html#a946780dfafc8faa3dd2d345850213be5">Solve</a>(restore_, limit_);</div>
|
|
<div class="line"><a name="l02710"></a><span class="lineno"> 2710</span> }</div>
|
|
<div class="line"><a name="l02711"></a><span class="lineno"> 2711</span>  </div>
|
|
<div class="line"><a name="l02712"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_c_p_feasibility_filter.html#af5591ad1889b7e23b8461a1fb68d1d48"> 2712</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_c_p_feasibility_filter.html#af5591ad1889b7e23b8461a1fb68d1d48">CPFeasibilityFilter::OnSynchronize</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_assignment.html">Assignment</a>* <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>) {</div>
|
|
<div class="line"><a name="l02713"></a><span class="lineno"> 2713</span>  AddDeltaToAssignment(<a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>, assignment_);</div>
|
|
<div class="line"><a name="l02714"></a><span class="lineno"> 2714</span> }</div>
|
|
<div class="line"><a name="l02715"></a><span class="lineno"> 2715</span>  </div>
|
|
<div class="line"><a name="l02716"></a><span class="lineno"> 2716</span> <span class="keywordtype">void</span> CPFeasibilityFilter::AddDeltaToAssignment(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_assignment.html">Assignment</a>* <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>,</div>
|
|
<div class="line"><a name="l02717"></a><span class="lineno"> 2717</span>  <a class="code" href="classoperations__research_1_1_assignment.html">Assignment</a>* assignment) {</div>
|
|
<div class="line"><a name="l02718"></a><span class="lineno"> 2718</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a> == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l02719"></a><span class="lineno"> 2719</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l02720"></a><span class="lineno"> 2720</span>  }</div>
|
|
<div class="line"><a name="l02721"></a><span class="lineno"> 2721</span>  <a class="code" href="classoperations__research_1_1_assignment.html#ace2db6f9700f6a2159db104f5df1dc8f">Assignment::IntContainer</a>* <span class="keyword">const</span> container =</div>
|
|
<div class="line"><a name="l02722"></a><span class="lineno"> 2722</span>  assignment-><a class="code" href="classoperations__research_1_1_assignment.html#a11963e86e6bc074096264e96ccd5c755">MutableIntVarContainer</a>();</div>
|
|
<div class="line"><a name="l02723"></a><span class="lineno"> 2723</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_assignment.html#ace2db6f9700f6a2159db104f5df1dc8f">Assignment::IntContainer</a>& delta_container = <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>->IntVarContainer();</div>
|
|
<div class="line"><a name="l02724"></a><span class="lineno"> 2724</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> delta_size = delta_container.Size();</div>
|
|
<div class="line"><a name="l02725"></a><span class="lineno"> 2725</span>  </div>
|
|
<div class="line"><a name="l02726"></a><span class="lineno"> 2726</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < delta_size; i++) {</div>
|
|
<div class="line"><a name="l02727"></a><span class="lineno"> 2727</span>  <span class="keyword">const</span> IntVarElement& delta_element = delta_container.Element(i);</div>
|
|
<div class="line"><a name="l02728"></a><span class="lineno"> 2728</span>  IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = delta_element.Var();</div>
|
|
<div class="line"><a name="l02729"></a><span class="lineno"> 2729</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = kUnassigned;</div>
|
|
<div class="line"><a name="l02730"></a><span class="lineno"> 2730</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#a1907b3ee12b9e6e2bfc69e1a69b5baf0">FindIndex</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, &<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>));</div>
|
|
<div class="line"><a name="l02731"></a><span class="lineno"> 2731</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html#abbab4c9580ab21b8dbd7af67ab35f393">Var</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>));</div>
|
|
<div class="line"><a name="l02732"></a><span class="lineno"> 2732</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> = delta_element.Value();</div>
|
|
<div class="line"><a name="l02733"></a><span class="lineno"> 2733</span>  </div>
|
|
<div class="line"><a name="l02734"></a><span class="lineno"> 2734</span>  container->AddAtPosition(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)->SetValue(<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>);</div>
|
|
<div class="line"><a name="l02735"></a><span class="lineno"> 2735</span>  <span class="keywordflow">if</span> (model_-><a class="code" href="classoperations__research_1_1_routing_model.html#ae1adbc353c105572655ae866124c61b6">IsStart</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)) {</div>
|
|
<div class="line"><a name="l02736"></a><span class="lineno"> 2736</span>  <span class="keywordflow">if</span> (model_-><a class="code" href="classoperations__research_1_1_routing_model.html#ae2530e17cabaf267e12929ca0ee1bee0">IsEnd</a>(<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>)) {</div>
|
|
<div class="line"><a name="l02737"></a><span class="lineno"> 2737</span>  <span class="comment">// Do not restore unused routes.</span></div>
|
|
<div class="line"><a name="l02738"></a><span class="lineno"> 2738</span>  container->MutableElement(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)->Deactivate();</div>
|
|
<div class="line"><a name="l02739"></a><span class="lineno"> 2739</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02740"></a><span class="lineno"> 2740</span>  <span class="comment">// Re-activate the route's start in case it was deactivated before.</span></div>
|
|
<div class="line"><a name="l02741"></a><span class="lineno"> 2741</span>  container->MutableElement(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)->Activate();</div>
|
|
<div class="line"><a name="l02742"></a><span class="lineno"> 2742</span>  }</div>
|
|
<div class="line"><a name="l02743"></a><span class="lineno"> 2743</span>  }</div>
|
|
<div class="line"><a name="l02744"></a><span class="lineno"> 2744</span>  }</div>
|
|
<div class="line"><a name="l02745"></a><span class="lineno"> 2745</span> }</div>
|
|
<div class="line"><a name="l02746"></a><span class="lineno"> 2746</span>  </div>
|
|
<div class="line"><a name="l02747"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a6a24a85a196ecfb2b799a0409ef757c6"> 2747</a></span> <a class="code" href="classoperations__research_1_1_int_var_local_search_filter.html">IntVarLocalSearchFilter</a>* <a class="code" href="namespaceoperations__research.html#a6a24a85a196ecfb2b799a0409ef757c6">MakeCPFeasibilityFilter</a>(<a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* routing_model) {</div>
|
|
<div class="line"><a name="l02748"></a><span class="lineno"> 2748</span>  <span class="keywordflow">return</span> routing_model-><a class="code" href="classoperations__research_1_1_routing_model.html#a5f32c22c620c811754ba7b6f977db864">solver</a>()-><a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(</div>
|
|
<div class="line"><a name="l02749"></a><span class="lineno"> 2749</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1_c_p_feasibility_filter.html">CPFeasibilityFilter</a>(routing_model));</div>
|
|
<div class="line"><a name="l02750"></a><span class="lineno"> 2750</span> }</div>
|
|
<div class="line"><a name="l02751"></a><span class="lineno"> 2751</span>  </div>
|
|
<div class="line"><a name="l02752"></a><span class="lineno"> 2752</span> <span class="comment">// TODO(user): Implement same-vehicle filter. Could be merged with node</span></div>
|
|
<div class="line"><a name="l02753"></a><span class="lineno"> 2753</span> <span class="comment">// precedence filter.</span></div>
|
|
<div class="line"><a name="l02754"></a><span class="lineno"> 2754</span>  </div>
|
|
<div class="line"><a name="l02755"></a><span class="lineno"> 2755</span> <span class="comment">// --- VehicleTypeCurator ---</span></div>
|
|
<div class="line"><a name="l02756"></a><span class="lineno"> 2756</span>  </div>
|
|
<div class="line"><a name="l02757"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_vehicle_type_curator.html#a814500d3b9447208c46bd15c6f95f96d"> 2757</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_vehicle_type_curator.html#a814500d3b9447208c46bd15c6f95f96d">VehicleTypeCurator::Reset</a>(<span class="keyword">const</span> std::function<<span class="keywordtype">bool</span>(<span class="keywordtype">int</span>)>& store_vehicle) {</div>
|
|
<div class="line"><a name="l02758"></a><span class="lineno"> 2758</span>  <span class="keyword">const</span> std::vector<std::set<VehicleClassEntry>>& all_vehicle_classes_per_type =</div>
|
|
<div class="line"><a name="l02759"></a><span class="lineno"> 2759</span>  vehicle_type_container_-><a class="code" href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container.html#ab04b34ed94012cf2d892d6e9347ee9f6">sorted_vehicle_classes_per_type</a>;</div>
|
|
<div class="line"><a name="l02760"></a><span class="lineno"> 2760</span>  sorted_vehicle_classes_per_type_.resize(all_vehicle_classes_per_type.size());</div>
|
|
<div class="line"><a name="l02761"></a><span class="lineno"> 2761</span>  <span class="keyword">const</span> std::vector<std::deque<int>>& all_vehicles_per_class =</div>
|
|
<div class="line"><a name="l02762"></a><span class="lineno"> 2762</span>  vehicle_type_container_-><a class="code" href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container.html#ad39f5508cc37e45b2d759832d343c177">vehicles_per_vehicle_class</a>;</div>
|
|
<div class="line"><a name="l02763"></a><span class="lineno"> 2763</span>  vehicles_per_vehicle_class_.resize(all_vehicles_per_class.size());</div>
|
|
<div class="line"><a name="l02764"></a><span class="lineno"> 2764</span>  </div>
|
|
<div class="line"><a name="l02765"></a><span class="lineno"> 2765</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> type = 0; type < all_vehicle_classes_per_type.size(); type++) {</div>
|
|
<div class="line"><a name="l02766"></a><span class="lineno"> 2766</span>  std::set<VehicleClassEntry>& stored_class_entries =</div>
|
|
<div class="line"><a name="l02767"></a><span class="lineno"> 2767</span>  sorted_vehicle_classes_per_type_[type];</div>
|
|
<div class="line"><a name="l02768"></a><span class="lineno"> 2768</span>  stored_class_entries.clear();</div>
|
|
<div class="line"><a name="l02769"></a><span class="lineno"> 2769</span>  <span class="keywordflow">for</span> (<a class="code" href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container_1_1_vehicle_class_entry.html">VehicleClassEntry</a> class_entry : all_vehicle_classes_per_type[type]) {</div>
|
|
<div class="line"><a name="l02770"></a><span class="lineno"> 2770</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle_class = class_entry.vehicle_class;</div>
|
|
<div class="line"><a name="l02771"></a><span class="lineno"> 2771</span>  std::vector<int>& stored_vehicles =</div>
|
|
<div class="line"><a name="l02772"></a><span class="lineno"> 2772</span>  vehicles_per_vehicle_class_[vehicle_class];</div>
|
|
<div class="line"><a name="l02773"></a><span class="lineno"> 2773</span>  stored_vehicles.clear();</div>
|
|
<div class="line"><a name="l02774"></a><span class="lineno"> 2774</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle : all_vehicles_per_class[vehicle_class]) {</div>
|
|
<div class="line"><a name="l02775"></a><span class="lineno"> 2775</span>  <span class="keywordflow">if</span> (store_vehicle(vehicle)) {</div>
|
|
<div class="line"><a name="l02776"></a><span class="lineno"> 2776</span>  stored_vehicles.push_back(vehicle);</div>
|
|
<div class="line"><a name="l02777"></a><span class="lineno"> 2777</span>  }</div>
|
|
<div class="line"><a name="l02778"></a><span class="lineno"> 2778</span>  }</div>
|
|
<div class="line"><a name="l02779"></a><span class="lineno"> 2779</span>  <span class="keywordflow">if</span> (!stored_vehicles.empty()) {</div>
|
|
<div class="line"><a name="l02780"></a><span class="lineno"> 2780</span>  stored_class_entries.insert(class_entry);</div>
|
|
<div class="line"><a name="l02781"></a><span class="lineno"> 2781</span>  }</div>
|
|
<div class="line"><a name="l02782"></a><span class="lineno"> 2782</span>  }</div>
|
|
<div class="line"><a name="l02783"></a><span class="lineno"> 2783</span>  }</div>
|
|
<div class="line"><a name="l02784"></a><span class="lineno"> 2784</span> }</div>
|
|
<div class="line"><a name="l02785"></a><span class="lineno"> 2785</span>  </div>
|
|
<div class="line"><a name="l02786"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_vehicle_type_curator.html#a14dcf3d10159ae170c79ac9cac11cf5b"> 2786</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_vehicle_type_curator.html#a14dcf3d10159ae170c79ac9cac11cf5b">VehicleTypeCurator::Update</a>(</div>
|
|
<div class="line"><a name="l02787"></a><span class="lineno"> 2787</span>  <span class="keyword">const</span> std::function<<span class="keywordtype">bool</span>(<span class="keywordtype">int</span>)>& remove_vehicle) {</div>
|
|
<div class="line"><a name="l02788"></a><span class="lineno"> 2788</span>  <span class="keywordflow">for</span> (std::set<VehicleClassEntry>& class_entries :</div>
|
|
<div class="line"><a name="l02789"></a><span class="lineno"> 2789</span>  sorted_vehicle_classes_per_type_) {</div>
|
|
<div class="line"><a name="l02790"></a><span class="lineno"> 2790</span>  <span class="keyword">auto</span> class_entry_it = class_entries.begin();</div>
|
|
<div class="line"><a name="l02791"></a><span class="lineno"> 2791</span>  <span class="keywordflow">while</span> (class_entry_it != class_entries.end()) {</div>
|
|
<div class="line"><a name="l02792"></a><span class="lineno"> 2792</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle_class = class_entry_it->vehicle_class;</div>
|
|
<div class="line"><a name="l02793"></a><span class="lineno"> 2793</span>  std::vector<int>& vehicles = vehicles_per_vehicle_class_[vehicle_class];</div>
|
|
<div class="line"><a name="l02794"></a><span class="lineno"> 2794</span>  vehicles.erase(std::remove_if(vehicles.begin(), vehicles.end(),</div>
|
|
<div class="line"><a name="l02795"></a><span class="lineno"> 2795</span>  [&remove_vehicle](<span class="keywordtype">int</span> vehicle) {</div>
|
|
<div class="line"><a name="l02796"></a><span class="lineno"> 2796</span>  return remove_vehicle(vehicle);</div>
|
|
<div class="line"><a name="l02797"></a><span class="lineno"> 2797</span>  }),</div>
|
|
<div class="line"><a name="l02798"></a><span class="lineno"> 2798</span>  vehicles.end());</div>
|
|
<div class="line"><a name="l02799"></a><span class="lineno"> 2799</span>  <span class="keywordflow">if</span> (vehicles.empty()) {</div>
|
|
<div class="line"><a name="l02800"></a><span class="lineno"> 2800</span>  class_entry_it = class_entries.erase(class_entry_it);</div>
|
|
<div class="line"><a name="l02801"></a><span class="lineno"> 2801</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02802"></a><span class="lineno"> 2802</span>  class_entry_it++;</div>
|
|
<div class="line"><a name="l02803"></a><span class="lineno"> 2803</span>  }</div>
|
|
<div class="line"><a name="l02804"></a><span class="lineno"> 2804</span>  }</div>
|
|
<div class="line"><a name="l02805"></a><span class="lineno"> 2805</span>  }</div>
|
|
<div class="line"><a name="l02806"></a><span class="lineno"> 2806</span> }</div>
|
|
<div class="line"><a name="l02807"></a><span class="lineno"> 2807</span>  </div>
|
|
<div class="line"><a name="l02808"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_vehicle_type_curator.html#a3c728b8544bdbae03f52979a1fda6f90"> 2808</a></span> std::pair<int, int> <a class="code" href="classoperations__research_1_1_vehicle_type_curator.html#a3c728b8544bdbae03f52979a1fda6f90">VehicleTypeCurator::GetCompatibleVehicleOfType</a>(</div>
|
|
<div class="line"><a name="l02809"></a><span class="lineno"> 2809</span>  <span class="keywordtype">int</span> type, std::function<<span class="keywordtype">bool</span>(<span class="keywordtype">int</span>)> vehicle_is_compatible,</div>
|
|
<div class="line"><a name="l02810"></a><span class="lineno"> 2810</span>  std::function<<span class="keywordtype">bool</span>(<span class="keywordtype">int</span>)> stop_and_return_vehicle) {</div>
|
|
<div class="line"><a name="l02811"></a><span class="lineno"> 2811</span>  std::set<VehicleTypeCurator::VehicleClassEntry>& sorted_classes =</div>
|
|
<div class="line"><a name="l02812"></a><span class="lineno"> 2812</span>  sorted_vehicle_classes_per_type_[type];</div>
|
|
<div class="line"><a name="l02813"></a><span class="lineno"> 2813</span>  <span class="keyword">auto</span> vehicle_class_it = sorted_classes.begin();</div>
|
|
<div class="line"><a name="l02814"></a><span class="lineno"> 2814</span>  </div>
|
|
<div class="line"><a name="l02815"></a><span class="lineno"> 2815</span>  <span class="keywordflow">while</span> (vehicle_class_it != sorted_classes.end()) {</div>
|
|
<div class="line"><a name="l02816"></a><span class="lineno"> 2816</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle_class = vehicle_class_it->vehicle_class;</div>
|
|
<div class="line"><a name="l02817"></a><span class="lineno"> 2817</span>  std::vector<int>& vehicles = vehicles_per_vehicle_class_[vehicle_class];</div>
|
|
<div class="line"><a name="l02818"></a><span class="lineno"> 2818</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!vehicles.empty());</div>
|
|
<div class="line"><a name="l02819"></a><span class="lineno"> 2819</span>  </div>
|
|
<div class="line"><a name="l02820"></a><span class="lineno"> 2820</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> vehicle_it = vehicles.begin(); vehicle_it != vehicles.end();</div>
|
|
<div class="line"><a name="l02821"></a><span class="lineno"> 2821</span>  vehicle_it++) {</div>
|
|
<div class="line"><a name="l02822"></a><span class="lineno"> 2822</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = *vehicle_it;</div>
|
|
<div class="line"><a name="l02823"></a><span class="lineno"> 2823</span>  <span class="keywordflow">if</span> (vehicle_is_compatible(vehicle)) {</div>
|
|
<div class="line"><a name="l02824"></a><span class="lineno"> 2824</span>  vehicles.erase(vehicle_it);</div>
|
|
<div class="line"><a name="l02825"></a><span class="lineno"> 2825</span>  <span class="keywordflow">if</span> (vehicles.empty()) {</div>
|
|
<div class="line"><a name="l02826"></a><span class="lineno"> 2826</span>  sorted_classes.erase(vehicle_class_it);</div>
|
|
<div class="line"><a name="l02827"></a><span class="lineno"> 2827</span>  }</div>
|
|
<div class="line"><a name="l02828"></a><span class="lineno"> 2828</span>  <span class="keywordflow">return</span> {vehicle, -1};</div>
|
|
<div class="line"><a name="l02829"></a><span class="lineno"> 2829</span>  }</div>
|
|
<div class="line"><a name="l02830"></a><span class="lineno"> 2830</span>  <span class="keywordflow">if</span> (stop_and_return_vehicle(vehicle)) {</div>
|
|
<div class="line"><a name="l02831"></a><span class="lineno"> 2831</span>  <span class="keywordflow">return</span> {-1, vehicle};</div>
|
|
<div class="line"><a name="l02832"></a><span class="lineno"> 2832</span>  }</div>
|
|
<div class="line"><a name="l02833"></a><span class="lineno"> 2833</span>  }</div>
|
|
<div class="line"><a name="l02834"></a><span class="lineno"> 2834</span>  <span class="comment">// If no compatible vehicle was found in this class, move on to the next</span></div>
|
|
<div class="line"><a name="l02835"></a><span class="lineno"> 2835</span>  <span class="comment">// vehicle class.</span></div>
|
|
<div class="line"><a name="l02836"></a><span class="lineno"> 2836</span>  vehicle_class_it++;</div>
|
|
<div class="line"><a name="l02837"></a><span class="lineno"> 2837</span>  }</div>
|
|
<div class="line"><a name="l02838"></a><span class="lineno"> 2838</span>  <span class="comment">// No compatible vehicle of the given type was found and the stopping</span></div>
|
|
<div class="line"><a name="l02839"></a><span class="lineno"> 2839</span>  <span class="comment">// condition wasn't met.</span></div>
|
|
<div class="line"><a name="l02840"></a><span class="lineno"> 2840</span>  <span class="keywordflow">return</span> {-1, -1};</div>
|
|
<div class="line"><a name="l02841"></a><span class="lineno"> 2841</span> }</div>
|
|
<div class="line"><a name="l02842"></a><span class="lineno"> 2842</span>  </div>
|
|
<div class="line"><a name="l02843"></a><span class="lineno"> 2843</span> <span class="comment">// --- First solution decision builder ---</span></div>
|
|
<div class="line"><a name="l02844"></a><span class="lineno"> 2844</span>  </div>
|
|
<div class="line"><a name="l02845"></a><span class="lineno"> 2845</span> <span class="comment">// IntVarFilteredDecisionBuilder</span></div>
|
|
<div class="line"><a name="l02846"></a><span class="lineno"> 2846</span>  </div>
|
|
<div class="line"><a name="l02847"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#acf25bca8c52b674f343820aaf3d339b5"> 2847</a></span> <a class="code" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#acf25bca8c52b674f343820aaf3d339b5">IntVarFilteredDecisionBuilder::IntVarFilteredDecisionBuilder</a>(</div>
|
|
<div class="line"><a name="l02848"></a><span class="lineno"> 2848</span>  std::unique_ptr<IntVarFilteredHeuristic> heuristic)</div>
|
|
<div class="line"><a name="l02849"></a><span class="lineno"> 2849</span>  : heuristic_(std::move(heuristic)) {}</div>
|
|
<div class="line"><a name="l02850"></a><span class="lineno"> 2850</span>  </div>
|
|
<div class="line"><a name="l02851"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#a8c71ca62b0ac538bf37374602e4259bb"> 2851</a></span> <a class="code" href="classoperations__research_1_1_decision.html">Decision</a>* <a class="code" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#a8c71ca62b0ac538bf37374602e4259bb">IntVarFilteredDecisionBuilder::Next</a>(<a class="code" href="classoperations__research_1_1_solver.html">Solver</a>* solver) {</div>
|
|
<div class="line"><a name="l02852"></a><span class="lineno"> 2852</span>  <a class="code" href="classoperations__research_1_1_assignment.html">Assignment</a>* <span class="keyword">const</span> assignment = heuristic_->BuildSolution();</div>
|
|
<div class="line"><a name="l02853"></a><span class="lineno"> 2853</span>  <span class="keywordflow">if</span> (assignment != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l02854"></a><span class="lineno"> 2854</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"Number of decisions: "</span> << heuristic_->number_of_decisions();</div>
|
|
<div class="line"><a name="l02855"></a><span class="lineno"> 2855</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"Number of rejected decisions: "</span></div>
|
|
<div class="line"><a name="l02856"></a><span class="lineno"> 2856</span>  << heuristic_->number_of_rejects();</div>
|
|
<div class="line"><a name="l02857"></a><span class="lineno"> 2857</span>  assignment-><a class="code" href="classoperations__research_1_1_assignment.html#a1896fe755b612dbebd2c46638f8977a2">Restore</a>();</div>
|
|
<div class="line"><a name="l02858"></a><span class="lineno"> 2858</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02859"></a><span class="lineno"> 2859</span>  solver-><a class="code" href="classoperations__research_1_1_solver.html#aeb92d4addb41255c9732cacfcb54f795">Fail</a>();</div>
|
|
<div class="line"><a name="l02860"></a><span class="lineno"> 2860</span>  }</div>
|
|
<div class="line"><a name="l02861"></a><span class="lineno"> 2861</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l02862"></a><span class="lineno"> 2862</span> }</div>
|
|
<div class="line"><a name="l02863"></a><span class="lineno"> 2863</span>  </div>
|
|
<div class="line"><a name="l02864"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#ab9cbb9e796806062460be9c7a4033e80"> 2864</a></span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#ab9cbb9e796806062460be9c7a4033e80">IntVarFilteredDecisionBuilder::number_of_decisions</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l02865"></a><span class="lineno"> 2865</span>  <span class="keywordflow">return</span> heuristic_->number_of_decisions();</div>
|
|
<div class="line"><a name="l02866"></a><span class="lineno"> 2866</span> }</div>
|
|
<div class="line"><a name="l02867"></a><span class="lineno"> 2867</span>  </div>
|
|
<div class="line"><a name="l02868"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#ab35b677ad56dbdc2521d9bb28a68f566"> 2868</a></span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#ab35b677ad56dbdc2521d9bb28a68f566">IntVarFilteredDecisionBuilder::number_of_rejects</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l02869"></a><span class="lineno"> 2869</span>  <span class="keywordflow">return</span> heuristic_->number_of_rejects();</div>
|
|
<div class="line"><a name="l02870"></a><span class="lineno"> 2870</span> }</div>
|
|
<div class="line"><a name="l02871"></a><span class="lineno"> 2871</span>  </div>
|
|
<div class="line"><a name="l02872"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#aed804747c45a7e1caf81461f9e45dd91"> 2872</a></span> std::string <a class="code" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#aed804747c45a7e1caf81461f9e45dd91">IntVarFilteredDecisionBuilder::DebugString</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l02873"></a><span class="lineno"> 2873</span>  <span class="keywordflow">return</span> absl::StrCat(<span class="stringliteral">"IntVarFilteredDecisionBuilder("</span>,</div>
|
|
<div class="line"><a name="l02874"></a><span class="lineno"> 2874</span>  heuristic_->DebugString(), <span class="stringliteral">")"</span>);</div>
|
|
<div class="line"><a name="l02875"></a><span class="lineno"> 2875</span> }</div>
|
|
<div class="line"><a name="l02876"></a><span class="lineno"> 2876</span>  </div>
|
|
<div class="line"><a name="l02877"></a><span class="lineno"> 2877</span> <span class="comment">// --- First solution heuristics ---</span></div>
|
|
<div class="line"><a name="l02878"></a><span class="lineno"> 2878</span>  </div>
|
|
<div class="line"><a name="l02879"></a><span class="lineno"> 2879</span> <span class="comment">// IntVarFilteredHeuristic</span></div>
|
|
<div class="line"><a name="l02880"></a><span class="lineno"> 2880</span>  </div>
|
|
<div class="line"><a name="l02881"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae4af3c0813025d58bd52dcd93ff6aae7"> 2881</a></span> <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae4af3c0813025d58bd52dcd93ff6aae7">IntVarFilteredHeuristic::IntVarFilteredHeuristic</a>(</div>
|
|
<div class="line"><a name="l02882"></a><span class="lineno"> 2882</span>  <a class="code" href="classoperations__research_1_1_solver.html">Solver</a>* solver, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a name="l02883"></a><span class="lineno"> 2883</span>  <a class="code" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager)</div>
|
|
<div class="line"><a name="l02884"></a><span class="lineno"> 2884</span>  : assignment_(solver->MakeAssignment()),</div>
|
|
<div class="line"><a name="l02885"></a><span class="lineno"> 2885</span>  solver_(solver),</div>
|
|
<div class="line"><a name="l02886"></a><span class="lineno"> 2886</span>  <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>(vars),</div>
|
|
<div class="line"><a name="l02887"></a><span class="lineno"> 2887</span>  delta_(solver->MakeAssignment()),</div>
|
|
<div class="line"><a name="l02888"></a><span class="lineno"> 2888</span>  is_in_delta_(<a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(), false),</div>
|
|
<div class="line"><a name="l02889"></a><span class="lineno"> 2889</span>  empty_(solver->MakeAssignment()),</div>
|
|
<div class="line"><a name="l02890"></a><span class="lineno"> 2890</span>  filter_manager_(filter_manager),</div>
|
|
<div class="line"><a name="l02891"></a><span class="lineno"> 2891</span>  number_of_decisions_(0),</div>
|
|
<div class="line"><a name="l02892"></a><span class="lineno"> 2892</span>  number_of_rejects_(0) {</div>
|
|
<div class="line"><a name="l02893"></a><span class="lineno"> 2893</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a6743122cc2fc4818b402ba3d484c6ea4">assignment_</a>-><a class="code" href="classoperations__research_1_1_assignment.html#a11963e86e6bc074096264e96ccd5c755">MutableIntVarContainer</a>()-><a class="code" href="classoperations__research_1_1_assignment_container.html#ad9cf0e91780366986c2f047bd796cdd5">Resize</a>(vars_.size());</div>
|
|
<div class="line"><a name="l02894"></a><span class="lineno"> 2894</span>  delta_indices_.reserve(vars_.size());</div>
|
|
<div class="line"><a name="l02895"></a><span class="lineno"> 2895</span> }</div>
|
|
<div class="line"><a name="l02896"></a><span class="lineno"> 2896</span>  </div>
|
|
<div class="line"><a name="l02897"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a7ae7a2033e2a22ad1dedbf2f3ec8745f"> 2897</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a7ae7a2033e2a22ad1dedbf2f3ec8745f">IntVarFilteredHeuristic::ResetSolution</a>() {</div>
|
|
<div class="line"><a name="l02898"></a><span class="lineno"> 2898</span>  number_of_decisions_ = 0;</div>
|
|
<div class="line"><a name="l02899"></a><span class="lineno"> 2899</span>  number_of_rejects_ = 0;</div>
|
|
<div class="line"><a name="l02900"></a><span class="lineno"> 2900</span>  <span class="comment">// Wiping assignment when starting a new search.</span></div>
|
|
<div class="line"><a name="l02901"></a><span class="lineno"> 2901</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a6743122cc2fc4818b402ba3d484c6ea4">assignment_</a>-><a class="code" href="classoperations__research_1_1_assignment.html#a11963e86e6bc074096264e96ccd5c755">MutableIntVarContainer</a>()-><a class="code" href="classoperations__research_1_1_assignment_container.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
|
|
<div class="line"><a name="l02902"></a><span class="lineno"> 2902</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a6743122cc2fc4818b402ba3d484c6ea4">assignment_</a>-><a class="code" href="classoperations__research_1_1_assignment.html#a11963e86e6bc074096264e96ccd5c755">MutableIntVarContainer</a>()-><a class="code" href="classoperations__research_1_1_assignment_container.html#ad9cf0e91780366986c2f047bd796cdd5">Resize</a>(vars_.size());</div>
|
|
<div class="line"><a name="l02903"></a><span class="lineno"> 2903</span>  delta_-><a class="code" href="classoperations__research_1_1_assignment.html#a11963e86e6bc074096264e96ccd5c755">MutableIntVarContainer</a>()-><a class="code" href="classoperations__research_1_1_assignment_container.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
|
|
<div class="line"><a name="l02904"></a><span class="lineno"> 2904</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a8447b106d07db2466b60e534964730d3">SynchronizeFilters</a>();</div>
|
|
<div class="line"><a name="l02905"></a><span class="lineno"> 2905</span> }</div>
|
|
<div class="line"><a name="l02906"></a><span class="lineno"> 2906</span>  </div>
|
|
<div class="line"><a name="l02907"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#af3787f4febdbe5033e9834b770476f5d"> 2907</a></span> <a class="code" href="classoperations__research_1_1_assignment.html">Assignment</a>* <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#af3787f4febdbe5033e9834b770476f5d">IntVarFilteredHeuristic::BuildSolution</a>() {</div>
|
|
<div class="line"><a name="l02908"></a><span class="lineno"> 2908</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a7ae7a2033e2a22ad1dedbf2f3ec8745f">ResetSolution</a>();</div>
|
|
<div class="line"><a name="l02909"></a><span class="lineno"> 2909</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#aa1103b3a47f7bf316a81ed91ba3e4657">InitializeSolution</a>()) {</div>
|
|
<div class="line"><a name="l02910"></a><span class="lineno"> 2910</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l02911"></a><span class="lineno"> 2911</span>  }</div>
|
|
<div class="line"><a name="l02912"></a><span class="lineno"> 2912</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a8447b106d07db2466b60e534964730d3">SynchronizeFilters</a>();</div>
|
|
<div class="line"><a name="l02913"></a><span class="lineno"> 2913</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0c46fa4dcc0fed2329041bbe90fc575a">BuildSolutionInternal</a>()) {</div>
|
|
<div class="line"><a name="l02914"></a><span class="lineno"> 2914</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a6743122cc2fc4818b402ba3d484c6ea4">assignment_</a>;</div>
|
|
<div class="line"><a name="l02915"></a><span class="lineno"> 2915</span>  }</div>
|
|
<div class="line"><a name="l02916"></a><span class="lineno"> 2916</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l02917"></a><span class="lineno"> 2917</span> }</div>
|
|
<div class="line"><a name="l02918"></a><span class="lineno"> 2918</span>  </div>
|
|
<div class="line"><a name="l02919"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_filtered_heuristic.html#a9099c1d103124dca895eaa153e0656d4"> 2919</a></span> <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_assignment.html">Assignment</a>* <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a9099c1d103124dca895eaa153e0656d4">RoutingFilteredHeuristic::BuildSolutionFromRoutes</a>(</div>
|
|
<div class="line"><a name="l02920"></a><span class="lineno"> 2920</span>  <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor) {</div>
|
|
<div class="line"><a name="l02921"></a><span class="lineno"> 2921</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a7ae7a2033e2a22ad1dedbf2f3ec8745f">ResetSolution</a>();</div>
|
|
<div class="line"><a name="l02922"></a><span class="lineno"> 2922</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aafb639a547b12967feeefae66a3d3276">ResetVehicleIndices</a>();</div>
|
|
<div class="line"><a name="l02923"></a><span class="lineno"> 2923</span>  <span class="comment">// NOTE: We don't need to clear or pre-set the two following vectors as the</span></div>
|
|
<div class="line"><a name="l02924"></a><span class="lineno"> 2924</span>  <span class="comment">// for loop below will set all elements.</span></div>
|
|
<div class="line"><a name="l02925"></a><span class="lineno"> 2925</span>  start_chain_ends_.resize(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->vehicles());</div>
|
|
<div class="line"><a name="l02926"></a><span class="lineno"> 2926</span>  end_chain_starts_.resize(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->vehicles());</div>
|
|
<div class="line"><a name="l02927"></a><span class="lineno"> 2927</span>  </div>
|
|
<div class="line"><a name="l02928"></a><span class="lineno"> 2928</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> v = 0; v < model_-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); v++) {</div>
|
|
<div class="line"><a name="l02929"></a><span class="lineno"> 2929</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = model_-><a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(v);</div>
|
|
<div class="line"><a name="l02930"></a><span class="lineno"> 2930</span>  <span class="keywordflow">while</span> (!model_-><a class="code" href="classoperations__research_1_1_routing_model.html#ae2530e17cabaf267e12929ca0ee1bee0">IsEnd</a>(node)) {</div>
|
|
<div class="line"><a name="l02931"></a><span class="lineno"> 2931</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = next_accessor(node);</div>
|
|
<div class="line"><a name="l02932"></a><span class="lineno"> 2932</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, node);</div>
|
|
<div class="line"><a name="l02933"></a><span class="lineno"> 2933</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(node, <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a name="l02934"></a><span class="lineno"> 2934</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95c564e1bf2622acbd6868c6a61bc3a0">SetVehicleIndex</a>(node, v);</div>
|
|
<div class="line"><a name="l02935"></a><span class="lineno"> 2935</span>  node = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l02936"></a><span class="lineno"> 2936</span>  }</div>
|
|
<div class="line"><a name="l02937"></a><span class="lineno"> 2937</span>  <span class="comment">// We relax all routes from start to end, so routes can now be extended</span></div>
|
|
<div class="line"><a name="l02938"></a><span class="lineno"> 2938</span>  <span class="comment">// by inserting nodes between the start and end.</span></div>
|
|
<div class="line"><a name="l02939"></a><span class="lineno"> 2939</span>  start_chain_ends_[v] = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(v);</div>
|
|
<div class="line"><a name="l02940"></a><span class="lineno"> 2940</span>  end_chain_starts_[v] = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a1dc8d32892f78532c8ee7a7186158e07">End</a>(v);</div>
|
|
<div class="line"><a name="l02941"></a><span class="lineno"> 2941</span>  }</div>
|
|
<div class="line"><a name="l02942"></a><span class="lineno"> 2942</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>()) {</div>
|
|
<div class="line"><a name="l02943"></a><span class="lineno"> 2943</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l02944"></a><span class="lineno"> 2944</span>  }</div>
|
|
<div class="line"><a name="l02945"></a><span class="lineno"> 2945</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a8447b106d07db2466b60e534964730d3">SynchronizeFilters</a>();</div>
|
|
<div class="line"><a name="l02946"></a><span class="lineno"> 2946</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0c46fa4dcc0fed2329041bbe90fc575a">BuildSolutionInternal</a>()) {</div>
|
|
<div class="line"><a name="l02947"></a><span class="lineno"> 2947</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a6743122cc2fc4818b402ba3d484c6ea4">assignment_</a>;</div>
|
|
<div class="line"><a name="l02948"></a><span class="lineno"> 2948</span>  }</div>
|
|
<div class="line"><a name="l02949"></a><span class="lineno"> 2949</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l02950"></a><span class="lineno"> 2950</span> }</div>
|
|
<div class="line"><a name="l02951"></a><span class="lineno"> 2951</span>  </div>
|
|
<div class="line"><a name="l02952"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a"> 2952</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">IntVarFilteredHeuristic::Commit</a>() {</div>
|
|
<div class="line"><a name="l02953"></a><span class="lineno"> 2953</span>  ++number_of_decisions_;</div>
|
|
<div class="line"><a name="l02954"></a><span class="lineno"> 2954</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> accept = FilterAccept();</div>
|
|
<div class="line"><a name="l02955"></a><span class="lineno"> 2955</span>  <span class="keywordflow">if</span> (accept) {</div>
|
|
<div class="line"><a name="l02956"></a><span class="lineno"> 2956</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_assignment_container.html">Assignment::IntContainer</a>& delta_container = delta_-><a class="code" href="classoperations__research_1_1_assignment.html#a1f16f5a2e5767013b620efd255fb35ea">IntVarContainer</a>();</div>
|
|
<div class="line"><a name="l02957"></a><span class="lineno"> 2957</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> delta_size = delta_container.<a class="code" href="classoperations__research_1_1_assignment_container.html#a24926108b770033792d015cb86aeffb3">Size</a>();</div>
|
|
<div class="line"><a name="l02958"></a><span class="lineno"> 2958</span>  <a class="code" href="classoperations__research_1_1_assignment_container.html">Assignment::IntContainer</a>* <span class="keyword">const</span> container =</div>
|
|
<div class="line"><a name="l02959"></a><span class="lineno"> 2959</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a6743122cc2fc4818b402ba3d484c6ea4">assignment_</a>-><a class="code" href="classoperations__research_1_1_assignment.html#a11963e86e6bc074096264e96ccd5c755">MutableIntVarContainer</a>();</div>
|
|
<div class="line"><a name="l02960"></a><span class="lineno"> 2960</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < delta_size; ++i) {</div>
|
|
<div class="line"><a name="l02961"></a><span class="lineno"> 2961</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_int_var_element.html">IntVarElement</a>& delta_element = delta_container.<a class="code" href="classoperations__research_1_1_assignment_container.html#a907ce7f41938cc755b6b1f4a55b5cd27">Element</a>(i);</div>
|
|
<div class="line"><a name="l02962"></a><span class="lineno"> 2962</span>  <a class="code" href="classoperations__research_1_1_int_var.html">IntVar</a>* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = delta_element.<a class="code" href="classoperations__research_1_1_int_var_element.html#a8052ccc3aba839f3befd553cc05b85a0">Var</a>();</div>
|
|
<div class="line"><a name="l02963"></a><span class="lineno"> 2963</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, vars_[delta_indices_[i]]);</div>
|
|
<div class="line"><a name="l02964"></a><span class="lineno"> 2964</span>  container-><a class="code" href="classoperations__research_1_1_assignment_container.html#a55e6ebe94a380d6a66e470eafc84f6ff">AddAtPosition</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, delta_indices_[i])</div>
|
|
<div class="line"><a name="l02965"></a><span class="lineno"> 2965</span>  -><a class="code" href="classoperations__research_1_1_int_var_element.html#ace66161c2f260353b4f03ef33455cd2f">SetValue</a>(delta_element.<a class="code" href="classoperations__research_1_1_int_var_element.html#aeabf4572ab5bf48ec3e07660c9587385">Value</a>());</div>
|
|
<div class="line"><a name="l02966"></a><span class="lineno"> 2966</span>  }</div>
|
|
<div class="line"><a name="l02967"></a><span class="lineno"> 2967</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a8447b106d07db2466b60e534964730d3">SynchronizeFilters</a>();</div>
|
|
<div class="line"><a name="l02968"></a><span class="lineno"> 2968</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02969"></a><span class="lineno"> 2969</span>  ++number_of_rejects_;</div>
|
|
<div class="line"><a name="l02970"></a><span class="lineno"> 2970</span>  }</div>
|
|
<div class="line"><a name="l02971"></a><span class="lineno"> 2971</span>  <span class="comment">// Reset is_in_delta to all false.</span></div>
|
|
<div class="line"><a name="l02972"></a><span class="lineno"> 2972</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> delta_index : delta_indices_) {</div>
|
|
<div class="line"><a name="l02973"></a><span class="lineno"> 2973</span>  is_in_delta_[delta_index] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l02974"></a><span class="lineno"> 2974</span>  }</div>
|
|
<div class="line"><a name="l02975"></a><span class="lineno"> 2975</span>  delta_-><a class="code" href="classoperations__research_1_1_assignment.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
|
|
<div class="line"><a name="l02976"></a><span class="lineno"> 2976</span>  delta_indices_.clear();</div>
|
|
<div class="line"><a name="l02977"></a><span class="lineno"> 2977</span>  <span class="keywordflow">return</span> accept;</div>
|
|
<div class="line"><a name="l02978"></a><span class="lineno"> 2978</span> }</div>
|
|
<div class="line"><a name="l02979"></a><span class="lineno"> 2979</span>  </div>
|
|
<div class="line"><a name="l02980"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a8447b106d07db2466b60e534964730d3"> 2980</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a8447b106d07db2466b60e534964730d3">IntVarFilteredHeuristic::SynchronizeFilters</a>() {</div>
|
|
<div class="line"><a name="l02981"></a><span class="lineno"> 2981</span>  <span class="keywordflow">if</span> (filter_manager_) filter_manager_-><a class="code" href="classoperations__research_1_1_local_search_filter_manager.html#ae90693395653f673140e7bee51daf656">Synchronize</a>(<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a6743122cc2fc4818b402ba3d484c6ea4">assignment_</a>, delta_);</div>
|
|
<div class="line"><a name="l02982"></a><span class="lineno"> 2982</span> }</div>
|
|
<div class="line"><a name="l02983"></a><span class="lineno"> 2983</span>  </div>
|
|
<div class="line"><a name="l02984"></a><span class="lineno"> 2984</span> <span class="keywordtype">bool</span> IntVarFilteredHeuristic::FilterAccept() {</div>
|
|
<div class="line"><a name="l02985"></a><span class="lineno"> 2985</span>  <span class="keywordflow">if</span> (!filter_manager_) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l02986"></a><span class="lineno"> 2986</span>  <a class="code" href="classoperations__research_1_1_local_search_monitor.html">LocalSearchMonitor</a>* <span class="keyword">const</span> monitor = solver_-><a class="code" href="classoperations__research_1_1_solver.html#a869f7ed2cc6505c59ecf1eb8ecb2288a">GetLocalSearchMonitor</a>();</div>
|
|
<div class="line"><a name="l02987"></a><span class="lineno"> 2987</span>  <span class="keywordflow">return</span> filter_manager_-><a class="code" href="classoperations__research_1_1_local_search_filter_manager.html#ac01556936ee8bcfe89ee8a7088ee260d">Accept</a>(monitor, delta_, empty_, <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>, <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>);</div>
|
|
<div class="line"><a name="l02988"></a><span class="lineno"> 2988</span> }</div>
|
|
<div class="line"><a name="l02989"></a><span class="lineno"> 2989</span>  </div>
|
|
<div class="line"><a name="l02990"></a><span class="lineno"> 2990</span> <span class="comment">// RoutingFilteredHeuristic</span></div>
|
|
<div class="line"><a name="l02991"></a><span class="lineno"> 2991</span>  </div>
|
|
<div class="line"><a name="l02992"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_filtered_heuristic.html#aebd7c1966b7626a3b6cdfcbbc69ae2cc"> 2992</a></span> <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aebd7c1966b7626a3b6cdfcbbc69ae2cc">RoutingFilteredHeuristic::RoutingFilteredHeuristic</a>(</div>
|
|
<div class="line"><a name="l02993"></a><span class="lineno"> 2993</span>  <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager)</div>
|
|
<div class="line"><a name="l02994"></a><span class="lineno"> 2994</span>  : <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html">IntVarFilteredHeuristic</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->solver(), <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Nexts(), filter_manager),</div>
|
|
<div class="line"><a name="l02995"></a><span class="lineno"> 2995</span>  model_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {}</div>
|
|
<div class="line"><a name="l02996"></a><span class="lineno"> 2996</span>  </div>
|
|
<div class="line"><a name="l02997"></a><span class="lineno"> 2997</span> <span class="keywordtype">bool</span> RoutingFilteredHeuristic::InitializeSolution() {</div>
|
|
<div class="line"><a name="l02998"></a><span class="lineno"> 2998</span>  <span class="comment">// Find the chains of nodes (when nodes have their "Next" value bound in the</span></div>
|
|
<div class="line"><a name="l02999"></a><span class="lineno"> 2999</span>  <span class="comment">// current solution, it forms a link in a chain). Eventually, starts[end]</span></div>
|
|
<div class="line"><a name="l03000"></a><span class="lineno"> 3000</span>  <span class="comment">// will contain the index of the first node of the chain ending at node 'end'</span></div>
|
|
<div class="line"><a name="l03001"></a><span class="lineno"> 3001</span>  <span class="comment">// and ends[start] will be the last node of the chain starting at node</span></div>
|
|
<div class="line"><a name="l03002"></a><span class="lineno"> 3002</span>  <span class="comment">// 'start'. Values of starts[node] and ends[node] for other nodes is used</span></div>
|
|
<div class="line"><a name="l03003"></a><span class="lineno"> 3003</span>  <span class="comment">// for intermediary computations and do not necessarily reflect actual chain</span></div>
|
|
<div class="line"><a name="l03004"></a><span class="lineno"> 3004</span>  <span class="comment">// starts and ends.</span></div>
|
|
<div class="line"><a name="l03005"></a><span class="lineno"> 3005</span>  </div>
|
|
<div class="line"><a name="l03006"></a><span class="lineno"> 3006</span>  <span class="comment">// Start by adding partial start chains to current assignment.</span></div>
|
|
<div class="line"><a name="l03007"></a><span class="lineno"> 3007</span>  start_chain_ends_.clear();</div>
|
|
<div class="line"><a name="l03008"></a><span class="lineno"> 3008</span>  start_chain_ends_.resize(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->vehicles(), -1);</div>
|
|
<div class="line"><a name="l03009"></a><span class="lineno"> 3009</span>  end_chain_starts_.clear();</div>
|
|
<div class="line"><a name="l03010"></a><span class="lineno"> 3010</span>  end_chain_starts_.resize(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->vehicles(), -1);</div>
|
|
<div class="line"><a name="l03011"></a><span class="lineno"> 3011</span>  </div>
|
|
<div class="line"><a name="l03012"></a><span class="lineno"> 3012</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aafb639a547b12967feeefae66a3d3276">ResetVehicleIndices</a>();</div>
|
|
<div class="line"><a name="l03013"></a><span class="lineno"> 3013</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); ++vehicle) {</div>
|
|
<div class="line"><a name="l03014"></a><span class="lineno"> 3014</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(vehicle);</div>
|
|
<div class="line"><a name="l03015"></a><span class="lineno"> 3015</span>  <span class="keywordflow">while</span> (!<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->IsEnd(node) && <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a609a96f8163121290267059fc6f27a4a">Var</a>(node)->Bound()) {</div>
|
|
<div class="line"><a name="l03016"></a><span class="lineno"> 3016</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a609a96f8163121290267059fc6f27a4a">Var</a>(node)-><a class="code" href="classoperations__research_1_1_int_expr.html#ac4a4f30badcd311075302a4efcfaee0a">Min</a>();</div>
|
|
<div class="line"><a name="l03017"></a><span class="lineno"> 3017</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(node, <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a name="l03018"></a><span class="lineno"> 3018</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95c564e1bf2622acbd6868c6a61bc3a0">SetVehicleIndex</a>(node, vehicle);</div>
|
|
<div class="line"><a name="l03019"></a><span class="lineno"> 3019</span>  node = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l03020"></a><span class="lineno"> 3020</span>  }</div>
|
|
<div class="line"><a name="l03021"></a><span class="lineno"> 3021</span>  start_chain_ends_[vehicle] = node;</div>
|
|
<div class="line"><a name="l03022"></a><span class="lineno"> 3022</span>  }</div>
|
|
<div class="line"><a name="l03023"></a><span class="lineno"> 3023</span>  </div>
|
|
<div class="line"><a name="l03024"></a><span class="lineno"> 3024</span>  std::vector<int64> starts(<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>() + <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->vehicles(), -1);</div>
|
|
<div class="line"><a name="l03025"></a><span class="lineno"> 3025</span>  std::vector<int64> ends(<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>() + <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->vehicles(), -1);</div>
|
|
<div class="line"><a name="l03026"></a><span class="lineno"> 3026</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>() + <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); ++node) {</div>
|
|
<div class="line"><a name="l03027"></a><span class="lineno"> 3027</span>  <span class="comment">// Each node starts as a singleton chain.</span></div>
|
|
<div class="line"><a name="l03028"></a><span class="lineno"> 3028</span>  starts[node] = node;</div>
|
|
<div class="line"><a name="l03029"></a><span class="lineno"> 3029</span>  ends[node] = node;</div>
|
|
<div class="line"><a name="l03030"></a><span class="lineno"> 3030</span>  }</div>
|
|
<div class="line"><a name="l03031"></a><span class="lineno"> 3031</span>  std::vector<bool> touched(<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l03032"></a><span class="lineno"> 3032</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>(); ++node) {</div>
|
|
<div class="line"><a name="l03033"></a><span class="lineno"> 3033</span>  <span class="keywordtype">int</span> current = node;</div>
|
|
<div class="line"><a name="l03034"></a><span class="lineno"> 3034</span>  <span class="keywordflow">while</span> (!<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#ae2530e17cabaf267e12929ca0ee1bee0">IsEnd</a>(current) && !touched[current]) {</div>
|
|
<div class="line"><a name="l03035"></a><span class="lineno"> 3035</span>  touched[current] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l03036"></a><span class="lineno"> 3036</span>  IntVar* <span class="keyword">const</span> next_var = <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a609a96f8163121290267059fc6f27a4a">Var</a>(current);</div>
|
|
<div class="line"><a name="l03037"></a><span class="lineno"> 3037</span>  <span class="keywordflow">if</span> (next_var->Bound()) {</div>
|
|
<div class="line"><a name="l03038"></a><span class="lineno"> 3038</span>  current = next_var->Value();</div>
|
|
<div class="line"><a name="l03039"></a><span class="lineno"> 3039</span>  }</div>
|
|
<div class="line"><a name="l03040"></a><span class="lineno"> 3040</span>  }</div>
|
|
<div class="line"><a name="l03041"></a><span class="lineno"> 3041</span>  <span class="comment">// Merge the sub-chain starting from 'node' and ending at 'current' with</span></div>
|
|
<div class="line"><a name="l03042"></a><span class="lineno"> 3042</span>  <span class="comment">// the existing sub-chain starting at 'current'.</span></div>
|
|
<div class="line"><a name="l03043"></a><span class="lineno"> 3043</span>  starts[ends[current]] = starts[node];</div>
|
|
<div class="line"><a name="l03044"></a><span class="lineno"> 3044</span>  ends[starts[node]] = ends[current];</div>
|
|
<div class="line"><a name="l03045"></a><span class="lineno"> 3045</span>  }</div>
|
|
<div class="line"><a name="l03046"></a><span class="lineno"> 3046</span>  </div>
|
|
<div class="line"><a name="l03047"></a><span class="lineno"> 3047</span>  <span class="comment">// Set each route to be the concatenation of the chain at its starts and the</span></div>
|
|
<div class="line"><a name="l03048"></a><span class="lineno"> 3048</span>  <span class="comment">// chain at its end, without nodes in between.</span></div>
|
|
<div class="line"><a name="l03049"></a><span class="lineno"> 3049</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); ++vehicle) {</div>
|
|
<div class="line"><a name="l03050"></a><span class="lineno"> 3050</span>  end_chain_starts_[vehicle] = starts[<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a1dc8d32892f78532c8ee7a7186158e07">End</a>(vehicle)];</div>
|
|
<div class="line"><a name="l03051"></a><span class="lineno"> 3051</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = start_chain_ends_[vehicle];</div>
|
|
<div class="line"><a name="l03052"></a><span class="lineno"> 3052</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->IsEnd(node)) {</div>
|
|
<div class="line"><a name="l03053"></a><span class="lineno"> 3053</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = starts[<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a1dc8d32892f78532c8ee7a7186158e07">End</a>(vehicle)];</div>
|
|
<div class="line"><a name="l03054"></a><span class="lineno"> 3054</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(node, <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a name="l03055"></a><span class="lineno"> 3055</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95c564e1bf2622acbd6868c6a61bc3a0">SetVehicleIndex</a>(node, vehicle);</div>
|
|
<div class="line"><a name="l03056"></a><span class="lineno"> 3056</span>  node = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l03057"></a><span class="lineno"> 3057</span>  <span class="keywordflow">while</span> (!<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->IsEnd(node)) {</div>
|
|
<div class="line"><a name="l03058"></a><span class="lineno"> 3058</span>  <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a609a96f8163121290267059fc6f27a4a">Var</a>(node)-><a class="code" href="classoperations__research_1_1_int_expr.html#ac4a4f30badcd311075302a4efcfaee0a">Min</a>();</div>
|
|
<div class="line"><a name="l03059"></a><span class="lineno"> 3059</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(node, <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a name="l03060"></a><span class="lineno"> 3060</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95c564e1bf2622acbd6868c6a61bc3a0">SetVehicleIndex</a>(node, vehicle);</div>
|
|
<div class="line"><a name="l03061"></a><span class="lineno"> 3061</span>  node = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l03062"></a><span class="lineno"> 3062</span>  }</div>
|
|
<div class="line"><a name="l03063"></a><span class="lineno"> 3063</span>  }</div>
|
|
<div class="line"><a name="l03064"></a><span class="lineno"> 3064</span>  }</div>
|
|
<div class="line"><a name="l03065"></a><span class="lineno"> 3065</span>  </div>
|
|
<div class="line"><a name="l03066"></a><span class="lineno"> 3066</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>()) {</div>
|
|
<div class="line"><a name="l03067"></a><span class="lineno"> 3067</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aafb639a547b12967feeefae66a3d3276">ResetVehicleIndices</a>();</div>
|
|
<div class="line"><a name="l03068"></a><span class="lineno"> 3068</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l03069"></a><span class="lineno"> 3069</span>  }</div>
|
|
<div class="line"><a name="l03070"></a><span class="lineno"> 3070</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l03071"></a><span class="lineno"> 3071</span> }</div>
|
|
<div class="line"><a name="l03072"></a><span class="lineno"> 3072</span>  </div>
|
|
<div class="line"><a name="l03073"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_filtered_heuristic.html#aa0ae711364aadabc5365babc40a79fed"> 3073</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aa0ae711364aadabc5365babc40a79fed">RoutingFilteredHeuristic::MakeDisjunctionNodesUnperformed</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node) {</div>
|
|
<div class="line"><a name="l03074"></a><span class="lineno"> 3074</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a32b850e71c62d48b685e29952e03ba4b">ForEachNodeInDisjunctionWithMaxCardinalityFromIndex</a>(</div>
|
|
<div class="line"><a name="l03075"></a><span class="lineno"> 3075</span>  node, 1, [<span class="keyword">this</span>, node](<span class="keywordtype">int</span> alternate) {</div>
|
|
<div class="line"><a name="l03076"></a><span class="lineno"> 3076</span>  <span class="keywordflow">if</span> (node != alternate && !<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(alternate)) {</div>
|
|
<div class="line"><a name="l03077"></a><span class="lineno"> 3077</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(alternate, alternate);</div>
|
|
<div class="line"><a name="l03078"></a><span class="lineno"> 3078</span>  }</div>
|
|
<div class="line"><a name="l03079"></a><span class="lineno"> 3079</span>  });</div>
|
|
<div class="line"><a name="l03080"></a><span class="lineno"> 3080</span> }</div>
|
|
<div class="line"><a name="l03081"></a><span class="lineno"> 3081</span>  </div>
|
|
<div class="line"><a name="l03082"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_filtered_heuristic.html#a97049801609b8cb68c0428970f916fd4"> 3082</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a97049801609b8cb68c0428970f916fd4">RoutingFilteredHeuristic::MakeUnassignedNodesUnperformed</a>() {</div>
|
|
<div class="line"><a name="l03083"></a><span class="lineno"> 3083</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0; <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>(); ++<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l03084"></a><span class="lineno"> 3084</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)) {</div>
|
|
<div class="line"><a name="l03085"></a><span class="lineno"> 3085</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l03086"></a><span class="lineno"> 3086</span>  }</div>
|
|
<div class="line"><a name="l03087"></a><span class="lineno"> 3087</span>  }</div>
|
|
<div class="line"><a name="l03088"></a><span class="lineno"> 3088</span> }</div>
|
|
<div class="line"><a name="l03089"></a><span class="lineno"> 3089</span>  </div>
|
|
<div class="line"><a name="l03090"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_filtered_heuristic.html#abaca104cf41b5a5e3554f8ad72cdc28c"> 3090</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#abaca104cf41b5a5e3554f8ad72cdc28c">RoutingFilteredHeuristic::MakePartiallyPerformedPairsUnperformed</a>() {</div>
|
|
<div class="line"><a name="l03091"></a><span class="lineno"> 3091</span>  std::vector<bool> to_make_unperformed(<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l03092"></a><span class="lineno"> 3092</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& [pickups, deliveries] :</div>
|
|
<div class="line"><a name="l03093"></a><span class="lineno"> 3093</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->GetPickupAndDeliveryPairs()) {</div>
|
|
<div class="line"><a name="l03094"></a><span class="lineno"> 3094</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> performed_pickup = -1;</div>
|
|
<div class="line"><a name="l03095"></a><span class="lineno"> 3095</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup : pickups) {</div>
|
|
<div class="line"><a name="l03096"></a><span class="lineno"> 3096</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(pickup) && <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(pickup) != pickup) {</div>
|
|
<div class="line"><a name="l03097"></a><span class="lineno"> 3097</span>  performed_pickup = pickup;</div>
|
|
<div class="line"><a name="l03098"></a><span class="lineno"> 3098</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l03099"></a><span class="lineno"> 3099</span>  }</div>
|
|
<div class="line"><a name="l03100"></a><span class="lineno"> 3100</span>  }</div>
|
|
<div class="line"><a name="l03101"></a><span class="lineno"> 3101</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> performed_delivery = -1;</div>
|
|
<div class="line"><a name="l03102"></a><span class="lineno"> 3102</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery : deliveries) {</div>
|
|
<div class="line"><a name="l03103"></a><span class="lineno"> 3103</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(delivery) && <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(delivery) != delivery) {</div>
|
|
<div class="line"><a name="l03104"></a><span class="lineno"> 3104</span>  performed_delivery = delivery;</div>
|
|
<div class="line"><a name="l03105"></a><span class="lineno"> 3105</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l03106"></a><span class="lineno"> 3106</span>  }</div>
|
|
<div class="line"><a name="l03107"></a><span class="lineno"> 3107</span>  }</div>
|
|
<div class="line"><a name="l03108"></a><span class="lineno"> 3108</span>  <span class="keywordflow">if</span> ((performed_pickup == -1) != (performed_delivery == -1)) {</div>
|
|
<div class="line"><a name="l03109"></a><span class="lineno"> 3109</span>  <span class="keywordflow">if</span> (performed_pickup != -1) {</div>
|
|
<div class="line"><a name="l03110"></a><span class="lineno"> 3110</span>  to_make_unperformed[performed_pickup] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l03111"></a><span class="lineno"> 3111</span>  }</div>
|
|
<div class="line"><a name="l03112"></a><span class="lineno"> 3112</span>  <span class="keywordflow">if</span> (performed_delivery != -1) {</div>
|
|
<div class="line"><a name="l03113"></a><span class="lineno"> 3113</span>  to_make_unperformed[performed_delivery] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l03114"></a><span class="lineno"> 3114</span>  }</div>
|
|
<div class="line"><a name="l03115"></a><span class="lineno"> 3115</span>  }</div>
|
|
<div class="line"><a name="l03116"></a><span class="lineno"> 3116</span>  }</div>
|
|
<div class="line"><a name="l03117"></a><span class="lineno"> 3117</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0; <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>(); ++<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l03118"></a><span class="lineno"> 3118</span>  <span class="keywordflow">if</span> (to_make_unperformed[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] || !<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l03119"></a><span class="lineno"> 3119</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l03120"></a><span class="lineno"> 3120</span>  <span class="keywordflow">while</span> (<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> < <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>() && to_make_unperformed[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>]) {</div>
|
|
<div class="line"><a name="l03121"></a><span class="lineno"> 3121</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> next_of_next = <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a name="l03122"></a><span class="lineno"> 3122</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, next_of_next);</div>
|
|
<div class="line"><a name="l03123"></a><span class="lineno"> 3123</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a name="l03124"></a><span class="lineno"> 3124</span>  <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = next_of_next;</div>
|
|
<div class="line"><a name="l03125"></a><span class="lineno"> 3125</span>  }</div>
|
|
<div class="line"><a name="l03126"></a><span class="lineno"> 3126</span>  }</div>
|
|
<div class="line"><a name="l03127"></a><span class="lineno"> 3127</span> }</div>
|
|
<div class="line"><a name="l03128"></a><span class="lineno"> 3128</span>  </div>
|
|
<div class="line"><a name="l03129"></a><span class="lineno"> 3129</span> <span class="comment">// CheapestInsertionFilteredHeuristic</span></div>
|
|
<div class="line"><a name="l03130"></a><span class="lineno"> 3130</span>  </div>
|
|
<div class="line"><a name="l03131"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a0f3b9fe9ee459bb28fb151fae2cfeac9"> 3131</a></span> <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a0f3b9fe9ee459bb28fb151fae2cfeac9">CheapestInsertionFilteredHeuristic::CheapestInsertionFilteredHeuristic</a>(</div>
|
|
<div class="line"><a name="l03132"></a><span class="lineno"> 3132</span>  <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)> evaluator,</div>
|
|
<div class="line"><a name="l03133"></a><span class="lineno"> 3133</span>  std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)> penalty_evaluator,</div>
|
|
<div class="line"><a name="l03134"></a><span class="lineno"> 3134</span>  <a class="code" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager)</div>
|
|
<div class="line"><a name="l03135"></a><span class="lineno"> 3135</span>  : <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html">RoutingFilteredHeuristic</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, filter_manager),</div>
|
|
<div class="line"><a name="l03136"></a><span class="lineno"> 3136</span>  <a class="code" href="search_8cc.html#a5e5e8b8520054d3bdeb53ef0291ce4d9">evaluator_</a>(std::move(evaluator)),</div>
|
|
<div class="line"><a name="l03137"></a><span class="lineno"> 3137</span>  penalty_evaluator_(std::move(penalty_evaluator)) {}</div>
|
|
<div class="line"><a name="l03138"></a><span class="lineno"> 3138</span>  </div>
|
|
<div class="line"><a name="l03139"></a><span class="lineno"> 3139</span> std::vector<std::vector<CheapestInsertionFilteredHeuristic::StartEndValue>></div>
|
|
<div class="line"><a name="l03140"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a356517cd51c4b6259d7f439718719eaa"> 3140</a></span> <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a356517cd51c4b6259d7f439718719eaa">CheapestInsertionFilteredHeuristic::ComputeStartEndDistanceForVehicles</a>(</div>
|
|
<div class="line"><a name="l03141"></a><span class="lineno"> 3141</span>  <span class="keyword">const</span> std::vector<int>& vehicles) {</div>
|
|
<div class="line"><a name="l03142"></a><span class="lineno"> 3142</span>  std::vector<std::vector<StartEndValue>> start_end_distances_per_node(</div>
|
|
<div class="line"><a name="l03143"></a><span class="lineno"> 3143</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>());</div>
|
|
<div class="line"><a name="l03144"></a><span class="lineno"> 3144</span>  </div>
|
|
<div class="line"><a name="l03145"></a><span class="lineno"> 3145</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a354dd8c252cf59b748602b342db6019d">Size</a>(); node++) {</div>
|
|
<div class="line"><a name="l03146"></a><span class="lineno"> 3146</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(node)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l03147"></a><span class="lineno"> 3147</span>  std::vector<StartEndValue>& start_end_distances =</div>
|
|
<div class="line"><a name="l03148"></a><span class="lineno"> 3148</span>  start_end_distances_per_node[node];</div>
|
|
<div class="line"><a name="l03149"></a><span class="lineno"> 3149</span>  </div>
|
|
<div class="line"><a name="l03150"></a><span class="lineno"> 3150</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> vehicle : vehicles) {</div>
|
|
<div class="line"><a name="l03151"></a><span class="lineno"> 3151</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_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(vehicle);</div>
|
|
<div class="line"><a name="l03152"></a><span class="lineno"> 3152</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_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a1dc8d32892f78532c8ee7a7186158e07">End</a>(vehicle);</div>
|
|
<div class="line"><a name="l03153"></a><span class="lineno"> 3153</span>  </div>
|
|
<div class="line"><a name="l03154"></a><span class="lineno"> 3154</span>  <span class="comment">// We compute the distance of node to the start/end nodes of the route.</span></div>
|
|
<div class="line"><a name="l03155"></a><span class="lineno"> 3155</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> distance =</div>
|
|
<div class="line"><a name="l03156"></a><span class="lineno"> 3156</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->GetArcCostForVehicle(start, node, vehicle),</div>
|
|
<div class="line"><a name="l03157"></a><span class="lineno"> 3157</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->GetArcCostForVehicle(node, end, vehicle));</div>
|
|
<div class="line"><a name="l03158"></a><span class="lineno"> 3158</span>  start_end_distances.push_back({distance, vehicle});</div>
|
|
<div class="line"><a name="l03159"></a><span class="lineno"> 3159</span>  }</div>
|
|
<div class="line"><a name="l03160"></a><span class="lineno"> 3160</span>  <span class="comment">// Sort the distances for the node to all start/ends of available vehicles</span></div>
|
|
<div class="line"><a name="l03161"></a><span class="lineno"> 3161</span>  <span class="comment">// in decreasing order.</span></div>
|
|
<div class="line"><a name="l03162"></a><span class="lineno"> 3162</span>  std::sort(start_end_distances.begin(), start_end_distances.end(),</div>
|
|
<div class="line"><a name="l03163"></a><span class="lineno"> 3163</span>  [](<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html">StartEndValue</a>& first, <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html">StartEndValue</a>& second) {</div>
|
|
<div class="line"><a name="l03164"></a><span class="lineno"> 3164</span>  return second < first;</div>
|
|
<div class="line"><a name="l03165"></a><span class="lineno"> 3165</span>  });</div>
|
|
<div class="line"><a name="l03166"></a><span class="lineno"> 3166</span>  }</div>
|
|
<div class="line"><a name="l03167"></a><span class="lineno"> 3167</span>  <span class="keywordflow">return</span> start_end_distances_per_node;</div>
|
|
<div class="line"><a name="l03168"></a><span class="lineno"> 3168</span> }</div>
|
|
<div class="line"><a name="l03169"></a><span class="lineno"> 3169</span>  </div>
|
|
<div class="line"><a name="l03170"></a><span class="lineno"> 3170</span> <span class="keyword">template</span> <<span class="keyword">class</span> Queue></div>
|
|
<div class="line"><a name="l03171"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a130281cc84d40c5b20bd31d21943fced"> 3171</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a69d38e86eb8fc2fa4df0d8839c8dd5a9">CheapestInsertionFilteredHeuristic::InitializePriorityQueue</a>(</div>
|
|
<div class="line"><a name="l03172"></a><span class="lineno"> 3172</span>  std::vector<std::vector<StartEndValue>>* start_end_distances_per_node,</div>
|
|
<div class="line"><a name="l03173"></a><span class="lineno"> 3173</span>  <a class="code" href="classoperations__research_1_1_queue.html">Queue</a>* priority_queue) {</div>
|
|
<div class="line"><a name="l03174"></a><span class="lineno"> 3174</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_nodes = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a354dd8c252cf59b748602b342db6019d">Size</a>();</div>
|
|
<div class="line"><a name="l03175"></a><span class="lineno"> 3175</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(start_end_distances_per_node->size(), num_nodes);</div>
|
|
<div class="line"><a name="l03176"></a><span class="lineno"> 3176</span>  </div>
|
|
<div class="line"><a name="l03177"></a><span class="lineno"> 3177</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < num_nodes; node++) {</div>
|
|
<div class="line"><a name="l03178"></a><span class="lineno"> 3178</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(node)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l03179"></a><span class="lineno"> 3179</span>  std::vector<StartEndValue>& start_end_distances =</div>
|
|
<div class="line"><a name="l03180"></a><span class="lineno"> 3180</span>  (*start_end_distances_per_node)[node];</div>
|
|
<div class="line"><a name="l03181"></a><span class="lineno"> 3181</span>  <span class="keywordflow">if</span> (start_end_distances.empty()) {</div>
|
|
<div class="line"><a name="l03182"></a><span class="lineno"> 3182</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l03183"></a><span class="lineno"> 3183</span>  }</div>
|
|
<div class="line"><a name="l03184"></a><span class="lineno"> 3184</span>  <span class="comment">// Put the best StartEndValue for this node in the priority queue.</span></div>
|
|
<div class="line"><a name="l03185"></a><span class="lineno"> 3185</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html">StartEndValue</a>& start_end_value = start_end_distances.back();</div>
|
|
<div class="line"><a name="l03186"></a><span class="lineno"> 3186</span>  priority_queue->push(std::make_pair(start_end_value, node));</div>
|
|
<div class="line"><a name="l03187"></a><span class="lineno"> 3187</span>  start_end_distances.pop_back();</div>
|
|
<div class="line"><a name="l03188"></a><span class="lineno"> 3188</span>  }</div>
|
|
<div class="line"><a name="l03189"></a><span class="lineno"> 3189</span> }</div>
|
|
<div class="line"><a name="l03190"></a><span class="lineno"> 3190</span>  </div>
|
|
<div class="line"><a name="l03191"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a40574fa8ec102d52f650a616d7fe6c39"> 3191</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a40574fa8ec102d52f650a616d7fe6c39">CheapestInsertionFilteredHeuristic::InsertBetween</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node,</div>
|
|
<div class="line"><a name="l03192"></a><span class="lineno"> 3192</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> predecessor,</div>
|
|
<div class="line"><a name="l03193"></a><span class="lineno"> 3193</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> successor) {</div>
|
|
<div class="line"><a name="l03194"></a><span class="lineno"> 3194</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(predecessor, node);</div>
|
|
<div class="line"><a name="l03195"></a><span class="lineno"> 3195</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(node, successor);</div>
|
|
<div class="line"><a name="l03196"></a><span class="lineno"> 3196</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aa0ae711364aadabc5365babc40a79fed">MakeDisjunctionNodesUnperformed</a>(node);</div>
|
|
<div class="line"><a name="l03197"></a><span class="lineno"> 3197</span> }</div>
|
|
<div class="line"><a name="l03198"></a><span class="lineno"> 3198</span>  </div>
|
|
<div class="line"><a name="l03199"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#aafc4ebf202cabd64f7854c274f425866"> 3199</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#aafc4ebf202cabd64f7854c274f425866">CheapestInsertionFilteredHeuristic::AppendEvaluatedPositionsAfter</a>(</div>
|
|
<div class="line"><a name="l03200"></a><span class="lineno"> 3200</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node_to_insert, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> start, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> next_after_start, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> vehicle,</div>
|
|
<div class="line"><a name="l03201"></a><span class="lineno"> 3201</span>  std::vector<ValuedPosition>* valued_positions) {</div>
|
|
<div class="line"><a name="l03202"></a><span class="lineno"> 3202</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(valued_positions != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l03203"></a><span class="lineno"> 3203</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> insert_after = start;</div>
|
|
<div class="line"><a name="l03204"></a><span class="lineno"> 3204</span>  <span class="keywordflow">while</span> (!<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->IsEnd(insert_after)) {</div>
|
|
<div class="line"><a name="l03205"></a><span class="lineno"> 3205</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> insert_before =</div>
|
|
<div class="line"><a name="l03206"></a><span class="lineno"> 3206</span>  (insert_after == start) ? next_after_start : <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(insert_after);</div>
|
|
<div class="line"><a name="l03207"></a><span class="lineno"> 3207</span>  valued_positions->push_back(std::make_pair(</div>
|
|
<div class="line"><a name="l03208"></a><span class="lineno"> 3208</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#af4b03acbf6a0d7655f7d65d0d87343e6">GetInsertionCostForNodeAtPosition</a>(node_to_insert, insert_after,</div>
|
|
<div class="line"><a name="l03209"></a><span class="lineno"> 3209</span>  insert_before, vehicle),</div>
|
|
<div class="line"><a name="l03210"></a><span class="lineno"> 3210</span>  insert_after));</div>
|
|
<div class="line"><a name="l03211"></a><span class="lineno"> 3211</span>  insert_after = insert_before;</div>
|
|
<div class="line"><a name="l03212"></a><span class="lineno"> 3212</span>  }</div>
|
|
<div class="line"><a name="l03213"></a><span class="lineno"> 3213</span> }</div>
|
|
<div class="line"><a name="l03214"></a><span class="lineno"> 3214</span>  </div>
|
|
<div class="line"><a name="l03215"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#af4b03acbf6a0d7655f7d65d0d87343e6"> 3215</a></span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#af4b03acbf6a0d7655f7d65d0d87343e6">CheapestInsertionFilteredHeuristic::GetInsertionCostForNodeAtPosition</a>(</div>
|
|
<div class="line"><a name="l03216"></a><span class="lineno"> 3216</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node_to_insert, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> insert_after, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> insert_before,</div>
|
|
<div class="line"><a name="l03217"></a><span class="lineno"> 3217</span>  <span class="keywordtype">int</span> vehicle)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l03218"></a><span class="lineno"> 3218</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a3c4943383b7473a073e387f40cc0fb05">evaluator_</a>(insert_after, node_to_insert, vehicle),</div>
|
|
<div class="line"><a name="l03219"></a><span class="lineno"> 3219</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a3c4943383b7473a073e387f40cc0fb05">evaluator_</a>(node_to_insert, insert_before, vehicle)),</div>
|
|
<div class="line"><a name="l03220"></a><span class="lineno"> 3220</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a3c4943383b7473a073e387f40cc0fb05">evaluator_</a>(insert_after, insert_before, vehicle));</div>
|
|
<div class="line"><a name="l03221"></a><span class="lineno"> 3221</span> }</div>
|
|
<div class="line"><a name="l03222"></a><span class="lineno"> 3222</span>  </div>
|
|
<div class="line"><a name="l03223"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ab2b4f136e88ea9aad2921aefb2434bad"> 3223</a></span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ab2b4f136e88ea9aad2921aefb2434bad">CheapestInsertionFilteredHeuristic::GetUnperformedValue</a>(</div>
|
|
<div class="line"><a name="l03224"></a><span class="lineno"> 3224</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node_to_insert)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l03225"></a><span class="lineno"> 3225</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a2b48bfb0d3df32b08dbe0aab5a251f8b">penalty_evaluator_</a> != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l03226"></a><span class="lineno"> 3226</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a2b48bfb0d3df32b08dbe0aab5a251f8b">penalty_evaluator_</a>(node_to_insert);</div>
|
|
<div class="line"><a name="l03227"></a><span class="lineno"> 3227</span>  }</div>
|
|
<div class="line"><a name="l03228"></a><span class="lineno"> 3228</span>  <span class="keywordflow">return</span> <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>;</div>
|
|
<div class="line"><a name="l03229"></a><span class="lineno"> 3229</span> }</div>
|
|
<div class="line"><a name="l03230"></a><span class="lineno"> 3230</span>  </div>
|
|
<div class="line"><a name="l03231"></a><span class="lineno"> 3231</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l03232"></a><span class="lineno"> 3232</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div>
|
|
<div class="line"><a name="l03233"></a><span class="lineno"> 3233</span> <span class="keywordtype">void</span> SortAndExtractPairSeconds(std::vector<std::pair<int64, T>>* pairs,</div>
|
|
<div class="line"><a name="l03234"></a><span class="lineno"> 3234</span>  std::vector<T>* sorted_seconds) {</div>
|
|
<div class="line"><a name="l03235"></a><span class="lineno"> 3235</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(pairs != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l03236"></a><span class="lineno"> 3236</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(sorted_seconds != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l03237"></a><span class="lineno"> 3237</span>  std::sort(pairs->begin(), pairs->end());</div>
|
|
<div class="line"><a name="l03238"></a><span class="lineno"> 3238</span>  sorted_seconds->reserve(pairs->size());</div>
|
|
<div class="line"><a name="l03239"></a><span class="lineno"> 3239</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::pair<int64, T>& p : *pairs) {</div>
|
|
<div class="line"><a name="l03240"></a><span class="lineno"> 3240</span>  sorted_seconds->push_back(p.second);</div>
|
|
<div class="line"><a name="l03241"></a><span class="lineno"> 3241</span>  }</div>
|
|
<div class="line"><a name="l03242"></a><span class="lineno"> 3242</span> }</div>
|
|
<div class="line"><a name="l03243"></a><span class="lineno"> 3243</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l03244"></a><span class="lineno"> 3244</span>  </div>
|
|
<div class="line"><a name="l03245"></a><span class="lineno"> 3245</span> <span class="comment">// Priority queue entries used by global cheapest insertion heuristic.</span></div>
|
|
<div class="line"><a name="l03246"></a><span class="lineno"> 3246</span>  </div>
|
|
<div class="line"><a name="l03247"></a><span class="lineno"> 3247</span> <span class="comment">// Entry in priority queue containing the insertion positions of a node pair.</span></div>
|
|
<div class="line"><a name="l03248"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html"> 3248</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html">GlobalCheapestInsertionFilteredHeuristic::PairEntry</a> {</div>
|
|
<div class="line"><a name="l03249"></a><span class="lineno"> 3249</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l03250"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a4b0f2123c758615115404fc033e28b3b"> 3250</a></span>  <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a4b0f2123c758615115404fc033e28b3b">PairEntry</a>(<span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#af73c9d66c39b338f5d4bf402664a6775">pickup_to_insert</a>, <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a8ce7a57de817af9900a5ce211fac39ec">pickup_insert_after</a>,</div>
|
|
<div class="line"><a name="l03251"></a><span class="lineno"> 3251</span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#ac555a592bc8f46d40e664dc2c663eae6">delivery_to_insert</a>, <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#aab26acce6ace06adcdf9a2cb3a40b874">delivery_insert_after</a>, <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">vehicle</a>)</div>
|
|
<div class="line"><a name="l03252"></a><span class="lineno"> 3252</span>  : heap_index_(-1),</div>
|
|
<div class="line"><a name="l03253"></a><span class="lineno"> 3253</span>  value_(<a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>),</div>
|
|
<div class="line"><a name="l03254"></a><span class="lineno"> 3254</span>  pickup_to_insert_(<a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#af73c9d66c39b338f5d4bf402664a6775">pickup_to_insert</a>),</div>
|
|
<div class="line"><a name="l03255"></a><span class="lineno"> 3255</span>  pickup_insert_after_(<a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a8ce7a57de817af9900a5ce211fac39ec">pickup_insert_after</a>),</div>
|
|
<div class="line"><a name="l03256"></a><span class="lineno"> 3256</span>  delivery_to_insert_(<a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#ac555a592bc8f46d40e664dc2c663eae6">delivery_to_insert</a>),</div>
|
|
<div class="line"><a name="l03257"></a><span class="lineno"> 3257</span>  delivery_insert_after_(<a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#aab26acce6ace06adcdf9a2cb3a40b874">delivery_insert_after</a>),</div>
|
|
<div class="line"><a name="l03258"></a><span class="lineno"> 3258</span>  vehicle_(<a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">vehicle</a>) {}</div>
|
|
<div class="line"><a name="l03259"></a><span class="lineno"> 3259</span>  <span class="comment">// Note: for compatibility reasons, comparator follows tie-breaking rules used</span></div>
|
|
<div class="line"><a name="l03260"></a><span class="lineno"> 3260</span>  <span class="comment">// in the first version of GlobalCheapestInsertion.</span></div>
|
|
<div class="line"><a name="l03261"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a0c50cfb15d402d295b87b81310c486c5"> 3261</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a0c50cfb15d402d295b87b81310c486c5">operator<</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html">PairEntry</a>& other)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l03262"></a><span class="lineno"> 3262</span>  <span class="comment">// We first compare by value, then we favor insertions (vehicle != -1).</span></div>
|
|
<div class="line"><a name="l03263"></a><span class="lineno"> 3263</span>  <span class="comment">// The rest of the tie-breaking is done with std::tie.</span></div>
|
|
<div class="line"><a name="l03264"></a><span class="lineno"> 3264</span>  <span class="keywordflow">if</span> (value_ != other.value_) {</div>
|
|
<div class="line"><a name="l03265"></a><span class="lineno"> 3265</span>  <span class="keywordflow">return</span> value_ > other.value_;</div>
|
|
<div class="line"><a name="l03266"></a><span class="lineno"> 3266</span>  }</div>
|
|
<div class="line"><a name="l03267"></a><span class="lineno"> 3267</span>  <span class="keywordflow">if</span> ((vehicle_ == -1) ^ (other.vehicle_ == -1)) {</div>
|
|
<div class="line"><a name="l03268"></a><span class="lineno"> 3268</span>  <span class="keywordflow">return</span> vehicle_ == -1;</div>
|
|
<div class="line"><a name="l03269"></a><span class="lineno"> 3269</span>  }</div>
|
|
<div class="line"><a name="l03270"></a><span class="lineno"> 3270</span>  <span class="keywordflow">return</span> std::tie(pickup_insert_after_, pickup_to_insert_,</div>
|
|
<div class="line"><a name="l03271"></a><span class="lineno"> 3271</span>  delivery_insert_after_, delivery_to_insert_, vehicle_) ></div>
|
|
<div class="line"><a name="l03272"></a><span class="lineno"> 3272</span>  std::tie(other.pickup_insert_after_, other.pickup_to_insert_,</div>
|
|
<div class="line"><a name="l03273"></a><span class="lineno"> 3273</span>  other.delivery_insert_after_, other.delivery_to_insert_,</div>
|
|
<div class="line"><a name="l03274"></a><span class="lineno"> 3274</span>  other.vehicle_);</div>
|
|
<div class="line"><a name="l03275"></a><span class="lineno"> 3275</span>  }</div>
|
|
<div class="line"><a name="l03276"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#ab87ca3233f48737b65fc2edb553575f9"> 3276</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#ab87ca3233f48737b65fc2edb553575f9">SetHeapIndex</a>(<span class="keywordtype">int</span> h) { heap_index_ = h; }</div>
|
|
<div class="line"><a name="l03277"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a356efb311b542164bd4667883d0973bb"> 3277</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a356efb311b542164bd4667883d0973bb">GetHeapIndex</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> heap_index_; }</div>
|
|
<div class="line"><a name="l03278"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a3fa26fc424ad7816f332921872064c19"> 3278</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a3fa26fc424ad7816f332921872064c19">value</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> value_; }</div>
|
|
<div class="line"><a name="l03279"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#ac046737f68b206f3ee48b23d5c404cdc"> 3279</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#ac046737f68b206f3ee48b23d5c404cdc">set_value</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a3fa26fc424ad7816f332921872064c19">value</a>) { value_ = <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a3fa26fc424ad7816f332921872064c19">value</a>; }</div>
|
|
<div class="line"><a name="l03280"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#af73c9d66c39b338f5d4bf402664a6775"> 3280</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#af73c9d66c39b338f5d4bf402664a6775">pickup_to_insert</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> pickup_to_insert_; }</div>
|
|
<div class="line"><a name="l03281"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a8ce7a57de817af9900a5ce211fac39ec"> 3281</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a8ce7a57de817af9900a5ce211fac39ec">pickup_insert_after</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> pickup_insert_after_; }</div>
|
|
<div class="line"><a name="l03282"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#aa3ef697633fc4e2bfca732b37f4d6713"> 3282</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#aa3ef697633fc4e2bfca732b37f4d6713">set_pickup_insert_after</a>(<span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a8ce7a57de817af9900a5ce211fac39ec">pickup_insert_after</a>) {</div>
|
|
<div class="line"><a name="l03283"></a><span class="lineno"> 3283</span>  pickup_insert_after_ = <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a8ce7a57de817af9900a5ce211fac39ec">pickup_insert_after</a>;</div>
|
|
<div class="line"><a name="l03284"></a><span class="lineno"> 3284</span>  }</div>
|
|
<div class="line"><a name="l03285"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#ac555a592bc8f46d40e664dc2c663eae6"> 3285</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#ac555a592bc8f46d40e664dc2c663eae6">delivery_to_insert</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> delivery_to_insert_; }</div>
|
|
<div class="line"><a name="l03286"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#aab26acce6ace06adcdf9a2cb3a40b874"> 3286</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#aab26acce6ace06adcdf9a2cb3a40b874">delivery_insert_after</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> delivery_insert_after_; }</div>
|
|
<div class="line"><a name="l03287"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a22aa7b1daf1b464e9ec1b675390aca94"> 3287</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">vehicle</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vehicle_; }</div>
|
|
<div class="line"><a name="l03288"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a307aa57dbe7730a98fc3c297c5924439"> 3288</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a307aa57dbe7730a98fc3c297c5924439">set_vehicle</a>(<span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">vehicle</a>) { vehicle_ = <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">vehicle</a>; }</div>
|
|
<div class="line"><a name="l03289"></a><span class="lineno"> 3289</span>  </div>
|
|
<div class="line"><a name="l03290"></a><span class="lineno"> 3290</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l03291"></a><span class="lineno"> 3291</span>  <span class="keywordtype">int</span> heap_index_;</div>
|
|
<div class="line"><a name="l03292"></a><span class="lineno"> 3292</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> value_;</div>
|
|
<div class="line"><a name="l03293"></a><span class="lineno"> 3293</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> pickup_to_insert_;</div>
|
|
<div class="line"><a name="l03294"></a><span class="lineno"> 3294</span>  <span class="keywordtype">int</span> pickup_insert_after_;</div>
|
|
<div class="line"><a name="l03295"></a><span class="lineno"> 3295</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> delivery_to_insert_;</div>
|
|
<div class="line"><a name="l03296"></a><span class="lineno"> 3296</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> delivery_insert_after_;</div>
|
|
<div class="line"><a name="l03297"></a><span class="lineno"> 3297</span>  <span class="keywordtype">int</span> vehicle_;</div>
|
|
<div class="line"><a name="l03298"></a><span class="lineno"> 3298</span> };</div>
|
|
<div class="line"><a name="l03299"></a><span class="lineno"> 3299</span>  </div>
|
|
<div class="line"><a name="l03300"></a><span class="lineno"> 3300</span> <span class="comment">// Entry in priority queue containing the insertion position of a node.</span></div>
|
|
<div class="line"><a name="l03301"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html"> 3301</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html">GlobalCheapestInsertionFilteredHeuristic::NodeEntry</a> {</div>
|
|
<div class="line"><a name="l03302"></a><span class="lineno"> 3302</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l03303"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#aa0c64eed404154a1d3dc7902e1d88466"> 3303</a></span>  <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#aa0c64eed404154a1d3dc7902e1d88466">NodeEntry</a>(<span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#afab5e0005c90180f14fc2a92d965af11">node_to_insert</a>, <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a33395f038b6a134edbe336a9a65f97eb">insert_after</a>, <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">vehicle</a>)</div>
|
|
<div class="line"><a name="l03304"></a><span class="lineno"> 3304</span>  : heap_index_(-1),</div>
|
|
<div class="line"><a name="l03305"></a><span class="lineno"> 3305</span>  value_(<a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>),</div>
|
|
<div class="line"><a name="l03306"></a><span class="lineno"> 3306</span>  node_to_insert_(<a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#afab5e0005c90180f14fc2a92d965af11">node_to_insert</a>),</div>
|
|
<div class="line"><a name="l03307"></a><span class="lineno"> 3307</span>  insert_after_(<a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a33395f038b6a134edbe336a9a65f97eb">insert_after</a>),</div>
|
|
<div class="line"><a name="l03308"></a><span class="lineno"> 3308</span>  vehicle_(<a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">vehicle</a>) {}</div>
|
|
<div class="line"><a name="l03309"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a1288842502bf13a418539580ccdfa679"> 3309</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a1288842502bf13a418539580ccdfa679">operator<</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html">NodeEntry</a>& other)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l03310"></a><span class="lineno"> 3310</span>  <span class="comment">// See PairEntry::operator<(), above. This one is similar.</span></div>
|
|
<div class="line"><a name="l03311"></a><span class="lineno"> 3311</span>  <span class="keywordflow">if</span> (value_ != other.value_) {</div>
|
|
<div class="line"><a name="l03312"></a><span class="lineno"> 3312</span>  <span class="keywordflow">return</span> value_ > other.value_;</div>
|
|
<div class="line"><a name="l03313"></a><span class="lineno"> 3313</span>  }</div>
|
|
<div class="line"><a name="l03314"></a><span class="lineno"> 3314</span>  <span class="keywordflow">if</span> ((vehicle_ == -1) ^ (other.vehicle_ == -1)) {</div>
|
|
<div class="line"><a name="l03315"></a><span class="lineno"> 3315</span>  <span class="keywordflow">return</span> vehicle_ == -1;</div>
|
|
<div class="line"><a name="l03316"></a><span class="lineno"> 3316</span>  }</div>
|
|
<div class="line"><a name="l03317"></a><span class="lineno"> 3317</span>  <span class="keywordflow">return</span> std::tie(insert_after_, node_to_insert_, vehicle_) ></div>
|
|
<div class="line"><a name="l03318"></a><span class="lineno"> 3318</span>  std::tie(other.insert_after_, other.node_to_insert_, other.vehicle_);</div>
|
|
<div class="line"><a name="l03319"></a><span class="lineno"> 3319</span>  }</div>
|
|
<div class="line"><a name="l03320"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#ab87ca3233f48737b65fc2edb553575f9"> 3320</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#ab87ca3233f48737b65fc2edb553575f9">SetHeapIndex</a>(<span class="keywordtype">int</span> h) { heap_index_ = h; }</div>
|
|
<div class="line"><a name="l03321"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a356efb311b542164bd4667883d0973bb"> 3321</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a356efb311b542164bd4667883d0973bb">GetHeapIndex</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> heap_index_; }</div>
|
|
<div class="line"><a name="l03322"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a3fa26fc424ad7816f332921872064c19"> 3322</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a3fa26fc424ad7816f332921872064c19">value</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> value_; }</div>
|
|
<div class="line"><a name="l03323"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#ac046737f68b206f3ee48b23d5c404cdc"> 3323</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#ac046737f68b206f3ee48b23d5c404cdc">set_value</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a3fa26fc424ad7816f332921872064c19">value</a>) { value_ = <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a3fa26fc424ad7816f332921872064c19">value</a>; }</div>
|
|
<div class="line"><a name="l03324"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#afab5e0005c90180f14fc2a92d965af11"> 3324</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#afab5e0005c90180f14fc2a92d965af11">node_to_insert</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> node_to_insert_; }</div>
|
|
<div class="line"><a name="l03325"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a33395f038b6a134edbe336a9a65f97eb"> 3325</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a33395f038b6a134edbe336a9a65f97eb">insert_after</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> insert_after_; }</div>
|
|
<div class="line"><a name="l03326"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a6fa49ad5682919b9982d9c7b55d21683"> 3326</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a6fa49ad5682919b9982d9c7b55d21683">set_insert_after</a>(<span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a33395f038b6a134edbe336a9a65f97eb">insert_after</a>) { insert_after_ = <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a33395f038b6a134edbe336a9a65f97eb">insert_after</a>; }</div>
|
|
<div class="line"><a name="l03327"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a22aa7b1daf1b464e9ec1b675390aca94"> 3327</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">vehicle</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vehicle_; }</div>
|
|
<div class="line"><a name="l03328"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a307aa57dbe7730a98fc3c297c5924439"> 3328</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a307aa57dbe7730a98fc3c297c5924439">set_vehicle</a>(<span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">vehicle</a>) { vehicle_ = <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">vehicle</a>; }</div>
|
|
<div class="line"><a name="l03329"></a><span class="lineno"> 3329</span>  </div>
|
|
<div class="line"><a name="l03330"></a><span class="lineno"> 3330</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l03331"></a><span class="lineno"> 3331</span>  <span class="keywordtype">int</span> heap_index_;</div>
|
|
<div class="line"><a name="l03332"></a><span class="lineno"> 3332</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> value_;</div>
|
|
<div class="line"><a name="l03333"></a><span class="lineno"> 3333</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> node_to_insert_;</div>
|
|
<div class="line"><a name="l03334"></a><span class="lineno"> 3334</span>  <span class="keywordtype">int</span> insert_after_;</div>
|
|
<div class="line"><a name="l03335"></a><span class="lineno"> 3335</span>  <span class="keywordtype">int</span> vehicle_;</div>
|
|
<div class="line"><a name="l03336"></a><span class="lineno"> 3336</span> };</div>
|
|
<div class="line"><a name="l03337"></a><span class="lineno"> 3337</span>  </div>
|
|
<div class="line"><a name="l03338"></a><span class="lineno"> 3338</span> <span class="comment">// GlobalCheapestInsertionFilteredHeuristic</span></div>
|
|
<div class="line"><a name="l03339"></a><span class="lineno"> 3339</span>  </div>
|
|
<div class="line"><a name="l03340"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#a74d8d5032c1116077bac8da2a48e7e98"> 3340</a></span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#a74d8d5032c1116077bac8da2a48e7e98">GlobalCheapestInsertionFilteredHeuristic::</a></div>
|
|
<div class="line"><a name="l03341"></a><span class="lineno"> 3341</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#a74d8d5032c1116077bac8da2a48e7e98"> GlobalCheapestInsertionFilteredHeuristic</a>(</div>
|
|
<div class="line"><a name="l03342"></a><span class="lineno"> 3342</span>  <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div>
|
|
<div class="line"><a name="l03343"></a><span class="lineno"> 3343</span>  std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)> evaluator,</div>
|
|
<div class="line"><a name="l03344"></a><span class="lineno"> 3344</span>  std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)> penalty_evaluator,</div>
|
|
<div class="line"><a name="l03345"></a><span class="lineno"> 3345</span>  <a class="code" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager,</div>
|
|
<div class="line"><a name="l03346"></a><span class="lineno"> 3346</span>  <a class="code" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html">GlobalCheapestInsertionParameters</a> <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>)</div>
|
|
<div class="line"><a name="l03347"></a><span class="lineno"> 3347</span>  : <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html">CheapestInsertionFilteredHeuristic</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, std::move(evaluator),</div>
|
|
<div class="line"><a name="l03348"></a><span class="lineno"> 3348</span>  std::move(penalty_evaluator),</div>
|
|
<div class="line"><a name="l03349"></a><span class="lineno"> 3349</span>  filter_manager),</div>
|
|
<div class="line"><a name="l03350"></a><span class="lineno"> 3350</span>  gci_params_(<a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>),</div>
|
|
<div class="line"><a name="l03351"></a><span class="lineno"> 3351</span>  node_index_to_vehicle_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Size(), -1),</div>
|
|
<div class="line"><a name="l03352"></a><span class="lineno"> 3352</span>  empty_vehicle_type_curator_(nullptr) {</div>
|
|
<div class="line"><a name="l03353"></a><span class="lineno"> 3353</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(gci_params_.<a class="code" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a0aa77787d0df1b489476bfc6714ef819">neighbors_ratio</a>, 0);</div>
|
|
<div class="line"><a name="l03354"></a><span class="lineno"> 3354</span>  <a class="code" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(gci_params_.<a class="code" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a0aa77787d0df1b489476bfc6714ef819">neighbors_ratio</a>, 1);</div>
|
|
<div class="line"><a name="l03355"></a><span class="lineno"> 3355</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(gci_params_.<a class="code" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a4de56a813d02ca0b525b77293179fca6">min_neighbors</a>, 1);</div>
|
|
<div class="line"><a name="l03356"></a><span class="lineno"> 3356</span>  </div>
|
|
<div class="line"><a name="l03357"></a><span class="lineno"> 3357</span>  <span class="keywordflow">if</span> (NumNeighbors() >= NumNonStartEndNodes() - 1) {</div>
|
|
<div class="line"><a name="l03358"></a><span class="lineno"> 3358</span>  <span class="comment">// All nodes are neighbors, so we set the neighbors_ratio to 1 to avoid</span></div>
|
|
<div class="line"><a name="l03359"></a><span class="lineno"> 3359</span>  <span class="comment">// unnecessary computations in the code.</span></div>
|
|
<div class="line"><a name="l03360"></a><span class="lineno"> 3360</span>  gci_params_.<a class="code" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a0aa77787d0df1b489476bfc6714ef819">neighbors_ratio</a> = 1;</div>
|
|
<div class="line"><a name="l03361"></a><span class="lineno"> 3361</span>  }</div>
|
|
<div class="line"><a name="l03362"></a><span class="lineno"> 3362</span>  </div>
|
|
<div class="line"><a name="l03363"></a><span class="lineno"> 3363</span>  <span class="keywordflow">if</span> (gci_params_.<a class="code" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a0aa77787d0df1b489476bfc6714ef819">neighbors_ratio</a> == 1) {</div>
|
|
<div class="line"><a name="l03364"></a><span class="lineno"> 3364</span>  gci_params_.<a class="code" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a7d91387b5081be8f22d053d93eb9edf4">use_neighbors_ratio_for_initialization</a> = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l03365"></a><span class="lineno"> 3365</span>  all_nodes_.resize(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>-><a class="code" href="classoperations__research_1_1_routing_model.html#a354dd8c252cf59b748602b342db6019d">Size</a>());</div>
|
|
<div class="line"><a name="l03366"></a><span class="lineno"> 3366</span>  std::iota(all_nodes_.begin(), all_nodes_.end(), 0);</div>
|
|
<div class="line"><a name="l03367"></a><span class="lineno"> 3367</span>  }</div>
|
|
<div class="line"><a name="l03368"></a><span class="lineno"> 3368</span> }</div>
|
|
<div class="line"><a name="l03369"></a><span class="lineno"> 3369</span>  </div>
|
|
<div class="line"><a name="l03370"></a><span class="lineno"> 3370</span> <span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::ComputeNeighborhoods() {</div>
|
|
<div class="line"><a name="l03371"></a><span class="lineno"> 3371</span>  <span class="keywordflow">if</span> (gci_params_.<a class="code" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a0aa77787d0df1b489476bfc6714ef819">neighbors_ratio</a> == 1 ||</div>
|
|
<div class="line"><a name="l03372"></a><span class="lineno"> 3372</span>  !node_index_to_neighbors_by_cost_class_.empty()) {</div>
|
|
<div class="line"><a name="l03373"></a><span class="lineno"> 3373</span>  <span class="comment">// Neighborhood computations not needed or already done.</span></div>
|
|
<div class="line"><a name="l03374"></a><span class="lineno"> 3374</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l03375"></a><span class="lineno"> 3375</span>  }</div>
|
|
<div class="line"><a name="l03376"></a><span class="lineno"> 3376</span>  </div>
|
|
<div class="line"><a name="l03377"></a><span class="lineno"> 3377</span>  <span class="comment">// TODO(user): Refactor the neighborhood computations in RoutingModel.</span></div>
|
|
<div class="line"><a name="l03378"></a><span class="lineno"> 3378</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> num_neighbors = NumNeighbors();</div>
|
|
<div class="line"><a name="l03379"></a><span class="lineno"> 3379</span>  <span class="comment">// If num_neighbors was greater or equal num_non_start_end_nodes - 1,</span></div>
|
|
<div class="line"><a name="l03380"></a><span class="lineno"> 3380</span>  <span class="comment">// gci_params_.neighbors_ratio should have been set to 1.</span></div>
|
|
<div class="line"><a name="l03381"></a><span class="lineno"> 3381</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(num_neighbors, NumNonStartEndNodes() - 1);</div>
|
|
<div class="line"><a name="l03382"></a><span class="lineno"> 3382</span>  </div>
|
|
<div class="line"><a name="l03383"></a><span class="lineno"> 3383</span>  <span class="keyword">const</span> RoutingModel& routing_model = *<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>();</div>
|
|
<div class="line"><a name="l03384"></a><span class="lineno"> 3384</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> size = routing_model.Size();</div>
|
|
<div class="line"><a name="l03385"></a><span class="lineno"> 3385</span>  node_index_to_neighbors_by_cost_class_.resize(size);</div>
|
|
<div class="line"><a name="l03386"></a><span class="lineno"> 3386</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_cost_classes = routing_model.GetCostClassesCount();</div>
|
|
<div class="line"><a name="l03387"></a><span class="lineno"> 3387</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node_index = 0; node_index < size; node_index++) {</div>
|
|
<div class="line"><a name="l03388"></a><span class="lineno"> 3388</span>  node_index_to_neighbors_by_cost_class_[node_index].resize(num_cost_classes);</div>
|
|
<div class="line"><a name="l03389"></a><span class="lineno"> 3389</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> cc = 0; cc < num_cost_classes; cc++) {</div>
|
|
<div class="line"><a name="l03390"></a><span class="lineno"> 3390</span>  node_index_to_neighbors_by_cost_class_[node_index][cc] =</div>
|
|
<div class="line"><a name="l03391"></a><span class="lineno"> 3391</span>  absl::make_unique<SparseBitset<int64>>(size);</div>
|
|
<div class="line"><a name="l03392"></a><span class="lineno"> 3392</span>  }</div>
|
|
<div class="line"><a name="l03393"></a><span class="lineno"> 3393</span>  }</div>
|
|
<div class="line"><a name="l03394"></a><span class="lineno"> 3394</span>  </div>
|
|
<div class="line"><a name="l03395"></a><span class="lineno"> 3395</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node_index = 0; node_index < size; ++node_index) {</div>
|
|
<div class="line"><a name="l03396"></a><span class="lineno"> 3396</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!routing_model.IsEnd(node_index));</div>
|
|
<div class="line"><a name="l03397"></a><span class="lineno"> 3397</span>  <span class="keywordflow">if</span> (routing_model.IsStart(node_index)) {</div>
|
|
<div class="line"><a name="l03398"></a><span class="lineno"> 3398</span>  <span class="comment">// We don't compute neighbors for vehicle starts: all nodes are considered</span></div>
|
|
<div class="line"><a name="l03399"></a><span class="lineno"> 3399</span>  <span class="comment">// neighbors for a vehicle start.</span></div>
|
|
<div class="line"><a name="l03400"></a><span class="lineno"> 3400</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l03401"></a><span class="lineno"> 3401</span>  }</div>
|
|
<div class="line"><a name="l03402"></a><span class="lineno"> 3402</span>  </div>
|
|
<div class="line"><a name="l03403"></a><span class="lineno"> 3403</span>  <span class="comment">// TODO(user): Use the model's IndexNeighborFinder when available.</span></div>
|
|
<div class="line"><a name="l03404"></a><span class="lineno"> 3404</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> cost_class = 0; cost_class < num_cost_classes; cost_class++) {</div>
|
|
<div class="line"><a name="l03405"></a><span class="lineno"> 3405</span>  <span class="keywordflow">if</span> (!routing_model.HasVehicleWithCostClassIndex(</div>
|
|
<div class="line"><a name="l03406"></a><span class="lineno"> 3406</span>  RoutingCostClassIndex(cost_class))) {</div>
|
|
<div class="line"><a name="l03407"></a><span class="lineno"> 3407</span>  <span class="comment">// No vehicle with this cost class, avoid unnecessary computations.</span></div>
|
|
<div class="line"><a name="l03408"></a><span class="lineno"> 3408</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l03409"></a><span class="lineno"> 3409</span>  }</div>
|
|
<div class="line"><a name="l03410"></a><span class="lineno"> 3410</span>  std::vector<std::pair<<span class="comment">/*cost*/</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>, <span class="comment">/*node*/</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>>> costed_after_nodes;</div>
|
|
<div class="line"><a name="l03411"></a><span class="lineno"> 3411</span>  costed_after_nodes.reserve(size);</div>
|
|
<div class="line"><a name="l03412"></a><span class="lineno"> 3412</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> after_node = 0; after_node < size; ++after_node) {</div>
|
|
<div class="line"><a name="l03413"></a><span class="lineno"> 3413</span>  <span class="keywordflow">if</span> (after_node != node_index && !routing_model.IsStart(after_node)) {</div>
|
|
<div class="line"><a name="l03414"></a><span class="lineno"> 3414</span>  costed_after_nodes.push_back(</div>
|
|
<div class="line"><a name="l03415"></a><span class="lineno"> 3415</span>  std::make_pair(routing_model.GetArcCostForClass(</div>
|
|
<div class="line"><a name="l03416"></a><span class="lineno"> 3416</span>  node_index, after_node, cost_class),</div>
|
|
<div class="line"><a name="l03417"></a><span class="lineno"> 3417</span>  after_node));</div>
|
|
<div class="line"><a name="l03418"></a><span class="lineno"> 3418</span>  }</div>
|
|
<div class="line"><a name="l03419"></a><span class="lineno"> 3419</span>  }</div>
|
|
<div class="line"><a name="l03420"></a><span class="lineno"> 3420</span>  std::nth_element(costed_after_nodes.begin(),</div>
|
|
<div class="line"><a name="l03421"></a><span class="lineno"> 3421</span>  costed_after_nodes.begin() + num_neighbors - 1,</div>
|
|
<div class="line"><a name="l03422"></a><span class="lineno"> 3422</span>  costed_after_nodes.end());</div>
|
|
<div class="line"><a name="l03423"></a><span class="lineno"> 3423</span>  costed_after_nodes.resize(num_neighbors);</div>
|
|
<div class="line"><a name="l03424"></a><span class="lineno"> 3424</span>  </div>
|
|
<div class="line"><a name="l03425"></a><span class="lineno"> 3425</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> [<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>, neighbor] : costed_after_nodes) {</div>
|
|
<div class="line"><a name="l03426"></a><span class="lineno"> 3426</span>  node_index_to_neighbors_by_cost_class_[node_index][cost_class]->Set(</div>
|
|
<div class="line"><a name="l03427"></a><span class="lineno"> 3427</span>  neighbor);</div>
|
|
<div class="line"><a name="l03428"></a><span class="lineno"> 3428</span>  </div>
|
|
<div class="line"><a name="l03429"></a><span class="lineno"> 3429</span>  <span class="comment">// Add reverse neighborhood.</span></div>
|
|
<div class="line"><a name="l03430"></a><span class="lineno"> 3430</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!routing_model.IsEnd(neighbor) &&</div>
|
|
<div class="line"><a name="l03431"></a><span class="lineno"> 3431</span>  !routing_model.IsStart(neighbor));</div>
|
|
<div class="line"><a name="l03432"></a><span class="lineno"> 3432</span>  node_index_to_neighbors_by_cost_class_[neighbor][cost_class]->Set(</div>
|
|
<div class="line"><a name="l03433"></a><span class="lineno"> 3433</span>  node_index);</div>
|
|
<div class="line"><a name="l03434"></a><span class="lineno"> 3434</span>  }</div>
|
|
<div class="line"><a name="l03435"></a><span class="lineno"> 3435</span>  <span class="comment">// Add all vehicle starts as neighbors to this node and vice-versa.</span></div>
|
|
<div class="line"><a name="l03436"></a><span class="lineno"> 3436</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < routing_model.vehicles(); vehicle++) {</div>
|
|
<div class="line"><a name="l03437"></a><span class="lineno"> 3437</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> vehicle_start = routing_model.Start(vehicle);</div>
|
|
<div class="line"><a name="l03438"></a><span class="lineno"> 3438</span>  node_index_to_neighbors_by_cost_class_[node_index][cost_class]->Set(</div>
|
|
<div class="line"><a name="l03439"></a><span class="lineno"> 3439</span>  vehicle_start);</div>
|
|
<div class="line"><a name="l03440"></a><span class="lineno"> 3440</span>  node_index_to_neighbors_by_cost_class_[vehicle_start][cost_class]->Set(</div>
|
|
<div class="line"><a name="l03441"></a><span class="lineno"> 3441</span>  node_index);</div>
|
|
<div class="line"><a name="l03442"></a><span class="lineno"> 3442</span>  }</div>
|
|
<div class="line"><a name="l03443"></a><span class="lineno"> 3443</span>  }</div>
|
|
<div class="line"><a name="l03444"></a><span class="lineno"> 3444</span>  }</div>
|
|
<div class="line"><a name="l03445"></a><span class="lineno"> 3445</span> }</div>
|
|
<div class="line"><a name="l03446"></a><span class="lineno"> 3446</span>  </div>
|
|
<div class="line"><a name="l03447"></a><span class="lineno"> 3447</span> <span class="keywordtype">bool</span> GlobalCheapestInsertionFilteredHeuristic::IsNeighborForCostClass(</div>
|
|
<div class="line"><a name="l03448"></a><span class="lineno"> 3448</span>  <span class="keywordtype">int</span> cost_class, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node_index, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> neighbor_index)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l03449"></a><span class="lineno"> 3449</span>  <span class="keywordflow">return</span> gci_params_.<a class="code" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a0aa77787d0df1b489476bfc6714ef819">neighbors_ratio</a> == 1 ||</div>
|
|
<div class="line"><a name="l03450"></a><span class="lineno"> 3450</span>  (*node_index_to_neighbors_by_cost_class_[node_index]</div>
|
|
<div class="line"><a name="l03451"></a><span class="lineno"> 3451</span>  [cost_class])[neighbor_index];</div>
|
|
<div class="line"><a name="l03452"></a><span class="lineno"> 3452</span> }</div>
|
|
<div class="line"><a name="l03453"></a><span class="lineno"> 3453</span>  </div>
|
|
<div class="line"><a name="l03454"></a><span class="lineno"> 3454</span> <span class="keywordtype">bool</span> GlobalCheapestInsertionFilteredHeuristic::CheckVehicleIndices()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l03455"></a><span class="lineno"> 3455</span>  std::vector<bool> node_is_visited(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>(), -1);</div>
|
|
<div class="line"><a name="l03456"></a><span class="lineno"> 3456</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> v = 0; v < <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); v++) {</div>
|
|
<div class="line"><a name="l03457"></a><span class="lineno"> 3457</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(v); !<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#ae2530e17cabaf267e12929ca0ee1bee0">IsEnd</a>(node);</div>
|
|
<div class="line"><a name="l03458"></a><span class="lineno"> 3458</span>  node = <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(node)) {</div>
|
|
<div class="line"><a name="l03459"></a><span class="lineno"> 3459</span>  <span class="keywordflow">if</span> (node_index_to_vehicle_[node] != v) {</div>
|
|
<div class="line"><a name="l03460"></a><span class="lineno"> 3460</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l03461"></a><span class="lineno"> 3461</span>  }</div>
|
|
<div class="line"><a name="l03462"></a><span class="lineno"> 3462</span>  node_is_visited[node] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l03463"></a><span class="lineno"> 3463</span>  }</div>
|
|
<div class="line"><a name="l03464"></a><span class="lineno"> 3464</span>  }</div>
|
|
<div class="line"><a name="l03465"></a><span class="lineno"> 3465</span>  </div>
|
|
<div class="line"><a name="l03466"></a><span class="lineno"> 3466</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a354dd8c252cf59b748602b342db6019d">Size</a>(); node++) {</div>
|
|
<div class="line"><a name="l03467"></a><span class="lineno"> 3467</span>  <span class="keywordflow">if</span> (!node_is_visited[node] && node_index_to_vehicle_[node] != -1) {</div>
|
|
<div class="line"><a name="l03468"></a><span class="lineno"> 3468</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l03469"></a><span class="lineno"> 3469</span>  }</div>
|
|
<div class="line"><a name="l03470"></a><span class="lineno"> 3470</span>  }</div>
|
|
<div class="line"><a name="l03471"></a><span class="lineno"> 3471</span>  </div>
|
|
<div class="line"><a name="l03472"></a><span class="lineno"> 3472</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l03473"></a><span class="lineno"> 3473</span> }</div>
|
|
<div class="line"><a name="l03474"></a><span class="lineno"> 3474</span>  </div>
|
|
<div class="line"><a name="l03475"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289"> 3475</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">GlobalCheapestInsertionFilteredHeuristic::BuildSolutionInternal</a>() {</div>
|
|
<div class="line"><a name="l03476"></a><span class="lineno"> 3476</span>  ComputeNeighborhoods();</div>
|
|
<div class="line"><a name="l03477"></a><span class="lineno"> 3477</span>  <span class="keywordflow">if</span> (empty_vehicle_type_curator_ == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l03478"></a><span class="lineno"> 3478</span>  empty_vehicle_type_curator_ = absl::make_unique<VehicleTypeCurator>(</div>
|
|
<div class="line"><a name="l03479"></a><span class="lineno"> 3479</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->GetVehicleTypeContainer());</div>
|
|
<div class="line"><a name="l03480"></a><span class="lineno"> 3480</span>  }</div>
|
|
<div class="line"><a name="l03481"></a><span class="lineno"> 3481</span>  <span class="comment">// Store all empty vehicles in the empty_vehicle_type_curator_.</span></div>
|
|
<div class="line"><a name="l03482"></a><span class="lineno"> 3482</span>  empty_vehicle_type_curator_->Reset(</div>
|
|
<div class="line"><a name="l03483"></a><span class="lineno"> 3483</span>  [<span class="keyword">this</span>](<span class="keywordtype">int</span> vehicle) { <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(vehicle); });</div>
|
|
<div class="line"><a name="l03484"></a><span class="lineno"> 3484</span>  <span class="comment">// Insert partially inserted pairs.</span></div>
|
|
<div class="line"><a name="l03485"></a><span class="lineno"> 3485</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html#a76874cd778ea1b9220673e019f9e7abe">RoutingModel::IndexPairs</a>& pickup_delivery_pairs =</div>
|
|
<div class="line"><a name="l03486"></a><span class="lineno"> 3486</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a9e42e15bdb23d63ae78137b97a4882de">GetPickupAndDeliveryPairs</a>();</div>
|
|
<div class="line"><a name="l03487"></a><span class="lineno"> 3487</span>  std::vector<int> pairs_to_insert;</div>
|
|
<div class="line"><a name="l03488"></a><span class="lineno"> 3488</span>  absl::flat_hash_map<int, std::vector<int>> vehicle_to_pair_nodes;</div>
|
|
<div class="line"><a name="l03489"></a><span class="lineno"> 3489</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0; <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < pickup_delivery_pairs.size(); <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>++) {</div>
|
|
<div class="line"><a name="l03490"></a><span class="lineno"> 3490</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html#a1636c49d2587c3d9df16918345b82378">RoutingModel::IndexPair</a>& index_pair = pickup_delivery_pairs[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l03491"></a><span class="lineno"> 3491</span>  <span class="keywordtype">int</span> pickup_vehicle = -1;</div>
|
|
<div class="line"><a name="l03492"></a><span class="lineno"> 3492</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup : index_pair.first) {</div>
|
|
<div class="line"><a name="l03493"></a><span class="lineno"> 3493</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(pickup)) {</div>
|
|
<div class="line"><a name="l03494"></a><span class="lineno"> 3494</span>  pickup_vehicle = node_index_to_vehicle_[pickup];</div>
|
|
<div class="line"><a name="l03495"></a><span class="lineno"> 3495</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l03496"></a><span class="lineno"> 3496</span>  }</div>
|
|
<div class="line"><a name="l03497"></a><span class="lineno"> 3497</span>  }</div>
|
|
<div class="line"><a name="l03498"></a><span class="lineno"> 3498</span>  <span class="keywordtype">int</span> delivery_vehicle = -1;</div>
|
|
<div class="line"><a name="l03499"></a><span class="lineno"> 3499</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery : index_pair.second) {</div>
|
|
<div class="line"><a name="l03500"></a><span class="lineno"> 3500</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(delivery)) {</div>
|
|
<div class="line"><a name="l03501"></a><span class="lineno"> 3501</span>  delivery_vehicle = node_index_to_vehicle_[delivery];</div>
|
|
<div class="line"><a name="l03502"></a><span class="lineno"> 3502</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l03503"></a><span class="lineno"> 3503</span>  }</div>
|
|
<div class="line"><a name="l03504"></a><span class="lineno"> 3504</span>  }</div>
|
|
<div class="line"><a name="l03505"></a><span class="lineno"> 3505</span>  <span class="keywordflow">if</span> (pickup_vehicle < 0 && delivery_vehicle < 0) {</div>
|
|
<div class="line"><a name="l03506"></a><span class="lineno"> 3506</span>  pairs_to_insert.push_back(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l03507"></a><span class="lineno"> 3507</span>  }</div>
|
|
<div class="line"><a name="l03508"></a><span class="lineno"> 3508</span>  <span class="keywordflow">if</span> (pickup_vehicle >= 0 && delivery_vehicle < 0) {</div>
|
|
<div class="line"><a name="l03509"></a><span class="lineno"> 3509</span>  std::vector<int>& pair_nodes = vehicle_to_pair_nodes[pickup_vehicle];</div>
|
|
<div class="line"><a name="l03510"></a><span class="lineno"> 3510</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery : index_pair.second) {</div>
|
|
<div class="line"><a name="l03511"></a><span class="lineno"> 3511</span>  pair_nodes.push_back(delivery);</div>
|
|
<div class="line"><a name="l03512"></a><span class="lineno"> 3512</span>  }</div>
|
|
<div class="line"><a name="l03513"></a><span class="lineno"> 3513</span>  }</div>
|
|
<div class="line"><a name="l03514"></a><span class="lineno"> 3514</span>  <span class="keywordflow">if</span> (pickup_vehicle < 0 && delivery_vehicle >= 0) {</div>
|
|
<div class="line"><a name="l03515"></a><span class="lineno"> 3515</span>  std::vector<int>& pair_nodes = vehicle_to_pair_nodes[delivery_vehicle];</div>
|
|
<div class="line"><a name="l03516"></a><span class="lineno"> 3516</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup : index_pair.first) {</div>
|
|
<div class="line"><a name="l03517"></a><span class="lineno"> 3517</span>  pair_nodes.push_back(pickup);</div>
|
|
<div class="line"><a name="l03518"></a><span class="lineno"> 3518</span>  }</div>
|
|
<div class="line"><a name="l03519"></a><span class="lineno"> 3519</span>  }</div>
|
|
<div class="line"><a name="l03520"></a><span class="lineno"> 3520</span>  }</div>
|
|
<div class="line"><a name="l03521"></a><span class="lineno"> 3521</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& vehicle_and_nodes : vehicle_to_pair_nodes) {</div>
|
|
<div class="line"><a name="l03522"></a><span class="lineno"> 3522</span>  InsertNodesOnRoutes(vehicle_and_nodes.second, {vehicle_and_nodes.first});</div>
|
|
<div class="line"><a name="l03523"></a><span class="lineno"> 3523</span>  }</div>
|
|
<div class="line"><a name="l03524"></a><span class="lineno"> 3524</span>  </div>
|
|
<div class="line"><a name="l03525"></a><span class="lineno"> 3525</span>  InsertPairsAndNodesByRequirementTopologicalOrder();</div>
|
|
<div class="line"><a name="l03526"></a><span class="lineno"> 3526</span>  </div>
|
|
<div class="line"><a name="l03527"></a><span class="lineno"> 3527</span>  <span class="comment">// TODO(user): Adapt the pair insertions to also support seed and</span></div>
|
|
<div class="line"><a name="l03528"></a><span class="lineno"> 3528</span>  <span class="comment">// sequential insertion.</span></div>
|
|
<div class="line"><a name="l03529"></a><span class="lineno"> 3529</span>  InsertPairs(pairs_to_insert);</div>
|
|
<div class="line"><a name="l03530"></a><span class="lineno"> 3530</span>  std::vector<int> nodes;</div>
|
|
<div class="line"><a name="l03531"></a><span class="lineno"> 3531</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a354dd8c252cf59b748602b342db6019d">Size</a>(); ++node) {</div>
|
|
<div class="line"><a name="l03532"></a><span class="lineno"> 3532</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(node) && <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#ae82492179600550970bd0b0dccf0b3f1">GetPickupIndexPairs</a>(node).empty() &&</div>
|
|
<div class="line"><a name="l03533"></a><span class="lineno"> 3533</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#afad671d4876daa753d520bf2adceafbd">GetDeliveryIndexPairs</a>(node).empty()) {</div>
|
|
<div class="line"><a name="l03534"></a><span class="lineno"> 3534</span>  nodes.push_back(node);</div>
|
|
<div class="line"><a name="l03535"></a><span class="lineno"> 3535</span>  }</div>
|
|
<div class="line"><a name="l03536"></a><span class="lineno"> 3536</span>  }</div>
|
|
<div class="line"><a name="l03537"></a><span class="lineno"> 3537</span>  InsertFarthestNodesAsSeeds();</div>
|
|
<div class="line"><a name="l03538"></a><span class="lineno"> 3538</span>  <span class="keywordflow">if</span> (gci_params_.<a class="code" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a28b4894c7c18183ac19b81d1b6d97e2f">is_sequential</a>) {</div>
|
|
<div class="line"><a name="l03539"></a><span class="lineno"> 3539</span>  SequentialInsertNodes(nodes);</div>
|
|
<div class="line"><a name="l03540"></a><span class="lineno"> 3540</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03541"></a><span class="lineno"> 3541</span>  InsertNodesOnRoutes(nodes, {});</div>
|
|
<div class="line"><a name="l03542"></a><span class="lineno"> 3542</span>  }</div>
|
|
<div class="line"><a name="l03543"></a><span class="lineno"> 3543</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a97049801609b8cb68c0428970f916fd4">MakeUnassignedNodesUnperformed</a>();</div>
|
|
<div class="line"><a name="l03544"></a><span class="lineno"> 3544</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(CheckVehicleIndices());</div>
|
|
<div class="line"><a name="l03545"></a><span class="lineno"> 3545</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>();</div>
|
|
<div class="line"><a name="l03546"></a><span class="lineno"> 3546</span> }</div>
|
|
<div class="line"><a name="l03547"></a><span class="lineno"> 3547</span>  </div>
|
|
<div class="line"><a name="l03548"></a><span class="lineno"> 3548</span> <span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::</div>
|
|
<div class="line"><a name="l03549"></a><span class="lineno"> 3549</span>  InsertPairsAndNodesByRequirementTopologicalOrder() {</div>
|
|
<div class="line"><a name="l03550"></a><span class="lineno"> 3550</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::vector<int>& types :</div>
|
|
<div class="line"><a name="l03551"></a><span class="lineno"> 3551</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->GetTopologicallySortedVisitTypes()) {</div>
|
|
<div class="line"><a name="l03552"></a><span class="lineno"> 3552</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> type : types) {</div>
|
|
<div class="line"><a name="l03553"></a><span class="lineno"> 3553</span>  InsertPairs(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->GetPairIndicesOfType(type));</div>
|
|
<div class="line"><a name="l03554"></a><span class="lineno"> 3554</span>  InsertNodesOnRoutes(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->GetSingleNodesOfType(type), {});</div>
|
|
<div class="line"><a name="l03555"></a><span class="lineno"> 3555</span>  }</div>
|
|
<div class="line"><a name="l03556"></a><span class="lineno"> 3556</span>  }</div>
|
|
<div class="line"><a name="l03557"></a><span class="lineno"> 3557</span> }</div>
|
|
<div class="line"><a name="l03558"></a><span class="lineno"> 3558</span>  </div>
|
|
<div class="line"><a name="l03559"></a><span class="lineno"> 3559</span> <span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::InsertPairs(</div>
|
|
<div class="line"><a name="l03560"></a><span class="lineno"> 3560</span>  <span class="keyword">const</span> std::vector<int>& pair_indices) {</div>
|
|
<div class="line"><a name="l03561"></a><span class="lineno"> 3561</span>  <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<PairEntry></a> priority_queue;</div>
|
|
<div class="line"><a name="l03562"></a><span class="lineno"> 3562</span>  std::vector<PairEntries> pickup_to_entries;</div>
|
|
<div class="line"><a name="l03563"></a><span class="lineno"> 3563</span>  std::vector<PairEntries> delivery_to_entries;</div>
|
|
<div class="line"><a name="l03564"></a><span class="lineno"> 3564</span>  InitializePairPositions(pair_indices, &priority_queue, &pickup_to_entries,</div>
|
|
<div class="line"><a name="l03565"></a><span class="lineno"> 3565</span>  &delivery_to_entries);</div>
|
|
<div class="line"><a name="l03566"></a><span class="lineno"> 3566</span>  <span class="keywordflow">while</span> (!priority_queue.<a class="code" href="class_adjustable_priority_queue.html#a8e12342fc420701fbffd97025421575a">IsEmpty</a>()) {</div>
|
|
<div class="line"><a name="l03567"></a><span class="lineno"> 3567</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()) {</div>
|
|
<div class="line"><a name="l03568"></a><span class="lineno"> 3568</span>  <span class="keywordflow">for</span> (PairEntry* <span class="keyword">const</span> entry : *priority_queue.<a class="code" href="class_adjustable_priority_queue.html#a3851da81ad9a9c858fc40be1f3f7baf2">Raw</a>()) {</div>
|
|
<div class="line"><a name="l03569"></a><span class="lineno"> 3569</span>  <span class="keyword">delete</span> entry;</div>
|
|
<div class="line"><a name="l03570"></a><span class="lineno"> 3570</span>  }</div>
|
|
<div class="line"><a name="l03571"></a><span class="lineno"> 3571</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l03572"></a><span class="lineno"> 3572</span>  }</div>
|
|
<div class="line"><a name="l03573"></a><span class="lineno"> 3573</span>  PairEntry* <span class="keyword">const</span> entry = priority_queue.<a class="code" href="class_adjustable_priority_queue.html#a8e7578f2135632c4d0ce66fd5936231e">Top</a>();</div>
|
|
<div class="line"><a name="l03574"></a><span class="lineno"> 3574</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup = entry->pickup_to_insert();</div>
|
|
<div class="line"><a name="l03575"></a><span class="lineno"> 3575</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery = entry->delivery_to_insert();</div>
|
|
<div class="line"><a name="l03576"></a><span class="lineno"> 3576</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(pickup) || <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(delivery)) {</div>
|
|
<div class="line"><a name="l03577"></a><span class="lineno"> 3577</span>  DeletePairEntry(entry, &priority_queue, &pickup_to_entries,</div>
|
|
<div class="line"><a name="l03578"></a><span class="lineno"> 3578</span>  &delivery_to_entries);</div>
|
|
<div class="line"><a name="l03579"></a><span class="lineno"> 3579</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l03580"></a><span class="lineno"> 3580</span>  }</div>
|
|
<div class="line"><a name="l03581"></a><span class="lineno"> 3581</span>  </div>
|
|
<div class="line"><a name="l03582"></a><span class="lineno"> 3582</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> entry_vehicle = entry->vehicle();</div>
|
|
<div class="line"><a name="l03583"></a><span class="lineno"> 3583</span>  <span class="keywordflow">if</span> (entry_vehicle == -1) {</div>
|
|
<div class="line"><a name="l03584"></a><span class="lineno"> 3584</span>  <span class="comment">// Pair is unperformed.</span></div>
|
|
<div class="line"><a name="l03585"></a><span class="lineno"> 3585</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(pickup, pickup);</div>
|
|
<div class="line"><a name="l03586"></a><span class="lineno"> 3586</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(delivery, delivery);</div>
|
|
<div class="line"><a name="l03587"></a><span class="lineno"> 3587</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>()) {</div>
|
|
<div class="line"><a name="l03588"></a><span class="lineno"> 3588</span>  DeletePairEntry(entry, &priority_queue, &pickup_to_entries,</div>
|
|
<div class="line"><a name="l03589"></a><span class="lineno"> 3589</span>  &delivery_to_entries);</div>
|
|
<div class="line"><a name="l03590"></a><span class="lineno"> 3590</span>  }</div>
|
|
<div class="line"><a name="l03591"></a><span class="lineno"> 3591</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l03592"></a><span class="lineno"> 3592</span>  }</div>
|
|
<div class="line"><a name="l03593"></a><span class="lineno"> 3593</span>  </div>
|
|
<div class="line"><a name="l03594"></a><span class="lineno"> 3594</span>  <span class="comment">// Pair is performed.</span></div>
|
|
<div class="line"><a name="l03595"></a><span class="lineno"> 3595</span>  <span class="keywordflow">if</span> (InsertPairEntryUsingEmptyVehicleTypeCurator(</div>
|
|
<div class="line"><a name="l03596"></a><span class="lineno"> 3596</span>  pair_indices, entry, &priority_queue, &pickup_to_entries,</div>
|
|
<div class="line"><a name="l03597"></a><span class="lineno"> 3597</span>  &delivery_to_entries)) {</div>
|
|
<div class="line"><a name="l03598"></a><span class="lineno"> 3598</span>  <span class="comment">// The entry corresponded to an insertion on an empty vehicle, which was</span></div>
|
|
<div class="line"><a name="l03599"></a><span class="lineno"> 3599</span>  <span class="comment">// handled by the method.</span></div>
|
|
<div class="line"><a name="l03600"></a><span class="lineno"> 3600</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l03601"></a><span class="lineno"> 3601</span>  }</div>
|
|
<div class="line"><a name="l03602"></a><span class="lineno"> 3602</span>  </div>
|
|
<div class="line"><a name="l03603"></a><span class="lineno"> 3603</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup_insert_after = entry->pickup_insert_after();</div>
|
|
<div class="line"><a name="l03604"></a><span class="lineno"> 3604</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup_insert_before = <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(pickup_insert_after);</div>
|
|
<div class="line"><a name="l03605"></a><span class="lineno"> 3605</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a40574fa8ec102d52f650a616d7fe6c39">InsertBetween</a>(pickup, pickup_insert_after, pickup_insert_before);</div>
|
|
<div class="line"><a name="l03606"></a><span class="lineno"> 3606</span>  </div>
|
|
<div class="line"><a name="l03607"></a><span class="lineno"> 3607</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery_insert_after = entry->delivery_insert_after();</div>
|
|
<div class="line"><a name="l03608"></a><span class="lineno"> 3608</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery_insert_before = (delivery_insert_after == pickup)</div>
|
|
<div class="line"><a name="l03609"></a><span class="lineno"> 3609</span>  ? pickup_insert_before</div>
|
|
<div class="line"><a name="l03610"></a><span class="lineno"> 3610</span>  : <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(delivery_insert_after);</div>
|
|
<div class="line"><a name="l03611"></a><span class="lineno"> 3611</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a40574fa8ec102d52f650a616d7fe6c39">InsertBetween</a>(delivery, delivery_insert_after, delivery_insert_before);</div>
|
|
<div class="line"><a name="l03612"></a><span class="lineno"> 3612</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>()) {</div>
|
|
<div class="line"><a name="l03613"></a><span class="lineno"> 3613</span>  UpdateAfterPairInsertion(pair_indices, entry_vehicle, pickup,</div>
|
|
<div class="line"><a name="l03614"></a><span class="lineno"> 3614</span>  pickup_insert_after, delivery,</div>
|
|
<div class="line"><a name="l03615"></a><span class="lineno"> 3615</span>  delivery_insert_after, &priority_queue,</div>
|
|
<div class="line"><a name="l03616"></a><span class="lineno"> 3616</span>  &pickup_to_entries, &delivery_to_entries);</div>
|
|
<div class="line"><a name="l03617"></a><span class="lineno"> 3617</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03618"></a><span class="lineno"> 3618</span>  DeletePairEntry(entry, &priority_queue, &pickup_to_entries,</div>
|
|
<div class="line"><a name="l03619"></a><span class="lineno"> 3619</span>  &delivery_to_entries);</div>
|
|
<div class="line"><a name="l03620"></a><span class="lineno"> 3620</span>  }</div>
|
|
<div class="line"><a name="l03621"></a><span class="lineno"> 3621</span>  }</div>
|
|
<div class="line"><a name="l03622"></a><span class="lineno"> 3622</span> }</div>
|
|
<div class="line"><a name="l03623"></a><span class="lineno"> 3623</span>  </div>
|
|
<div class="line"><a name="l03624"></a><span class="lineno"> 3624</span> <span class="keywordtype">bool</span> GlobalCheapestInsertionFilteredHeuristic::</div>
|
|
<div class="line"><a name="l03625"></a><span class="lineno"> 3625</span>  InsertPairEntryUsingEmptyVehicleTypeCurator(</div>
|
|
<div class="line"><a name="l03626"></a><span class="lineno"> 3626</span>  <span class="keyword">const</span> std::vector<int>& pair_indices,</div>
|
|
<div class="line"><a name="l03627"></a><span class="lineno"> 3627</span>  GlobalCheapestInsertionFilteredHeuristic::PairEntry* <span class="keyword">const</span> pair_entry,</div>
|
|
<div class="line"><a name="l03628"></a><span class="lineno"> 3628</span>  <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a name="l03629"></a><span class="lineno"> 3629</span>  GlobalCheapestInsertionFilteredHeuristic::PairEntry>*</div>
|
|
<div class="line"><a name="l03630"></a><span class="lineno"> 3630</span>  priority_queue,</div>
|
|
<div class="line"><a name="l03631"></a><span class="lineno"> 3631</span>  std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a name="l03632"></a><span class="lineno"> 3632</span>  pickup_to_entries,</div>
|
|
<div class="line"><a name="l03633"></a><span class="lineno"> 3633</span>  std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a name="l03634"></a><span class="lineno"> 3634</span>  delivery_to_entries) {</div>
|
|
<div class="line"><a name="l03635"></a><span class="lineno"> 3635</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> entry_vehicle = pair_entry->vehicle();</div>
|
|
<div class="line"><a name="l03636"></a><span class="lineno"> 3636</span>  <span class="keywordflow">if</span> (entry_vehicle == -1 || !<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(entry_vehicle)) {</div>
|
|
<div class="line"><a name="l03637"></a><span class="lineno"> 3637</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l03638"></a><span class="lineno"> 3638</span>  }</div>
|
|
<div class="line"><a name="l03639"></a><span class="lineno"> 3639</span>  </div>
|
|
<div class="line"><a name="l03640"></a><span class="lineno"> 3640</span>  <span class="comment">// Trying to insert on an empty vehicle.</span></div>
|
|
<div class="line"><a name="l03641"></a><span class="lineno"> 3641</span>  <span class="comment">// As we only have one pair_entry per empty vehicle type, we try inserting on</span></div>
|
|
<div class="line"><a name="l03642"></a><span class="lineno"> 3642</span>  <span class="comment">// all vehicles of this type with the same fixed cost, as they all have the</span></div>
|
|
<div class="line"><a name="l03643"></a><span class="lineno"> 3643</span>  <span class="comment">// same insertion value.</span></div>
|
|
<div class="line"><a name="l03644"></a><span class="lineno"> 3644</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup = pair_entry->pickup_to_insert();</div>
|
|
<div class="line"><a name="l03645"></a><span class="lineno"> 3645</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery = pair_entry->delivery_to_insert();</div>
|
|
<div class="line"><a name="l03646"></a><span class="lineno"> 3646</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> entry_fixed_cost = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a4bab641f5b9bf8de266adad29558b4c2">GetFixedCostOfVehicle</a>(entry_vehicle);</div>
|
|
<div class="line"><a name="l03647"></a><span class="lineno"> 3647</span>  <span class="keyword">auto</span> vehicle_is_compatible = [<span class="keyword">this</span>, entry_fixed_cost, pickup,</div>
|
|
<div class="line"><a name="l03648"></a><span class="lineno"> 3648</span>  delivery](<span class="keywordtype">int</span> vehicle) {</div>
|
|
<div class="line"><a name="l03649"></a><span class="lineno"> 3649</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a4bab641f5b9bf8de266adad29558b4c2">GetFixedCostOfVehicle</a>(vehicle) != entry_fixed_cost) {</div>
|
|
<div class="line"><a name="l03650"></a><span class="lineno"> 3650</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l03651"></a><span class="lineno"> 3651</span>  }</div>
|
|
<div class="line"><a name="l03652"></a><span class="lineno"> 3652</span>  <span class="comment">// NOTE: Only empty vehicles should be in the vehicle_curator_.</span></div>
|
|
<div class="line"><a name="l03653"></a><span class="lineno"> 3653</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(vehicle));</div>
|
|
<div class="line"><a name="l03654"></a><span class="lineno"> 3654</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_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a1dc8d32892f78532c8ee7a7186158e07">End</a>(vehicle);</div>
|
|
<div class="line"><a name="l03655"></a><span class="lineno"> 3655</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a40574fa8ec102d52f650a616d7fe6c39">InsertBetween</a>(pickup, <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->Start(vehicle), end);</div>
|
|
<div class="line"><a name="l03656"></a><span class="lineno"> 3656</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a40574fa8ec102d52f650a616d7fe6c39">InsertBetween</a>(delivery, pickup, end);</div>
|
|
<div class="line"><a name="l03657"></a><span class="lineno"> 3657</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>();</div>
|
|
<div class="line"><a name="l03658"></a><span class="lineno"> 3658</span>  };</div>
|
|
<div class="line"><a name="l03659"></a><span class="lineno"> 3659</span>  <span class="comment">// Since the vehicles of the same type are sorted by increasing fixed</span></div>
|
|
<div class="line"><a name="l03660"></a><span class="lineno"> 3660</span>  <span class="comment">// cost by the curator, we can stop as soon as a vehicle with a fixed cost</span></div>
|
|
<div class="line"><a name="l03661"></a><span class="lineno"> 3661</span>  <span class="comment">// higher than the entry_fixed_cost is found which is empty, and adapt the</span></div>
|
|
<div class="line"><a name="l03662"></a><span class="lineno"> 3662</span>  <span class="comment">// pair entry with this new vehicle.</span></div>
|
|
<div class="line"><a name="l03663"></a><span class="lineno"> 3663</span>  <span class="keyword">auto</span> stop_and_return_vehicle = [<span class="keyword">this</span>, entry_fixed_cost](<span class="keywordtype">int</span> vehicle) {</div>
|
|
<div class="line"><a name="l03664"></a><span class="lineno"> 3664</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a4bab641f5b9bf8de266adad29558b4c2">GetFixedCostOfVehicle</a>(vehicle) > entry_fixed_cost;</div>
|
|
<div class="line"><a name="l03665"></a><span class="lineno"> 3665</span>  };</div>
|
|
<div class="line"><a name="l03666"></a><span class="lineno"> 3666</span>  <span class="keyword">const</span> <span class="keyword">auto</span> [compatible_vehicle, next_fixed_cost_empty_vehicle] =</div>
|
|
<div class="line"><a name="l03667"></a><span class="lineno"> 3667</span>  empty_vehicle_type_curator_->GetCompatibleVehicleOfType(</div>
|
|
<div class="line"><a name="l03668"></a><span class="lineno"> 3668</span>  empty_vehicle_type_curator_->Type(entry_vehicle),</div>
|
|
<div class="line"><a name="l03669"></a><span class="lineno"> 3669</span>  vehicle_is_compatible, stop_and_return_vehicle);</div>
|
|
<div class="line"><a name="l03670"></a><span class="lineno"> 3670</span>  <span class="keywordflow">if</span> (compatible_vehicle >= 0) {</div>
|
|
<div class="line"><a name="l03671"></a><span class="lineno"> 3671</span>  <span class="comment">// The pair was inserted on this vehicle.</span></div>
|
|
<div class="line"><a name="l03672"></a><span class="lineno"> 3672</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> vehicle_start = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(compatible_vehicle);</div>
|
|
<div class="line"><a name="l03673"></a><span class="lineno"> 3673</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_previous_vehicle_entries =</div>
|
|
<div class="line"><a name="l03674"></a><span class="lineno"> 3674</span>  pickup_to_entries->at(vehicle_start).size() +</div>
|
|
<div class="line"><a name="l03675"></a><span class="lineno"> 3675</span>  delivery_to_entries->at(vehicle_start).size();</div>
|
|
<div class="line"><a name="l03676"></a><span class="lineno"> 3676</span>  UpdateAfterPairInsertion(pair_indices, compatible_vehicle, pickup,</div>
|
|
<div class="line"><a name="l03677"></a><span class="lineno"> 3677</span>  vehicle_start, delivery, pickup, priority_queue,</div>
|
|
<div class="line"><a name="l03678"></a><span class="lineno"> 3678</span>  pickup_to_entries, delivery_to_entries);</div>
|
|
<div class="line"><a name="l03679"></a><span class="lineno"> 3679</span>  <span class="keywordflow">if</span> (compatible_vehicle != entry_vehicle) {</div>
|
|
<div class="line"><a name="l03680"></a><span class="lineno"> 3680</span>  <span class="comment">// The pair was inserted on another empty vehicle of the same type</span></div>
|
|
<div class="line"><a name="l03681"></a><span class="lineno"> 3681</span>  <span class="comment">// and same fixed cost as entry_vehicle.</span></div>
|
|
<div class="line"><a name="l03682"></a><span class="lineno"> 3682</span>  <span class="comment">// Since this vehicle is empty and has the same fixed cost as the</span></div>
|
|
<div class="line"><a name="l03683"></a><span class="lineno"> 3683</span>  <span class="comment">// entry_vehicle, it shouldn't be the representative of empty vehicles</span></div>
|
|
<div class="line"><a name="l03684"></a><span class="lineno"> 3684</span>  <span class="comment">// for any pickup/delivery in the priority queue.</span></div>
|
|
<div class="line"><a name="l03685"></a><span class="lineno"> 3685</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(num_previous_vehicle_entries, 0);</div>
|
|
<div class="line"><a name="l03686"></a><span class="lineno"> 3686</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l03687"></a><span class="lineno"> 3687</span>  }</div>
|
|
<div class="line"><a name="l03688"></a><span class="lineno"> 3688</span>  <span class="comment">// The previously unused entry_vehicle is now used, so we use the next</span></div>
|
|
<div class="line"><a name="l03689"></a><span class="lineno"> 3689</span>  <span class="comment">// available vehicle of the same type to compute and store insertions on</span></div>
|
|
<div class="line"><a name="l03690"></a><span class="lineno"> 3690</span>  <span class="comment">// empty vehicles.</span></div>
|
|
<div class="line"><a name="l03691"></a><span class="lineno"> 3691</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> new_empty_vehicle =</div>
|
|
<div class="line"><a name="l03692"></a><span class="lineno"> 3692</span>  empty_vehicle_type_curator_->GetLowestFixedCostVehicleOfType(</div>
|
|
<div class="line"><a name="l03693"></a><span class="lineno"> 3693</span>  empty_vehicle_type_curator_->Type(compatible_vehicle));</div>
|
|
<div class="line"><a name="l03694"></a><span class="lineno"> 3694</span>  </div>
|
|
<div class="line"><a name="l03695"></a><span class="lineno"> 3695</span>  <span class="keywordflow">if</span> (new_empty_vehicle >= 0) {</div>
|
|
<div class="line"><a name="l03696"></a><span class="lineno"> 3696</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(new_empty_vehicle));</div>
|
|
<div class="line"><a name="l03697"></a><span class="lineno"> 3697</span>  <span class="comment">// Add node entries after this vehicle start for uninserted pairs which</span></div>
|
|
<div class="line"><a name="l03698"></a><span class="lineno"> 3698</span>  <span class="comment">// don't have entries on this empty vehicle.</span></div>
|
|
<div class="line"><a name="l03699"></a><span class="lineno"> 3699</span>  UpdatePairPositions(pair_indices, new_empty_vehicle,</div>
|
|
<div class="line"><a name="l03700"></a><span class="lineno"> 3700</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->Start(new_empty_vehicle), priority_queue,</div>
|
|
<div class="line"><a name="l03701"></a><span class="lineno"> 3701</span>  pickup_to_entries, delivery_to_entries);</div>
|
|
<div class="line"><a name="l03702"></a><span class="lineno"> 3702</span>  }</div>
|
|
<div class="line"><a name="l03703"></a><span class="lineno"> 3703</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (next_fixed_cost_empty_vehicle >= 0) {</div>
|
|
<div class="line"><a name="l03704"></a><span class="lineno"> 3704</span>  <span class="comment">// Could not insert on this vehicle or any other vehicle of the same type</span></div>
|
|
<div class="line"><a name="l03705"></a><span class="lineno"> 3705</span>  <span class="comment">// with the same fixed cost, but found an empty vehicle of this type with</span></div>
|
|
<div class="line"><a name="l03706"></a><span class="lineno"> 3706</span>  <span class="comment">// higher fixed cost.</span></div>
|
|
<div class="line"><a name="l03707"></a><span class="lineno"> 3707</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(next_fixed_cost_empty_vehicle));</div>
|
|
<div class="line"><a name="l03708"></a><span class="lineno"> 3708</span>  <span class="comment">// Update the pair entry to correspond to an insertion on this</span></div>
|
|
<div class="line"><a name="l03709"></a><span class="lineno"> 3709</span>  <span class="comment">// next_fixed_cost_empty_vehicle instead of the previous entry_vehicle.</span></div>
|
|
<div class="line"><a name="l03710"></a><span class="lineno"> 3710</span>  pair_entry->set_vehicle(next_fixed_cost_empty_vehicle);</div>
|
|
<div class="line"><a name="l03711"></a><span class="lineno"> 3711</span>  pickup_to_entries->at(pair_entry->pickup_insert_after()).erase(pair_entry);</div>
|
|
<div class="line"><a name="l03712"></a><span class="lineno"> 3712</span>  pair_entry->set_pickup_insert_after(</div>
|
|
<div class="line"><a name="l03713"></a><span class="lineno"> 3713</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->Start(next_fixed_cost_empty_vehicle));</div>
|
|
<div class="line"><a name="l03714"></a><span class="lineno"> 3714</span>  pickup_to_entries->at(pair_entry->pickup_insert_after()).insert(pair_entry);</div>
|
|
<div class="line"><a name="l03715"></a><span class="lineno"> 3715</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(pair_entry->delivery_insert_after(), pickup);</div>
|
|
<div class="line"><a name="l03716"></a><span class="lineno"> 3716</span>  UpdatePairEntry(pair_entry, priority_queue);</div>
|
|
<div class="line"><a name="l03717"></a><span class="lineno"> 3717</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03718"></a><span class="lineno"> 3718</span>  DeletePairEntry(pair_entry, priority_queue, pickup_to_entries,</div>
|
|
<div class="line"><a name="l03719"></a><span class="lineno"> 3719</span>  delivery_to_entries);</div>
|
|
<div class="line"><a name="l03720"></a><span class="lineno"> 3720</span>  }</div>
|
|
<div class="line"><a name="l03721"></a><span class="lineno"> 3721</span>  </div>
|
|
<div class="line"><a name="l03722"></a><span class="lineno"> 3722</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l03723"></a><span class="lineno"> 3723</span> }</div>
|
|
<div class="line"><a name="l03724"></a><span class="lineno"> 3724</span>  </div>
|
|
<div class="line"><a name="l03725"></a><span class="lineno"> 3725</span> <span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::InsertNodesOnRoutes(</div>
|
|
<div class="line"><a name="l03726"></a><span class="lineno"> 3726</span>  <span class="keyword">const</span> std::vector<int>& nodes, <span class="keyword">const</span> absl::flat_hash_set<int>& vehicles) {</div>
|
|
<div class="line"><a name="l03727"></a><span class="lineno"> 3727</span>  <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<NodeEntry></a> priority_queue;</div>
|
|
<div class="line"><a name="l03728"></a><span class="lineno"> 3728</span>  std::vector<NodeEntries> position_to_node_entries;</div>
|
|
<div class="line"><a name="l03729"></a><span class="lineno"> 3729</span>  InitializePositions(nodes, vehicles, &priority_queue,</div>
|
|
<div class="line"><a name="l03730"></a><span class="lineno"> 3730</span>  &position_to_node_entries);</div>
|
|
<div class="line"><a name="l03731"></a><span class="lineno"> 3731</span>  <span class="comment">// The following boolean indicates whether or not all vehicles are being</span></div>
|
|
<div class="line"><a name="l03732"></a><span class="lineno"> 3732</span>  <span class="comment">// considered for insertion of the nodes simultaneously.</span></div>
|
|
<div class="line"><a name="l03733"></a><span class="lineno"> 3733</span>  <span class="comment">// In the sequential version of the heuristic, as well as when inserting</span></div>
|
|
<div class="line"><a name="l03734"></a><span class="lineno"> 3734</span>  <span class="comment">// single pickup or deliveries from pickup/delivery pairs, this will be false.</span></div>
|
|
<div class="line"><a name="l03735"></a><span class="lineno"> 3735</span>  <span class="comment">// In the general parallel version of the heuristic, all_vehicles is true.</span></div>
|
|
<div class="line"><a name="l03736"></a><span class="lineno"> 3736</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> all_vehicles =</div>
|
|
<div class="line"><a name="l03737"></a><span class="lineno"> 3737</span>  vehicles.empty() || vehicles.size() == <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>();</div>
|
|
<div class="line"><a name="l03738"></a><span class="lineno"> 3738</span>  </div>
|
|
<div class="line"><a name="l03739"></a><span class="lineno"> 3739</span>  <span class="keywordflow">while</span> (!priority_queue.<a class="code" href="class_adjustable_priority_queue.html#a8e12342fc420701fbffd97025421575a">IsEmpty</a>()) {</div>
|
|
<div class="line"><a name="l03740"></a><span class="lineno"> 3740</span>  NodeEntry* <span class="keyword">const</span> node_entry = priority_queue.<a class="code" href="class_adjustable_priority_queue.html#a8e7578f2135632c4d0ce66fd5936231e">Top</a>();</div>
|
|
<div class="line"><a name="l03741"></a><span class="lineno"> 3741</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()) {</div>
|
|
<div class="line"><a name="l03742"></a><span class="lineno"> 3742</span>  <span class="keywordflow">for</span> (NodeEntry* <span class="keyword">const</span> entry : *priority_queue.<a class="code" href="class_adjustable_priority_queue.html#a3851da81ad9a9c858fc40be1f3f7baf2">Raw</a>()) {</div>
|
|
<div class="line"><a name="l03743"></a><span class="lineno"> 3743</span>  <span class="keyword">delete</span> entry;</div>
|
|
<div class="line"><a name="l03744"></a><span class="lineno"> 3744</span>  }</div>
|
|
<div class="line"><a name="l03745"></a><span class="lineno"> 3745</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l03746"></a><span class="lineno"> 3746</span>  }</div>
|
|
<div class="line"><a name="l03747"></a><span class="lineno"> 3747</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node_to_insert = node_entry->node_to_insert();</div>
|
|
<div class="line"><a name="l03748"></a><span class="lineno"> 3748</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(node_to_insert)) {</div>
|
|
<div class="line"><a name="l03749"></a><span class="lineno"> 3749</span>  DeleteNodeEntry(node_entry, &priority_queue, &position_to_node_entries);</div>
|
|
<div class="line"><a name="l03750"></a><span class="lineno"> 3750</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l03751"></a><span class="lineno"> 3751</span>  }</div>
|
|
<div class="line"><a name="l03752"></a><span class="lineno"> 3752</span>  </div>
|
|
<div class="line"><a name="l03753"></a><span class="lineno"> 3753</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> entry_vehicle = node_entry->vehicle();</div>
|
|
<div class="line"><a name="l03754"></a><span class="lineno"> 3754</span>  <span class="keywordflow">if</span> (entry_vehicle == -1) {</div>
|
|
<div class="line"><a name="l03755"></a><span class="lineno"> 3755</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(all_vehicles);</div>
|
|
<div class="line"><a name="l03756"></a><span class="lineno"> 3756</span>  <span class="comment">// Make node unperformed.</span></div>
|
|
<div class="line"><a name="l03757"></a><span class="lineno"> 3757</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(node_to_insert, node_to_insert);</div>
|
|
<div class="line"><a name="l03758"></a><span class="lineno"> 3758</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>()) {</div>
|
|
<div class="line"><a name="l03759"></a><span class="lineno"> 3759</span>  DeleteNodeEntry(node_entry, &priority_queue, &position_to_node_entries);</div>
|
|
<div class="line"><a name="l03760"></a><span class="lineno"> 3760</span>  }</div>
|
|
<div class="line"><a name="l03761"></a><span class="lineno"> 3761</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l03762"></a><span class="lineno"> 3762</span>  }</div>
|
|
<div class="line"><a name="l03763"></a><span class="lineno"> 3763</span>  </div>
|
|
<div class="line"><a name="l03764"></a><span class="lineno"> 3764</span>  <span class="comment">// Make node performed.</span></div>
|
|
<div class="line"><a name="l03765"></a><span class="lineno"> 3765</span>  <span class="keywordflow">if</span> (InsertNodeEntryUsingEmptyVehicleTypeCurator(</div>
|
|
<div class="line"><a name="l03766"></a><span class="lineno"> 3766</span>  nodes, all_vehicles, node_entry, &priority_queue,</div>
|
|
<div class="line"><a name="l03767"></a><span class="lineno"> 3767</span>  &position_to_node_entries)) {</div>
|
|
<div class="line"><a name="l03768"></a><span class="lineno"> 3768</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(all_vehicles);</div>
|
|
<div class="line"><a name="l03769"></a><span class="lineno"> 3769</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l03770"></a><span class="lineno"> 3770</span>  }</div>
|
|
<div class="line"><a name="l03771"></a><span class="lineno"> 3771</span>  </div>
|
|
<div class="line"><a name="l03772"></a><span class="lineno"> 3772</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> insert_after = node_entry->insert_after();</div>
|
|
<div class="line"><a name="l03773"></a><span class="lineno"> 3773</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a40574fa8ec102d52f650a616d7fe6c39">InsertBetween</a>(node_to_insert, insert_after, <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(insert_after));</div>
|
|
<div class="line"><a name="l03774"></a><span class="lineno"> 3774</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>()) {</div>
|
|
<div class="line"><a name="l03775"></a><span class="lineno"> 3775</span>  UpdatePositions(nodes, entry_vehicle, node_to_insert, all_vehicles,</div>
|
|
<div class="line"><a name="l03776"></a><span class="lineno"> 3776</span>  &priority_queue, &position_to_node_entries);</div>
|
|
<div class="line"><a name="l03777"></a><span class="lineno"> 3777</span>  UpdatePositions(nodes, entry_vehicle, insert_after, all_vehicles,</div>
|
|
<div class="line"><a name="l03778"></a><span class="lineno"> 3778</span>  &priority_queue, &position_to_node_entries);</div>
|
|
<div class="line"><a name="l03779"></a><span class="lineno"> 3779</span>  SetVehicleIndex(node_to_insert, entry_vehicle);</div>
|
|
<div class="line"><a name="l03780"></a><span class="lineno"> 3780</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03781"></a><span class="lineno"> 3781</span>  DeleteNodeEntry(node_entry, &priority_queue, &position_to_node_entries);</div>
|
|
<div class="line"><a name="l03782"></a><span class="lineno"> 3782</span>  }</div>
|
|
<div class="line"><a name="l03783"></a><span class="lineno"> 3783</span>  }</div>
|
|
<div class="line"><a name="l03784"></a><span class="lineno"> 3784</span> }</div>
|
|
<div class="line"><a name="l03785"></a><span class="lineno"> 3785</span>  </div>
|
|
<div class="line"><a name="l03786"></a><span class="lineno"> 3786</span> <span class="keywordtype">bool</span> GlobalCheapestInsertionFilteredHeuristic::</div>
|
|
<div class="line"><a name="l03787"></a><span class="lineno"> 3787</span>  InsertNodeEntryUsingEmptyVehicleTypeCurator(</div>
|
|
<div class="line"><a name="l03788"></a><span class="lineno"> 3788</span>  <span class="keyword">const</span> std::vector<int>& nodes, <span class="keywordtype">bool</span> all_vehicles,</div>
|
|
<div class="line"><a name="l03789"></a><span class="lineno"> 3789</span>  GlobalCheapestInsertionFilteredHeuristic::NodeEntry* <span class="keyword">const</span> node_entry,</div>
|
|
<div class="line"><a name="l03790"></a><span class="lineno"> 3790</span>  <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a name="l03791"></a><span class="lineno"> 3791</span>  GlobalCheapestInsertionFilteredHeuristic::NodeEntry>*</div>
|
|
<div class="line"><a name="l03792"></a><span class="lineno"> 3792</span>  priority_queue,</div>
|
|
<div class="line"><a name="l03793"></a><span class="lineno"> 3793</span>  std::vector<GlobalCheapestInsertionFilteredHeuristic::NodeEntries>*</div>
|
|
<div class="line"><a name="l03794"></a><span class="lineno"> 3794</span>  position_to_node_entries) {</div>
|
|
<div class="line"><a name="l03795"></a><span class="lineno"> 3795</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> entry_vehicle = node_entry->vehicle();</div>
|
|
<div class="line"><a name="l03796"></a><span class="lineno"> 3796</span>  <span class="keywordflow">if</span> (entry_vehicle == -1 || !all_vehicles || !<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(entry_vehicle)) {</div>
|
|
<div class="line"><a name="l03797"></a><span class="lineno"> 3797</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l03798"></a><span class="lineno"> 3798</span>  }</div>
|
|
<div class="line"><a name="l03799"></a><span class="lineno"> 3799</span>  </div>
|
|
<div class="line"><a name="l03800"></a><span class="lineno"> 3800</span>  <span class="comment">// Trying to insert on an empty vehicle, and all vehicles are being</span></div>
|
|
<div class="line"><a name="l03801"></a><span class="lineno"> 3801</span>  <span class="comment">// considered simultaneously.</span></div>
|
|
<div class="line"><a name="l03802"></a><span class="lineno"> 3802</span>  <span class="comment">// As we only have one node_entry per type, we try inserting on all vehicles</span></div>
|
|
<div class="line"><a name="l03803"></a><span class="lineno"> 3803</span>  <span class="comment">// of this type with the same fixed cost as they all have the same insertion</span></div>
|
|
<div class="line"><a name="l03804"></a><span class="lineno"> 3804</span>  <span class="comment">// value.</span></div>
|
|
<div class="line"><a name="l03805"></a><span class="lineno"> 3805</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node_to_insert = node_entry->node_to_insert();</div>
|
|
<div class="line"><a name="l03806"></a><span class="lineno"> 3806</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> entry_fixed_cost = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a4bab641f5b9bf8de266adad29558b4c2">GetFixedCostOfVehicle</a>(entry_vehicle);</div>
|
|
<div class="line"><a name="l03807"></a><span class="lineno"> 3807</span>  <span class="keyword">auto</span> vehicle_is_compatible = [<span class="keyword">this</span>, entry_fixed_cost,</div>
|
|
<div class="line"><a name="l03808"></a><span class="lineno"> 3808</span>  node_to_insert](<span class="keywordtype">int</span> vehicle) {</div>
|
|
<div class="line"><a name="l03809"></a><span class="lineno"> 3809</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a4bab641f5b9bf8de266adad29558b4c2">GetFixedCostOfVehicle</a>(vehicle) != entry_fixed_cost) {</div>
|
|
<div class="line"><a name="l03810"></a><span class="lineno"> 3810</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l03811"></a><span class="lineno"> 3811</span>  }</div>
|
|
<div class="line"><a name="l03812"></a><span class="lineno"> 3812</span>  <span class="comment">// NOTE: Only empty vehicles should be in the vehicle_curator_.</span></div>
|
|
<div class="line"><a name="l03813"></a><span class="lineno"> 3813</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(vehicle));</div>
|
|
<div class="line"><a name="l03814"></a><span class="lineno"> 3814</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a40574fa8ec102d52f650a616d7fe6c39">InsertBetween</a>(node_to_insert, <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->Start(vehicle),</div>
|
|
<div class="line"><a name="l03815"></a><span class="lineno"> 3815</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->End(vehicle));</div>
|
|
<div class="line"><a name="l03816"></a><span class="lineno"> 3816</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>();</div>
|
|
<div class="line"><a name="l03817"></a><span class="lineno"> 3817</span>  };</div>
|
|
<div class="line"><a name="l03818"></a><span class="lineno"> 3818</span>  <span class="comment">// Since the vehicles of the same type are sorted by increasing fixed</span></div>
|
|
<div class="line"><a name="l03819"></a><span class="lineno"> 3819</span>  <span class="comment">// cost by the curator, we can stop as soon as an empty vehicle with a fixed</span></div>
|
|
<div class="line"><a name="l03820"></a><span class="lineno"> 3820</span>  <span class="comment">// cost higher than the entry_fixed_cost is found, and add new entries for</span></div>
|
|
<div class="line"><a name="l03821"></a><span class="lineno"> 3821</span>  <span class="comment">// this new vehicle.</span></div>
|
|
<div class="line"><a name="l03822"></a><span class="lineno"> 3822</span>  <span class="keyword">auto</span> stop_and_return_vehicle = [<span class="keyword">this</span>, entry_fixed_cost](<span class="keywordtype">int</span> vehicle) {</div>
|
|
<div class="line"><a name="l03823"></a><span class="lineno"> 3823</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a4bab641f5b9bf8de266adad29558b4c2">GetFixedCostOfVehicle</a>(vehicle) > entry_fixed_cost;</div>
|
|
<div class="line"><a name="l03824"></a><span class="lineno"> 3824</span>  };</div>
|
|
<div class="line"><a name="l03825"></a><span class="lineno"> 3825</span>  <span class="keyword">const</span> <span class="keyword">auto</span> [compatible_vehicle, next_fixed_cost_empty_vehicle] =</div>
|
|
<div class="line"><a name="l03826"></a><span class="lineno"> 3826</span>  empty_vehicle_type_curator_->GetCompatibleVehicleOfType(</div>
|
|
<div class="line"><a name="l03827"></a><span class="lineno"> 3827</span>  empty_vehicle_type_curator_->Type(entry_vehicle),</div>
|
|
<div class="line"><a name="l03828"></a><span class="lineno"> 3828</span>  vehicle_is_compatible, stop_and_return_vehicle);</div>
|
|
<div class="line"><a name="l03829"></a><span class="lineno"> 3829</span>  <span class="keywordflow">if</span> (compatible_vehicle >= 0) {</div>
|
|
<div class="line"><a name="l03830"></a><span class="lineno"> 3830</span>  <span class="comment">// The node was inserted on this vehicle.</span></div>
|
|
<div class="line"><a name="l03831"></a><span class="lineno"> 3831</span>  UpdatePositions(nodes, compatible_vehicle, node_to_insert, all_vehicles,</div>
|
|
<div class="line"><a name="l03832"></a><span class="lineno"> 3832</span>  priority_queue, position_to_node_entries);</div>
|
|
<div class="line"><a name="l03833"></a><span class="lineno"> 3833</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> compatible_start = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(compatible_vehicle);</div>
|
|
<div class="line"><a name="l03834"></a><span class="lineno"> 3834</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> no_prior_entries_for_this_vehicle =</div>
|
|
<div class="line"><a name="l03835"></a><span class="lineno"> 3835</span>  position_to_node_entries->at(compatible_start).empty();</div>
|
|
<div class="line"><a name="l03836"></a><span class="lineno"> 3836</span>  UpdatePositions(nodes, compatible_vehicle, compatible_start, all_vehicles,</div>
|
|
<div class="line"><a name="l03837"></a><span class="lineno"> 3837</span>  priority_queue, position_to_node_entries);</div>
|
|
<div class="line"><a name="l03838"></a><span class="lineno"> 3838</span>  SetVehicleIndex(node_to_insert, compatible_vehicle);</div>
|
|
<div class="line"><a name="l03839"></a><span class="lineno"> 3839</span>  <span class="keywordflow">if</span> (compatible_vehicle != entry_vehicle) {</div>
|
|
<div class="line"><a name="l03840"></a><span class="lineno"> 3840</span>  <span class="comment">// The node was inserted on another empty vehicle of the same type</span></div>
|
|
<div class="line"><a name="l03841"></a><span class="lineno"> 3841</span>  <span class="comment">// and same fixed cost as entry_vehicle.</span></div>
|
|
<div class="line"><a name="l03842"></a><span class="lineno"> 3842</span>  <span class="comment">// Since this vehicle is empty and has the same fixed cost as the</span></div>
|
|
<div class="line"><a name="l03843"></a><span class="lineno"> 3843</span>  <span class="comment">// entry_vehicle, it shouldn't be the representative of empty vehicles</span></div>
|
|
<div class="line"><a name="l03844"></a><span class="lineno"> 3844</span>  <span class="comment">// for any node in the priority queue.</span></div>
|
|
<div class="line"><a name="l03845"></a><span class="lineno"> 3845</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(no_prior_entries_for_this_vehicle);</div>
|
|
<div class="line"><a name="l03846"></a><span class="lineno"> 3846</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l03847"></a><span class="lineno"> 3847</span>  }</div>
|
|
<div class="line"><a name="l03848"></a><span class="lineno"> 3848</span>  <span class="comment">// The previously unused entry_vehicle is now used, so we use the next</span></div>
|
|
<div class="line"><a name="l03849"></a><span class="lineno"> 3849</span>  <span class="comment">// available vehicle of the same type to compute and store insertions on</span></div>
|
|
<div class="line"><a name="l03850"></a><span class="lineno"> 3850</span>  <span class="comment">// empty vehicles.</span></div>
|
|
<div class="line"><a name="l03851"></a><span class="lineno"> 3851</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> new_empty_vehicle =</div>
|
|
<div class="line"><a name="l03852"></a><span class="lineno"> 3852</span>  empty_vehicle_type_curator_->GetLowestFixedCostVehicleOfType(</div>
|
|
<div class="line"><a name="l03853"></a><span class="lineno"> 3853</span>  empty_vehicle_type_curator_->Type(compatible_vehicle));</div>
|
|
<div class="line"><a name="l03854"></a><span class="lineno"> 3854</span>  </div>
|
|
<div class="line"><a name="l03855"></a><span class="lineno"> 3855</span>  <span class="keywordflow">if</span> (new_empty_vehicle >= 0) {</div>
|
|
<div class="line"><a name="l03856"></a><span class="lineno"> 3856</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(new_empty_vehicle));</div>
|
|
<div class="line"><a name="l03857"></a><span class="lineno"> 3857</span>  <span class="comment">// Add node entries after this vehicle start for uninserted nodes which</span></div>
|
|
<div class="line"><a name="l03858"></a><span class="lineno"> 3858</span>  <span class="comment">// don't have entries on this empty vehicle.</span></div>
|
|
<div class="line"><a name="l03859"></a><span class="lineno"> 3859</span>  UpdatePositions(nodes, new_empty_vehicle,</div>
|
|
<div class="line"><a name="l03860"></a><span class="lineno"> 3860</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->Start(new_empty_vehicle), all_vehicles,</div>
|
|
<div class="line"><a name="l03861"></a><span class="lineno"> 3861</span>  priority_queue, position_to_node_entries);</div>
|
|
<div class="line"><a name="l03862"></a><span class="lineno"> 3862</span>  }</div>
|
|
<div class="line"><a name="l03863"></a><span class="lineno"> 3863</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (next_fixed_cost_empty_vehicle >= 0) {</div>
|
|
<div class="line"><a name="l03864"></a><span class="lineno"> 3864</span>  <span class="comment">// Could not insert on this vehicle or any other vehicle of the same</span></div>
|
|
<div class="line"><a name="l03865"></a><span class="lineno"> 3865</span>  <span class="comment">// type with the same fixed cost, but found an empty vehicle of this type</span></div>
|
|
<div class="line"><a name="l03866"></a><span class="lineno"> 3866</span>  <span class="comment">// with higher fixed cost.</span></div>
|
|
<div class="line"><a name="l03867"></a><span class="lineno"> 3867</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(next_fixed_cost_empty_vehicle));</div>
|
|
<div class="line"><a name="l03868"></a><span class="lineno"> 3868</span>  <span class="comment">// Update the insertion entry to be on next_empty_vehicle instead of the</span></div>
|
|
<div class="line"><a name="l03869"></a><span class="lineno"> 3869</span>  <span class="comment">// previous entry_vehicle.</span></div>
|
|
<div class="line"><a name="l03870"></a><span class="lineno"> 3870</span>  position_to_node_entries->at(node_entry->insert_after()).erase(node_entry);</div>
|
|
<div class="line"><a name="l03871"></a><span class="lineno"> 3871</span>  node_entry->set_insert_after(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->Start(next_fixed_cost_empty_vehicle));</div>
|
|
<div class="line"><a name="l03872"></a><span class="lineno"> 3872</span>  position_to_node_entries->at(node_entry->insert_after()).insert(node_entry);</div>
|
|
<div class="line"><a name="l03873"></a><span class="lineno"> 3873</span>  node_entry->set_vehicle(next_fixed_cost_empty_vehicle);</div>
|
|
<div class="line"><a name="l03874"></a><span class="lineno"> 3874</span>  UpdateNodeEntry(node_entry, priority_queue);</div>
|
|
<div class="line"><a name="l03875"></a><span class="lineno"> 3875</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03876"></a><span class="lineno"> 3876</span>  DeleteNodeEntry(node_entry, priority_queue, position_to_node_entries);</div>
|
|
<div class="line"><a name="l03877"></a><span class="lineno"> 3877</span>  }</div>
|
|
<div class="line"><a name="l03878"></a><span class="lineno"> 3878</span>  </div>
|
|
<div class="line"><a name="l03879"></a><span class="lineno"> 3879</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l03880"></a><span class="lineno"> 3880</span> }</div>
|
|
<div class="line"><a name="l03881"></a><span class="lineno"> 3881</span>  </div>
|
|
<div class="line"><a name="l03882"></a><span class="lineno"> 3882</span> <span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::SequentialInsertNodes(</div>
|
|
<div class="line"><a name="l03883"></a><span class="lineno"> 3883</span>  <span class="keyword">const</span> std::vector<int>& nodes) {</div>
|
|
<div class="line"><a name="l03884"></a><span class="lineno"> 3884</span>  std::vector<bool> is_vehicle_used;</div>
|
|
<div class="line"><a name="l03885"></a><span class="lineno"> 3885</span>  absl::flat_hash_set<int> used_vehicles;</div>
|
|
<div class="line"><a name="l03886"></a><span class="lineno"> 3886</span>  std::vector<int> unused_vehicles;</div>
|
|
<div class="line"><a name="l03887"></a><span class="lineno"> 3887</span>  </div>
|
|
<div class="line"><a name="l03888"></a><span class="lineno"> 3888</span>  DetectUsedVehicles(&is_vehicle_used, &unused_vehicles, &used_vehicles);</div>
|
|
<div class="line"><a name="l03889"></a><span class="lineno"> 3889</span>  <span class="keywordflow">if</span> (!used_vehicles.empty()) {</div>
|
|
<div class="line"><a name="l03890"></a><span class="lineno"> 3890</span>  InsertNodesOnRoutes(nodes, used_vehicles);</div>
|
|
<div class="line"><a name="l03891"></a><span class="lineno"> 3891</span>  }</div>
|
|
<div class="line"><a name="l03892"></a><span class="lineno"> 3892</span>  </div>
|
|
<div class="line"><a name="l03893"></a><span class="lineno"> 3893</span>  std::vector<std::vector<StartEndValue>> start_end_distances_per_node =</div>
|
|
<div class="line"><a name="l03894"></a><span class="lineno"> 3894</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a356517cd51c4b6259d7f439718719eaa">ComputeStartEndDistanceForVehicles</a>(unused_vehicles);</div>
|
|
<div class="line"><a name="l03895"></a><span class="lineno"> 3895</span>  std::priority_queue<Seed, std::vector<Seed>, std::greater<Seed>></div>
|
|
<div class="line"><a name="l03896"></a><span class="lineno"> 3896</span>  first_node_queue;</div>
|
|
<div class="line"><a name="l03897"></a><span class="lineno"> 3897</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a69d38e86eb8fc2fa4df0d8839c8dd5a9">InitializePriorityQueue</a>(&start_end_distances_per_node, &first_node_queue);</div>
|
|
<div class="line"><a name="l03898"></a><span class="lineno"> 3898</span>  </div>
|
|
<div class="line"><a name="l03899"></a><span class="lineno"> 3899</span>  <span class="keywordtype">int</span> vehicle = InsertSeedNode(&start_end_distances_per_node, &first_node_queue,</div>
|
|
<div class="line"><a name="l03900"></a><span class="lineno"> 3900</span>  &is_vehicle_used);</div>
|
|
<div class="line"><a name="l03901"></a><span class="lineno"> 3901</span>  </div>
|
|
<div class="line"><a name="l03902"></a><span class="lineno"> 3902</span>  <span class="keywordflow">while</span> (vehicle >= 0) {</div>
|
|
<div class="line"><a name="l03903"></a><span class="lineno"> 3903</span>  InsertNodesOnRoutes(nodes, {vehicle});</div>
|
|
<div class="line"><a name="l03904"></a><span class="lineno"> 3904</span>  vehicle = InsertSeedNode(&start_end_distances_per_node, &first_node_queue,</div>
|
|
<div class="line"><a name="l03905"></a><span class="lineno"> 3905</span>  &is_vehicle_used);</div>
|
|
<div class="line"><a name="l03906"></a><span class="lineno"> 3906</span>  }</div>
|
|
<div class="line"><a name="l03907"></a><span class="lineno"> 3907</span> }</div>
|
|
<div class="line"><a name="l03908"></a><span class="lineno"> 3908</span>  </div>
|
|
<div class="line"><a name="l03909"></a><span class="lineno"> 3909</span> <span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::DetectUsedVehicles(</div>
|
|
<div class="line"><a name="l03910"></a><span class="lineno"> 3910</span>  std::vector<bool>* is_vehicle_used, std::vector<int>* unused_vehicles,</div>
|
|
<div class="line"><a name="l03911"></a><span class="lineno"> 3911</span>  absl::flat_hash_set<int>* used_vehicles) {</div>
|
|
<div class="line"><a name="l03912"></a><span class="lineno"> 3912</span>  is_vehicle_used->clear();</div>
|
|
<div class="line"><a name="l03913"></a><span class="lineno"> 3913</span>  is_vehicle_used->resize(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->vehicles());</div>
|
|
<div class="line"><a name="l03914"></a><span class="lineno"> 3914</span>  </div>
|
|
<div class="line"><a name="l03915"></a><span class="lineno"> 3915</span>  used_vehicles->clear();</div>
|
|
<div class="line"><a name="l03916"></a><span class="lineno"> 3916</span>  used_vehicles->reserve(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->vehicles());</div>
|
|
<div class="line"><a name="l03917"></a><span class="lineno"> 3917</span>  </div>
|
|
<div class="line"><a name="l03918"></a><span class="lineno"> 3918</span>  unused_vehicles->clear();</div>
|
|
<div class="line"><a name="l03919"></a><span class="lineno"> 3919</span>  unused_vehicles->reserve(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->vehicles());</div>
|
|
<div class="line"><a name="l03920"></a><span class="lineno"> 3920</span>  </div>
|
|
<div class="line"><a name="l03921"></a><span class="lineno"> 3921</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); vehicle++) {</div>
|
|
<div class="line"><a name="l03922"></a><span class="lineno"> 3922</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(vehicle)) {</div>
|
|
<div class="line"><a name="l03923"></a><span class="lineno"> 3923</span>  (*is_vehicle_used)[vehicle] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l03924"></a><span class="lineno"> 3924</span>  used_vehicles->insert(vehicle);</div>
|
|
<div class="line"><a name="l03925"></a><span class="lineno"> 3925</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l03926"></a><span class="lineno"> 3926</span>  (*is_vehicle_used)[vehicle] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l03927"></a><span class="lineno"> 3927</span>  unused_vehicles->push_back(vehicle);</div>
|
|
<div class="line"><a name="l03928"></a><span class="lineno"> 3928</span>  }</div>
|
|
<div class="line"><a name="l03929"></a><span class="lineno"> 3929</span>  }</div>
|
|
<div class="line"><a name="l03930"></a><span class="lineno"> 3930</span> }</div>
|
|
<div class="line"><a name="l03931"></a><span class="lineno"> 3931</span>  </div>
|
|
<div class="line"><a name="l03932"></a><span class="lineno"> 3932</span> <span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::InsertFarthestNodesAsSeeds() {</div>
|
|
<div class="line"><a name="l03933"></a><span class="lineno"> 3933</span>  <span class="keywordflow">if</span> (gci_params_.<a class="code" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a5ad481f9ba9161a2aef5920b41303120">farthest_seeds_ratio</a> <= 0) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l03934"></a><span class="lineno"> 3934</span>  <span class="comment">// Insert at least 1 farthest Seed if the parameter is positive.</span></div>
|
|
<div class="line"><a name="l03935"></a><span class="lineno"> 3935</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_seeds = <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(</div>
|
|
<div class="line"><a name="l03936"></a><span class="lineno"> 3936</span>  std::ceil(gci_params_.<a class="code" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a5ad481f9ba9161a2aef5920b41303120">farthest_seeds_ratio</a> * <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->vehicles()));</div>
|
|
<div class="line"><a name="l03937"></a><span class="lineno"> 3937</span>  </div>
|
|
<div class="line"><a name="l03938"></a><span class="lineno"> 3938</span>  std::vector<bool> is_vehicle_used;</div>
|
|
<div class="line"><a name="l03939"></a><span class="lineno"> 3939</span>  absl::flat_hash_set<int> used_vehicles;</div>
|
|
<div class="line"><a name="l03940"></a><span class="lineno"> 3940</span>  std::vector<int> unused_vehicles;</div>
|
|
<div class="line"><a name="l03941"></a><span class="lineno"> 3941</span>  DetectUsedVehicles(&is_vehicle_used, &unused_vehicles, &used_vehicles);</div>
|
|
<div class="line"><a name="l03942"></a><span class="lineno"> 3942</span>  std::vector<std::vector<StartEndValue>> start_end_distances_per_node =</div>
|
|
<div class="line"><a name="l03943"></a><span class="lineno"> 3943</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a356517cd51c4b6259d7f439718719eaa">ComputeStartEndDistanceForVehicles</a>(unused_vehicles);</div>
|
|
<div class="line"><a name="l03944"></a><span class="lineno"> 3944</span>  </div>
|
|
<div class="line"><a name="l03945"></a><span class="lineno"> 3945</span>  <span class="comment">// Priority queue where the Seeds with a larger distance are given higher</span></div>
|
|
<div class="line"><a name="l03946"></a><span class="lineno"> 3946</span>  <span class="comment">// priority.</span></div>
|
|
<div class="line"><a name="l03947"></a><span class="lineno"> 3947</span>  std::priority_queue<Seed> farthest_node_queue;</div>
|
|
<div class="line"><a name="l03948"></a><span class="lineno"> 3948</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a69d38e86eb8fc2fa4df0d8839c8dd5a9">InitializePriorityQueue</a>(&start_end_distances_per_node, &farthest_node_queue);</div>
|
|
<div class="line"><a name="l03949"></a><span class="lineno"> 3949</span>  </div>
|
|
<div class="line"><a name="l03950"></a><span class="lineno"> 3950</span>  <span class="keywordtype">int</span> inserted_seeds = 0;</div>
|
|
<div class="line"><a name="l03951"></a><span class="lineno"> 3951</span>  <span class="keywordflow">while</span> (!farthest_node_queue.empty() && inserted_seeds < num_seeds) {</div>
|
|
<div class="line"><a name="l03952"></a><span class="lineno"> 3952</span>  InsertSeedNode(&start_end_distances_per_node, &farthest_node_queue,</div>
|
|
<div class="line"><a name="l03953"></a><span class="lineno"> 3953</span>  &is_vehicle_used);</div>
|
|
<div class="line"><a name="l03954"></a><span class="lineno"> 3954</span>  inserted_seeds++;</div>
|
|
<div class="line"><a name="l03955"></a><span class="lineno"> 3955</span>  }</div>
|
|
<div class="line"><a name="l03956"></a><span class="lineno"> 3956</span>  </div>
|
|
<div class="line"><a name="l03957"></a><span class="lineno"> 3957</span>  <span class="comment">// NOTE: As we don't use the empty_vehicle_type_curator_ when inserting seed</span></div>
|
|
<div class="line"><a name="l03958"></a><span class="lineno"> 3958</span>  <span class="comment">// nodes on routes, some previously empty vehicles may now be used, so we</span></div>
|
|
<div class="line"><a name="l03959"></a><span class="lineno"> 3959</span>  <span class="comment">// update the curator accordingly to ensure it still only stores empty</span></div>
|
|
<div class="line"><a name="l03960"></a><span class="lineno"> 3960</span>  <span class="comment">// vehicles.</span></div>
|
|
<div class="line"><a name="l03961"></a><span class="lineno"> 3961</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(empty_vehicle_type_curator_ != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l03962"></a><span class="lineno"> 3962</span>  empty_vehicle_type_curator_->Update(</div>
|
|
<div class="line"><a name="l03963"></a><span class="lineno"> 3963</span>  [<span class="keyword">this</span>](<span class="keywordtype">int</span> vehicle) { <span class="keywordflow">return</span> !<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(vehicle); });</div>
|
|
<div class="line"><a name="l03964"></a><span class="lineno"> 3964</span> }</div>
|
|
<div class="line"><a name="l03965"></a><span class="lineno"> 3965</span>  </div>
|
|
<div class="line"><a name="l03966"></a><span class="lineno"> 3966</span> <span class="keyword">template</span> <<span class="keyword">class</span> Queue></div>
|
|
<div class="line"><a name="l03967"></a><span class="lineno"> 3967</span> <span class="keywordtype">int</span> GlobalCheapestInsertionFilteredHeuristic::InsertSeedNode(</div>
|
|
<div class="line"><a name="l03968"></a><span class="lineno"> 3968</span>  std::vector<std::vector<StartEndValue>>* start_end_distances_per_node,</div>
|
|
<div class="line"><a name="l03969"></a><span class="lineno"> 3969</span>  Queue* priority_queue, std::vector<bool>* is_vehicle_used) {</div>
|
|
<div class="line"><a name="l03970"></a><span class="lineno"> 3970</span>  <span class="keywordflow">while</span> (!priority_queue->empty()) {</div>
|
|
<div class="line"><a name="l03971"></a><span class="lineno"> 3971</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l03972"></a><span class="lineno"> 3972</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#af10aed726a9b750452a6fdeae3f00feb">Seed</a>& seed = priority_queue->top();</div>
|
|
<div class="line"><a name="l03973"></a><span class="lineno"> 3973</span>  </div>
|
|
<div class="line"><a name="l03974"></a><span class="lineno"> 3974</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> seed_node = seed.second;</div>
|
|
<div class="line"><a name="l03975"></a><span class="lineno"> 3975</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> seed_vehicle = seed.first.vehicle;</div>
|
|
<div class="line"><a name="l03976"></a><span class="lineno"> 3976</span>  </div>
|
|
<div class="line"><a name="l03977"></a><span class="lineno"> 3977</span>  std::vector<StartEndValue>& other_start_end_values =</div>
|
|
<div class="line"><a name="l03978"></a><span class="lineno"> 3978</span>  (*start_end_distances_per_node)[seed_node];</div>
|
|
<div class="line"><a name="l03979"></a><span class="lineno"> 3979</span>  </div>
|
|
<div class="line"><a name="l03980"></a><span class="lineno"> 3980</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(seed_node)) {</div>
|
|
<div class="line"><a name="l03981"></a><span class="lineno"> 3981</span>  <span class="comment">// The node is already inserted, it is therefore no longer considered as</span></div>
|
|
<div class="line"><a name="l03982"></a><span class="lineno"> 3982</span>  <span class="comment">// a potential seed.</span></div>
|
|
<div class="line"><a name="l03983"></a><span class="lineno"> 3983</span>  priority_queue->pop();</div>
|
|
<div class="line"><a name="l03984"></a><span class="lineno"> 3984</span>  other_start_end_values.clear();</div>
|
|
<div class="line"><a name="l03985"></a><span class="lineno"> 3985</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l03986"></a><span class="lineno"> 3986</span>  }</div>
|
|
<div class="line"><a name="l03987"></a><span class="lineno"> 3987</span>  <span class="keywordflow">if</span> (!(*is_vehicle_used)[seed_vehicle]) {</div>
|
|
<div class="line"><a name="l03988"></a><span class="lineno"> 3988</span>  <span class="comment">// Try to insert this seed_node on this vehicle's route.</span></div>
|
|
<div class="line"><a name="l03989"></a><span class="lineno"> 3989</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_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(seed_vehicle);</div>
|
|
<div class="line"><a name="l03990"></a><span class="lineno"> 3990</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_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a1dc8d32892f78532c8ee7a7186158e07">End</a>(seed_vehicle);</div>
|
|
<div class="line"><a name="l03991"></a><span class="lineno"> 3991</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(start), end);</div>
|
|
<div class="line"><a name="l03992"></a><span class="lineno"> 3992</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a40574fa8ec102d52f650a616d7fe6c39">InsertBetween</a>(seed_node, start, end);</div>
|
|
<div class="line"><a name="l03993"></a><span class="lineno"> 3993</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>()) {</div>
|
|
<div class="line"><a name="l03994"></a><span class="lineno"> 3994</span>  priority_queue->pop();</div>
|
|
<div class="line"><a name="l03995"></a><span class="lineno"> 3995</span>  (*is_vehicle_used)[seed_vehicle] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l03996"></a><span class="lineno"> 3996</span>  other_start_end_values.clear();</div>
|
|
<div class="line"><a name="l03997"></a><span class="lineno"> 3997</span>  SetVehicleIndex(seed_node, seed_vehicle);</div>
|
|
<div class="line"><a name="l03998"></a><span class="lineno"> 3998</span>  <span class="keywordflow">return</span> seed_vehicle;</div>
|
|
<div class="line"><a name="l03999"></a><span class="lineno"> 3999</span>  }</div>
|
|
<div class="line"><a name="l04000"></a><span class="lineno"> 4000</span>  }</div>
|
|
<div class="line"><a name="l04001"></a><span class="lineno"> 4001</span>  <span class="comment">// Either the vehicle is already used, or the Commit() wasn't successful.</span></div>
|
|
<div class="line"><a name="l04002"></a><span class="lineno"> 4002</span>  <span class="comment">// In both cases, we remove this Seed from the priority queue, and insert</span></div>
|
|
<div class="line"><a name="l04003"></a><span class="lineno"> 4003</span>  <span class="comment">// the next StartEndValue from start_end_distances_per_node[seed_node]</span></div>
|
|
<div class="line"><a name="l04004"></a><span class="lineno"> 4004</span>  <span class="comment">// in the priority queue.</span></div>
|
|
<div class="line"><a name="l04005"></a><span class="lineno"> 4005</span>  priority_queue->pop();</div>
|
|
<div class="line"><a name="l04006"></a><span class="lineno"> 4006</span>  <span class="keywordflow">if</span> (!other_start_end_values.empty()) {</div>
|
|
<div class="line"><a name="l04007"></a><span class="lineno"> 4007</span>  <span class="keyword">const</span> StartEndValue& next_seed_value = other_start_end_values.back();</div>
|
|
<div class="line"><a name="l04008"></a><span class="lineno"> 4008</span>  priority_queue->push(std::make_pair(next_seed_value, seed_node));</div>
|
|
<div class="line"><a name="l04009"></a><span class="lineno"> 4009</span>  other_start_end_values.pop_back();</div>
|
|
<div class="line"><a name="l04010"></a><span class="lineno"> 4010</span>  }</div>
|
|
<div class="line"><a name="l04011"></a><span class="lineno"> 4011</span>  }</div>
|
|
<div class="line"><a name="l04012"></a><span class="lineno"> 4012</span>  <span class="comment">// No seed node was inserted.</span></div>
|
|
<div class="line"><a name="l04013"></a><span class="lineno"> 4013</span>  <span class="keywordflow">return</span> -1;</div>
|
|
<div class="line"><a name="l04014"></a><span class="lineno"> 4014</span> }</div>
|
|
<div class="line"><a name="l04015"></a><span class="lineno"> 4015</span>  </div>
|
|
<div class="line"><a name="l04016"></a><span class="lineno"> 4016</span> <span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::InitializePairPositions(</div>
|
|
<div class="line"><a name="l04017"></a><span class="lineno"> 4017</span>  <span class="keyword">const</span> std::vector<int>& pair_indices,</div>
|
|
<div class="line"><a name="l04018"></a><span class="lineno"> 4018</span>  <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a name="l04019"></a><span class="lineno"> 4019</span>  GlobalCheapestInsertionFilteredHeuristic::PairEntry>* priority_queue,</div>
|
|
<div class="line"><a name="l04020"></a><span class="lineno"> 4020</span>  std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a name="l04021"></a><span class="lineno"> 4021</span>  pickup_to_entries,</div>
|
|
<div class="line"><a name="l04022"></a><span class="lineno"> 4022</span>  std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a name="l04023"></a><span class="lineno"> 4023</span>  delivery_to_entries) {</div>
|
|
<div class="line"><a name="l04024"></a><span class="lineno"> 4024</span>  priority_queue->Clear();</div>
|
|
<div class="line"><a name="l04025"></a><span class="lineno"> 4025</span>  pickup_to_entries->clear();</div>
|
|
<div class="line"><a name="l04026"></a><span class="lineno"> 4026</span>  pickup_to_entries->resize(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>());</div>
|
|
<div class="line"><a name="l04027"></a><span class="lineno"> 4027</span>  delivery_to_entries->clear();</div>
|
|
<div class="line"><a name="l04028"></a><span class="lineno"> 4028</span>  delivery_to_entries->resize(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>());</div>
|
|
<div class="line"><a name="l04029"></a><span class="lineno"> 4029</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html#a76874cd778ea1b9220673e019f9e7abe">RoutingModel::IndexPairs</a>& pickup_delivery_pairs =</div>
|
|
<div class="line"><a name="l04030"></a><span class="lineno"> 4030</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a9e42e15bdb23d63ae78137b97a4882de">GetPickupAndDeliveryPairs</a>();</div>
|
|
<div class="line"><a name="l04031"></a><span class="lineno"> 4031</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> : pair_indices) {</div>
|
|
<div class="line"><a name="l04032"></a><span class="lineno"> 4032</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html#a1636c49d2587c3d9df16918345b82378">RoutingModel::IndexPair</a>& index_pair = pickup_delivery_pairs[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l04033"></a><span class="lineno"> 4033</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup : index_pair.first) {</div>
|
|
<div class="line"><a name="l04034"></a><span class="lineno"> 4034</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(pickup)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l04035"></a><span class="lineno"> 4035</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery : index_pair.second) {</div>
|
|
<div class="line"><a name="l04036"></a><span class="lineno"> 4036</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(delivery)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l04037"></a><span class="lineno"> 4037</span>  <span class="comment">// Add insertion entry making pair unperformed. When the pair is part</span></div>
|
|
<div class="line"><a name="l04038"></a><span class="lineno"> 4038</span>  <span class="comment">// of a disjunction we do not try to make any of its pairs unperformed</span></div>
|
|
<div class="line"><a name="l04039"></a><span class="lineno"> 4039</span>  <span class="comment">// as it requires having an entry with all pairs being unperformed.</span></div>
|
|
<div class="line"><a name="l04040"></a><span class="lineno"> 4040</span>  <span class="comment">// TODO(user): Adapt the code to make pair disjunctions unperformed.</span></div>
|
|
<div class="line"><a name="l04041"></a><span class="lineno"> 4041</span>  <span class="keywordflow">if</span> (gci_params_.<a class="code" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#ad962358b9cb4da242cdc3c98ee2ce6ce">add_unperformed_entries</a> &&</div>
|
|
<div class="line"><a name="l04042"></a><span class="lineno"> 4042</span>  index_pair.first.size() == 1 && index_pair.second.size() == 1 &&</div>
|
|
<div class="line"><a name="l04043"></a><span class="lineno"> 4043</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ab2b4f136e88ea9aad2921aefb2434bad">GetUnperformedValue</a>(pickup) != <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a> &&</div>
|
|
<div class="line"><a name="l04044"></a><span class="lineno"> 4044</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ab2b4f136e88ea9aad2921aefb2434bad">GetUnperformedValue</a>(delivery) != <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>) {</div>
|
|
<div class="line"><a name="l04045"></a><span class="lineno"> 4045</span>  AddPairEntry(pickup, -1, delivery, -1, -1, priority_queue, <span class="keyword">nullptr</span>,</div>
|
|
<div class="line"><a name="l04046"></a><span class="lineno"> 4046</span>  <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l04047"></a><span class="lineno"> 4047</span>  }</div>
|
|
<div class="line"><a name="l04048"></a><span class="lineno"> 4048</span>  <span class="comment">// Add all other insertion entries with pair performed.</span></div>
|
|
<div class="line"><a name="l04049"></a><span class="lineno"> 4049</span>  InitializeInsertionEntriesPerformingPair(</div>
|
|
<div class="line"><a name="l04050"></a><span class="lineno"> 4050</span>  pickup, delivery, priority_queue, pickup_to_entries,</div>
|
|
<div class="line"><a name="l04051"></a><span class="lineno"> 4051</span>  delivery_to_entries);</div>
|
|
<div class="line"><a name="l04052"></a><span class="lineno"> 4052</span>  }</div>
|
|
<div class="line"><a name="l04053"></a><span class="lineno"> 4053</span>  }</div>
|
|
<div class="line"><a name="l04054"></a><span class="lineno"> 4054</span>  }</div>
|
|
<div class="line"><a name="l04055"></a><span class="lineno"> 4055</span> }</div>
|
|
<div class="line"><a name="l04056"></a><span class="lineno"> 4056</span>  </div>
|
|
<div class="line"><a name="l04057"></a><span class="lineno"> 4057</span> <span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::</div>
|
|
<div class="line"><a name="l04058"></a><span class="lineno"> 4058</span>  InitializeInsertionEntriesPerformingPair(</div>
|
|
<div class="line"><a name="l04059"></a><span class="lineno"> 4059</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery,</div>
|
|
<div class="line"><a name="l04060"></a><span class="lineno"> 4060</span>  <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a name="l04061"></a><span class="lineno"> 4061</span>  GlobalCheapestInsertionFilteredHeuristic::PairEntry>*</div>
|
|
<div class="line"><a name="l04062"></a><span class="lineno"> 4062</span>  priority_queue,</div>
|
|
<div class="line"><a name="l04063"></a><span class="lineno"> 4063</span>  std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a name="l04064"></a><span class="lineno"> 4064</span>  pickup_to_entries,</div>
|
|
<div class="line"><a name="l04065"></a><span class="lineno"> 4065</span>  std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a name="l04066"></a><span class="lineno"> 4066</span>  delivery_to_entries) {</div>
|
|
<div class="line"><a name="l04067"></a><span class="lineno"> 4067</span>  <span class="keywordflow">if</span> (!gci_params_.<a class="code" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a7d91387b5081be8f22d053d93eb9edf4">use_neighbors_ratio_for_initialization</a>) {</div>
|
|
<div class="line"><a name="l04068"></a><span class="lineno"> 4068</span>  std::vector<std::pair<std::pair<int64, int>, std::pair<int64, int64>>></div>
|
|
<div class="line"><a name="l04069"></a><span class="lineno"> 4069</span>  valued_positions;</div>
|
|
<div class="line"><a name="l04070"></a><span class="lineno"> 4070</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); ++vehicle) {</div>
|
|
<div class="line"><a name="l04071"></a><span class="lineno"> 4071</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(vehicle) &&</div>
|
|
<div class="line"><a name="l04072"></a><span class="lineno"> 4072</span>  empty_vehicle_type_curator_->GetLowestFixedCostVehicleOfType(</div>
|
|
<div class="line"><a name="l04073"></a><span class="lineno"> 4073</span>  empty_vehicle_type_curator_->Type(vehicle)) != vehicle) {</div>
|
|
<div class="line"><a name="l04074"></a><span class="lineno"> 4074</span>  <span class="comment">// We only consider the least expensive empty vehicle of each type for</span></div>
|
|
<div class="line"><a name="l04075"></a><span class="lineno"> 4075</span>  <span class="comment">// entries.</span></div>
|
|
<div class="line"><a name="l04076"></a><span class="lineno"> 4076</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l04077"></a><span class="lineno"> 4077</span>  }</div>
|
|
<div class="line"><a name="l04078"></a><span class="lineno"> 4078</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_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(vehicle);</div>
|
|
<div class="line"><a name="l04079"></a><span class="lineno"> 4079</span>  std::vector<ValuedPosition> valued_pickup_positions;</div>
|
|
<div class="line"><a name="l04080"></a><span class="lineno"> 4080</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#aafc4ebf202cabd64f7854c274f425866">AppendEvaluatedPositionsAfter</a>(pickup, start, <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(start), vehicle,</div>
|
|
<div class="line"><a name="l04081"></a><span class="lineno"> 4081</span>  &valued_pickup_positions);</div>
|
|
<div class="line"><a name="l04082"></a><span class="lineno"> 4082</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#aa2099867a858f3da90d9e26a1dc88b4d">ValuedPosition</a>& valued_pickup_position :</div>
|
|
<div class="line"><a name="l04083"></a><span class="lineno"> 4083</span>  valued_pickup_positions) {</div>
|
|
<div class="line"><a name="l04084"></a><span class="lineno"> 4084</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup_position = valued_pickup_position.second;</div>
|
|
<div class="line"><a name="l04085"></a><span class="lineno"> 4085</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->IsEnd(pickup_position));</div>
|
|
<div class="line"><a name="l04086"></a><span class="lineno"> 4086</span>  std::vector<ValuedPosition> valued_delivery_positions;</div>
|
|
<div class="line"><a name="l04087"></a><span class="lineno"> 4087</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#aafc4ebf202cabd64f7854c274f425866">AppendEvaluatedPositionsAfter</a>(delivery, pickup, <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(pickup_position),</div>
|
|
<div class="line"><a name="l04088"></a><span class="lineno"> 4088</span>  vehicle, &valued_delivery_positions);</div>
|
|
<div class="line"><a name="l04089"></a><span class="lineno"> 4089</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#aa2099867a858f3da90d9e26a1dc88b4d">ValuedPosition</a>& valued_delivery_position :</div>
|
|
<div class="line"><a name="l04090"></a><span class="lineno"> 4090</span>  valued_delivery_positions) {</div>
|
|
<div class="line"><a name="l04091"></a><span class="lineno"> 4091</span>  valued_positions.push_back(std::make_pair(</div>
|
|
<div class="line"><a name="l04092"></a><span class="lineno"> 4092</span>  std::make_pair(<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(valued_pickup_position.first,</div>
|
|
<div class="line"><a name="l04093"></a><span class="lineno"> 4093</span>  valued_delivery_position.first),</div>
|
|
<div class="line"><a name="l04094"></a><span class="lineno"> 4094</span>  vehicle),</div>
|
|
<div class="line"><a name="l04095"></a><span class="lineno"> 4095</span>  std::make_pair(pickup_position,</div>
|
|
<div class="line"><a name="l04096"></a><span class="lineno"> 4096</span>  valued_delivery_position.second)));</div>
|
|
<div class="line"><a name="l04097"></a><span class="lineno"> 4097</span>  }</div>
|
|
<div class="line"><a name="l04098"></a><span class="lineno"> 4098</span>  }</div>
|
|
<div class="line"><a name="l04099"></a><span class="lineno"> 4099</span>  }</div>
|
|
<div class="line"><a name="l04100"></a><span class="lineno"> 4100</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& [cost_for_vehicle, pair_positions] : valued_positions) {</div>
|
|
<div class="line"><a name="l04101"></a><span class="lineno"> 4101</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(pair_positions.first, pair_positions.second);</div>
|
|
<div class="line"><a name="l04102"></a><span class="lineno"> 4102</span>  AddPairEntry(pickup, pair_positions.first, delivery,</div>
|
|
<div class="line"><a name="l04103"></a><span class="lineno"> 4103</span>  pair_positions.second, cost_for_vehicle.second,</div>
|
|
<div class="line"><a name="l04104"></a><span class="lineno"> 4104</span>  priority_queue, pickup_to_entries, delivery_to_entries);</div>
|
|
<div class="line"><a name="l04105"></a><span class="lineno"> 4105</span>  }</div>
|
|
<div class="line"><a name="l04106"></a><span class="lineno"> 4106</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l04107"></a><span class="lineno"> 4107</span>  }</div>
|
|
<div class="line"><a name="l04108"></a><span class="lineno"> 4108</span>  </div>
|
|
<div class="line"><a name="l04109"></a><span class="lineno"> 4109</span>  <span class="comment">// We're only considering the closest neighbors as insertion positions for</span></div>
|
|
<div class="line"><a name="l04110"></a><span class="lineno"> 4110</span>  <span class="comment">// the pickup/delivery pair.</span></div>
|
|
<div class="line"><a name="l04111"></a><span class="lineno"> 4111</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> cost_class = 0; cost_class < <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#ad3b144985c2b4b24cf39b839dbd9c16d">GetCostClassesCount</a>();</div>
|
|
<div class="line"><a name="l04112"></a><span class="lineno"> 4112</span>  cost_class++) {</div>
|
|
<div class="line"><a name="l04113"></a><span class="lineno"> 4113</span>  absl::flat_hash_set<std::pair<int64, int64>> existing_insertion_positions;</div>
|
|
<div class="line"><a name="l04114"></a><span class="lineno"> 4114</span>  <span class="comment">// Explore the neighborhood of the pickup.</span></div>
|
|
<div class="line"><a name="l04115"></a><span class="lineno"> 4115</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup_insert_after :</div>
|
|
<div class="line"><a name="l04116"></a><span class="lineno"> 4116</span>  GetNeighborsOfNodeForCostClass(cost_class, pickup)) {</div>
|
|
<div class="line"><a name="l04117"></a><span class="lineno"> 4117</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(pickup_insert_after)) {</div>
|
|
<div class="line"><a name="l04118"></a><span class="lineno"> 4118</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l04119"></a><span class="lineno"> 4119</span>  }</div>
|
|
<div class="line"><a name="l04120"></a><span class="lineno"> 4120</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = node_index_to_vehicle_[pickup_insert_after];</div>
|
|
<div class="line"><a name="l04121"></a><span class="lineno"> 4121</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a32bba655accbd7dc8e23d30bf679b880">GetCostClassIndexOfVehicle</a>(vehicle).value() != cost_class) {</div>
|
|
<div class="line"><a name="l04122"></a><span class="lineno"> 4122</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l04123"></a><span class="lineno"> 4123</span>  }</div>
|
|
<div class="line"><a name="l04124"></a><span class="lineno"> 4124</span>  </div>
|
|
<div class="line"><a name="l04125"></a><span class="lineno"> 4125</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(vehicle) &&</div>
|
|
<div class="line"><a name="l04126"></a><span class="lineno"> 4126</span>  empty_vehicle_type_curator_->GetLowestFixedCostVehicleOfType(</div>
|
|
<div class="line"><a name="l04127"></a><span class="lineno"> 4127</span>  empty_vehicle_type_curator_->Type(vehicle)) != vehicle) {</div>
|
|
<div class="line"><a name="l04128"></a><span class="lineno"> 4128</span>  <span class="comment">// We only consider the least expensive empty vehicle of each type for</span></div>
|
|
<div class="line"><a name="l04129"></a><span class="lineno"> 4129</span>  <span class="comment">// entries.</span></div>
|
|
<div class="line"><a name="l04130"></a><span class="lineno"> 4130</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l04131"></a><span class="lineno"> 4131</span>  }</div>
|
|
<div class="line"><a name="l04132"></a><span class="lineno"> 4132</span>  </div>
|
|
<div class="line"><a name="l04133"></a><span class="lineno"> 4133</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery_insert_after = pickup;</div>
|
|
<div class="line"><a name="l04134"></a><span class="lineno"> 4134</span>  <span class="keywordflow">while</span> (!<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#ae2530e17cabaf267e12929ca0ee1bee0">IsEnd</a>(delivery_insert_after)) {</div>
|
|
<div class="line"><a name="l04135"></a><span class="lineno"> 4135</span>  <span class="keyword">const</span> std::pair<int64, int64> insertion_position = {</div>
|
|
<div class="line"><a name="l04136"></a><span class="lineno"> 4136</span>  pickup_insert_after, delivery_insert_after};</div>
|
|
<div class="line"><a name="l04137"></a><span class="lineno"> 4137</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!<a class="code" href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a>(existing_insertion_positions,</div>
|
|
<div class="line"><a name="l04138"></a><span class="lineno"> 4138</span>  insertion_position));</div>
|
|
<div class="line"><a name="l04139"></a><span class="lineno"> 4139</span>  existing_insertion_positions.insert(insertion_position);</div>
|
|
<div class="line"><a name="l04140"></a><span class="lineno"> 4140</span>  </div>
|
|
<div class="line"><a name="l04141"></a><span class="lineno"> 4141</span>  AddPairEntry(pickup, pickup_insert_after, delivery,</div>
|
|
<div class="line"><a name="l04142"></a><span class="lineno"> 4142</span>  delivery_insert_after, vehicle, priority_queue,</div>
|
|
<div class="line"><a name="l04143"></a><span class="lineno"> 4143</span>  pickup_to_entries, delivery_to_entries);</div>
|
|
<div class="line"><a name="l04144"></a><span class="lineno"> 4144</span>  delivery_insert_after = (delivery_insert_after == pickup)</div>
|
|
<div class="line"><a name="l04145"></a><span class="lineno"> 4145</span>  ? <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(pickup_insert_after)</div>
|
|
<div class="line"><a name="l04146"></a><span class="lineno"> 4146</span>  : <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(delivery_insert_after);</div>
|
|
<div class="line"><a name="l04147"></a><span class="lineno"> 4147</span>  }</div>
|
|
<div class="line"><a name="l04148"></a><span class="lineno"> 4148</span>  }</div>
|
|
<div class="line"><a name="l04149"></a><span class="lineno"> 4149</span>  </div>
|
|
<div class="line"><a name="l04150"></a><span class="lineno"> 4150</span>  <span class="comment">// Explore the neighborhood of the delivery.</span></div>
|
|
<div class="line"><a name="l04151"></a><span class="lineno"> 4151</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery_insert_after :</div>
|
|
<div class="line"><a name="l04152"></a><span class="lineno"> 4152</span>  GetNeighborsOfNodeForCostClass(cost_class, delivery)) {</div>
|
|
<div class="line"><a name="l04153"></a><span class="lineno"> 4153</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(delivery_insert_after)) {</div>
|
|
<div class="line"><a name="l04154"></a><span class="lineno"> 4154</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l04155"></a><span class="lineno"> 4155</span>  }</div>
|
|
<div class="line"><a name="l04156"></a><span class="lineno"> 4156</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = node_index_to_vehicle_[delivery_insert_after];</div>
|
|
<div class="line"><a name="l04157"></a><span class="lineno"> 4157</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->GetCostClassIndexOfVehicle(vehicle).<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>() != cost_class) {</div>
|
|
<div class="line"><a name="l04158"></a><span class="lineno"> 4158</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l04159"></a><span class="lineno"> 4159</span>  }</div>
|
|
<div class="line"><a name="l04160"></a><span class="lineno"> 4160</span>  </div>
|
|
<div class="line"><a name="l04161"></a><span class="lineno"> 4161</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(vehicle)) {</div>
|
|
<div class="line"><a name="l04162"></a><span class="lineno"> 4162</span>  <span class="comment">// Vehicle is empty.</span></div>
|
|
<div class="line"><a name="l04163"></a><span class="lineno"> 4163</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(delivery_insert_after, <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->Start(vehicle));</div>
|
|
<div class="line"><a name="l04164"></a><span class="lineno"> 4164</span>  }</div>
|
|
<div class="line"><a name="l04165"></a><span class="lineno"> 4165</span>  </div>
|
|
<div class="line"><a name="l04166"></a><span class="lineno"> 4166</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup_insert_after = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(vehicle);</div>
|
|
<div class="line"><a name="l04167"></a><span class="lineno"> 4167</span>  <span class="keywordflow">while</span> (pickup_insert_after != delivery_insert_after) {</div>
|
|
<div class="line"><a name="l04168"></a><span class="lineno"> 4168</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a>(</div>
|
|
<div class="line"><a name="l04169"></a><span class="lineno"> 4169</span>  existing_insertion_positions,</div>
|
|
<div class="line"><a name="l04170"></a><span class="lineno"> 4170</span>  std::make_pair(pickup_insert_after, delivery_insert_after))) {</div>
|
|
<div class="line"><a name="l04171"></a><span class="lineno"> 4171</span>  AddPairEntry(pickup, pickup_insert_after, delivery,</div>
|
|
<div class="line"><a name="l04172"></a><span class="lineno"> 4172</span>  delivery_insert_after, vehicle, priority_queue,</div>
|
|
<div class="line"><a name="l04173"></a><span class="lineno"> 4173</span>  pickup_to_entries, delivery_to_entries);</div>
|
|
<div class="line"><a name="l04174"></a><span class="lineno"> 4174</span>  }</div>
|
|
<div class="line"><a name="l04175"></a><span class="lineno"> 4175</span>  pickup_insert_after = <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(pickup_insert_after);</div>
|
|
<div class="line"><a name="l04176"></a><span class="lineno"> 4176</span>  }</div>
|
|
<div class="line"><a name="l04177"></a><span class="lineno"> 4177</span>  }</div>
|
|
<div class="line"><a name="l04178"></a><span class="lineno"> 4178</span>  }</div>
|
|
<div class="line"><a name="l04179"></a><span class="lineno"> 4179</span> }</div>
|
|
<div class="line"><a name="l04180"></a><span class="lineno"> 4180</span>  </div>
|
|
<div class="line"><a name="l04181"></a><span class="lineno"> 4181</span> <span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::UpdateAfterPairInsertion(</div>
|
|
<div class="line"><a name="l04182"></a><span class="lineno"> 4182</span>  <span class="keyword">const</span> std::vector<int>& pair_indices, <span class="keywordtype">int</span> vehicle, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup,</div>
|
|
<div class="line"><a name="l04183"></a><span class="lineno"> 4183</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup_position, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery_position,</div>
|
|
<div class="line"><a name="l04184"></a><span class="lineno"> 4184</span>  <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<PairEntry></a>* priority_queue,</div>
|
|
<div class="line"><a name="l04185"></a><span class="lineno"> 4185</span>  std::vector<PairEntries>* pickup_to_entries,</div>
|
|
<div class="line"><a name="l04186"></a><span class="lineno"> 4186</span>  std::vector<PairEntries>* delivery_to_entries) {</div>
|
|
<div class="line"><a name="l04187"></a><span class="lineno"> 4187</span>  UpdatePairPositions(pair_indices, vehicle, pickup_position, priority_queue,</div>
|
|
<div class="line"><a name="l04188"></a><span class="lineno"> 4188</span>  pickup_to_entries, delivery_to_entries);</div>
|
|
<div class="line"><a name="l04189"></a><span class="lineno"> 4189</span>  UpdatePairPositions(pair_indices, vehicle, pickup, priority_queue,</div>
|
|
<div class="line"><a name="l04190"></a><span class="lineno"> 4190</span>  pickup_to_entries, delivery_to_entries);</div>
|
|
<div class="line"><a name="l04191"></a><span class="lineno"> 4191</span>  UpdatePairPositions(pair_indices, vehicle, delivery, priority_queue,</div>
|
|
<div class="line"><a name="l04192"></a><span class="lineno"> 4192</span>  pickup_to_entries, delivery_to_entries);</div>
|
|
<div class="line"><a name="l04193"></a><span class="lineno"> 4193</span>  <span class="keywordflow">if</span> (delivery_position != pickup) {</div>
|
|
<div class="line"><a name="l04194"></a><span class="lineno"> 4194</span>  UpdatePairPositions(pair_indices, vehicle, delivery_position,</div>
|
|
<div class="line"><a name="l04195"></a><span class="lineno"> 4195</span>  priority_queue, pickup_to_entries, delivery_to_entries);</div>
|
|
<div class="line"><a name="l04196"></a><span class="lineno"> 4196</span>  }</div>
|
|
<div class="line"><a name="l04197"></a><span class="lineno"> 4197</span>  SetVehicleIndex(pickup, vehicle);</div>
|
|
<div class="line"><a name="l04198"></a><span class="lineno"> 4198</span>  SetVehicleIndex(delivery, vehicle);</div>
|
|
<div class="line"><a name="l04199"></a><span class="lineno"> 4199</span> }</div>
|
|
<div class="line"><a name="l04200"></a><span class="lineno"> 4200</span>  </div>
|
|
<div class="line"><a name="l04201"></a><span class="lineno"> 4201</span> <span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::UpdatePickupPositions(</div>
|
|
<div class="line"><a name="l04202"></a><span class="lineno"> 4202</span>  <span class="keyword">const</span> std::vector<int>& pair_indices, <span class="keywordtype">int</span> vehicle,</div>
|
|
<div class="line"><a name="l04203"></a><span class="lineno"> 4203</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup_insert_after,</div>
|
|
<div class="line"><a name="l04204"></a><span class="lineno"> 4204</span>  <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a name="l04205"></a><span class="lineno"> 4205</span>  GlobalCheapestInsertionFilteredHeuristic::PairEntry>* priority_queue,</div>
|
|
<div class="line"><a name="l04206"></a><span class="lineno"> 4206</span>  std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a name="l04207"></a><span class="lineno"> 4207</span>  pickup_to_entries,</div>
|
|
<div class="line"><a name="l04208"></a><span class="lineno"> 4208</span>  std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a name="l04209"></a><span class="lineno"> 4209</span>  delivery_to_entries) {</div>
|
|
<div class="line"><a name="l04210"></a><span class="lineno"> 4210</span>  <span class="comment">// First, remove entries which have already been inserted and keep track of</span></div>
|
|
<div class="line"><a name="l04211"></a><span class="lineno"> 4211</span>  <span class="comment">// the entries which are being kept and must be updated.</span></div>
|
|
<div class="line"><a name="l04212"></a><span class="lineno"> 4212</span>  <span class="keyword">using</span> Pair = std::pair<int64, int64>;</div>
|
|
<div class="line"><a name="l04213"></a><span class="lineno"> 4213</span>  <span class="keyword">using</span> Insertion = std::pair<Pair, <span class="comment">/*delivery_insert_after*/</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>>;</div>
|
|
<div class="line"><a name="l04214"></a><span class="lineno"> 4214</span>  absl::flat_hash_set<Insertion> existing_insertions;</div>
|
|
<div class="line"><a name="l04215"></a><span class="lineno"> 4215</span>  std::vector<PairEntry*> to_remove;</div>
|
|
<div class="line"><a name="l04216"></a><span class="lineno"> 4216</span>  <span class="keywordflow">for</span> (PairEntry* <span class="keyword">const</span> pair_entry :</div>
|
|
<div class="line"><a name="l04217"></a><span class="lineno"> 4217</span>  pickup_to_entries->at(pickup_insert_after)) {</div>
|
|
<div class="line"><a name="l04218"></a><span class="lineno"> 4218</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(priority_queue-><a class="code" href="class_adjustable_priority_queue.html#a7d1005d75f40525f91a2acb84348bc3c">Contains</a>(pair_entry));</div>
|
|
<div class="line"><a name="l04219"></a><span class="lineno"> 4219</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(pair_entry->pickup_insert_after(), pickup_insert_after);</div>
|
|
<div class="line"><a name="l04220"></a><span class="lineno"> 4220</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(pair_entry->pickup_to_insert()) ||</div>
|
|
<div class="line"><a name="l04221"></a><span class="lineno"> 4221</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(pair_entry->delivery_to_insert())) {</div>
|
|
<div class="line"><a name="l04222"></a><span class="lineno"> 4222</span>  to_remove.push_back(pair_entry);</div>
|
|
<div class="line"><a name="l04223"></a><span class="lineno"> 4223</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l04224"></a><span class="lineno"> 4224</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(delivery_to_entries->at(pair_entry->delivery_insert_after())</div>
|
|
<div class="line"><a name="l04225"></a><span class="lineno"> 4225</span>  .contains(pair_entry));</div>
|
|
<div class="line"><a name="l04226"></a><span class="lineno"> 4226</span>  UpdatePairEntry(pair_entry, priority_queue);</div>
|
|
<div class="line"><a name="l04227"></a><span class="lineno"> 4227</span>  existing_insertions.insert(</div>
|
|
<div class="line"><a name="l04228"></a><span class="lineno"> 4228</span>  {{pair_entry->pickup_to_insert(), pair_entry->delivery_to_insert()},</div>
|
|
<div class="line"><a name="l04229"></a><span class="lineno"> 4229</span>  pair_entry->delivery_insert_after()});</div>
|
|
<div class="line"><a name="l04230"></a><span class="lineno"> 4230</span>  }</div>
|
|
<div class="line"><a name="l04231"></a><span class="lineno"> 4231</span>  }</div>
|
|
<div class="line"><a name="l04232"></a><span class="lineno"> 4232</span>  <span class="keywordflow">for</span> (PairEntry* <span class="keyword">const</span> pair_entry : to_remove) {</div>
|
|
<div class="line"><a name="l04233"></a><span class="lineno"> 4233</span>  DeletePairEntry(pair_entry, priority_queue, pickup_to_entries,</div>
|
|
<div class="line"><a name="l04234"></a><span class="lineno"> 4234</span>  delivery_to_entries);</div>
|
|
<div class="line"><a name="l04235"></a><span class="lineno"> 4235</span>  }</div>
|
|
<div class="line"><a name="l04236"></a><span class="lineno"> 4236</span>  <span class="comment">// Create new entries for which the pickup is to be inserted after</span></div>
|
|
<div class="line"><a name="l04237"></a><span class="lineno"> 4237</span>  <span class="comment">// pickup_insert_after.</span></div>
|
|
<div class="line"><a name="l04238"></a><span class="lineno"> 4238</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> cost_class = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a32bba655accbd7dc8e23d30bf679b880">GetCostClassIndexOfVehicle</a>(vehicle).value();</div>
|
|
<div class="line"><a name="l04239"></a><span class="lineno"> 4239</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup_insert_before = <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(pickup_insert_after);</div>
|
|
<div class="line"><a name="l04240"></a><span class="lineno"> 4240</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html#a76874cd778ea1b9220673e019f9e7abe">RoutingModel::IndexPairs</a>& pickup_delivery_pairs =</div>
|
|
<div class="line"><a name="l04241"></a><span class="lineno"> 4241</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a9e42e15bdb23d63ae78137b97a4882de">GetPickupAndDeliveryPairs</a>();</div>
|
|
<div class="line"><a name="l04242"></a><span class="lineno"> 4242</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pair_index : pair_indices) {</div>
|
|
<div class="line"><a name="l04243"></a><span class="lineno"> 4243</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html#a1636c49d2587c3d9df16918345b82378">RoutingModel::IndexPair</a>& index_pair =</div>
|
|
<div class="line"><a name="l04244"></a><span class="lineno"> 4244</span>  pickup_delivery_pairs[pair_index];</div>
|
|
<div class="line"><a name="l04245"></a><span class="lineno"> 4245</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup : index_pair.first) {</div>
|
|
<div class="line"><a name="l04246"></a><span class="lineno"> 4246</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(pickup) ||</div>
|
|
<div class="line"><a name="l04247"></a><span class="lineno"> 4247</span>  !IsNeighborForCostClass(cost_class, pickup_insert_after, pickup)) {</div>
|
|
<div class="line"><a name="l04248"></a><span class="lineno"> 4248</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l04249"></a><span class="lineno"> 4249</span>  }</div>
|
|
<div class="line"><a name="l04250"></a><span class="lineno"> 4250</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery : index_pair.second) {</div>
|
|
<div class="line"><a name="l04251"></a><span class="lineno"> 4251</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(delivery)) {</div>
|
|
<div class="line"><a name="l04252"></a><span class="lineno"> 4252</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l04253"></a><span class="lineno"> 4253</span>  }</div>
|
|
<div class="line"><a name="l04254"></a><span class="lineno"> 4254</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery_insert_after = pickup;</div>
|
|
<div class="line"><a name="l04255"></a><span class="lineno"> 4255</span>  <span class="keywordflow">while</span> (!<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->IsEnd(delivery_insert_after)) {</div>
|
|
<div class="line"><a name="l04256"></a><span class="lineno"> 4256</span>  <span class="keyword">const</span> Insertion insertion = {{pickup, delivery},</div>
|
|
<div class="line"><a name="l04257"></a><span class="lineno"> 4257</span>  delivery_insert_after};</div>
|
|
<div class="line"><a name="l04258"></a><span class="lineno"> 4258</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a>(existing_insertions, insertion)) {</div>
|
|
<div class="line"><a name="l04259"></a><span class="lineno"> 4259</span>  AddPairEntry(pickup, pickup_insert_after, delivery,</div>
|
|
<div class="line"><a name="l04260"></a><span class="lineno"> 4260</span>  delivery_insert_after, vehicle, priority_queue,</div>
|
|
<div class="line"><a name="l04261"></a><span class="lineno"> 4261</span>  pickup_to_entries, delivery_to_entries);</div>
|
|
<div class="line"><a name="l04262"></a><span class="lineno"> 4262</span>  }</div>
|
|
<div class="line"><a name="l04263"></a><span class="lineno"> 4263</span>  <span class="keywordflow">if</span> (delivery_insert_after == pickup) {</div>
|
|
<div class="line"><a name="l04264"></a><span class="lineno"> 4264</span>  delivery_insert_after = pickup_insert_before;</div>
|
|
<div class="line"><a name="l04265"></a><span class="lineno"> 4265</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l04266"></a><span class="lineno"> 4266</span>  delivery_insert_after = <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(delivery_insert_after);</div>
|
|
<div class="line"><a name="l04267"></a><span class="lineno"> 4267</span>  }</div>
|
|
<div class="line"><a name="l04268"></a><span class="lineno"> 4268</span>  }</div>
|
|
<div class="line"><a name="l04269"></a><span class="lineno"> 4269</span>  }</div>
|
|
<div class="line"><a name="l04270"></a><span class="lineno"> 4270</span>  }</div>
|
|
<div class="line"><a name="l04271"></a><span class="lineno"> 4271</span>  }</div>
|
|
<div class="line"><a name="l04272"></a><span class="lineno"> 4272</span> }</div>
|
|
<div class="line"><a name="l04273"></a><span class="lineno"> 4273</span>  </div>
|
|
<div class="line"><a name="l04274"></a><span class="lineno"> 4274</span> <span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::UpdateDeliveryPositions(</div>
|
|
<div class="line"><a name="l04275"></a><span class="lineno"> 4275</span>  <span class="keyword">const</span> std::vector<int>& pair_indices, <span class="keywordtype">int</span> vehicle,</div>
|
|
<div class="line"><a name="l04276"></a><span class="lineno"> 4276</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery_insert_after,</div>
|
|
<div class="line"><a name="l04277"></a><span class="lineno"> 4277</span>  <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a name="l04278"></a><span class="lineno"> 4278</span>  GlobalCheapestInsertionFilteredHeuristic::PairEntry>* priority_queue,</div>
|
|
<div class="line"><a name="l04279"></a><span class="lineno"> 4279</span>  std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a name="l04280"></a><span class="lineno"> 4280</span>  pickup_to_entries,</div>
|
|
<div class="line"><a name="l04281"></a><span class="lineno"> 4281</span>  std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a name="l04282"></a><span class="lineno"> 4282</span>  delivery_to_entries) {</div>
|
|
<div class="line"><a name="l04283"></a><span class="lineno"> 4283</span>  <span class="comment">// First, remove entries which have already been inserted and keep track of</span></div>
|
|
<div class="line"><a name="l04284"></a><span class="lineno"> 4284</span>  <span class="comment">// the entries which are being kept and must be updated.</span></div>
|
|
<div class="line"><a name="l04285"></a><span class="lineno"> 4285</span>  <span class="keyword">using</span> Pair = std::pair<int64, int64>;</div>
|
|
<div class="line"><a name="l04286"></a><span class="lineno"> 4286</span>  <span class="keyword">using</span> Insertion = std::pair<Pair, <span class="comment">/*pickup_insert_after*/</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>>;</div>
|
|
<div class="line"><a name="l04287"></a><span class="lineno"> 4287</span>  absl::flat_hash_set<Insertion> existing_insertions;</div>
|
|
<div class="line"><a name="l04288"></a><span class="lineno"> 4288</span>  std::vector<PairEntry*> to_remove;</div>
|
|
<div class="line"><a name="l04289"></a><span class="lineno"> 4289</span>  <span class="keywordflow">for</span> (PairEntry* <span class="keyword">const</span> pair_entry :</div>
|
|
<div class="line"><a name="l04290"></a><span class="lineno"> 4290</span>  delivery_to_entries->at(delivery_insert_after)) {</div>
|
|
<div class="line"><a name="l04291"></a><span class="lineno"> 4291</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(priority_queue-><a class="code" href="class_adjustable_priority_queue.html#a7d1005d75f40525f91a2acb84348bc3c">Contains</a>(pair_entry));</div>
|
|
<div class="line"><a name="l04292"></a><span class="lineno"> 4292</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(pair_entry->delivery_insert_after(), delivery_insert_after);</div>
|
|
<div class="line"><a name="l04293"></a><span class="lineno"> 4293</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(pair_entry->pickup_to_insert()) ||</div>
|
|
<div class="line"><a name="l04294"></a><span class="lineno"> 4294</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(pair_entry->delivery_to_insert())) {</div>
|
|
<div class="line"><a name="l04295"></a><span class="lineno"> 4295</span>  to_remove.push_back(pair_entry);</div>
|
|
<div class="line"><a name="l04296"></a><span class="lineno"> 4296</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l04297"></a><span class="lineno"> 4297</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(pickup_to_entries->at(pair_entry->pickup_insert_after())</div>
|
|
<div class="line"><a name="l04298"></a><span class="lineno"> 4298</span>  .contains(pair_entry));</div>
|
|
<div class="line"><a name="l04299"></a><span class="lineno"> 4299</span>  existing_insertions.insert(</div>
|
|
<div class="line"><a name="l04300"></a><span class="lineno"> 4300</span>  {{pair_entry->pickup_to_insert(), pair_entry->delivery_to_insert()},</div>
|
|
<div class="line"><a name="l04301"></a><span class="lineno"> 4301</span>  pair_entry->pickup_insert_after()});</div>
|
|
<div class="line"><a name="l04302"></a><span class="lineno"> 4302</span>  UpdatePairEntry(pair_entry, priority_queue);</div>
|
|
<div class="line"><a name="l04303"></a><span class="lineno"> 4303</span>  }</div>
|
|
<div class="line"><a name="l04304"></a><span class="lineno"> 4304</span>  }</div>
|
|
<div class="line"><a name="l04305"></a><span class="lineno"> 4305</span>  <span class="keywordflow">for</span> (PairEntry* <span class="keyword">const</span> pair_entry : to_remove) {</div>
|
|
<div class="line"><a name="l04306"></a><span class="lineno"> 4306</span>  DeletePairEntry(pair_entry, priority_queue, pickup_to_entries,</div>
|
|
<div class="line"><a name="l04307"></a><span class="lineno"> 4307</span>  delivery_to_entries);</div>
|
|
<div class="line"><a name="l04308"></a><span class="lineno"> 4308</span>  }</div>
|
|
<div class="line"><a name="l04309"></a><span class="lineno"> 4309</span>  <span class="comment">// Create new entries for which the delivery is to be inserted after</span></div>
|
|
<div class="line"><a name="l04310"></a><span class="lineno"> 4310</span>  <span class="comment">// delivery_insert_after.</span></div>
|
|
<div class="line"><a name="l04311"></a><span class="lineno"> 4311</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> cost_class = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a32bba655accbd7dc8e23d30bf679b880">GetCostClassIndexOfVehicle</a>(vehicle).value();</div>
|
|
<div class="line"><a name="l04312"></a><span class="lineno"> 4312</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html#a76874cd778ea1b9220673e019f9e7abe">RoutingModel::IndexPairs</a>& pickup_delivery_pairs =</div>
|
|
<div class="line"><a name="l04313"></a><span class="lineno"> 4313</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a9e42e15bdb23d63ae78137b97a4882de">GetPickupAndDeliveryPairs</a>();</div>
|
|
<div class="line"><a name="l04314"></a><span class="lineno"> 4314</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pair_index : pair_indices) {</div>
|
|
<div class="line"><a name="l04315"></a><span class="lineno"> 4315</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html#a1636c49d2587c3d9df16918345b82378">RoutingModel::IndexPair</a>& index_pair =</div>
|
|
<div class="line"><a name="l04316"></a><span class="lineno"> 4316</span>  pickup_delivery_pairs[pair_index];</div>
|
|
<div class="line"><a name="l04317"></a><span class="lineno"> 4317</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery : index_pair.second) {</div>
|
|
<div class="line"><a name="l04318"></a><span class="lineno"> 4318</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(delivery) ||</div>
|
|
<div class="line"><a name="l04319"></a><span class="lineno"> 4319</span>  !IsNeighborForCostClass(cost_class, delivery_insert_after,</div>
|
|
<div class="line"><a name="l04320"></a><span class="lineno"> 4320</span>  delivery)) {</div>
|
|
<div class="line"><a name="l04321"></a><span class="lineno"> 4321</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l04322"></a><span class="lineno"> 4322</span>  }</div>
|
|
<div class="line"><a name="l04323"></a><span class="lineno"> 4323</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup : index_pair.first) {</div>
|
|
<div class="line"><a name="l04324"></a><span class="lineno"> 4324</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(pickup)) {</div>
|
|
<div class="line"><a name="l04325"></a><span class="lineno"> 4325</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l04326"></a><span class="lineno"> 4326</span>  }</div>
|
|
<div class="line"><a name="l04327"></a><span class="lineno"> 4327</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup_insert_after = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(vehicle);</div>
|
|
<div class="line"><a name="l04328"></a><span class="lineno"> 4328</span>  <span class="keywordflow">while</span> (pickup_insert_after != delivery_insert_after) {</div>
|
|
<div class="line"><a name="l04329"></a><span class="lineno"> 4329</span>  <span class="keyword">const</span> Insertion insertion = {{pickup, delivery}, pickup_insert_after};</div>
|
|
<div class="line"><a name="l04330"></a><span class="lineno"> 4330</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a>(existing_insertions, insertion)) {</div>
|
|
<div class="line"><a name="l04331"></a><span class="lineno"> 4331</span>  AddPairEntry(pickup, pickup_insert_after, delivery,</div>
|
|
<div class="line"><a name="l04332"></a><span class="lineno"> 4332</span>  delivery_insert_after, vehicle, priority_queue,</div>
|
|
<div class="line"><a name="l04333"></a><span class="lineno"> 4333</span>  pickup_to_entries, delivery_to_entries);</div>
|
|
<div class="line"><a name="l04334"></a><span class="lineno"> 4334</span>  }</div>
|
|
<div class="line"><a name="l04335"></a><span class="lineno"> 4335</span>  pickup_insert_after = <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(pickup_insert_after);</div>
|
|
<div class="line"><a name="l04336"></a><span class="lineno"> 4336</span>  }</div>
|
|
<div class="line"><a name="l04337"></a><span class="lineno"> 4337</span>  }</div>
|
|
<div class="line"><a name="l04338"></a><span class="lineno"> 4338</span>  }</div>
|
|
<div class="line"><a name="l04339"></a><span class="lineno"> 4339</span>  }</div>
|
|
<div class="line"><a name="l04340"></a><span class="lineno"> 4340</span> }</div>
|
|
<div class="line"><a name="l04341"></a><span class="lineno"> 4341</span>  </div>
|
|
<div class="line"><a name="l04342"></a><span class="lineno"> 4342</span> <span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::DeletePairEntry(</div>
|
|
<div class="line"><a name="l04343"></a><span class="lineno"> 4343</span>  GlobalCheapestInsertionFilteredHeuristic::PairEntry* entry,</div>
|
|
<div class="line"><a name="l04344"></a><span class="lineno"> 4344</span>  <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a name="l04345"></a><span class="lineno"> 4345</span>  GlobalCheapestInsertionFilteredHeuristic::PairEntry>* priority_queue,</div>
|
|
<div class="line"><a name="l04346"></a><span class="lineno"> 4346</span>  std::vector<PairEntries>* pickup_to_entries,</div>
|
|
<div class="line"><a name="l04347"></a><span class="lineno"> 4347</span>  std::vector<PairEntries>* delivery_to_entries) {</div>
|
|
<div class="line"><a name="l04348"></a><span class="lineno"> 4348</span>  priority_queue-><a class="code" href="class_adjustable_priority_queue.html#a36647f60b5f27624275724445403ea1d">Remove</a>(entry);</div>
|
|
<div class="line"><a name="l04349"></a><span class="lineno"> 4349</span>  <span class="keywordflow">if</span> (entry->pickup_insert_after() != -1) {</div>
|
|
<div class="line"><a name="l04350"></a><span class="lineno"> 4350</span>  pickup_to_entries->at(entry->pickup_insert_after()).erase(entry);</div>
|
|
<div class="line"><a name="l04351"></a><span class="lineno"> 4351</span>  }</div>
|
|
<div class="line"><a name="l04352"></a><span class="lineno"> 4352</span>  <span class="keywordflow">if</span> (entry->delivery_insert_after() != -1) {</div>
|
|
<div class="line"><a name="l04353"></a><span class="lineno"> 4353</span>  delivery_to_entries->at(entry->delivery_insert_after()).erase(entry);</div>
|
|
<div class="line"><a name="l04354"></a><span class="lineno"> 4354</span>  }</div>
|
|
<div class="line"><a name="l04355"></a><span class="lineno"> 4355</span>  <span class="keyword">delete</span> entry;</div>
|
|
<div class="line"><a name="l04356"></a><span class="lineno"> 4356</span> }</div>
|
|
<div class="line"><a name="l04357"></a><span class="lineno"> 4357</span>  </div>
|
|
<div class="line"><a name="l04358"></a><span class="lineno"> 4358</span> <span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::AddPairEntry(</div>
|
|
<div class="line"><a name="l04359"></a><span class="lineno"> 4359</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup_insert_after, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery,</div>
|
|
<div class="line"><a name="l04360"></a><span class="lineno"> 4360</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery_insert_after, <span class="keywordtype">int</span> vehicle,</div>
|
|
<div class="line"><a name="l04361"></a><span class="lineno"> 4361</span>  <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a name="l04362"></a><span class="lineno"> 4362</span>  GlobalCheapestInsertionFilteredHeuristic::PairEntry>* priority_queue,</div>
|
|
<div class="line"><a name="l04363"></a><span class="lineno"> 4363</span>  std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a name="l04364"></a><span class="lineno"> 4364</span>  pickup_entries,</div>
|
|
<div class="line"><a name="l04365"></a><span class="lineno"> 4365</span>  std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a name="l04366"></a><span class="lineno"> 4366</span>  delivery_entries)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l04367"></a><span class="lineno"> 4367</span>  <span class="keywordflow">if</span> (pickup_insert_after == -1) {</div>
|
|
<div class="line"><a name="l04368"></a><span class="lineno"> 4368</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(delivery_insert_after, -1);</div>
|
|
<div class="line"><a name="l04369"></a><span class="lineno"> 4369</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(vehicle, -1);</div>
|
|
<div class="line"><a name="l04370"></a><span class="lineno"> 4370</span>  PairEntry* pair_entry = <span class="keyword">new</span> PairEntry(pickup, -1, delivery, -1, -1);</div>
|
|
<div class="line"><a name="l04371"></a><span class="lineno"> 4371</span>  pair_entry->set_value(</div>
|
|
<div class="line"><a name="l04372"></a><span class="lineno"> 4372</span>  absl::GetFlag(FLAGS_routing_shift_insertion_cost_by_penalty)</div>
|
|
<div class="line"><a name="l04373"></a><span class="lineno"> 4373</span>  ? 0</div>
|
|
<div class="line"><a name="l04374"></a><span class="lineno"> 4374</span>  : <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ab2b4f136e88ea9aad2921aefb2434bad">GetUnperformedValue</a>(pickup),</div>
|
|
<div class="line"><a name="l04375"></a><span class="lineno"> 4375</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ab2b4f136e88ea9aad2921aefb2434bad">GetUnperformedValue</a>(delivery)));</div>
|
|
<div class="line"><a name="l04376"></a><span class="lineno"> 4376</span>  priority_queue-><a class="code" href="class_adjustable_priority_queue.html#ac312fa979ea8afd5deabd6b581b3bb1f">Add</a>(pair_entry);</div>
|
|
<div class="line"><a name="l04377"></a><span class="lineno"> 4377</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l04378"></a><span class="lineno"> 4378</span>  }</div>
|
|
<div class="line"><a name="l04379"></a><span class="lineno"> 4379</span>  </div>
|
|
<div class="line"><a name="l04380"></a><span class="lineno"> 4380</span>  PairEntry* <span class="keyword">const</span> pair_entry = <span class="keyword">new</span> PairEntry(</div>
|
|
<div class="line"><a name="l04381"></a><span class="lineno"> 4381</span>  pickup, pickup_insert_after, delivery, delivery_insert_after, vehicle);</div>
|
|
<div class="line"><a name="l04382"></a><span class="lineno"> 4382</span>  pair_entry->set_value(GetInsertionValueForPairAtPositions(</div>
|
|
<div class="line"><a name="l04383"></a><span class="lineno"> 4383</span>  pickup, pickup_insert_after, delivery, delivery_insert_after, vehicle));</div>
|
|
<div class="line"><a name="l04384"></a><span class="lineno"> 4384</span>  </div>
|
|
<div class="line"><a name="l04385"></a><span class="lineno"> 4385</span>  <span class="comment">// Add entry to priority_queue and pickup_/delivery_entries.</span></div>
|
|
<div class="line"><a name="l04386"></a><span class="lineno"> 4386</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!priority_queue-><a class="code" href="class_adjustable_priority_queue.html#a7d1005d75f40525f91a2acb84348bc3c">Contains</a>(pair_entry));</div>
|
|
<div class="line"><a name="l04387"></a><span class="lineno"> 4387</span>  pickup_entries->at(pickup_insert_after).insert(pair_entry);</div>
|
|
<div class="line"><a name="l04388"></a><span class="lineno"> 4388</span>  delivery_entries->at(delivery_insert_after).insert(pair_entry);</div>
|
|
<div class="line"><a name="l04389"></a><span class="lineno"> 4389</span>  priority_queue-><a class="code" href="class_adjustable_priority_queue.html#ac312fa979ea8afd5deabd6b581b3bb1f">Add</a>(pair_entry);</div>
|
|
<div class="line"><a name="l04390"></a><span class="lineno"> 4390</span> }</div>
|
|
<div class="line"><a name="l04391"></a><span class="lineno"> 4391</span>  </div>
|
|
<div class="line"><a name="l04392"></a><span class="lineno"> 4392</span> <span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::UpdatePairEntry(</div>
|
|
<div class="line"><a name="l04393"></a><span class="lineno"> 4393</span>  GlobalCheapestInsertionFilteredHeuristic::PairEntry* <span class="keyword">const</span> pair_entry,</div>
|
|
<div class="line"><a name="l04394"></a><span class="lineno"> 4394</span>  <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a name="l04395"></a><span class="lineno"> 4395</span>  GlobalCheapestInsertionFilteredHeuristic::PairEntry>* priority_queue)<span class="keyword"></span></div>
|
|
<div class="line"><a name="l04396"></a><span class="lineno"> 4396</span> <span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l04397"></a><span class="lineno"> 4397</span>  pair_entry->set_value(GetInsertionValueForPairAtPositions(</div>
|
|
<div class="line"><a name="l04398"></a><span class="lineno"> 4398</span>  pair_entry->pickup_to_insert(), pair_entry->pickup_insert_after(),</div>
|
|
<div class="line"><a name="l04399"></a><span class="lineno"> 4399</span>  pair_entry->delivery_to_insert(), pair_entry->delivery_insert_after(),</div>
|
|
<div class="line"><a name="l04400"></a><span class="lineno"> 4400</span>  pair_entry->vehicle()));</div>
|
|
<div class="line"><a name="l04401"></a><span class="lineno"> 4401</span>  </div>
|
|
<div class="line"><a name="l04402"></a><span class="lineno"> 4402</span>  <span class="comment">// Update the priority_queue.</span></div>
|
|
<div class="line"><a name="l04403"></a><span class="lineno"> 4403</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(priority_queue-><a class="code" href="class_adjustable_priority_queue.html#a7d1005d75f40525f91a2acb84348bc3c">Contains</a>(pair_entry));</div>
|
|
<div class="line"><a name="l04404"></a><span class="lineno"> 4404</span>  priority_queue-><a class="code" href="class_adjustable_priority_queue.html#a506169056c5f470fabdf77aa1934a5a3">NoteChangedPriority</a>(pair_entry);</div>
|
|
<div class="line"><a name="l04405"></a><span class="lineno"> 4405</span> }</div>
|
|
<div class="line"><a name="l04406"></a><span class="lineno"> 4406</span>  </div>
|
|
<div class="line"><a name="l04407"></a><span class="lineno"> 4407</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> GlobalCheapestInsertionFilteredHeuristic::</div>
|
|
<div class="line"><a name="l04408"></a><span class="lineno"> 4408</span>  GetInsertionValueForPairAtPositions(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup_insert_after,</div>
|
|
<div class="line"><a name="l04409"></a><span class="lineno"> 4409</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery,</div>
|
|
<div class="line"><a name="l04410"></a><span class="lineno"> 4410</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery_insert_after,</div>
|
|
<div class="line"><a name="l04411"></a><span class="lineno"> 4411</span>  <span class="keywordtype">int</span> vehicle)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l04412"></a><span class="lineno"> 4412</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(pickup_insert_after, 0);</div>
|
|
<div class="line"><a name="l04413"></a><span class="lineno"> 4413</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup_insert_before = <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(pickup_insert_after);</div>
|
|
<div class="line"><a name="l04414"></a><span class="lineno"> 4414</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup_value = <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#af4b03acbf6a0d7655f7d65d0d87343e6">GetInsertionCostForNodeAtPosition</a>(</div>
|
|
<div class="line"><a name="l04415"></a><span class="lineno"> 4415</span>  pickup, pickup_insert_after, pickup_insert_before, vehicle);</div>
|
|
<div class="line"><a name="l04416"></a><span class="lineno"> 4416</span>  </div>
|
|
<div class="line"><a name="l04417"></a><span class="lineno"> 4417</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(delivery_insert_after, 0);</div>
|
|
<div class="line"><a name="l04418"></a><span class="lineno"> 4418</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery_insert_before = (delivery_insert_after == pickup)</div>
|
|
<div class="line"><a name="l04419"></a><span class="lineno"> 4419</span>  ? pickup_insert_before</div>
|
|
<div class="line"><a name="l04420"></a><span class="lineno"> 4420</span>  : <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(delivery_insert_after);</div>
|
|
<div class="line"><a name="l04421"></a><span class="lineno"> 4421</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery_value = <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#af4b03acbf6a0d7655f7d65d0d87343e6">GetInsertionCostForNodeAtPosition</a>(</div>
|
|
<div class="line"><a name="l04422"></a><span class="lineno"> 4422</span>  delivery, delivery_insert_after, delivery_insert_before, vehicle);</div>
|
|
<div class="line"><a name="l04423"></a><span class="lineno"> 4423</span>  </div>
|
|
<div class="line"><a name="l04424"></a><span class="lineno"> 4424</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> penalty_shift =</div>
|
|
<div class="line"><a name="l04425"></a><span class="lineno"> 4425</span>  absl::GetFlag(FLAGS_routing_shift_insertion_cost_by_penalty)</div>
|
|
<div class="line"><a name="l04426"></a><span class="lineno"> 4426</span>  ? <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ab2b4f136e88ea9aad2921aefb2434bad">GetUnperformedValue</a>(pickup), <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ab2b4f136e88ea9aad2921aefb2434bad">GetUnperformedValue</a>(delivery))</div>
|
|
<div class="line"><a name="l04427"></a><span class="lineno"> 4427</span>  : 0;</div>
|
|
<div class="line"><a name="l04428"></a><span class="lineno"> 4428</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(pickup_value, delivery_value), penalty_shift);</div>
|
|
<div class="line"><a name="l04429"></a><span class="lineno"> 4429</span> }</div>
|
|
<div class="line"><a name="l04430"></a><span class="lineno"> 4430</span>  </div>
|
|
<div class="line"><a name="l04431"></a><span class="lineno"> 4431</span> <span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::InitializePositions(</div>
|
|
<div class="line"><a name="l04432"></a><span class="lineno"> 4432</span>  <span class="keyword">const</span> std::vector<int>& nodes, <span class="keyword">const</span> absl::flat_hash_set<int>& vehicles,</div>
|
|
<div class="line"><a name="l04433"></a><span class="lineno"> 4433</span>  <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a name="l04434"></a><span class="lineno"> 4434</span>  GlobalCheapestInsertionFilteredHeuristic::NodeEntry>* priority_queue,</div>
|
|
<div class="line"><a name="l04435"></a><span class="lineno"> 4435</span>  std::vector<GlobalCheapestInsertionFilteredHeuristic::NodeEntries>*</div>
|
|
<div class="line"><a name="l04436"></a><span class="lineno"> 4436</span>  position_to_node_entries) {</div>
|
|
<div class="line"><a name="l04437"></a><span class="lineno"> 4437</span>  priority_queue-><a class="code" href="class_adjustable_priority_queue.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
|
|
<div class="line"><a name="l04438"></a><span class="lineno"> 4438</span>  position_to_node_entries->clear();</div>
|
|
<div class="line"><a name="l04439"></a><span class="lineno"> 4439</span>  position_to_node_entries->resize(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>());</div>
|
|
<div class="line"><a name="l04440"></a><span class="lineno"> 4440</span>  </div>
|
|
<div class="line"><a name="l04441"></a><span class="lineno"> 4441</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vehicles =</div>
|
|
<div class="line"><a name="l04442"></a><span class="lineno"> 4442</span>  vehicles.empty() ? <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>() : vehicles.size();</div>
|
|
<div class="line"><a name="l04443"></a><span class="lineno"> 4443</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> all_vehicles = (num_vehicles == <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>());</div>
|
|
<div class="line"><a name="l04444"></a><span class="lineno"> 4444</span>  </div>
|
|
<div class="line"><a name="l04445"></a><span class="lineno"> 4445</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node : nodes) {</div>
|
|
<div class="line"><a name="l04446"></a><span class="lineno"> 4446</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(node)) {</div>
|
|
<div class="line"><a name="l04447"></a><span class="lineno"> 4447</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l04448"></a><span class="lineno"> 4448</span>  }</div>
|
|
<div class="line"><a name="l04449"></a><span class="lineno"> 4449</span>  <span class="comment">// Add insertion entry making node unperformed.</span></div>
|
|
<div class="line"><a name="l04450"></a><span class="lineno"> 4450</span>  <span class="keywordflow">if</span> (gci_params_.<a class="code" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#ad962358b9cb4da242cdc3c98ee2ce6ce">add_unperformed_entries</a> &&</div>
|
|
<div class="line"><a name="l04451"></a><span class="lineno"> 4451</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ab2b4f136e88ea9aad2921aefb2434bad">GetUnperformedValue</a>(node) != <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>) {</div>
|
|
<div class="line"><a name="l04452"></a><span class="lineno"> 4452</span>  AddNodeEntry(node, -1, -1, all_vehicles, priority_queue, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l04453"></a><span class="lineno"> 4453</span>  }</div>
|
|
<div class="line"><a name="l04454"></a><span class="lineno"> 4454</span>  <span class="comment">// Add all insertion entries making node performed.</span></div>
|
|
<div class="line"><a name="l04455"></a><span class="lineno"> 4455</span>  InitializeInsertionEntriesPerformingNode(node, vehicles, priority_queue,</div>
|
|
<div class="line"><a name="l04456"></a><span class="lineno"> 4456</span>  position_to_node_entries);</div>
|
|
<div class="line"><a name="l04457"></a><span class="lineno"> 4457</span>  }</div>
|
|
<div class="line"><a name="l04458"></a><span class="lineno"> 4458</span> }</div>
|
|
<div class="line"><a name="l04459"></a><span class="lineno"> 4459</span>  </div>
|
|
<div class="line"><a name="l04460"></a><span class="lineno"> 4460</span> <span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::</div>
|
|
<div class="line"><a name="l04461"></a><span class="lineno"> 4461</span>  InitializeInsertionEntriesPerformingNode(</div>
|
|
<div class="line"><a name="l04462"></a><span class="lineno"> 4462</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node, <span class="keyword">const</span> absl::flat_hash_set<int>& vehicles,</div>
|
|
<div class="line"><a name="l04463"></a><span class="lineno"> 4463</span>  <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a name="l04464"></a><span class="lineno"> 4464</span>  GlobalCheapestInsertionFilteredHeuristic::NodeEntry>*</div>
|
|
<div class="line"><a name="l04465"></a><span class="lineno"> 4465</span>  priority_queue,</div>
|
|
<div class="line"><a name="l04466"></a><span class="lineno"> 4466</span>  std::vector<GlobalCheapestInsertionFilteredHeuristic::NodeEntries>*</div>
|
|
<div class="line"><a name="l04467"></a><span class="lineno"> 4467</span>  position_to_node_entries) {</div>
|
|
<div class="line"><a name="l04468"></a><span class="lineno"> 4468</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vehicles =</div>
|
|
<div class="line"><a name="l04469"></a><span class="lineno"> 4469</span>  vehicles.empty() ? <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>() : vehicles.size();</div>
|
|
<div class="line"><a name="l04470"></a><span class="lineno"> 4470</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> all_vehicles = (num_vehicles == <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>());</div>
|
|
<div class="line"><a name="l04471"></a><span class="lineno"> 4471</span>  </div>
|
|
<div class="line"><a name="l04472"></a><span class="lineno"> 4472</span>  <span class="keywordflow">if</span> (!gci_params_.<a class="code" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a7d91387b5081be8f22d053d93eb9edf4">use_neighbors_ratio_for_initialization</a>) {</div>
|
|
<div class="line"><a name="l04473"></a><span class="lineno"> 4473</span>  <span class="keyword">auto</span> vehicles_it = vehicles.begin();</div>
|
|
<div class="line"><a name="l04474"></a><span class="lineno"> 4474</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> v = 0; v < num_vehicles; v++) {</div>
|
|
<div class="line"><a name="l04475"></a><span class="lineno"> 4475</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = vehicles.empty() ? v : *vehicles_it++;</div>
|
|
<div class="line"><a name="l04476"></a><span class="lineno"> 4476</span>  </div>
|
|
<div class="line"><a name="l04477"></a><span class="lineno"> 4477</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_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(vehicle);</div>
|
|
<div class="line"><a name="l04478"></a><span class="lineno"> 4478</span>  <span class="keywordflow">if</span> (all_vehicles && <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(vehicle) &&</div>
|
|
<div class="line"><a name="l04479"></a><span class="lineno"> 4479</span>  empty_vehicle_type_curator_->GetLowestFixedCostVehicleOfType(</div>
|
|
<div class="line"><a name="l04480"></a><span class="lineno"> 4480</span>  empty_vehicle_type_curator_->Type(vehicle)) != vehicle) {</div>
|
|
<div class="line"><a name="l04481"></a><span class="lineno"> 4481</span>  <span class="comment">// We only consider the least expensive empty vehicle of each type for</span></div>
|
|
<div class="line"><a name="l04482"></a><span class="lineno"> 4482</span>  <span class="comment">// entries.</span></div>
|
|
<div class="line"><a name="l04483"></a><span class="lineno"> 4483</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l04484"></a><span class="lineno"> 4484</span>  }</div>
|
|
<div class="line"><a name="l04485"></a><span class="lineno"> 4485</span>  std::vector<ValuedPosition> valued_positions;</div>
|
|
<div class="line"><a name="l04486"></a><span class="lineno"> 4486</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#aafc4ebf202cabd64f7854c274f425866">AppendEvaluatedPositionsAfter</a>(node, start, <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(start), vehicle,</div>
|
|
<div class="line"><a name="l04487"></a><span class="lineno"> 4487</span>  &valued_positions);</div>
|
|
<div class="line"><a name="l04488"></a><span class="lineno"> 4488</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::pair<int64, int64>& valued_position : valued_positions) {</div>
|
|
<div class="line"><a name="l04489"></a><span class="lineno"> 4489</span>  AddNodeEntry(node, valued_position.second, vehicle, all_vehicles,</div>
|
|
<div class="line"><a name="l04490"></a><span class="lineno"> 4490</span>  priority_queue, position_to_node_entries);</div>
|
|
<div class="line"><a name="l04491"></a><span class="lineno"> 4491</span>  }</div>
|
|
<div class="line"><a name="l04492"></a><span class="lineno"> 4492</span>  }</div>
|
|
<div class="line"><a name="l04493"></a><span class="lineno"> 4493</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l04494"></a><span class="lineno"> 4494</span>  }</div>
|
|
<div class="line"><a name="l04495"></a><span class="lineno"> 4495</span>  </div>
|
|
<div class="line"><a name="l04496"></a><span class="lineno"> 4496</span>  <span class="comment">// We're only considering the closest neighbors as insertion positions for</span></div>
|
|
<div class="line"><a name="l04497"></a><span class="lineno"> 4497</span>  <span class="comment">// the node.</span></div>
|
|
<div class="line"><a name="l04498"></a><span class="lineno"> 4498</span>  <span class="keyword">const</span> <span class="keyword">auto</span> insert_on_vehicle_for_cost_class = [<span class="keyword">this</span>, &vehicles, all_vehicles](</div>
|
|
<div class="line"><a name="l04499"></a><span class="lineno"> 4499</span>  <span class="keywordtype">int</span> v, <span class="keywordtype">int</span> cost_class) {</div>
|
|
<div class="line"><a name="l04500"></a><span class="lineno"> 4500</span>  <span class="keywordflow">return</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a32bba655accbd7dc8e23d30bf679b880">GetCostClassIndexOfVehicle</a>(v).value() == cost_class) &&</div>
|
|
<div class="line"><a name="l04501"></a><span class="lineno"> 4501</span>  (all_vehicles || vehicles.contains(v));</div>
|
|
<div class="line"><a name="l04502"></a><span class="lineno"> 4502</span>  };</div>
|
|
<div class="line"><a name="l04503"></a><span class="lineno"> 4503</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> cost_class = 0; cost_class < <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#ad3b144985c2b4b24cf39b839dbd9c16d">GetCostClassesCount</a>();</div>
|
|
<div class="line"><a name="l04504"></a><span class="lineno"> 4504</span>  cost_class++) {</div>
|
|
<div class="line"><a name="l04505"></a><span class="lineno"> 4505</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> insert_after :</div>
|
|
<div class="line"><a name="l04506"></a><span class="lineno"> 4506</span>  GetNeighborsOfNodeForCostClass(cost_class, node)) {</div>
|
|
<div class="line"><a name="l04507"></a><span class="lineno"> 4507</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(insert_after)) {</div>
|
|
<div class="line"><a name="l04508"></a><span class="lineno"> 4508</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l04509"></a><span class="lineno"> 4509</span>  }</div>
|
|
<div class="line"><a name="l04510"></a><span class="lineno"> 4510</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = node_index_to_vehicle_[insert_after];</div>
|
|
<div class="line"><a name="l04511"></a><span class="lineno"> 4511</span>  <span class="keywordflow">if</span> (vehicle == -1 ||</div>
|
|
<div class="line"><a name="l04512"></a><span class="lineno"> 4512</span>  !insert_on_vehicle_for_cost_class(vehicle, cost_class)) {</div>
|
|
<div class="line"><a name="l04513"></a><span class="lineno"> 4513</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l04514"></a><span class="lineno"> 4514</span>  }</div>
|
|
<div class="line"><a name="l04515"></a><span class="lineno"> 4515</span>  <span class="keywordflow">if</span> (all_vehicles && <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(vehicle) &&</div>
|
|
<div class="line"><a name="l04516"></a><span class="lineno"> 4516</span>  empty_vehicle_type_curator_->GetLowestFixedCostVehicleOfType(</div>
|
|
<div class="line"><a name="l04517"></a><span class="lineno"> 4517</span>  empty_vehicle_type_curator_->Type(vehicle)) != vehicle) {</div>
|
|
<div class="line"><a name="l04518"></a><span class="lineno"> 4518</span>  <span class="comment">// We only consider the least expensive empty vehicle of each type for</span></div>
|
|
<div class="line"><a name="l04519"></a><span class="lineno"> 4519</span>  <span class="comment">// entries.</span></div>
|
|
<div class="line"><a name="l04520"></a><span class="lineno"> 4520</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l04521"></a><span class="lineno"> 4521</span>  }</div>
|
|
<div class="line"><a name="l04522"></a><span class="lineno"> 4522</span>  AddNodeEntry(node, insert_after, vehicle, all_vehicles, priority_queue,</div>
|
|
<div class="line"><a name="l04523"></a><span class="lineno"> 4523</span>  position_to_node_entries);</div>
|
|
<div class="line"><a name="l04524"></a><span class="lineno"> 4524</span>  }</div>
|
|
<div class="line"><a name="l04525"></a><span class="lineno"> 4525</span>  }</div>
|
|
<div class="line"><a name="l04526"></a><span class="lineno"> 4526</span> }</div>
|
|
<div class="line"><a name="l04527"></a><span class="lineno"> 4527</span>  </div>
|
|
<div class="line"><a name="l04528"></a><span class="lineno"> 4528</span> <span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::UpdatePositions(</div>
|
|
<div class="line"><a name="l04529"></a><span class="lineno"> 4529</span>  <span class="keyword">const</span> std::vector<int>& nodes, <span class="keywordtype">int</span> vehicle, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> insert_after,</div>
|
|
<div class="line"><a name="l04530"></a><span class="lineno"> 4530</span>  <span class="keywordtype">bool</span> all_vehicles,</div>
|
|
<div class="line"><a name="l04531"></a><span class="lineno"> 4531</span>  <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a name="l04532"></a><span class="lineno"> 4532</span>  GlobalCheapestInsertionFilteredHeuristic::NodeEntry>* priority_queue,</div>
|
|
<div class="line"><a name="l04533"></a><span class="lineno"> 4533</span>  std::vector<GlobalCheapestInsertionFilteredHeuristic::NodeEntries>*</div>
|
|
<div class="line"><a name="l04534"></a><span class="lineno"> 4534</span>  node_entries) {</div>
|
|
<div class="line"><a name="l04535"></a><span class="lineno"> 4535</span>  <span class="comment">// Either create new entries if we are inserting after a newly inserted node</span></div>
|
|
<div class="line"><a name="l04536"></a><span class="lineno"> 4536</span>  <span class="comment">// or remove entries which have already been inserted.</span></div>
|
|
<div class="line"><a name="l04537"></a><span class="lineno"> 4537</span>  std::vector<NodeEntry*> to_remove;</div>
|
|
<div class="line"><a name="l04538"></a><span class="lineno"> 4538</span>  absl::flat_hash_set<int> existing_insertions;</div>
|
|
<div class="line"><a name="l04539"></a><span class="lineno"> 4539</span>  <span class="keywordflow">for</span> (NodeEntry* <span class="keyword">const</span> node_entry : node_entries->at(insert_after)) {</div>
|
|
<div class="line"><a name="l04540"></a><span class="lineno"> 4540</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(node_entry->insert_after(), insert_after);</div>
|
|
<div class="line"><a name="l04541"></a><span class="lineno"> 4541</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node_to_insert = node_entry->node_to_insert();</div>
|
|
<div class="line"><a name="l04542"></a><span class="lineno"> 4542</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(node_to_insert)) {</div>
|
|
<div class="line"><a name="l04543"></a><span class="lineno"> 4543</span>  to_remove.push_back(node_entry);</div>
|
|
<div class="line"><a name="l04544"></a><span class="lineno"> 4544</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l04545"></a><span class="lineno"> 4545</span>  UpdateNodeEntry(node_entry, priority_queue);</div>
|
|
<div class="line"><a name="l04546"></a><span class="lineno"> 4546</span>  existing_insertions.insert(node_to_insert);</div>
|
|
<div class="line"><a name="l04547"></a><span class="lineno"> 4547</span>  }</div>
|
|
<div class="line"><a name="l04548"></a><span class="lineno"> 4548</span>  }</div>
|
|
<div class="line"><a name="l04549"></a><span class="lineno"> 4549</span>  <span class="keywordflow">for</span> (NodeEntry* <span class="keyword">const</span> node_entry : to_remove) {</div>
|
|
<div class="line"><a name="l04550"></a><span class="lineno"> 4550</span>  DeleteNodeEntry(node_entry, priority_queue, node_entries);</div>
|
|
<div class="line"><a name="l04551"></a><span class="lineno"> 4551</span>  }</div>
|
|
<div class="line"><a name="l04552"></a><span class="lineno"> 4552</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> cost_class = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a32bba655accbd7dc8e23d30bf679b880">GetCostClassIndexOfVehicle</a>(vehicle).value();</div>
|
|
<div class="line"><a name="l04553"></a><span class="lineno"> 4553</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node_to_insert : nodes) {</div>
|
|
<div class="line"><a name="l04554"></a><span class="lineno"> 4554</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(node_to_insert) &&</div>
|
|
<div class="line"><a name="l04555"></a><span class="lineno"> 4555</span>  !existing_insertions.contains(node_to_insert) &&</div>
|
|
<div class="line"><a name="l04556"></a><span class="lineno"> 4556</span>  IsNeighborForCostClass(cost_class, insert_after, node_to_insert)) {</div>
|
|
<div class="line"><a name="l04557"></a><span class="lineno"> 4557</span>  AddNodeEntry(node_to_insert, insert_after, vehicle, all_vehicles,</div>
|
|
<div class="line"><a name="l04558"></a><span class="lineno"> 4558</span>  priority_queue, node_entries);</div>
|
|
<div class="line"><a name="l04559"></a><span class="lineno"> 4559</span>  }</div>
|
|
<div class="line"><a name="l04560"></a><span class="lineno"> 4560</span>  }</div>
|
|
<div class="line"><a name="l04561"></a><span class="lineno"> 4561</span> }</div>
|
|
<div class="line"><a name="l04562"></a><span class="lineno"> 4562</span>  </div>
|
|
<div class="line"><a name="l04563"></a><span class="lineno"> 4563</span> <span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::DeleteNodeEntry(</div>
|
|
<div class="line"><a name="l04564"></a><span class="lineno"> 4564</span>  GlobalCheapestInsertionFilteredHeuristic::NodeEntry* entry,</div>
|
|
<div class="line"><a name="l04565"></a><span class="lineno"> 4565</span>  <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a name="l04566"></a><span class="lineno"> 4566</span>  GlobalCheapestInsertionFilteredHeuristic::NodeEntry>* priority_queue,</div>
|
|
<div class="line"><a name="l04567"></a><span class="lineno"> 4567</span>  std::vector<NodeEntries>* node_entries) {</div>
|
|
<div class="line"><a name="l04568"></a><span class="lineno"> 4568</span>  priority_queue-><a class="code" href="class_adjustable_priority_queue.html#a36647f60b5f27624275724445403ea1d">Remove</a>(entry);</div>
|
|
<div class="line"><a name="l04569"></a><span class="lineno"> 4569</span>  <span class="keywordflow">if</span> (entry->insert_after() != -1) {</div>
|
|
<div class="line"><a name="l04570"></a><span class="lineno"> 4570</span>  node_entries->at(entry->insert_after()).erase(entry);</div>
|
|
<div class="line"><a name="l04571"></a><span class="lineno"> 4571</span>  }</div>
|
|
<div class="line"><a name="l04572"></a><span class="lineno"> 4572</span>  <span class="keyword">delete</span> entry;</div>
|
|
<div class="line"><a name="l04573"></a><span class="lineno"> 4573</span> }</div>
|
|
<div class="line"><a name="l04574"></a><span class="lineno"> 4574</span>  </div>
|
|
<div class="line"><a name="l04575"></a><span class="lineno"> 4575</span> <span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::AddNodeEntry(</div>
|
|
<div class="line"><a name="l04576"></a><span class="lineno"> 4576</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> insert_after, <span class="keywordtype">int</span> vehicle, <span class="keywordtype">bool</span> all_vehicles,</div>
|
|
<div class="line"><a name="l04577"></a><span class="lineno"> 4577</span>  <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<NodeEntry></a>* priority_queue,</div>
|
|
<div class="line"><a name="l04578"></a><span class="lineno"> 4578</span>  std::vector<NodeEntries>* node_entries)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l04579"></a><span class="lineno"> 4579</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node_penalty = <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ab2b4f136e88ea9aad2921aefb2434bad">GetUnperformedValue</a>(node);</div>
|
|
<div class="line"><a name="l04580"></a><span class="lineno"> 4580</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> penalty_shift =</div>
|
|
<div class="line"><a name="l04581"></a><span class="lineno"> 4581</span>  absl::GetFlag(FLAGS_routing_shift_insertion_cost_by_penalty)</div>
|
|
<div class="line"><a name="l04582"></a><span class="lineno"> 4582</span>  ? node_penalty</div>
|
|
<div class="line"><a name="l04583"></a><span class="lineno"> 4583</span>  : 0;</div>
|
|
<div class="line"><a name="l04584"></a><span class="lineno"> 4584</span>  <span class="keywordflow">if</span> (insert_after == -1) {</div>
|
|
<div class="line"><a name="l04585"></a><span class="lineno"> 4585</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(vehicle, -1);</div>
|
|
<div class="line"><a name="l04586"></a><span class="lineno"> 4586</span>  <span class="keywordflow">if</span> (!all_vehicles) {</div>
|
|
<div class="line"><a name="l04587"></a><span class="lineno"> 4587</span>  <span class="comment">// NOTE: In the case where we're not considering all routes</span></div>
|
|
<div class="line"><a name="l04588"></a><span class="lineno"> 4588</span>  <span class="comment">// simultaneously, we don't add insertion entries making nodes</span></div>
|
|
<div class="line"><a name="l04589"></a><span class="lineno"> 4589</span>  <span class="comment">// unperformed.</span></div>
|
|
<div class="line"><a name="l04590"></a><span class="lineno"> 4590</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l04591"></a><span class="lineno"> 4591</span>  }</div>
|
|
<div class="line"><a name="l04592"></a><span class="lineno"> 4592</span>  NodeEntry* <span class="keyword">const</span> node_entry = <span class="keyword">new</span> NodeEntry(node, -1, -1);</div>
|
|
<div class="line"><a name="l04593"></a><span class="lineno"> 4593</span>  node_entry->set_value(<a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(node_penalty, penalty_shift));</div>
|
|
<div class="line"><a name="l04594"></a><span class="lineno"> 4594</span>  priority_queue-><a class="code" href="class_adjustable_priority_queue.html#ac312fa979ea8afd5deabd6b581b3bb1f">Add</a>(node_entry);</div>
|
|
<div class="line"><a name="l04595"></a><span class="lineno"> 4595</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l04596"></a><span class="lineno"> 4596</span>  }</div>
|
|
<div class="line"><a name="l04597"></a><span class="lineno"> 4597</span>  </div>
|
|
<div class="line"><a name="l04598"></a><span class="lineno"> 4598</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> insertion_cost = <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#af4b03acbf6a0d7655f7d65d0d87343e6">GetInsertionCostForNodeAtPosition</a>(</div>
|
|
<div class="line"><a name="l04599"></a><span class="lineno"> 4599</span>  node, insert_after, <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(insert_after), vehicle);</div>
|
|
<div class="line"><a name="l04600"></a><span class="lineno"> 4600</span>  <span class="keywordflow">if</span> (!all_vehicles && insertion_cost > node_penalty) {</div>
|
|
<div class="line"><a name="l04601"></a><span class="lineno"> 4601</span>  <span class="comment">// NOTE: When all vehicles aren't considered for insertion, we don't</span></div>
|
|
<div class="line"><a name="l04602"></a><span class="lineno"> 4602</span>  <span class="comment">// add entries making nodes unperformed, so we don't add insertions</span></div>
|
|
<div class="line"><a name="l04603"></a><span class="lineno"> 4603</span>  <span class="comment">// which cost more than the node penalty either.</span></div>
|
|
<div class="line"><a name="l04604"></a><span class="lineno"> 4604</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l04605"></a><span class="lineno"> 4605</span>  }</div>
|
|
<div class="line"><a name="l04606"></a><span class="lineno"> 4606</span>  </div>
|
|
<div class="line"><a name="l04607"></a><span class="lineno"> 4607</span>  NodeEntry* <span class="keyword">const</span> node_entry = <span class="keyword">new</span> NodeEntry(node, insert_after, vehicle);</div>
|
|
<div class="line"><a name="l04608"></a><span class="lineno"> 4608</span>  node_entry->set_value(<a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(insertion_cost, penalty_shift));</div>
|
|
<div class="line"><a name="l04609"></a><span class="lineno"> 4609</span>  <span class="comment">// Add entry to priority_queue and node_entries.</span></div>
|
|
<div class="line"><a name="l04610"></a><span class="lineno"> 4610</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!priority_queue-><a class="code" href="class_adjustable_priority_queue.html#a7d1005d75f40525f91a2acb84348bc3c">Contains</a>(node_entry));</div>
|
|
<div class="line"><a name="l04611"></a><span class="lineno"> 4611</span>  node_entries->at(insert_after).insert(node_entry);</div>
|
|
<div class="line"><a name="l04612"></a><span class="lineno"> 4612</span>  priority_queue-><a class="code" href="class_adjustable_priority_queue.html#ac312fa979ea8afd5deabd6b581b3bb1f">Add</a>(node_entry);</div>
|
|
<div class="line"><a name="l04613"></a><span class="lineno"> 4613</span> }</div>
|
|
<div class="line"><a name="l04614"></a><span class="lineno"> 4614</span>  </div>
|
|
<div class="line"><a name="l04615"></a><span class="lineno"> 4615</span> <span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::UpdateNodeEntry(</div>
|
|
<div class="line"><a name="l04616"></a><span class="lineno"> 4616</span>  NodeEntry* <span class="keyword">const</span> node_entry,</div>
|
|
<div class="line"><a name="l04617"></a><span class="lineno"> 4617</span>  <a class="code" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<NodeEntry></a>* priority_queue)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l04618"></a><span class="lineno"> 4618</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = node_entry->node_to_insert();</div>
|
|
<div class="line"><a name="l04619"></a><span class="lineno"> 4619</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> insert_after = node_entry->insert_after();</div>
|
|
<div class="line"><a name="l04620"></a><span class="lineno"> 4620</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(insert_after, 0);</div>
|
|
<div class="line"><a name="l04621"></a><span class="lineno"> 4621</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> insertion_cost = <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#af4b03acbf6a0d7655f7d65d0d87343e6">GetInsertionCostForNodeAtPosition</a>(</div>
|
|
<div class="line"><a name="l04622"></a><span class="lineno"> 4622</span>  node, insert_after, <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(insert_after), node_entry->vehicle());</div>
|
|
<div class="line"><a name="l04623"></a><span class="lineno"> 4623</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> penalty_shift =</div>
|
|
<div class="line"><a name="l04624"></a><span class="lineno"> 4624</span>  absl::GetFlag(FLAGS_routing_shift_insertion_cost_by_penalty)</div>
|
|
<div class="line"><a name="l04625"></a><span class="lineno"> 4625</span>  ? <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ab2b4f136e88ea9aad2921aefb2434bad">GetUnperformedValue</a>(node)</div>
|
|
<div class="line"><a name="l04626"></a><span class="lineno"> 4626</span>  : 0;</div>
|
|
<div class="line"><a name="l04627"></a><span class="lineno"> 4627</span>  </div>
|
|
<div class="line"><a name="l04628"></a><span class="lineno"> 4628</span>  node_entry->set_value(<a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(insertion_cost, penalty_shift));</div>
|
|
<div class="line"><a name="l04629"></a><span class="lineno"> 4629</span>  <span class="comment">// Update the priority_queue.</span></div>
|
|
<div class="line"><a name="l04630"></a><span class="lineno"> 4630</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(priority_queue-><a class="code" href="class_adjustable_priority_queue.html#a7d1005d75f40525f91a2acb84348bc3c">Contains</a>(node_entry));</div>
|
|
<div class="line"><a name="l04631"></a><span class="lineno"> 4631</span>  priority_queue-><a class="code" href="class_adjustable_priority_queue.html#a506169056c5f470fabdf77aa1934a5a3">NoteChangedPriority</a>(node_entry);</div>
|
|
<div class="line"><a name="l04632"></a><span class="lineno"> 4632</span> }</div>
|
|
<div class="line"><a name="l04633"></a><span class="lineno"> 4633</span>  </div>
|
|
<div class="line"><a name="l04634"></a><span class="lineno"> 4634</span> <span class="comment">// LocalCheapestInsertionFilteredHeuristic</span></div>
|
|
<div class="line"><a name="l04635"></a><span class="lineno"> 4635</span> <span class="comment">// TODO(user): Add support for penalty costs.</span></div>
|
|
<div class="line"><a name="l04636"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html#adbf82f7964ace16b163bc0b8fa5b8e30"> 4636</a></span> <a class="code" href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html#adbf82f7964ace16b163bc0b8fa5b8e30">LocalCheapestInsertionFilteredHeuristic::</a></div>
|
|
<div class="line"><a name="l04637"></a><span class="lineno"> 4637</span> <a class="code" href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html#adbf82f7964ace16b163bc0b8fa5b8e30"> LocalCheapestInsertionFilteredHeuristic</a>(</div>
|
|
<div class="line"><a name="l04638"></a><span class="lineno"> 4638</span>  <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div>
|
|
<div class="line"><a name="l04639"></a><span class="lineno"> 4639</span>  std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)> evaluator,</div>
|
|
<div class="line"><a name="l04640"></a><span class="lineno"> 4640</span>  <a class="code" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager)</div>
|
|
<div class="line"><a name="l04641"></a><span class="lineno"> 4641</span>  : <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html">CheapestInsertionFilteredHeuristic</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, std::move(evaluator), nullptr,</div>
|
|
<div class="line"><a name="l04642"></a><span class="lineno"> 4642</span>  filter_manager) {</div>
|
|
<div class="line"><a name="l04643"></a><span class="lineno"> 4643</span>  std::vector<int> all_vehicles(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>());</div>
|
|
<div class="line"><a name="l04644"></a><span class="lineno"> 4644</span>  std::iota(std::begin(all_vehicles), std::end(all_vehicles), 0);</div>
|
|
<div class="line"><a name="l04645"></a><span class="lineno"> 4645</span>  </div>
|
|
<div class="line"><a name="l04646"></a><span class="lineno"> 4646</span>  start_end_distances_per_node_ =</div>
|
|
<div class="line"><a name="l04647"></a><span class="lineno"> 4647</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a356517cd51c4b6259d7f439718719eaa">ComputeStartEndDistanceForVehicles</a>(all_vehicles);</div>
|
|
<div class="line"><a name="l04648"></a><span class="lineno"> 4648</span> }</div>
|
|
<div class="line"><a name="l04649"></a><span class="lineno"> 4649</span>  </div>
|
|
<div class="line"><a name="l04650"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289"> 4650</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">LocalCheapestInsertionFilteredHeuristic::BuildSolutionInternal</a>() {</div>
|
|
<div class="line"><a name="l04651"></a><span class="lineno"> 4651</span>  <span class="comment">// Marking if we've tried inserting a node.</span></div>
|
|
<div class="line"><a name="l04652"></a><span class="lineno"> 4652</span>  std::vector<bool> visited(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l04653"></a><span class="lineno"> 4653</span>  <span class="comment">// Possible positions where the current node can inserted.</span></div>
|
|
<div class="line"><a name="l04654"></a><span class="lineno"> 4654</span>  std::vector<int64> insertion_positions;</div>
|
|
<div class="line"><a name="l04655"></a><span class="lineno"> 4655</span>  <span class="comment">// Possible positions where its associated delivery node can inserted (if the</span></div>
|
|
<div class="line"><a name="l04656"></a><span class="lineno"> 4656</span>  <span class="comment">// current node has one).</span></div>
|
|
<div class="line"><a name="l04657"></a><span class="lineno"> 4657</span>  std::vector<int64> delivery_insertion_positions;</div>
|
|
<div class="line"><a name="l04658"></a><span class="lineno"> 4658</span>  <span class="comment">// Iterating on pickup and delivery pairs</span></div>
|
|
<div class="line"><a name="l04659"></a><span class="lineno"> 4659</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html#a76874cd778ea1b9220673e019f9e7abe">RoutingModel::IndexPairs</a>& index_pairs =</div>
|
|
<div class="line"><a name="l04660"></a><span class="lineno"> 4660</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a9e42e15bdb23d63ae78137b97a4882de">GetPickupAndDeliveryPairs</a>();</div>
|
|
<div class="line"><a name="l04661"></a><span class="lineno"> 4661</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& index_pair : index_pairs) {</div>
|
|
<div class="line"><a name="l04662"></a><span class="lineno"> 4662</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup : index_pair.first) {</div>
|
|
<div class="line"><a name="l04663"></a><span class="lineno"> 4663</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(pickup)) {</div>
|
|
<div class="line"><a name="l04664"></a><span class="lineno"> 4664</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l04665"></a><span class="lineno"> 4665</span>  }</div>
|
|
<div class="line"><a name="l04666"></a><span class="lineno"> 4666</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery : index_pair.second) {</div>
|
|
<div class="line"><a name="l04667"></a><span class="lineno"> 4667</span>  <span class="comment">// If either is already in the solution, let it be inserted in the</span></div>
|
|
<div class="line"><a name="l04668"></a><span class="lineno"> 4668</span>  <span class="comment">// standard node insertion loop.</span></div>
|
|
<div class="line"><a name="l04669"></a><span class="lineno"> 4669</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(delivery)) {</div>
|
|
<div class="line"><a name="l04670"></a><span class="lineno"> 4670</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l04671"></a><span class="lineno"> 4671</span>  }</div>
|
|
<div class="line"><a name="l04672"></a><span class="lineno"> 4672</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l04673"></a><span class="lineno"> 4673</span>  visited[pickup] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l04674"></a><span class="lineno"> 4674</span>  visited[delivery] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l04675"></a><span class="lineno"> 4675</span>  ComputeEvaluatorSortedPositions(pickup, &insertion_positions);</div>
|
|
<div class="line"><a name="l04676"></a><span class="lineno"> 4676</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup_insertion : insertion_positions) {</div>
|
|
<div class="line"><a name="l04677"></a><span class="lineno"> 4677</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> pickup_insertion_next = <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(pickup_insertion);</div>
|
|
<div class="line"><a name="l04678"></a><span class="lineno"> 4678</span>  ComputeEvaluatorSortedPositionsOnRouteAfter(</div>
|
|
<div class="line"><a name="l04679"></a><span class="lineno"> 4679</span>  delivery, pickup, pickup_insertion_next,</div>
|
|
<div class="line"><a name="l04680"></a><span class="lineno"> 4680</span>  &delivery_insertion_positions);</div>
|
|
<div class="line"><a name="l04681"></a><span class="lineno"> 4681</span>  <span class="keywordtype">bool</span> found = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l04682"></a><span class="lineno"> 4682</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery_insertion : delivery_insertion_positions) {</div>
|
|
<div class="line"><a name="l04683"></a><span class="lineno"> 4683</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a40574fa8ec102d52f650a616d7fe6c39">InsertBetween</a>(pickup, pickup_insertion, pickup_insertion_next);</div>
|
|
<div class="line"><a name="l04684"></a><span class="lineno"> 4684</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery_insertion_next =</div>
|
|
<div class="line"><a name="l04685"></a><span class="lineno"> 4685</span>  (delivery_insertion == pickup_insertion) ? pickup</div>
|
|
<div class="line"><a name="l04686"></a><span class="lineno"> 4686</span>  : (delivery_insertion == pickup) ? pickup_insertion_next</div>
|
|
<div class="line"><a name="l04687"></a><span class="lineno"> 4687</span>  : <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(delivery_insertion);</div>
|
|
<div class="line"><a name="l04688"></a><span class="lineno"> 4688</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a40574fa8ec102d52f650a616d7fe6c39">InsertBetween</a>(delivery, delivery_insertion,</div>
|
|
<div class="line"><a name="l04689"></a><span class="lineno"> 4689</span>  delivery_insertion_next);</div>
|
|
<div class="line"><a name="l04690"></a><span class="lineno"> 4690</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>()) {</div>
|
|
<div class="line"><a name="l04691"></a><span class="lineno"> 4691</span>  found = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l04692"></a><span class="lineno"> 4692</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l04693"></a><span class="lineno"> 4693</span>  }</div>
|
|
<div class="line"><a name="l04694"></a><span class="lineno"> 4694</span>  }</div>
|
|
<div class="line"><a name="l04695"></a><span class="lineno"> 4695</span>  <span class="keywordflow">if</span> (found) {</div>
|
|
<div class="line"><a name="l04696"></a><span class="lineno"> 4696</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l04697"></a><span class="lineno"> 4697</span>  }</div>
|
|
<div class="line"><a name="l04698"></a><span class="lineno"> 4698</span>  }</div>
|
|
<div class="line"><a name="l04699"></a><span class="lineno"> 4699</span>  }</div>
|
|
<div class="line"><a name="l04700"></a><span class="lineno"> 4700</span>  }</div>
|
|
<div class="line"><a name="l04701"></a><span class="lineno"> 4701</span>  }</div>
|
|
<div class="line"><a name="l04702"></a><span class="lineno"> 4702</span>  </div>
|
|
<div class="line"><a name="l04703"></a><span class="lineno"> 4703</span>  std::priority_queue<Seed> node_queue;</div>
|
|
<div class="line"><a name="l04704"></a><span class="lineno"> 4704</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a69d38e86eb8fc2fa4df0d8839c8dd5a9">InitializePriorityQueue</a>(&start_end_distances_per_node_, &node_queue);</div>
|
|
<div class="line"><a name="l04705"></a><span class="lineno"> 4705</span>  </div>
|
|
<div class="line"><a name="l04706"></a><span class="lineno"> 4706</span>  <span class="keywordflow">while</span> (!node_queue.empty()) {</div>
|
|
<div class="line"><a name="l04707"></a><span class="lineno"> 4707</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> node = node_queue.top().second;</div>
|
|
<div class="line"><a name="l04708"></a><span class="lineno"> 4708</span>  node_queue.pop();</div>
|
|
<div class="line"><a name="l04709"></a><span class="lineno"> 4709</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(node) || visited[node]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l04710"></a><span class="lineno"> 4710</span>  ComputeEvaluatorSortedPositions(node, &insertion_positions);</div>
|
|
<div class="line"><a name="l04711"></a><span class="lineno"> 4711</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> insertion : insertion_positions) {</div>
|
|
<div class="line"><a name="l04712"></a><span class="lineno"> 4712</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l04713"></a><span class="lineno"> 4713</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a40574fa8ec102d52f650a616d7fe6c39">InsertBetween</a>(node, insertion, <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(insertion));</div>
|
|
<div class="line"><a name="l04714"></a><span class="lineno"> 4714</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>()) {</div>
|
|
<div class="line"><a name="l04715"></a><span class="lineno"> 4715</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l04716"></a><span class="lineno"> 4716</span>  }</div>
|
|
<div class="line"><a name="l04717"></a><span class="lineno"> 4717</span>  }</div>
|
|
<div class="line"><a name="l04718"></a><span class="lineno"> 4718</span>  }</div>
|
|
<div class="line"><a name="l04719"></a><span class="lineno"> 4719</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a97049801609b8cb68c0428970f916fd4">MakeUnassignedNodesUnperformed</a>();</div>
|
|
<div class="line"><a name="l04720"></a><span class="lineno"> 4720</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>();</div>
|
|
<div class="line"><a name="l04721"></a><span class="lineno"> 4721</span> }</div>
|
|
<div class="line"><a name="l04722"></a><span class="lineno"> 4722</span>  </div>
|
|
<div class="line"><a name="l04723"></a><span class="lineno"> 4723</span> <span class="keywordtype">void</span> LocalCheapestInsertionFilteredHeuristic::ComputeEvaluatorSortedPositions(</div>
|
|
<div class="line"><a name="l04724"></a><span class="lineno"> 4724</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node, std::vector<int64>* sorted_positions) {</div>
|
|
<div class="line"><a name="l04725"></a><span class="lineno"> 4725</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(sorted_positions != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l04726"></a><span class="lineno"> 4726</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(node));</div>
|
|
<div class="line"><a name="l04727"></a><span class="lineno"> 4727</span>  sorted_positions->clear();</div>
|
|
<div class="line"><a name="l04728"></a><span class="lineno"> 4728</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a354dd8c252cf59b748602b342db6019d">Size</a>();</div>
|
|
<div class="line"><a name="l04729"></a><span class="lineno"> 4729</span>  <span class="keywordflow">if</span> (node < size) {</div>
|
|
<div class="line"><a name="l04730"></a><span class="lineno"> 4730</span>  std::vector<std::pair<int64, int64>> valued_positions;</div>
|
|
<div class="line"><a name="l04731"></a><span class="lineno"> 4731</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); ++vehicle) {</div>
|
|
<div class="line"><a name="l04732"></a><span class="lineno"> 4732</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_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(vehicle);</div>
|
|
<div class="line"><a name="l04733"></a><span class="lineno"> 4733</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#aafc4ebf202cabd64f7854c274f425866">AppendEvaluatedPositionsAfter</a>(node, start, <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(start), vehicle,</div>
|
|
<div class="line"><a name="l04734"></a><span class="lineno"> 4734</span>  &valued_positions);</div>
|
|
<div class="line"><a name="l04735"></a><span class="lineno"> 4735</span>  }</div>
|
|
<div class="line"><a name="l04736"></a><span class="lineno"> 4736</span>  SortAndExtractPairSeconds(&valued_positions, sorted_positions);</div>
|
|
<div class="line"><a name="l04737"></a><span class="lineno"> 4737</span>  }</div>
|
|
<div class="line"><a name="l04738"></a><span class="lineno"> 4738</span> }</div>
|
|
<div class="line"><a name="l04739"></a><span class="lineno"> 4739</span>  </div>
|
|
<div class="line"><a name="l04740"></a><span class="lineno"> 4740</span> <span class="keywordtype">void</span> LocalCheapestInsertionFilteredHeuristic::</div>
|
|
<div class="line"><a name="l04741"></a><span class="lineno"> 4741</span>  ComputeEvaluatorSortedPositionsOnRouteAfter(</div>
|
|
<div class="line"><a name="l04742"></a><span class="lineno"> 4742</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> start, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> next_after_start,</div>
|
|
<div class="line"><a name="l04743"></a><span class="lineno"> 4743</span>  std::vector<int64>* sorted_positions) {</div>
|
|
<div class="line"><a name="l04744"></a><span class="lineno"> 4744</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(sorted_positions != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l04745"></a><span class="lineno"> 4745</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(node));</div>
|
|
<div class="line"><a name="l04746"></a><span class="lineno"> 4746</span>  sorted_positions->clear();</div>
|
|
<div class="line"><a name="l04747"></a><span class="lineno"> 4747</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a354dd8c252cf59b748602b342db6019d">Size</a>();</div>
|
|
<div class="line"><a name="l04748"></a><span class="lineno"> 4748</span>  <span class="keywordflow">if</span> (node < size) {</div>
|
|
<div class="line"><a name="l04749"></a><span class="lineno"> 4749</span>  <span class="comment">// TODO(user): Take vehicle into account.</span></div>
|
|
<div class="line"><a name="l04750"></a><span class="lineno"> 4750</span>  std::vector<std::pair<int64, int64>> valued_positions;</div>
|
|
<div class="line"><a name="l04751"></a><span class="lineno"> 4751</span>  <a class="code" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#aafc4ebf202cabd64f7854c274f425866">AppendEvaluatedPositionsAfter</a>(node, start, next_after_start, 0,</div>
|
|
<div class="line"><a name="l04752"></a><span class="lineno"> 4752</span>  &valued_positions);</div>
|
|
<div class="line"><a name="l04753"></a><span class="lineno"> 4753</span>  SortAndExtractPairSeconds(&valued_positions, sorted_positions);</div>
|
|
<div class="line"><a name="l04754"></a><span class="lineno"> 4754</span>  }</div>
|
|
<div class="line"><a name="l04755"></a><span class="lineno"> 4755</span> }</div>
|
|
<div class="line"><a name="l04756"></a><span class="lineno"> 4756</span>  </div>
|
|
<div class="line"><a name="l04757"></a><span class="lineno"> 4757</span> <span class="comment">// CheapestAdditionFilteredHeuristic</span></div>
|
|
<div class="line"><a name="l04758"></a><span class="lineno"> 4758</span>  </div>
|
|
<div class="line"><a name="l04759"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html#afec155b0f80a58cf5d632413078cc4f2"> 4759</a></span> <a class="code" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html#afec155b0f80a58cf5d632413078cc4f2">CheapestAdditionFilteredHeuristic::CheapestAdditionFilteredHeuristic</a>(</div>
|
|
<div class="line"><a name="l04760"></a><span class="lineno"> 4760</span>  <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager)</div>
|
|
<div class="line"><a name="l04761"></a><span class="lineno"> 4761</span>  : <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html">RoutingFilteredHeuristic</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, filter_manager) {}</div>
|
|
<div class="line"><a name="l04762"></a><span class="lineno"> 4762</span>  </div>
|
|
<div class="line"><a name="l04763"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289"> 4763</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">CheapestAdditionFilteredHeuristic::BuildSolutionInternal</a>() {</div>
|
|
<div class="line"><a name="l04764"></a><span class="lineno"> 4764</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a> = -1;</div>
|
|
<div class="line"><a name="l04765"></a><span class="lineno"> 4765</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html#a76874cd778ea1b9220673e019f9e7abe">RoutingModel::IndexPairs</a>& pairs = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a9e42e15bdb23d63ae78137b97a4882de">GetPickupAndDeliveryPairs</a>();</div>
|
|
<div class="line"><a name="l04766"></a><span class="lineno"> 4766</span>  std::vector<std::vector<int64>> deliveries(<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>());</div>
|
|
<div class="line"><a name="l04767"></a><span class="lineno"> 4767</span>  std::vector<std::vector<int64>> pickups(<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>());</div>
|
|
<div class="line"><a name="l04768"></a><span class="lineno"> 4768</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html#a1636c49d2587c3d9df16918345b82378">RoutingModel::IndexPair</a>& pair : pairs) {</div>
|
|
<div class="line"><a name="l04769"></a><span class="lineno"> 4769</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> first : pair.first) {</div>
|
|
<div class="line"><a name="l04770"></a><span class="lineno"> 4770</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> second : pair.second) {</div>
|
|
<div class="line"><a name="l04771"></a><span class="lineno"> 4771</span>  deliveries[first].push_back(second);</div>
|
|
<div class="line"><a name="l04772"></a><span class="lineno"> 4772</span>  pickups[second].push_back(first);</div>
|
|
<div class="line"><a name="l04773"></a><span class="lineno"> 4773</span>  }</div>
|
|
<div class="line"><a name="l04774"></a><span class="lineno"> 4774</span>  }</div>
|
|
<div class="line"><a name="l04775"></a><span class="lineno"> 4775</span>  }</div>
|
|
<div class="line"><a name="l04776"></a><span class="lineno"> 4776</span>  <span class="comment">// To mimic the behavior of PathSelector (cf. search.cc), iterating on</span></div>
|
|
<div class="line"><a name="l04777"></a><span class="lineno"> 4777</span>  <span class="comment">// routes with partial route at their start first then on routes with largest</span></div>
|
|
<div class="line"><a name="l04778"></a><span class="lineno"> 4778</span>  <span class="comment">// index.</span></div>
|
|
<div class="line"><a name="l04779"></a><span class="lineno"> 4779</span>  std::vector<int> sorted_vehicles(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->vehicles(), 0);</div>
|
|
<div class="line"><a name="l04780"></a><span class="lineno"> 4780</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); ++vehicle) {</div>
|
|
<div class="line"><a name="l04781"></a><span class="lineno"> 4781</span>  sorted_vehicles[vehicle] = vehicle;</div>
|
|
<div class="line"><a name="l04782"></a><span class="lineno"> 4782</span>  }</div>
|
|
<div class="line"><a name="l04783"></a><span class="lineno"> 4783</span>  std::sort(sorted_vehicles.begin(), sorted_vehicles.end(),</div>
|
|
<div class="line"><a name="l04784"></a><span class="lineno"> 4784</span>  PartialRoutesAndLargeVehicleIndicesFirst(*<span class="keyword">this</span>));</div>
|
|
<div class="line"><a name="l04785"></a><span class="lineno"> 4785</span>  <span class="comment">// Neighbors of the node currently being extended.</span></div>
|
|
<div class="line"><a name="l04786"></a><span class="lineno"> 4786</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> vehicle : sorted_vehicles) {</div>
|
|
<div class="line"><a name="l04787"></a><span class="lineno"> 4787</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> last_node = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a2ace3be57d4d81121e8ebbd3642052c0">GetStartChainEnd</a>(vehicle);</div>
|
|
<div class="line"><a name="l04788"></a><span class="lineno"> 4788</span>  <span class="keywordtype">bool</span> extend_route = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l04789"></a><span class="lineno"> 4789</span>  <span class="comment">// Extend the route of the current vehicle while it's possible. We can</span></div>
|
|
<div class="line"><a name="l04790"></a><span class="lineno"> 4790</span>  <span class="comment">// iterate more than once if pickup and delivery pairs have been inserted</span></div>
|
|
<div class="line"><a name="l04791"></a><span class="lineno"> 4791</span>  <span class="comment">// in the last iteration (see comment below); the new iteration will try to</span></div>
|
|
<div class="line"><a name="l04792"></a><span class="lineno"> 4792</span>  <span class="comment">// extend the route after the last delivery on the route.</span></div>
|
|
<div class="line"><a name="l04793"></a><span class="lineno"> 4793</span>  <span class="keywordflow">while</span> (extend_route) {</div>
|
|
<div class="line"><a name="l04794"></a><span class="lineno"> 4794</span>  extend_route = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l04795"></a><span class="lineno"> 4795</span>  <span class="keywordtype">bool</span> found = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l04796"></a><span class="lineno"> 4796</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = last_node;</div>
|
|
<div class="line"><a name="l04797"></a><span class="lineno"> 4797</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> end = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a8a3ae6ba0baf1765da1a2f4a6cecc730">GetEndChainStart</a>(vehicle);</div>
|
|
<div class="line"><a name="l04798"></a><span class="lineno"> 4798</span>  <span class="comment">// Extend the route until either the end node of the vehicle is reached</span></div>
|
|
<div class="line"><a name="l04799"></a><span class="lineno"> 4799</span>  <span class="comment">// or no node or node pair can be added. Deliveries in pickup and</span></div>
|
|
<div class="line"><a name="l04800"></a><span class="lineno"> 4800</span>  <span class="comment">// delivery pairs are added at the same time as pickups, at the end of the</span></div>
|
|
<div class="line"><a name="l04801"></a><span class="lineno"> 4801</span>  <span class="comment">// route, in reverse order of the pickups. Deliveries are never added</span></div>
|
|
<div class="line"><a name="l04802"></a><span class="lineno"> 4802</span>  <span class="comment">// alone.</span></div>
|
|
<div class="line"><a name="l04803"></a><span class="lineno"> 4803</span>  <span class="keywordflow">while</span> (found && !<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->IsEnd(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)) {</div>
|
|
<div class="line"><a name="l04804"></a><span class="lineno"> 4804</span>  found = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l04805"></a><span class="lineno"> 4805</span>  std::vector<int64> neighbors;</div>
|
|
<div class="line"><a name="l04806"></a><span class="lineno"> 4806</span>  <span class="keywordflow">if</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->Nexts().size()) {</div>
|
|
<div class="line"><a name="l04807"></a><span class="lineno"> 4807</span>  std::unique_ptr<IntVarIterator> it(</div>
|
|
<div class="line"><a name="l04808"></a><span class="lineno"> 4808</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->Nexts()[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->MakeDomainIterator(<span class="keyword">false</span>));</div>
|
|
<div class="line"><a name="l04809"></a><span class="lineno"> 4809</span>  <span class="keyword">auto</span> next_values = <a class="code" href="classoperations__research_1_1_init_and_get_values.html">InitAndGetValues</a>(it.get());</div>
|
|
<div class="line"><a name="l04810"></a><span class="lineno"> 4810</span>  neighbors = GetPossibleNextsFromIterator(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, next_values.begin(),</div>
|
|
<div class="line"><a name="l04811"></a><span class="lineno"> 4811</span>  next_values.end());</div>
|
|
<div class="line"><a name="l04812"></a><span class="lineno"> 4812</span>  }</div>
|
|
<div class="line"><a name="l04813"></a><span class="lineno"> 4813</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; !found && i < neighbors.size(); ++i) {</div>
|
|
<div class="line"><a name="l04814"></a><span class="lineno"> 4814</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = -1;</div>
|
|
<div class="line"><a name="l04815"></a><span class="lineno"> 4815</span>  <span class="keywordflow">switch</span> (i) {</div>
|
|
<div class="line"><a name="l04816"></a><span class="lineno"> 4816</span>  <span class="keywordflow">case</span> 0:</div>
|
|
<div class="line"><a name="l04817"></a><span class="lineno"> 4817</span>  <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = FindTopSuccessor(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, neighbors);</div>
|
|
<div class="line"><a name="l04818"></a><span class="lineno"> 4818</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l04819"></a><span class="lineno"> 4819</span>  <span class="keywordflow">case</span> 1:</div>
|
|
<div class="line"><a name="l04820"></a><span class="lineno"> 4820</span>  SortSuccessors(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, &neighbors);</div>
|
|
<div class="line"><a name="l04821"></a><span class="lineno"> 4821</span>  ABSL_FALLTHROUGH_INTENDED;</div>
|
|
<div class="line"><a name="l04822"></a><span class="lineno"> 4822</span>  <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a name="l04823"></a><span class="lineno"> 4823</span>  <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = neighbors[i];</div>
|
|
<div class="line"><a name="l04824"></a><span class="lineno"> 4824</span>  }</div>
|
|
<div class="line"><a name="l04825"></a><span class="lineno"> 4825</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->IsEnd(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>) && <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> != end) {</div>
|
|
<div class="line"><a name="l04826"></a><span class="lineno"> 4826</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l04827"></a><span class="lineno"> 4827</span>  }</div>
|
|
<div class="line"><a name="l04828"></a><span class="lineno"> 4828</span>  <span class="comment">// Only add a delivery if one of its pickups has been added already.</span></div>
|
|
<div class="line"><a name="l04829"></a><span class="lineno"> 4829</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->IsEnd(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>) && !pickups[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>].empty()) {</div>
|
|
<div class="line"><a name="l04830"></a><span class="lineno"> 4830</span>  <span class="keywordtype">bool</span> contains_pickups = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l04831"></a><span class="lineno"> 4831</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup : pickups[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>]) {</div>
|
|
<div class="line"><a name="l04832"></a><span class="lineno"> 4832</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(pickup)) {</div>
|
|
<div class="line"><a name="l04833"></a><span class="lineno"> 4833</span>  contains_pickups = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l04834"></a><span class="lineno"> 4834</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l04835"></a><span class="lineno"> 4835</span>  }</div>
|
|
<div class="line"><a name="l04836"></a><span class="lineno"> 4836</span>  }</div>
|
|
<div class="line"><a name="l04837"></a><span class="lineno"> 4837</span>  <span class="keywordflow">if</span> (!contains_pickups) {</div>
|
|
<div class="line"><a name="l04838"></a><span class="lineno"> 4838</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l04839"></a><span class="lineno"> 4839</span>  }</div>
|
|
<div class="line"><a name="l04840"></a><span class="lineno"> 4840</span>  }</div>
|
|
<div class="line"><a name="l04841"></a><span class="lineno"> 4841</span>  std::vector<int64> next_deliveries;</div>
|
|
<div class="line"><a name="l04842"></a><span class="lineno"> 4842</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> < deliveries.size()) {</div>
|
|
<div class="line"><a name="l04843"></a><span class="lineno"> 4843</span>  next_deliveries = GetPossibleNextsFromIterator(</div>
|
|
<div class="line"><a name="l04844"></a><span class="lineno"> 4844</span>  <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, deliveries[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>].begin(), deliveries[<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>].end());</div>
|
|
<div class="line"><a name="l04845"></a><span class="lineno"> 4845</span>  }</div>
|
|
<div class="line"><a name="l04846"></a><span class="lineno"> 4846</span>  <span class="keywordflow">if</span> (next_deliveries.empty()) next_deliveries = {<a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a>};</div>
|
|
<div class="line"><a name="l04847"></a><span class="lineno"> 4847</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; !found && j < next_deliveries.size(); ++j) {</div>
|
|
<div class="line"><a name="l04848"></a><span class="lineno"> 4848</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l04849"></a><span class="lineno"> 4849</span>  <span class="keywordtype">int</span> delivery = -1;</div>
|
|
<div class="line"><a name="l04850"></a><span class="lineno"> 4850</span>  <span class="keywordflow">switch</span> (j) {</div>
|
|
<div class="line"><a name="l04851"></a><span class="lineno"> 4851</span>  <span class="keywordflow">case</span> 0:</div>
|
|
<div class="line"><a name="l04852"></a><span class="lineno"> 4852</span>  delivery = FindTopSuccessor(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, next_deliveries);</div>
|
|
<div class="line"><a name="l04853"></a><span class="lineno"> 4853</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l04854"></a><span class="lineno"> 4854</span>  <span class="keywordflow">case</span> 1:</div>
|
|
<div class="line"><a name="l04855"></a><span class="lineno"> 4855</span>  SortSuccessors(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, &next_deliveries);</div>
|
|
<div class="line"><a name="l04856"></a><span class="lineno"> 4856</span>  ABSL_FALLTHROUGH_INTENDED;</div>
|
|
<div class="line"><a name="l04857"></a><span class="lineno"> 4857</span>  <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a name="l04858"></a><span class="lineno"> 4858</span>  delivery = next_deliveries[j];</div>
|
|
<div class="line"><a name="l04859"></a><span class="lineno"> 4859</span>  }</div>
|
|
<div class="line"><a name="l04860"></a><span class="lineno"> 4860</span>  <span class="comment">// Insert "next" after "index", and before "end" if it is not the</span></div>
|
|
<div class="line"><a name="l04861"></a><span class="lineno"> 4861</span>  <span class="comment">// end already.</span></div>
|
|
<div class="line"><a name="l04862"></a><span class="lineno"> 4862</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a name="l04863"></a><span class="lineno"> 4863</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->IsEnd(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)) {</div>
|
|
<div class="line"><a name="l04864"></a><span class="lineno"> 4864</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, end);</div>
|
|
<div class="line"><a name="l04865"></a><span class="lineno"> 4865</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aa0ae711364aadabc5365babc40a79fed">MakeDisjunctionNodesUnperformed</a>(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a name="l04866"></a><span class="lineno"> 4866</span>  <span class="keywordflow">if</span> (delivery != <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a>) {</div>
|
|
<div class="line"><a name="l04867"></a><span class="lineno"> 4867</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, delivery);</div>
|
|
<div class="line"><a name="l04868"></a><span class="lineno"> 4868</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(delivery, end);</div>
|
|
<div class="line"><a name="l04869"></a><span class="lineno"> 4869</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aa0ae711364aadabc5365babc40a79fed">MakeDisjunctionNodesUnperformed</a>(delivery);</div>
|
|
<div class="line"><a name="l04870"></a><span class="lineno"> 4870</span>  }</div>
|
|
<div class="line"><a name="l04871"></a><span class="lineno"> 4871</span>  }</div>
|
|
<div class="line"><a name="l04872"></a><span class="lineno"> 4872</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>()) {</div>
|
|
<div class="line"><a name="l04873"></a><span class="lineno"> 4873</span>  <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l04874"></a><span class="lineno"> 4874</span>  found = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l04875"></a><span class="lineno"> 4875</span>  <span class="keywordflow">if</span> (delivery != <a class="code" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a>) {</div>
|
|
<div class="line"><a name="l04876"></a><span class="lineno"> 4876</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->IsEnd(end) && last_node != delivery) {</div>
|
|
<div class="line"><a name="l04877"></a><span class="lineno"> 4877</span>  last_node = delivery;</div>
|
|
<div class="line"><a name="l04878"></a><span class="lineno"> 4878</span>  extend_route = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l04879"></a><span class="lineno"> 4879</span>  }</div>
|
|
<div class="line"><a name="l04880"></a><span class="lineno"> 4880</span>  end = delivery;</div>
|
|
<div class="line"><a name="l04881"></a><span class="lineno"> 4881</span>  }</div>
|
|
<div class="line"><a name="l04882"></a><span class="lineno"> 4882</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l04883"></a><span class="lineno"> 4883</span>  }</div>
|
|
<div class="line"><a name="l04884"></a><span class="lineno"> 4884</span>  }</div>
|
|
<div class="line"><a name="l04885"></a><span class="lineno"> 4885</span>  }</div>
|
|
<div class="line"><a name="l04886"></a><span class="lineno"> 4886</span>  }</div>
|
|
<div class="line"><a name="l04887"></a><span class="lineno"> 4887</span>  }</div>
|
|
<div class="line"><a name="l04888"></a><span class="lineno"> 4888</span>  }</div>
|
|
<div class="line"><a name="l04889"></a><span class="lineno"> 4889</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a97049801609b8cb68c0428970f916fd4">MakeUnassignedNodesUnperformed</a>();</div>
|
|
<div class="line"><a name="l04890"></a><span class="lineno"> 4890</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>();</div>
|
|
<div class="line"><a name="l04891"></a><span class="lineno"> 4891</span> }</div>
|
|
<div class="line"><a name="l04892"></a><span class="lineno"> 4892</span>  </div>
|
|
<div class="line"><a name="l04893"></a><span class="lineno"> 4893</span> <span class="keywordtype">bool</span> CheapestAdditionFilteredHeuristic::</div>
|
|
<div class="line"><a name="l04894"></a><span class="lineno"> 4894</span>  PartialRoutesAndLargeVehicleIndicesFirst::operator()(<span class="keywordtype">int</span> vehicle1,</div>
|
|
<div class="line"><a name="l04895"></a><span class="lineno"> 4895</span>  <span class="keywordtype">int</span> vehicle2)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l04896"></a><span class="lineno"> 4896</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> has_partial_route1 = (builder_.model()->Start(vehicle1) !=</div>
|
|
<div class="line"><a name="l04897"></a><span class="lineno"> 4897</span>  builder_.GetStartChainEnd(vehicle1));</div>
|
|
<div class="line"><a name="l04898"></a><span class="lineno"> 4898</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> has_partial_route2 = (builder_.model()->Start(vehicle2) !=</div>
|
|
<div class="line"><a name="l04899"></a><span class="lineno"> 4899</span>  builder_.GetStartChainEnd(vehicle2));</div>
|
|
<div class="line"><a name="l04900"></a><span class="lineno"> 4900</span>  <span class="keywordflow">if</span> (has_partial_route1 == has_partial_route2) {</div>
|
|
<div class="line"><a name="l04901"></a><span class="lineno"> 4901</span>  <span class="keywordflow">return</span> vehicle2 < vehicle1;</div>
|
|
<div class="line"><a name="l04902"></a><span class="lineno"> 4902</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l04903"></a><span class="lineno"> 4903</span>  <span class="keywordflow">return</span> has_partial_route2 < has_partial_route1;</div>
|
|
<div class="line"><a name="l04904"></a><span class="lineno"> 4904</span>  }</div>
|
|
<div class="line"><a name="l04905"></a><span class="lineno"> 4905</span> }</div>
|
|
<div class="line"><a name="l04906"></a><span class="lineno"> 4906</span>  </div>
|
|
<div class="line"><a name="l04907"></a><span class="lineno"> 4907</span> <span class="comment">// EvaluatorCheapestAdditionFilteredHeuristic</span></div>
|
|
<div class="line"><a name="l04908"></a><span class="lineno"> 4908</span>  </div>
|
|
<div class="line"><a name="l04909"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic.html#a1eb5921458713ad43bcfd488501b7e42"> 4909</a></span> <a class="code" href="classoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic.html#a1eb5921458713ad43bcfd488501b7e42">EvaluatorCheapestAdditionFilteredHeuristic::</a></div>
|
|
<div class="line"><a name="l04910"></a><span class="lineno"> 4910</span> <a class="code" href="classoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic.html#a1eb5921458713ad43bcfd488501b7e42"> EvaluatorCheapestAdditionFilteredHeuristic</a>(</div>
|
|
<div class="line"><a name="l04911"></a><span class="lineno"> 4911</span>  <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)> evaluator,</div>
|
|
<div class="line"><a name="l04912"></a><span class="lineno"> 4912</span>  <a class="code" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager)</div>
|
|
<div class="line"><a name="l04913"></a><span class="lineno"> 4913</span>  : <a class="code" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html">CheapestAdditionFilteredHeuristic</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, filter_manager),</div>
|
|
<div class="line"><a name="l04914"></a><span class="lineno"> 4914</span>  <a class="code" href="search_8cc.html#a5e5e8b8520054d3bdeb53ef0291ce4d9">evaluator_</a>(std::move(evaluator)) {}</div>
|
|
<div class="line"><a name="l04915"></a><span class="lineno"> 4915</span>  </div>
|
|
<div class="line"><a name="l04916"></a><span class="lineno"> 4916</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> EvaluatorCheapestAdditionFilteredHeuristic::FindTopSuccessor(</div>
|
|
<div class="line"><a name="l04917"></a><span class="lineno"> 4917</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node, <span class="keyword">const</span> std::vector<int64>& successors) {</div>
|
|
<div class="line"><a name="l04918"></a><span class="lineno"> 4918</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> best_evaluation = <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>;</div>
|
|
<div class="line"><a name="l04919"></a><span class="lineno"> 4919</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> best_successor = -1;</div>
|
|
<div class="line"><a name="l04920"></a><span class="lineno"> 4920</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> successor : successors) {</div>
|
|
<div class="line"><a name="l04921"></a><span class="lineno"> 4921</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> evaluation =</div>
|
|
<div class="line"><a name="l04922"></a><span class="lineno"> 4922</span>  (successor >= 0) ? evaluator_(node, successor) : <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>;</div>
|
|
<div class="line"><a name="l04923"></a><span class="lineno"> 4923</span>  <span class="keywordflow">if</span> (evaluation < best_evaluation ||</div>
|
|
<div class="line"><a name="l04924"></a><span class="lineno"> 4924</span>  (evaluation == best_evaluation && successor > best_successor)) {</div>
|
|
<div class="line"><a name="l04925"></a><span class="lineno"> 4925</span>  best_evaluation = evaluation;</div>
|
|
<div class="line"><a name="l04926"></a><span class="lineno"> 4926</span>  best_successor = successor;</div>
|
|
<div class="line"><a name="l04927"></a><span class="lineno"> 4927</span>  }</div>
|
|
<div class="line"><a name="l04928"></a><span class="lineno"> 4928</span>  }</div>
|
|
<div class="line"><a name="l04929"></a><span class="lineno"> 4929</span>  <span class="keywordflow">return</span> best_successor;</div>
|
|
<div class="line"><a name="l04930"></a><span class="lineno"> 4930</span> }</div>
|
|
<div class="line"><a name="l04931"></a><span class="lineno"> 4931</span>  </div>
|
|
<div class="line"><a name="l04932"></a><span class="lineno"> 4932</span> <span class="keywordtype">void</span> EvaluatorCheapestAdditionFilteredHeuristic::SortSuccessors(</div>
|
|
<div class="line"><a name="l04933"></a><span class="lineno"> 4933</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node, std::vector<int64>* successors) {</div>
|
|
<div class="line"><a name="l04934"></a><span class="lineno"> 4934</span>  std::vector<std::pair<int64, int64>> values;</div>
|
|
<div class="line"><a name="l04935"></a><span class="lineno"> 4935</span>  values.reserve(successors->size());</div>
|
|
<div class="line"><a name="l04936"></a><span class="lineno"> 4936</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> successor : *successors) {</div>
|
|
<div class="line"><a name="l04937"></a><span class="lineno"> 4937</span>  <span class="comment">// Tie-breaking on largest node index to mimic the behavior of</span></div>
|
|
<div class="line"><a name="l04938"></a><span class="lineno"> 4938</span>  <span class="comment">// CheapestValueSelector (search.cc).</span></div>
|
|
<div class="line"><a name="l04939"></a><span class="lineno"> 4939</span>  values.push_back({evaluator_(node, successor), -successor});</div>
|
|
<div class="line"><a name="l04940"></a><span class="lineno"> 4940</span>  }</div>
|
|
<div class="line"><a name="l04941"></a><span class="lineno"> 4941</span>  std::sort(values.begin(), values.end());</div>
|
|
<div class="line"><a name="l04942"></a><span class="lineno"> 4942</span>  successors->clear();</div>
|
|
<div class="line"><a name="l04943"></a><span class="lineno"> 4943</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> : values) {</div>
|
|
<div class="line"><a name="l04944"></a><span class="lineno"> 4944</span>  successors->push_back(-<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>.second);</div>
|
|
<div class="line"><a name="l04945"></a><span class="lineno"> 4945</span>  }</div>
|
|
<div class="line"><a name="l04946"></a><span class="lineno"> 4946</span> }</div>
|
|
<div class="line"><a name="l04947"></a><span class="lineno"> 4947</span>  </div>
|
|
<div class="line"><a name="l04948"></a><span class="lineno"> 4948</span> <span class="comment">// ComparatorCheapestAdditionFilteredHeuristic</span></div>
|
|
<div class="line"><a name="l04949"></a><span class="lineno"> 4949</span>  </div>
|
|
<div class="line"><a name="l04950"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic.html#a760174569c84ca68a545381dad33b38c"> 4950</a></span> <a class="code" href="classoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic.html#a760174569c84ca68a545381dad33b38c">ComparatorCheapestAdditionFilteredHeuristic::</a></div>
|
|
<div class="line"><a name="l04951"></a><span class="lineno"> 4951</span> <a class="code" href="classoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic.html#a760174569c84ca68a545381dad33b38c"> ComparatorCheapestAdditionFilteredHeuristic</a>(</div>
|
|
<div class="line"><a name="l04952"></a><span class="lineno"> 4952</span>  <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code" href="classoperations__research_1_1_solver.html#a3094f1982f455fd97342c64b7c0b3ccf">Solver::VariableValueComparator</a> comparator,</div>
|
|
<div class="line"><a name="l04953"></a><span class="lineno"> 4953</span>  <a class="code" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager)</div>
|
|
<div class="line"><a name="l04954"></a><span class="lineno"> 4954</span>  : <a class="code" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html">CheapestAdditionFilteredHeuristic</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, filter_manager),</div>
|
|
<div class="line"><a name="l04955"></a><span class="lineno"> 4955</span>  comparator_(std::move(comparator)) {}</div>
|
|
<div class="line"><a name="l04956"></a><span class="lineno"> 4956</span>  </div>
|
|
<div class="line"><a name="l04957"></a><span class="lineno"> 4957</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> ComparatorCheapestAdditionFilteredHeuristic::FindTopSuccessor(</div>
|
|
<div class="line"><a name="l04958"></a><span class="lineno"> 4958</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node, <span class="keyword">const</span> std::vector<int64>& successors) {</div>
|
|
<div class="line"><a name="l04959"></a><span class="lineno"> 4959</span>  <span class="keywordflow">return</span> *std::min_element(successors.begin(), successors.end(),</div>
|
|
<div class="line"><a name="l04960"></a><span class="lineno"> 4960</span>  [<span class="keyword">this</span>, node](<span class="keywordtype">int</span> successor1, <span class="keywordtype">int</span> successor2) {</div>
|
|
<div class="line"><a name="l04961"></a><span class="lineno"> 4961</span>  return comparator_(node, successor1, successor2);</div>
|
|
<div class="line"><a name="l04962"></a><span class="lineno"> 4962</span>  });</div>
|
|
<div class="line"><a name="l04963"></a><span class="lineno"> 4963</span> }</div>
|
|
<div class="line"><a name="l04964"></a><span class="lineno"> 4964</span>  </div>
|
|
<div class="line"><a name="l04965"></a><span class="lineno"> 4965</span> <span class="keywordtype">void</span> ComparatorCheapestAdditionFilteredHeuristic::SortSuccessors(</div>
|
|
<div class="line"><a name="l04966"></a><span class="lineno"> 4966</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node, std::vector<int64>* successors) {</div>
|
|
<div class="line"><a name="l04967"></a><span class="lineno"> 4967</span>  std::sort(successors->begin(), successors->end(),</div>
|
|
<div class="line"><a name="l04968"></a><span class="lineno"> 4968</span>  [<span class="keyword">this</span>, node](<span class="keywordtype">int</span> successor1, <span class="keywordtype">int</span> successor2) {</div>
|
|
<div class="line"><a name="l04969"></a><span class="lineno"> 4969</span>  return comparator_(node, successor1, successor2);</div>
|
|
<div class="line"><a name="l04970"></a><span class="lineno"> 4970</span>  });</div>
|
|
<div class="line"><a name="l04971"></a><span class="lineno"> 4971</span> }</div>
|
|
<div class="line"><a name="l04972"></a><span class="lineno"> 4972</span>  </div>
|
|
<div class="line"><a name="l04973"></a><span class="lineno"> 4973</span> <span class="comment">// Class storing and allowing access to the savings according to the number of</span></div>
|
|
<div class="line"><a name="l04974"></a><span class="lineno"> 4974</span> <span class="comment">// vehicle types.</span></div>
|
|
<div class="line"><a name="l04975"></a><span class="lineno"> 4975</span> <span class="comment">// The savings are stored and sorted in sorted_savings_per_vehicle_type_.</span></div>
|
|
<div class="line"><a name="l04976"></a><span class="lineno"> 4976</span> <span class="comment">// Furthermore, when there is more than one vehicle type, the savings for a same</span></div>
|
|
<div class="line"><a name="l04977"></a><span class="lineno"> 4977</span> <span class="comment">// before-->after arc are sorted in costs_and_savings_per_arc_[arc] by</span></div>
|
|
<div class="line"><a name="l04978"></a><span class="lineno"> 4978</span> <span class="comment">// increasing cost(s-->before-->after-->e), where s and e are the start and end</span></div>
|
|
<div class="line"><a name="l04979"></a><span class="lineno"> 4979</span> <span class="comment">// of the route, in order to make sure the arc is served by the route with the</span></div>
|
|
<div class="line"><a name="l04980"></a><span class="lineno"> 4980</span> <span class="comment">// closest depot (start/end) possible.</span></div>
|
|
<div class="line"><a name="l04981"></a><span class="lineno"> 4981</span> <span class="comment">// When there is only one vehicle "type" (i.e. all vehicles have the same</span></div>
|
|
<div class="line"><a name="l04982"></a><span class="lineno"> 4982</span> <span class="comment">// start/end and cost class), each arc has a single saving value associated to</span></div>
|
|
<div class="line"><a name="l04983"></a><span class="lineno"> 4983</span> <span class="comment">// it, so we ignore this last step to avoid unnecessary computations, and only</span></div>
|
|
<div class="line"><a name="l04984"></a><span class="lineno"> 4984</span> <span class="comment">// work with sorted_savings_per_vehicle_type_[0].</span></div>
|
|
<div class="line"><a name="l04985"></a><span class="lineno"> 4985</span> <span class="comment">// In case of multiple vehicle types, the best savings for each arc, i.e. the</span></div>
|
|
<div class="line"><a name="l04986"></a><span class="lineno"> 4986</span> <span class="comment">// savings corresponding to the closest vehicle type, are inserted and sorted in</span></div>
|
|
<div class="line"><a name="l04987"></a><span class="lineno"> 4987</span> <span class="comment">// sorted_savings_.</span></div>
|
|
<div class="line"><a name="l04988"></a><span class="lineno"> 4988</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l04989"></a><span class="lineno"> 4989</span> <span class="comment">// This class also handles skipped Savings:</span></div>
|
|
<div class="line"><a name="l04990"></a><span class="lineno"> 4990</span> <span class="comment">// The vectors skipped_savings_starting/ending_at_ contain all the Savings that</span></div>
|
|
<div class="line"><a name="l04991"></a><span class="lineno"> 4991</span> <span class="comment">// weren't added to the model, which we want to consider for later:</span></div>
|
|
<div class="line"><a name="l04992"></a><span class="lineno"> 4992</span> <span class="comment">// 1) When a Saving before-->after with both nodes uncontained cannot be used to</span></div>
|
|
<div class="line"><a name="l04993"></a><span class="lineno"> 4993</span> <span class="comment">// start a new route (no more available vehicles or could not commit on any</span></div>
|
|
<div class="line"><a name="l04994"></a><span class="lineno"> 4994</span> <span class="comment">// of those available).</span></div>
|
|
<div class="line"><a name="l04995"></a><span class="lineno"> 4995</span> <span class="comment">// 2) When only one of the nodes of the Saving is contained but on a different</span></div>
|
|
<div class="line"><a name="l04996"></a><span class="lineno"> 4996</span> <span class="comment">// vehicle type.</span></div>
|
|
<div class="line"><a name="l04997"></a><span class="lineno"> 4997</span> <span class="comment">// In these cases, the Update() method is called with update_best_saving = true,</span></div>
|
|
<div class="line"><a name="l04998"></a><span class="lineno"> 4998</span> <span class="comment">// which in turn calls SkipSavingForArc() (within</span></div>
|
|
<div class="line"><a name="l04999"></a><span class="lineno"> 4999</span> <span class="comment">// UpdateNextAndSkippedSavingsForArcWithType()) to mark the Saving for this arc</span></div>
|
|
<div class="line"><a name="l05000"></a><span class="lineno"> 5000</span> <span class="comment">// (with the correct type in the second case) as "skipped", by storing it in</span></div>
|
|
<div class="line"><a name="l05001"></a><span class="lineno"> 5001</span> <span class="comment">// skipped_savings_starting_at_[before] and skipped_savings_ending_at_[after].</span></div>
|
|
<div class="line"><a name="l05002"></a><span class="lineno"> 5002</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l05003"></a><span class="lineno"> 5003</span> <span class="comment">// UpdateNextAndSkippedSavingsForArcWithType() also updates the next_savings_</span></div>
|
|
<div class="line"><a name="l05004"></a><span class="lineno"> 5004</span> <span class="comment">// vector, which stores the savings to go through once we've iterated through</span></div>
|
|
<div class="line"><a name="l05005"></a><span class="lineno"> 5005</span> <span class="comment">// all sorted_savings_.</span></div>
|
|
<div class="line"><a name="l05006"></a><span class="lineno"> 5006</span> <span class="comment">// In the first case above, where neither nodes are contained, we skip the</span></div>
|
|
<div class="line"><a name="l05007"></a><span class="lineno"> 5007</span> <span class="comment">// current Saving (current_saving_), and add the next best Saving for this arc</span></div>
|
|
<div class="line"><a name="l05008"></a><span class="lineno"> 5008</span> <span class="comment">// to next_savings_ (in case this skipped Saving is never considered).</span></div>
|
|
<div class="line"><a name="l05009"></a><span class="lineno"> 5009</span> <span class="comment">// In the second case with a specific type, we search for the Saving with the</span></div>
|
|
<div class="line"><a name="l05010"></a><span class="lineno"> 5010</span> <span class="comment">// correct type for this arc, and add it to both next_savings_ and the skipped</span></div>
|
|
<div class="line"><a name="l05011"></a><span class="lineno"> 5011</span> <span class="comment">// Savings.</span></div>
|
|
<div class="line"><a name="l05012"></a><span class="lineno"> 5012</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l05013"></a><span class="lineno"> 5013</span> <span class="comment">// The skipped Savings are then re-considered when one of their ends gets</span></div>
|
|
<div class="line"><a name="l05014"></a><span class="lineno"> 5014</span> <span class="comment">// inserted:</span></div>
|
|
<div class="line"><a name="l05015"></a><span class="lineno"> 5015</span> <span class="comment">// When another Saving other_node-->before (or after-->other_node) gets</span></div>
|
|
<div class="line"><a name="l05016"></a><span class="lineno"> 5016</span> <span class="comment">// inserted, all skipped Savings in skipped_savings_starting_at_[before] (or</span></div>
|
|
<div class="line"><a name="l05017"></a><span class="lineno"> 5017</span> <span class="comment">// skipped_savings_ending_at_[after]) are once again considered by calling</span></div>
|
|
<div class="line"><a name="l05018"></a><span class="lineno"> 5018</span> <span class="comment">// ReinjectSkippedSavingsStartingAt() (or ReinjectSkippedSavingsEndingAt()).</span></div>
|
|
<div class="line"><a name="l05019"></a><span class="lineno"> 5019</span> <span class="comment">// Then, when calling GetSaving(), we iterate through the reinjected Savings in</span></div>
|
|
<div class="line"><a name="l05020"></a><span class="lineno"> 5020</span> <span class="comment">// order of insertion in the vectors while there are reinjected savings.</span></div>
|
|
<div class="line"><a name="l05021"></a><span class="lineno"> 5021</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Saving></div>
|
|
<div class="line"><a name="l05022"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html"> 5022</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html">SavingsFilteredHeuristic::SavingsContainer</a> {</div>
|
|
<div class="line"><a name="l05023"></a><span class="lineno"> 5023</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l05024"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ab4ff697245c706fa950702d316f073ba"> 5024</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ab4ff697245c706fa950702d316f073ba">SavingsContainer</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html">SavingsFilteredHeuristic</a>* savings_db,</div>
|
|
<div class="line"><a name="l05025"></a><span class="lineno"> 5025</span>  <span class="keywordtype">int</span> vehicle_types)</div>
|
|
<div class="line"><a name="l05026"></a><span class="lineno"> 5026</span>  : savings_db_(savings_db),</div>
|
|
<div class="line"><a name="l05027"></a><span class="lineno"> 5027</span>  vehicle_types_(vehicle_types),</div>
|
|
<div class="line"><a name="l05028"></a><span class="lineno"> 5028</span>  index_in_sorted_savings_(0),</div>
|
|
<div class="line"><a name="l05029"></a><span class="lineno"> 5029</span>  single_vehicle_type_(vehicle_types == 1),</div>
|
|
<div class="line"><a name="l05030"></a><span class="lineno"> 5030</span>  using_incoming_reinjected_saving_(false),</div>
|
|
<div class="line"><a name="l05031"></a><span class="lineno"> 5031</span>  sorted_(false),</div>
|
|
<div class="line"><a name="l05032"></a><span class="lineno"> 5032</span>  to_update_(true) {}</div>
|
|
<div class="line"><a name="l05033"></a><span class="lineno"> 5033</span>  </div>
|
|
<div class="line"><a name="l05034"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a9e0ba906ec6006c16ab30b7a3a4fe100"> 5034</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a9e0ba906ec6006c16ab30b7a3a4fe100">InitializeContainer</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> size, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> saving_neighbors) {</div>
|
|
<div class="line"><a name="l05035"></a><span class="lineno"> 5035</span>  sorted_savings_per_vehicle_type_.clear();</div>
|
|
<div class="line"><a name="l05036"></a><span class="lineno"> 5036</span>  sorted_savings_per_vehicle_type_.resize(vehicle_types_);</div>
|
|
<div class="line"><a name="l05037"></a><span class="lineno"> 5037</span>  <span class="keywordflow">for</span> (std::vector<Saving>& savings : sorted_savings_per_vehicle_type_) {</div>
|
|
<div class="line"><a name="l05038"></a><span class="lineno"> 5038</span>  savings.reserve(size * saving_neighbors);</div>
|
|
<div class="line"><a name="l05039"></a><span class="lineno"> 5039</span>  }</div>
|
|
<div class="line"><a name="l05040"></a><span class="lineno"> 5040</span>  </div>
|
|
<div class="line"><a name="l05041"></a><span class="lineno"> 5041</span>  sorted_savings_.clear();</div>
|
|
<div class="line"><a name="l05042"></a><span class="lineno"> 5042</span>  costs_and_savings_per_arc_.clear();</div>
|
|
<div class="line"><a name="l05043"></a><span class="lineno"> 5043</span>  arc_indices_per_before_node_.clear();</div>
|
|
<div class="line"><a name="l05044"></a><span class="lineno"> 5044</span>  </div>
|
|
<div class="line"><a name="l05045"></a><span class="lineno"> 5045</span>  <span class="keywordflow">if</span> (!single_vehicle_type_) {</div>
|
|
<div class="line"><a name="l05046"></a><span class="lineno"> 5046</span>  costs_and_savings_per_arc_.reserve(size * saving_neighbors);</div>
|
|
<div class="line"><a name="l05047"></a><span class="lineno"> 5047</span>  arc_indices_per_before_node_.resize(size);</div>
|
|
<div class="line"><a name="l05048"></a><span class="lineno"> 5048</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> before_node = 0; before_node < size; before_node++) {</div>
|
|
<div class="line"><a name="l05049"></a><span class="lineno"> 5049</span>  arc_indices_per_before_node_[before_node].reserve(saving_neighbors);</div>
|
|
<div class="line"><a name="l05050"></a><span class="lineno"> 5050</span>  }</div>
|
|
<div class="line"><a name="l05051"></a><span class="lineno"> 5051</span>  }</div>
|
|
<div class="line"><a name="l05052"></a><span class="lineno"> 5052</span>  skipped_savings_starting_at_.clear();</div>
|
|
<div class="line"><a name="l05053"></a><span class="lineno"> 5053</span>  skipped_savings_starting_at_.resize(size);</div>
|
|
<div class="line"><a name="l05054"></a><span class="lineno"> 5054</span>  skipped_savings_ending_at_.clear();</div>
|
|
<div class="line"><a name="l05055"></a><span class="lineno"> 5055</span>  skipped_savings_ending_at_.resize(size);</div>
|
|
<div class="line"><a name="l05056"></a><span class="lineno"> 5056</span>  incoming_reinjected_savings_ = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l05057"></a><span class="lineno"> 5057</span>  outgoing_reinjected_savings_ = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l05058"></a><span class="lineno"> 5058</span>  incoming_new_reinjected_savings_ = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l05059"></a><span class="lineno"> 5059</span>  outgoing_new_reinjected_savings_ = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l05060"></a><span class="lineno"> 5060</span>  }</div>
|
|
<div class="line"><a name="l05061"></a><span class="lineno"> 5061</span>  </div>
|
|
<div class="line"><a name="l05062"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a10dec7373473c460b835c82e29bebcb9"> 5062</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a10dec7373473c460b835c82e29bebcb9">AddNewSaving</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a2520cfaec0cd23cd56fd1eec8db79be4">Saving</a>& saving, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> total_cost, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> before_node,</div>
|
|
<div class="line"><a name="l05063"></a><span class="lineno"> 5063</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> after_node, <span class="keywordtype">int</span> vehicle_type) {</div>
|
|
<div class="line"><a name="l05064"></a><span class="lineno"> 5064</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!sorted_savings_per_vehicle_type_.empty())</div>
|
|
<div class="line"><a name="l05065"></a><span class="lineno"> 5065</span>  << <span class="stringliteral">"Container not initialized!"</span>;</div>
|
|
<div class="line"><a name="l05066"></a><span class="lineno"> 5066</span>  sorted_savings_per_vehicle_type_[vehicle_type].push_back(saving);</div>
|
|
<div class="line"><a name="l05067"></a><span class="lineno"> 5067</span>  UpdateArcIndicesCostsAndSavings(before_node, after_node,</div>
|
|
<div class="line"><a name="l05068"></a><span class="lineno"> 5068</span>  {total_cost, saving});</div>
|
|
<div class="line"><a name="l05069"></a><span class="lineno"> 5069</span>  }</div>
|
|
<div class="line"><a name="l05070"></a><span class="lineno"> 5070</span>  </div>
|
|
<div class="line"><a name="l05071"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ae424c3360277f457eba79fd25b4eed3b"> 5071</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ae424c3360277f457eba79fd25b4eed3b">Sort</a>() {</div>
|
|
<div class="line"><a name="l05072"></a><span class="lineno"> 5072</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!sorted_) << <span class="stringliteral">"Container already sorted!"</span>;</div>
|
|
<div class="line"><a name="l05073"></a><span class="lineno"> 5073</span>  </div>
|
|
<div class="line"><a name="l05074"></a><span class="lineno"> 5074</span>  <span class="keywordflow">for</span> (std::vector<Saving>& savings : sorted_savings_per_vehicle_type_) {</div>
|
|
<div class="line"><a name="l05075"></a><span class="lineno"> 5075</span>  std::sort(savings.begin(), savings.end());</div>
|
|
<div class="line"><a name="l05076"></a><span class="lineno"> 5076</span>  }</div>
|
|
<div class="line"><a name="l05077"></a><span class="lineno"> 5077</span>  </div>
|
|
<div class="line"><a name="l05078"></a><span class="lineno"> 5078</span>  <span class="keywordflow">if</span> (single_vehicle_type_) {</div>
|
|
<div class="line"><a name="l05079"></a><span class="lineno"> 5079</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& savings = sorted_savings_per_vehicle_type_[0];</div>
|
|
<div class="line"><a name="l05080"></a><span class="lineno"> 5080</span>  sorted_savings_.resize(savings.size());</div>
|
|
<div class="line"><a name="l05081"></a><span class="lineno"> 5081</span>  std::transform(savings.begin(), savings.end(), sorted_savings_.begin(),</div>
|
|
<div class="line"><a name="l05082"></a><span class="lineno"> 5082</span>  [](<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a2520cfaec0cd23cd56fd1eec8db79be4">Saving</a>& saving) {</div>
|
|
<div class="line"><a name="l05083"></a><span class="lineno"> 5083</span>  return SavingAndArc({saving, <span class="comment">/*arc_index*/</span> -1});</div>
|
|
<div class="line"><a name="l05084"></a><span class="lineno"> 5084</span>  });</div>
|
|
<div class="line"><a name="l05085"></a><span class="lineno"> 5085</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l05086"></a><span class="lineno"> 5086</span>  <span class="comment">// For each arc, sort the savings by decreasing total cost</span></div>
|
|
<div class="line"><a name="l05087"></a><span class="lineno"> 5087</span>  <span class="comment">// start-->a-->b-->end.</span></div>
|
|
<div class="line"><a name="l05088"></a><span class="lineno"> 5088</span>  <span class="comment">// The best saving for each arc is therefore the last of its vector.</span></div>
|
|
<div class="line"><a name="l05089"></a><span class="lineno"> 5089</span>  sorted_savings_.reserve(vehicle_types_ *</div>
|
|
<div class="line"><a name="l05090"></a><span class="lineno"> 5090</span>  costs_and_savings_per_arc_.size());</div>
|
|
<div class="line"><a name="l05091"></a><span class="lineno"> 5091</span>  </div>
|
|
<div class="line"><a name="l05092"></a><span class="lineno"> 5092</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> arc_index = 0; arc_index < costs_and_savings_per_arc_.size();</div>
|
|
<div class="line"><a name="l05093"></a><span class="lineno"> 5093</span>  arc_index++) {</div>
|
|
<div class="line"><a name="l05094"></a><span class="lineno"> 5094</span>  std::vector<std::pair<int64, Saving>>& costs_and_savings =</div>
|
|
<div class="line"><a name="l05095"></a><span class="lineno"> 5095</span>  costs_and_savings_per_arc_[arc_index];</div>
|
|
<div class="line"><a name="l05096"></a><span class="lineno"> 5096</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!costs_and_savings.empty());</div>
|
|
<div class="line"><a name="l05097"></a><span class="lineno"> 5097</span>  </div>
|
|
<div class="line"><a name="l05098"></a><span class="lineno"> 5098</span>  std::sort(</div>
|
|
<div class="line"><a name="l05099"></a><span class="lineno"> 5099</span>  costs_and_savings.begin(), costs_and_savings.end(),</div>
|
|
<div class="line"><a name="l05100"></a><span class="lineno"> 5100</span>  [](<span class="keyword">const</span> std::pair<int64, Saving>& cs1,</div>
|
|
<div class="line"><a name="l05101"></a><span class="lineno"> 5101</span>  <span class="keyword">const</span> std::pair<int64, Saving>& cs2) { return cs1 > cs2; });</div>
|
|
<div class="line"><a name="l05102"></a><span class="lineno"> 5102</span>  </div>
|
|
<div class="line"><a name="l05103"></a><span class="lineno"> 5103</span>  <span class="comment">// Insert all Savings for this arc with the lowest cost into</span></div>
|
|
<div class="line"><a name="l05104"></a><span class="lineno"> 5104</span>  <span class="comment">// sorted_savings_.</span></div>
|
|
<div class="line"><a name="l05105"></a><span class="lineno"> 5105</span>  <span class="comment">// TODO(user): Also do this when reiterating on next_savings_.</span></div>
|
|
<div class="line"><a name="l05106"></a><span class="lineno"> 5106</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a> = costs_and_savings.back().first;</div>
|
|
<div class="line"><a name="l05107"></a><span class="lineno"> 5107</span>  <span class="keywordflow">while</span> (!costs_and_savings.empty() &&</div>
|
|
<div class="line"><a name="l05108"></a><span class="lineno"> 5108</span>  costs_and_savings.back().first == <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>) {</div>
|
|
<div class="line"><a name="l05109"></a><span class="lineno"> 5109</span>  sorted_savings_.push_back(</div>
|
|
<div class="line"><a name="l05110"></a><span class="lineno"> 5110</span>  {costs_and_savings.back().second, arc_index});</div>
|
|
<div class="line"><a name="l05111"></a><span class="lineno"> 5111</span>  costs_and_savings.pop_back();</div>
|
|
<div class="line"><a name="l05112"></a><span class="lineno"> 5112</span>  }</div>
|
|
<div class="line"><a name="l05113"></a><span class="lineno"> 5113</span>  }</div>
|
|
<div class="line"><a name="l05114"></a><span class="lineno"> 5114</span>  std::sort(sorted_savings_.begin(), sorted_savings_.end());</div>
|
|
<div class="line"><a name="l05115"></a><span class="lineno"> 5115</span>  next_saving_type_and_index_for_arc_.clear();</div>
|
|
<div class="line"><a name="l05116"></a><span class="lineno"> 5116</span>  next_saving_type_and_index_for_arc_.resize(</div>
|
|
<div class="line"><a name="l05117"></a><span class="lineno"> 5117</span>  costs_and_savings_per_arc_.size(), {-1, -1});</div>
|
|
<div class="line"><a name="l05118"></a><span class="lineno"> 5118</span>  }</div>
|
|
<div class="line"><a name="l05119"></a><span class="lineno"> 5119</span>  sorted_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l05120"></a><span class="lineno"> 5120</span>  index_in_sorted_savings_ = 0;</div>
|
|
<div class="line"><a name="l05121"></a><span class="lineno"> 5121</span>  to_update_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l05122"></a><span class="lineno"> 5122</span>  }</div>
|
|
<div class="line"><a name="l05123"></a><span class="lineno"> 5123</span>  </div>
|
|
<div class="line"><a name="l05124"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a6e4036b54f3ff84ef42fa4acabf6158b"> 5124</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a6e4036b54f3ff84ef42fa4acabf6158b">HasSaving</a>() {</div>
|
|
<div class="line"><a name="l05125"></a><span class="lineno"> 5125</span>  <span class="keywordflow">return</span> index_in_sorted_savings_ < sorted_savings_.size() ||</div>
|
|
<div class="line"><a name="l05126"></a><span class="lineno"> 5126</span>  HasReinjectedSavings();</div>
|
|
<div class="line"><a name="l05127"></a><span class="lineno"> 5127</span>  }</div>
|
|
<div class="line"><a name="l05128"></a><span class="lineno"> 5128</span>  </div>
|
|
<div class="line"><a name="l05129"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ab2c8a5a9d539f1fb49d767045f8c9297"> 5129</a></span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a2520cfaec0cd23cd56fd1eec8db79be4">Saving</a> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ab2c8a5a9d539f1fb49d767045f8c9297">GetSaving</a>() {</div>
|
|
<div class="line"><a name="l05130"></a><span class="lineno"> 5130</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(sorted_) << <span class="stringliteral">"Calling GetSaving() before Sort() !"</span>;</div>
|
|
<div class="line"><a name="l05131"></a><span class="lineno"> 5131</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!to_update_)</div>
|
|
<div class="line"><a name="l05132"></a><span class="lineno"> 5132</span>  << <span class="stringliteral">"Update() should be called between two calls to GetSaving() !"</span>;</div>
|
|
<div class="line"><a name="l05133"></a><span class="lineno"> 5133</span>  </div>
|
|
<div class="line"><a name="l05134"></a><span class="lineno"> 5134</span>  to_update_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l05135"></a><span class="lineno"> 5135</span>  </div>
|
|
<div class="line"><a name="l05136"></a><span class="lineno"> 5136</span>  <span class="keywordflow">if</span> (HasReinjectedSavings()) {</div>
|
|
<div class="line"><a name="l05137"></a><span class="lineno"> 5137</span>  <span class="keywordflow">if</span> (incoming_reinjected_savings_ != <span class="keyword">nullptr</span> &&</div>
|
|
<div class="line"><a name="l05138"></a><span class="lineno"> 5138</span>  outgoing_reinjected_savings_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l05139"></a><span class="lineno"> 5139</span>  <span class="comment">// Get the best Saving among the two.</span></div>
|
|
<div class="line"><a name="l05140"></a><span class="lineno"> 5140</span>  SavingAndArc& incoming_saving = incoming_reinjected_savings_->front();</div>
|
|
<div class="line"><a name="l05141"></a><span class="lineno"> 5141</span>  SavingAndArc& outgoing_saving = outgoing_reinjected_savings_->front();</div>
|
|
<div class="line"><a name="l05142"></a><span class="lineno"> 5142</span>  <span class="keywordflow">if</span> (incoming_saving < outgoing_saving) {</div>
|
|
<div class="line"><a name="l05143"></a><span class="lineno"> 5143</span>  current_saving_ = incoming_saving;</div>
|
|
<div class="line"><a name="l05144"></a><span class="lineno"> 5144</span>  using_incoming_reinjected_saving_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l05145"></a><span class="lineno"> 5145</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l05146"></a><span class="lineno"> 5146</span>  current_saving_ = outgoing_saving;</div>
|
|
<div class="line"><a name="l05147"></a><span class="lineno"> 5147</span>  using_incoming_reinjected_saving_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l05148"></a><span class="lineno"> 5148</span>  }</div>
|
|
<div class="line"><a name="l05149"></a><span class="lineno"> 5149</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l05150"></a><span class="lineno"> 5150</span>  <span class="keywordflow">if</span> (incoming_reinjected_savings_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l05151"></a><span class="lineno"> 5151</span>  current_saving_ = incoming_reinjected_savings_->front();</div>
|
|
<div class="line"><a name="l05152"></a><span class="lineno"> 5152</span>  using_incoming_reinjected_saving_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l05153"></a><span class="lineno"> 5153</span>  }</div>
|
|
<div class="line"><a name="l05154"></a><span class="lineno"> 5154</span>  <span class="keywordflow">if</span> (outgoing_reinjected_savings_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l05155"></a><span class="lineno"> 5155</span>  current_saving_ = outgoing_reinjected_savings_->front();</div>
|
|
<div class="line"><a name="l05156"></a><span class="lineno"> 5156</span>  using_incoming_reinjected_saving_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l05157"></a><span class="lineno"> 5157</span>  }</div>
|
|
<div class="line"><a name="l05158"></a><span class="lineno"> 5158</span>  }</div>
|
|
<div class="line"><a name="l05159"></a><span class="lineno"> 5159</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l05160"></a><span class="lineno"> 5160</span>  current_saving_ = sorted_savings_[index_in_sorted_savings_];</div>
|
|
<div class="line"><a name="l05161"></a><span class="lineno"> 5161</span>  }</div>
|
|
<div class="line"><a name="l05162"></a><span class="lineno"> 5162</span>  <span class="keywordflow">return</span> current_saving_.saving;</div>
|
|
<div class="line"><a name="l05163"></a><span class="lineno"> 5163</span>  }</div>
|
|
<div class="line"><a name="l05164"></a><span class="lineno"> 5164</span>  </div>
|
|
<div class="line"><a name="l05165"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ad7378ee53fe29a5ac2b72c1ae77a3d03"> 5165</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ad7378ee53fe29a5ac2b72c1ae77a3d03">Update</a>(<span class="keywordtype">bool</span> update_best_saving, <span class="keywordtype">int</span> type = -1) {</div>
|
|
<div class="line"><a name="l05166"></a><span class="lineno"> 5166</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(to_update_) << <span class="stringliteral">"Container already up to date!"</span>;</div>
|
|
<div class="line"><a name="l05167"></a><span class="lineno"> 5167</span>  <span class="keywordflow">if</span> (update_best_saving) {</div>
|
|
<div class="line"><a name="l05168"></a><span class="lineno"> 5168</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> arc_index = current_saving_.arc_index;</div>
|
|
<div class="line"><a name="l05169"></a><span class="lineno"> 5169</span>  UpdateNextAndSkippedSavingsForArcWithType(arc_index, type);</div>
|
|
<div class="line"><a name="l05170"></a><span class="lineno"> 5170</span>  }</div>
|
|
<div class="line"><a name="l05171"></a><span class="lineno"> 5171</span>  <span class="keywordflow">if</span> (!HasReinjectedSavings()) {</div>
|
|
<div class="line"><a name="l05172"></a><span class="lineno"> 5172</span>  index_in_sorted_savings_++;</div>
|
|
<div class="line"><a name="l05173"></a><span class="lineno"> 5173</span>  </div>
|
|
<div class="line"><a name="l05174"></a><span class="lineno"> 5174</span>  <span class="keywordflow">if</span> (index_in_sorted_savings_ == sorted_savings_.size()) {</div>
|
|
<div class="line"><a name="l05175"></a><span class="lineno"> 5175</span>  sorted_savings_.swap(next_savings_);</div>
|
|
<div class="line"><a name="l05176"></a><span class="lineno"> 5176</span>  <a class="code" href="namespacegtl.html#a92a0e7b0e74024284adc849a4499940f">gtl::STLClearObject</a>(&next_savings_);</div>
|
|
<div class="line"><a name="l05177"></a><span class="lineno"> 5177</span>  index_in_sorted_savings_ = 0;</div>
|
|
<div class="line"><a name="l05178"></a><span class="lineno"> 5178</span>  </div>
|
|
<div class="line"><a name="l05179"></a><span class="lineno"> 5179</span>  std::sort(sorted_savings_.begin(), sorted_savings_.end());</div>
|
|
<div class="line"><a name="l05180"></a><span class="lineno"> 5180</span>  next_saving_type_and_index_for_arc_.clear();</div>
|
|
<div class="line"><a name="l05181"></a><span class="lineno"> 5181</span>  next_saving_type_and_index_for_arc_.resize(</div>
|
|
<div class="line"><a name="l05182"></a><span class="lineno"> 5182</span>  costs_and_savings_per_arc_.size(), {-1, -1});</div>
|
|
<div class="line"><a name="l05183"></a><span class="lineno"> 5183</span>  }</div>
|
|
<div class="line"><a name="l05184"></a><span class="lineno"> 5184</span>  }</div>
|
|
<div class="line"><a name="l05185"></a><span class="lineno"> 5185</span>  UpdateReinjectedSavings();</div>
|
|
<div class="line"><a name="l05186"></a><span class="lineno"> 5186</span>  to_update_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l05187"></a><span class="lineno"> 5187</span>  }</div>
|
|
<div class="line"><a name="l05188"></a><span class="lineno"> 5188</span>  </div>
|
|
<div class="line"><a name="l05189"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#abf0869704ce65d912e6dcc71945ee737"> 5189</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#abf0869704ce65d912e6dcc71945ee737">UpdateWithType</a>(<span class="keywordtype">int</span> type) {</div>
|
|
<div class="line"><a name="l05190"></a><span class="lineno"> 5190</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!single_vehicle_type_);</div>
|
|
<div class="line"><a name="l05191"></a><span class="lineno"> 5191</span>  Update(<span class="comment">/*update_best_saving*/</span> <span class="keyword">true</span>, type);</div>
|
|
<div class="line"><a name="l05192"></a><span class="lineno"> 5192</span>  }</div>
|
|
<div class="line"><a name="l05193"></a><span class="lineno"> 5193</span>  </div>
|
|
<div class="line"><a name="l05194"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ada63207817608e2ee55de24fc53b0ca0"> 5194</a></span>  <span class="keyword">const</span> std::vector<Saving>& <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ada63207817608e2ee55de24fc53b0ca0">GetSortedSavingsForVehicleType</a>(<span class="keywordtype">int</span> type) {</div>
|
|
<div class="line"><a name="l05195"></a><span class="lineno"> 5195</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(sorted_) << <span class="stringliteral">"Savings not sorted yet!"</span>;</div>
|
|
<div class="line"><a name="l05196"></a><span class="lineno"> 5196</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(type, vehicle_types_);</div>
|
|
<div class="line"><a name="l05197"></a><span class="lineno"> 5197</span>  <span class="keywordflow">return</span> sorted_savings_per_vehicle_type_[type];</div>
|
|
<div class="line"><a name="l05198"></a><span class="lineno"> 5198</span>  }</div>
|
|
<div class="line"><a name="l05199"></a><span class="lineno"> 5199</span>  </div>
|
|
<div class="line"><a name="l05200"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a3ce766f398d38eedd815c8e89f5e2bc4"> 5200</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a3ce766f398d38eedd815c8e89f5e2bc4">ReinjectSkippedSavingsStartingAt</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node) {</div>
|
|
<div class="line"><a name="l05201"></a><span class="lineno"> 5201</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(outgoing_new_reinjected_savings_ == <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l05202"></a><span class="lineno"> 5202</span>  outgoing_new_reinjected_savings_ = &(skipped_savings_starting_at_[node]);</div>
|
|
<div class="line"><a name="l05203"></a><span class="lineno"> 5203</span>  }</div>
|
|
<div class="line"><a name="l05204"></a><span class="lineno"> 5204</span>  </div>
|
|
<div class="line"><a name="l05205"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a678bb2c3921bb34d05a9af1802b188dc"> 5205</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a678bb2c3921bb34d05a9af1802b188dc">ReinjectSkippedSavingsEndingAt</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node) {</div>
|
|
<div class="line"><a name="l05206"></a><span class="lineno"> 5206</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(incoming_new_reinjected_savings_ == <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l05207"></a><span class="lineno"> 5207</span>  incoming_new_reinjected_savings_ = &(skipped_savings_ending_at_[node]);</div>
|
|
<div class="line"><a name="l05208"></a><span class="lineno"> 5208</span>  }</div>
|
|
<div class="line"><a name="l05209"></a><span class="lineno"> 5209</span>  </div>
|
|
<div class="line"><a name="l05210"></a><span class="lineno"> 5210</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l05211"></a><span class="lineno"> 5211</span>  <span class="keyword">struct </span>SavingAndArc {</div>
|
|
<div class="line"><a name="l05212"></a><span class="lineno"> 5212</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a2520cfaec0cd23cd56fd1eec8db79be4">Saving</a> saving;</div>
|
|
<div class="line"><a name="l05213"></a><span class="lineno"> 5213</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> arc_index;</div>
|
|
<div class="line"><a name="l05214"></a><span class="lineno"> 5214</span>  </div>
|
|
<div class="line"><a name="l05215"></a><span class="lineno"> 5215</span>  <span class="keywordtype">bool</span> operator<(<span class="keyword">const</span> SavingAndArc& other)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l05216"></a><span class="lineno"> 5216</span>  <span class="keywordflow">return</span> std::tie(saving, arc_index) <</div>
|
|
<div class="line"><a name="l05217"></a><span class="lineno"> 5217</span>  std::tie(other.saving, other.arc_index);</div>
|
|
<div class="line"><a name="l05218"></a><span class="lineno"> 5218</span>  }</div>
|
|
<div class="line"><a name="l05219"></a><span class="lineno"> 5219</span>  };</div>
|
|
<div class="line"><a name="l05220"></a><span class="lineno"> 5220</span>  </div>
|
|
<div class="line"><a name="l05221"></a><span class="lineno"> 5221</span>  <span class="comment">// Skips the Saving for the arc before_node-->after_node, by adding it to the</span></div>
|
|
<div class="line"><a name="l05222"></a><span class="lineno"> 5222</span>  <span class="comment">// skipped_savings_ vector of the nodes, if they're uncontained.</span></div>
|
|
<div class="line"><a name="l05223"></a><span class="lineno"> 5223</span>  <span class="keywordtype">void</span> SkipSavingForArc(<span class="keyword">const</span> SavingAndArc& saving_and_arc) {</div>
|
|
<div class="line"><a name="l05224"></a><span class="lineno"> 5224</span>  <span class="keyword">const</span> Saving& saving = saving_and_arc.saving;</div>
|
|
<div class="line"><a name="l05225"></a><span class="lineno"> 5225</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> before_node = savings_db_->GetBeforeNodeFromSaving(saving);</div>
|
|
<div class="line"><a name="l05226"></a><span class="lineno"> 5226</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> after_node = savings_db_->GetAfterNodeFromSaving(saving);</div>
|
|
<div class="line"><a name="l05227"></a><span class="lineno"> 5227</span>  <span class="keywordflow">if</span> (!savings_db_->Contains(before_node)) {</div>
|
|
<div class="line"><a name="l05228"></a><span class="lineno"> 5228</span>  skipped_savings_starting_at_[before_node].push_back(saving_and_arc);</div>
|
|
<div class="line"><a name="l05229"></a><span class="lineno"> 5229</span>  }</div>
|
|
<div class="line"><a name="l05230"></a><span class="lineno"> 5230</span>  <span class="keywordflow">if</span> (!savings_db_->Contains(after_node)) {</div>
|
|
<div class="line"><a name="l05231"></a><span class="lineno"> 5231</span>  skipped_savings_ending_at_[after_node].push_back(saving_and_arc);</div>
|
|
<div class="line"><a name="l05232"></a><span class="lineno"> 5232</span>  }</div>
|
|
<div class="line"><a name="l05233"></a><span class="lineno"> 5233</span>  }</div>
|
|
<div class="line"><a name="l05234"></a><span class="lineno"> 5234</span>  </div>
|
|
<div class="line"><a name="l05235"></a><span class="lineno"> 5235</span>  <span class="comment">// Called within Update() when update_best_saving is true, this method updates</span></div>
|
|
<div class="line"><a name="l05236"></a><span class="lineno"> 5236</span>  <span class="comment">// the next_savings_ and skipped savings vectors for a given arc_index and</span></div>
|
|
<div class="line"><a name="l05237"></a><span class="lineno"> 5237</span>  <span class="comment">// vehicle type.</span></div>
|
|
<div class="line"><a name="l05238"></a><span class="lineno"> 5238</span>  <span class="comment">// When a Saving with the right type has already been added to next_savings_</span></div>
|
|
<div class="line"><a name="l05239"></a><span class="lineno"> 5239</span>  <span class="comment">// for this arc, no action is needed on next_savings_.</span></div>
|
|
<div class="line"><a name="l05240"></a><span class="lineno"> 5240</span>  <span class="comment">// Otherwise, if such a Saving exists, GetNextSavingForArcWithType() will find</span></div>
|
|
<div class="line"><a name="l05241"></a><span class="lineno"> 5241</span>  <span class="comment">// and assign it to next_saving, which is then used to update next_savings_.</span></div>
|
|
<div class="line"><a name="l05242"></a><span class="lineno"> 5242</span>  <span class="comment">// Finally, the right Saving is skipped for this arc: if looking for a</span></div>
|
|
<div class="line"><a name="l05243"></a><span class="lineno"> 5243</span>  <span class="comment">// specific type (i.e. type != -1), next_saving (which has the correct type)</span></div>
|
|
<div class="line"><a name="l05244"></a><span class="lineno"> 5244</span>  <span class="comment">// is skipped, otherwise the current_saving_ is.</span></div>
|
|
<div class="line"><a name="l05245"></a><span class="lineno"> 5245</span>  <span class="keywordtype">void</span> UpdateNextAndSkippedSavingsForArcWithType(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> arc_index, <span class="keywordtype">int</span> type) {</div>
|
|
<div class="line"><a name="l05246"></a><span class="lineno"> 5246</span>  <span class="keywordflow">if</span> (single_vehicle_type_) {</div>
|
|
<div class="line"><a name="l05247"></a><span class="lineno"> 5247</span>  <span class="comment">// No next Saving, skip the current Saving.</span></div>
|
|
<div class="line"><a name="l05248"></a><span class="lineno"> 5248</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(type, -1);</div>
|
|
<div class="line"><a name="l05249"></a><span class="lineno"> 5249</span>  SkipSavingForArc(current_saving_);</div>
|
|
<div class="line"><a name="l05250"></a><span class="lineno"> 5250</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l05251"></a><span class="lineno"> 5251</span>  }</div>
|
|
<div class="line"><a name="l05252"></a><span class="lineno"> 5252</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(arc_index, 0);</div>
|
|
<div class="line"><a name="l05253"></a><span class="lineno"> 5253</span>  <span class="keyword">auto</span>& type_and_index = next_saving_type_and_index_for_arc_[arc_index];</div>
|
|
<div class="line"><a name="l05254"></a><span class="lineno"> 5254</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> previous_index = type_and_index.second;</div>
|
|
<div class="line"><a name="l05255"></a><span class="lineno"> 5255</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> previous_type = type_and_index.first;</div>
|
|
<div class="line"><a name="l05256"></a><span class="lineno"> 5256</span>  <span class="keywordtype">bool</span> next_saving_added = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l05257"></a><span class="lineno"> 5257</span>  Saving next_saving;</div>
|
|
<div class="line"><a name="l05258"></a><span class="lineno"> 5258</span>  </div>
|
|
<div class="line"><a name="l05259"></a><span class="lineno"> 5259</span>  <span class="keywordflow">if</span> (previous_index >= 0) {</div>
|
|
<div class="line"><a name="l05260"></a><span class="lineno"> 5260</span>  <span class="comment">// Next Saving already added for this arc.</span></div>
|
|
<div class="line"><a name="l05261"></a><span class="lineno"> 5261</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(previous_type, 0);</div>
|
|
<div class="line"><a name="l05262"></a><span class="lineno"> 5262</span>  <span class="keywordflow">if</span> (type == -1 || previous_type == type) {</div>
|
|
<div class="line"><a name="l05263"></a><span class="lineno"> 5263</span>  <span class="comment">// Not looking for a specific type, or correct type already in</span></div>
|
|
<div class="line"><a name="l05264"></a><span class="lineno"> 5264</span>  <span class="comment">// next_savings_.</span></div>
|
|
<div class="line"><a name="l05265"></a><span class="lineno"> 5265</span>  next_saving_added = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l05266"></a><span class="lineno"> 5266</span>  next_saving = next_savings_[previous_index].saving;</div>
|
|
<div class="line"><a name="l05267"></a><span class="lineno"> 5267</span>  }</div>
|
|
<div class="line"><a name="l05268"></a><span class="lineno"> 5268</span>  }</div>
|
|
<div class="line"><a name="l05269"></a><span class="lineno"> 5269</span>  </div>
|
|
<div class="line"><a name="l05270"></a><span class="lineno"> 5270</span>  <span class="keywordflow">if</span> (!next_saving_added &&</div>
|
|
<div class="line"><a name="l05271"></a><span class="lineno"> 5271</span>  GetNextSavingForArcWithType(arc_index, type, &next_saving)) {</div>
|
|
<div class="line"><a name="l05272"></a><span class="lineno"> 5272</span>  type_and_index.first = savings_db_->GetVehicleTypeFromSaving(next_saving);</div>
|
|
<div class="line"><a name="l05273"></a><span class="lineno"> 5273</span>  <span class="keywordflow">if</span> (previous_index >= 0) {</div>
|
|
<div class="line"><a name="l05274"></a><span class="lineno"> 5274</span>  <span class="comment">// Update the previous saving.</span></div>
|
|
<div class="line"><a name="l05275"></a><span class="lineno"> 5275</span>  next_savings_[previous_index] = {next_saving, arc_index};</div>
|
|
<div class="line"><a name="l05276"></a><span class="lineno"> 5276</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l05277"></a><span class="lineno"> 5277</span>  <span class="comment">// Insert the new next Saving for this arc.</span></div>
|
|
<div class="line"><a name="l05278"></a><span class="lineno"> 5278</span>  type_and_index.second = next_savings_.size();</div>
|
|
<div class="line"><a name="l05279"></a><span class="lineno"> 5279</span>  next_savings_.push_back({next_saving, arc_index});</div>
|
|
<div class="line"><a name="l05280"></a><span class="lineno"> 5280</span>  }</div>
|
|
<div class="line"><a name="l05281"></a><span class="lineno"> 5281</span>  next_saving_added = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l05282"></a><span class="lineno"> 5282</span>  }</div>
|
|
<div class="line"><a name="l05283"></a><span class="lineno"> 5283</span>  </div>
|
|
<div class="line"><a name="l05284"></a><span class="lineno"> 5284</span>  <span class="comment">// Skip the Saving based on the vehicle type.</span></div>
|
|
<div class="line"><a name="l05285"></a><span class="lineno"> 5285</span>  <span class="keywordflow">if</span> (type == -1) {</div>
|
|
<div class="line"><a name="l05286"></a><span class="lineno"> 5286</span>  <span class="comment">// Skip the current Saving.</span></div>
|
|
<div class="line"><a name="l05287"></a><span class="lineno"> 5287</span>  SkipSavingForArc(current_saving_);</div>
|
|
<div class="line"><a name="l05288"></a><span class="lineno"> 5288</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l05289"></a><span class="lineno"> 5289</span>  <span class="comment">// Skip the Saving with the correct type, already added to next_savings_</span></div>
|
|
<div class="line"><a name="l05290"></a><span class="lineno"> 5290</span>  <span class="comment">// if it was found.</span></div>
|
|
<div class="line"><a name="l05291"></a><span class="lineno"> 5291</span>  <span class="keywordflow">if</span> (next_saving_added) {</div>
|
|
<div class="line"><a name="l05292"></a><span class="lineno"> 5292</span>  SkipSavingForArc({next_saving, arc_index});</div>
|
|
<div class="line"><a name="l05293"></a><span class="lineno"> 5293</span>  }</div>
|
|
<div class="line"><a name="l05294"></a><span class="lineno"> 5294</span>  }</div>
|
|
<div class="line"><a name="l05295"></a><span class="lineno"> 5295</span>  }</div>
|
|
<div class="line"><a name="l05296"></a><span class="lineno"> 5296</span>  </div>
|
|
<div class="line"><a name="l05297"></a><span class="lineno"> 5297</span>  <span class="keywordtype">void</span> UpdateReinjectedSavings() {</div>
|
|
<div class="line"><a name="l05298"></a><span class="lineno"> 5298</span>  UpdateGivenReinjectedSavings(incoming_new_reinjected_savings_,</div>
|
|
<div class="line"><a name="l05299"></a><span class="lineno"> 5299</span>  &incoming_reinjected_savings_,</div>
|
|
<div class="line"><a name="l05300"></a><span class="lineno"> 5300</span>  using_incoming_reinjected_saving_);</div>
|
|
<div class="line"><a name="l05301"></a><span class="lineno"> 5301</span>  UpdateGivenReinjectedSavings(outgoing_new_reinjected_savings_,</div>
|
|
<div class="line"><a name="l05302"></a><span class="lineno"> 5302</span>  &outgoing_reinjected_savings_,</div>
|
|
<div class="line"><a name="l05303"></a><span class="lineno"> 5303</span>  !using_incoming_reinjected_saving_);</div>
|
|
<div class="line"><a name="l05304"></a><span class="lineno"> 5304</span>  incoming_new_reinjected_savings_ = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l05305"></a><span class="lineno"> 5305</span>  outgoing_new_reinjected_savings_ = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l05306"></a><span class="lineno"> 5306</span>  }</div>
|
|
<div class="line"><a name="l05307"></a><span class="lineno"> 5307</span>  </div>
|
|
<div class="line"><a name="l05308"></a><span class="lineno"> 5308</span>  <span class="keywordtype">void</span> UpdateGivenReinjectedSavings(</div>
|
|
<div class="line"><a name="l05309"></a><span class="lineno"> 5309</span>  std::deque<SavingAndArc>* new_reinjected_savings,</div>
|
|
<div class="line"><a name="l05310"></a><span class="lineno"> 5310</span>  std::deque<SavingAndArc>** reinjected_savings,</div>
|
|
<div class="line"><a name="l05311"></a><span class="lineno"> 5311</span>  <span class="keywordtype">bool</span> using_reinjected_savings) {</div>
|
|
<div class="line"><a name="l05312"></a><span class="lineno"> 5312</span>  <span class="keywordflow">if</span> (new_reinjected_savings == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l05313"></a><span class="lineno"> 5313</span>  <span class="comment">// No new reinjected savings, update the previous ones if needed.</span></div>
|
|
<div class="line"><a name="l05314"></a><span class="lineno"> 5314</span>  <span class="keywordflow">if</span> (*reinjected_savings != <span class="keyword">nullptr</span> && using_reinjected_savings) {</div>
|
|
<div class="line"><a name="l05315"></a><span class="lineno"> 5315</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!(*reinjected_savings)->empty());</div>
|
|
<div class="line"><a name="l05316"></a><span class="lineno"> 5316</span>  (*reinjected_savings)->pop_front();</div>
|
|
<div class="line"><a name="l05317"></a><span class="lineno"> 5317</span>  <span class="keywordflow">if</span> ((*reinjected_savings)->empty()) {</div>
|
|
<div class="line"><a name="l05318"></a><span class="lineno"> 5318</span>  *reinjected_savings = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l05319"></a><span class="lineno"> 5319</span>  }</div>
|
|
<div class="line"><a name="l05320"></a><span class="lineno"> 5320</span>  }</div>
|
|
<div class="line"><a name="l05321"></a><span class="lineno"> 5321</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l05322"></a><span class="lineno"> 5322</span>  }</div>
|
|
<div class="line"><a name="l05323"></a><span class="lineno"> 5323</span>  </div>
|
|
<div class="line"><a name="l05324"></a><span class="lineno"> 5324</span>  <span class="comment">// New savings reinjected.</span></div>
|
|
<div class="line"><a name="l05325"></a><span class="lineno"> 5325</span>  <span class="comment">// Forget about the previous reinjected savings and add the new ones if</span></div>
|
|
<div class="line"><a name="l05326"></a><span class="lineno"> 5326</span>  <span class="comment">// there are any.</span></div>
|
|
<div class="line"><a name="l05327"></a><span class="lineno"> 5327</span>  <span class="keywordflow">if</span> (*reinjected_savings != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l05328"></a><span class="lineno"> 5328</span>  (*reinjected_savings)->clear();</div>
|
|
<div class="line"><a name="l05329"></a><span class="lineno"> 5329</span>  }</div>
|
|
<div class="line"><a name="l05330"></a><span class="lineno"> 5330</span>  *reinjected_savings = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l05331"></a><span class="lineno"> 5331</span>  <span class="keywordflow">if</span> (!new_reinjected_savings->empty()) {</div>
|
|
<div class="line"><a name="l05332"></a><span class="lineno"> 5332</span>  *reinjected_savings = new_reinjected_savings;</div>
|
|
<div class="line"><a name="l05333"></a><span class="lineno"> 5333</span>  }</div>
|
|
<div class="line"><a name="l05334"></a><span class="lineno"> 5334</span>  }</div>
|
|
<div class="line"><a name="l05335"></a><span class="lineno"> 5335</span>  </div>
|
|
<div class="line"><a name="l05336"></a><span class="lineno"> 5336</span>  <span class="keywordtype">bool</span> HasReinjectedSavings() {</div>
|
|
<div class="line"><a name="l05337"></a><span class="lineno"> 5337</span>  <span class="keywordflow">return</span> outgoing_reinjected_savings_ != <span class="keyword">nullptr</span> ||</div>
|
|
<div class="line"><a name="l05338"></a><span class="lineno"> 5338</span>  incoming_reinjected_savings_ != <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l05339"></a><span class="lineno"> 5339</span>  }</div>
|
|
<div class="line"><a name="l05340"></a><span class="lineno"> 5340</span>  </div>
|
|
<div class="line"><a name="l05341"></a><span class="lineno"> 5341</span>  <span class="keywordtype">void</span> UpdateArcIndicesCostsAndSavings(</div>
|
|
<div class="line"><a name="l05342"></a><span class="lineno"> 5342</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> before_node, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> after_node,</div>
|
|
<div class="line"><a name="l05343"></a><span class="lineno"> 5343</span>  <span class="keyword">const</span> std::pair<int64, Saving>& cost_and_saving) {</div>
|
|
<div class="line"><a name="l05344"></a><span class="lineno"> 5344</span>  <span class="keywordflow">if</span> (single_vehicle_type_) {</div>
|
|
<div class="line"><a name="l05345"></a><span class="lineno"> 5345</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l05346"></a><span class="lineno"> 5346</span>  }</div>
|
|
<div class="line"><a name="l05347"></a><span class="lineno"> 5347</span>  absl::flat_hash_map<int, int>& arc_indices =</div>
|
|
<div class="line"><a name="l05348"></a><span class="lineno"> 5348</span>  arc_indices_per_before_node_[before_node];</div>
|
|
<div class="line"><a name="l05349"></a><span class="lineno"> 5349</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& arc_inserted = arc_indices.insert(</div>
|
|
<div class="line"><a name="l05350"></a><span class="lineno"> 5350</span>  std::make_pair(after_node, costs_and_savings_per_arc_.size()));</div>
|
|
<div class="line"><a name="l05351"></a><span class="lineno"> 5351</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = arc_inserted.first->second;</div>
|
|
<div class="line"><a name="l05352"></a><span class="lineno"> 5352</span>  <span class="keywordflow">if</span> (arc_inserted.second) {</div>
|
|
<div class="line"><a name="l05353"></a><span class="lineno"> 5353</span>  costs_and_savings_per_arc_.push_back({cost_and_saving});</div>
|
|
<div class="line"><a name="l05354"></a><span class="lineno"> 5354</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l05355"></a><span class="lineno"> 5355</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, costs_and_savings_per_arc_.size());</div>
|
|
<div class="line"><a name="l05356"></a><span class="lineno"> 5356</span>  costs_and_savings_per_arc_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].push_back(cost_and_saving);</div>
|
|
<div class="line"><a name="l05357"></a><span class="lineno"> 5357</span>  }</div>
|
|
<div class="line"><a name="l05358"></a><span class="lineno"> 5358</span>  }</div>
|
|
<div class="line"><a name="l05359"></a><span class="lineno"> 5359</span>  </div>
|
|
<div class="line"><a name="l05360"></a><span class="lineno"> 5360</span>  <span class="keywordtype">bool</span> GetNextSavingForArcWithType(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> arc_index, <span class="keywordtype">int</span> type,</div>
|
|
<div class="line"><a name="l05361"></a><span class="lineno"> 5361</span>  Saving* next_saving) {</div>
|
|
<div class="line"><a name="l05362"></a><span class="lineno"> 5362</span>  std::vector<std::pair<int64, Saving>>& costs_and_savings =</div>
|
|
<div class="line"><a name="l05363"></a><span class="lineno"> 5363</span>  costs_and_savings_per_arc_[arc_index];</div>
|
|
<div class="line"><a name="l05364"></a><span class="lineno"> 5364</span>  </div>
|
|
<div class="line"><a name="l05365"></a><span class="lineno"> 5365</span>  <span class="keywordtype">bool</span> found_saving = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l05366"></a><span class="lineno"> 5366</span>  <span class="keywordflow">while</span> (!costs_and_savings.empty() && !found_saving) {</div>
|
|
<div class="line"><a name="l05367"></a><span class="lineno"> 5367</span>  <span class="keyword">const</span> Saving& saving = costs_and_savings.back().second;</div>
|
|
<div class="line"><a name="l05368"></a><span class="lineno"> 5368</span>  <span class="keywordflow">if</span> (type == -1 || savings_db_->GetVehicleTypeFromSaving(saving) == type) {</div>
|
|
<div class="line"><a name="l05369"></a><span class="lineno"> 5369</span>  *next_saving = saving;</div>
|
|
<div class="line"><a name="l05370"></a><span class="lineno"> 5370</span>  found_saving = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l05371"></a><span class="lineno"> 5371</span>  }</div>
|
|
<div class="line"><a name="l05372"></a><span class="lineno"> 5372</span>  costs_and_savings.pop_back();</div>
|
|
<div class="line"><a name="l05373"></a><span class="lineno"> 5373</span>  }</div>
|
|
<div class="line"><a name="l05374"></a><span class="lineno"> 5374</span>  <span class="keywordflow">return</span> found_saving;</div>
|
|
<div class="line"><a name="l05375"></a><span class="lineno"> 5375</span>  }</div>
|
|
<div class="line"><a name="l05376"></a><span class="lineno"> 5376</span>  </div>
|
|
<div class="line"><a name="l05377"></a><span class="lineno"> 5377</span>  <span class="keyword">const</span> SavingsFilteredHeuristic* <span class="keyword">const</span> savings_db_;</div>
|
|
<div class="line"><a name="l05378"></a><span class="lineno"> 5378</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle_types_;</div>
|
|
<div class="line"><a name="l05379"></a><span class="lineno"> 5379</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> index_in_sorted_savings_;</div>
|
|
<div class="line"><a name="l05380"></a><span class="lineno"> 5380</span>  std::vector<std::vector<Saving>> sorted_savings_per_vehicle_type_;</div>
|
|
<div class="line"><a name="l05381"></a><span class="lineno"> 5381</span>  std::vector<SavingAndArc> sorted_savings_;</div>
|
|
<div class="line"><a name="l05382"></a><span class="lineno"> 5382</span>  std::vector<SavingAndArc> next_savings_;</div>
|
|
<div class="line"><a name="l05383"></a><span class="lineno"> 5383</span>  std::vector<std::pair<<span class="comment">/*type*/</span> int, <span class="comment">/*index*/</span> <span class="keywordtype">int</span>>></div>
|
|
<div class="line"><a name="l05384"></a><span class="lineno"> 5384</span>  next_saving_type_and_index_for_arc_;</div>
|
|
<div class="line"><a name="l05385"></a><span class="lineno"> 5385</span>  SavingAndArc current_saving_;</div>
|
|
<div class="line"><a name="l05386"></a><span class="lineno"> 5386</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> single_vehicle_type_;</div>
|
|
<div class="line"><a name="l05387"></a><span class="lineno"> 5387</span>  std::vector<std::vector<std::pair<<span class="comment">/*cost*/</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>, Saving>>></div>
|
|
<div class="line"><a name="l05388"></a><span class="lineno"> 5388</span>  costs_and_savings_per_arc_;</div>
|
|
<div class="line"><a name="l05389"></a><span class="lineno"> 5389</span>  std::vector<absl::flat_hash_map<<span class="comment">/*after_node*/</span> int, <span class="comment">/*arc_index*/</span> <span class="keywordtype">int</span>>></div>
|
|
<div class="line"><a name="l05390"></a><span class="lineno"> 5390</span>  arc_indices_per_before_node_;</div>
|
|
<div class="line"><a name="l05391"></a><span class="lineno"> 5391</span>  std::vector<std::deque<SavingAndArc>> skipped_savings_starting_at_;</div>
|
|
<div class="line"><a name="l05392"></a><span class="lineno"> 5392</span>  std::vector<std::deque<SavingAndArc>> skipped_savings_ending_at_;</div>
|
|
<div class="line"><a name="l05393"></a><span class="lineno"> 5393</span>  std::deque<SavingAndArc>* outgoing_reinjected_savings_;</div>
|
|
<div class="line"><a name="l05394"></a><span class="lineno"> 5394</span>  std::deque<SavingAndArc>* incoming_reinjected_savings_;</div>
|
|
<div class="line"><a name="l05395"></a><span class="lineno"> 5395</span>  <span class="keywordtype">bool</span> using_incoming_reinjected_saving_;</div>
|
|
<div class="line"><a name="l05396"></a><span class="lineno"> 5396</span>  std::deque<SavingAndArc>* outgoing_new_reinjected_savings_;</div>
|
|
<div class="line"><a name="l05397"></a><span class="lineno"> 5397</span>  std::deque<SavingAndArc>* incoming_new_reinjected_savings_;</div>
|
|
<div class="line"><a name="l05398"></a><span class="lineno"> 5398</span>  <span class="keywordtype">bool</span> sorted_;</div>
|
|
<div class="line"><a name="l05399"></a><span class="lineno"> 5399</span>  <span class="keywordtype">bool</span> to_update_;</div>
|
|
<div class="line"><a name="l05400"></a><span class="lineno"> 5400</span> };</div>
|
|
<div class="line"><a name="l05401"></a><span class="lineno"> 5401</span>  </div>
|
|
<div class="line"><a name="l05402"></a><span class="lineno"> 5402</span> <span class="comment">// SavingsFilteredHeuristic</span></div>
|
|
<div class="line"><a name="l05403"></a><span class="lineno"> 5403</span>  </div>
|
|
<div class="line"><a name="l05404"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic.html#ac4bf3a386c437ec559509f20d6475e85"> 5404</a></span> SavingsFilteredHeuristic::SavingsFilteredHeuristic(</div>
|
|
<div class="line"><a name="l05405"></a><span class="lineno"> 5405</span>  <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_index_manager.html">RoutingIndexManager</a>* manager,</div>
|
|
<div class="line"><a name="l05406"></a><span class="lineno"> 5406</span>  <a class="code" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html">SavingsParameters</a> <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>, <a class="code" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager)</div>
|
|
<div class="line"><a name="l05407"></a><span class="lineno"> 5407</span>  : <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html">RoutingFilteredHeuristic</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, filter_manager),</div>
|
|
<div class="line"><a name="l05408"></a><span class="lineno"> 5408</span>  vehicle_type_curator_(nullptr),</div>
|
|
<div class="line"><a name="l05409"></a><span class="lineno"> 5409</span>  manager_(manager),</div>
|
|
<div class="line"><a name="l05410"></a><span class="lineno"> 5410</span>  savings_params_(<a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>) {</div>
|
|
<div class="line"><a name="l05411"></a><span class="lineno"> 5411</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(savings_params_.<a class="code" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a0aa77787d0df1b489476bfc6714ef819">neighbors_ratio</a>, 0);</div>
|
|
<div class="line"><a name="l05412"></a><span class="lineno"> 5412</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(savings_params_.<a class="code" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a0aa77787d0df1b489476bfc6714ef819">neighbors_ratio</a>, 1);</div>
|
|
<div class="line"><a name="l05413"></a><span class="lineno"> 5413</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(savings_params_.<a class="code" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a33bd2c84a2be54d10959e5c0d81f86b5">max_memory_usage_bytes</a>, 0);</div>
|
|
<div class="line"><a name="l05414"></a><span class="lineno"> 5414</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(savings_params_.<a class="code" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a222a2814083966736ad9aefde1dde290">arc_coefficient</a>, 0);</div>
|
|
<div class="line"><a name="l05415"></a><span class="lineno"> 5415</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>-><a class="code" href="classoperations__research_1_1_routing_model.html#a354dd8c252cf59b748602b342db6019d">Size</a>();</div>
|
|
<div class="line"><a name="l05416"></a><span class="lineno"> 5416</span>  size_squared_ = size * size;</div>
|
|
<div class="line"><a name="l05417"></a><span class="lineno"> 5417</span> }</div>
|
|
<div class="line"><a name="l05418"></a><span class="lineno"> 5418</span>  </div>
|
|
<div class="line"><a name="l05419"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic.html#a69f73ddf69522d81d6dd919c316cae8a"> 5419</a></span> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a69f73ddf69522d81d6dd919c316cae8a">SavingsFilteredHeuristic::~SavingsFilteredHeuristic</a>() {}</div>
|
|
<div class="line"><a name="l05420"></a><span class="lineno"> 5420</span>  </div>
|
|
<div class="line"><a name="l05421"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289"> 5421</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">SavingsFilteredHeuristic::BuildSolutionInternal</a>() {</div>
|
|
<div class="line"><a name="l05422"></a><span class="lineno"> 5422</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a> == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l05423"></a><span class="lineno"> 5423</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a> = absl::make_unique<VehicleTypeCurator>(</div>
|
|
<div class="line"><a name="l05424"></a><span class="lineno"> 5424</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->GetVehicleTypeContainer());</div>
|
|
<div class="line"><a name="l05425"></a><span class="lineno"> 5425</span>  }</div>
|
|
<div class="line"><a name="l05426"></a><span class="lineno"> 5426</span>  <span class="comment">// Only store empty vehicles in the vehicle_type_curator_.</span></div>
|
|
<div class="line"><a name="l05427"></a><span class="lineno"> 5427</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a>->Reset(</div>
|
|
<div class="line"><a name="l05428"></a><span class="lineno"> 5428</span>  [<span class="keyword">this</span>](<span class="keywordtype">int</span> vehicle) { <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(vehicle); });</div>
|
|
<div class="line"><a name="l05429"></a><span class="lineno"> 5429</span>  ComputeSavings();</div>
|
|
<div class="line"><a name="l05430"></a><span class="lineno"> 5430</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#aeb4e0e0b0899af694678658062b4f037">BuildRoutesFromSavings</a>();</div>
|
|
<div class="line"><a name="l05431"></a><span class="lineno"> 5431</span>  <span class="comment">// Free all the space used to store the Savings in the container.</span></div>
|
|
<div class="line"><a name="l05432"></a><span class="lineno"> 5432</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>.reset();</div>
|
|
<div class="line"><a name="l05433"></a><span class="lineno"> 5433</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a97049801609b8cb68c0428970f916fd4">MakeUnassignedNodesUnperformed</a>();</div>
|
|
<div class="line"><a name="l05434"></a><span class="lineno"> 5434</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l05435"></a><span class="lineno"> 5435</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#abaca104cf41b5a5e3554f8ad72cdc28c">MakePartiallyPerformedPairsUnperformed</a>();</div>
|
|
<div class="line"><a name="l05436"></a><span class="lineno"> 5436</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>();</div>
|
|
<div class="line"><a name="l05437"></a><span class="lineno"> 5437</span> }</div>
|
|
<div class="line"><a name="l05438"></a><span class="lineno"> 5438</span>  </div>
|
|
<div class="line"><a name="l05439"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic.html#a01596b614ecce63ba83d5c16b242507c"> 5439</a></span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a01596b614ecce63ba83d5c16b242507c">SavingsFilteredHeuristic::StartNewRouteWithBestVehicleOfType</a>(</div>
|
|
<div class="line"><a name="l05440"></a><span class="lineno"> 5440</span>  <span class="keywordtype">int</span> type, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> before_node, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> after_node) {</div>
|
|
<div class="line"><a name="l05441"></a><span class="lineno"> 5441</span>  <span class="keyword">auto</span> vehicle_is_compatible = [<span class="keyword">this</span>, before_node, after_node](<span class="keywordtype">int</span> vehicle) {</div>
|
|
<div class="line"><a name="l05442"></a><span class="lineno"> 5442</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a8cded3d3d6746c179a8ec0eddad24342">VehicleVar</a>(before_node)-><a class="code" href="classoperations__research_1_1_int_var.html#a7005edfb93d09a9ca1ecb989a9bc6733">Contains</a>(vehicle) ||</div>
|
|
<div class="line"><a name="l05443"></a><span class="lineno"> 5443</span>  !<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a8cded3d3d6746c179a8ec0eddad24342">VehicleVar</a>(after_node)-><a class="code" href="classoperations__research_1_1_int_var.html#a7005edfb93d09a9ca1ecb989a9bc6733">Contains</a>(vehicle)) {</div>
|
|
<div class="line"><a name="l05444"></a><span class="lineno"> 5444</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l05445"></a><span class="lineno"> 5445</span>  }</div>
|
|
<div class="line"><a name="l05446"></a><span class="lineno"> 5446</span>  <span class="comment">// Try to commit the arc on this vehicle.</span></div>
|
|
<div class="line"><a name="l05447"></a><span class="lineno"> 5447</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(vehicle));</div>
|
|
<div class="line"><a name="l05448"></a><span class="lineno"> 5448</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_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(vehicle);</div>
|
|
<div class="line"><a name="l05449"></a><span class="lineno"> 5449</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_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a1dc8d32892f78532c8ee7a7186158e07">End</a>(vehicle);</div>
|
|
<div class="line"><a name="l05450"></a><span class="lineno"> 5450</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(start, before_node);</div>
|
|
<div class="line"><a name="l05451"></a><span class="lineno"> 5451</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(before_node, after_node);</div>
|
|
<div class="line"><a name="l05452"></a><span class="lineno"> 5452</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(after_node, end);</div>
|
|
<div class="line"><a name="l05453"></a><span class="lineno"> 5453</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>();</div>
|
|
<div class="line"><a name="l05454"></a><span class="lineno"> 5454</span>  };</div>
|
|
<div class="line"><a name="l05455"></a><span class="lineno"> 5455</span>  </div>
|
|
<div class="line"><a name="l05456"></a><span class="lineno"> 5456</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a></div>
|
|
<div class="line"><a name="l05457"></a><span class="lineno"> 5457</span>  ->GetCompatibleVehicleOfType(</div>
|
|
<div class="line"><a name="l05458"></a><span class="lineno"> 5458</span>  type, vehicle_is_compatible,</div>
|
|
<div class="line"><a name="l05459"></a><span class="lineno"> 5459</span>  <span class="comment">/*stop_and_return_vehicle*/</span> [](<span class="keywordtype">int</span>) { <span class="keywordflow">return</span> <span class="keyword">false</span>; })</div>
|
|
<div class="line"><a name="l05460"></a><span class="lineno"> 5460</span>  .first;</div>
|
|
<div class="line"><a name="l05461"></a><span class="lineno"> 5461</span> }</div>
|
|
<div class="line"><a name="l05462"></a><span class="lineno"> 5462</span>  </div>
|
|
<div class="line"><a name="l05463"></a><span class="lineno"> 5463</span> <span class="keywordtype">void</span> SavingsFilteredHeuristic::AddSymmetricArcsToAdjacencyLists(</div>
|
|
<div class="line"><a name="l05464"></a><span class="lineno"> 5464</span>  std::vector<std::vector<int64>>* adjacency_lists) {</div>
|
|
<div class="line"><a name="l05465"></a><span class="lineno"> 5465</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = 0; node < adjacency_lists->size(); node++) {</div>
|
|
<div class="line"><a name="l05466"></a><span class="lineno"> 5466</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> neighbor : (*adjacency_lists)[node]) {</div>
|
|
<div class="line"><a name="l05467"></a><span class="lineno"> 5467</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->IsStart(neighbor) || <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->IsEnd(neighbor)) {</div>
|
|
<div class="line"><a name="l05468"></a><span class="lineno"> 5468</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l05469"></a><span class="lineno"> 5469</span>  }</div>
|
|
<div class="line"><a name="l05470"></a><span class="lineno"> 5470</span>  (*adjacency_lists)[neighbor].push_back(node);</div>
|
|
<div class="line"><a name="l05471"></a><span class="lineno"> 5471</span>  }</div>
|
|
<div class="line"><a name="l05472"></a><span class="lineno"> 5472</span>  }</div>
|
|
<div class="line"><a name="l05473"></a><span class="lineno"> 5473</span>  std::transform(adjacency_lists->begin(), adjacency_lists->end(),</div>
|
|
<div class="line"><a name="l05474"></a><span class="lineno"> 5474</span>  adjacency_lists->begin(), [](std::vector<int64> vec) {</div>
|
|
<div class="line"><a name="l05475"></a><span class="lineno"> 5475</span>  std::sort(vec.begin(), vec.end());</div>
|
|
<div class="line"><a name="l05476"></a><span class="lineno"> 5476</span>  vec.erase(std::unique(vec.begin(), vec.end()), vec.end());</div>
|
|
<div class="line"><a name="l05477"></a><span class="lineno"> 5477</span>  return vec;</div>
|
|
<div class="line"><a name="l05478"></a><span class="lineno"> 5478</span>  });</div>
|
|
<div class="line"><a name="l05479"></a><span class="lineno"> 5479</span> }</div>
|
|
<div class="line"><a name="l05480"></a><span class="lineno"> 5480</span>  </div>
|
|
<div class="line"><a name="l05481"></a><span class="lineno"> 5481</span> <span class="comment">// Computes the savings related to each pair of non-start and non-end nodes.</span></div>
|
|
<div class="line"><a name="l05482"></a><span class="lineno"> 5482</span> <span class="comment">// The savings value for an arc a-->b for a vehicle starting at node s and</span></div>
|
|
<div class="line"><a name="l05483"></a><span class="lineno"> 5483</span> <span class="comment">// ending at node e is:</span></div>
|
|
<div class="line"><a name="l05484"></a><span class="lineno"> 5484</span> <span class="comment">// saving = cost(s-->a-->e) + cost(s-->b-->e) - cost(s-->a-->b-->e), i.e.</span></div>
|
|
<div class="line"><a name="l05485"></a><span class="lineno"> 5485</span> <span class="comment">// saving = cost(a-->e) + cost(s-->b) - cost(a-->b)</span></div>
|
|
<div class="line"><a name="l05486"></a><span class="lineno"> 5486</span> <span class="comment">// The saving value also considers a coefficient for the cost of the arc</span></div>
|
|
<div class="line"><a name="l05487"></a><span class="lineno"> 5487</span> <span class="comment">// a-->b, which results in:</span></div>
|
|
<div class="line"><a name="l05488"></a><span class="lineno"> 5488</span> <span class="comment">// saving = cost(a-->e) + cost(s-->b) - [arc_coefficient_ * cost(a-->b)]</span></div>
|
|
<div class="line"><a name="l05489"></a><span class="lineno"> 5489</span> <span class="comment">// The higher this saving value, the better the arc.</span></div>
|
|
<div class="line"><a name="l05490"></a><span class="lineno"> 5490</span> <span class="comment">// Here, the value stored for the savings is -saving, which are therefore</span></div>
|
|
<div class="line"><a name="l05491"></a><span class="lineno"> 5491</span> <span class="comment">// considered in decreasing order.</span></div>
|
|
<div class="line"><a name="l05492"></a><span class="lineno"> 5492</span> <span class="keywordtype">void</span> SavingsFilteredHeuristic::ComputeSavings() {</div>
|
|
<div class="line"><a name="l05493"></a><span class="lineno"> 5493</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vehicle_types = <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a>->NumTypes();</div>
|
|
<div class="line"><a name="l05494"></a><span class="lineno"> 5494</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a354dd8c252cf59b748602b342db6019d">Size</a>();</div>
|
|
<div class="line"><a name="l05495"></a><span class="lineno"> 5495</span>  </div>
|
|
<div class="line"><a name="l05496"></a><span class="lineno"> 5496</span>  std::vector<int64> uncontained_non_start_end_nodes;</div>
|
|
<div class="line"><a name="l05497"></a><span class="lineno"> 5497</span>  uncontained_non_start_end_nodes.reserve(size);</div>
|
|
<div class="line"><a name="l05498"></a><span class="lineno"> 5498</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < size; node++) {</div>
|
|
<div class="line"><a name="l05499"></a><span class="lineno"> 5499</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->IsStart(node) && !<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->IsEnd(node) && !<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(node)) {</div>
|
|
<div class="line"><a name="l05500"></a><span class="lineno"> 5500</span>  uncontained_non_start_end_nodes.push_back(node);</div>
|
|
<div class="line"><a name="l05501"></a><span class="lineno"> 5501</span>  }</div>
|
|
<div class="line"><a name="l05502"></a><span class="lineno"> 5502</span>  }</div>
|
|
<div class="line"><a name="l05503"></a><span class="lineno"> 5503</span>  </div>
|
|
<div class="line"><a name="l05504"></a><span class="lineno"> 5504</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> saving_neighbors =</div>
|
|
<div class="line"><a name="l05505"></a><span class="lineno"> 5505</span>  <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(MaxNumNeighborsPerNode(num_vehicle_types),</div>
|
|
<div class="line"><a name="l05506"></a><span class="lineno"> 5506</span>  <span class="keyword">static_cast<</span><a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a><span class="keyword">></span>(uncontained_non_start_end_nodes.size()));</div>
|
|
<div class="line"><a name="l05507"></a><span class="lineno"> 5507</span>  </div>
|
|
<div class="line"><a name="l05508"></a><span class="lineno"> 5508</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a> =</div>
|
|
<div class="line"><a name="l05509"></a><span class="lineno"> 5509</span>  absl::make_unique<SavingsContainer<Saving>>(<span class="keyword">this</span>, num_vehicle_types);</div>
|
|
<div class="line"><a name="l05510"></a><span class="lineno"> 5510</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->InitializeContainer(size, saving_neighbors);</div>
|
|
<div class="line"><a name="l05511"></a><span class="lineno"> 5511</span>  </div>
|
|
<div class="line"><a name="l05512"></a><span class="lineno"> 5512</span>  std::vector<std::vector<int64>> adjacency_lists(size);</div>
|
|
<div class="line"><a name="l05513"></a><span class="lineno"> 5513</span>  </div>
|
|
<div class="line"><a name="l05514"></a><span class="lineno"> 5514</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> type = 0; type < num_vehicle_types; ++type) {</div>
|
|
<div class="line"><a name="l05515"></a><span class="lineno"> 5515</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle =</div>
|
|
<div class="line"><a name="l05516"></a><span class="lineno"> 5516</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a>->GetLowestFixedCostVehicleOfType(type);</div>
|
|
<div class="line"><a name="l05517"></a><span class="lineno"> 5517</span>  <span class="keywordflow">if</span> (vehicle < 0) {</div>
|
|
<div class="line"><a name="l05518"></a><span class="lineno"> 5518</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l05519"></a><span class="lineno"> 5519</span>  }</div>
|
|
<div class="line"><a name="l05520"></a><span class="lineno"> 5520</span>  </div>
|
|
<div class="line"><a name="l05521"></a><span class="lineno"> 5521</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cost_class =</div>
|
|
<div class="line"><a name="l05522"></a><span class="lineno"> 5522</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a32bba655accbd7dc8e23d30bf679b880">GetCostClassIndexOfVehicle</a>(vehicle).value();</div>
|
|
<div class="line"><a name="l05523"></a><span class="lineno"> 5523</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_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(vehicle);</div>
|
|
<div class="line"><a name="l05524"></a><span class="lineno"> 5524</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_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a1dc8d32892f78532c8ee7a7186158e07">End</a>(vehicle);</div>
|
|
<div class="line"><a name="l05525"></a><span class="lineno"> 5525</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> fixed_cost = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a4bab641f5b9bf8de266adad29558b4c2">GetFixedCostOfVehicle</a>(vehicle);</div>
|
|
<div class="line"><a name="l05526"></a><span class="lineno"> 5526</span>  </div>
|
|
<div class="line"><a name="l05527"></a><span class="lineno"> 5527</span>  <span class="comment">// Compute the neighbors for each non-start/end node not already inserted in</span></div>
|
|
<div class="line"><a name="l05528"></a><span class="lineno"> 5528</span>  <span class="comment">// the model.</span></div>
|
|
<div class="line"><a name="l05529"></a><span class="lineno"> 5529</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> before_node : uncontained_non_start_end_nodes) {</div>
|
|
<div class="line"><a name="l05530"></a><span class="lineno"> 5530</span>  std::vector<std::pair<<span class="comment">/*cost*/</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>, <span class="comment">/*node*/</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>>> costed_after_nodes;</div>
|
|
<div class="line"><a name="l05531"></a><span class="lineno"> 5531</span>  costed_after_nodes.reserve(uncontained_non_start_end_nodes.size());</div>
|
|
<div class="line"><a name="l05532"></a><span class="lineno"> 5532</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> after_node : uncontained_non_start_end_nodes) {</div>
|
|
<div class="line"><a name="l05533"></a><span class="lineno"> 5533</span>  <span class="keywordflow">if</span> (after_node != before_node) {</div>
|
|
<div class="line"><a name="l05534"></a><span class="lineno"> 5534</span>  costed_after_nodes.push_back(std::make_pair(</div>
|
|
<div class="line"><a name="l05535"></a><span class="lineno"> 5535</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->GetArcCostForClass(before_node, after_node, cost_class),</div>
|
|
<div class="line"><a name="l05536"></a><span class="lineno"> 5536</span>  after_node));</div>
|
|
<div class="line"><a name="l05537"></a><span class="lineno"> 5537</span>  }</div>
|
|
<div class="line"><a name="l05538"></a><span class="lineno"> 5538</span>  }</div>
|
|
<div class="line"><a name="l05539"></a><span class="lineno"> 5539</span>  <span class="keywordflow">if</span> (saving_neighbors < costed_after_nodes.size()) {</div>
|
|
<div class="line"><a name="l05540"></a><span class="lineno"> 5540</span>  std::nth_element(costed_after_nodes.begin(),</div>
|
|
<div class="line"><a name="l05541"></a><span class="lineno"> 5541</span>  costed_after_nodes.begin() + saving_neighbors,</div>
|
|
<div class="line"><a name="l05542"></a><span class="lineno"> 5542</span>  costed_after_nodes.end());</div>
|
|
<div class="line"><a name="l05543"></a><span class="lineno"> 5543</span>  costed_after_nodes.resize(saving_neighbors);</div>
|
|
<div class="line"><a name="l05544"></a><span class="lineno"> 5544</span>  }</div>
|
|
<div class="line"><a name="l05545"></a><span class="lineno"> 5545</span>  adjacency_lists[before_node].resize(costed_after_nodes.size());</div>
|
|
<div class="line"><a name="l05546"></a><span class="lineno"> 5546</span>  std::transform(costed_after_nodes.begin(), costed_after_nodes.end(),</div>
|
|
<div class="line"><a name="l05547"></a><span class="lineno"> 5547</span>  adjacency_lists[before_node].begin(),</div>
|
|
<div class="line"><a name="l05548"></a><span class="lineno"> 5548</span>  [](std::pair<int64, int64> cost_and_node) {</div>
|
|
<div class="line"><a name="l05549"></a><span class="lineno"> 5549</span>  return cost_and_node.second;</div>
|
|
<div class="line"><a name="l05550"></a><span class="lineno"> 5550</span>  });</div>
|
|
<div class="line"><a name="l05551"></a><span class="lineno"> 5551</span>  }</div>
|
|
<div class="line"><a name="l05552"></a><span class="lineno"> 5552</span>  <span class="keywordflow">if</span> (savings_params_.<a class="code" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a8857f65b46da9e2012c7bd939a978442">add_reverse_arcs</a>) {</div>
|
|
<div class="line"><a name="l05553"></a><span class="lineno"> 5553</span>  AddSymmetricArcsToAdjacencyLists(&adjacency_lists);</div>
|
|
<div class="line"><a name="l05554"></a><span class="lineno"> 5554</span>  }</div>
|
|
<div class="line"><a name="l05555"></a><span class="lineno"> 5555</span>  </div>
|
|
<div class="line"><a name="l05556"></a><span class="lineno"> 5556</span>  <span class="comment">// Build the savings for this vehicle type given the adjacency_lists.</span></div>
|
|
<div class="line"><a name="l05557"></a><span class="lineno"> 5557</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> before_node : uncontained_non_start_end_nodes) {</div>
|
|
<div class="line"><a name="l05558"></a><span class="lineno"> 5558</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> before_to_end_cost =</div>
|
|
<div class="line"><a name="l05559"></a><span class="lineno"> 5559</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a92d7882c311f7d9d0c55c4def34150dd">GetArcCostForClass</a>(before_node, end, cost_class);</div>
|
|
<div class="line"><a name="l05560"></a><span class="lineno"> 5560</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> start_to_before_cost =</div>
|
|
<div class="line"><a name="l05561"></a><span class="lineno"> 5561</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->GetArcCostForClass(start, before_node, cost_class),</div>
|
|
<div class="line"><a name="l05562"></a><span class="lineno"> 5562</span>  fixed_cost);</div>
|
|
<div class="line"><a name="l05563"></a><span class="lineno"> 5563</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> after_node : adjacency_lists[before_node]) {</div>
|
|
<div class="line"><a name="l05564"></a><span class="lineno"> 5564</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->IsStart(after_node) || <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->IsEnd(after_node) ||</div>
|
|
<div class="line"><a name="l05565"></a><span class="lineno"> 5565</span>  before_node == after_node || <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(after_node)) {</div>
|
|
<div class="line"><a name="l05566"></a><span class="lineno"> 5566</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l05567"></a><span class="lineno"> 5567</span>  }</div>
|
|
<div class="line"><a name="l05568"></a><span class="lineno"> 5568</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> arc_cost =</div>
|
|
<div class="line"><a name="l05569"></a><span class="lineno"> 5569</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a92d7882c311f7d9d0c55c4def34150dd">GetArcCostForClass</a>(before_node, after_node, cost_class);</div>
|
|
<div class="line"><a name="l05570"></a><span class="lineno"> 5570</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> start_to_after_cost =</div>
|
|
<div class="line"><a name="l05571"></a><span class="lineno"> 5571</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->GetArcCostForClass(start, after_node, cost_class),</div>
|
|
<div class="line"><a name="l05572"></a><span class="lineno"> 5572</span>  fixed_cost);</div>
|
|
<div class="line"><a name="l05573"></a><span class="lineno"> 5573</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> after_to_end_cost =</div>
|
|
<div class="line"><a name="l05574"></a><span class="lineno"> 5574</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a92d7882c311f7d9d0c55c4def34150dd">GetArcCostForClass</a>(after_node, end, cost_class);</div>
|
|
<div class="line"><a name="l05575"></a><span class="lineno"> 5575</span>  </div>
|
|
<div class="line"><a name="l05576"></a><span class="lineno"> 5576</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> weighted_arc_cost_fp =</div>
|
|
<div class="line"><a name="l05577"></a><span class="lineno"> 5577</span>  savings_params_.<a class="code" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a222a2814083966736ad9aefde1dde290">arc_coefficient</a> * arc_cost;</div>
|
|
<div class="line"><a name="l05578"></a><span class="lineno"> 5578</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> weighted_arc_cost =</div>
|
|
<div class="line"><a name="l05579"></a><span class="lineno"> 5579</span>  weighted_arc_cost_fp < <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a></div>
|
|
<div class="line"><a name="l05580"></a><span class="lineno"> 5580</span>  ? <span class="keyword">static_cast<</span><a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a><span class="keyword">></span>(weighted_arc_cost_fp)</div>
|
|
<div class="line"><a name="l05581"></a><span class="lineno"> 5581</span>  : <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>;</div>
|
|
<div class="line"><a name="l05582"></a><span class="lineno"> 5582</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> saving_value = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(</div>
|
|
<div class="line"><a name="l05583"></a><span class="lineno"> 5583</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(before_to_end_cost, start_to_after_cost), weighted_arc_cost);</div>
|
|
<div class="line"><a name="l05584"></a><span class="lineno"> 5584</span>  </div>
|
|
<div class="line"><a name="l05585"></a><span class="lineno"> 5585</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a2520cfaec0cd23cd56fd1eec8db79be4">Saving</a> saving =</div>
|
|
<div class="line"><a name="l05586"></a><span class="lineno"> 5586</span>  BuildSaving(-saving_value, type, before_node, after_node);</div>
|
|
<div class="line"><a name="l05587"></a><span class="lineno"> 5587</span>  </div>
|
|
<div class="line"><a name="l05588"></a><span class="lineno"> 5588</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> total_cost =</div>
|
|
<div class="line"><a name="l05589"></a><span class="lineno"> 5589</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(start_to_before_cost, arc_cost), after_to_end_cost);</div>
|
|
<div class="line"><a name="l05590"></a><span class="lineno"> 5590</span>  </div>
|
|
<div class="line"><a name="l05591"></a><span class="lineno"> 5591</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->AddNewSaving(saving, total_cost, before_node,</div>
|
|
<div class="line"><a name="l05592"></a><span class="lineno"> 5592</span>  after_node, type);</div>
|
|
<div class="line"><a name="l05593"></a><span class="lineno"> 5593</span>  }</div>
|
|
<div class="line"><a name="l05594"></a><span class="lineno"> 5594</span>  }</div>
|
|
<div class="line"><a name="l05595"></a><span class="lineno"> 5595</span>  }</div>
|
|
<div class="line"><a name="l05596"></a><span class="lineno"> 5596</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->Sort();</div>
|
|
<div class="line"><a name="l05597"></a><span class="lineno"> 5597</span> }</div>
|
|
<div class="line"><a name="l05598"></a><span class="lineno"> 5598</span>  </div>
|
|
<div class="line"><a name="l05599"></a><span class="lineno"> 5599</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> SavingsFilteredHeuristic::MaxNumNeighborsPerNode(</div>
|
|
<div class="line"><a name="l05600"></a><span class="lineno"> 5600</span>  <span class="keywordtype">int</span> num_vehicle_types)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l05601"></a><span class="lineno"> 5601</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> size = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a354dd8c252cf59b748602b342db6019d">Size</a>();</div>
|
|
<div class="line"><a name="l05602"></a><span class="lineno"> 5602</span>  </div>
|
|
<div class="line"><a name="l05603"></a><span class="lineno"> 5603</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> num_neighbors_with_ratio =</div>
|
|
<div class="line"><a name="l05604"></a><span class="lineno"> 5604</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(1.0, size * savings_params_.<a class="code" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a0aa77787d0df1b489476bfc6714ef819">neighbors_ratio</a>);</div>
|
|
<div class="line"><a name="l05605"></a><span class="lineno"> 5605</span>  </div>
|
|
<div class="line"><a name="l05606"></a><span class="lineno"> 5606</span>  <span class="comment">// A single Saving takes 2*8 bytes of memory.</span></div>
|
|
<div class="line"><a name="l05607"></a><span class="lineno"> 5607</span>  <span class="comment">// max_memory_usage_in_savings_unit = num_savings * multiplicative_factor,</span></div>
|
|
<div class="line"><a name="l05608"></a><span class="lineno"> 5608</span>  <span class="comment">// Where multiplicative_factor is the memory taken (in Savings unit) for each</span></div>
|
|
<div class="line"><a name="l05609"></a><span class="lineno"> 5609</span>  <span class="comment">// computed Saving.</span></div>
|
|
<div class="line"><a name="l05610"></a><span class="lineno"> 5610</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> max_memory_usage_in_savings_unit =</div>
|
|
<div class="line"><a name="l05611"></a><span class="lineno"> 5611</span>  savings_params_.<a class="code" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a33bd2c84a2be54d10959e5c0d81f86b5">max_memory_usage_bytes</a> / 16;</div>
|
|
<div class="line"><a name="l05612"></a><span class="lineno"> 5612</span>  </div>
|
|
<div class="line"><a name="l05613"></a><span class="lineno"> 5613</span>  <span class="comment">// In the SavingsContainer, for each Saving, the Savings are stored:</span></div>
|
|
<div class="line"><a name="l05614"></a><span class="lineno"> 5614</span>  <span class="comment">// - Once in "sorted_savings_per_vehicle_type", and (at most) once in</span></div>
|
|
<div class="line"><a name="l05615"></a><span class="lineno"> 5615</span>  <span class="comment">// "sorted_savings_" --> factor 2</span></div>
|
|
<div class="line"><a name="l05616"></a><span class="lineno"> 5616</span>  <span class="comment">// - If num_vehicle_types > 1, they're also stored by arc_index in</span></div>
|
|
<div class="line"><a name="l05617"></a><span class="lineno"> 5617</span>  <span class="comment">// "costs_and_savings_per_arc", along with their int64 cost --> factor 1.5</span></div>
|
|
<div class="line"><a name="l05618"></a><span class="lineno"> 5618</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l05619"></a><span class="lineno"> 5619</span>  <span class="comment">// On top of that,</span></div>
|
|
<div class="line"><a name="l05620"></a><span class="lineno"> 5620</span>  <span class="comment">// - In the sequential version, the Saving* are also stored by in-coming and</span></div>
|
|
<div class="line"><a name="l05621"></a><span class="lineno"> 5621</span>  <span class="comment">// outgoing node (in in/out_savings_ptr), adding another 2*8 bytes per</span></div>
|
|
<div class="line"><a name="l05622"></a><span class="lineno"> 5622</span>  <span class="comment">// Saving --> factor 1.</span></div>
|
|
<div class="line"><a name="l05623"></a><span class="lineno"> 5623</span>  <span class="comment">// - In the parallel version, skipped Savings are also stored in</span></div>
|
|
<div class="line"><a name="l05624"></a><span class="lineno"> 5624</span>  <span class="comment">// skipped_savings_starting/ending_at_, resulting in a maximum added factor</span></div>
|
|
<div class="line"><a name="l05625"></a><span class="lineno"> 5625</span>  <span class="comment">// of 2 for each Saving.</span></div>
|
|
<div class="line"><a name="l05626"></a><span class="lineno"> 5626</span>  <span class="comment">// These extra factors are given by ExtraSavingsMemoryMultiplicativeFactor().</span></div>
|
|
<div class="line"><a name="l05627"></a><span class="lineno"> 5627</span>  <span class="keywordtype">double</span> multiplicative_factor = 2.0 + <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a84b19d1c2e9a93a7e02dc12972c9c969">ExtraSavingsMemoryMultiplicativeFactor</a>();</div>
|
|
<div class="line"><a name="l05628"></a><span class="lineno"> 5628</span>  <span class="keywordflow">if</span> (num_vehicle_types > 1) {</div>
|
|
<div class="line"><a name="l05629"></a><span class="lineno"> 5629</span>  multiplicative_factor += 1.5;</div>
|
|
<div class="line"><a name="l05630"></a><span class="lineno"> 5630</span>  }</div>
|
|
<div class="line"><a name="l05631"></a><span class="lineno"> 5631</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> num_savings =</div>
|
|
<div class="line"><a name="l05632"></a><span class="lineno"> 5632</span>  max_memory_usage_in_savings_unit / multiplicative_factor;</div>
|
|
<div class="line"><a name="l05633"></a><span class="lineno"> 5633</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> num_neighbors_with_memory_restriction =</div>
|
|
<div class="line"><a name="l05634"></a><span class="lineno"> 5634</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(1.0, num_savings / (num_vehicle_types * size));</div>
|
|
<div class="line"><a name="l05635"></a><span class="lineno"> 5635</span>  </div>
|
|
<div class="line"><a name="l05636"></a><span class="lineno"> 5636</span>  <span class="keywordflow">return</span> <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(num_neighbors_with_ratio,</div>
|
|
<div class="line"><a name="l05637"></a><span class="lineno"> 5637</span>  num_neighbors_with_memory_restriction);</div>
|
|
<div class="line"><a name="l05638"></a><span class="lineno"> 5638</span> }</div>
|
|
<div class="line"><a name="l05639"></a><span class="lineno"> 5639</span>  </div>
|
|
<div class="line"><a name="l05640"></a><span class="lineno"> 5640</span> <span class="comment">// SequentialSavingsFilteredHeuristic</span></div>
|
|
<div class="line"><a name="l05641"></a><span class="lineno"> 5641</span>  </div>
|
|
<div class="line"><a name="l05642"></a><span class="lineno"> 5642</span> <span class="keywordtype">void</span> SequentialSavingsFilteredHeuristic::BuildRoutesFromSavings() {</div>
|
|
<div class="line"><a name="l05643"></a><span class="lineno"> 5643</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle_types = <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a>->NumTypes();</div>
|
|
<div class="line"><a name="l05644"></a><span class="lineno"> 5644</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(vehicle_types, 0);</div>
|
|
<div class="line"><a name="l05645"></a><span class="lineno"> 5645</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a354dd8c252cf59b748602b342db6019d">Size</a>();</div>
|
|
<div class="line"><a name="l05646"></a><span class="lineno"> 5646</span>  <span class="comment">// Store savings for each incoming and outgoing node and by vehicle type. This</span></div>
|
|
<div class="line"><a name="l05647"></a><span class="lineno"> 5647</span>  <span class="comment">// is necessary to quickly extend partial chains without scanning all savings.</span></div>
|
|
<div class="line"><a name="l05648"></a><span class="lineno"> 5648</span>  std::vector<std::vector<const Saving*>> in_savings_ptr(size * vehicle_types);</div>
|
|
<div class="line"><a name="l05649"></a><span class="lineno"> 5649</span>  std::vector<std::vector<const Saving*>> out_savings_ptr(size * vehicle_types);</div>
|
|
<div class="line"><a name="l05650"></a><span class="lineno"> 5650</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> type = 0; type < vehicle_types; type++) {</div>
|
|
<div class="line"><a name="l05651"></a><span class="lineno"> 5651</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle_type_offset = type * size;</div>
|
|
<div class="line"><a name="l05652"></a><span class="lineno"> 5652</span>  <span class="keyword">const</span> std::vector<Saving>& sorted_savings_for_type =</div>
|
|
<div class="line"><a name="l05653"></a><span class="lineno"> 5653</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->GetSortedSavingsForVehicleType(type);</div>
|
|
<div class="line"><a name="l05654"></a><span class="lineno"> 5654</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a2520cfaec0cd23cd56fd1eec8db79be4">Saving</a>& saving : sorted_savings_for_type) {</div>
|
|
<div class="line"><a name="l05655"></a><span class="lineno"> 5655</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(<a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a3ca37b113e071c2c1aca971b7008d275">GetVehicleTypeFromSaving</a>(saving), type);</div>
|
|
<div class="line"><a name="l05656"></a><span class="lineno"> 5656</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> before_node = <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#aab2d3476524269df9653877e976028d1">GetBeforeNodeFromSaving</a>(saving);</div>
|
|
<div class="line"><a name="l05657"></a><span class="lineno"> 5657</span>  in_savings_ptr[vehicle_type_offset + before_node].push_back(&saving);</div>
|
|
<div class="line"><a name="l05658"></a><span class="lineno"> 5658</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> after_node = <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#ac0258a794b8bf819b03f3337ff558596">GetAfterNodeFromSaving</a>(saving);</div>
|
|
<div class="line"><a name="l05659"></a><span class="lineno"> 5659</span>  out_savings_ptr[vehicle_type_offset + after_node].push_back(&saving);</div>
|
|
<div class="line"><a name="l05660"></a><span class="lineno"> 5660</span>  }</div>
|
|
<div class="line"><a name="l05661"></a><span class="lineno"> 5661</span>  }</div>
|
|
<div class="line"><a name="l05662"></a><span class="lineno"> 5662</span>  </div>
|
|
<div class="line"><a name="l05663"></a><span class="lineno"> 5663</span>  <span class="comment">// Build routes from savings.</span></div>
|
|
<div class="line"><a name="l05664"></a><span class="lineno"> 5664</span>  <span class="keywordflow">while</span> (<a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->HasSaving()) {</div>
|
|
<div class="line"><a name="l05665"></a><span class="lineno"> 5665</span>  <span class="comment">// First find the best saving to start a new route.</span></div>
|
|
<div class="line"><a name="l05666"></a><span class="lineno"> 5666</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a2520cfaec0cd23cd56fd1eec8db79be4">Saving</a> saving = <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->GetSaving();</div>
|
|
<div class="line"><a name="l05667"></a><span class="lineno"> 5667</span>  <span class="keywordtype">int</span> before_node = <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#aab2d3476524269df9653877e976028d1">GetBeforeNodeFromSaving</a>(saving);</div>
|
|
<div class="line"><a name="l05668"></a><span class="lineno"> 5668</span>  <span class="keywordtype">int</span> after_node = <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#ac0258a794b8bf819b03f3337ff558596">GetAfterNodeFromSaving</a>(saving);</div>
|
|
<div class="line"><a name="l05669"></a><span class="lineno"> 5669</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> nodes_not_contained =</div>
|
|
<div class="line"><a name="l05670"></a><span class="lineno"> 5670</span>  !<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(before_node) && !<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(after_node);</div>
|
|
<div class="line"><a name="l05671"></a><span class="lineno"> 5671</span>  </div>
|
|
<div class="line"><a name="l05672"></a><span class="lineno"> 5672</span>  <span class="keywordtype">bool</span> committed = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l05673"></a><span class="lineno"> 5673</span>  </div>
|
|
<div class="line"><a name="l05674"></a><span class="lineno"> 5674</span>  <span class="keywordflow">if</span> (nodes_not_contained) {</div>
|
|
<div class="line"><a name="l05675"></a><span class="lineno"> 5675</span>  <span class="comment">// Find the right vehicle to start the route with this Saving.</span></div>
|
|
<div class="line"><a name="l05676"></a><span class="lineno"> 5676</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> type = <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a3ca37b113e071c2c1aca971b7008d275">GetVehicleTypeFromSaving</a>(saving);</div>
|
|
<div class="line"><a name="l05677"></a><span class="lineno"> 5677</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle =</div>
|
|
<div class="line"><a name="l05678"></a><span class="lineno"> 5678</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a01596b614ecce63ba83d5c16b242507c">StartNewRouteWithBestVehicleOfType</a>(type, before_node, after_node);</div>
|
|
<div class="line"><a name="l05679"></a><span class="lineno"> 5679</span>  </div>
|
|
<div class="line"><a name="l05680"></a><span class="lineno"> 5680</span>  <span class="keywordflow">if</span> (vehicle >= 0) {</div>
|
|
<div class="line"><a name="l05681"></a><span class="lineno"> 5681</span>  committed = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l05682"></a><span class="lineno"> 5682</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_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(vehicle);</div>
|
|
<div class="line"><a name="l05683"></a><span class="lineno"> 5683</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_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a1dc8d32892f78532c8ee7a7186158e07">End</a>(vehicle);</div>
|
|
<div class="line"><a name="l05684"></a><span class="lineno"> 5684</span>  <span class="comment">// Then extend the route from both ends of the partial route.</span></div>
|
|
<div class="line"><a name="l05685"></a><span class="lineno"> 5685</span>  <span class="keywordtype">int</span> in_index = 0;</div>
|
|
<div class="line"><a name="l05686"></a><span class="lineno"> 5686</span>  <span class="keywordtype">int</span> out_index = 0;</div>
|
|
<div class="line"><a name="l05687"></a><span class="lineno"> 5687</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> saving_offset = type * size;</div>
|
|
<div class="line"><a name="l05688"></a><span class="lineno"> 5688</span>  </div>
|
|
<div class="line"><a name="l05689"></a><span class="lineno"> 5689</span>  <span class="keywordflow">while</span> (in_index < in_savings_ptr[saving_offset + after_node].size() ||</div>
|
|
<div class="line"><a name="l05690"></a><span class="lineno"> 5690</span>  out_index <</div>
|
|
<div class="line"><a name="l05691"></a><span class="lineno"> 5691</span>  out_savings_ptr[saving_offset + before_node].size()) {</div>
|
|
<div class="line"><a name="l05692"></a><span class="lineno"> 5692</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l05693"></a><span class="lineno"> 5693</span>  <span class="comment">// First determine how to extend the route.</span></div>
|
|
<div class="line"><a name="l05694"></a><span class="lineno"> 5694</span>  <span class="keywordtype">int</span> before_before_node = -1;</div>
|
|
<div class="line"><a name="l05695"></a><span class="lineno"> 5695</span>  <span class="keywordtype">int</span> after_after_node = -1;</div>
|
|
<div class="line"><a name="l05696"></a><span class="lineno"> 5696</span>  <span class="keywordflow">if</span> (in_index < in_savings_ptr[saving_offset + after_node].size()) {</div>
|
|
<div class="line"><a name="l05697"></a><span class="lineno"> 5697</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a2520cfaec0cd23cd56fd1eec8db79be4">Saving</a>& in_saving =</div>
|
|
<div class="line"><a name="l05698"></a><span class="lineno"> 5698</span>  *(in_savings_ptr[saving_offset + after_node][in_index]);</div>
|
|
<div class="line"><a name="l05699"></a><span class="lineno"> 5699</span>  <span class="keywordflow">if</span> (out_index <</div>
|
|
<div class="line"><a name="l05700"></a><span class="lineno"> 5700</span>  out_savings_ptr[saving_offset + before_node].size()) {</div>
|
|
<div class="line"><a name="l05701"></a><span class="lineno"> 5701</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a2520cfaec0cd23cd56fd1eec8db79be4">Saving</a>& out_saving =</div>
|
|
<div class="line"><a name="l05702"></a><span class="lineno"> 5702</span>  *(out_savings_ptr[saving_offset + before_node][out_index]);</div>
|
|
<div class="line"><a name="l05703"></a><span class="lineno"> 5703</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a7ad6f39413bee55cd55f66ea28d40d38">GetSavingValue</a>(in_saving) < <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a7ad6f39413bee55cd55f66ea28d40d38">GetSavingValue</a>(out_saving)) {</div>
|
|
<div class="line"><a name="l05704"></a><span class="lineno"> 5704</span>  <span class="comment">// Should extend after after_node</span></div>
|
|
<div class="line"><a name="l05705"></a><span class="lineno"> 5705</span>  after_after_node = <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#ac0258a794b8bf819b03f3337ff558596">GetAfterNodeFromSaving</a>(in_saving);</div>
|
|
<div class="line"><a name="l05706"></a><span class="lineno"> 5706</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l05707"></a><span class="lineno"> 5707</span>  <span class="comment">// Should extend before before_node</span></div>
|
|
<div class="line"><a name="l05708"></a><span class="lineno"> 5708</span>  before_before_node = <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#aab2d3476524269df9653877e976028d1">GetBeforeNodeFromSaving</a>(out_saving);</div>
|
|
<div class="line"><a name="l05709"></a><span class="lineno"> 5709</span>  }</div>
|
|
<div class="line"><a name="l05710"></a><span class="lineno"> 5710</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l05711"></a><span class="lineno"> 5711</span>  <span class="comment">// Should extend after after_node</span></div>
|
|
<div class="line"><a name="l05712"></a><span class="lineno"> 5712</span>  after_after_node = <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#ac0258a794b8bf819b03f3337ff558596">GetAfterNodeFromSaving</a>(in_saving);</div>
|
|
<div class="line"><a name="l05713"></a><span class="lineno"> 5713</span>  }</div>
|
|
<div class="line"><a name="l05714"></a><span class="lineno"> 5714</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l05715"></a><span class="lineno"> 5715</span>  <span class="comment">// Should extend before before_node</span></div>
|
|
<div class="line"><a name="l05716"></a><span class="lineno"> 5716</span>  before_before_node = <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#aab2d3476524269df9653877e976028d1">GetBeforeNodeFromSaving</a>(</div>
|
|
<div class="line"><a name="l05717"></a><span class="lineno"> 5717</span>  *(out_savings_ptr[saving_offset + before_node][out_index]));</div>
|
|
<div class="line"><a name="l05718"></a><span class="lineno"> 5718</span>  }</div>
|
|
<div class="line"><a name="l05719"></a><span class="lineno"> 5719</span>  <span class="comment">// Extend the route</span></div>
|
|
<div class="line"><a name="l05720"></a><span class="lineno"> 5720</span>  <span class="keywordflow">if</span> (after_after_node != -1) {</div>
|
|
<div class="line"><a name="l05721"></a><span class="lineno"> 5721</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(before_before_node, -1);</div>
|
|
<div class="line"><a name="l05722"></a><span class="lineno"> 5722</span>  <span class="comment">// Extending after after_node</span></div>
|
|
<div class="line"><a name="l05723"></a><span class="lineno"> 5723</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(after_after_node)) {</div>
|
|
<div class="line"><a name="l05724"></a><span class="lineno"> 5724</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(after_node, after_after_node);</div>
|
|
<div class="line"><a name="l05725"></a><span class="lineno"> 5725</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(after_after_node, end);</div>
|
|
<div class="line"><a name="l05726"></a><span class="lineno"> 5726</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>()) {</div>
|
|
<div class="line"><a name="l05727"></a><span class="lineno"> 5727</span>  in_index = 0;</div>
|
|
<div class="line"><a name="l05728"></a><span class="lineno"> 5728</span>  after_node = after_after_node;</div>
|
|
<div class="line"><a name="l05729"></a><span class="lineno"> 5729</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l05730"></a><span class="lineno"> 5730</span>  ++in_index;</div>
|
|
<div class="line"><a name="l05731"></a><span class="lineno"> 5731</span>  }</div>
|
|
<div class="line"><a name="l05732"></a><span class="lineno"> 5732</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l05733"></a><span class="lineno"> 5733</span>  ++in_index;</div>
|
|
<div class="line"><a name="l05734"></a><span class="lineno"> 5734</span>  }</div>
|
|
<div class="line"><a name="l05735"></a><span class="lineno"> 5735</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l05736"></a><span class="lineno"> 5736</span>  <span class="comment">// Extending before before_node</span></div>
|
|
<div class="line"><a name="l05737"></a><span class="lineno"> 5737</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(before_before_node, 0);</div>
|
|
<div class="line"><a name="l05738"></a><span class="lineno"> 5738</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(before_before_node)) {</div>
|
|
<div class="line"><a name="l05739"></a><span class="lineno"> 5739</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(start, before_before_node);</div>
|
|
<div class="line"><a name="l05740"></a><span class="lineno"> 5740</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(before_before_node, before_node);</div>
|
|
<div class="line"><a name="l05741"></a><span class="lineno"> 5741</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>()) {</div>
|
|
<div class="line"><a name="l05742"></a><span class="lineno"> 5742</span>  out_index = 0;</div>
|
|
<div class="line"><a name="l05743"></a><span class="lineno"> 5743</span>  before_node = before_before_node;</div>
|
|
<div class="line"><a name="l05744"></a><span class="lineno"> 5744</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l05745"></a><span class="lineno"> 5745</span>  ++out_index;</div>
|
|
<div class="line"><a name="l05746"></a><span class="lineno"> 5746</span>  }</div>
|
|
<div class="line"><a name="l05747"></a><span class="lineno"> 5747</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l05748"></a><span class="lineno"> 5748</span>  ++out_index;</div>
|
|
<div class="line"><a name="l05749"></a><span class="lineno"> 5749</span>  }</div>
|
|
<div class="line"><a name="l05750"></a><span class="lineno"> 5750</span>  }</div>
|
|
<div class="line"><a name="l05751"></a><span class="lineno"> 5751</span>  }</div>
|
|
<div class="line"><a name="l05752"></a><span class="lineno"> 5752</span>  }</div>
|
|
<div class="line"><a name="l05753"></a><span class="lineno"> 5753</span>  }</div>
|
|
<div class="line"><a name="l05754"></a><span class="lineno"> 5754</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->Update(nodes_not_contained && !committed);</div>
|
|
<div class="line"><a name="l05755"></a><span class="lineno"> 5755</span>  }</div>
|
|
<div class="line"><a name="l05756"></a><span class="lineno"> 5756</span> }</div>
|
|
<div class="line"><a name="l05757"></a><span class="lineno"> 5757</span>  </div>
|
|
<div class="line"><a name="l05758"></a><span class="lineno"> 5758</span> <span class="comment">// ParallelSavingsFilteredHeuristic</span></div>
|
|
<div class="line"><a name="l05759"></a><span class="lineno"> 5759</span>  </div>
|
|
<div class="line"><a name="l05760"></a><span class="lineno"> 5760</span> <span class="keywordtype">void</span> ParallelSavingsFilteredHeuristic::BuildRoutesFromSavings() {</div>
|
|
<div class="line"><a name="l05761"></a><span class="lineno"> 5761</span>  <span class="comment">// Initialize the vehicles of the first/last non start/end nodes served by</span></div>
|
|
<div class="line"><a name="l05762"></a><span class="lineno"> 5762</span>  <span class="comment">// each route.</span></div>
|
|
<div class="line"><a name="l05763"></a><span class="lineno"> 5763</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> size = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a354dd8c252cf59b748602b342db6019d">Size</a>();</div>
|
|
<div class="line"><a name="l05764"></a><span class="lineno"> 5764</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicles = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>();</div>
|
|
<div class="line"><a name="l05765"></a><span class="lineno"> 5765</span>  </div>
|
|
<div class="line"><a name="l05766"></a><span class="lineno"> 5766</span>  first_node_on_route_.resize(vehicles, -1);</div>
|
|
<div class="line"><a name="l05767"></a><span class="lineno"> 5767</span>  last_node_on_route_.resize(vehicles, -1);</div>
|
|
<div class="line"><a name="l05768"></a><span class="lineno"> 5768</span>  vehicle_of_first_or_last_node_.resize(size, -1);</div>
|
|
<div class="line"><a name="l05769"></a><span class="lineno"> 5769</span>  </div>
|
|
<div class="line"><a name="l05770"></a><span class="lineno"> 5770</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < vehicles; vehicle++) {</div>
|
|
<div class="line"><a name="l05771"></a><span class="lineno"> 5771</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_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(vehicle);</div>
|
|
<div class="line"><a name="l05772"></a><span class="lineno"> 5772</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_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a1dc8d32892f78532c8ee7a7186158e07">End</a>(vehicle);</div>
|
|
<div class="line"><a name="l05773"></a><span class="lineno"> 5773</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(start)) {</div>
|
|
<div class="line"><a name="l05774"></a><span class="lineno"> 5774</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l05775"></a><span class="lineno"> 5775</span>  }</div>
|
|
<div class="line"><a name="l05776"></a><span class="lineno"> 5776</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(start);</div>
|
|
<div class="line"><a name="l05777"></a><span class="lineno"> 5777</span>  <span class="keywordflow">if</span> (node != end) {</div>
|
|
<div class="line"><a name="l05778"></a><span class="lineno"> 5778</span>  vehicle_of_first_or_last_node_[node] = vehicle;</div>
|
|
<div class="line"><a name="l05779"></a><span class="lineno"> 5779</span>  first_node_on_route_[vehicle] = node;</div>
|
|
<div class="line"><a name="l05780"></a><span class="lineno"> 5780</span>  </div>
|
|
<div class="line"><a name="l05781"></a><span class="lineno"> 5781</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(node);</div>
|
|
<div class="line"><a name="l05782"></a><span class="lineno"> 5782</span>  <span class="keywordflow">while</span> (<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> != end) {</div>
|
|
<div class="line"><a name="l05783"></a><span class="lineno"> 5783</span>  node = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l05784"></a><span class="lineno"> 5784</span>  <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(node);</div>
|
|
<div class="line"><a name="l05785"></a><span class="lineno"> 5785</span>  }</div>
|
|
<div class="line"><a name="l05786"></a><span class="lineno"> 5786</span>  vehicle_of_first_or_last_node_[node] = vehicle;</div>
|
|
<div class="line"><a name="l05787"></a><span class="lineno"> 5787</span>  last_node_on_route_[vehicle] = node;</div>
|
|
<div class="line"><a name="l05788"></a><span class="lineno"> 5788</span>  }</div>
|
|
<div class="line"><a name="l05789"></a><span class="lineno"> 5789</span>  }</div>
|
|
<div class="line"><a name="l05790"></a><span class="lineno"> 5790</span>  </div>
|
|
<div class="line"><a name="l05791"></a><span class="lineno"> 5791</span>  <span class="keywordflow">while</span> (<a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->HasSaving()) {</div>
|
|
<div class="line"><a name="l05792"></a><span class="lineno"> 5792</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l05793"></a><span class="lineno"> 5793</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a2520cfaec0cd23cd56fd1eec8db79be4">Saving</a> saving = <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->GetSaving();</div>
|
|
<div class="line"><a name="l05794"></a><span class="lineno"> 5794</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> before_node = <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#aab2d3476524269df9653877e976028d1">GetBeforeNodeFromSaving</a>(saving);</div>
|
|
<div class="line"><a name="l05795"></a><span class="lineno"> 5795</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> after_node = <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#ac0258a794b8bf819b03f3337ff558596">GetAfterNodeFromSaving</a>(saving);</div>
|
|
<div class="line"><a name="l05796"></a><span class="lineno"> 5796</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> type = <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a3ca37b113e071c2c1aca971b7008d275">GetVehicleTypeFromSaving</a>(saving);</div>
|
|
<div class="line"><a name="l05797"></a><span class="lineno"> 5797</span>  </div>
|
|
<div class="line"><a name="l05798"></a><span class="lineno"> 5798</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(before_node) && !<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(after_node)) {</div>
|
|
<div class="line"><a name="l05799"></a><span class="lineno"> 5799</span>  <span class="comment">// Neither nodes are contained, start a new route.</span></div>
|
|
<div class="line"><a name="l05800"></a><span class="lineno"> 5800</span>  <span class="keywordtype">bool</span> committed = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l05801"></a><span class="lineno"> 5801</span>  </div>
|
|
<div class="line"><a name="l05802"></a><span class="lineno"> 5802</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle =</div>
|
|
<div class="line"><a name="l05803"></a><span class="lineno"> 5803</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a01596b614ecce63ba83d5c16b242507c">StartNewRouteWithBestVehicleOfType</a>(type, before_node, after_node);</div>
|
|
<div class="line"><a name="l05804"></a><span class="lineno"> 5804</span>  </div>
|
|
<div class="line"><a name="l05805"></a><span class="lineno"> 5805</span>  <span class="keywordflow">if</span> (vehicle >= 0) {</div>
|
|
<div class="line"><a name="l05806"></a><span class="lineno"> 5806</span>  committed = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l05807"></a><span class="lineno"> 5807</span>  <span class="comment">// Store before_node and after_node as first and last nodes of the route</span></div>
|
|
<div class="line"><a name="l05808"></a><span class="lineno"> 5808</span>  vehicle_of_first_or_last_node_[before_node] = vehicle;</div>
|
|
<div class="line"><a name="l05809"></a><span class="lineno"> 5809</span>  vehicle_of_first_or_last_node_[after_node] = vehicle;</div>
|
|
<div class="line"><a name="l05810"></a><span class="lineno"> 5810</span>  first_node_on_route_[vehicle] = before_node;</div>
|
|
<div class="line"><a name="l05811"></a><span class="lineno"> 5811</span>  last_node_on_route_[vehicle] = after_node;</div>
|
|
<div class="line"><a name="l05812"></a><span class="lineno"> 5812</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->ReinjectSkippedSavingsStartingAt(after_node);</div>
|
|
<div class="line"><a name="l05813"></a><span class="lineno"> 5813</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->ReinjectSkippedSavingsEndingAt(before_node);</div>
|
|
<div class="line"><a name="l05814"></a><span class="lineno"> 5814</span>  }</div>
|
|
<div class="line"><a name="l05815"></a><span class="lineno"> 5815</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->Update(!committed);</div>
|
|
<div class="line"><a name="l05816"></a><span class="lineno"> 5816</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l05817"></a><span class="lineno"> 5817</span>  }</div>
|
|
<div class="line"><a name="l05818"></a><span class="lineno"> 5818</span>  </div>
|
|
<div class="line"><a name="l05819"></a><span class="lineno"> 5819</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(before_node) && <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(after_node)) {</div>
|
|
<div class="line"><a name="l05820"></a><span class="lineno"> 5820</span>  <span class="comment">// Merge the two routes if before_node is last and after_node first of its</span></div>
|
|
<div class="line"><a name="l05821"></a><span class="lineno"> 5821</span>  <span class="comment">// route, the two nodes aren't already on the same route, and the vehicle</span></div>
|
|
<div class="line"><a name="l05822"></a><span class="lineno"> 5822</span>  <span class="comment">// types are compatible.</span></div>
|
|
<div class="line"><a name="l05823"></a><span class="lineno"> 5823</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> v1 = vehicle_of_first_or_last_node_[before_node];</div>
|
|
<div class="line"><a name="l05824"></a><span class="lineno"> 5824</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> last_node = v1 == -1 ? -1 : last_node_on_route_[v1];</div>
|
|
<div class="line"><a name="l05825"></a><span class="lineno"> 5825</span>  </div>
|
|
<div class="line"><a name="l05826"></a><span class="lineno"> 5826</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> v2 = vehicle_of_first_or_last_node_[after_node];</div>
|
|
<div class="line"><a name="l05827"></a><span class="lineno"> 5827</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> first_node = v2 == -1 ? -1 : first_node_on_route_[v2];</div>
|
|
<div class="line"><a name="l05828"></a><span class="lineno"> 5828</span>  </div>
|
|
<div class="line"><a name="l05829"></a><span class="lineno"> 5829</span>  <span class="keywordflow">if</span> (before_node == last_node && after_node == first_node && v1 != v2 &&</div>
|
|
<div class="line"><a name="l05830"></a><span class="lineno"> 5830</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a>->Type(v1) == <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a>->Type(v2)) {</div>
|
|
<div class="line"><a name="l05831"></a><span class="lineno"> 5831</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(before_node), <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->End(v1));</div>
|
|
<div class="line"><a name="l05832"></a><span class="lineno"> 5832</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->Start(v2)), after_node);</div>
|
|
<div class="line"><a name="l05833"></a><span class="lineno"> 5833</span>  </div>
|
|
<div class="line"><a name="l05834"></a><span class="lineno"> 5834</span>  <span class="comment">// We try merging the two routes.</span></div>
|
|
<div class="line"><a name="l05835"></a><span class="lineno"> 5835</span>  <span class="comment">// TODO(user): Try to use skipped savings to start new routes when</span></div>
|
|
<div class="line"><a name="l05836"></a><span class="lineno"> 5836</span>  <span class="comment">// a vehicle becomes available after a merge (not trivial because it can</span></div>
|
|
<div class="line"><a name="l05837"></a><span class="lineno"> 5837</span>  <span class="comment">// result in an infinite loop).</span></div>
|
|
<div class="line"><a name="l05838"></a><span class="lineno"> 5838</span>  MergeRoutes(v1, v2, before_node, after_node);</div>
|
|
<div class="line"><a name="l05839"></a><span class="lineno"> 5839</span>  }</div>
|
|
<div class="line"><a name="l05840"></a><span class="lineno"> 5840</span>  }</div>
|
|
<div class="line"><a name="l05841"></a><span class="lineno"> 5841</span>  </div>
|
|
<div class="line"><a name="l05842"></a><span class="lineno"> 5842</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(before_node) && !<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(after_node)) {</div>
|
|
<div class="line"><a name="l05843"></a><span class="lineno"> 5843</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = vehicle_of_first_or_last_node_[before_node];</div>
|
|
<div class="line"><a name="l05844"></a><span class="lineno"> 5844</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> last_node = vehicle == -1 ? -1 : last_node_on_route_[vehicle];</div>
|
|
<div class="line"><a name="l05845"></a><span class="lineno"> 5845</span>  </div>
|
|
<div class="line"><a name="l05846"></a><span class="lineno"> 5846</span>  <span class="keywordflow">if</span> (before_node == last_node) {</div>
|
|
<div class="line"><a name="l05847"></a><span class="lineno"> 5847</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_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a1dc8d32892f78532c8ee7a7186158e07">End</a>(vehicle);</div>
|
|
<div class="line"><a name="l05848"></a><span class="lineno"> 5848</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(before_node), end);</div>
|
|
<div class="line"><a name="l05849"></a><span class="lineno"> 5849</span>  </div>
|
|
<div class="line"><a name="l05850"></a><span class="lineno"> 5850</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> route_type = <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a>->Type(vehicle);</div>
|
|
<div class="line"><a name="l05851"></a><span class="lineno"> 5851</span>  <span class="keywordflow">if</span> (type != route_type) {</div>
|
|
<div class="line"><a name="l05852"></a><span class="lineno"> 5852</span>  <span class="comment">// The saving doesn't correspond to the type of the vehicle serving</span></div>
|
|
<div class="line"><a name="l05853"></a><span class="lineno"> 5853</span>  <span class="comment">// before_node. We update the container with the correct type.</span></div>
|
|
<div class="line"><a name="l05854"></a><span class="lineno"> 5854</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->UpdateWithType(route_type);</div>
|
|
<div class="line"><a name="l05855"></a><span class="lineno"> 5855</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l05856"></a><span class="lineno"> 5856</span>  }</div>
|
|
<div class="line"><a name="l05857"></a><span class="lineno"> 5857</span>  </div>
|
|
<div class="line"><a name="l05858"></a><span class="lineno"> 5858</span>  <span class="comment">// Try adding after_node on route of before_node.</span></div>
|
|
<div class="line"><a name="l05859"></a><span class="lineno"> 5859</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(before_node, after_node);</div>
|
|
<div class="line"><a name="l05860"></a><span class="lineno"> 5860</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(after_node, end);</div>
|
|
<div class="line"><a name="l05861"></a><span class="lineno"> 5861</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>()) {</div>
|
|
<div class="line"><a name="l05862"></a><span class="lineno"> 5862</span>  <span class="keywordflow">if</span> (first_node_on_route_[vehicle] != before_node) {</div>
|
|
<div class="line"><a name="l05863"></a><span class="lineno"> 5863</span>  <span class="comment">// before_node is no longer the start or end of its route</span></div>
|
|
<div class="line"><a name="l05864"></a><span class="lineno"> 5864</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->Start(vehicle)), before_node);</div>
|
|
<div class="line"><a name="l05865"></a><span class="lineno"> 5865</span>  vehicle_of_first_or_last_node_[before_node] = -1;</div>
|
|
<div class="line"><a name="l05866"></a><span class="lineno"> 5866</span>  }</div>
|
|
<div class="line"><a name="l05867"></a><span class="lineno"> 5867</span>  vehicle_of_first_or_last_node_[after_node] = vehicle;</div>
|
|
<div class="line"><a name="l05868"></a><span class="lineno"> 5868</span>  last_node_on_route_[vehicle] = after_node;</div>
|
|
<div class="line"><a name="l05869"></a><span class="lineno"> 5869</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->ReinjectSkippedSavingsStartingAt(after_node);</div>
|
|
<div class="line"><a name="l05870"></a><span class="lineno"> 5870</span>  }</div>
|
|
<div class="line"><a name="l05871"></a><span class="lineno"> 5871</span>  }</div>
|
|
<div class="line"><a name="l05872"></a><span class="lineno"> 5872</span>  }</div>
|
|
<div class="line"><a name="l05873"></a><span class="lineno"> 5873</span>  </div>
|
|
<div class="line"><a name="l05874"></a><span class="lineno"> 5874</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(before_node) && <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(after_node)) {</div>
|
|
<div class="line"><a name="l05875"></a><span class="lineno"> 5875</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = vehicle_of_first_or_last_node_[after_node];</div>
|
|
<div class="line"><a name="l05876"></a><span class="lineno"> 5876</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> first_node =</div>
|
|
<div class="line"><a name="l05877"></a><span class="lineno"> 5877</span>  vehicle == -1 ? -1 : first_node_on_route_[vehicle];</div>
|
|
<div class="line"><a name="l05878"></a><span class="lineno"> 5878</span>  </div>
|
|
<div class="line"><a name="l05879"></a><span class="lineno"> 5879</span>  <span class="keywordflow">if</span> (after_node == first_node) {</div>
|
|
<div class="line"><a name="l05880"></a><span class="lineno"> 5880</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_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(vehicle);</div>
|
|
<div class="line"><a name="l05881"></a><span class="lineno"> 5881</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(start), after_node);</div>
|
|
<div class="line"><a name="l05882"></a><span class="lineno"> 5882</span>  </div>
|
|
<div class="line"><a name="l05883"></a><span class="lineno"> 5883</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> route_type = <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a>->Type(vehicle);</div>
|
|
<div class="line"><a name="l05884"></a><span class="lineno"> 5884</span>  <span class="keywordflow">if</span> (type != route_type) {</div>
|
|
<div class="line"><a name="l05885"></a><span class="lineno"> 5885</span>  <span class="comment">// The saving doesn't correspond to the type of the vehicle serving</span></div>
|
|
<div class="line"><a name="l05886"></a><span class="lineno"> 5886</span>  <span class="comment">// after_node. We update the container with the correct type.</span></div>
|
|
<div class="line"><a name="l05887"></a><span class="lineno"> 5887</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->UpdateWithType(route_type);</div>
|
|
<div class="line"><a name="l05888"></a><span class="lineno"> 5888</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l05889"></a><span class="lineno"> 5889</span>  }</div>
|
|
<div class="line"><a name="l05890"></a><span class="lineno"> 5890</span>  </div>
|
|
<div class="line"><a name="l05891"></a><span class="lineno"> 5891</span>  <span class="comment">// Try adding before_node on route of after_node.</span></div>
|
|
<div class="line"><a name="l05892"></a><span class="lineno"> 5892</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(before_node, after_node);</div>
|
|
<div class="line"><a name="l05893"></a><span class="lineno"> 5893</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(start, before_node);</div>
|
|
<div class="line"><a name="l05894"></a><span class="lineno"> 5894</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>()) {</div>
|
|
<div class="line"><a name="l05895"></a><span class="lineno"> 5895</span>  <span class="keywordflow">if</span> (last_node_on_route_[vehicle] != after_node) {</div>
|
|
<div class="line"><a name="l05896"></a><span class="lineno"> 5896</span>  <span class="comment">// after_node is no longer the start or end of its route</span></div>
|
|
<div class="line"><a name="l05897"></a><span class="lineno"> 5897</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(after_node), <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->End(vehicle));</div>
|
|
<div class="line"><a name="l05898"></a><span class="lineno"> 5898</span>  vehicle_of_first_or_last_node_[after_node] = -1;</div>
|
|
<div class="line"><a name="l05899"></a><span class="lineno"> 5899</span>  }</div>
|
|
<div class="line"><a name="l05900"></a><span class="lineno"> 5900</span>  vehicle_of_first_or_last_node_[before_node] = vehicle;</div>
|
|
<div class="line"><a name="l05901"></a><span class="lineno"> 5901</span>  first_node_on_route_[vehicle] = before_node;</div>
|
|
<div class="line"><a name="l05902"></a><span class="lineno"> 5902</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->ReinjectSkippedSavingsEndingAt(before_node);</div>
|
|
<div class="line"><a name="l05903"></a><span class="lineno"> 5903</span>  }</div>
|
|
<div class="line"><a name="l05904"></a><span class="lineno"> 5904</span>  }</div>
|
|
<div class="line"><a name="l05905"></a><span class="lineno"> 5905</span>  }</div>
|
|
<div class="line"><a name="l05906"></a><span class="lineno"> 5906</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->Update(<span class="comment">/*update_best_saving*/</span> <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l05907"></a><span class="lineno"> 5907</span>  }</div>
|
|
<div class="line"><a name="l05908"></a><span class="lineno"> 5908</span> }</div>
|
|
<div class="line"><a name="l05909"></a><span class="lineno"> 5909</span>  </div>
|
|
<div class="line"><a name="l05910"></a><span class="lineno"> 5910</span> <span class="keywordtype">void</span> ParallelSavingsFilteredHeuristic::MergeRoutes(<span class="keywordtype">int</span> first_vehicle,</div>
|
|
<div class="line"><a name="l05911"></a><span class="lineno"> 5911</span>  <span class="keywordtype">int</span> second_vehicle,</div>
|
|
<div class="line"><a name="l05912"></a><span class="lineno"> 5912</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> before_node,</div>
|
|
<div class="line"><a name="l05913"></a><span class="lineno"> 5913</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> after_node) {</div>
|
|
<div class="line"><a name="l05914"></a><span class="lineno"> 5914</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l05915"></a><span class="lineno"> 5915</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> new_first_node = first_node_on_route_[first_vehicle];</div>
|
|
<div class="line"><a name="l05916"></a><span class="lineno"> 5916</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(vehicle_of_first_or_last_node_[new_first_node], first_vehicle);</div>
|
|
<div class="line"><a name="l05917"></a><span class="lineno"> 5917</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->Start(first_vehicle)), new_first_node);</div>
|
|
<div class="line"><a name="l05918"></a><span class="lineno"> 5918</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> new_last_node = last_node_on_route_[second_vehicle];</div>
|
|
<div class="line"><a name="l05919"></a><span class="lineno"> 5919</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(vehicle_of_first_or_last_node_[new_last_node], second_vehicle);</div>
|
|
<div class="line"><a name="l05920"></a><span class="lineno"> 5920</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">Value</a>(new_last_node), <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->End(second_vehicle));</div>
|
|
<div class="line"><a name="l05921"></a><span class="lineno"> 5921</span>  </div>
|
|
<div class="line"><a name="l05922"></a><span class="lineno"> 5922</span>  <span class="comment">// Select the vehicle with lower fixed cost to merge the routes.</span></div>
|
|
<div class="line"><a name="l05923"></a><span class="lineno"> 5923</span>  <span class="keywordtype">int</span> used_vehicle = first_vehicle;</div>
|
|
<div class="line"><a name="l05924"></a><span class="lineno"> 5924</span>  <span class="keywordtype">int</span> unused_vehicle = second_vehicle;</div>
|
|
<div class="line"><a name="l05925"></a><span class="lineno"> 5925</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->GetFixedCostOfVehicle(first_vehicle) ></div>
|
|
<div class="line"><a name="l05926"></a><span class="lineno"> 5926</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->GetFixedCostOfVehicle(second_vehicle)) {</div>
|
|
<div class="line"><a name="l05927"></a><span class="lineno"> 5927</span>  used_vehicle = second_vehicle;</div>
|
|
<div class="line"><a name="l05928"></a><span class="lineno"> 5928</span>  unused_vehicle = first_vehicle;</div>
|
|
<div class="line"><a name="l05929"></a><span class="lineno"> 5929</span>  }</div>
|
|
<div class="line"><a name="l05930"></a><span class="lineno"> 5930</span>  </div>
|
|
<div class="line"><a name="l05931"></a><span class="lineno"> 5931</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(before_node, after_node);</div>
|
|
<div class="line"><a name="l05932"></a><span class="lineno"> 5932</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->Start(unused_vehicle), <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->End(unused_vehicle));</div>
|
|
<div class="line"><a name="l05933"></a><span class="lineno"> 5933</span>  <span class="keywordflow">if</span> (used_vehicle == first_vehicle) {</div>
|
|
<div class="line"><a name="l05934"></a><span class="lineno"> 5934</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(new_last_node, <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->End(used_vehicle));</div>
|
|
<div class="line"><a name="l05935"></a><span class="lineno"> 5935</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l05936"></a><span class="lineno"> 5936</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->Start(used_vehicle), new_first_node);</div>
|
|
<div class="line"><a name="l05937"></a><span class="lineno"> 5937</span>  }</div>
|
|
<div class="line"><a name="l05938"></a><span class="lineno"> 5938</span>  <span class="keywordtype">bool</span> committed = <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>();</div>
|
|
<div class="line"><a name="l05939"></a><span class="lineno"> 5939</span>  <span class="keywordflow">if</span> (!committed &&</div>
|
|
<div class="line"><a name="l05940"></a><span class="lineno"> 5940</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->GetVehicleClassIndexOfVehicle(first_vehicle).<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>() !=</div>
|
|
<div class="line"><a name="l05941"></a><span class="lineno"> 5941</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->GetVehicleClassIndexOfVehicle(second_vehicle).<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>()) {</div>
|
|
<div class="line"><a name="l05942"></a><span class="lineno"> 5942</span>  <span class="comment">// Try committing on other vehicle instead.</span></div>
|
|
<div class="line"><a name="l05943"></a><span class="lineno"> 5943</span>  std::swap(used_vehicle, unused_vehicle);</div>
|
|
<div class="line"><a name="l05944"></a><span class="lineno"> 5944</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(before_node, after_node);</div>
|
|
<div class="line"><a name="l05945"></a><span class="lineno"> 5945</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->Start(unused_vehicle), <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->End(unused_vehicle));</div>
|
|
<div class="line"><a name="l05946"></a><span class="lineno"> 5946</span>  <span class="keywordflow">if</span> (used_vehicle == first_vehicle) {</div>
|
|
<div class="line"><a name="l05947"></a><span class="lineno"> 5947</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(new_last_node, <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->End(used_vehicle));</div>
|
|
<div class="line"><a name="l05948"></a><span class="lineno"> 5948</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l05949"></a><span class="lineno"> 5949</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->Start(used_vehicle), new_first_node);</div>
|
|
<div class="line"><a name="l05950"></a><span class="lineno"> 5950</span>  }</div>
|
|
<div class="line"><a name="l05951"></a><span class="lineno"> 5951</span>  committed = <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>();</div>
|
|
<div class="line"><a name="l05952"></a><span class="lineno"> 5952</span>  }</div>
|
|
<div class="line"><a name="l05953"></a><span class="lineno"> 5953</span>  <span class="keywordflow">if</span> (committed) {</div>
|
|
<div class="line"><a name="l05954"></a><span class="lineno"> 5954</span>  <span class="comment">// Make unused_vehicle available</span></div>
|
|
<div class="line"><a name="l05955"></a><span class="lineno"> 5955</span>  <a class="code" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a>->ReinjectVehicleOfClass(</div>
|
|
<div class="line"><a name="l05956"></a><span class="lineno"> 5956</span>  unused_vehicle,</div>
|
|
<div class="line"><a name="l05957"></a><span class="lineno"> 5957</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->GetVehicleClassIndexOfVehicle(unused_vehicle).<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>(),</div>
|
|
<div class="line"><a name="l05958"></a><span class="lineno"> 5958</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->GetFixedCostOfVehicle(unused_vehicle));</div>
|
|
<div class="line"><a name="l05959"></a><span class="lineno"> 5959</span>  </div>
|
|
<div class="line"><a name="l05960"></a><span class="lineno"> 5960</span>  <span class="comment">// Update the first and last nodes on vehicles.</span></div>
|
|
<div class="line"><a name="l05961"></a><span class="lineno"> 5961</span>  first_node_on_route_[unused_vehicle] = -1;</div>
|
|
<div class="line"><a name="l05962"></a><span class="lineno"> 5962</span>  last_node_on_route_[unused_vehicle] = -1;</div>
|
|
<div class="line"><a name="l05963"></a><span class="lineno"> 5963</span>  vehicle_of_first_or_last_node_[before_node] = -1;</div>
|
|
<div class="line"><a name="l05964"></a><span class="lineno"> 5964</span>  vehicle_of_first_or_last_node_[after_node] = -1;</div>
|
|
<div class="line"><a name="l05965"></a><span class="lineno"> 5965</span>  first_node_on_route_[used_vehicle] = new_first_node;</div>
|
|
<div class="line"><a name="l05966"></a><span class="lineno"> 5966</span>  last_node_on_route_[used_vehicle] = new_last_node;</div>
|
|
<div class="line"><a name="l05967"></a><span class="lineno"> 5967</span>  vehicle_of_first_or_last_node_[new_last_node] = used_vehicle;</div>
|
|
<div class="line"><a name="l05968"></a><span class="lineno"> 5968</span>  vehicle_of_first_or_last_node_[new_first_node] = used_vehicle;</div>
|
|
<div class="line"><a name="l05969"></a><span class="lineno"> 5969</span>  }</div>
|
|
<div class="line"><a name="l05970"></a><span class="lineno"> 5970</span> }</div>
|
|
<div class="line"><a name="l05971"></a><span class="lineno"> 5971</span>  </div>
|
|
<div class="line"><a name="l05972"></a><span class="lineno"> 5972</span> <span class="comment">// ChristofidesFilteredHeuristic</span></div>
|
|
<div class="line"><a name="l05973"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_christofides_filtered_heuristic.html#af91a0a971d9bbdf32471d229a030a5fc"> 5973</a></span> <a class="code" href="classoperations__research_1_1_christofides_filtered_heuristic.html#af91a0a971d9bbdf32471d229a030a5fc">ChristofidesFilteredHeuristic::ChristofidesFilteredHeuristic</a>(</div>
|
|
<div class="line"><a name="l05974"></a><span class="lineno"> 5974</span>  <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager,</div>
|
|
<div class="line"><a name="l05975"></a><span class="lineno"> 5975</span>  <span class="keywordtype">bool</span> use_minimum_matching)</div>
|
|
<div class="line"><a name="l05976"></a><span class="lineno"> 5976</span>  : <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html">RoutingFilteredHeuristic</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, filter_manager),</div>
|
|
<div class="line"><a name="l05977"></a><span class="lineno"> 5977</span>  use_minimum_matching_(use_minimum_matching) {}</div>
|
|
<div class="line"><a name="l05978"></a><span class="lineno"> 5978</span>  </div>
|
|
<div class="line"><a name="l05979"></a><span class="lineno"> 5979</span> <span class="comment">// TODO(user): Support pickup & delivery.</span></div>
|
|
<div class="line"><a name="l05980"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_christofides_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289"> 5980</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_christofides_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">ChristofidesFilteredHeuristic::BuildSolutionInternal</a>() {</div>
|
|
<div class="line"><a name="l05981"></a><span class="lineno"> 5981</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a354dd8c252cf59b748602b342db6019d">Size</a>() - <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>() + 1;</div>
|
|
<div class="line"><a name="l05982"></a><span class="lineno"> 5982</span>  <span class="comment">// Node indices for Christofides solver.</span></div>
|
|
<div class="line"><a name="l05983"></a><span class="lineno"> 5983</span>  <span class="comment">// 0: start/end node</span></div>
|
|
<div class="line"><a name="l05984"></a><span class="lineno"> 5984</span>  <span class="comment">// >0: non start/end nodes</span></div>
|
|
<div class="line"><a name="l05985"></a><span class="lineno"> 5985</span>  <span class="comment">// TODO(user): Add robustness to fixed arcs by collapsing them into meta-</span></div>
|
|
<div class="line"><a name="l05986"></a><span class="lineno"> 5986</span>  <span class="comment">// nodes.</span></div>
|
|
<div class="line"><a name="l05987"></a><span class="lineno"> 5987</span>  std::vector<int> indices(1, 0);</div>
|
|
<div class="line"><a name="l05988"></a><span class="lineno"> 5988</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < size; ++i) {</div>
|
|
<div class="line"><a name="l05989"></a><span class="lineno"> 5989</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->IsStart(i) && !<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()->IsEnd(i)) {</div>
|
|
<div class="line"><a name="l05990"></a><span class="lineno"> 5990</span>  indices.push_back(i);</div>
|
|
<div class="line"><a name="l05991"></a><span class="lineno"> 5991</span>  }</div>
|
|
<div class="line"><a name="l05992"></a><span class="lineno"> 5992</span>  }</div>
|
|
<div class="line"><a name="l05993"></a><span class="lineno"> 5993</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_cost_classes = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#ad3b144985c2b4b24cf39b839dbd9c16d">GetCostClassesCount</a>();</div>
|
|
<div class="line"><a name="l05994"></a><span class="lineno"> 5994</span>  std::vector<std::vector<int>> path_per_cost_class(num_cost_classes);</div>
|
|
<div class="line"><a name="l05995"></a><span class="lineno"> 5995</span>  std::vector<bool> class_covered(num_cost_classes, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l05996"></a><span class="lineno"> 5996</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); ++vehicle) {</div>
|
|
<div class="line"><a name="l05997"></a><span class="lineno"> 5997</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cost_class =</div>
|
|
<div class="line"><a name="l05998"></a><span class="lineno"> 5998</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a32bba655accbd7dc8e23d30bf679b880">GetCostClassIndexOfVehicle</a>(vehicle).value();</div>
|
|
<div class="line"><a name="l05999"></a><span class="lineno"> 5999</span>  <span class="keywordflow">if</span> (!class_covered[cost_class]) {</div>
|
|
<div class="line"><a name="l06000"></a><span class="lineno"> 6000</span>  class_covered[cost_class] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l06001"></a><span class="lineno"> 6001</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_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(vehicle);</div>
|
|
<div class="line"><a name="l06002"></a><span class="lineno"> 6002</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_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a1dc8d32892f78532c8ee7a7186158e07">End</a>(vehicle);</div>
|
|
<div class="line"><a name="l06003"></a><span class="lineno"> 6003</span>  <span class="keyword">auto</span> <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a> = [<span class="keyword">this</span>, &indices, start, end, cost_class](<span class="keywordtype">int</span> from, <span class="keywordtype">int</span> to) {</div>
|
|
<div class="line"><a name="l06004"></a><span class="lineno"> 6004</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(from, indices.size());</div>
|
|
<div class="line"><a name="l06005"></a><span class="lineno"> 6005</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(to, indices.size());</div>
|
|
<div class="line"><a name="l06006"></a><span class="lineno"> 6006</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> from_index = (from == 0) ? start : indices[from];</div>
|
|
<div class="line"><a name="l06007"></a><span class="lineno"> 6007</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> to_index = (to == 0) ? end : indices[to];</div>
|
|
<div class="line"><a name="l06008"></a><span class="lineno"> 6008</span>  <span class="keyword">const</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="l06009"></a><span class="lineno"> 6009</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a92d7882c311f7d9d0c55c4def34150dd">GetArcCostForClass</a>(from_index, to_index, cost_class);</div>
|
|
<div class="line"><a name="l06010"></a><span class="lineno"> 6010</span>  <span class="comment">// To avoid overflow issues, capping costs at kint64max/2, the maximum</span></div>
|
|
<div class="line"><a name="l06011"></a><span class="lineno"> 6011</span>  <span class="comment">// value supported by MinCostPerfectMatching.</span></div>
|
|
<div class="line"><a name="l06012"></a><span class="lineno"> 6012</span>  <span class="comment">// TODO(user): Investigate if ChristofidesPathSolver should not</span></div>
|
|
<div class="line"><a name="l06013"></a><span class="lineno"> 6013</span>  <span class="comment">// return a status to bail out fast in case of problem.</span></div>
|
|
<div class="line"><a name="l06014"></a><span class="lineno"> 6014</span>  <span class="keywordflow">return</span> <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>, <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a> / 2);</div>
|
|
<div class="line"><a name="l06015"></a><span class="lineno"> 6015</span>  };</div>
|
|
<div class="line"><a name="l06016"></a><span class="lineno"> 6016</span>  <span class="keyword">using</span> Cost = decltype(<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>);</div>
|
|
<div class="line"><a name="l06017"></a><span class="lineno"> 6017</span>  <a class="code" href="classoperations__research_1_1_christofides_path_solver.html">ChristofidesPathSolver<int64, int64, int, Cost></a> christofides_solver(</div>
|
|
<div class="line"><a name="l06018"></a><span class="lineno"> 6018</span>  indices.size(), <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>);</div>
|
|
<div class="line"><a name="l06019"></a><span class="lineno"> 6019</span>  <span class="keywordflow">if</span> (use_minimum_matching_) {</div>
|
|
<div class="line"><a name="l06020"></a><span class="lineno"> 6020</span>  christofides_solver.<a class="code" href="classoperations__research_1_1_christofides_path_solver.html#ae2b64dddd58baf1bc5e01cb14971e52e">SetMatchingAlgorithm</a>(</div>
|
|
<div class="line"><a name="l06021"></a><span class="lineno"> 6021</span>  <a class="code" href="classoperations__research_1_1_christofides_path_solver.html#a1d4f082de5fc3eed348d65eb30b5f3e7">ChristofidesPathSolver<int64, int64, int, Cost>::MatchingAlgorithm</a>::</div>
|
|
<div class="line"><a name="l06022"></a><span class="lineno"> 6022</span>  MINIMUM_WEIGHT_MATCHING);</div>
|
|
<div class="line"><a name="l06023"></a><span class="lineno"> 6023</span>  }</div>
|
|
<div class="line"><a name="l06024"></a><span class="lineno"> 6024</span>  <span class="keywordflow">if</span> (christofides_solver.<a class="code" href="classoperations__research_1_1_christofides_path_solver.html#a942f29030f08426e7e318204e987e2f7">Solve</a>()) {</div>
|
|
<div class="line"><a name="l06025"></a><span class="lineno"> 6025</span>  path_per_cost_class[cost_class] =</div>
|
|
<div class="line"><a name="l06026"></a><span class="lineno"> 6026</span>  christofides_solver.<a class="code" href="classoperations__research_1_1_christofides_path_solver.html#a3076d9001536ea98d419faa81e7d8a47">TravelingSalesmanPath</a>();</div>
|
|
<div class="line"><a name="l06027"></a><span class="lineno"> 6027</span>  }</div>
|
|
<div class="line"><a name="l06028"></a><span class="lineno"> 6028</span>  }</div>
|
|
<div class="line"><a name="l06029"></a><span class="lineno"> 6029</span>  }</div>
|
|
<div class="line"><a name="l06030"></a><span class="lineno"> 6030</span>  <span class="comment">// TODO(user): Investigate if sorting paths per cost improves solutions.</span></div>
|
|
<div class="line"><a name="l06031"></a><span class="lineno"> 6031</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); ++vehicle) {</div>
|
|
<div class="line"><a name="l06032"></a><span class="lineno"> 6032</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cost_class =</div>
|
|
<div class="line"><a name="l06033"></a><span class="lineno"> 6033</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a32bba655accbd7dc8e23d30bf679b880">GetCostClassIndexOfVehicle</a>(vehicle).value();</div>
|
|
<div class="line"><a name="l06034"></a><span class="lineno"> 6034</span>  <span class="keyword">const</span> std::vector<int>& path = path_per_cost_class[cost_class];</div>
|
|
<div class="line"><a name="l06035"></a><span class="lineno"> 6035</span>  <span class="keywordflow">if</span> (path.empty()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l06036"></a><span class="lineno"> 6036</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(0, path[0]);</div>
|
|
<div class="line"><a name="l06037"></a><span class="lineno"> 6037</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(0, path.back());</div>
|
|
<div class="line"><a name="l06038"></a><span class="lineno"> 6038</span>  <span class="comment">// Extend route from start.</span></div>
|
|
<div class="line"><a name="l06039"></a><span class="lineno"> 6039</span>  <span class="keywordtype">int</span> prev = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a2ace3be57d4d81121e8ebbd3642052c0">GetStartChainEnd</a>(vehicle);</div>
|
|
<div class="line"><a name="l06040"></a><span class="lineno"> 6040</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> end = <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a1dc8d32892f78532c8ee7a7186158e07">End</a>(vehicle);</div>
|
|
<div class="line"><a name="l06041"></a><span class="lineno"> 6041</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < path.size() - 1 && prev != end; ++i) {</div>
|
|
<div class="line"><a name="l06042"></a><span class="lineno"> 6042</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l06043"></a><span class="lineno"> 6043</span>  <span class="keywordtype">int</span> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = indices[path[i]];</div>
|
|
<div class="line"><a name="l06044"></a><span class="lineno"> 6044</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">Contains</a>(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)) {</div>
|
|
<div class="line"><a name="l06045"></a><span class="lineno"> 6045</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(prev, <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a name="l06046"></a><span class="lineno"> 6046</span>  <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">SetValue</a>(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, end);</div>
|
|
<div class="line"><a name="l06047"></a><span class="lineno"> 6047</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>()) {</div>
|
|
<div class="line"><a name="l06048"></a><span class="lineno"> 6048</span>  prev = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l06049"></a><span class="lineno"> 6049</span>  }</div>
|
|
<div class="line"><a name="l06050"></a><span class="lineno"> 6050</span>  }</div>
|
|
<div class="line"><a name="l06051"></a><span class="lineno"> 6051</span>  }</div>
|
|
<div class="line"><a name="l06052"></a><span class="lineno"> 6052</span>  }</div>
|
|
<div class="line"><a name="l06053"></a><span class="lineno"> 6053</span>  <a class="code" href="classoperations__research_1_1_routing_filtered_heuristic.html#a97049801609b8cb68c0428970f916fd4">MakeUnassignedNodesUnperformed</a>();</div>
|
|
<div class="line"><a name="l06054"></a><span class="lineno"> 6054</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">Commit</a>();</div>
|
|
<div class="line"><a name="l06055"></a><span class="lineno"> 6055</span> }</div>
|
|
<div class="line"><a name="l06056"></a><span class="lineno"> 6056</span>  </div>
|
|
<div class="line"><a name="l06057"></a><span class="lineno"> 6057</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l06058"></a><span class="lineno"> 6058</span> <span class="comment">// The description is in routing.h:MakeGuidedSlackFinalizer</span></div>
|
|
<div class="line"><a name="l06059"></a><span class="lineno"> 6059</span> <span class="keyword">class </span>GuidedSlackFinalizer : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1_decision_builder.html">DecisionBuilder</a> {</div>
|
|
<div class="line"><a name="l06060"></a><span class="lineno"> 6060</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l06061"></a><span class="lineno"> 6061</span>  GuidedSlackFinalizer(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* dimension, <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div>
|
|
<div class="line"><a name="l06062"></a><span class="lineno"> 6062</span>  std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)> initializer);</div>
|
|
<div class="line"><a name="l06063"></a><span class="lineno"> 6063</span>  <a class="code" href="classoperations__research_1_1_decision.html">Decision</a>* Next(<a class="code" href="classoperations__research_1_1_solver.html">Solver</a>* solver) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l06064"></a><span class="lineno"> 6064</span>  </div>
|
|
<div class="line"><a name="l06065"></a><span class="lineno"> 6065</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l06066"></a><span class="lineno"> 6066</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> SelectValue(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l06067"></a><span class="lineno"> 6067</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> ChooseVariable();</div>
|
|
<div class="line"><a name="l06068"></a><span class="lineno"> 6068</span>  </div>
|
|
<div class="line"><a name="l06069"></a><span class="lineno"> 6069</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_;</div>
|
|
<div class="line"><a name="l06070"></a><span class="lineno"> 6070</span>  <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <span class="keyword">const</span> model_;</div>
|
|
<div class="line"><a name="l06071"></a><span class="lineno"> 6071</span>  <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)> initializer_;</div>
|
|
<div class="line"><a name="l06072"></a><span class="lineno"> 6072</span>  <a class="code" href="classoperations__research_1_1_rev_array.html">RevArray<bool></a> is_initialized_;</div>
|
|
<div class="line"><a name="l06073"></a><span class="lineno"> 6073</span>  std::vector<int64> initial_values_;</div>
|
|
<div class="line"><a name="l06074"></a><span class="lineno"> 6074</span>  <a class="code" href="classoperations__research_1_1_rev.html">Rev<int64></a> current_index_;</div>
|
|
<div class="line"><a name="l06075"></a><span class="lineno"> 6075</span>  <a class="code" href="classoperations__research_1_1_rev.html">Rev<int64></a> current_route_;</div>
|
|
<div class="line"><a name="l06076"></a><span class="lineno"> 6076</span>  <a class="code" href="classoperations__research_1_1_rev_array.html">RevArray<int64></a> last_delta_used_;</div>
|
|
<div class="line"><a name="l06077"></a><span class="lineno"> 6077</span>  </div>
|
|
<div class="line"><a name="l06078"></a><span class="lineno"> 6078</span>  <a class="code" href="macros_8h.html#af8df3547bfde53a5acb93e2607b0034a">DISALLOW_COPY_AND_ASSIGN</a>(GuidedSlackFinalizer);</div>
|
|
<div class="line"><a name="l06079"></a><span class="lineno"> 6079</span> };</div>
|
|
<div class="line"><a name="l06080"></a><span class="lineno"> 6080</span>  </div>
|
|
<div class="line"><a name="l06081"></a><span class="lineno"> 6081</span> GuidedSlackFinalizer::GuidedSlackFinalizer(</div>
|
|
<div class="line"><a name="l06082"></a><span class="lineno"> 6082</span>  <span class="keyword">const</span> RoutingDimension* dimension, RoutingModel* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div>
|
|
<div class="line"><a name="l06083"></a><span class="lineno"> 6083</span>  std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)> initializer)</div>
|
|
<div class="line"><a name="l06084"></a><span class="lineno"> 6084</span>  : dimension_(<a class="code" href="base_2logging_8h.html#aeef651f886eb5252c08835194213efe2">ABSL_DIE_IF_NULL</a>(dimension)),</div>
|
|
<div class="line"><a name="l06085"></a><span class="lineno"> 6085</span>  model_(<a class="code" href="base_2logging_8h.html#aeef651f886eb5252c08835194213efe2">ABSL_DIE_IF_NULL</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)),</div>
|
|
<div class="line"><a name="l06086"></a><span class="lineno"> 6086</span>  initializer_(std::move(initializer)),</div>
|
|
<div class="line"><a name="l06087"></a><span class="lineno"> 6087</span>  is_initialized_(dimension->slacks().size(), false),</div>
|
|
<div class="line"><a name="l06088"></a><span class="lineno"> 6088</span>  initial_values_(dimension->slacks().size(), <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>),</div>
|
|
<div class="line"><a name="l06089"></a><span class="lineno"> 6089</span>  current_index_(model_->Start(0)),</div>
|
|
<div class="line"><a name="l06090"></a><span class="lineno"> 6090</span>  current_route_(0),</div>
|
|
<div class="line"><a name="l06091"></a><span class="lineno"> 6091</span>  last_delta_used_(dimension->slacks().size(), 0) {}</div>
|
|
<div class="line"><a name="l06092"></a><span class="lineno"> 6092</span>  </div>
|
|
<div class="line"><a name="l06093"></a><span class="lineno"> 6093</span> Decision* GuidedSlackFinalizer::Next(Solver* solver) {</div>
|
|
<div class="line"><a name="l06094"></a><span class="lineno"> 6094</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(solver, model_-><a class="code" href="classoperations__research_1_1_routing_model.html#a5f32c22c620c811754ba7b6f977db864">solver</a>());</div>
|
|
<div class="line"><a name="l06095"></a><span class="lineno"> 6095</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> node_idx = ChooseVariable();</div>
|
|
<div class="line"><a name="l06096"></a><span class="lineno"> 6096</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(node_idx == -1 ||</div>
|
|
<div class="line"><a name="l06097"></a><span class="lineno"> 6097</span>  (node_idx >= 0 && node_idx < dimension_->slacks().size()));</div>
|
|
<div class="line"><a name="l06098"></a><span class="lineno"> 6098</span>  <span class="keywordflow">if</span> (node_idx != -1) {</div>
|
|
<div class="line"><a name="l06099"></a><span class="lineno"> 6099</span>  <span class="keywordflow">if</span> (!is_initialized_[node_idx]) {</div>
|
|
<div class="line"><a name="l06100"></a><span class="lineno"> 6100</span>  initial_values_[node_idx] = initializer_(node_idx);</div>
|
|
<div class="line"><a name="l06101"></a><span class="lineno"> 6101</span>  is_initialized_.SetValue(solver, node_idx, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l06102"></a><span class="lineno"> 6102</span>  }</div>
|
|
<div class="line"><a name="l06103"></a><span class="lineno"> 6103</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> = SelectValue(node_idx);</div>
|
|
<div class="line"><a name="l06104"></a><span class="lineno"> 6104</span>  IntVar* <span class="keyword">const</span> slack_variable = dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#ac300c6449a65333961d8abdd7ce40a7a">SlackVar</a>(node_idx);</div>
|
|
<div class="line"><a name="l06105"></a><span class="lineno"> 6105</span>  <span class="keywordflow">return</span> solver->MakeAssignVariableValue(slack_variable, <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>);</div>
|
|
<div class="line"><a name="l06106"></a><span class="lineno"> 6106</span>  }</div>
|
|
<div class="line"><a name="l06107"></a><span class="lineno"> 6107</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l06108"></a><span class="lineno"> 6108</span> }</div>
|
|
<div class="line"><a name="l06109"></a><span class="lineno"> 6109</span>  </div>
|
|
<div class="line"><a name="l06110"></a><span class="lineno"> 6110</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> GuidedSlackFinalizer::SelectValue(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l06111"></a><span class="lineno"> 6111</span>  <span class="keyword">const</span> IntVar* <span class="keyword">const</span> slack_variable = dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#ac300c6449a65333961d8abdd7ce40a7a">SlackVar</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l06112"></a><span class="lineno"> 6112</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> center = initial_values_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l06113"></a><span class="lineno"> 6113</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> max_delta =</div>
|
|
<div class="line"><a name="l06114"></a><span class="lineno"> 6114</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(center - slack_variable->Min(), slack_variable->Max() - center) +</div>
|
|
<div class="line"><a name="l06115"></a><span class="lineno"> 6115</span>  1;</div>
|
|
<div class="line"><a name="l06116"></a><span class="lineno"> 6116</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a> = last_delta_used_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l06117"></a><span class="lineno"> 6117</span>  </div>
|
|
<div class="line"><a name="l06118"></a><span class="lineno"> 6118</span>  <span class="comment">// The sequence of deltas is 0, 1, -1, 2, -2 ...</span></div>
|
|
<div class="line"><a name="l06119"></a><span class="lineno"> 6119</span>  <span class="comment">// Only the values inside the domain of variable are returned.</span></div>
|
|
<div class="line"><a name="l06120"></a><span class="lineno"> 6120</span>  <span class="keywordflow">while</span> (std::abs(<a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>) < max_delta &&</div>
|
|
<div class="line"><a name="l06121"></a><span class="lineno"> 6121</span>  !slack_variable->Contains(center + <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>)) {</div>
|
|
<div class="line"><a name="l06122"></a><span class="lineno"> 6122</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a> > 0) {</div>
|
|
<div class="line"><a name="l06123"></a><span class="lineno"> 6123</span>  <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a> = -<a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>;</div>
|
|
<div class="line"><a name="l06124"></a><span class="lineno"> 6124</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l06125"></a><span class="lineno"> 6125</span>  <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a> = -<a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a> + 1;</div>
|
|
<div class="line"><a name="l06126"></a><span class="lineno"> 6126</span>  }</div>
|
|
<div class="line"><a name="l06127"></a><span class="lineno"> 6127</span>  }</div>
|
|
<div class="line"><a name="l06128"></a><span class="lineno"> 6128</span>  last_delta_used_.SetValue(model_-><a class="code" href="classoperations__research_1_1_routing_model.html#a5f32c22c620c811754ba7b6f977db864">solver</a>(), <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>);</div>
|
|
<div class="line"><a name="l06129"></a><span class="lineno"> 6129</span>  <span class="keywordflow">return</span> center + <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>;</div>
|
|
<div class="line"><a name="l06130"></a><span class="lineno"> 6130</span> }</div>
|
|
<div class="line"><a name="l06131"></a><span class="lineno"> 6131</span>  </div>
|
|
<div class="line"><a name="l06132"></a><span class="lineno"> 6132</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> GuidedSlackFinalizer::ChooseVariable() {</div>
|
|
<div class="line"><a name="l06133"></a><span class="lineno"> 6133</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> int_current_node = current_index_.Value();</div>
|
|
<div class="line"><a name="l06134"></a><span class="lineno"> 6134</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> int_current_route = current_route_.Value();</div>
|
|
<div class="line"><a name="l06135"></a><span class="lineno"> 6135</span>  </div>
|
|
<div class="line"><a name="l06136"></a><span class="lineno"> 6136</span>  <span class="keywordflow">while</span> (int_current_route < model_->vehicles()) {</div>
|
|
<div class="line"><a name="l06137"></a><span class="lineno"> 6137</span>  <span class="keywordflow">while</span> (!model_-><a class="code" href="classoperations__research_1_1_routing_model.html#ae2530e17cabaf267e12929ca0ee1bee0">IsEnd</a>(int_current_node) &&</div>
|
|
<div class="line"><a name="l06138"></a><span class="lineno"> 6138</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#ac300c6449a65333961d8abdd7ce40a7a">SlackVar</a>(int_current_node)-><a class="code" href="classoperations__research_1_1_int_expr.html#a1d04569b37cb7fe6ed0956ab71e08bc9">Bound</a>()) {</div>
|
|
<div class="line"><a name="l06139"></a><span class="lineno"> 6139</span>  int_current_node = model_-><a class="code" href="classoperations__research_1_1_routing_model.html#a66fb44c05f9875685e9c332fbdfb643b">NextVar</a>(int_current_node)-><a class="code" href="classoperations__research_1_1_int_var.html#ac067bc2252cc65b1eb004d5285e5fdb2">Value</a>();</div>
|
|
<div class="line"><a name="l06140"></a><span class="lineno"> 6140</span>  }</div>
|
|
<div class="line"><a name="l06141"></a><span class="lineno"> 6141</span>  <span class="keywordflow">if</span> (!model_-><a class="code" href="classoperations__research_1_1_routing_model.html#ae2530e17cabaf267e12929ca0ee1bee0">IsEnd</a>(int_current_node)) {</div>
|
|
<div class="line"><a name="l06142"></a><span class="lineno"> 6142</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l06143"></a><span class="lineno"> 6143</span>  }</div>
|
|
<div class="line"><a name="l06144"></a><span class="lineno"> 6144</span>  int_current_route += 1;</div>
|
|
<div class="line"><a name="l06145"></a><span class="lineno"> 6145</span>  <span class="keywordflow">if</span> (int_current_route < model_->vehicles()) {</div>
|
|
<div class="line"><a name="l06146"></a><span class="lineno"> 6146</span>  int_current_node = model_-><a class="code" href="classoperations__research_1_1_routing_model.html#acbdbdfc9491ef0586459d38cc5ef4cb8">Start</a>(int_current_route);</div>
|
|
<div class="line"><a name="l06147"></a><span class="lineno"> 6147</span>  }</div>
|
|
<div class="line"><a name="l06148"></a><span class="lineno"> 6148</span>  }</div>
|
|
<div class="line"><a name="l06149"></a><span class="lineno"> 6149</span>  </div>
|
|
<div class="line"><a name="l06150"></a><span class="lineno"> 6150</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(int_current_route == model_-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>() ||</div>
|
|
<div class="line"><a name="l06151"></a><span class="lineno"> 6151</span>  !dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#ac300c6449a65333961d8abdd7ce40a7a">SlackVar</a>(int_current_node)-><a class="code" href="classoperations__research_1_1_int_expr.html#a1d04569b37cb7fe6ed0956ab71e08bc9">Bound</a>());</div>
|
|
<div class="line"><a name="l06152"></a><span class="lineno"> 6152</span>  current_index_.SetValue(model_-><a class="code" href="classoperations__research_1_1_routing_model.html#a5f32c22c620c811754ba7b6f977db864">solver</a>(), int_current_node);</div>
|
|
<div class="line"><a name="l06153"></a><span class="lineno"> 6153</span>  current_route_.SetValue(model_-><a class="code" href="classoperations__research_1_1_routing_model.html#a5f32c22c620c811754ba7b6f977db864">solver</a>(), int_current_route);</div>
|
|
<div class="line"><a name="l06154"></a><span class="lineno"> 6154</span>  <span class="keywordflow">if</span> (int_current_route < model_->vehicles()) {</div>
|
|
<div class="line"><a name="l06155"></a><span class="lineno"> 6155</span>  <span class="keywordflow">return</span> int_current_node;</div>
|
|
<div class="line"><a name="l06156"></a><span class="lineno"> 6156</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l06157"></a><span class="lineno"> 6157</span>  <span class="keywordflow">return</span> -1;</div>
|
|
<div class="line"><a name="l06158"></a><span class="lineno"> 6158</span>  }</div>
|
|
<div class="line"><a name="l06159"></a><span class="lineno"> 6159</span> }</div>
|
|
<div class="line"><a name="l06160"></a><span class="lineno"> 6160</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l06161"></a><span class="lineno"> 6161</span>  </div>
|
|
<div class="line"><a name="l06162"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_model.html#ad47a58a0bd5dbd3136c04369fdcd7f4c"> 6162</a></span> <a class="code" href="classoperations__research_1_1_decision_builder.html">DecisionBuilder</a>* <a class="code" href="classoperations__research_1_1_routing_model.html#ad47a58a0bd5dbd3136c04369fdcd7f4c">RoutingModel::MakeGuidedSlackFinalizer</a>(</div>
|
|
<div class="line"><a name="l06163"></a><span class="lineno"> 6163</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* dimension,</div>
|
|
<div class="line"><a name="l06164"></a><span class="lineno"> 6164</span>  std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)> initializer) {</div>
|
|
<div class="line"><a name="l06165"></a><span class="lineno"> 6165</span>  <span class="keywordflow">return</span> solver_->RevAlloc(</div>
|
|
<div class="line"><a name="l06166"></a><span class="lineno"> 6166</span>  <span class="keyword">new</span> GuidedSlackFinalizer(dimension, <span class="keyword">this</span>, std::move(initializer)));</div>
|
|
<div class="line"><a name="l06167"></a><span class="lineno"> 6167</span> }</div>
|
|
<div class="line"><a name="l06168"></a><span class="lineno"> 6168</span>  </div>
|
|
<div class="line"><a name="l06169"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_dimension.html#ab425ddb1df081fea8f527c63d824fb88"> 6169</a></span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="classoperations__research_1_1_routing_dimension.html#ab425ddb1df081fea8f527c63d824fb88">RoutingDimension::ShortestTransitionSlack</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l06170"></a><span class="lineno"> 6170</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(base_dimension_, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l06171"></a><span class="lineno"> 6171</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!model_-><a class="code" href="classoperations__research_1_1_routing_model.html#ae2530e17cabaf267e12929ca0ee1bee0">IsEnd</a>(node));</div>
|
|
<div class="line"><a name="l06172"></a><span class="lineno"> 6172</span>  <span class="comment">// Recall that the model is cumul[i+1] = cumul[i] + transit[i] + slack[i]. Our</span></div>
|
|
<div class="line"><a name="l06173"></a><span class="lineno"> 6173</span>  <span class="comment">// aim is to find a value for slack[i] such that cumul[i+1] + transit[i+1] is</span></div>
|
|
<div class="line"><a name="l06174"></a><span class="lineno"> 6174</span>  <span class="comment">// minimized.</span></div>
|
|
<div class="line"><a name="l06175"></a><span class="lineno"> 6175</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = model_-><a class="code" href="classoperations__research_1_1_routing_model.html#a66fb44c05f9875685e9c332fbdfb643b">NextVar</a>(node)-><a class="code" href="classoperations__research_1_1_int_var.html#ac067bc2252cc65b1eb004d5285e5fdb2">Value</a>();</div>
|
|
<div class="line"><a name="l06176"></a><span class="lineno"> 6176</span>  <span class="keywordflow">if</span> (model_-><a class="code" href="classoperations__research_1_1_routing_model.html#ae2530e17cabaf267e12929ca0ee1bee0">IsEnd</a>(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)) {</div>
|
|
<div class="line"><a name="l06177"></a><span class="lineno"> 6177</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html#ac300c6449a65333961d8abdd7ce40a7a">SlackVar</a>(node)-><a class="code" href="classoperations__research_1_1_int_expr.html#ac4a4f30badcd311075302a4efcfaee0a">Min</a>();</div>
|
|
<div class="line"><a name="l06178"></a><span class="lineno"> 6178</span>  }</div>
|
|
<div class="line"><a name="l06179"></a><span class="lineno"> 6179</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> next_next = model_-><a class="code" href="classoperations__research_1_1_routing_model.html#a66fb44c05f9875685e9c332fbdfb643b">NextVar</a>(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)-><a class="code" href="classoperations__research_1_1_int_var.html#ac067bc2252cc65b1eb004d5285e5fdb2">Value</a>();</div>
|
|
<div class="line"><a name="l06180"></a><span class="lineno"> 6180</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> serving_vehicle = model_-><a class="code" href="classoperations__research_1_1_routing_model.html#a8cded3d3d6746c179a8ec0eddad24342">VehicleVar</a>(node)-><a class="code" href="classoperations__research_1_1_int_var.html#ac067bc2252cc65b1eb004d5285e5fdb2">Value</a>();</div>
|
|
<div class="line"><a name="l06181"></a><span class="lineno"> 6181</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(serving_vehicle, model_-><a class="code" href="classoperations__research_1_1_routing_model.html#a8cded3d3d6746c179a8ec0eddad24342">VehicleVar</a>(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)-><a class="code" href="classoperations__research_1_1_int_var.html#ac067bc2252cc65b1eb004d5285e5fdb2">Value</a>());</div>
|
|
<div class="line"><a name="l06182"></a><span class="lineno"> 6182</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1_routing_model_1_1_state_dependent_transit.html">RoutingModel::StateDependentTransit</a> transit_from_next =</div>
|
|
<div class="line"><a name="l06183"></a><span class="lineno"> 6183</span>  model_-><a class="code" href="classoperations__research_1_1_routing_model.html#ac0772bdc4f47e45edccd5a5c25154993">StateDependentTransitCallback</a>(</div>
|
|
<div class="line"><a name="l06184"></a><span class="lineno"> 6184</span>  state_dependent_class_evaluators_</div>
|
|
<div class="line"><a name="l06185"></a><span class="lineno"> 6185</span>  [state_dependent_vehicle_to_class_[serving_vehicle]])(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>,</div>
|
|
<div class="line"><a name="l06186"></a><span class="lineno"> 6186</span>  next_next);</div>
|
|
<div class="line"><a name="l06187"></a><span class="lineno"> 6187</span>  <span class="comment">// We have that transit[i+1] is a function of cumul[i+1].</span></div>
|
|
<div class="line"><a name="l06188"></a><span class="lineno"> 6188</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> next_cumul_min = <a class="code" href="classoperations__research_1_1_routing_dimension.html#a4d87db39b37a97bcf6669448a67f0356">CumulVar</a>(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)-><a class="code" href="classoperations__research_1_1_int_expr.html#ac4a4f30badcd311075302a4efcfaee0a">Min</a>();</div>
|
|
<div class="line"><a name="l06189"></a><span class="lineno"> 6189</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> next_cumul_max = <a class="code" href="classoperations__research_1_1_routing_dimension.html#a4d87db39b37a97bcf6669448a67f0356">CumulVar</a>(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)-><a class="code" href="classoperations__research_1_1_int_expr.html#a6dc4d5cdc2ed0da18452a65c5bf69e0d">Max</a>();</div>
|
|
<div class="line"><a name="l06190"></a><span class="lineno"> 6190</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> optimal_next_cumul =</div>
|
|
<div class="line"><a name="l06191"></a><span class="lineno"> 6191</span>  transit_from_next.<a class="code" href="structoperations__research_1_1_routing_model_1_1_state_dependent_transit.html#ab71e287979b5c9040d1596d12ed3bb5f">transit_plus_identity</a>-><a class="code" href="classoperations__research_1_1_range_min_max_index_function.html#ac2d7168eb18527ad8a1c4ad10451c492">RangeMinArgument</a>(</div>
|
|
<div class="line"><a name="l06192"></a><span class="lineno"> 6192</span>  next_cumul_min, next_cumul_max + 1);</div>
|
|
<div class="line"><a name="l06193"></a><span class="lineno"> 6193</span>  <span class="comment">// A few checks to make sure we're on the same page.</span></div>
|
|
<div class="line"><a name="l06194"></a><span class="lineno"> 6194</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(next_cumul_min, optimal_next_cumul);</div>
|
|
<div class="line"><a name="l06195"></a><span class="lineno"> 6195</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(optimal_next_cumul, next_cumul_max);</div>
|
|
<div class="line"><a name="l06196"></a><span class="lineno"> 6196</span>  <span class="comment">// optimal_next_cumul = cumul + transit + optimal_slack, so</span></div>
|
|
<div class="line"><a name="l06197"></a><span class="lineno"> 6197</span>  <span class="comment">// optimal_slack = optimal_next_cumul - cumul - transit.</span></div>
|
|
<div class="line"><a name="l06198"></a><span class="lineno"> 6198</span>  <span class="comment">// In the current implementation TransitVar(i) = transit[i] + slack[i], so we</span></div>
|
|
<div class="line"><a name="l06199"></a><span class="lineno"> 6199</span>  <span class="comment">// have to find the transit from the evaluators.</span></div>
|
|
<div class="line"><a name="l06200"></a><span class="lineno"> 6200</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> current_cumul = <a class="code" href="classoperations__research_1_1_routing_dimension.html#a4d87db39b37a97bcf6669448a67f0356">CumulVar</a>(node)-><a class="code" href="classoperations__research_1_1_int_var.html#ac067bc2252cc65b1eb004d5285e5fdb2">Value</a>();</div>
|
|
<div class="line"><a name="l06201"></a><span class="lineno"> 6201</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> current_state_independent_transit = model_-><a class="code" href="classoperations__research_1_1_routing_model.html#ad558398f8c75f81d879f74d18ba5e7c3">TransitCallback</a>(</div>
|
|
<div class="line"><a name="l06202"></a><span class="lineno"> 6202</span>  class_evaluators_[vehicle_to_class_[serving_vehicle]])(node, <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a name="l06203"></a><span class="lineno"> 6203</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> current_state_dependent_transit =</div>
|
|
<div class="line"><a name="l06204"></a><span class="lineno"> 6204</span>  model_</div>
|
|
<div class="line"><a name="l06205"></a><span class="lineno"> 6205</span>  -><a class="code" href="classoperations__research_1_1_routing_model.html#ac0772bdc4f47e45edccd5a5c25154993">StateDependentTransitCallback</a>(</div>
|
|
<div class="line"><a name="l06206"></a><span class="lineno"> 6206</span>  state_dependent_class_evaluators_</div>
|
|
<div class="line"><a name="l06207"></a><span class="lineno"> 6207</span>  [state_dependent_vehicle_to_class_[serving_vehicle]])(node,</div>
|
|
<div class="line"><a name="l06208"></a><span class="lineno"> 6208</span>  <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)</div>
|
|
<div class="line"><a name="l06209"></a><span class="lineno"> 6209</span>  .transit->Query(current_cumul);</div>
|
|
<div class="line"><a name="l06210"></a><span class="lineno"> 6210</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> optimal_slack = optimal_next_cumul - current_cumul -</div>
|
|
<div class="line"><a name="l06211"></a><span class="lineno"> 6211</span>  current_state_independent_transit -</div>
|
|
<div class="line"><a name="l06212"></a><span class="lineno"> 6212</span>  current_state_dependent_transit;</div>
|
|
<div class="line"><a name="l06213"></a><span class="lineno"> 6213</span>  <a class="code" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(<a class="code" href="classoperations__research_1_1_routing_dimension.html#ac300c6449a65333961d8abdd7ce40a7a">SlackVar</a>(node)->Min(), optimal_slack);</div>
|
|
<div class="line"><a name="l06214"></a><span class="lineno"> 6214</span>  <a class="code" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(optimal_slack, <a class="code" href="classoperations__research_1_1_routing_dimension.html#ac300c6449a65333961d8abdd7ce40a7a">SlackVar</a>(node)->Max());</div>
|
|
<div class="line"><a name="l06215"></a><span class="lineno"> 6215</span>  <span class="keywordflow">return</span> optimal_slack;</div>
|
|
<div class="line"><a name="l06216"></a><span class="lineno"> 6216</span> }</div>
|
|
<div class="line"><a name="l06217"></a><span class="lineno"> 6217</span>  </div>
|
|
<div class="line"><a name="l06218"></a><span class="lineno"> 6218</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l06219"></a><span class="lineno"> 6219</span> <span class="keyword">class </span>GreedyDescentLSOperator : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1_local_search_operator.html">LocalSearchOperator</a> {</div>
|
|
<div class="line"><a name="l06220"></a><span class="lineno"> 6220</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l06221"></a><span class="lineno"> 6221</span>  <span class="keyword">explicit</span> GreedyDescentLSOperator(std::vector<IntVar*> variables);</div>
|
|
<div class="line"><a name="l06222"></a><span class="lineno"> 6222</span>  </div>
|
|
<div class="line"><a name="l06223"></a><span class="lineno"> 6223</span>  <span class="keywordtype">bool</span> MakeNextNeighbor(<a class="code" href="classoperations__research_1_1_assignment.html">Assignment</a>* <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>, <a class="code" href="classoperations__research_1_1_assignment.html">Assignment</a>* deltadelta) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l06224"></a><span class="lineno"> 6224</span>  <span class="keywordtype">void</span> Start(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_assignment.html">Assignment</a>* assignment) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a name="l06225"></a><span class="lineno"> 6225</span>  </div>
|
|
<div class="line"><a name="l06226"></a><span class="lineno"> 6226</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l06227"></a><span class="lineno"> 6227</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> FindMaxDistanceToDomain(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_assignment.html">Assignment</a>* assignment);</div>
|
|
<div class="line"><a name="l06228"></a><span class="lineno"> 6228</span>  </div>
|
|
<div class="line"><a name="l06229"></a><span class="lineno"> 6229</span>  <span class="keyword">const</span> std::vector<IntVar*> variables_;</div>
|
|
<div class="line"><a name="l06230"></a><span class="lineno"> 6230</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_assignment.html">Assignment</a>* center_;</div>
|
|
<div class="line"><a name="l06231"></a><span class="lineno"> 6231</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> current_step_;</div>
|
|
<div class="line"><a name="l06232"></a><span class="lineno"> 6232</span>  <span class="comment">// The deltas are returned in this order:</span></div>
|
|
<div class="line"><a name="l06233"></a><span class="lineno"> 6233</span>  <span class="comment">// (current_step_, 0, ... 0), (-current_step_, 0, ... 0),</span></div>
|
|
<div class="line"><a name="l06234"></a><span class="lineno"> 6234</span>  <span class="comment">// (0, current_step_, ... 0), (0, -current_step_, ... 0),</span></div>
|
|
<div class="line"><a name="l06235"></a><span class="lineno"> 6235</span>  <span class="comment">// ...</span></div>
|
|
<div class="line"><a name="l06236"></a><span class="lineno"> 6236</span>  <span class="comment">// (0, ... 0, current_step_), (0, ... 0, -current_step_).</span></div>
|
|
<div class="line"><a name="l06237"></a><span class="lineno"> 6237</span>  <span class="comment">// current_direction_ keeps track what was the last returned delta.</span></div>
|
|
<div class="line"><a name="l06238"></a><span class="lineno"> 6238</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> current_direction_;</div>
|
|
<div class="line"><a name="l06239"></a><span class="lineno"> 6239</span>  </div>
|
|
<div class="line"><a name="l06240"></a><span class="lineno"> 6240</span>  <a class="code" href="macros_8h.html#af8df3547bfde53a5acb93e2607b0034a">DISALLOW_COPY_AND_ASSIGN</a>(GreedyDescentLSOperator);</div>
|
|
<div class="line"><a name="l06241"></a><span class="lineno"> 6241</span> };</div>
|
|
<div class="line"><a name="l06242"></a><span class="lineno"> 6242</span>  </div>
|
|
<div class="line"><a name="l06243"></a><span class="lineno"> 6243</span> GreedyDescentLSOperator::GreedyDescentLSOperator(std::vector<IntVar*> variables)</div>
|
|
<div class="line"><a name="l06244"></a><span class="lineno"> 6244</span>  : variables_(std::move(variables)),</div>
|
|
<div class="line"><a name="l06245"></a><span class="lineno"> 6245</span>  center_(nullptr),</div>
|
|
<div class="line"><a name="l06246"></a><span class="lineno"> 6246</span>  current_step_(0),</div>
|
|
<div class="line"><a name="l06247"></a><span class="lineno"> 6247</span>  current_direction_(0) {}</div>
|
|
<div class="line"><a name="l06248"></a><span class="lineno"> 6248</span>  </div>
|
|
<div class="line"><a name="l06249"></a><span class="lineno"> 6249</span> <span class="keywordtype">bool</span> GreedyDescentLSOperator::MakeNextNeighbor(Assignment* <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>,</div>
|
|
<div class="line"><a name="l06250"></a><span class="lineno"> 6250</span>  Assignment* <span class="comment">/*deltadelta*/</span>) {</div>
|
|
<div class="line"><a name="l06251"></a><span class="lineno"> 6251</span>  <span class="keyword">static</span> <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> sings[] = {1, -1};</div>
|
|
<div class="line"><a name="l06252"></a><span class="lineno"> 6252</span>  <span class="keywordflow">for</span> (; 1 <= current_step_; current_step_ /= 2) {</div>
|
|
<div class="line"><a name="l06253"></a><span class="lineno"> 6253</span>  <span class="keywordflow">for</span> (; current_direction_ < 2 * variables_.size();) {</div>
|
|
<div class="line"><a name="l06254"></a><span class="lineno"> 6254</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> variable_idx = current_direction_ / 2;</div>
|
|
<div class="line"><a name="l06255"></a><span class="lineno"> 6255</span>  IntVar* <span class="keyword">const</span> variable = variables_[variable_idx];</div>
|
|
<div class="line"><a name="l06256"></a><span class="lineno"> 6256</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> sign_index = current_direction_ % 2;</div>
|
|
<div class="line"><a name="l06257"></a><span class="lineno"> 6257</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> sign = sings[sign_index];</div>
|
|
<div class="line"><a name="l06258"></a><span class="lineno"> 6258</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> offset = sign * current_step_;</div>
|
|
<div class="line"><a name="l06259"></a><span class="lineno"> 6259</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> new_value = center_-><a class="code" href="classoperations__research_1_1_assignment.html#a0db03cadd37e821f6c41924575188d72">Value</a>(variable) + offset;</div>
|
|
<div class="line"><a name="l06260"></a><span class="lineno"> 6260</span>  ++current_direction_;</div>
|
|
<div class="line"><a name="l06261"></a><span class="lineno"> 6261</span>  <span class="keywordflow">if</span> (variable->Contains(new_value)) {</div>
|
|
<div class="line"><a name="l06262"></a><span class="lineno"> 6262</span>  <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>->Add(variable);</div>
|
|
<div class="line"><a name="l06263"></a><span class="lineno"> 6263</span>  <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>->SetValue(variable, new_value);</div>
|
|
<div class="line"><a name="l06264"></a><span class="lineno"> 6264</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l06265"></a><span class="lineno"> 6265</span>  }</div>
|
|
<div class="line"><a name="l06266"></a><span class="lineno"> 6266</span>  }</div>
|
|
<div class="line"><a name="l06267"></a><span class="lineno"> 6267</span>  current_direction_ = 0;</div>
|
|
<div class="line"><a name="l06268"></a><span class="lineno"> 6268</span>  }</div>
|
|
<div class="line"><a name="l06269"></a><span class="lineno"> 6269</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l06270"></a><span class="lineno"> 6270</span> }</div>
|
|
<div class="line"><a name="l06271"></a><span class="lineno"> 6271</span>  </div>
|
|
<div class="line"><a name="l06272"></a><span class="lineno"> 6272</span> <span class="keywordtype">void</span> GreedyDescentLSOperator::Start(<span class="keyword">const</span> Assignment* assignment) {</div>
|
|
<div class="line"><a name="l06273"></a><span class="lineno"> 6273</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(assignment != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l06274"></a><span class="lineno"> 6274</span>  current_step_ = FindMaxDistanceToDomain(assignment);</div>
|
|
<div class="line"><a name="l06275"></a><span class="lineno"> 6275</span>  center_ = assignment;</div>
|
|
<div class="line"><a name="l06276"></a><span class="lineno"> 6276</span> }</div>
|
|
<div class="line"><a name="l06277"></a><span class="lineno"> 6277</span>  </div>
|
|
<div class="line"><a name="l06278"></a><span class="lineno"> 6278</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> GreedyDescentLSOperator::FindMaxDistanceToDomain(</div>
|
|
<div class="line"><a name="l06279"></a><span class="lineno"> 6279</span>  <span class="keyword">const</span> Assignment* assignment) {</div>
|
|
<div class="line"><a name="l06280"></a><span class="lineno"> 6280</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> result = <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>;</div>
|
|
<div class="line"><a name="l06281"></a><span class="lineno"> 6281</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : variables_) {</div>
|
|
<div class="line"><a name="l06282"></a><span class="lineno"> 6282</span>  result = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(result, std::abs(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>-><a class="code" href="classoperations__research_1_1_int_expr.html#a6dc4d5cdc2ed0da18452a65c5bf69e0d">Max</a>() - assignment->Value(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)));</div>
|
|
<div class="line"><a name="l06283"></a><span class="lineno"> 6283</span>  result = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(result, std::abs(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>-><a class="code" href="classoperations__research_1_1_int_expr.html#ac4a4f30badcd311075302a4efcfaee0a">Min</a>() - assignment->Value(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)));</div>
|
|
<div class="line"><a name="l06284"></a><span class="lineno"> 6284</span>  }</div>
|
|
<div class="line"><a name="l06285"></a><span class="lineno"> 6285</span>  <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a name="l06286"></a><span class="lineno"> 6286</span> }</div>
|
|
<div class="line"><a name="l06287"></a><span class="lineno"> 6287</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l06288"></a><span class="lineno"> 6288</span>  </div>
|
|
<div class="line"><a name="l06289"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_model.html#a43b2c4a7a4f58c02ca36ed0a4d76a3b4"> 6289</a></span> std::unique_ptr<LocalSearchOperator> <a class="code" href="classoperations__research_1_1_routing_model.html#a43b2c4a7a4f58c02ca36ed0a4d76a3b4">RoutingModel::MakeGreedyDescentLSOperator</a>(</div>
|
|
<div class="line"><a name="l06290"></a><span class="lineno"> 6290</span>  std::vector<IntVar*> variables) {</div>
|
|
<div class="line"><a name="l06291"></a><span class="lineno"> 6291</span>  <span class="keywordflow">return</span> std::unique_ptr<LocalSearchOperator>(</div>
|
|
<div class="line"><a name="l06292"></a><span class="lineno"> 6292</span>  <span class="keyword">new</span> GreedyDescentLSOperator(std::move(variables)));</div>
|
|
<div class="line"><a name="l06293"></a><span class="lineno"> 6293</span> }</div>
|
|
<div class="line"><a name="l06294"></a><span class="lineno"> 6294</span>  </div>
|
|
<div class="line"><a name="l06295"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_model.html#acb94aaffe504b1b6873c3400a8edceaa"> 6295</a></span> <a class="code" href="classoperations__research_1_1_decision_builder.html">DecisionBuilder</a>* <a class="code" href="classoperations__research_1_1_routing_model.html#acb94aaffe504b1b6873c3400a8edceaa">RoutingModel::MakeSelfDependentDimensionFinalizer</a>(</div>
|
|
<div class="line"><a name="l06296"></a><span class="lineno"> 6296</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* dimension) {</div>
|
|
<div class="line"><a name="l06297"></a><span class="lineno"> 6297</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(dimension != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l06298"></a><span class="lineno"> 6298</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(dimension-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a717341229f16012899360656534bba50">base_dimension</a>() == dimension);</div>
|
|
<div class="line"><a name="l06299"></a><span class="lineno"> 6299</span>  std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)> slack_guide = [dimension](<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l06300"></a><span class="lineno"> 6300</span>  <span class="keywordflow">return</span> dimension-><a class="code" href="classoperations__research_1_1_routing_dimension.html#ab425ddb1df081fea8f527c63d824fb88">ShortestTransitionSlack</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l06301"></a><span class="lineno"> 6301</span>  };</div>
|
|
<div class="line"><a name="l06302"></a><span class="lineno"> 6302</span>  <a class="code" href="classoperations__research_1_1_decision_builder.html">DecisionBuilder</a>* <span class="keyword">const</span> guided_finalizer =</div>
|
|
<div class="line"><a name="l06303"></a><span class="lineno"> 6303</span>  <a class="code" href="classoperations__research_1_1_routing_model.html#ad47a58a0bd5dbd3136c04369fdcd7f4c">MakeGuidedSlackFinalizer</a>(dimension, slack_guide);</div>
|
|
<div class="line"><a name="l06304"></a><span class="lineno"> 6304</span>  <a class="code" href="classoperations__research_1_1_decision_builder.html">DecisionBuilder</a>* <span class="keyword">const</span> slacks_finalizer =</div>
|
|
<div class="line"><a name="l06305"></a><span class="lineno"> 6305</span>  solver_->MakeSolveOnce(guided_finalizer);</div>
|
|
<div class="line"><a name="l06306"></a><span class="lineno"> 6306</span>  std::vector<IntVar*> start_cumuls(vehicles_, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l06307"></a><span class="lineno"> 6307</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> vehicle_idx = 0; vehicle_idx < vehicles_; ++vehicle_idx) {</div>
|
|
<div class="line"><a name="l06308"></a><span class="lineno"> 6308</span>  start_cumuls[vehicle_idx] = dimension-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a4d87db39b37a97bcf6669448a67f0356">CumulVar</a>(starts_[vehicle_idx]);</div>
|
|
<div class="line"><a name="l06309"></a><span class="lineno"> 6309</span>  }</div>
|
|
<div class="line"><a name="l06310"></a><span class="lineno"> 6310</span>  <a class="code" href="classoperations__research_1_1_local_search_operator.html">LocalSearchOperator</a>* <span class="keyword">const</span> hill_climber =</div>
|
|
<div class="line"><a name="l06311"></a><span class="lineno"> 6311</span>  solver_->RevAlloc(<span class="keyword">new</span> GreedyDescentLSOperator(start_cumuls));</div>
|
|
<div class="line"><a name="l06312"></a><span class="lineno"> 6312</span>  <a class="code" href="classoperations__research_1_1_local_search_phase_parameters.html">LocalSearchPhaseParameters</a>* <span class="keyword">const</span> <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a> =</div>
|
|
<div class="line"><a name="l06313"></a><span class="lineno"> 6313</span>  solver_->MakeLocalSearchPhaseParameters(<a class="code" href="classoperations__research_1_1_routing_model.html#abcbe77312783c0a5aa4926ace764533b">CostVar</a>(), hill_climber,</div>
|
|
<div class="line"><a name="l06314"></a><span class="lineno"> 6314</span>  slacks_finalizer);</div>
|
|
<div class="line"><a name="l06315"></a><span class="lineno"> 6315</span>  <a class="code" href="classoperations__research_1_1_assignment.html">Assignment</a>* <span class="keyword">const</span> first_solution = solver_->MakeAssignment();</div>
|
|
<div class="line"><a name="l06316"></a><span class="lineno"> 6316</span>  first_solution-><a class="code" href="classoperations__research_1_1_assignment.html#ae8ff1d18d50b93a2499ccd7130addecb">Add</a>(start_cumuls);</div>
|
|
<div class="line"><a name="l06317"></a><span class="lineno"> 6317</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1_int_var.html">IntVar</a>* <span class="keyword">const</span> cumul : start_cumuls) {</div>
|
|
<div class="line"><a name="l06318"></a><span class="lineno"> 6318</span>  first_solution-><a class="code" href="classoperations__research_1_1_assignment.html#ac462499a646c751d153e599b22f1d782">SetValue</a>(cumul, cumul->Min());</div>
|
|
<div class="line"><a name="l06319"></a><span class="lineno"> 6319</span>  }</div>
|
|
<div class="line"><a name="l06320"></a><span class="lineno"> 6320</span>  <a class="code" href="classoperations__research_1_1_decision_builder.html">DecisionBuilder</a>* <span class="keyword">const</span> finalizer =</div>
|
|
<div class="line"><a name="l06321"></a><span class="lineno"> 6321</span>  solver_->MakeLocalSearchPhase(first_solution, <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>);</div>
|
|
<div class="line"><a name="l06322"></a><span class="lineno"> 6322</span>  <span class="keywordflow">return</span> finalizer;</div>
|
|
<div class="line"><a name="l06323"></a><span class="lineno"> 6323</span> }</div>
|
|
<div class="line"><a name="l06324"></a><span class="lineno"> 6324</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_a151248525a9e07eb3e6e60ea1c4995eb"><div class="ttname"><a href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a></div><div class="ttdeci">const std::vector< IntVar * > vars_</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00043">alldiff_cst.cc:43</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_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00495">base/logging.h:495</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_a46e69120fbd3b36e6960e096d23b66f0"><div class="ttname"><a href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a></div><div class="ttdeci">#define DCHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00886">base/logging.h:886</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a4bd2e815ca2f702a4b6aa744b1ff3b82"><div class="ttname"><a href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a></div><div class="ttdeci">#define CHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00700">base/logging.h:700</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00697">base/logging.h:697</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7cc25402ecd7591b4c39934dd656b1f9"><div class="ttname"><a href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a></div><div class="ttdeci">#define CHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00701">base/logging.h:701</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7e03ec13560fa94a8fea569960d7efc6"><div class="ttname"><a href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a></div><div class="ttdeci">#define CHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00702">base/logging.h:702</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_aae2dc65d9ea248d54bf39daa986dd295"><div class="ttname"><a href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a></div><div class="ttdeci">#define DCHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00889">base/logging.h:889</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ab4f56aa24c4c9cddc47a6abd2d747f9a"><div class="ttname"><a href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a></div><div class="ttdeci">#define DCHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00890">base/logging.h:890</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ab62f5ed8f2d48e29802be0cbbcd1359a"><div class="ttname"><a href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a></div><div class="ttdeci">#define DCHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00888">base/logging.h:888</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00884">base/logging.h:884</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae4db23f10f5d4aad6d735f5a74cd6f8c"><div class="ttname"><a href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a></div><div class="ttdeci">#define CHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00699">base/logging.h:699</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae89df3243bbb8341130c7b3f44145ea0"><div class="ttname"><a href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a></div><div class="ttdeci">#define DCHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00885">base/logging.h:885</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_aeef651f886eb5252c08835194213efe2"><div class="ttname"><a href="base_2logging_8h.html#aeef651f886eb5252c08835194213efe2">ABSL_DIE_IF_NULL</a></div><div class="ttdeci">#define ABSL_DIE_IF_NULL</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00039">base/logging.h:39</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="abitset_8h_html"><div class="ttname"><a href="bitset_8h.html">bitset.h</a></div></div>
|
|
<div class="ttc" id="achristofides_8h_html"><div class="ttname"><a href="christofides_8h.html">christofides.h</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html"><div class="ttname"><a href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a></div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00038">adjustable_priority_queue.h:38</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html_a36647f60b5f27624275724445403ea1d"><div class="ttname"><a href="class_adjustable_priority_queue.html#a36647f60b5f27624275724445403ea1d">AdjustablePriorityQueue::Remove</a></div><div class="ttdeci">void Remove(T *val)</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00056">adjustable_priority_queue.h:56</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html_a3851da81ad9a9c858fc40be1f3f7baf2"><div class="ttname"><a href="class_adjustable_priority_queue.html#a3851da81ad9a9c858fc40be1f3f7baf2">AdjustablePriorityQueue::Raw</a></div><div class="ttdeci">const std::vector< T * > * Raw() const</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00151">adjustable_priority_queue.h:151</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html_a506169056c5f470fabdf77aa1934a5a3"><div class="ttname"><a href="class_adjustable_priority_queue.html#a506169056c5f470fabdf77aa1934a5a3">AdjustablePriorityQueue::NoteChangedPriority</a></div><div class="ttdeci">void NoteChangedPriority(T *val)</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00074">adjustable_priority_queue.h:74</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html_a7d1005d75f40525f91a2acb84348bc3c"><div class="ttname"><a href="class_adjustable_priority_queue.html#a7d1005d75f40525f91a2acb84348bc3c">AdjustablePriorityQueue::Contains</a></div><div class="ttdeci">bool Contains(const T *val) const</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00069">adjustable_priority_queue.h:69</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html_a8e12342fc420701fbffd97025421575a"><div class="ttname"><a href="class_adjustable_priority_queue.html#a8e12342fc420701fbffd97025421575a">AdjustablePriorityQueue::IsEmpty</a></div><div class="ttdeci">bool IsEmpty() const</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00127">adjustable_priority_queue.h:127</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html_a8e7578f2135632c4d0ce66fd5936231e"><div class="ttname"><a href="class_adjustable_priority_queue.html#a8e7578f2135632c4d0ce66fd5936231e">AdjustablePriorityQueue::Top</a></div><div class="ttdeci">T * Top()</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00087">adjustable_priority_queue.h:87</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="class_adjustable_priority_queue.html#aa71d36872f416feaa853788a7a7a7ef8">AdjustablePriorityQueue::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00129">adjustable_priority_queue.h:129</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html_ac312fa979ea8afd5deabd6b581b3bb1f"><div class="ttname"><a href="class_adjustable_priority_queue.html#ac312fa979ea8afd5deabd6b581b3bb1f">AdjustablePriorityQueue::Add</a></div><div class="ttdeci">void Add(T *val)</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00049">adjustable_priority_queue.h:49</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html"><div class="ttname"><a href="classabsl_1_1_strong_vector.html">absl::StrongVector</a></div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00076">strong_vector.h:76</a></div></div>
|
|
<div class="ttc" id="aclassgtl_1_1small__map_html"><div class="ttname"><a href="classgtl_1_1small__map.html">gtl::small_map</a></div><div class="ttdef"><b>Definition:</b> <a href="small__map_8h_source.html#l00019">small_map.h:19</a></div></div>
|
|
<div class="ttc" id="aclassgtl_1_1small__ordered__set_html"><div class="ttname"><a href="classgtl_1_1small__ordered__set.html">gtl::small_ordered_set</a></div><div class="ttdef"><b>Definition:</b> <a href="small__ordered__set_8h_source.html#l00019">small_ordered_set.h:19</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_container_html"><div class="ttname"><a href="classoperations__research_1_1_assignment_container.html">operations_research::AssignmentContainer< IntVar, IntVarElement ></a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_container_html_a24926108b770033792d015cb86aeffb3"><div class="ttname"><a href="classoperations__research_1_1_assignment_container.html#a24926108b770033792d015cb86aeffb3">operations_research::AssignmentContainer::Size</a></div><div class="ttdeci">int Size() const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04957">constraint_solver.h:4957</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_container_html_a55e6ebe94a380d6a66e470eafc84f6ff"><div class="ttname"><a href="classoperations__research_1_1_assignment_container.html#a55e6ebe94a380d6a66e470eafc84f6ff">operations_research::AssignmentContainer::AddAtPosition</a></div><div class="ttdeci">E * AddAtPosition(V *var, int position)</div><div class="ttdoc">Advanced usage: Adds element at a given position; position has to have been allocated with Assignment...</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04879">constraint_solver.h:4879</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_container_html_a907ce7f41938cc755b6b1f4a55b5cd27"><div class="ttname"><a href="classoperations__research_1_1_assignment_container.html#a907ce7f41938cc755b6b1f4a55b5cd27">operations_research::AssignmentContainer::Element</a></div><div class="ttdeci">const E & Element(const V *const var) const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04941">constraint_solver.h:4941</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_container_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="classoperations__research_1_1_assignment_container.html#aa71d36872f416feaa853788a7a7a7ef8">operations_research::AssignmentContainer::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04883">constraint_solver.h:4883</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_container_html_ad9cf0e91780366986c2f047bd796cdd5"><div class="ttname"><a href="classoperations__research_1_1_assignment_container.html#ad9cf0e91780366986c2f047bd796cdd5">operations_research::AssignmentContainer::Resize</a></div><div class="ttdeci">void Resize(size_t size)</div><div class="ttdoc">Advanced usage: Resizes the container, potentially adding elements with null variables.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04891">constraint_solver.h:4891</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_html"><div class="ttname"><a href="classoperations__research_1_1_assignment.html">operations_research::Assignment</a></div><div class="ttdoc">An Assignment is a variable -> domains mapping, used to report solutions to the user.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l05038">constraint_solver.h:5038</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_html_a0db03cadd37e821f6c41924575188d72"><div class="ttname"><a href="classoperations__research_1_1_assignment.html#a0db03cadd37e821f6c41924575188d72">operations_research::Assignment::Value</a></div><div class="ttdeci">int64 Value(const IntVar *const var) const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2assignment_8cc_source.html#l00659">constraint_solver/assignment.cc:659</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_html_a11963e86e6bc074096264e96ccd5c755"><div class="ttname"><a href="classoperations__research_1_1_assignment.html#a11963e86e6bc074096264e96ccd5c755">operations_research::Assignment::MutableIntVarContainer</a></div><div class="ttdeci">IntContainer * MutableIntVarContainer()</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l05190">constraint_solver.h:5190</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_html_a1896fe755b612dbebd2c46638f8977a2"><div class="ttname"><a href="classoperations__research_1_1_assignment.html#a1896fe755b612dbebd2c46638f8977a2">operations_research::Assignment::Restore</a></div><div class="ttdeci">void Restore()</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2assignment_8cc_source.html#l00434">constraint_solver/assignment.cc:434</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_html_a1f16f5a2e5767013b620efd255fb35ea"><div class="ttname"><a href="classoperations__research_1_1_assignment.html#a1f16f5a2e5767013b620efd255fb35ea">operations_research::Assignment::IntVarContainer</a></div><div class="ttdeci">const IntContainer & IntVarContainer() const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l05189">constraint_solver.h:5189</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="classoperations__research_1_1_assignment.html#aa71d36872f416feaa853788a7a7a7ef8">operations_research::Assignment::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2assignment_8cc_source.html#l00418">constraint_solver/assignment.cc:418</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_html_ac462499a646c751d153e599b22f1d782"><div class="ttname"><a href="classoperations__research_1_1_assignment.html#ac462499a646c751d153e599b22f1d782">operations_research::Assignment::SetValue</a></div><div class="ttdeci">void SetValue(const IntVar *const var, int64 value)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2assignment_8cc_source.html#l00679">constraint_solver/assignment.cc:679</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_html_ac97eab84adb6cc33ae0124c944a4f8c7"><div class="ttname"><a href="classoperations__research_1_1_assignment.html#ac97eab84adb6cc33ae0124c944a4f8c7">operations_research::Assignment::Copy</a></div><div class="ttdeci">void Copy(const Assignment *assignment)</div><div class="ttdoc">Copies 'assignment' to the current assignment, clearing its previous content.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2assignment_8cc_source.html#l01008">constraint_solver/assignment.cc:1008</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_html_ace2db6f9700f6a2159db104f5df1dc8f"><div class="ttname"><a href="classoperations__research_1_1_assignment.html#ace2db6f9700f6a2159db104f5df1dc8f">operations_research::Assignment::IntContainer</a></div><div class="ttdeci">AssignmentContainer< IntVar, IntVarElement > IntContainer</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l05040">constraint_solver.h:5040</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_html_ae8ff1d18d50b93a2499ccd7130addecb"><div class="ttname"><a href="classoperations__research_1_1_assignment.html#ae8ff1d18d50b93a2499ccd7130addecb">operations_research::Assignment::Add</a></div><div class="ttdeci">IntVarElement * Add(IntVar *const var)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2assignment_8cc_source.html#l00637">constraint_solver/assignment.cc:637</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_base_object_html_a8eba5d533fa9df4617c1868d3ec2afc4"><div class="ttname"><a href="classoperations__research_1_1_base_object.html#a8eba5d533fa9df4617c1868d3ec2afc4">operations_research::BaseObject::DebugString</a></div><div class="ttdeci">virtual std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03156">constraint_solver.h:3156</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_base_path_filter_html"><div class="ttname"><a href="classoperations__research_1_1_base_path_filter.html">operations_research::BasePathFilter</a></div><div class="ttdoc">Generic path-based filter class.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03832">routing.h:3832</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_base_path_filter_html_a0d16eaa2f4cc0dbde0c88126021ec34e"><div class="ttname"><a href="classoperations__research_1_1_base_path_filter.html#a0d16eaa2f4cc0dbde0c88126021ec34e">operations_research::BasePathFilter::NumPaths</a></div><div class="ttdeci">int NumPaths() const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03848">routing.h:3848</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_base_path_filter_html_a33b6c2ef668063ee2d9f9c30071b1b7e"><div class="ttname"><a href="classoperations__research_1_1_base_path_filter.html#a33b6c2ef668063ee2d9f9c30071b1b7e">operations_research::BasePathFilter::kUnassigned</a></div><div class="ttdeci">static const int64 kUnassigned</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03841">routing.h:3841</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_base_path_filter_html_a345e688ef627db8fdda23c4b6b45ac0f"><div class="ttname"><a href="classoperations__research_1_1_base_path_filter.html#a345e688ef627db8fdda23c4b6b45ac0f">operations_research::BasePathFilter::Start</a></div><div class="ttdeci">int64 Start(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03849">routing.h:3849</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_base_path_filter_html_a511cf14b54c83cffc0a673985db90643"><div class="ttname"><a href="classoperations__research_1_1_base_path_filter.html#a511cf14b54c83cffc0a673985db90643">operations_research::BasePathFilter::Accept</a></div><div class="ttdeci">bool Accept(const Assignment *delta, const Assignment *deltadelta, int64 objective_min, int64 objective_max) override</div><div class="ttdoc">Accepts a "delta" given the assignment with which the filter has been synchronized; the delta holds t...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00304">routing_search.cc:304</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_base_path_filter_html_a7c22021d1ebcfa7e3b8bbe36d0dcac7c"><div class="ttname"><a href="classoperations__research_1_1_base_path_filter.html#a7c22021d1ebcfa7e3b8bbe36d0dcac7c">operations_research::BasePathFilter::BasePathFilter</a></div><div class="ttdeci">BasePathFilter(const std::vector< IntVar * > &nexts, int next_domain_size)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00292">routing_search.cc:292</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_base_path_filter_html_a8869de3e40b0eeee56470a8fc0cd4528"><div class="ttname"><a href="classoperations__research_1_1_base_path_filter.html#a8869de3e40b0eeee56470a8fc0cd4528">operations_research::BasePathFilter::IsDisabled</a></div><div class="ttdeci">bool IsDisabled() const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03852">routing.h:3852</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_base_path_filter_html_af5591ad1889b7e23b8461a1fb68d1d48"><div class="ttname"><a href="classoperations__research_1_1_base_path_filter.html#af5591ad1889b7e23b8461a1fb68d1d48">operations_research::BasePathFilter::OnSynchronize</a></div><div class="ttdeci">void OnSynchronize(const Assignment *delta) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00450">routing_search.cc:450</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_bitset64_html"><div class="ttname"><a href="classoperations__research_1_1_bitset64.html">operations_research::Bitset64</a></div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00410">bitset.h:410</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_c_p_feasibility_filter_html"><div class="ttname"><a href="classoperations__research_1_1_c_p_feasibility_filter.html">operations_research::CPFeasibilityFilter</a></div><div class="ttdoc">This filter accepts deltas for which the assignment satisfies the constraints of the Solver.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03908">routing.h:3908</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_c_p_feasibility_filter_html_a511cf14b54c83cffc0a673985db90643"><div class="ttname"><a href="classoperations__research_1_1_c_p_feasibility_filter.html#a511cf14b54c83cffc0a673985db90643">operations_research::CPFeasibilityFilter::Accept</a></div><div class="ttdeci">bool Accept(const Assignment *delta, const Assignment *deltadelta, int64 objective_min, int64 objective_max) override</div><div class="ttdoc">Accepts a "delta" given the assignment with which the filter has been synchronized; the delta holds t...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02703">routing_search.cc:2703</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_c_p_feasibility_filter_html_af5591ad1889b7e23b8461a1fb68d1d48"><div class="ttname"><a href="classoperations__research_1_1_c_p_feasibility_filter.html#af5591ad1889b7e23b8461a1fb68d1d48">operations_research::CPFeasibilityFilter::OnSynchronize</a></div><div class="ttdeci">void OnSynchronize(const Assignment *delta) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02712">routing_search.cc:2712</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_addition_filtered_heuristic_html"><div class="ttname"><a href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html">operations_research::CheapestAdditionFilteredHeuristic</a></div><div class="ttdoc">Filtered-base decision builder based on the addition heuristic, extending a path from its start node ...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03543">routing.h:3543</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_addition_filtered_heuristic_html_a2bc82055bf34be9162ce82b5d87b0289"><div class="ttname"><a href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">operations_research::CheapestAdditionFilteredHeuristic::BuildSolutionInternal</a></div><div class="ttdeci">bool BuildSolutionInternal() override</div><div class="ttdoc">Virtual method to redefine how to build a solution.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l04763">routing_search.cc:4763</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_addition_filtered_heuristic_html_afec155b0f80a58cf5d632413078cc4f2"><div class="ttname"><a href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html#afec155b0f80a58cf5d632413078cc4f2">operations_research::CheapestAdditionFilteredHeuristic::CheapestAdditionFilteredHeuristic</a></div><div class="ttdeci">CheapestAdditionFilteredHeuristic(RoutingModel *model, LocalSearchFilterManager *filter_manager)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l04759">routing_search.cc:4759</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html">operations_research::CheapestInsertionFilteredHeuristic</a></div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03117">routing.h:3117</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_a0f3b9fe9ee459bb28fb151fae2cfeac9"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a0f3b9fe9ee459bb28fb151fae2cfeac9">operations_research::CheapestInsertionFilteredHeuristic::CheapestInsertionFilteredHeuristic</a></div><div class="ttdeci">CheapestInsertionFilteredHeuristic(RoutingModel *model, std::function< int64(int64, int64, int64)> evaluator, std::function< int64(int64)> penalty_evaluator, LocalSearchFilterManager *filter_manager)</div><div class="ttdoc">Takes ownership of evaluator.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03131">routing_search.cc:3131</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_a2b48bfb0d3df32b08dbe0aab5a251f8b"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a2b48bfb0d3df32b08dbe0aab5a251f8b">operations_research::CheapestInsertionFilteredHeuristic::penalty_evaluator_</a></div><div class="ttdeci">std::function< int64(int64)> penalty_evaluator_</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03185">routing.h:3185</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_a356517cd51c4b6259d7f439718719eaa"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a356517cd51c4b6259d7f439718719eaa">operations_research::CheapestInsertionFilteredHeuristic::ComputeStartEndDistanceForVehicles</a></div><div class="ttdeci">std::vector< std::vector< StartEndValue > > ComputeStartEndDistanceForVehicles(const std::vector< int > &vehicles)</div><div class="ttdoc">Computes and returns the distance of each uninserted node to every vehicle in "vehicles" as a std::ve...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03140">routing_search.cc:3140</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_a3c4943383b7473a073e387f40cc0fb05"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a3c4943383b7473a073e387f40cc0fb05">operations_research::CheapestInsertionFilteredHeuristic::evaluator_</a></div><div class="ttdeci">std::function< int64(int64, int64, int64)> evaluator_</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03184">routing.h:3184</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_a40574fa8ec102d52f650a616d7fe6c39"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a40574fa8ec102d52f650a616d7fe6c39">operations_research::CheapestInsertionFilteredHeuristic::InsertBetween</a></div><div class="ttdeci">void InsertBetween(int64 node, int64 predecessor, int64 successor)</div><div class="ttdoc">Inserts 'node' just after 'predecessor', and just before 'successor', resulting in the following subs...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03191">routing_search.cc:3191</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_a69d38e86eb8fc2fa4df0d8839c8dd5a9"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a69d38e86eb8fc2fa4df0d8839c8dd5a9">operations_research::CheapestInsertionFilteredHeuristic::InitializePriorityQueue</a></div><div class="ttdeci">void InitializePriorityQueue(std::vector< std::vector< StartEndValue > > *start_end_distances_per_node, Queue *priority_queue)</div><div class="ttdoc">Initializes the priority_queue by inserting the best entry corresponding to each node,...</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_aa2099867a858f3da90d9e26a1dc88b4d"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#aa2099867a858f3da90d9e26a1dc88b4d">operations_research::CheapestInsertionFilteredHeuristic::ValuedPosition</a></div><div class="ttdeci">std::pair< int64, int64 > ValuedPosition</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03127">routing.h:3127</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_aafc4ebf202cabd64f7854c274f425866"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#aafc4ebf202cabd64f7854c274f425866">operations_research::CheapestInsertionFilteredHeuristic::AppendEvaluatedPositionsAfter</a></div><div class="ttdeci">void AppendEvaluatedPositionsAfter(int64 node_to_insert, int64 start, int64 next_after_start, int64 vehicle, std::vector< ValuedPosition > *valued_positions)</div><div class="ttdoc">Helper method to the ComputeEvaluatorSortedPositions* methods.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03199">routing_search.cc:3199</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_ab2b4f136e88ea9aad2921aefb2434bad"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ab2b4f136e88ea9aad2921aefb2434bad">operations_research::CheapestInsertionFilteredHeuristic::GetUnperformedValue</a></div><div class="ttdeci">int64 GetUnperformedValue(int64 node_to_insert) const</div><div class="ttdoc">Returns the cost of unperforming node 'node_to_insert'.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03223">routing_search.cc:3223</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_af10aed726a9b750452a6fdeae3f00feb"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#af10aed726a9b750452a6fdeae3f00feb">operations_research::CheapestInsertionFilteredHeuristic::Seed</a></div><div class="ttdeci">std::pair< StartEndValue, int > Seed</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03137">routing.h:3137</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_af4b03acbf6a0d7655f7d65d0d87343e6"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#af4b03acbf6a0d7655f7d65d0d87343e6">operations_research::CheapestInsertionFilteredHeuristic::GetInsertionCostForNodeAtPosition</a></div><div class="ttdeci">int64 GetInsertionCostForNodeAtPosition(int64 node_to_insert, int64 insert_after, int64 insert_before, int vehicle) const</div><div class="ttdoc">Returns the cost of inserting 'node_to_insert' between 'insert_after' and 'insert_before' on the 'veh...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03215">routing_search.cc:3215</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_christofides_filtered_heuristic_html_a2bc82055bf34be9162ce82b5d87b0289"><div class="ttname"><a href="classoperations__research_1_1_christofides_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">operations_research::ChristofidesFilteredHeuristic::BuildSolutionInternal</a></div><div class="ttdeci">bool BuildSolutionInternal() override</div><div class="ttdoc">Virtual method to redefine how to build a solution.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l05980">routing_search.cc:5980</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_christofides_filtered_heuristic_html_af91a0a971d9bbdf32471d229a030a5fc"><div class="ttname"><a href="classoperations__research_1_1_christofides_filtered_heuristic.html#af91a0a971d9bbdf32471d229a030a5fc">operations_research::ChristofidesFilteredHeuristic::ChristofidesFilteredHeuristic</a></div><div class="ttdeci">ChristofidesFilteredHeuristic(RoutingModel *model, LocalSearchFilterManager *filter_manager, bool use_minimum_matching)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l05973">routing_search.cc:5973</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_christofides_path_solver_html"><div class="ttname"><a href="classoperations__research_1_1_christofides_path_solver.html">operations_research::ChristofidesPathSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="christofides_8h_source.html#l00042">christofides.h:42</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_christofides_path_solver_html_a1d4f082de5fc3eed348d65eb30b5f3e7"><div class="ttname"><a href="classoperations__research_1_1_christofides_path_solver.html#a1d4f082de5fc3eed348d65eb30b5f3e7">operations_research::ChristofidesPathSolver::MatchingAlgorithm</a></div><div class="ttdeci">MatchingAlgorithm</div><div class="ttdef"><b>Definition:</b> <a href="christofides_8h_source.html#l00044">christofides.h:44</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_christofides_path_solver_html_a3076d9001536ea98d419faa81e7d8a47"><div class="ttname"><a href="classoperations__research_1_1_christofides_path_solver.html#a3076d9001536ea98d419faa81e7d8a47">operations_research::ChristofidesPathSolver::TravelingSalesmanPath</a></div><div class="ttdeci">std::vector< NodeIndex > TravelingSalesmanPath()</div><div class="ttdef"><b>Definition:</b> <a href="christofides_8h_source.html#l00241">christofides.h:241</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_christofides_path_solver_html_a942f29030f08426e7e318204e987e2f7"><div class="ttname"><a href="classoperations__research_1_1_christofides_path_solver.html#a942f29030f08426e7e318204e987e2f7">operations_research::ChristofidesPathSolver::Solve</a></div><div class="ttdeci">bool Solve()</div><div class="ttdef"><b>Definition:</b> <a href="christofides_8h_source.html#l00252">christofides.h:252</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_christofides_path_solver_html_ae2b64dddd58baf1bc5e01cb14971e52e"><div class="ttname"><a href="classoperations__research_1_1_christofides_path_solver.html#ae2b64dddd58baf1bc5e01cb14971e52e">operations_research::ChristofidesPathSolver::SetMatchingAlgorithm</a></div><div class="ttdeci">void SetMatchingAlgorithm(MatchingAlgorithm matching)</div><div class="ttdef"><b>Definition:</b> <a href="christofides_8h_source.html#l00061">christofides.h:61</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic_html_a760174569c84ca68a545381dad33b38c"><div class="ttname"><a href="classoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic.html#a760174569c84ca68a545381dad33b38c">operations_research::ComparatorCheapestAdditionFilteredHeuristic::ComparatorCheapestAdditionFilteredHeuristic</a></div><div class="ttdeci">ComparatorCheapestAdditionFilteredHeuristic(RoutingModel *model, Solver::VariableValueComparator comparator, LocalSearchFilterManager *filter_manager)</div><div class="ttdoc">Takes ownership of evaluator.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l04950">routing_search.cc:4951</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_decision_builder_html"><div class="ttname"><a href="classoperations__research_1_1_decision_builder.html">operations_research::DecisionBuilder</a></div><div class="ttdoc">A DecisionBuilder is responsible for creating the search tree.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03268">constraint_solver.h:3268</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_decision_html"><div class="ttname"><a href="classoperations__research_1_1_decision.html">operations_research::Decision</a></div><div class="ttdoc">A Decision represents a choice point in the search tree.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03228">constraint_solver.h:3228</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic_html_a1eb5921458713ad43bcfd488501b7e42"><div class="ttname"><a href="classoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic.html#a1eb5921458713ad43bcfd488501b7e42">operations_research::EvaluatorCheapestAdditionFilteredHeuristic::EvaluatorCheapestAdditionFilteredHeuristic</a></div><div class="ttdeci">EvaluatorCheapestAdditionFilteredHeuristic(RoutingModel *model, std::function< int64(int64, int64)> evaluator, LocalSearchFilterManager *filter_manager)</div><div class="ttdoc">Takes ownership of evaluator.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l04909">routing_search.cc:4910</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03301">routing_search.cc:3301</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html_a1288842502bf13a418539580ccdfa679"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a1288842502bf13a418539580ccdfa679">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry::operator<</a></div><div class="ttdeci">bool operator<(const NodeEntry &other) const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03309">routing_search.cc:3309</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html_a22aa7b1daf1b464e9ec1b675390aca94"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry::vehicle</a></div><div class="ttdeci">int vehicle() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03327">routing_search.cc:3327</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html_a307aa57dbe7730a98fc3c297c5924439"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a307aa57dbe7730a98fc3c297c5924439">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry::set_vehicle</a></div><div class="ttdeci">void set_vehicle(int vehicle)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03328">routing_search.cc:3328</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html_a33395f038b6a134edbe336a9a65f97eb"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a33395f038b6a134edbe336a9a65f97eb">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry::insert_after</a></div><div class="ttdeci">int insert_after() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03325">routing_search.cc:3325</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html_a356efb311b542164bd4667883d0973bb"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a356efb311b542164bd4667883d0973bb">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry::GetHeapIndex</a></div><div class="ttdeci">int GetHeapIndex() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03321">routing_search.cc:3321</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html_a3fa26fc424ad7816f332921872064c19"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a3fa26fc424ad7816f332921872064c19">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry::value</a></div><div class="ttdeci">int64 value() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03322">routing_search.cc:3322</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html_a6fa49ad5682919b9982d9c7b55d21683"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a6fa49ad5682919b9982d9c7b55d21683">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry::set_insert_after</a></div><div class="ttdeci">void set_insert_after(int insert_after)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03326">routing_search.cc:3326</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html_aa0c64eed404154a1d3dc7902e1d88466"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#aa0c64eed404154a1d3dc7902e1d88466">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry::NodeEntry</a></div><div class="ttdeci">NodeEntry(int node_to_insert, int insert_after, int vehicle)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03303">routing_search.cc:3303</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html_ab87ca3233f48737b65fc2edb553575f9"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#ab87ca3233f48737b65fc2edb553575f9">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry::SetHeapIndex</a></div><div class="ttdeci">void SetHeapIndex(int h)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03320">routing_search.cc:3320</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html_ac046737f68b206f3ee48b23d5c404cdc"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#ac046737f68b206f3ee48b23d5c404cdc">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry::set_value</a></div><div class="ttdeci">void set_value(int64 value)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03323">routing_search.cc:3323</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html_afab5e0005c90180f14fc2a92d965af11"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#afab5e0005c90180f14fc2a92d965af11">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry::node_to_insert</a></div><div class="ttdeci">int node_to_insert() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03324">routing_search.cc:3324</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03248">routing_search.cc:3248</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_a0c50cfb15d402d295b87b81310c486c5"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a0c50cfb15d402d295b87b81310c486c5">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::operator<</a></div><div class="ttdeci">bool operator<(const PairEntry &other) const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03261">routing_search.cc:3261</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_a22aa7b1daf1b464e9ec1b675390aca94"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::vehicle</a></div><div class="ttdeci">int vehicle() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03287">routing_search.cc:3287</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_a307aa57dbe7730a98fc3c297c5924439"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a307aa57dbe7730a98fc3c297c5924439">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::set_vehicle</a></div><div class="ttdeci">void set_vehicle(int vehicle)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03288">routing_search.cc:3288</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_a356efb311b542164bd4667883d0973bb"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a356efb311b542164bd4667883d0973bb">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::GetHeapIndex</a></div><div class="ttdeci">int GetHeapIndex() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03277">routing_search.cc:3277</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_a3fa26fc424ad7816f332921872064c19"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a3fa26fc424ad7816f332921872064c19">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::value</a></div><div class="ttdeci">int64 value() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03278">routing_search.cc:3278</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_a4b0f2123c758615115404fc033e28b3b"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a4b0f2123c758615115404fc033e28b3b">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::PairEntry</a></div><div class="ttdeci">PairEntry(int pickup_to_insert, int pickup_insert_after, int delivery_to_insert, int delivery_insert_after, int vehicle)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03250">routing_search.cc:3250</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_a8ce7a57de817af9900a5ce211fac39ec"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a8ce7a57de817af9900a5ce211fac39ec">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::pickup_insert_after</a></div><div class="ttdeci">int pickup_insert_after() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03281">routing_search.cc:3281</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_aa3ef697633fc4e2bfca732b37f4d6713"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#aa3ef697633fc4e2bfca732b37f4d6713">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::set_pickup_insert_after</a></div><div class="ttdeci">void set_pickup_insert_after(int pickup_insert_after)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03282">routing_search.cc:3282</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_aab26acce6ace06adcdf9a2cb3a40b874"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#aab26acce6ace06adcdf9a2cb3a40b874">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::delivery_insert_after</a></div><div class="ttdeci">int delivery_insert_after() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03286">routing_search.cc:3286</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_ab87ca3233f48737b65fc2edb553575f9"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#ab87ca3233f48737b65fc2edb553575f9">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::SetHeapIndex</a></div><div class="ttdeci">void SetHeapIndex(int h)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03276">routing_search.cc:3276</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_ac046737f68b206f3ee48b23d5c404cdc"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#ac046737f68b206f3ee48b23d5c404cdc">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::set_value</a></div><div class="ttdeci">void set_value(int64 value)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03279">routing_search.cc:3279</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_ac555a592bc8f46d40e664dc2c663eae6"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#ac555a592bc8f46d40e664dc2c663eae6">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::delivery_to_insert</a></div><div class="ttdeci">int delivery_to_insert() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03285">routing_search.cc:3285</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_af73c9d66c39b338f5d4bf402664a6775"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#af73c9d66c39b338f5d4bf402664a6775">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::pickup_to_insert</a></div><div class="ttdeci">int pickup_to_insert() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03280">routing_search.cc:3280</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_html_a2bc82055bf34be9162ce82b5d87b0289"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">operations_research::GlobalCheapestInsertionFilteredHeuristic::BuildSolutionInternal</a></div><div class="ttdeci">bool BuildSolutionInternal() override</div><div class="ttdoc">Virtual method to redefine how to build a solution.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03475">routing_search.cc:3475</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_html_a74d8d5032c1116077bac8da2a48e7e98"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#a74d8d5032c1116077bac8da2a48e7e98">operations_research::GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionFilteredHeuristic</a></div><div class="ttdeci">GlobalCheapestInsertionFilteredHeuristic(RoutingModel *model, std::function< int64(int64, int64, int64)> evaluator, std::function< int64(int64)> penalty_evaluator, LocalSearchFilterManager *filter_manager, GlobalCheapestInsertionParameters parameters)</div><div class="ttdoc">Takes ownership of evaluators.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03340">routing_search.cc:3341</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html">operations_research::GlobalDimensionCumulOptimizer</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00680">routing_lp_scheduling.h:680</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a6769f38bbc3271d45b0512c12ef31f70"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a6769f38bbc3271d45b0512c12ef31f70">operations_research::GlobalDimensionCumulOptimizer::dimension</a></div><div class="ttdeci">const RoutingDimension * dimension() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00711">routing_lp_scheduling.h:711</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_init_and_get_values_html"><div class="ttname"><a href="classoperations__research_1_1_init_and_get_values.html">operations_research::InitAndGetValues</a></div><div class="ttdoc">Utility class to encapsulate an IntVarIterator and use it in a range-based loop.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03941">constraint_solver.h:3941</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_expr_html_a1d04569b37cb7fe6ed0956ab71e08bc9"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#a1d04569b37cb7fe6ed0956ab71e08bc9">operations_research::IntExpr::Bound</a></div><div class="ttdeci">virtual bool Bound() const</div><div class="ttdoc">Returns true if the min and the max of the expression are equal.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03862">constraint_solver.h:3862</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_expr_html_a6dc4d5cdc2ed0da18452a65c5bf69e0d"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#a6dc4d5cdc2ed0da18452a65c5bf69e0d">operations_research::IntExpr::Max</a></div><div class="ttdeci">virtual int64 Max() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_expr_html_ac4a4f30badcd311075302a4efcfaee0a"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#ac4a4f30badcd311075302a4efcfaee0a">operations_research::IntExpr::Min</a></div><div class="ttdeci">virtual int64 Min() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_element_html"><div class="ttname"><a href="classoperations__research_1_1_int_var_element.html">operations_research::IntVarElement</a></div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04651">constraint_solver.h:4651</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_element_html_a4bead74295e1e5675c0984fcc91ef057"><div class="ttname"><a href="classoperations__research_1_1_int_var_element.html#a4bead74295e1e5675c0984fcc91ef057">operations_research::IntVarElement::Bound</a></div><div class="ttdeci">bool Bound() const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04680">constraint_solver.h:4680</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_element_html_a8052ccc3aba839f3befd553cc05b85a0"><div class="ttname"><a href="classoperations__research_1_1_int_var_element.html#a8052ccc3aba839f3befd553cc05b85a0">operations_research::IntVarElement::Var</a></div><div class="ttdeci">IntVar * Var() const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04658">constraint_solver.h:4658</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_element_html_ace66161c2f260353b4f03ef33455cd2f"><div class="ttname"><a href="classoperations__research_1_1_int_var_element.html#ace66161c2f260353b4f03ef33455cd2f">operations_research::IntVarElement::SetValue</a></div><div class="ttdeci">void SetValue(int64 v)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04685">constraint_solver.h:4685</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_element_html_aeabf4572ab5bf48ec3e07660c9587385"><div class="ttname"><a href="classoperations__research_1_1_int_var_element.html#aeabf4572ab5bf48ec3e07660c9587385">operations_research::IntVarElement::Value</a></div><div class="ttdeci">int64 Value() const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04675">constraint_solver.h:4675</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_decision_builder_html_a8c71ca62b0ac538bf37374602e4259bb"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_decision_builder.html#a8c71ca62b0ac538bf37374602e4259bb">operations_research::IntVarFilteredDecisionBuilder::Next</a></div><div class="ttdeci">Decision * Next(Solver *solver) override</div><div class="ttdoc">This is the main method of the decision builder class.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02851">routing_search.cc:2851</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_decision_builder_html_ab35b677ad56dbdc2521d9bb28a68f566"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_decision_builder.html#ab35b677ad56dbdc2521d9bb28a68f566">operations_research::IntVarFilteredDecisionBuilder::number_of_rejects</a></div><div class="ttdeci">int64 number_of_rejects() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02868">routing_search.cc:2868</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_decision_builder_html_ab9cbb9e796806062460be9c7a4033e80"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_decision_builder.html#ab9cbb9e796806062460be9c7a4033e80">operations_research::IntVarFilteredDecisionBuilder::number_of_decisions</a></div><div class="ttdeci">int64 number_of_decisions() const</div><div class="ttdoc">Returns statistics from its underlying heuristic.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02864">routing_search.cc:2864</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_decision_builder_html_acf25bca8c52b674f343820aaf3d339b5"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_decision_builder.html#acf25bca8c52b674f343820aaf3d339b5">operations_research::IntVarFilteredDecisionBuilder::IntVarFilteredDecisionBuilder</a></div><div class="ttdeci">IntVarFilteredDecisionBuilder(std::unique_ptr< IntVarFilteredHeuristic > heuristic)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02847">routing_search.cc:2847</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_decision_builder_html_aed804747c45a7e1caf81461f9e45dd91"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_decision_builder.html#aed804747c45a7e1caf81461f9e45dd91">operations_research::IntVarFilteredDecisionBuilder::DebugString</a></div><div class="ttdeci">std::string DebugString() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02872">routing_search.cc:2872</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html">operations_research::IntVarFilteredHeuristic</a></div><div class="ttdoc">Generic filter-based heuristic applied to IntVars.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02997">routing.h:2997</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a0c46fa4dcc0fed2329041bbe90fc575a"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0c46fa4dcc0fed2329041bbe90fc575a">operations_research::IntVarFilteredHeuristic::BuildSolutionInternal</a></div><div class="ttdeci">virtual bool BuildSolutionInternal()=0</div><div class="ttdoc">Virtual method to redefine how to build a solution.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a24926108b770033792d015cb86aeffb3"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">operations_research::IntVarFilteredHeuristic::Size</a></div><div class="ttdeci">int Size() const</div><div class="ttdoc">Returns the number of variables the decision builder is trying to instantiate.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03050">routing.h:3050</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a3bf66f3f1119ea5c0f57beb231089c0e"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a3bf66f3f1119ea5c0f57beb231089c0e">operations_research::IntVarFilteredHeuristic::Contains</a></div><div class="ttdeci">bool Contains(int64 index) const</div><div class="ttdoc">Returns true if the variable of index 'index' is in the current solution.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03045">routing.h:3045</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a43cbb017015c746f350a83701d7f8b73"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a43cbb017015c746f350a83701d7f8b73">operations_research::IntVarFilteredHeuristic::Value</a></div><div class="ttdeci">int64 Value(int64 index) const</div><div class="ttdoc">Returns the value of the variable of index 'index' in the last committed solution.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03041">routing.h:3041</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a44c78e17dec2b3af95f850baaee2683a"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a44c78e17dec2b3af95f850baaee2683a">operations_research::IntVarFilteredHeuristic::Commit</a></div><div class="ttdeci">bool Commit()</div><div class="ttdoc">Commits the modifications to the current solution if these modifications are "filter-feasible",...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02952">routing_search.cc:2952</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a609a96f8163121290267059fc6f27a4a"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a609a96f8163121290267059fc6f27a4a">operations_research::IntVarFilteredHeuristic::Var</a></div><div class="ttdeci">IntVar * Var(int64 index) const</div><div class="ttdoc">Returns the variable of index 'index'.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03052">routing.h:3052</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a6743122cc2fc4818b402ba3d484c6ea4"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a6743122cc2fc4818b402ba3d484c6ea4">operations_research::IntVarFilteredHeuristic::assignment_</a></div><div class="ttdeci">Assignment *const assignment_</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03056">routing.h:3056</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a7ae7a2033e2a22ad1dedbf2f3ec8745f"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a7ae7a2033e2a22ad1dedbf2f3ec8745f">operations_research::IntVarFilteredHeuristic::ResetSolution</a></div><div class="ttdeci">void ResetSolution()</div><div class="ttdoc">Resets the data members for a new solution.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02897">routing_search.cc:2897</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a8447b106d07db2466b60e534964730d3"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a8447b106d07db2466b60e534964730d3">operations_research::IntVarFilteredHeuristic::SynchronizeFilters</a></div><div class="ttdeci">void SynchronizeFilters()</div><div class="ttdoc">Synchronizes filters with an assignment (the current solution).</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02980">routing_search.cc:2980</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_aa1103b3a47f7bf316a81ed91ba3e4657"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#aa1103b3a47f7bf316a81ed91ba3e4657">operations_research::IntVarFilteredHeuristic::InitializeSolution</a></div><div class="ttdeci">virtual bool InitializeSolution()</div><div class="ttdoc">Virtual method to initialize the solution.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03019">routing.h:3019</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_ac20998bdd4fc9d5433c82184b4f56925"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac20998bdd4fc9d5433c82184b4f56925">operations_research::IntVarFilteredHeuristic::SetValue</a></div><div class="ttdeci">void SetValue(int64 index, int64 value)</div><div class="ttdoc">Modifies the current solution by setting the variable of index 'index' to value 'value'.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03030">routing.h:3030</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_ae4af3c0813025d58bd52dcd93ff6aae7"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae4af3c0813025d58bd52dcd93ff6aae7">operations_research::IntVarFilteredHeuristic::IntVarFilteredHeuristic</a></div><div class="ttdeci">IntVarFilteredHeuristic(Solver *solver, const std::vector< IntVar * > &vars, LocalSearchFilterManager *filter_manager)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02881">routing_search.cc:2881</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_af3787f4febdbe5033e9834b770476f5d"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#af3787f4febdbe5033e9834b770476f5d">operations_research::IntVarFilteredHeuristic::BuildSolution</a></div><div class="ttdeci">Assignment *const BuildSolution()</div><div class="ttdoc">Builds a solution.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02907">routing_search.cc:2907</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_html"><div class="ttname"><a href="classoperations__research_1_1_int_var.html">operations_research::IntVar</a></div><div class="ttdoc">The class IntVar is a subset of IntExpr.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03997">constraint_solver.h:3997</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_html_a7005edfb93d09a9ca1ecb989a9bc6733"><div class="ttname"><a href="classoperations__research_1_1_int_var.html#a7005edfb93d09a9ca1ecb989a9bc6733">operations_research::IntVar::Contains</a></div><div class="ttdeci">virtual bool Contains(int64 v) const =0</div><div class="ttdoc">This method returns whether the value 'v' is in the domain of the variable.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_html_ac067bc2252cc65b1eb004d5285e5fdb2"><div class="ttname"><a href="classoperations__research_1_1_int_var.html#ac067bc2252cc65b1eb004d5285e5fdb2">operations_research::IntVar::Value</a></div><div class="ttdeci">virtual int64 Value() const =0</div><div class="ttdoc">This method returns the value of the variable.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_local_search_filter_html"><div class="ttname"><a href="classoperations__research_1_1_int_var_local_search_filter.html">operations_research::IntVarLocalSearchFilter</a></div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01811">constraint_solveri.h:1811</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_local_search_filter_html_a1907b3ee12b9e6e2bfc69e1a69b5baf0"><div class="ttname"><a href="classoperations__research_1_1_int_var_local_search_filter.html#a1907b3ee12b9e6e2bfc69e1a69b5baf0">operations_research::IntVarLocalSearchFilter::FindIndex</a></div><div class="ttdeci">bool FindIndex(IntVar *const var, int64 *index) const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01820">constraint_solveri.h:1820</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_local_search_filter_html_a24926108b770033792d015cb86aeffb3"><div class="ttname"><a href="classoperations__research_1_1_int_var_local_search_filter.html#a24926108b770033792d015cb86aeffb3">operations_research::IntVarLocalSearchFilter::Size</a></div><div class="ttdeci">int Size() const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01831">constraint_solveri.h:1831</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_local_search_filter_html_abbab4c9580ab21b8dbd7af67ab35f393"><div class="ttname"><a href="classoperations__research_1_1_int_var_local_search_filter.html#abbab4c9580ab21b8dbd7af67ab35f393">operations_research::IntVarLocalSearchFilter::Var</a></div><div class="ttdeci">IntVar * Var(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01832">constraint_solveri.h:1832</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_local_search_filter_html_acc37407ddda743886d3cb40298914f0d"><div class="ttname"><a href="classoperations__research_1_1_int_var_local_search_filter.html#acc37407ddda743886d3cb40298914f0d">operations_research::IntVarLocalSearchFilter::Value</a></div><div class="ttdeci">int64 Value(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01833">constraint_solveri.h:1833</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_local_search_filter_html_af295b14439014798b1fd34faffd3b5e7"><div class="ttname"><a href="classoperations__research_1_1_int_var_local_search_filter.html#af295b14439014798b1fd34faffd3b5e7">operations_research::IntVarLocalSearchFilter::IsVarSynced</a></div><div class="ttdeci">bool IsVarSynced(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01837">constraint_solveri.h:1837</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_cheapest_insertion_filtered_heuristic_html_a2bc82055bf34be9162ce82b5d87b0289"><div class="ttname"><a href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">operations_research::LocalCheapestInsertionFilteredHeuristic::BuildSolutionInternal</a></div><div class="ttdeci">bool BuildSolutionInternal() override</div><div class="ttdoc">Virtual method to redefine how to build a solution.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l04650">routing_search.cc:4650</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_cheapest_insertion_filtered_heuristic_html_adbf82f7964ace16b163bc0b8fa5b8e30"><div class="ttname"><a href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html#adbf82f7964ace16b163bc0b8fa5b8e30">operations_research::LocalCheapestInsertionFilteredHeuristic::LocalCheapestInsertionFilteredHeuristic</a></div><div class="ttdeci">LocalCheapestInsertionFilteredHeuristic(RoutingModel *model, std::function< int64(int64, int64, int64)> evaluator, LocalSearchFilterManager *filter_manager)</div><div class="ttdoc">Takes ownership of evaluator.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l04636">routing_search.cc:4637</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_search_filter_html"><div class="ttname"><a href="classoperations__research_1_1_local_search_filter.html">operations_research::LocalSearchFilter</a></div><div class="ttdoc">Local Search Filters are used for fast neighbor pruning.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01719">constraint_solveri.h:1719</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_search_filter_manager_html"><div class="ttname"><a href="classoperations__research_1_1_local_search_filter_manager.html">operations_research::LocalSearchFilterManager</a></div><div class="ttdoc">Filter manager: when a move is made, filters are executed to decide whether the solution is feasible ...</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01763">constraint_solveri.h:1763</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_search_filter_manager_html_ac01556936ee8bcfe89ee8a7088ee260d"><div class="ttname"><a href="classoperations__research_1_1_local_search_filter_manager.html#ac01556936ee8bcfe89ee8a7088ee260d">operations_research::LocalSearchFilterManager::Accept</a></div><div class="ttdeci">bool Accept(LocalSearchMonitor *const monitor, const Assignment *delta, const Assignment *deltadelta, int64 objective_min, int64 objective_max)</div><div class="ttdoc">Returns true iff all filters return true, and the sum of their accepted objectives is between objecti...</div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l03905">local_search.cc:3905</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_search_filter_manager_html_ae90693395653f673140e7bee51daf656"><div class="ttname"><a href="classoperations__research_1_1_local_search_filter_manager.html#ae90693395653f673140e7bee51daf656">operations_research::LocalSearchFilterManager::Synchronize</a></div><div class="ttdeci">void Synchronize(const Assignment *assignment, const Assignment *delta)</div><div class="ttdoc">Synchronizes all filters to assignment.</div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l03950">local_search.cc:3950</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_search_monitor_html"><div class="ttname"><a href="classoperations__research_1_1_local_search_monitor.html">operations_research::LocalSearchMonitor</a></div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01915">constraint_solveri.h:1915</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_search_operator_html"><div class="ttname"><a href="classoperations__research_1_1_local_search_operator.html">operations_research::LocalSearchOperator</a></div><div class="ttdoc">The base class for all local search operators.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00798">constraint_solveri.h:798</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_search_phase_parameters_html"><div class="ttname"><a href="classoperations__research_1_1_local_search_phase_parameters.html">operations_research::LocalSearchPhaseParameters</a></div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l04291">local_search.cc:4291</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_state_html"><div class="ttname"><a href="classoperations__research_1_1_path_state.html">operations_research::PathState</a></div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l03049">constraint_solveri.h:3049</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_queue_html"><div class="ttname"><a href="classoperations__research_1_1_queue.html">operations_research::Queue</a></div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l00215">constraint_solver.cc:215</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_range_min_max_index_function_html_ac2d7168eb18527ad8a1c4ad10451c492"><div class="ttname"><a href="classoperations__research_1_1_range_min_max_index_function.html#ac2d7168eb18527ad8a1c4ad10451c492">operations_research::RangeMinMaxIndexFunction::RangeMinArgument</a></div><div class="ttdeci">virtual int64 RangeMinArgument(int64 from, int64 to) const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_rev_array_html"><div class="ttname"><a href="classoperations__research_1_1_rev_array.html">operations_research::RevArray</a></div><div class="ttdoc">Reversible array of POD types.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03777">constraint_solver.h:3777</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_rev_html"><div class="ttname"><a href="classoperations__research_1_1_rev.html">operations_research::Rev</a></div><div class="ttdoc">This class adds reversibility to a POD type.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03735">constraint_solver.h:3735</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_dimension_html_a1faf1ea53b992b47f60d0622e42f7a50"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a1faf1ea53b992b47f60d0622e42f7a50">operations_research::RoutingDimension::global_span_cost_coefficient</a></div><div class="ttdeci">int64 global_span_cost_coefficient() const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02681">routing.h:2681</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a35a576bb3ea6814f122593d44a3c391e"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a35a576bb3ea6814f122593d44a3c391e">operations_research::RoutingDimension::model</a></div><div class="ttdeci">RoutingModel * model() const</div><div class="ttdoc">Returns the model on which the dimension was created.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02372">routing.h:2372</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a4d87db39b37a97bcf6669448a67f0356"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a4d87db39b37a97bcf6669448a67f0356">operations_research::RoutingDimension::CumulVar</a></div><div class="ttdeci">IntVar * CumulVar(int64 index) const</div><div class="ttdoc">Get the cumul, transit and slack variables for the given node (given as int64 var index).</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02386">routing.h:2386</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a6debc638c02bfb2b4afe0afccdd98ca5"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a6debc638c02bfb2b4afe0afccdd98ca5">operations_research::RoutingDimension::HasBreakConstraints</a></div><div class="ttdeci">bool HasBreakConstraints() const</div><div class="ttdoc">Returns true if any break interval or break distance was defined.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l06900">routing.cc:6900</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a717341229f16012899360656534bba50"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a717341229f16012899360656534bba50">operations_research::RoutingDimension::base_dimension</a></div><div class="ttdeci">const RoutingDimension * base_dimension() const</div><div class="ttdoc">Returns the parent in the dependency tree if any or nullptr otherwise.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02608">routing.h:2608</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_ab425ddb1df081fea8f527c63d824fb88"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#ab425ddb1df081fea8f527c63d824fb88">operations_research::RoutingDimension::ShortestTransitionSlack</a></div><div class="ttdeci">int64 ShortestTransitionSlack(int64 node) const</div><div class="ttdoc">It makes sense to use the function only for self-dependent dimension.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l06169">routing_search.cc:6169</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_ac300c6449a65333961d8abdd7ce40a7a"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#ac300c6449a65333961d8abdd7ce40a7a">operations_research::RoutingDimension::SlackVar</a></div><div class="ttdeci">IntVar * SlackVar(int64 index) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02389">routing.h:2389</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_ae4b40d046de51f0ace9138a3692b0090"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#ae4b40d046de51f0ace9138a3692b0090">operations_research::RoutingDimension::GetNodePrecedences</a></div><div class="ttdeci">const std::vector< NodePrecedence > & GetNodePrecedences() const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02656">routing.h:2656</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html">operations_research::RoutingFilteredHeuristic</a></div><div class="ttdoc">Filter-based heuristic dedicated to routing.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03076">routing.h:3076</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_a2ace3be57d4d81121e8ebbd3642052c0"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#a2ace3be57d4d81121e8ebbd3642052c0">operations_research::RoutingFilteredHeuristic::GetStartChainEnd</a></div><div class="ttdeci">int GetStartChainEnd(int vehicle) const</div><div class="ttdoc">Returns the end of the start chain of vehicle,.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03086">routing.h:3086</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_a35a576bb3ea6814f122593d44a3c391e"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#a35a576bb3ea6814f122593d44a3c391e">operations_research::RoutingFilteredHeuristic::model</a></div><div class="ttdeci">RoutingModel * model() const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03084">routing.h:3084</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_a8a3ae6ba0baf1765da1a2f4a6cecc730"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#a8a3ae6ba0baf1765da1a2f4a6cecc730">operations_research::RoutingFilteredHeuristic::GetEndChainStart</a></div><div class="ttdeci">int GetEndChainStart(int vehicle) const</div><div class="ttdoc">Returns the start of the end chain of vehicle,.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03088">routing.h:3088</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_a9099c1d103124dca895eaa153e0656d4"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#a9099c1d103124dca895eaa153e0656d4">operations_research::RoutingFilteredHeuristic::BuildSolutionFromRoutes</a></div><div class="ttdeci">const Assignment * BuildSolutionFromRoutes(const std::function< int64(int64)> &next_accessor)</div><div class="ttdoc">Builds a solution starting from the routes formed by the next accessor.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02919">routing_search.cc:2919</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_a95c564e1bf2622acbd6868c6a61bc3a0"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#a95c564e1bf2622acbd6868c6a61bc3a0">operations_research::RoutingFilteredHeuristic::SetVehicleIndex</a></div><div class="ttdeci">virtual void SetVehicleIndex(int64 node, int vehicle)</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03102">routing.h:3102</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_a95f347f8419578337202450136ca78be"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">operations_research::RoutingFilteredHeuristic::StopSearch</a></div><div class="ttdeci">bool StopSearch() override</div><div class="ttdoc">Returns true if the search must be stopped.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03101">routing.h:3101</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_a97049801609b8cb68c0428970f916fd4"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#a97049801609b8cb68c0428970f916fd4">operations_research::RoutingFilteredHeuristic::MakeUnassignedNodesUnperformed</a></div><div class="ttdeci">void MakeUnassignedNodesUnperformed()</div><div class="ttdoc">Make all unassigned nodes unperformed.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03082">routing_search.cc:3082</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_aa0ae711364aadabc5365babc40a79fed"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#aa0ae711364aadabc5365babc40a79fed">operations_research::RoutingFilteredHeuristic::MakeDisjunctionNodesUnperformed</a></div><div class="ttdeci">void MakeDisjunctionNodesUnperformed(int64 node)</div><div class="ttdoc">Make nodes in the same disjunction as 'node' unperformed.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03073">routing_search.cc:3073</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_aafb639a547b12967feeefae66a3d3276"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#aafb639a547b12967feeefae66a3d3276">operations_research::RoutingFilteredHeuristic::ResetVehicleIndices</a></div><div class="ttdeci">virtual void ResetVehicleIndices()</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03103">routing.h:3103</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_abaca104cf41b5a5e3554f8ad72cdc28c"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#abaca104cf41b5a5e3554f8ad72cdc28c">operations_research::RoutingFilteredHeuristic::MakePartiallyPerformedPairsUnperformed</a></div><div class="ttdeci">void MakePartiallyPerformedPairsUnperformed()</div><div class="ttdoc">Make all partially performed pickup and delivery pairs unperformed.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03090">routing_search.cc:3090</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_aced1b7a7efd9a0ed004335f84b20cd58"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">operations_research::RoutingFilteredHeuristic::VehicleIsEmpty</a></div><div class="ttdeci">bool VehicleIsEmpty(int vehicle) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03104">routing.h:3104</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_aebd7c1966b7626a3b6cdfcbbc69ae2cc"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#aebd7c1966b7626a3b6cdfcbbc69ae2cc">operations_research::RoutingFilteredHeuristic::RoutingFilteredHeuristic</a></div><div class="ttdeci">RoutingFilteredHeuristic(RoutingModel *model, LocalSearchFilterManager *filter_manager)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02992">routing_search.cc:2992</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_index_manager_html"><div class="ttname"><a href="classoperations__research_1_1_routing_index_manager.html">operations_research::RoutingIndexManager</a></div><div class="ttdoc">Manager for any NodeIndex <-> variable index conversion.</div><div class="ttdef"><b>Definition:</b> <a href="routing__index__manager_8h_source.html#l00048">routing_index_manager.h:48</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html">operations_research::RoutingModel</a></div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00213">routing.h:213</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a1636c49d2587c3d9df16918345b82378"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a1636c49d2587c3d9df16918345b82378">operations_research::RoutingModel::IndexPair</a></div><div class="ttdeci">RoutingIndexPair IndexPair</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00247">routing.h:247</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_a32b850e71c62d48b685e29952e03ba4b"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a32b850e71c62d48b685e29952e03ba4b">operations_research::RoutingModel::ForEachNodeInDisjunctionWithMaxCardinalityFromIndex</a></div><div class="ttdeci">void ForEachNodeInDisjunctionWithMaxCardinalityFromIndex(int64 index, int64 max_cardinality, F f) const</div><div class="ttdoc">Calls f for each variable index of indices in the same disjunctions as the node corresponding to the ...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00639">routing.h:639</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a32bba655accbd7dc8e23d30bf679b880"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a32bba655accbd7dc8e23d30bf679b880">operations_research::RoutingModel::GetCostClassIndexOfVehicle</a></div><div class="ttdeci">CostClassIndex GetCostClassIndexOfVehicle(int64 vehicle) const</div><div class="ttdoc">Get the cost class index of the given vehicle.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01251">routing.h:1251</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_a3f5d70fe48cb54cbc5d8f6bba55b007d"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a3f5d70fe48cb54cbc5d8f6bba55b007d">operations_research::RoutingModel::CheckLimit</a></div><div class="ttdeci">bool CheckLimit()</div><div class="ttdoc">Returns true if the search limit has been crossed.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01330">routing.h:1330</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a43b2c4a7a4f58c02ca36ed0a4d76a3b4"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a43b2c4a7a4f58c02ca36ed0a4d76a3b4">operations_research::RoutingModel::MakeGreedyDescentLSOperator</a></div><div class="ttdeci">static std::unique_ptr< LocalSearchOperator > MakeGreedyDescentLSOperator(std::vector< IntVar * > variables)</div><div class="ttdoc">Perhaps move it to constraint_solver.h.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l06289">routing_search.cc:6289</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a4bab641f5b9bf8de266adad29558b4c2"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a4bab641f5b9bf8de266adad29558b4c2">operations_research::RoutingModel::GetFixedCostOfVehicle</a></div><div class="ttdeci">int64 GetFixedCostOfVehicle(int vehicle) const</div><div class="ttdoc">Returns the route fixed cost taken into account if the route of the vehicle is not empty,...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l01210">routing.cc:1210</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a5f32c22c620c811754ba7b6f977db864"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a5f32c22c620c811754ba7b6f977db864">operations_research::RoutingModel::solver</a></div><div class="ttdeci">Solver * solver() const</div><div class="ttdoc">Returns the underlying constraint solver.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01327">routing.h:1327</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_a76874cd778ea1b9220673e019f9e7abe"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a76874cd778ea1b9220673e019f9e7abe">operations_research::RoutingModel::IndexPairs</a></div><div class="ttdeci">RoutingIndexPairs IndexPairs</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00248">routing.h:248</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a8cded3d3d6746c179a8ec0eddad24342"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a8cded3d3d6746c179a8ec0eddad24342">operations_research::RoutingModel::VehicleVar</a></div><div class="ttdeci">IntVar * VehicleVar(int64 index) const</div><div class="ttdoc">Returns the vehicle variable of the node corresponding to index.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01222">routing.h:1222</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a92d7882c311f7d9d0c55c4def34150dd"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a92d7882c311f7d9d0c55c4def34150dd">operations_research::RoutingModel::GetArcCostForClass</a></div><div class="ttdeci">int64 GetArcCostForClass(int64 from_index, int64 to_index, int64 cost_class_index) const</div><div class="ttdoc">Returns the cost of the segment between two nodes for a given cost class.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l03928">routing.cc:3928</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_aa5cff2ee7fbe3a9c5c701bfba7460c83a272376ed085de7d28d36fa1013394cc8"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#aa5cff2ee7fbe3a9c5c701bfba7460c83a272376ed085de7d28d36fa1013394cc8">operations_research::RoutingModel::PICKUP_AND_DELIVERY_LIFO</a></div><div class="ttdeci">@ PICKUP_AND_DELIVERY_LIFO</div><div class="ttdoc">Deliveries must be performed in reverse order of pickups.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00234">routing.h:234</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_aa5cff2ee7fbe3a9c5c701bfba7460c83a2fecd02405f5ff0769292822ad17a955"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#aa5cff2ee7fbe3a9c5c701bfba7460c83a2fecd02405f5ff0769292822ad17a955">operations_research::RoutingModel::PICKUP_AND_DELIVERY_NO_ORDER</a></div><div class="ttdeci">@ PICKUP_AND_DELIVERY_NO_ORDER</div><div class="ttdoc">Any precedence is accepted.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00232">routing.h:232</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_aa5cff2ee7fbe3a9c5c701bfba7460c83a5c55a9aa52a754be8eb1b9d29af97a8a"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#aa5cff2ee7fbe3a9c5c701bfba7460c83a5c55a9aa52a754be8eb1b9d29af97a8a">operations_research::RoutingModel::PICKUP_AND_DELIVERY_FIFO</a></div><div class="ttdeci">@ PICKUP_AND_DELIVERY_FIFO</div><div class="ttdoc">Deliveries must be performed in the same order as pickups.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00237">routing.h:236</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_aad154b31953d2b467bbac3e4ac696cd6"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#aad154b31953d2b467bbac3e4ac696cd6">operations_research::RoutingModel::Nexts</a></div><div class="ttdeci">const std::vector< IntVar * > & Nexts() const</div><div class="ttdoc">Returns all next variables of the model, such that Nexts(i) is the next variable of the node correspo...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01200">routing.h:1200</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_abcbe77312783c0a5aa4926ace764533b"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#abcbe77312783c0a5aa4926ace764533b">operations_research::RoutingModel::CostVar</a></div><div class="ttdeci">IntVar * CostVar() const</div><div class="ttdoc">Returns the global cost variable which is being minimized.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01224">routing.h:1224</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_ac0772bdc4f47e45edccd5a5c25154993"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#ac0772bdc4f47e45edccd5a5c25154993">operations_research::RoutingModel::StateDependentTransitCallback</a></div><div class="ttdeci">const VariableIndexEvaluator2 & StateDependentTransitCallback(int callback_index) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00421">routing.h:421</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_acb94aaffe504b1b6873c3400a8edceaa"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#acb94aaffe504b1b6873c3400a8edceaa">operations_research::RoutingModel::MakeSelfDependentDimensionFinalizer</a></div><div class="ttdeci">DecisionBuilder * MakeSelfDependentDimensionFinalizer(const RoutingDimension *dimension)</div><div class="ttdoc">SWIG</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l06295">routing_search.cc:6295</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_ad3b144985c2b4b24cf39b839dbd9c16d"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#ad3b144985c2b4b24cf39b839dbd9c16d">operations_research::RoutingModel::GetCostClassesCount</a></div><div class="ttdeci">int GetCostClassesCount() const</div><div class="ttdoc">Returns the number of different cost classes in the model.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01268">routing.h:1268</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_ad47a58a0bd5dbd3136c04369fdcd7f4c"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#ad47a58a0bd5dbd3136c04369fdcd7f4c">operations_research::RoutingModel::MakeGuidedSlackFinalizer</a></div><div class="ttdeci">DecisionBuilder * MakeGuidedSlackFinalizer(const RoutingDimension *dimension, std::function< int64(int64)> initializer)</div><div class="ttdoc">The next few members are in the public section only for testing purposes.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l06162">routing_search.cc:6162</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_ad558398f8c75f81d879f74d18ba5e7c3"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#ad558398f8c75f81d879f74d18ba5e7c3">operations_research::RoutingModel::TransitCallback</a></div><div class="ttdeci">const TransitCallback2 & TransitCallback(int callback_index) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00413">routing.h:413</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="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html">operations_research::SavingsFilteredHeuristic::SavingsContainer</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l05022">routing_search.cc:5022</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html_a10dec7373473c460b835c82e29bebcb9"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a10dec7373473c460b835c82e29bebcb9">operations_research::SavingsFilteredHeuristic::SavingsContainer::AddNewSaving</a></div><div class="ttdeci">void AddNewSaving(const Saving &saving, int64 total_cost, int64 before_node, int64 after_node, int vehicle_type)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l05062">routing_search.cc:5062</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html_a3ce766f398d38eedd815c8e89f5e2bc4"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a3ce766f398d38eedd815c8e89f5e2bc4">operations_research::SavingsFilteredHeuristic::SavingsContainer::ReinjectSkippedSavingsStartingAt</a></div><div class="ttdeci">void ReinjectSkippedSavingsStartingAt(int64 node)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l05200">routing_search.cc:5200</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html_a678bb2c3921bb34d05a9af1802b188dc"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a678bb2c3921bb34d05a9af1802b188dc">operations_research::SavingsFilteredHeuristic::SavingsContainer::ReinjectSkippedSavingsEndingAt</a></div><div class="ttdeci">void ReinjectSkippedSavingsEndingAt(int64 node)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l05205">routing_search.cc:5205</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html_a6e4036b54f3ff84ef42fa4acabf6158b"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a6e4036b54f3ff84ef42fa4acabf6158b">operations_research::SavingsFilteredHeuristic::SavingsContainer::HasSaving</a></div><div class="ttdeci">bool HasSaving()</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l05124">routing_search.cc:5124</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html_a9e0ba906ec6006c16ab30b7a3a4fe100"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a9e0ba906ec6006c16ab30b7a3a4fe100">operations_research::SavingsFilteredHeuristic::SavingsContainer::InitializeContainer</a></div><div class="ttdeci">void InitializeContainer(int64 size, int64 saving_neighbors)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l05034">routing_search.cc:5034</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html_ab2c8a5a9d539f1fb49d767045f8c9297"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ab2c8a5a9d539f1fb49d767045f8c9297">operations_research::SavingsFilteredHeuristic::SavingsContainer::GetSaving</a></div><div class="ttdeci">Saving GetSaving()</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l05129">routing_search.cc:5129</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html_ab4ff697245c706fa950702d316f073ba"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ab4ff697245c706fa950702d316f073ba">operations_research::SavingsFilteredHeuristic::SavingsContainer::SavingsContainer</a></div><div class="ttdeci">SavingsContainer(const SavingsFilteredHeuristic *savings_db, int vehicle_types)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l05024">routing_search.cc:5024</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html_abf0869704ce65d912e6dcc71945ee737"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#abf0869704ce65d912e6dcc71945ee737">operations_research::SavingsFilteredHeuristic::SavingsContainer::UpdateWithType</a></div><div class="ttdeci">void UpdateWithType(int type)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l05189">routing_search.cc:5189</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html_ad7378ee53fe29a5ac2b72c1ae77a3d03"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ad7378ee53fe29a5ac2b72c1ae77a3d03">operations_research::SavingsFilteredHeuristic::SavingsContainer::Update</a></div><div class="ttdeci">void Update(bool update_best_saving, int type=-1)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l05165">routing_search.cc:5165</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html_ada63207817608e2ee55de24fc53b0ca0"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ada63207817608e2ee55de24fc53b0ca0">operations_research::SavingsFilteredHeuristic::SavingsContainer::GetSortedSavingsForVehicleType</a></div><div class="ttdeci">const std::vector< Saving > & GetSortedSavingsForVehicleType(int type)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l05194">routing_search.cc:5194</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html_ae424c3360277f457eba79fd25b4eed3b"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ae424c3360277f457eba79fd25b4eed3b">operations_research::SavingsFilteredHeuristic::SavingsContainer::Sort</a></div><div class="ttdeci">void Sort()</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l05071">routing_search.cc:5071</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html">operations_research::SavingsFilteredHeuristic</a></div><div class="ttdoc">Filter-based decision builder which builds a solution by using Clarke & Wright's Savings heuristic.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03635">routing.h:3635</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a01596b614ecce63ba83d5c16b242507c"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a01596b614ecce63ba83d5c16b242507c">operations_research::SavingsFilteredHeuristic::StartNewRouteWithBestVehicleOfType</a></div><div class="ttdeci">int StartNewRouteWithBestVehicleOfType(int type, int64 before_node, int64 after_node)</div><div class="ttdoc">Finds the best available vehicle of type "type" to start a new route to serve the arc before_node-->a...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l05439">routing_search.cc:5439</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a1d636dfe2c494b3348053095bce46556"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">operations_research::SavingsFilteredHeuristic::vehicle_type_curator_</a></div><div class="ttdeci">std::unique_ptr< VehicleTypeCurator > vehicle_type_curator_</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03699">routing.h:3699</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a2520cfaec0cd23cd56fd1eec8db79be4"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a2520cfaec0cd23cd56fd1eec8db79be4">operations_research::SavingsFilteredHeuristic::Saving</a></div><div class="ttdeci">std::pair< int64, int64 > Saving</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03660">routing.h:3660</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a2bc82055bf34be9162ce82b5d87b0289"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">operations_research::SavingsFilteredHeuristic::BuildSolutionInternal</a></div><div class="ttdeci">bool BuildSolutionInternal() override</div><div class="ttdoc">Virtual method to redefine how to build a solution.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l05421">routing_search.cc:5421</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a3ca37b113e071c2c1aca971b7008d275"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a3ca37b113e071c2c1aca971b7008d275">operations_research::SavingsFilteredHeuristic::GetVehicleTypeFromSaving</a></div><div class="ttdeci">int64 GetVehicleTypeFromSaving(const Saving &saving) const</div><div class="ttdoc">Returns the cost class from a saving.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03670">routing.h:3670</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a689974dbdbc3a3247a2f9c1263dc85b4"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">operations_research::SavingsFilteredHeuristic::savings_container_</a></div><div class="ttdeci">std::unique_ptr< SavingsContainer< Saving > > savings_container_</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03697">routing.h:3697</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a69f73ddf69522d81d6dd919c316cae8a"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a69f73ddf69522d81d6dd919c316cae8a">operations_research::SavingsFilteredHeuristic::~SavingsFilteredHeuristic</a></div><div class="ttdeci">~SavingsFilteredHeuristic() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l05419">routing_search.cc:5419</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a7ad6f39413bee55cd55f66ea28d40d38"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a7ad6f39413bee55cd55f66ea28d40d38">operations_research::SavingsFilteredHeuristic::GetSavingValue</a></div><div class="ttdeci">int64 GetSavingValue(const Saving &saving) const</div><div class="ttdoc">Returns the saving value from a saving.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03682">routing.h:3682</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a84b19d1c2e9a93a7e02dc12972c9c969"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a84b19d1c2e9a93a7e02dc12972c9c969">operations_research::SavingsFilteredHeuristic::ExtraSavingsMemoryMultiplicativeFactor</a></div><div class="ttdeci">virtual double ExtraSavingsMemoryMultiplicativeFactor() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_aab2d3476524269df9653877e976028d1"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#aab2d3476524269df9653877e976028d1">operations_research::SavingsFilteredHeuristic::GetBeforeNodeFromSaving</a></div><div class="ttdeci">int64 GetBeforeNodeFromSaving(const Saving &saving) const</div><div class="ttdoc">Returns the "before node" from a saving.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03674">routing.h:3674</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_ac0258a794b8bf819b03f3337ff558596"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#ac0258a794b8bf819b03f3337ff558596">operations_research::SavingsFilteredHeuristic::GetAfterNodeFromSaving</a></div><div class="ttdeci">int64 GetAfterNodeFromSaving(const Saving &saving) const</div><div class="ttdoc">Returns the "after node" from a saving.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03678">routing.h:3678</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_aeb4e0e0b0899af694678658062b4f037"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#aeb4e0e0b0899af694678658062b4f037">operations_research::SavingsFilteredHeuristic::BuildRoutesFromSavings</a></div><div class="ttdeci">virtual void BuildRoutesFromSavings()=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html"><div class="ttname"><a href="classoperations__research_1_1_solver.html">operations_research::Solver</a></div><div class="ttdoc">Solver Class.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00253">constraint_solver.h:253</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_a3094f1982f455fd97342c64b7c0b3ccf"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a3094f1982f455fd97342c64b7c0b3ccf">operations_research::Solver::VariableValueComparator</a></div><div class="ttdeci">std::function< bool(int64, int64, int64)> VariableValueComparator</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00756">constraint_solver.h:756</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_a869f7ed2cc6505c59ecf1eb8ecb2288a"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a869f7ed2cc6505c59ecf1eb8ecb2288a">operations_research::Solver::GetLocalSearchMonitor</a></div><div class="ttdeci">LocalSearchMonitor * GetLocalSearchMonitor() const</div><div class="ttdoc">Returns the local search monitor.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l03211">constraint_solver.cc:3211</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_a946780dfafc8faa3dd2d345850213be5"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a946780dfafc8faa3dd2d345850213be5">operations_research::Solver::Solve</a></div><div class="ttdeci">bool Solve(DecisionBuilder *const db, const std::vector< SearchMonitor * > &monitors)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l01791">constraint_solver.cc:1791</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_ab741cb25dd32d1cbe02fbfb36337d9bb"><div class="ttname"><a href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">operations_research::Solver::RevAlloc</a></div><div class="ttdeci">T * RevAlloc(T *object)</div><div class="ttdoc">Registers the given object as being reversible.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00796">constraint_solver.h:796</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_aeb92d4addb41255c9732cacfcb54f795"><div class="ttname"><a href="classoperations__research_1_1_solver.html#aeb92d4addb41255c9732cacfcb54f795">operations_research::Solver::Fail</a></div><div class="ttdeci">void Fail()</div><div class="ttdoc">Abandon the current branch in the search tree. A backtrack will follow.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l02416">constraint_solver.cc:2416</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_a1e5ae9fb14fd6b25919148ae8bbaf050"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">operations_research::SparseBitset::PositionsSetAtLeastOnce</a></div><div class="ttdeci">const std::vector< IntegerType > & PositionsSetAtLeastOnce() const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00813">bitset.h:813</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_a41f798a04019147982b29c576ff9d8b7"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">operations_research::SparseBitset::Set</a></div><div class="ttdeci">void Set(IntegerType index)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00803">bitset.h:803</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_aa7d76b766faf39c1652b6617eac5fe20"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#aa7d76b766faf39c1652b6617eac5fe20">operations_research::SparseBitset::ClearAll</a></div><div class="ttdeci">void ClearAll()</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00774">bitset.h:774</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_ab4bc8236a9bfe59526e353800a0f0470"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#ab4bc8236a9bfe59526e353800a0f0470">operations_research::SparseBitset::SparseClearAll</a></div><div class="ttdeci">void SparseClearAll()</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00770">bitset.h:770</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_vehicle_type_curator_html_a14dcf3d10159ae170c79ac9cac11cf5b"><div class="ttname"><a href="classoperations__research_1_1_vehicle_type_curator.html#a14dcf3d10159ae170c79ac9cac11cf5b">operations_research::VehicleTypeCurator::Update</a></div><div class="ttdeci">void Update(const std::function< bool(int)> &remove_vehicle)</div><div class="ttdoc">Goes through all the currently stored vehicles and removes vehicles for which remove_vehicle() return...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02786">routing_search.cc:2786</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_vehicle_type_curator_html_a3c728b8544bdbae03f52979a1fda6f90"><div class="ttname"><a href="classoperations__research_1_1_vehicle_type_curator.html#a3c728b8544bdbae03f52979a1fda6f90">operations_research::VehicleTypeCurator::GetCompatibleVehicleOfType</a></div><div class="ttdeci">std::pair< int, int > GetCompatibleVehicleOfType(int type, std::function< bool(int)> vehicle_is_compatible, std::function< bool(int)> stop_and_return_vehicle)</div><div class="ttdoc">Searches for the best compatible vehicle of the given type, i.e.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02808">routing_search.cc:2808</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_vehicle_type_curator_html_a814500d3b9447208c46bd15c6f95f96d"><div class="ttname"><a href="classoperations__research_1_1_vehicle_type_curator.html#a814500d3b9447208c46bd15c6f95f96d">operations_research::VehicleTypeCurator::Reset</a></div><div class="ttdeci">void Reset(const std::function< bool(int)> &store_vehicle)</div><div class="ttdoc">Resets the vehicles stored, storing only vehicles from the vehicle_type_container_ for which store_ve...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02757">routing_search.cc:2757</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_8cc_html_a395f613555f398dd389670bb4c2a4599"><div class="ttname"><a href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a></div><div class="ttdeci">Block * next</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l00674">constraint_solver.cc:674</a></div></div>
|
|
<div class="ttc" id="aconstraint__solveri_8h_html"><div class="ttname"><a href="constraint__solveri_8h.html">constraint_solveri.h</a></div></div>
|
|
<div class="ttc" id="acp__model__fz__solver_8cc_html_a10a1eab179b472c030bdc2a2efef7219"><div class="ttname"><a href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a></div><div class="ttdeci">SatParameters parameters</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__fz__solver_8cc_source.html#l00108">cp_model_fz_solver.cc:108</a></div></div>
|
|
<div class="ttc" id="adefault__search_8cc_html_ac673bc430bdc3fdaa09f7becf98ef267"><div class="ttname"><a href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a></div><div class="ttdeci">const std::string name</div><div class="ttdef"><b>Definition:</b> <a href="default__search_8cc_source.html#l00808">default_search.cc:808</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_a21edc7ca4cc5802c8779d68556bc09cf"><div class="ttname"><a href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a></div><div class="ttdeci">int64 value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00043">demon_profiler.cc:43</a></div></div>
|
|
<div class="ttc" id="aexpr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01858">expr_array.cc:1858</a></div></div>
|
|
<div class="ttc" id="aexpressions_8cc_html_a3c46258b924243eeeb3608b2df18db4f"><div class="ttname"><a href="expressions_8cc.html#a3c46258b924243eeeb3608b2df18db4f">limit_</a></div><div class="ttdeci">const int64 limit_</div><div class="ttdef"><b>Definition:</b> <a href="expressions_8cc_source.html#l05447">expressions.cc:5447</a></div></div>
|
|
<div class="ttc" id="agraph__constraints_8cc_html_ada20fc3a4c70c79d8b02df6b8c2413f5"><div class="ttname"><a href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a></div><div class="ttdeci">const std::vector< IntVar * > cumuls_</div><div class="ttdef"><b>Definition:</b> <a href="graph__constraints_8cc_source.html#l00670">graph_constraints.cc:670</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"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</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="aintegral__types_8h_html_af458164b470cbba416d5ed579e00ff60"><div class="ttname"><a href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a></div><div class="ttdeci">static const int64 kint64min</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00052">integral_types.h:52</a></div></div>
|
|
<div class="ttc" id="aiterator__adaptors_8h_html"><div class="ttname"><a href="iterator__adaptors_8h.html">iterator_adaptors.h</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html_af8df3547bfde53a5acb93e2607b0034a"><div class="ttname"><a href="macros_8h.html#af8df3547bfde53a5acb93e2607b0034a">DISALLOW_COPY_AND_ASSIGN</a></div><div class="ttdeci">#define DISALLOW_COPY_AND_ASSIGN(TypeName)</div><div class="ttdef"><b>Definition:</b> <a href="macros_8h_source.html#l00029">macros.h:29</a></div></div>
|
|
<div class="ttc" id="amap__util_8h_html"><div class="ttname"><a href="map__util_8h.html">map_util.h</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_a7a0f8dc4187504b814d8a8be463b517c"><div class="ttname"><a href="namespacegtl.html#a7a0f8dc4187504b814d8a8be463b517c">gtl::LookupOrInsert</a></div><div class="ttdeci">Collection::value_type::second_type & LookupOrInsert(Collection *const collection, const typename Collection::value_type::first_type &key, const typename Collection::value_type::second_type &value)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00207">map_util.h:207</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_a92a0e7b0e74024284adc849a4499940f"><div class="ttname"><a href="namespacegtl.html#a92a0e7b0e74024284adc849a4499940f">gtl::STLClearObject</a></div><div class="ttdeci">void STLClearObject(T *obj)</div><div class="ttdef"><b>Definition:</b> <a href="stl__util_8h_source.html#l00123">stl_util.h:123</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_aae28e97bd1fa93cb0032642550da7455"><div class="ttname"><a href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a></div><div class="ttdeci">bool ContainsKey(const Collection &collection, const Key &key)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00170">map_util.h:170</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_abc18f60961e36340e64e428827c0e38e"><div class="ttname"><a href="namespacegtl.html#abc18f60961e36340e64e428827c0e38e">gtl::FindWithDefault</a></div><div class="ttdeci">const Collection::value_type::second_type & FindWithDefault(const Collection &collection, const typename Collection::value_type::first_type &key, const typename Collection::value_type::second_type &value)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00026">map_util.h:26</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a3f1a1b8a7a1a488e263a2e74f45d2a59"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a3f1a1b8a7a1a488e263a2e74f45d2a59">operations_research::sat::Value</a></div><div class="ttdeci">std::function< int64(const Model &)> Value(IntegerVariable v)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01487">integer.h:1487</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aedc4ddb96acc28481c09828d2e016815a2579881e7c83261bc21bafb5a5c92cad"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a2579881e7c83261bc21bafb5a5c92cad">operations_research::sat::OPTIMAL</a></div><div class="ttdeci">@ OPTIMAL</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l00239">cp_model.pb.h:239</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aedc4ddb96acc28481c09828d2e016815a2884fa43446c0cbc9c7a9b74d41d7483"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aedc4ddb96acc28481c09828d2e016815a2884fa43446c0cbc9c7a9b74d41d7483">operations_research::sat::INFEASIBLE</a></div><div class="ttdeci">@ INFEASIBLE</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l00238">cp_model.pb.h:238</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_a0e3e4445c55d0c59ef4edbaf7acbd3a8"><div class="ttname"><a href="namespaceoperations__research.html#a0e3e4445c55d0c59ef4edbaf7acbd3a8">operations_research::AppendDimensionCumulFilters</a></div><div class="ttdeci">void AppendDimensionCumulFilters(const std::vector< RoutingDimension * > &dimensions, const RoutingSearchParameters &parameters, bool filter_objective_cost, std::vector< LocalSearchFilterManager::FilterEvent > *filters)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02185">routing_search.cc:2185</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a216af1fa4181c4020916828eeeba1591"><div class="ttname"><a href="namespaceoperations__research.html#a216af1fa4181c4020916828eeeba1591">operations_research::MakePathCumulFilter</a></div><div class="ttdeci">IntVarLocalSearchFilter * MakePathCumulFilter(const RoutingDimension &dimension, const RoutingSearchParameters &parameters, bool propagate_own_objective_value, bool filter_objective_cost, bool can_use_lp=true)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02071">routing_search.cc:2071</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a21d884ccc65aaa3278b977df560d31a0"><div class="ttname"><a href="namespaceoperations__research.html#a21d884ccc65aaa3278b977df560d31a0">operations_research::MakeCumulBoundsPropagatorFilter</a></div><div class="ttdeci">IntVarLocalSearchFilter * MakeCumulBoundsPropagatorFilter(const RoutingDimension &dimension)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02578">routing_search.cc:2578</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a228fe84d99348c2b62bb4f70a6371d9b"><div class="ttname"><a href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">operations_research::CapSub</a></div><div class="ttdeci">int64 CapSub(int64 x, int64 y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00154">saturated_arithmetic.h:154</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a2781a8c44a6af7c07abf923678a18697"><div class="ttname"><a href="namespaceoperations__research.html#a2781a8c44a6af7c07abf923678a18697">operations_research::MakeGlobalLPCumulFilter</a></div><div class="ttdeci">IntVarLocalSearchFilter * MakeGlobalLPCumulFilter(GlobalDimensionCumulOptimizer *optimizer, bool filter_objective_cost)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02682">routing_search.cc:2682</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a4bbb86ef97d259aabe86e0abde4759e3"><div class="ttname"><a href="namespaceoperations__research.html#a4bbb86ef97d259aabe86e0abde4759e3">operations_research::MakeVehicleAmortizedCostFilter</a></div><div class="ttdeci">IntVarLocalSearchFilter * MakeVehicleAmortizedCostFilter(const RoutingModel &routing_model)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00669">routing_search.cc:669</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a6a24a85a196ecfb2b799a0409ef757c6"><div class="ttname"><a href="namespaceoperations__research.html#a6a24a85a196ecfb2b799a0409ef757c6">operations_research::MakeCPFeasibilityFilter</a></div><div class="ttdeci">IntVarLocalSearchFilter * MakeCPFeasibilityFilter(RoutingModel *routing_model)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02747">routing_search.cc:2747</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_aa0787bf78fb09d1e30f2451b5a68d4b8"><div class="ttname"><a href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">operations_research::DimensionSchedulingStatus</a></div><div class="ttdeci">DimensionSchedulingStatus</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00126">routing_lp_scheduling.h:126</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aa2ef113e19924b88159b114a929b3358"><div class="ttname"><a href="namespaceoperations__research.html#aa2ef113e19924b88159b114a929b3358">operations_research::MakeMaxActiveVehiclesFilter</a></div><div class="ttdeci">IntVarLocalSearchFilter * MakeMaxActiveVehiclesFilter(const RoutingModel &routing_model)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00111">routing_search.cc:111</a></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="anamespaceoperations__research_html_ab962de016b1a14868457ac876eadf008"><div class="ttname"><a href="namespaceoperations__research.html#ab962de016b1a14868457ac876eadf008">operations_research::MakeVehicleVarFilter</a></div><div class="ttdeci">IntVarLocalSearchFilter * MakeVehicleVarFilter(const RoutingModel &routing_model)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02520">routing_search.cc:2520</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ac2bc88830e25267bc0c6a662c1aaa814"><div class="ttname"><a href="namespaceoperations__research.html#ac2bc88830e25267bc0c6a662c1aaa814">operations_research::MakeUnaryDimensionFilter</a></div><div class="ttdeci">LocalSearchFilter * MakeUnaryDimensionFilter(Solver *solver, std::unique_ptr< UnaryDimensionChecker > checker)</div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l03196">local_search.cc:3196</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ad03cbd2a51a0688c1fd08d3a7c1754c9"><div class="ttname"><a href="namespaceoperations__research.html#ad03cbd2a51a0688c1fd08d3a7c1754c9">operations_research::MakePickupDeliveryFilter</a></div><div class="ttdeci">IntVarLocalSearchFilter * MakePickupDeliveryFilter(const RoutingModel &routing_model, const RoutingModel::IndexPairs &pairs, const std::vector< RoutingModel::PickupAndDeliveryPolicy > &vehicle_policies)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02447">routing_search.cc:2447</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ada7da4059546f5ef90de0b2f8bada19a"><div class="ttname"><a href="namespaceoperations__research.html#ada7da4059546f5ef90de0b2f8bada19a">operations_research::MakeTypeRegulationsFilter</a></div><div class="ttdeci">IntVarLocalSearchFilter * MakeTypeRegulationsFilter(const RoutingModel &routing_model)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00818">routing_search.cc:818</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_adf85b9c9e168660e5f36d735d88f3955"><div class="ttname"><a href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">operations_research::kUnassigned</a></div><div class="ttdeci">static const int kUnassigned</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l00638">routing.cc:638</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ae2219dbffeee11e9bca17cc1e8217747"><div class="ttname"><a href="namespaceoperations__research.html#ae2219dbffeee11e9bca17cc1e8217747">operations_research::AppendLightWeightDimensionFilters</a></div><div class="ttdeci">void AppendLightWeightDimensionFilters(const PathState *path_state, const std::vector< RoutingDimension * > &dimensions, std::vector< LocalSearchFilterManager::FilterEvent > *filters)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02123">routing_search.cc:2123</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aeb15e4444582a925522843bb414de9c3"><div class="ttname"><a href="namespaceoperations__research.html#aeb15e4444582a925522843bb414de9c3">operations_research::MakeNodeDisjunctionFilter</a></div><div class="ttdeci">IntVarLocalSearchFilter * MakeNodeDisjunctionFilter(const RoutingModel &routing_model)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00284">routing_search.cc:284</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="aresource_8cc_html_a73461c37822b6ebb75b54ba1a9ffb442"><div class="ttname"><a href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a></div><div class="ttdeci">int64 delta</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l01684">resource.cc:1684</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_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_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 class="ttc" id="arouting__search_8cc_html_a08c9dc4849de8d21da6a13824e98fcdc"><div class="ttname"><a href="routing__search_8cc.html#a08c9dc4849de8d21da6a13824e98fcdc">cumul_value_support</a></div><div class="ttdeci">int cumul_value_support</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00966">routing_search.cc:966</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_a1743d739ea2e9ff0e1362984ae1fb586"><div class="ttname"><a href="routing__search_8cc.html#a1743d739ea2e9ff0e1362984ae1fb586">path_values</a></div><div class="ttdeci">std::vector< int64 > path_values</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00967">routing_search.cc:967</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_a204f9b990226e8288e1aaecbb496cbf8"><div class="ttname"><a href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a></div><div class="ttdeci">int64 bound</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00972">routing_search.cc:972</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_a437b1dcf96372e200f82e9f039054290"><div class="ttname"><a href="routing__search_8cc.html#a437b1dcf96372e200f82e9f039054290">cumul_value</a></div><div class="ttdeci">int64 cumul_value</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00965">routing_search.cc:965</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_a60696653bee60d2186d1ea5850f64567"><div class="ttname"><a href="routing__search_8cc.html#a60696653bee60d2186d1ea5850f64567">ABSL_FLAG</a></div><div class="ttdeci">ABSL_FLAG(bool, routing_strong_debug_checks, false, "Run stronger checks in debug; these stronger tests might change " "the complexity of the code in particular.")</div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_ab66ad179c8a6fcf1adb958cb51f4c7cb"><div class="ttname"><a href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a></div><div class="ttdeci">int64 coefficient</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00973">routing_search.cc:973</a></div></div>
|
|
<div class="ttc" id="arouting__types_8h_html"><div class="ttname"><a href="routing__types_8h.html">routing_types.h</a></div></div>
|
|
<div class="ttc" id="asaturated__arithmetic_8h_html"><div class="ttname"><a href="saturated__arithmetic_8h.html">saturated_arithmetic.h</a></div></div>
|
|
<div class="ttc" id="asearch_8cc_html_a5e5e8b8520054d3bdeb53ef0291ce4d9"><div class="ttname"><a href="search_8cc.html#a5e5e8b8520054d3bdeb53ef0291ce4d9">evaluator_</a></div><div class="ttdeci">std::function< int64(int64, int64)> evaluator_</div><div class="ttdef"><b>Definition:</b> <a href="search_8cc_source.html#l01361">search.cc:1361</a></div></div>
|
|
<div class="ttc" id="asmall__map_8h_html"><div class="ttname"><a href="small__map_8h.html">small_map.h</a></div></div>
|
|
<div class="ttc" id="asmall__ordered__set_8h_html"><div class="ttname"><a href="small__ordered__set_8h.html">small_ordered_set.h</a></div></div>
|
|
<div class="ttc" id="astl__util_8h_html"><div class="ttname"><a href="stl__util_8h.html">stl_util.h</a></div></div>
|
|
<div class="ttc" id="astrong__vector_8h_html"><div class="ttname"><a href="strong__vector_8h.html">strong_vector.h</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value_html"><div class="ttname"><a href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html">operations_research::CheapestInsertionFilteredHeuristic::StartEndValue</a></div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03128">routing.h:3128</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters_html"><div class="ttname"><a href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html">operations_research::GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionParameters</a></div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03198">routing.h:3198</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters_html_a0aa77787d0df1b489476bfc6714ef819"><div class="ttname"><a href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a0aa77787d0df1b489476bfc6714ef819">operations_research::GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionParameters::neighbors_ratio</a></div><div class="ttdeci">double neighbors_ratio</div><div class="ttdoc">If neighbors_ratio < 1 then for each node only this ratio of its neighbors leading to the smallest ar...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03209">routing.h:3209</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters_html_a28b4894c7c18183ac19b81d1b6d97e2f"><div class="ttname"><a href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a28b4894c7c18183ac19b81d1b6d97e2f">operations_research::GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionParameters::is_sequential</a></div><div class="ttdeci">bool is_sequential</div><div class="ttdoc">Whether the routes are constructed sequentially or in parallel.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03200">routing.h:3200</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters_html_a4de56a813d02ca0b525b77293179fca6"><div class="ttname"><a href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a4de56a813d02ca0b525b77293179fca6">operations_research::GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionParameters::min_neighbors</a></div><div class="ttdeci">int64 min_neighbors</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03210">routing.h:3210</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters_html_a5ad481f9ba9161a2aef5920b41303120"><div class="ttname"><a href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a5ad481f9ba9161a2aef5920b41303120">operations_research::GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionParameters::farthest_seeds_ratio</a></div><div class="ttdeci">double farthest_seeds_ratio</div><div class="ttdoc">The ratio of routes on which to insert farthest nodes as seeds before starting the cheapest insertion...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03203">routing.h:3203</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters_html_a7d91387b5081be8f22d053d93eb9edf4"><div class="ttname"><a href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a7d91387b5081be8f22d053d93eb9edf4">operations_research::GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionParameters::use_neighbors_ratio_for_initialization</a></div><div class="ttdeci">bool use_neighbors_ratio_for_initialization</div><div class="ttdoc">If true, only closest neighbors (see neighbors_ratio and min_neighbors) are considered as insertion p...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03214">routing.h:3214</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters_html_ad962358b9cb4da242cdc3c98ee2ce6ce"><div class="ttname"><a href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#ad962358b9cb4da242cdc3c98ee2ce6ce">operations_research::GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionParameters::add_unperformed_entries</a></div><div class="ttdeci">bool add_unperformed_entries</div><div class="ttdoc">If true, entries are created for making the nodes/pairs unperformed, and when the cost of making a no...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03219">routing.h:3219</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_routing_model_1_1_state_dependent_transit_html"><div class="ttname"><a href="structoperations__research_1_1_routing_model_1_1_state_dependent_transit.html">operations_research::RoutingModel::StateDependentTransit</a></div><div class="ttdoc">What follows is relevant for models with time/state dependent transits.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00264">routing.h:264</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_routing_model_1_1_state_dependent_transit_html_ab71e287979b5c9040d1596d12ed3bb5f"><div class="ttname"><a href="structoperations__research_1_1_routing_model_1_1_state_dependent_transit.html#ab71e287979b5c9040d1596d12ed3bb5f">operations_research::RoutingModel::StateDependentTransit::transit_plus_identity</a></div><div class="ttdeci">RangeMinMaxIndexFunction * transit_plus_identity</div><div class="ttdoc">f(x)</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00266">routing.h:266</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_routing_model_1_1_vehicle_type_container_1_1_vehicle_class_entry_html"><div class="ttname"><a href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container_1_1_vehicle_class_entry.html">operations_research::RoutingModel::VehicleTypeContainer::VehicleClassEntry</a></div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00359">routing.h:359</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_routing_model_1_1_vehicle_type_container_html_ab04b34ed94012cf2d892d6e9347ee9f6"><div class="ttname"><a href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container.html#ab04b34ed94012cf2d892d6e9347ee9f6">operations_research::RoutingModel::VehicleTypeContainer::sorted_vehicle_classes_per_type</a></div><div class="ttdeci">std::vector< std::set< VehicleClassEntry > > sorted_vehicle_classes_per_type</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00378">routing.h:378</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_routing_model_1_1_vehicle_type_container_html_ad39f5508cc37e45b2d759832d343c177"><div class="ttname"><a href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container.html#ad39f5508cc37e45b2d759832d343c177">operations_research::RoutingModel::VehicleTypeContainer::vehicles_per_vehicle_class</a></div><div class="ttdeci">std::vector< std::deque< int > > vehicles_per_vehicle_class</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00379">routing.h:379</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters_html"><div class="ttname"><a href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html">operations_research::SavingsFilteredHeuristic::SavingsParameters</a></div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03637">routing.h:3637</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters_html_a0aa77787d0df1b489476bfc6714ef819"><div class="ttname"><a href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a0aa77787d0df1b489476bfc6714ef819">operations_research::SavingsFilteredHeuristic::SavingsParameters::neighbors_ratio</a></div><div class="ttdeci">double neighbors_ratio</div><div class="ttdoc">If neighbors_ratio < 1 then for each node only this ratio of its neighbors leading to the smallest ar...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03640">routing.h:3640</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters_html_a222a2814083966736ad9aefde1dde290"><div class="ttname"><a href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a222a2814083966736ad9aefde1dde290">operations_research::SavingsFilteredHeuristic::SavingsParameters::arc_coefficient</a></div><div class="ttdeci">double arc_coefficient</div><div class="ttdoc">arc_coefficient is a strictly positive parameter indicating the coefficient of the arc being consider...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03649">routing.h:3649</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters_html_a33bd2c84a2be54d10959e5c0d81f86b5"><div class="ttname"><a href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a33bd2c84a2be54d10959e5c0d81f86b5">operations_research::SavingsFilteredHeuristic::SavingsParameters::max_memory_usage_bytes</a></div><div class="ttdeci">double max_memory_usage_bytes</div><div class="ttdoc">The number of neighbors considered for each node is also adapted so that the stored Savings don't use...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03643">routing.h:3643</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters_html_a8857f65b46da9e2012c7bd939a978442"><div class="ttname"><a href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a8857f65b46da9e2012c7bd939a978442">operations_research::SavingsFilteredHeuristic::SavingsParameters::add_reverse_arcs</a></div><div class="ttdeci">bool add_reverse_arcs</div><div class="ttdoc">If add_reverse_arcs is true, the neighborhood relationships are considered symmetrically.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l03646">routing.h:3646</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__search_8cc.html">routing_search.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>
|