1078 lines
277 KiB
HTML
1078 lines
277 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.3"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: routing_search.h Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.3</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.3 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('routing__search_8h_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.h</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="routing__search_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#ifndef OR_TOOLS_CONSTRAINT_SOLVER_ROUTING_SEARCH_H_</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#define OR_TOOLS_CONSTRAINT_SOLVER_ROUTING_SEARCH_H_</span></div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span> </div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <sys/types.h></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span> </div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include <functional></span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include <iterator></span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include <set></span></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include <tuple></span></div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include <utility></span></div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span> </div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include "absl/container/flat_hash_set.h"</span></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="preprocessor">#include "<a class="code" href="adjustable__priority__queue_8h.html">ortools/base/adjustable_priority_queue.h</a>"</span></div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="preprocessor">#include "<a class="code" href="macros_8h.html">ortools/base/macros.h</a>"</span></div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="preprocessor">#include "<a class="code" href="mathutil_8h.html">ortools/base/mathutil.h</a>"</span></div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span><span class="preprocessor">#include "<a class="code" href="constraint__solver_8h.html">ortools/constraint_solver/constraint_solver.h</a>"</span></div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="preprocessor">#include "<a class="code" href="constraint__solveri_8h.html">ortools/constraint_solver/constraint_solveri.h</a>"</span></div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="preprocessor">#include "<a class="code" href="routing_8h.html">ortools/constraint_solver/routing.h</a>"</span></div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="preprocessor">#include "<a class="code" href="routing__index__manager_8h.html">ortools/constraint_solver/routing_index_manager.h</a>"</span></div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span><span class="preprocessor">#include "<a class="code" href="bitset_8h.html">ortools/util/bitset.h</a>"</span></div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> </div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> </div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span><span class="keyword">class </span>IntVarFilteredHeuristic;</div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span><span class="preprocessor">#ifndef SWIG</span></div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_vehicle_type_curator.html"> 48</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_vehicle_type_curator.html">VehicleTypeCurator</a> {</div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_vehicle_type_curator.html#a6b5135fd0df7429d4b75c59930086166"> 50</a></span> <span class="keyword">explicit</span> <a class="code hl_function" href="classoperations__research_1_1_vehicle_type_curator.html#a6b5135fd0df7429d4b75c59930086166">VehicleTypeCurator</a>(</div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container.html">RoutingModel::VehicleTypeContainer</a>& vehicle_type_container)</div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> : vehicle_type_container_(&vehicle_type_container) {}</div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> </div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_vehicle_type_curator.html#aa3c0b35c06027c12fb62729bc65046e0"> 54</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_vehicle_type_curator.html#aa3c0b35c06027c12fb62729bc65046e0">NumTypes</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vehicle_type_container_-><a class="code hl_function" href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container.html#aa3c0b35c06027c12fb62729bc65046e0">NumTypes</a>(); }</div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> </div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_vehicle_type_curator.html#acf6083fc320b50822c395a662729074b"> 56</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_vehicle_type_curator.html#acf6083fc320b50822c395a662729074b">Type</a>(<span class="keywordtype">int</span> vehicle)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vehicle_type_container_-><a class="code hl_function" href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container.html#acf6083fc320b50822c395a662729074b">Type</a>(vehicle); }</div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> </div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_vehicle_type_curator.html#a814500d3b9447208c46bd15c6f95f96d">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 id="l00061" name="l00061"></a><span class="lineno"> 61</span> </div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_vehicle_type_curator.html#a14dcf3d10159ae170c79ac9cac11cf5b">Update</a>(<span class="keyword">const</span> std::function<<span class="keywordtype">bool</span>(<span class="keywordtype">int</span>)>& remove_vehicle);</div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> </div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_vehicle_type_curator.html#ae273572e5466d452e207c045ee242b4a"> 66</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_vehicle_type_curator.html#ae273572e5466d452e207c045ee242b4a">GetLowestFixedCostVehicleOfType</a>(<span class="keywordtype">int</span> type)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(type, <a class="code hl_function" href="classoperations__research_1_1_vehicle_type_curator.html#aa3c0b35c06027c12fb62729bc65046e0">NumTypes</a>());</div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="keyword">const</span> std::set<VehicleClassEntry>& vehicle_classes =</div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> sorted_vehicle_classes_per_type_[type];</div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="keywordflow">if</span> (vehicle_classes.empty()) {</div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="keywordflow">return</span> -1;</div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> }</div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a> = (vehicle_classes.begin())-><a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a>;</div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!vehicles_per_vehicle_class_[<a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a>].empty());</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="keywordflow">return</span> vehicles_per_vehicle_class_[<a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a>][0];</div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> }</div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> </div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_vehicle_type_curator.html#ae1f5dd925d8845bf8826dfa9bad2518b"> 78</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_vehicle_type_curator.html#ae1f5dd925d8845bf8826dfa9bad2518b">ReinjectVehicleOfClass</a>(<span class="keywordtype">int</span> vehicle, <span class="keywordtype">int</span> <a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a>,</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> int64_t fixed_cost) {</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> std::vector<int>& vehicles = vehicles_per_vehicle_class_[<a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a>];</div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="keywordflow">if</span> (vehicles.empty()) {</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> std::set<VehicleClassEntry>& vehicle_classes =</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> sorted_vehicle_classes_per_type_[<a class="code hl_function" href="classoperations__research_1_1_vehicle_type_curator.html#acf6083fc320b50822c395a662729074b">Type</a>(vehicle)];</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="keyword">const</span> <span class="keyword">auto</span>& insertion =</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> vehicle_classes.insert({<a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a>, fixed_cost});</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(insertion.second);</div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> }</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> vehicles.push_back(vehicle);</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> }</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> </div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_vehicle_type_curator.html#a2f14bd5a823d4b8de9bf858ec54466cc">HasCompatibleVehicleOfType</a>(</div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="keywordtype">int</span> type, <span class="keyword">const</span> std::function<<span class="keywordtype">bool</span>(<span class="keywordtype">int</span>)>& vehicle_is_compatible) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> std::pair<int, int> <a class="code hl_function" href="classoperations__research_1_1_vehicle_type_curator.html#a3c728b8544bdbae03f52979a1fda6f90">GetCompatibleVehicleOfType</a>(</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</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 id="l00107" name="l00107"></a><span class="lineno"> 107</span> std::function<<span class="keywordtype">bool</span>(<span class="keywordtype">int</span>)> stop_and_return_vehicle);</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> </div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="keyword">using</span> VehicleClassEntry =</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <a class="code hl_struct" href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container_1_1_vehicle_class_entry.html">RoutingModel::VehicleTypeContainer::VehicleClassEntry</a>;</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container.html">RoutingModel::VehicleTypeContainer</a>* <span class="keyword">const</span> vehicle_type_container_;</div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="comment">// clang-format off</span></div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> std::vector<std::set<VehicleClassEntry> > sorted_vehicle_classes_per_type_;</div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> std::vector<std::vector<int> > vehicles_per_vehicle_class_;</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> <span class="comment">// clang-format on</span></div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span>};</div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> </div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span><a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984">operations_research::FirstSolutionStrategy::Value</a></div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span><a class="code hl_function" href="namespaceoperations__research.html#a89152c6d7ca6a92ff106fe602c706816">AutomaticFirstSolutionStrategy</a>(<span class="keywordtype">bool</span> has_pickup_deliveries,</div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="keywordtype">bool</span> has_node_precedences,</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="keywordtype">bool</span> has_single_vehicle_node);</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> </div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> </div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span><span class="comment">// TODO(user): Eventually move this to the core CP solver library</span></div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_decision_builder.html"> 142</a></span><span class="comment"></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_int_var_filtered_decision_builder.html">IntVarFilteredDecisionBuilder</a> : <span class="keyword">public</span> <a class="code hl_class" href="classoperations__research_1_1_decision_builder.html">DecisionBuilder</a> {</div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="keyword">explicit</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#acf25bca8c52b674f343820aaf3d339b5">IntVarFilteredDecisionBuilder</a>(</div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> std::unique_ptr<IntVarFilteredHeuristic> heuristic);</div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> </div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#a7108359d8e6c5360f554581971ed253f"> 147</a></span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#a7108359d8e6c5360f554581971ed253f">~IntVarFilteredDecisionBuilder</a>()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> </div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <a class="code hl_class" href="classoperations__research_1_1_decision.html">Decision</a>* <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#a8c71ca62b0ac538bf37374602e4259bb">Next</a>(<a class="code hl_class" href="classoperations__research_1_1_solver.html">Solver</a>* solver) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> </div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> std::string <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#aed804747c45a7e1caf81461f9e45dd91">DebugString</a>() <span class="keyword">const override</span>;</div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> </div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> int64_t <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#aac2118d22c4275990bdd1fec28a2a8d3">number_of_decisions</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> int64_t <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#afd4b70bcd23086d4968db3a1d822ee2c">number_of_rejects</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> </div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <span class="keyword">const</span> std::unique_ptr<IntVarFilteredHeuristic> heuristic_;</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span>};</div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> </div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html"> 162</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_int_var_filtered_heuristic.html">IntVarFilteredHeuristic</a> {</div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#af60e2423a0fdf248c6e5aed0f7368a07">IntVarFilteredHeuristic</a>(<a class="code hl_class" href="classoperations__research_1_1_solver.html">Solver</a>* solver, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> <span class="keyword">const</span> std::vector<IntVar*>& secondary_vars,</div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager);</div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> </div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a57eacabea8a7dca6ed62b309f476fea6"> 168</a></span> <span class="keyword">virtual</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a57eacabea8a7dca6ed62b309f476fea6">~IntVarFilteredHeuristic</a>() {}</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> </div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <a class="code hl_class" href="classoperations__research_1_1_assignment.html">Assignment</a>* <span class="keyword">const</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#af3787f4febdbe5033e9834b770476f5d">BuildSolution</a>();</div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> </div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#aac2118d22c4275990bdd1fec28a2a8d3"> 176</a></span> int64_t <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#aac2118d22c4275990bdd1fec28a2a8d3">number_of_decisions</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> number_of_decisions_; }</div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#afd4b70bcd23086d4968db3a1d822ee2c"> 177</a></span> int64_t <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#afd4b70bcd23086d4968db3a1d822ee2c">number_of_rejects</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> number_of_rejects_; }</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> </div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a8eba5d533fa9df4617c1868d3ec2afc4"> 179</a></span> <span class="keyword">virtual</span> std::string <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a8eba5d533fa9df4617c1868d3ec2afc4">DebugString</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <span class="stringliteral">"IntVarFilteredHeuristic"</span>; }</div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> </div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="keyword">protected</span>:</div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a7ae7a2033e2a22ad1dedbf2f3ec8745f">ResetSolution</a>();</div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#aa1103b3a47f7bf316a81ed91ba3e4657"> 185</a></span> <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#aa1103b3a47f7bf316a81ed91ba3e4657">InitializeSolution</a>() { <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0c46fa4dcc0fed2329041bbe90fc575a"> 187</a></span> <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0c46fa4dcc0fed2329041bbe90fc575a">BuildSolutionInternal</a>() = 0;</div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> std::optional<int64_t> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="keywordtype">bool</span> commit);</div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a64b348f1f572b9ea470c453a027e6d25"> 197</a></span> <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a64b348f1f572b9ea470c453a027e6d25">StopSearch</a>() { <span class="keywordflow">return</span> <span class="keyword">false</span>; }</div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8"> 200</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(int64_t <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, int64_t <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) {</div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> <span class="keywordflow">if</span> (!is_in_delta_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]) {</div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> delta_-><a class="code hl_function" href="classoperations__research_1_1_assignment.html#af5fcf5e7a47ae0e325fb1df409ac8e24">FastAdd</a>(vars_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>])-><a class="code hl_function" href="classoperations__research_1_1_int_var_element.html#ac1b2a58bfded95799de1fd7958bdb2a3">SetValue</a>(<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> delta_indices_.push_back(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> is_in_delta_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> delta_-><a class="code hl_function" href="classoperations__research_1_1_assignment.html#a88515905299f569432aaba577a912add">SetValue</a>(vars_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>], <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> }</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> }</div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25"> 211</a></span> int64_t <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(int64_t <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a6743122cc2fc4818b402ba3d484c6ea4">assignment_</a>-><a class="code hl_function" href="classoperations__research_1_1_assignment.html#aedb0ae1cf8c3e89218604e5c039d6c7b">IntVarContainer</a>().<a class="code hl_function" href="classoperations__research_1_1_assignment_container.html#a574bbe757dd231a59843422be3145dee">Element</a>(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>).<a class="code hl_function" href="classoperations__research_1_1_int_var_element.html#a15828fe5ecfdada586a63d916b7b7354">Value</a>();</div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> }</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4"> 215</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(int64_t <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a6743122cc2fc4818b402ba3d484c6ea4">assignment_</a>-><a class="code hl_function" href="classoperations__research_1_1_assignment.html#aedb0ae1cf8c3e89218604e5c039d6c7b">IntVarContainer</a>().<a class="code hl_function" href="classoperations__research_1_1_assignment_container.html#a574bbe757dd231a59843422be3145dee">Element</a>(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>).<a class="code hl_function" href="classoperations__research_1_1_int_var_element.html#ad197164b669d8b5d35fc497754791e39">Var</a>() != <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> }</div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3"> 220</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vars_.size(); }</div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#abd977c8d4bb6eae7fd1037091282050f"> 222</a></span> <a class="code hl_class" href="classoperations__research_1_1_int_var.html">IntVar</a>* <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#abd977c8d4bb6eae7fd1037091282050f">Var</a>(int64_t <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vars_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]; }</div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0d549adeef4a45d3078daf3d7918b253"> 224</a></span> int64_t <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0d549adeef4a45d3078daf3d7918b253">SecondaryVarIndex</a>(int64_t <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a9d72d8f26ae6d9340f48eb0340c264d1">HasSecondaryVars</a>());</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> + base_vars_size_;</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> }</div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a9d72d8f26ae6d9340f48eb0340c264d1"> 229</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a9d72d8f26ae6d9340f48eb0340c264d1">HasSecondaryVars</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> base_vars_size_ != vars_.size(); }</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#addc62ce828c9c5ebdf398492bcd04495"> 231</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#addc62ce828c9c5ebdf398492bcd04495">IsSecondaryVar</a>(int64_t <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> >= base_vars_size_; }</div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a8447b106d07db2466b60e534964730d3">SynchronizeFilters</a>();</div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> </div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a6743122cc2fc4818b402ba3d484c6ea4"> 235</a></span> <a class="code hl_class" href="classoperations__research_1_1_assignment.html">Assignment</a>* <span class="keyword">const</span> <a class="code hl_variable" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a6743122cc2fc4818b402ba3d484c6ea4">assignment_</a>;</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> </div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> <span class="keywordtype">bool</span> FilterAccept();</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> </div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> <a class="code hl_class" href="classoperations__research_1_1_solver.html">Solver</a>* solver_;</div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> std::vector<IntVar*> vars_;</div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> <span class="keyword">const</span> <span class="keywordtype">int</span> base_vars_size_;</div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> <a class="code hl_class" href="classoperations__research_1_1_assignment.html">Assignment</a>* <span class="keyword">const</span> delta_;</div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> std::vector<int> delta_indices_;</div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> std::vector<bool> is_in_delta_;</div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> <a class="code hl_class" href="classoperations__research_1_1_assignment.html">Assignment</a>* <span class="keyword">const</span> empty_;</div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager_;</div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> int64_t objective_upper_bound_;</div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> int64_t number_of_decisions_;</div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> int64_t number_of_rejects_;</div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span>};</div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> </div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_filtered_heuristic.html"> 257</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_routing_filtered_heuristic.html">RoutingFilteredHeuristic</a> : <span class="keyword">public</span> <a class="code hl_class" href="classoperations__research_1_1_int_var_filtered_heuristic.html">IntVarFilteredHeuristic</a> {</div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a93aa105d700ad23091b6f3f55d48a2c1">RoutingFilteredHeuristic</a>(<a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>,</div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager,</div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> <span class="keywordtype">bool</span> omit_secondary_vars = <span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_filtered_heuristic.html#a0e2e09ac8fcd3f591b0a6ae0cf5ea613"> 262</a></span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a0e2e09ac8fcd3f591b0a6ae0cf5ea613">~RoutingFilteredHeuristic</a>()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_assignment.html">Assignment</a>* <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#ae645e8ef4a6929a1c1dbed695f2dd67d">BuildSolutionFromRoutes</a>(</div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor);</div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06"> 266</a></span> <a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> model_; }</div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_filtered_heuristic.html#a2ace3be57d4d81121e8ebbd3642052c0"> 268</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a2ace3be57d4d81121e8ebbd3642052c0">GetStartChainEnd</a>(<span class="keywordtype">int</span> vehicle)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> start_chain_ends_[vehicle]; }</div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_filtered_heuristic.html#a8a3ae6ba0baf1765da1a2f4a6cecc730"> 270</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a8a3ae6ba0baf1765da1a2f4a6cecc730">GetEndChainStart</a>(<span class="keywordtype">int</span> vehicle)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> end_chain_starts_[vehicle]; }</div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a954a436d9a6c975e9d88f2ec659bb090">MakeDisjunctionNodesUnperformed</a>(int64_t node);</div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a97049801609b8cb68c0428970f916fd4">MakeUnassignedNodesUnperformed</a>();</div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#abaca104cf41b5a5e3554f8ad72cdc28c">MakePartiallyPerformedPairsUnperformed</a>();</div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> </div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> <span class="keyword">protected</span>:</div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be"> 283</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()<span class="keyword"> override </span>{ <span class="keywordflow">return</span> model_-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a3f5d70fe48cb54cbc5d8f6bba55b007d">CheckLimit</a>(); }</div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_filtered_heuristic.html#a7cccc6ea4b6f89355769bc0de4548f1d"> 284</a></span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a7cccc6ea4b6f89355769bc0de4548f1d">SetVehicleIndex</a>(int64_t node, <span class="keywordtype">int</span> vehicle) {}</div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_filtered_heuristic.html#aafb639a547b12967feeefae66a3d3276"> 285</a></span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#aafb639a547b12967feeefae66a3d3276">ResetVehicleIndices</a>() {}</div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58"> 286</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(<span class="keywordtype">int</span> vehicle)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->Start(vehicle)) == <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#afb80fd36c1fb57d2db049403483e2074">End</a>(vehicle);</div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> }</div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> </div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> <span class="keywordtype">bool</span> InitializeSolution() <span class="keyword">override</span>;</div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> </div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <span class="keyword">const</span> model_;</div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> std::vector<int64_t> start_chain_ends_;</div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> std::vector<int64_t> end_chain_starts_;</div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span>};</div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> </div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html"> 299</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html">CheapestInsertionFilteredHeuristic</a> : <span class="keyword">public</span> <a class="code hl_class" href="classoperations__research_1_1_routing_filtered_heuristic.html">RoutingFilteredHeuristic</a> {</div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ac06fb0f5750600ea6fd0cba641f5e35f">CheapestInsertionFilteredHeuristic</a>(</div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>,</div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> std::function<int64_t(int64_t, int64_t, int64_t)> evaluator,</div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> std::function<int64_t(int64_t)> penalty_evaluator,</div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager);</div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#aa8428da25ac9fa3e49779cc7ddebadb3"> 307</a></span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#aa8428da25ac9fa3e49779cc7ddebadb3">~CheapestInsertionFilteredHeuristic</a>()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> </div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> <span class="keyword">protected</span>:</div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion.html"> 310</a></span> <span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion.html">NodeInsertion</a> {</div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion.html#af84130a995a03822468f3f7c05fed7d0"> 311</a></span> int64_t <a class="code hl_variable" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion.html#af84130a995a03822468f3f7c05fed7d0">insert_after</a>;</div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion.html#a96b8f0fa9ab1e12aed840c7293becbf7"> 312</a></span> <span class="keywordtype">int</span> <a class="code hl_variable" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion.html#a96b8f0fa9ab1e12aed840c7293becbf7">vehicle</a>;</div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion.html#ac072af30c4ffbc834bb4c681f6ecb514"> 313</a></span> int64_t <a class="code hl_variable" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>;</div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> </div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion.html#afdc41377e793261ff493c83aadb4923b"> 315</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion.html#afdc41377e793261ff493c83aadb4923b">operator<</a>(<span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion.html">NodeInsertion</a>& other)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> <span class="keywordflow">return</span> std::tie(<a class="code hl_variable" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>, <a class="code hl_variable" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion.html#af84130a995a03822468f3f7c05fed7d0">insert_after</a>, <a class="code hl_variable" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion.html#a96b8f0fa9ab1e12aed840c7293becbf7">vehicle</a>) <</div>
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> std::tie(other.<a class="code hl_variable" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>, other.<a class="code hl_variable" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion.html#af84130a995a03822468f3f7c05fed7d0">insert_after</a>, other.<a class="code hl_variable" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion.html#a96b8f0fa9ab1e12aed840c7293becbf7">vehicle</a>);</div>
|
|
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> }</div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> };</div>
|
|
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html"> 320</a></span> <span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html">StartEndValue</a> {</div>
|
|
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html#af19794e430154e5ce0b38cdccf19824d"> 321</a></span> int64_t <a class="code hl_variable" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html#af19794e430154e5ce0b38cdccf19824d">num_allowed_vehicles</a>;</div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html#a655ac5f27be9e0897ecb004c8f1b2f1c"> 322</a></span> int64_t <a class="code hl_variable" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html#a655ac5f27be9e0897ecb004c8f1b2f1c">distance</a>;</div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html#a96b8f0fa9ab1e12aed840c7293becbf7"> 323</a></span> <span class="keywordtype">int</span> <a class="code hl_variable" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html#a96b8f0fa9ab1e12aed840c7293becbf7">vehicle</a>;</div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> </div>
|
|
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html#a7c4b3e8b0b9144aa29c94fc54c74d045"> 325</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html#a7c4b3e8b0b9144aa29c94fc54c74d045">operator<</a>(<span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html">StartEndValue</a>& other)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> <span class="keywordflow">return</span> std::tie(<a class="code hl_variable" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html#af19794e430154e5ce0b38cdccf19824d">num_allowed_vehicles</a>, <a class="code hl_variable" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html#a655ac5f27be9e0897ecb004c8f1b2f1c">distance</a>, <a class="code hl_variable" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html#a96b8f0fa9ab1e12aed840c7293becbf7">vehicle</a>) <</div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> std::tie(other.<a class="code hl_variable" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html#af19794e430154e5ce0b38cdccf19824d">num_allowed_vehicles</a>, other.<a class="code hl_variable" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html#a655ac5f27be9e0897ecb004c8f1b2f1c">distance</a>,</div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> other.<a class="code hl_variable" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html#a96b8f0fa9ab1e12aed840c7293becbf7">vehicle</a>);</div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> }</div>
|
|
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span> };</div>
|
|
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#af10aed726a9b750452a6fdeae3f00feb"> 331</a></span> <span class="keyword">typedef</span> std::pair<<a class="code hl_struct" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html">StartEndValue</a>, <span class="comment">/*seed_node*/</span> <span class="keywordtype">int</span>> <a class="code hl_typedef" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#af10aed726a9b750452a6fdeae3f00feb">Seed</a>;</div>
|
|
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span> </div>
|
|
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> <span class="comment">// clang-format off</span></div>
|
|
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> std::vector<std::vector<StartEndValue> ></div>
|
|
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a356517cd51c4b6259d7f439718719eaa">ComputeStartEndDistanceForVehicles</a>(<span class="keyword">const</span> std::vector<int>& vehicles);</div>
|
|
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> </div>
|
|
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> <span class="keyword">template</span> <<span class="keyword">class</span> Queue></div>
|
|
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a69d38e86eb8fc2fa4df0d8839c8dd5a9">InitializePriorityQueue</a>(</div>
|
|
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> std::vector<std::vector<StartEndValue> >* start_end_distances_per_node,</div>
|
|
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> <a class="code hl_class" href="classoperations__research_1_1_queue.html">Queue</a>* priority_queue);</div>
|
|
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> <span class="comment">// clang-format on</span></div>
|
|
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> </div>
|
|
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#add2710777ca3960d37c6257cd95edfee">InsertBetween</a>(int64_t node, int64_t predecessor, int64_t successor,</div>
|
|
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> <span class="keywordtype">int</span> vehicle = -1);</div>
|
|
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ade9dca16a1e0dc26a1a8797874413fad">AppendInsertionPositionsAfter</a>(</div>
|
|
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> int64_t node_to_insert, int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>, int64_t next_after_start,</div>
|
|
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> <span class="keywordtype">int</span> vehicle, std::vector<NodeInsertion>* node_insertions);</div>
|
|
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> <span class="comment">// TODO(user): Replace 'insert_before' and 'insert_after' by 'predecessor'</span></div>
|
|
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> <span class="comment">// and 'successor' in the code.</span></div>
|
|
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> int64_t <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a750200f78e5b4a8192dc7ad3b6b10eec">GetInsertionCostForNodeAtPosition</a>(int64_t node_to_insert,</div>
|
|
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> int64_t insert_after,</div>
|
|
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> int64_t insert_before,</div>
|
|
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> <span class="keywordtype">int</span> vehicle) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> int64_t <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#aab2e87c6b0d1adc11fef2b9a9ea8d5a6">GetUnperformedValue</a>(int64_t node_to_insert) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> </div>
|
|
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a4c042f054da687c4a586dc5d3dfaef10"> 380</a></span> std::function<int64_t(int64_t, int64_t, int64_t)> <a class="code hl_variable" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a4c042f054da687c4a586dc5d3dfaef10">evaluator_</a>;</div>
|
|
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ab757210526cd08167062c3bf8cf63982"> 381</a></span> std::function<int64_t(int64_t)> <a class="code hl_variable" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ab757210526cd08167062c3bf8cf63982">penalty_evaluator_</a>;</div>
|
|
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span>};</div>
|
|
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span> </div>
|
|
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html"> 391</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html">GlobalCheapestInsertionFilteredHeuristic</a></div>
|
|
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> : <span class="keyword">public</span> <a class="code hl_class" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html">CheapestInsertionFilteredHeuristic</a> {</div>
|
|
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html"> 394</a></span> <span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html">GlobalCheapestInsertionParameters</a> {</div>
|
|
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a28b4894c7c18183ac19b81d1b6d97e2f"> 396</a></span> <span class="keywordtype">bool</span> <a class="code hl_variable" 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 id="l00399" name="l00399"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a5ad481f9ba9161a2aef5920b41303120"> 399</a></span> <span class="keywordtype">double</span> <a class="code hl_variable" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a5ad481f9ba9161a2aef5920b41303120">farthest_seeds_ratio</a>;</div>
|
|
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a0aa77787d0df1b489476bfc6714ef819"> 405</a></span> <span class="keywordtype">double</span> <a class="code hl_variable" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a0aa77787d0df1b489476bfc6714ef819">neighbors_ratio</a>;</div>
|
|
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a264a3f98da0f7c3a55447f0e77e7ec8c"> 406</a></span> int64_t <a class="code hl_variable" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a264a3f98da0f7c3a55447f0e77e7ec8c">min_neighbors</a>;</div>
|
|
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a7d91387b5081be8f22d053d93eb9edf4"> 410</a></span> <span class="keywordtype">bool</span> <a class="code hl_variable" 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 id="l00415" name="l00415"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#ad962358b9cb4da242cdc3c98ee2ce6ce"> 415</a></span> <span class="keywordtype">bool</span> <a class="code hl_variable" 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 id="l00416" name="l00416"></a><span class="lineno"> 416</span> };</div>
|
|
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span> </div>
|
|
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"> 419</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#a7aa80364c8c66a703b80f0bd883788ad">GlobalCheapestInsertionFilteredHeuristic</a>(</div>
|
|
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>,</div>
|
|
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</span> std::function<int64_t(int64_t, int64_t, int64_t)> evaluator,</div>
|
|
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno"> 422</span> std::function<int64_t(int64_t)> penalty_evaluator,</div>
|
|
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno"> 423</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager,</div>
|
|
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno"> 424</span> <a class="code hl_struct" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html">GlobalCheapestInsertionParameters</a> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>);</div>
|
|
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#a8a78d376aa2c8065becb7df9be4a54da"> 425</a></span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#a8a78d376aa2c8065becb7df9be4a54da">~GlobalCheapestInsertionFilteredHeuristic</a>()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno"> 426</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">BuildSolutionInternal</a>() <span class="keyword">override</span>;</div>
|
|
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#aed804747c45a7e1caf81461f9e45dd91"> 427</a></span> std::string <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#aed804747c45a7e1caf81461f9e45dd91">DebugString</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno"> 428</span> <span class="keywordflow">return</span> <span class="stringliteral">"GlobalCheapestInsertionFilteredHeuristic"</span>;</div>
|
|
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> }</div>
|
|
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> </div>
|
|
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> <span class="keyword">class </span>NodeEntry;</div>
|
|
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> <span class="keyword">class </span>PairEntry;</div>
|
|
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> </div>
|
|
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> <span class="keyword">typedef</span> absl::flat_hash_set<PairEntry*> PairEntries;</div>
|
|
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno"> 436</span> <span class="keyword">typedef</span> absl::flat_hash_set<NodeEntry*> NodeEntries;</div>
|
|
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno"> 437</span> </div>
|
|
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"> 444</span> <span class="keywordtype">bool</span> InsertPairsAndNodesByRequirementTopologicalOrder();</div>
|
|
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"> 445</span> </div>
|
|
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno"> 452</span> <span class="keywordtype">bool</span> InsertPairs(</div>
|
|
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno"> 453</span> <span class="keyword">const</span> std::map<int64_t, std::vector<int>>& pair_indices_by_bucket);</div>
|
|
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno"> 454</span> </div>
|
|
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"> 458</span> <span class="keywordtype">bool</span> UseEmptyVehicleTypeCuratorForVehicle(<span class="keywordtype">int</span> vehicle,</div>
|
|
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno"> 459</span> <span class="keywordtype">bool</span> all_vehicles = <span class="keyword">true</span>) {</div>
|
|
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"> 460</span> <span class="keywordflow">return</span> vehicle >= 0 && <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(vehicle) && all_vehicles;</div>
|
|
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno"> 461</span> }</div>
|
|
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> </div>
|
|
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno"> 469</span> <span class="keywordtype">bool</span> InsertPairEntryUsingEmptyVehicleTypeCurator(</div>
|
|
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno"> 470</span> <span class="keyword">const</span> std::vector<int>& pair_indices, PairEntry* <span class="keyword">const</span> pair_entry,</div>
|
|
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno"> 471</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<PairEntry></a>* priority_queue,</div>
|
|
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno"> 472</span> std::vector<PairEntries>* pickup_to_entries,</div>
|
|
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno"> 473</span> std::vector<PairEntries>* delivery_to_entries);</div>
|
|
<div class="line"><a id="l00474" name="l00474"></a><span class="lineno"> 474</span> </div>
|
|
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno"> 482</span> <span class="keywordtype">bool</span> InsertNodesOnRoutes(</div>
|
|
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno"> 483</span> <span class="keyword">const</span> std::map<int64_t, std::vector<int>>& nodes_by_bucket,</div>
|
|
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno"> 484</span> <span class="keyword">const</span> absl::flat_hash_set<int>& vehicles);</div>
|
|
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno"> 485</span> </div>
|
|
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno"> 493</span> <span class="keywordtype">bool</span> InsertNodeEntryUsingEmptyVehicleTypeCurator(</div>
|
|
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno"> 494</span> <span class="keyword">const</span> std::vector<int>& <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, <span class="keywordtype">bool</span> all_vehicles,</div>
|
|
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno"> 495</span> NodeEntry* <span class="keyword">const</span> node_entry,</div>
|
|
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno"> 496</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<NodeEntry></a>* priority_queue,</div>
|
|
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno"> 497</span> std::vector<NodeEntries>* position_to_node_entries);</div>
|
|
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"> 498</span> </div>
|
|
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno"> 504</span> <span class="keywordtype">bool</span> SequentialInsertNodes(</div>
|
|
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno"> 505</span> <span class="keyword">const</span> std::map<int64_t, std::vector<int>>& nodes_by_bucket);</div>
|
|
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno"> 506</span> </div>
|
|
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno"> 510</span> <span class="keywordtype">void</span> DetectUsedVehicles(std::vector<bool>* is_vehicle_used,</div>
|
|
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno"> 511</span> std::vector<int>* unused_vehicles,</div>
|
|
<div class="line"><a id="l00512" name="l00512"></a><span class="lineno"> 512</span> absl::flat_hash_set<int>* used_vehicles);</div>
|
|
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno"> 513</span> </div>
|
|
<div class="line"><a id="l00517" name="l00517"></a><span class="lineno"> 517</span> <span class="keywordtype">void</span> InsertFarthestNodesAsSeeds();</div>
|
|
<div class="line"><a id="l00518" name="l00518"></a><span class="lineno"> 518</span> </div>
|
|
<div class="line"><a id="l00527" name="l00527"></a><span class="lineno"> 527</span> <span class="keyword">template</span> <<span class="keyword">class</span> Queue></div>
|
|
<div class="line"><a id="l00528" name="l00528"></a><span class="lineno"> 528</span> <span class="keywordtype">int</span> InsertSeedNode(</div>
|
|
<div class="line"><a id="l00529" name="l00529"></a><span class="lineno"> 529</span> std::vector<std::vector<StartEndValue>>* start_end_distances_per_node,</div>
|
|
<div class="line"><a id="l00530" name="l00530"></a><span class="lineno"> 530</span> Queue* priority_queue, std::vector<bool>* is_vehicle_used);</div>
|
|
<div class="line"><a id="l00531" name="l00531"></a><span class="lineno"> 531</span> <span class="comment">// clang-format on</span></div>
|
|
<div class="line"><a id="l00532" name="l00532"></a><span class="lineno"> 532</span> </div>
|
|
<div class="line"><a id="l00535" name="l00535"></a><span class="lineno"> 535</span> <span class="keywordtype">bool</span> InitializePairPositions(</div>
|
|
<div class="line"><a id="l00536" name="l00536"></a><span class="lineno"> 536</span> <span class="keyword">const</span> std::vector<int>& pair_indices,</div>
|
|
<div class="line"><a id="l00537" name="l00537"></a><span class="lineno"> 537</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<PairEntry></a>* priority_queue,</div>
|
|
<div class="line"><a id="l00538" name="l00538"></a><span class="lineno"> 538</span> std::vector<PairEntries>* pickup_to_entries,</div>
|
|
<div class="line"><a id="l00539" name="l00539"></a><span class="lineno"> 539</span> std::vector<PairEntries>* delivery_to_entries);</div>
|
|
<div class="line"><a id="l00545" name="l00545"></a><span class="lineno"> 545</span> <span class="keywordtype">void</span> InitializeInsertionEntriesPerformingPair(</div>
|
|
<div class="line"><a id="l00546" name="l00546"></a><span class="lineno"> 546</span> int64_t pickup, int64_t delivery,</div>
|
|
<div class="line"><a id="l00547" name="l00547"></a><span class="lineno"> 547</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<PairEntry></a>* priority_queue,</div>
|
|
<div class="line"><a id="l00548" name="l00548"></a><span class="lineno"> 548</span> std::vector<PairEntries>* pickup_to_entries,</div>
|
|
<div class="line"><a id="l00549" name="l00549"></a><span class="lineno"> 549</span> std::vector<PairEntries>* delivery_to_entries);</div>
|
|
<div class="line"><a id="l00553" name="l00553"></a><span class="lineno"> 553</span> <span class="keywordtype">bool</span> UpdateAfterPairInsertion(</div>
|
|
<div class="line"><a id="l00554" name="l00554"></a><span class="lineno"> 554</span> <span class="keyword">const</span> std::vector<int>& pair_indices, <span class="keywordtype">int</span> vehicle, int64_t pickup,</div>
|
|
<div class="line"><a id="l00555" name="l00555"></a><span class="lineno"> 555</span> int64_t pickup_position, int64_t delivery, int64_t delivery_position,</div>
|
|
<div class="line"><a id="l00556" name="l00556"></a><span class="lineno"> 556</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<PairEntry></a>* priority_queue,</div>
|
|
<div class="line"><a id="l00557" name="l00557"></a><span class="lineno"> 557</span> std::vector<PairEntries>* pickup_to_entries,</div>
|
|
<div class="line"><a id="l00558" name="l00558"></a><span class="lineno"> 558</span> std::vector<PairEntries>* delivery_to_entries);</div>
|
|
<div class="line"><a id="l00561" name="l00561"></a><span class="lineno"> 561</span> <span class="keywordtype">bool</span> UpdatePairPositions(<span class="keyword">const</span> std::vector<int>& pair_indices, <span class="keywordtype">int</span> vehicle,</div>
|
|
<div class="line"><a id="l00562" name="l00562"></a><span class="lineno"> 562</span> int64_t insert_after,</div>
|
|
<div class="line"><a id="l00563" name="l00563"></a><span class="lineno"> 563</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<PairEntry></a>* priority_queue,</div>
|
|
<div class="line"><a id="l00564" name="l00564"></a><span class="lineno"> 564</span> std::vector<PairEntries>* pickup_to_entries,</div>
|
|
<div class="line"><a id="l00565" name="l00565"></a><span class="lineno"> 565</span> std::vector<PairEntries>* delivery_to_entries) {</div>
|
|
<div class="line"><a id="l00566" name="l00566"></a><span class="lineno"> 566</span> <span class="keywordflow">return</span> UpdatePickupPositions(pair_indices, vehicle, insert_after,</div>
|
|
<div class="line"><a id="l00567" name="l00567"></a><span class="lineno"> 567</span> priority_queue, pickup_to_entries,</div>
|
|
<div class="line"><a id="l00568" name="l00568"></a><span class="lineno"> 568</span> delivery_to_entries) &&</div>
|
|
<div class="line"><a id="l00569" name="l00569"></a><span class="lineno"> 569</span> UpdateDeliveryPositions(pair_indices, vehicle, insert_after,</div>
|
|
<div class="line"><a id="l00570" name="l00570"></a><span class="lineno"> 570</span> priority_queue, pickup_to_entries,</div>
|
|
<div class="line"><a id="l00571" name="l00571"></a><span class="lineno"> 571</span> delivery_to_entries);</div>
|
|
<div class="line"><a id="l00572" name="l00572"></a><span class="lineno"> 572</span> }</div>
|
|
<div class="line"><a id="l00575" name="l00575"></a><span class="lineno"> 575</span> <span class="keywordtype">bool</span> UpdatePickupPositions(<span class="keyword">const</span> std::vector<int>& pair_indices, <span class="keywordtype">int</span> vehicle,</div>
|
|
<div class="line"><a id="l00576" name="l00576"></a><span class="lineno"> 576</span> int64_t pickup_insert_after,</div>
|
|
<div class="line"><a id="l00577" name="l00577"></a><span class="lineno"> 577</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<PairEntry></a>* priority_queue,</div>
|
|
<div class="line"><a id="l00578" name="l00578"></a><span class="lineno"> 578</span> std::vector<PairEntries>* pickup_to_entries,</div>
|
|
<div class="line"><a id="l00579" name="l00579"></a><span class="lineno"> 579</span> std::vector<PairEntries>* delivery_to_entries);</div>
|
|
<div class="line"><a id="l00582" name="l00582"></a><span class="lineno"> 582</span> <span class="keywordtype">bool</span> UpdateDeliveryPositions(</div>
|
|
<div class="line"><a id="l00583" name="l00583"></a><span class="lineno"> 583</span> <span class="keyword">const</span> std::vector<int>& pair_indices, <span class="keywordtype">int</span> vehicle,</div>
|
|
<div class="line"><a id="l00584" name="l00584"></a><span class="lineno"> 584</span> int64_t delivery_insert_after,</div>
|
|
<div class="line"><a id="l00585" name="l00585"></a><span class="lineno"> 585</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<PairEntry></a>* priority_queue,</div>
|
|
<div class="line"><a id="l00586" name="l00586"></a><span class="lineno"> 586</span> std::vector<PairEntries>* pickup_to_entries,</div>
|
|
<div class="line"><a id="l00587" name="l00587"></a><span class="lineno"> 587</span> std::vector<PairEntries>* delivery_to_entries);</div>
|
|
<div class="line"><a id="l00590" name="l00590"></a><span class="lineno"> 590</span> <span class="keywordtype">void</span> DeletePairEntry(PairEntry* entry,</div>
|
|
<div class="line"><a id="l00591" name="l00591"></a><span class="lineno"> 591</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<PairEntry></a>* priority_queue,</div>
|
|
<div class="line"><a id="l00592" name="l00592"></a><span class="lineno"> 592</span> std::vector<PairEntries>* pickup_to_entries,</div>
|
|
<div class="line"><a id="l00593" name="l00593"></a><span class="lineno"> 593</span> std::vector<PairEntries>* delivery_to_entries);</div>
|
|
<div class="line"><a id="l00598" name="l00598"></a><span class="lineno"> 598</span> <span class="keywordtype">void</span> AddPairEntry(int64_t pickup, int64_t pickup_insert_after,</div>
|
|
<div class="line"><a id="l00599" name="l00599"></a><span class="lineno"> 599</span> int64_t delivery, int64_t delivery_insert_after,</div>
|
|
<div class="line"><a id="l00600" name="l00600"></a><span class="lineno"> 600</span> <span class="keywordtype">int</span> vehicle,</div>
|
|
<div class="line"><a id="l00601" name="l00601"></a><span class="lineno"> 601</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<PairEntry></a>* priority_queue,</div>
|
|
<div class="line"><a id="l00602" name="l00602"></a><span class="lineno"> 602</span> std::vector<PairEntries>* pickup_entries,</div>
|
|
<div class="line"><a id="l00603" name="l00603"></a><span class="lineno"> 603</span> std::vector<PairEntries>* delivery_entries) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00606" name="l00606"></a><span class="lineno"> 606</span> <span class="keywordtype">void</span> UpdatePairEntry(</div>
|
|
<div class="line"><a id="l00607" name="l00607"></a><span class="lineno"> 607</span> PairEntry* <span class="keyword">const</span> pair_entry,</div>
|
|
<div class="line"><a id="l00608" name="l00608"></a><span class="lineno"> 608</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<PairEntry></a>* priority_queue) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00612" name="l00612"></a><span class="lineno"> 612</span> int64_t GetInsertionValueForPairAtPositions(int64_t pickup,</div>
|
|
<div class="line"><a id="l00613" name="l00613"></a><span class="lineno"> 613</span> int64_t pickup_insert_after,</div>
|
|
<div class="line"><a id="l00614" name="l00614"></a><span class="lineno"> 614</span> int64_t delivery,</div>
|
|
<div class="line"><a id="l00615" name="l00615"></a><span class="lineno"> 615</span> int64_t delivery_insert_after,</div>
|
|
<div class="line"><a id="l00616" name="l00616"></a><span class="lineno"> 616</span> <span class="keywordtype">int</span> vehicle) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00617" name="l00617"></a><span class="lineno"> 617</span> </div>
|
|
<div class="line"><a id="l00620" name="l00620"></a><span class="lineno"> 620</span> <span class="keywordtype">bool</span> InitializePositions(<span class="keyword">const</span> std::vector<int>& <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>,</div>
|
|
<div class="line"><a id="l00621" name="l00621"></a><span class="lineno"> 621</span> <span class="keyword">const</span> absl::flat_hash_set<int>& vehicles,</div>
|
|
<div class="line"><a id="l00622" name="l00622"></a><span class="lineno"> 622</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<NodeEntry></a>* priority_queue,</div>
|
|
<div class="line"><a id="l00623" name="l00623"></a><span class="lineno"> 623</span> std::vector<NodeEntries>* position_to_node_entries);</div>
|
|
<div class="line"><a id="l00629" name="l00629"></a><span class="lineno"> 629</span> <span class="keywordtype">void</span> InitializeInsertionEntriesPerformingNode(</div>
|
|
<div class="line"><a id="l00630" name="l00630"></a><span class="lineno"> 630</span> int64_t node, <span class="keyword">const</span> absl::flat_hash_set<int>& vehicles,</div>
|
|
<div class="line"><a id="l00631" name="l00631"></a><span class="lineno"> 631</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<NodeEntry></a>* priority_queue,</div>
|
|
<div class="line"><a id="l00632" name="l00632"></a><span class="lineno"> 632</span> std::vector<NodeEntries>* position_to_node_entries);</div>
|
|
<div class="line"><a id="l00635" name="l00635"></a><span class="lineno"> 635</span> <span class="keywordtype">bool</span> UpdatePositions(<span class="keyword">const</span> std::vector<int>& <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, <span class="keywordtype">int</span> vehicle,</div>
|
|
<div class="line"><a id="l00636" name="l00636"></a><span class="lineno"> 636</span> int64_t insert_after, <span class="keywordtype">bool</span> all_vehicles,</div>
|
|
<div class="line"><a id="l00637" name="l00637"></a><span class="lineno"> 637</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<NodeEntry></a>* priority_queue,</div>
|
|
<div class="line"><a id="l00638" name="l00638"></a><span class="lineno"> 638</span> std::vector<NodeEntries>* node_entries);</div>
|
|
<div class="line"><a id="l00641" name="l00641"></a><span class="lineno"> 641</span> <span class="keywordtype">void</span> DeleteNodeEntry(NodeEntry* entry,</div>
|
|
<div class="line"><a id="l00642" name="l00642"></a><span class="lineno"> 642</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<NodeEntry></a>* priority_queue,</div>
|
|
<div class="line"><a id="l00643" name="l00643"></a><span class="lineno"> 643</span> std::vector<NodeEntries>* node_entries);</div>
|
|
<div class="line"><a id="l00644" name="l00644"></a><span class="lineno"> 644</span> </div>
|
|
<div class="line"><a id="l00648" name="l00648"></a><span class="lineno"> 648</span> <span class="keywordtype">void</span> AddNodeEntry(int64_t node, int64_t insert_after, <span class="keywordtype">int</span> vehicle,</div>
|
|
<div class="line"><a id="l00649" name="l00649"></a><span class="lineno"> 649</span> <span class="keywordtype">bool</span> all_vehicles,</div>
|
|
<div class="line"><a id="l00650" name="l00650"></a><span class="lineno"> 650</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<NodeEntry></a>* priority_queue,</div>
|
|
<div class="line"><a id="l00651" name="l00651"></a><span class="lineno"> 651</span> std::vector<NodeEntries>* node_entries) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00654" name="l00654"></a><span class="lineno"> 654</span> <span class="keywordtype">void</span> UpdateNodeEntry(</div>
|
|
<div class="line"><a id="l00655" name="l00655"></a><span class="lineno"> 655</span> NodeEntry* <span class="keyword">const</span> node_entry,</div>
|
|
<div class="line"><a id="l00656" name="l00656"></a><span class="lineno"> 656</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<NodeEntry></a>* priority_queue) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00657" name="l00657"></a><span class="lineno"> 657</span> </div>
|
|
<div class="line"><a id="l00660" name="l00660"></a><span class="lineno"> 660</span> <span class="keywordtype">void</span> ComputeNeighborhoods();</div>
|
|
<div class="line"><a id="l00661" name="l00661"></a><span class="lineno"> 661</span> </div>
|
|
<div class="line"><a id="l00664" name="l00664"></a><span class="lineno"> 664</span> <span class="keywordtype">bool</span> IsNeighborForCostClass(<span class="keywordtype">int</span> cost_class, int64_t node_index,</div>
|
|
<div class="line"><a id="l00665" name="l00665"></a><span class="lineno"> 665</span> int64_t neighbor_index) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00666" name="l00666"></a><span class="lineno"> 666</span> </div>
|
|
<div class="line"><a id="l00668" name="l00668"></a><span class="lineno"> 668</span> <span class="keyword">const</span> std::vector<int64_t>& GetNeighborsOfNodeForCostClass(</div>
|
|
<div class="line"><a id="l00669" name="l00669"></a><span class="lineno"> 669</span> <span class="keywordtype">int</span> cost_class, int64_t node_index)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00670" name="l00670"></a><span class="lineno"> 670</span> <span class="keywordflow">return</span> gci_params_.<a class="code hl_variable" 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 id="l00671" name="l00671"></a><span class="lineno"> 671</span> ? all_nodes_</div>
|
|
<div class="line"><a id="l00672" name="l00672"></a><span class="lineno"> 672</span> : node_index_to_neighbors_by_cost_class_[node_index][cost_class]</div>
|
|
<div class="line"><a id="l00673" name="l00673"></a><span class="lineno"> 673</span> ->PositionsSetAtLeastOnce();</div>
|
|
<div class="line"><a id="l00674" name="l00674"></a><span class="lineno"> 674</span> }</div>
|
|
<div class="line"><a id="l00675" name="l00675"></a><span class="lineno"> 675</span> </div>
|
|
<div class="line"><a id="l00676" name="l00676"></a><span class="lineno"> 676</span> int64_t NumNonStartEndNodes()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00677" name="l00677"></a><span class="lineno"> 677</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">Size</a>() - <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>();</div>
|
|
<div class="line"><a id="l00678" name="l00678"></a><span class="lineno"> 678</span> }</div>
|
|
<div class="line"><a id="l00679" name="l00679"></a><span class="lineno"> 679</span> </div>
|
|
<div class="line"><a id="l00680" name="l00680"></a><span class="lineno"> 680</span> int64_t NumNeighbors()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00681" name="l00681"></a><span class="lineno"> 681</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(gci_params_.<a class="code hl_variable" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a264a3f98da0f7c3a55447f0e77e7ec8c">min_neighbors</a>,</div>
|
|
<div class="line"><a id="l00682" name="l00682"></a><span class="lineno"> 682</span> <a class="code hl_function" href="classoperations__research_1_1_math_util.html#a55fc8a3af7c2526c83e83586cd578d89">MathUtil::FastInt64Round</a>(gci_params_.<a class="code hl_variable" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a0aa77787d0df1b489476bfc6714ef819">neighbors_ratio</a> *</div>
|
|
<div class="line"><a id="l00683" name="l00683"></a><span class="lineno"> 683</span> NumNonStartEndNodes()));</div>
|
|
<div class="line"><a id="l00684" name="l00684"></a><span class="lineno"> 684</span> }</div>
|
|
<div class="line"><a id="l00685" name="l00685"></a><span class="lineno"> 685</span> </div>
|
|
<div class="line"><a id="l00686" name="l00686"></a><span class="lineno"> 686</span> <span class="keywordtype">void</span> ResetVehicleIndices()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00687" name="l00687"></a><span class="lineno"> 687</span> node_index_to_vehicle_.assign(node_index_to_vehicle_.size(), -1);</div>
|
|
<div class="line"><a id="l00688" name="l00688"></a><span class="lineno"> 688</span> }</div>
|
|
<div class="line"><a id="l00689" name="l00689"></a><span class="lineno"> 689</span> </div>
|
|
<div class="line"><a id="l00690" name="l00690"></a><span class="lineno"> 690</span> <span class="keywordtype">void</span> SetVehicleIndex(int64_t node, <span class="keywordtype">int</span> vehicle)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l00691" name="l00691"></a><span class="lineno"> 691</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(node, node_index_to_vehicle_.size());</div>
|
|
<div class="line"><a id="l00692" name="l00692"></a><span class="lineno"> 692</span> node_index_to_vehicle_[node] = vehicle;</div>
|
|
<div class="line"><a id="l00693" name="l00693"></a><span class="lineno"> 693</span> }</div>
|
|
<div class="line"><a id="l00694" name="l00694"></a><span class="lineno"> 694</span> </div>
|
|
<div class="line"><a id="l00697" name="l00697"></a><span class="lineno"> 697</span> <span class="keywordtype">bool</span> CheckVehicleIndices() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00698" name="l00698"></a><span class="lineno"> 698</span> </div>
|
|
<div class="line"><a id="l00700" name="l00700"></a><span class="lineno"> 700</span> int64_t GetBucketOfNode(<span class="keywordtype">int</span> node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00701" name="l00701"></a><span class="lineno"> 701</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a43c00b1c44d7f5bec9287ce60fadef52">VehicleVar</a>(node)-><a class="code hl_function" href="classoperations__research_1_1_int_var.html#af8625719d57e4a61b5aa251d99762966">Size</a>();</div>
|
|
<div class="line"><a id="l00702" name="l00702"></a><span class="lineno"> 702</span> }</div>
|
|
<div class="line"><a id="l00703" name="l00703"></a><span class="lineno"> 703</span> </div>
|
|
<div class="line"><a id="l00705" name="l00705"></a><span class="lineno"> 705</span> int64_t GetBucketOfPair(<span class="keyword">const</span> <a class="code hl_typedef" href="classoperations__research_1_1_routing_model.html#a1636c49d2587c3d9df16918345b82378">RoutingModel::IndexPair</a>& index_pair)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00706" name="l00706"></a><span class="lineno"> 706</span> int64_t max_pickup_bucket = 0;</div>
|
|
<div class="line"><a id="l00707" name="l00707"></a><span class="lineno"> 707</span> <span class="keywordflow">for</span> (int64_t pickup : index_pair.first) {</div>
|
|
<div class="line"><a id="l00708" name="l00708"></a><span class="lineno"> 708</span> max_pickup_bucket = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_pickup_bucket, GetBucketOfNode(pickup));</div>
|
|
<div class="line"><a id="l00709" name="l00709"></a><span class="lineno"> 709</span> }</div>
|
|
<div class="line"><a id="l00710" name="l00710"></a><span class="lineno"> 710</span> int64_t max_delivery_bucket = 0;</div>
|
|
<div class="line"><a id="l00711" name="l00711"></a><span class="lineno"> 711</span> <span class="keywordflow">for</span> (int64_t delivery : index_pair.second) {</div>
|
|
<div class="line"><a id="l00712" name="l00712"></a><span class="lineno"> 712</span> max_delivery_bucket =</div>
|
|
<div class="line"><a id="l00713" name="l00713"></a><span class="lineno"> 713</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_delivery_bucket, GetBucketOfNode(delivery));</div>
|
|
<div class="line"><a id="l00714" name="l00714"></a><span class="lineno"> 714</span> }</div>
|
|
<div class="line"><a id="l00715" name="l00715"></a><span class="lineno"> 715</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(max_pickup_bucket, max_delivery_bucket);</div>
|
|
<div class="line"><a id="l00716" name="l00716"></a><span class="lineno"> 716</span> }</div>
|
|
<div class="line"><a id="l00717" name="l00717"></a><span class="lineno"> 717</span> </div>
|
|
<div class="line"><a id="l00720" name="l00720"></a><span class="lineno"> 720</span> <span class="keyword">template</span> <<span class="keyword">class</span> T></div>
|
|
<div class="line"><a id="l00721" name="l00721"></a><span class="lineno"> 721</span> <span class="keywordtype">bool</span> StopSearchAndCleanup(<a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<T></a>* priority_queue) {</div>
|
|
<div class="line"><a id="l00722" name="l00722"></a><span class="lineno"> 722</span> <span class="keywordflow">if</span> (!<a class="code hl_function" 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 id="l00723" name="l00723"></a><span class="lineno"> 723</span> <span class="keywordflow">for</span> (T* <span class="keyword">const</span> entry : *priority_queue-><a class="code hl_function" href="class_adjustable_priority_queue.html#a490e921eadeae7db0606158656c85188">Raw</a>()) {</div>
|
|
<div class="line"><a id="l00724" name="l00724"></a><span class="lineno"> 724</span> <span class="keyword">delete</span> entry;</div>
|
|
<div class="line"><a id="l00725" name="l00725"></a><span class="lineno"> 725</span> }</div>
|
|
<div class="line"><a id="l00726" name="l00726"></a><span class="lineno"> 726</span> priority_queue-><a class="code hl_function" href="class_adjustable_priority_queue.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
|
|
<div class="line"><a id="l00727" name="l00727"></a><span class="lineno"> 727</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00728" name="l00728"></a><span class="lineno"> 728</span> }</div>
|
|
<div class="line"><a id="l00729" name="l00729"></a><span class="lineno"> 729</span> </div>
|
|
<div class="line"><a id="l00730" name="l00730"></a><span class="lineno"> 730</span> GlobalCheapestInsertionParameters gci_params_;</div>
|
|
<div class="line"><a id="l00732" name="l00732"></a><span class="lineno"> 732</span> std::vector<int> node_index_to_vehicle_;</div>
|
|
<div class="line"><a id="l00733" name="l00733"></a><span class="lineno"> 733</span> </div>
|
|
<div class="line"><a id="l00734" name="l00734"></a><span class="lineno"> 734</span> <span class="comment">// clang-format off</span></div>
|
|
<div class="line"><a id="l00735" name="l00735"></a><span class="lineno"> 735</span> std::vector<std::vector<std::unique_ptr<SparseBitset<int64_t> > > ></div>
|
|
<div class="line"><a id="l00736" name="l00736"></a><span class="lineno"> 736</span> node_index_to_neighbors_by_cost_class_;</div>
|
|
<div class="line"><a id="l00737" name="l00737"></a><span class="lineno"> 737</span> <span class="comment">// clang-format on</span></div>
|
|
<div class="line"><a id="l00738" name="l00738"></a><span class="lineno"> 738</span> </div>
|
|
<div class="line"><a id="l00739" name="l00739"></a><span class="lineno"> 739</span> std::unique_ptr<VehicleTypeCurator> empty_vehicle_type_curator_;</div>
|
|
<div class="line"><a id="l00740" name="l00740"></a><span class="lineno"> 740</span> </div>
|
|
<div class="line"><a id="l00744" name="l00744"></a><span class="lineno"> 744</span> std::vector<int64_t> all_nodes_;</div>
|
|
<div class="line"><a id="l00745" name="l00745"></a><span class="lineno"> 745</span>};</div>
|
|
<div class="line"><a id="l00746" name="l00746"></a><span class="lineno"> 746</span> </div>
|
|
<div class="line"><a id="l00752" name="l00752"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html"> 752</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html">LocalCheapestInsertionFilteredHeuristic</a></div>
|
|
<div class="line"><a id="l00753" name="l00753"></a><span class="lineno"> 753</span> : <span class="keyword">public</span> <a class="code hl_class" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html">CheapestInsertionFilteredHeuristic</a> {</div>
|
|
<div class="line"><a id="l00754" name="l00754"></a><span class="lineno"> 754</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00756" name="l00756"></a><span class="lineno"> 756</span> <a class="code hl_function" href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html#a219891cda8ffb7f9dbb5752360f0cbca">LocalCheapestInsertionFilteredHeuristic</a>(</div>
|
|
<div class="line"><a id="l00757" name="l00757"></a><span class="lineno"> 757</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>,</div>
|
|
<div class="line"><a id="l00758" name="l00758"></a><span class="lineno"> 758</span> std::function<int64_t(int64_t, int64_t, int64_t)> evaluator,</div>
|
|
<div class="line"><a id="l00759" name="l00759"></a><span class="lineno"> 759</span> <span class="keywordtype">bool</span> evaluate_pickup_delivery_costs_independently,</div>
|
|
<div class="line"><a id="l00760" name="l00760"></a><span class="lineno"> 760</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager);</div>
|
|
<div class="line"><a id="l00761" name="l00761"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html#ad62667103979689ca2fe11226241015c"> 761</a></span> <a class="code hl_function" href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html#ad62667103979689ca2fe11226241015c">~LocalCheapestInsertionFilteredHeuristic</a>()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a id="l00762" name="l00762"></a><span class="lineno"> 762</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">BuildSolutionInternal</a>() <span class="keyword">override</span>;</div>
|
|
<div class="line"><a id="l00763" name="l00763"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html#aed804747c45a7e1caf81461f9e45dd91"> 763</a></span> std::string <a class="code hl_function" href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html#aed804747c45a7e1caf81461f9e45dd91">DebugString</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00764" name="l00764"></a><span class="lineno"> 764</span> <span class="keywordflow">return</span> <span class="stringliteral">"LocalCheapestInsertionFilteredHeuristic"</span>;</div>
|
|
<div class="line"><a id="l00765" name="l00765"></a><span class="lineno"> 765</span> }</div>
|
|
<div class="line"><a id="l00766" name="l00766"></a><span class="lineno"> 766</span> </div>
|
|
<div class="line"><a id="l00767" name="l00767"></a><span class="lineno"> 767</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00768" name="l00768"></a><span class="lineno"> 768</span> <span class="keyword">struct </span>PickupDeliveryInsertion {</div>
|
|
<div class="line"><a id="l00769" name="l00769"></a><span class="lineno"> 769</span> int64_t insert_pickup_after;</div>
|
|
<div class="line"><a id="l00770" name="l00770"></a><span class="lineno"> 770</span> int64_t insert_delivery_after;</div>
|
|
<div class="line"><a id="l00771" name="l00771"></a><span class="lineno"> 771</span> int64_t <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>;</div>
|
|
<div class="line"><a id="l00772" name="l00772"></a><span class="lineno"> 772</span> <span class="keywordtype">int</span> vehicle;</div>
|
|
<div class="line"><a id="l00773" name="l00773"></a><span class="lineno"> 773</span> </div>
|
|
<div class="line"><a id="l00774" name="l00774"></a><span class="lineno"> 774</span> <span class="keywordtype">bool</span> operator<(<span class="keyword">const</span> PickupDeliveryInsertion& other)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00775" name="l00775"></a><span class="lineno"> 775</span> <span class="keywordflow">return</span> std::tie(<a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>, insert_pickup_after, insert_delivery_after,</div>
|
|
<div class="line"><a id="l00776" name="l00776"></a><span class="lineno"> 776</span> vehicle) <</div>
|
|
<div class="line"><a id="l00777" name="l00777"></a><span class="lineno"> 777</span> std::tie(other.value, other.insert_pickup_after,</div>
|
|
<div class="line"><a id="l00778" name="l00778"></a><span class="lineno"> 778</span> other.insert_delivery_after, other.vehicle);</div>
|
|
<div class="line"><a id="l00779" name="l00779"></a><span class="lineno"> 779</span> }</div>
|
|
<div class="line"><a id="l00780" name="l00780"></a><span class="lineno"> 780</span> };</div>
|
|
<div class="line"><a id="l00781" name="l00781"></a><span class="lineno"> 781</span> </div>
|
|
<div class="line"><a id="l00785" name="l00785"></a><span class="lineno"> 785</span> std::vector<NodeInsertion> ComputeEvaluatorSortedPositions(int64_t node);</div>
|
|
<div class="line"><a id="l00790" name="l00790"></a><span class="lineno"> 790</span> std::vector<NodeInsertion> ComputeEvaluatorSortedPositionsOnRouteAfter(</div>
|
|
<div class="line"><a id="l00791" name="l00791"></a><span class="lineno"> 791</span> int64_t node, int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>, int64_t next_after_start, <span class="keywordtype">int</span> vehicle);</div>
|
|
<div class="line"><a id="l00792" name="l00792"></a><span class="lineno"> 792</span> </div>
|
|
<div class="line"><a id="l00796" name="l00796"></a><span class="lineno"> 796</span> std::vector<PickupDeliveryInsertion> ComputeEvaluatorSortedPairPositions(</div>
|
|
<div class="line"><a id="l00797" name="l00797"></a><span class="lineno"> 797</span> int64_t pickup, int64_t delivery);</div>
|
|
<div class="line"><a id="l00798" name="l00798"></a><span class="lineno"> 798</span> </div>
|
|
<div class="line"><a id="l00799" name="l00799"></a><span class="lineno"> 799</span> std::vector<std::vector<StartEndValue>> start_end_distances_per_node_;</div>
|
|
<div class="line"><a id="l00800" name="l00800"></a><span class="lineno"> 800</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> evaluate_pickup_delivery_costs_independently_;</div>
|
|
<div class="line"><a id="l00801" name="l00801"></a><span class="lineno"> 801</span>};</div>
|
|
<div class="line"><a id="l00802" name="l00802"></a><span class="lineno"> 802</span> </div>
|
|
<div class="line"><a id="l00805" name="l00805"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html"> 805</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html">CheapestAdditionFilteredHeuristic</a> : <span class="keyword">public</span> <a class="code hl_class" href="classoperations__research_1_1_routing_filtered_heuristic.html">RoutingFilteredHeuristic</a> {</div>
|
|
<div class="line"><a id="l00806" name="l00806"></a><span class="lineno"> 806</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00807" name="l00807"></a><span class="lineno"> 807</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html#afec155b0f80a58cf5d632413078cc4f2">CheapestAdditionFilteredHeuristic</a>(<a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>,</div>
|
|
<div class="line"><a id="l00808" name="l00808"></a><span class="lineno"> 808</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager);</div>
|
|
<div class="line"><a id="l00809" name="l00809"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html#a6d981a9241acb1e6a2da35dc293ad498"> 809</a></span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html#a6d981a9241acb1e6a2da35dc293ad498">~CheapestAdditionFilteredHeuristic</a>()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a id="l00810" name="l00810"></a><span class="lineno"> 810</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">BuildSolutionInternal</a>() <span class="keyword">override</span>;</div>
|
|
<div class="line"><a id="l00811" name="l00811"></a><span class="lineno"> 811</span> </div>
|
|
<div class="line"><a id="l00812" name="l00812"></a><span class="lineno"> 812</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00813" name="l00813"></a><span class="lineno"> 813</span> <span class="keyword">class </span>PartialRoutesAndLargeVehicleIndicesFirst {</div>
|
|
<div class="line"><a id="l00814" name="l00814"></a><span class="lineno"> 814</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00815" name="l00815"></a><span class="lineno"> 815</span> <span class="keyword">explicit</span> PartialRoutesAndLargeVehicleIndicesFirst(</div>
|
|
<div class="line"><a id="l00816" name="l00816"></a><span class="lineno"> 816</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html">CheapestAdditionFilteredHeuristic</a>& builder)</div>
|
|
<div class="line"><a id="l00817" name="l00817"></a><span class="lineno"> 817</span> : builder_(builder) {}</div>
|
|
<div class="line"><a id="l00818" name="l00818"></a><span class="lineno"> 818</span> <span class="keywordtype">bool</span> operator()(<span class="keywordtype">int</span> vehicle1, <span class="keywordtype">int</span> vehicle2) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00819" name="l00819"></a><span class="lineno"> 819</span> </div>
|
|
<div class="line"><a id="l00820" name="l00820"></a><span class="lineno"> 820</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00821" name="l00821"></a><span class="lineno"> 821</span> <span class="keyword">const</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html#afec155b0f80a58cf5d632413078cc4f2">CheapestAdditionFilteredHeuristic</a>& builder_;</div>
|
|
<div class="line"><a id="l00822" name="l00822"></a><span class="lineno"> 822</span> };</div>
|
|
<div class="line"><a id="l00824" name="l00824"></a><span class="lineno"> 824</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Iterator></div>
|
|
<div class="line"><a id="l00825" name="l00825"></a><span class="lineno"> 825</span> std::vector<int64_t> GetPossibleNextsFromIterator(int64_t node,</div>
|
|
<div class="line"><a id="l00826" name="l00826"></a><span class="lineno"> 826</span> Iterator <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>,</div>
|
|
<div class="line"><a id="l00827" name="l00827"></a><span class="lineno"> 827</span> Iterator <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00828" name="l00828"></a><span class="lineno"> 828</span> <span class="keyword">const</span> <span class="keywordtype">int</span> size = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">Size</a>();</div>
|
|
<div class="line"><a id="l00829" name="l00829"></a><span class="lineno"> 829</span> std::vector<int64_t> nexts;</div>
|
|
<div class="line"><a id="l00830" name="l00830"></a><span class="lineno"> 830</span> <span class="keywordflow">for</span> (Iterator it = <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>; it != <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>; ++it) {</div>
|
|
<div class="line"><a id="l00831" name="l00831"></a><span class="lineno"> 831</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = *it;</div>
|
|
<div class="line"><a id="l00832" name="l00832"></a><span class="lineno"> 832</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> != node && (<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> >= size || !<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>))) {</div>
|
|
<div class="line"><a id="l00833" name="l00833"></a><span class="lineno"> 833</span> nexts.push_back(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a id="l00834" name="l00834"></a><span class="lineno"> 834</span> }</div>
|
|
<div class="line"><a id="l00835" name="l00835"></a><span class="lineno"> 835</span> }</div>
|
|
<div class="line"><a id="l00836" name="l00836"></a><span class="lineno"> 836</span> <span class="keywordflow">return</span> nexts;</div>
|
|
<div class="line"><a id="l00837" name="l00837"></a><span class="lineno"> 837</span> }</div>
|
|
<div class="line"><a id="l00839" name="l00839"></a><span class="lineno"> 839</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> SortSuccessors(int64_t node,</div>
|
|
<div class="line"><a id="l00840" name="l00840"></a><span class="lineno"> 840</span> std::vector<int64_t>* successors) = 0;</div>
|
|
<div class="line"><a id="l00841" name="l00841"></a><span class="lineno"> 841</span> <span class="keyword">virtual</span> int64_t FindTopSuccessor(int64_t node,</div>
|
|
<div class="line"><a id="l00842" name="l00842"></a><span class="lineno"> 842</span> <span class="keyword">const</span> std::vector<int64_t>& successors) = 0;</div>
|
|
<div class="line"><a id="l00843" name="l00843"></a><span class="lineno"> 843</span>};</div>
|
|
<div class="line"><a id="l00844" name="l00844"></a><span class="lineno"> 844</span> </div>
|
|
<div class="line"><a id="l00847" name="l00847"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic.html"> 847</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic.html">EvaluatorCheapestAdditionFilteredHeuristic</a></div>
|
|
<div class="line"><a id="l00848" name="l00848"></a><span class="lineno"> 848</span> : <span class="keyword">public</span> <a class="code hl_class" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html">CheapestAdditionFilteredHeuristic</a> {</div>
|
|
<div class="line"><a id="l00849" name="l00849"></a><span class="lineno"> 849</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00851" name="l00851"></a><span class="lineno"> 851</span> <a class="code hl_function" href="classoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic.html#a3708f86f49ec8005ba0cd16a4bf9ab8f">EvaluatorCheapestAdditionFilteredHeuristic</a>(</div>
|
|
<div class="line"><a id="l00852" name="l00852"></a><span class="lineno"> 852</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>, std::function<int64_t(int64_t, int64_t)> evaluator,</div>
|
|
<div class="line"><a id="l00853" name="l00853"></a><span class="lineno"> 853</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager);</div>
|
|
<div class="line"><a id="l00854" name="l00854"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic.html#a5e9ebf34788290561f002dfa3b9d60ff"> 854</a></span> <a class="code hl_function" href="classoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic.html#a5e9ebf34788290561f002dfa3b9d60ff">~EvaluatorCheapestAdditionFilteredHeuristic</a>()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a id="l00855" name="l00855"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic.html#aed804747c45a7e1caf81461f9e45dd91"> 855</a></span> std::string <a class="code hl_function" href="classoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic.html#aed804747c45a7e1caf81461f9e45dd91">DebugString</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00856" name="l00856"></a><span class="lineno"> 856</span> <span class="keywordflow">return</span> <span class="stringliteral">"EvaluatorCheapestAdditionFilteredHeuristic"</span>;</div>
|
|
<div class="line"><a id="l00857" name="l00857"></a><span class="lineno"> 857</span> }</div>
|
|
<div class="line"><a id="l00858" name="l00858"></a><span class="lineno"> 858</span> </div>
|
|
<div class="line"><a id="l00859" name="l00859"></a><span class="lineno"> 859</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00861" name="l00861"></a><span class="lineno"> 861</span> <span class="keywordtype">void</span> SortSuccessors(int64_t node, std::vector<int64_t>* successors) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a id="l00862" name="l00862"></a><span class="lineno"> 862</span> int64_t FindTopSuccessor(int64_t node,</div>
|
|
<div class="line"><a id="l00863" name="l00863"></a><span class="lineno"> 863</span> <span class="keyword">const</span> std::vector<int64_t>& successors) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a id="l00864" name="l00864"></a><span class="lineno"> 864</span> </div>
|
|
<div class="line"><a id="l00865" name="l00865"></a><span class="lineno"> 865</span> std::function<int64_t(int64_t, int64_t)> evaluator_;</div>
|
|
<div class="line"><a id="l00866" name="l00866"></a><span class="lineno"> 866</span>};</div>
|
|
<div class="line"><a id="l00867" name="l00867"></a><span class="lineno"> 867</span> </div>
|
|
<div class="line"><a id="l00870" name="l00870"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic.html"> 870</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic.html">ComparatorCheapestAdditionFilteredHeuristic</a></div>
|
|
<div class="line"><a id="l00871" name="l00871"></a><span class="lineno"> 871</span> : <span class="keyword">public</span> <a class="code hl_class" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html">CheapestAdditionFilteredHeuristic</a> {</div>
|
|
<div class="line"><a id="l00872" name="l00872"></a><span class="lineno"> 872</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00874" name="l00874"></a><span class="lineno"> 874</span> <a class="code hl_function" href="classoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic.html#a760174569c84ca68a545381dad33b38c">ComparatorCheapestAdditionFilteredHeuristic</a>(</div>
|
|
<div class="line"><a id="l00875" name="l00875"></a><span class="lineno"> 875</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>, <a class="code hl_typedef" href="classoperations__research_1_1_solver.html#af5502e2288132c081fc96fdbcee282e6">Solver::VariableValueComparator</a> comparator,</div>
|
|
<div class="line"><a id="l00876" name="l00876"></a><span class="lineno"> 876</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager);</div>
|
|
<div class="line"><a id="l00877" name="l00877"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic.html#aca6c8c82d740691caa27615ee1a2fe9e"> 877</a></span> <a class="code hl_function" href="classoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic.html#aca6c8c82d740691caa27615ee1a2fe9e">~ComparatorCheapestAdditionFilteredHeuristic</a>()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a id="l00878" name="l00878"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic.html#aed804747c45a7e1caf81461f9e45dd91"> 878</a></span> std::string <a class="code hl_function" href="classoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic.html#aed804747c45a7e1caf81461f9e45dd91">DebugString</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l00879" name="l00879"></a><span class="lineno"> 879</span> <span class="keywordflow">return</span> <span class="stringliteral">"ComparatorCheapestAdditionFilteredHeuristic"</span>;</div>
|
|
<div class="line"><a id="l00880" name="l00880"></a><span class="lineno"> 880</span> }</div>
|
|
<div class="line"><a id="l00881" name="l00881"></a><span class="lineno"> 881</span> </div>
|
|
<div class="line"><a id="l00882" name="l00882"></a><span class="lineno"> 882</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00884" name="l00884"></a><span class="lineno"> 884</span> <span class="keywordtype">void</span> SortSuccessors(int64_t node, std::vector<int64_t>* successors) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a id="l00885" name="l00885"></a><span class="lineno"> 885</span> int64_t FindTopSuccessor(int64_t node,</div>
|
|
<div class="line"><a id="l00886" name="l00886"></a><span class="lineno"> 886</span> <span class="keyword">const</span> std::vector<int64_t>& successors) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a id="l00887" name="l00887"></a><span class="lineno"> 887</span> </div>
|
|
<div class="line"><a id="l00888" name="l00888"></a><span class="lineno"> 888</span> <a class="code hl_typedef" href="classoperations__research_1_1_solver.html#af5502e2288132c081fc96fdbcee282e6">Solver::VariableValueComparator</a> comparator_;</div>
|
|
<div class="line"><a id="l00889" name="l00889"></a><span class="lineno"> 889</span>};</div>
|
|
<div class="line"><a id="l00890" name="l00890"></a><span class="lineno"> 890</span> </div>
|
|
<div class="line"><a id="l00899" name="l00899"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic.html"> 899</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_savings_filtered_heuristic.html">SavingsFilteredHeuristic</a> : <span class="keyword">public</span> <a class="code hl_class" href="classoperations__research_1_1_routing_filtered_heuristic.html">RoutingFilteredHeuristic</a> {</div>
|
|
<div class="line"><a id="l00900" name="l00900"></a><span class="lineno"> 900</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00901" name="l00901"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html"> 901</a></span> <span class="keyword">struct </span><a class="code hl_struct" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html">SavingsParameters</a> {</div>
|
|
<div class="line"><a id="l00904" name="l00904"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a0aa77787d0df1b489476bfc6714ef819"> 904</a></span> <span class="keywordtype">double</span> <a class="code hl_variable" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a0aa77787d0df1b489476bfc6714ef819">neighbors_ratio</a> = 1.0;</div>
|
|
<div class="line"><a id="l00907" name="l00907"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a33bd2c84a2be54d10959e5c0d81f86b5"> 907</a></span> <span class="keywordtype">double</span> <a class="code hl_variable" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a33bd2c84a2be54d10959e5c0d81f86b5">max_memory_usage_bytes</a> = 6e9;</div>
|
|
<div class="line"><a id="l00910" name="l00910"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a8857f65b46da9e2012c7bd939a978442"> 910</a></span> <span class="keywordtype">bool</span> <a class="code hl_variable" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a8857f65b46da9e2012c7bd939a978442">add_reverse_arcs</a> = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00913" name="l00913"></a><span class="lineno"><a class="line" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a222a2814083966736ad9aefde1dde290"> 913</a></span> <span class="keywordtype">double</span> <a class="code hl_variable" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a222a2814083966736ad9aefde1dde290">arc_coefficient</a> = 1.0;</div>
|
|
<div class="line"><a id="l00914" name="l00914"></a><span class="lineno"> 914</span> };</div>
|
|
<div class="line"><a id="l00915" name="l00915"></a><span class="lineno"> 915</span> </div>
|
|
<div class="line"><a id="l00916" name="l00916"></a><span class="lineno"> 916</span> <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#a04f0558b5828ce46108dca7e5a3a8504">SavingsFilteredHeuristic</a>(<a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>, <a class="code hl_struct" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html">SavingsParameters</a> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>,</div>
|
|
<div class="line"><a id="l00917" name="l00917"></a><span class="lineno"> 917</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager);</div>
|
|
<div class="line"><a id="l00918" name="l00918"></a><span class="lineno"> 918</span> <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#a69f73ddf69522d81d6dd919c316cae8a">~SavingsFilteredHeuristic</a>() <span class="keyword">override</span>;</div>
|
|
<div class="line"><a id="l00919" name="l00919"></a><span class="lineno"> 919</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">BuildSolutionInternal</a>() <span class="keyword">override</span>;</div>
|
|
<div class="line"><a id="l00920" name="l00920"></a><span class="lineno"> 920</span> </div>
|
|
<div class="line"><a id="l00921" name="l00921"></a><span class="lineno"> 921</span> <span class="keyword">protected</span>:</div>
|
|
<div class="line"><a id="l00922" name="l00922"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic.html#a508859e48f977fce11a64cd80d9d1c96"> 922</a></span> <span class="keyword">typedef</span> std::pair<<span class="comment">/*saving*/</span> int64_t, <span class="comment">/*saving index*/</span> int64_t> <a class="code hl_typedef" href="classoperations__research_1_1_savings_filtered_heuristic.html#a508859e48f977fce11a64cd80d9d1c96">Saving</a>;</div>
|
|
<div class="line"><a id="l00923" name="l00923"></a><span class="lineno"> 923</span> </div>
|
|
<div class="line"><a id="l00924" name="l00924"></a><span class="lineno"> 924</span> <span class="keyword">template</span> <<span class="keyword">typename</span> S></div>
|
|
<div class="line"><a id="l00925" name="l00925"></a><span class="lineno"> 925</span> <span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html">SavingsContainer</a>;</div>
|
|
<div class="line"><a id="l00926" name="l00926"></a><span class="lineno"> 926</span> </div>
|
|
<div class="line"><a id="l00927" name="l00927"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic.html#a84b19d1c2e9a93a7e02dc12972c9c969"> 927</a></span> <span class="keyword">virtual</span> <span class="keywordtype">double</span> <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#a84b19d1c2e9a93a7e02dc12972c9c969">ExtraSavingsMemoryMultiplicativeFactor</a>() <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a id="l00928" name="l00928"></a><span class="lineno"> 928</span> </div>
|
|
<div class="line"><a id="l00929" name="l00929"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic.html#aeb4e0e0b0899af694678658062b4f037"> 929</a></span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#aeb4e0e0b0899af694678658062b4f037">BuildRoutesFromSavings</a>() = 0;</div>
|
|
<div class="line"><a id="l00930" name="l00930"></a><span class="lineno"> 930</span> </div>
|
|
<div class="line"><a id="l00932" name="l00932"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic.html#a059d074075b06daa69a371f96d5ad60c"> 932</a></span> int64_t <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#a059d074075b06daa69a371f96d5ad60c">GetVehicleTypeFromSaving</a>(<span class="keyword">const</span> <a class="code hl_typedef" href="classoperations__research_1_1_savings_filtered_heuristic.html#a508859e48f977fce11a64cd80d9d1c96">Saving</a>& saving)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00933" name="l00933"></a><span class="lineno"> 933</span> <span class="keywordflow">return</span> saving.second / size_squared_;</div>
|
|
<div class="line"><a id="l00934" name="l00934"></a><span class="lineno"> 934</span> }</div>
|
|
<div class="line"><a id="l00936" name="l00936"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic.html#ac059c9526b1114c16b250a4cc809a97b"> 936</a></span> int64_t <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#ac059c9526b1114c16b250a4cc809a97b">GetBeforeNodeFromSaving</a>(<span class="keyword">const</span> <a class="code hl_typedef" href="classoperations__research_1_1_savings_filtered_heuristic.html#a508859e48f977fce11a64cd80d9d1c96">Saving</a>& saving)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00937" name="l00937"></a><span class="lineno"> 937</span> <span class="keywordflow">return</span> (saving.second % size_squared_) / <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>();</div>
|
|
<div class="line"><a id="l00938" name="l00938"></a><span class="lineno"> 938</span> }</div>
|
|
<div class="line"><a id="l00940" name="l00940"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic.html#a3f462bd92b7848baac82e1c526d0ed5a"> 940</a></span> int64_t <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#a3f462bd92b7848baac82e1c526d0ed5a">GetAfterNodeFromSaving</a>(<span class="keyword">const</span> <a class="code hl_typedef" href="classoperations__research_1_1_savings_filtered_heuristic.html#a508859e48f977fce11a64cd80d9d1c96">Saving</a>& saving)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00941" name="l00941"></a><span class="lineno"> 941</span> <span class="keywordflow">return</span> (saving.second % size_squared_) % <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>();</div>
|
|
<div class="line"><a id="l00942" name="l00942"></a><span class="lineno"> 942</span> }</div>
|
|
<div class="line"><a id="l00944" name="l00944"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic.html#a507360c2a0a17cf293d6342c073750ae"> 944</a></span> int64_t <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#a507360c2a0a17cf293d6342c073750ae">GetSavingValue</a>(<span class="keyword">const</span> <a class="code hl_typedef" href="classoperations__research_1_1_savings_filtered_heuristic.html#a508859e48f977fce11a64cd80d9d1c96">Saving</a>& saving)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> saving.first; }</div>
|
|
<div class="line"><a id="l00945" name="l00945"></a><span class="lineno"> 945</span> </div>
|
|
<div class="line"><a id="l00955" name="l00955"></a><span class="lineno"> 955</span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#ad1f89eda8b1c2ad8fe6f5743e475fd5d">StartNewRouteWithBestVehicleOfType</a>(<span class="keywordtype">int</span> type, int64_t before_node,</div>
|
|
<div class="line"><a id="l00956" name="l00956"></a><span class="lineno"> 956</span> int64_t after_node);</div>
|
|
<div class="line"><a id="l00957" name="l00957"></a><span class="lineno"> 957</span> </div>
|
|
<div class="line"><a id="l00958" name="l00958"></a><span class="lineno"> 958</span> <span class="comment">// clang-format off</span></div>
|
|
<div class="line"><a id="l00959" name="l00959"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4"> 959</a></span> std::unique_ptr<SavingsContainer<Saving> > <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>;</div>
|
|
<div class="line"><a id="l00960" name="l00960"></a><span class="lineno"> 960</span> <span class="comment">// clang-format on</span></div>
|
|
<div class="line"><a id="l00961" name="l00961"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556"> 961</a></span> std::unique_ptr<VehicleTypeCurator> <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a>;</div>
|
|
<div class="line"><a id="l00962" name="l00962"></a><span class="lineno"> 962</span> </div>
|
|
<div class="line"><a id="l00963" name="l00963"></a><span class="lineno"> 963</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00968" name="l00968"></a><span class="lineno"> 968</span> <span class="comment">// clang-format off</span></div>
|
|
<div class="line"><a id="l00969" name="l00969"></a><span class="lineno"> 969</span> <span class="keywordtype">void</span> AddSymmetricArcsToAdjacencyLists(</div>
|
|
<div class="line"><a id="l00970" name="l00970"></a><span class="lineno"> 970</span> std::vector<std::vector<int64_t> >* adjacency_lists);</div>
|
|
<div class="line"><a id="l00971" name="l00971"></a><span class="lineno"> 971</span> <span class="comment">// clang-format on</span></div>
|
|
<div class="line"><a id="l00972" name="l00972"></a><span class="lineno"> 972</span> </div>
|
|
<div class="line"><a id="l00981" name="l00981"></a><span class="lineno"> 981</span> <span class="keywordtype">bool</span> ComputeSavings();</div>
|
|
<div class="line"><a id="l00983" name="l00983"></a><span class="lineno"> 983</span> <a class="code hl_typedef" href="classoperations__research_1_1_savings_filtered_heuristic.html#a508859e48f977fce11a64cd80d9d1c96">Saving</a> BuildSaving(int64_t saving, <span class="keywordtype">int</span> vehicle_type, <span class="keywordtype">int</span> before_node,</div>
|
|
<div class="line"><a id="l00984" name="l00984"></a><span class="lineno"> 984</span> <span class="keywordtype">int</span> after_node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00985" name="l00985"></a><span class="lineno"> 985</span> <span class="keywordflow">return</span> std::make_pair(saving, vehicle_type * size_squared_ +</div>
|
|
<div class="line"><a id="l00986" name="l00986"></a><span class="lineno"> 986</span> before_node * <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>() + after_node);</div>
|
|
<div class="line"><a id="l00987" name="l00987"></a><span class="lineno"> 987</span> }</div>
|
|
<div class="line"><a id="l00988" name="l00988"></a><span class="lineno"> 988</span> </div>
|
|
<div class="line"><a id="l00992" name="l00992"></a><span class="lineno"> 992</span> int64_t MaxNumNeighborsPerNode(<span class="keywordtype">int</span> num_vehicle_types) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00993" name="l00993"></a><span class="lineno"> 993</span> </div>
|
|
<div class="line"><a id="l00994" name="l00994"></a><span class="lineno"> 994</span> <span class="keyword">const</span> SavingsParameters savings_params_;</div>
|
|
<div class="line"><a id="l00995" name="l00995"></a><span class="lineno"> 995</span> int64_t size_squared_;</div>
|
|
<div class="line"><a id="l00996" name="l00996"></a><span class="lineno"> 996</span> </div>
|
|
<div class="line"><a id="l00997" name="l00997"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic.html#a8a3744c9b200610bdb36dfbd8b62417b"> 997</a></span> <span class="keyword">friend</span> <span class="keyword">class </span><a class="code hl_friend" href="classoperations__research_1_1_savings_filtered_heuristic.html#a8a3744c9b200610bdb36dfbd8b62417b">SavingsFilteredHeuristicTestPeer</a>;</div>
|
|
<div class="line"><a id="l00998" name="l00998"></a><span class="lineno"> 998</span>};</div>
|
|
<div class="line"><a id="l00999" name="l00999"></a><span class="lineno"> 999</span> </div>
|
|
<div class="line"><a id="l01000" name="l01000"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sequential_savings_filtered_heuristic.html"> 1000</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_sequential_savings_filtered_heuristic.html">SequentialSavingsFilteredHeuristic</a> : <span class="keyword">public</span> <a class="code hl_class" href="classoperations__research_1_1_savings_filtered_heuristic.html">SavingsFilteredHeuristic</a> {</div>
|
|
<div class="line"><a id="l01001" name="l01001"></a><span class="lineno"> 1001</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l01002" name="l01002"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sequential_savings_filtered_heuristic.html#a4514c0a69bbb45ad7215b498e9a890c2"> 1002</a></span> <a class="code hl_function" href="classoperations__research_1_1_sequential_savings_filtered_heuristic.html#a4514c0a69bbb45ad7215b498e9a890c2">SequentialSavingsFilteredHeuristic</a>(<a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>,</div>
|
|
<div class="line"><a id="l01003" name="l01003"></a><span class="lineno"> 1003</span> <a class="code hl_struct" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html">SavingsParameters</a> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>,</div>
|
|
<div class="line"><a id="l01004" name="l01004"></a><span class="lineno"> 1004</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager)</div>
|
|
<div class="line"><a id="l01005" name="l01005"></a><span class="lineno"> 1005</span> : <a class="code hl_class" href="classoperations__research_1_1_savings_filtered_heuristic.html">SavingsFilteredHeuristic</a>(<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>, <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>, filter_manager) {}</div>
|
|
<div class="line"><a id="l01006" name="l01006"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sequential_savings_filtered_heuristic.html#a30c753e93fd4c2d8ab4f4f882fd3dcab"> 1006</a></span> <a class="code hl_function" href="classoperations__research_1_1_sequential_savings_filtered_heuristic.html#a30c753e93fd4c2d8ab4f4f882fd3dcab">~SequentialSavingsFilteredHeuristic</a>()<span class="keyword"> override</span>{};</div>
|
|
<div class="line"><a id="l01007" name="l01007"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sequential_savings_filtered_heuristic.html#aed804747c45a7e1caf81461f9e45dd91"> 1007</a></span> std::string <a class="code hl_function" href="classoperations__research_1_1_sequential_savings_filtered_heuristic.html#aed804747c45a7e1caf81461f9e45dd91">DebugString</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l01008" name="l01008"></a><span class="lineno"> 1008</span> <span class="keywordflow">return</span> <span class="stringliteral">"SequentialSavingsFilteredHeuristic"</span>;</div>
|
|
<div class="line"><a id="l01009" name="l01009"></a><span class="lineno"> 1009</span> }</div>
|
|
<div class="line"><a id="l01010" name="l01010"></a><span class="lineno"> 1010</span> </div>
|
|
<div class="line"><a id="l01011" name="l01011"></a><span class="lineno"> 1011</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l01016" name="l01016"></a><span class="lineno"> 1016</span> <span class="keywordtype">void</span> BuildRoutesFromSavings() <span class="keyword">override</span>;</div>
|
|
<div class="line"><a id="l01017" name="l01017"></a><span class="lineno"> 1017</span> <span class="keywordtype">double</span> ExtraSavingsMemoryMultiplicativeFactor()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> 1.0; }</div>
|
|
<div class="line"><a id="l01018" name="l01018"></a><span class="lineno"> 1018</span>};</div>
|
|
<div class="line"><a id="l01019" name="l01019"></a><span class="lineno"> 1019</span> </div>
|
|
<div class="line"><a id="l01020" name="l01020"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_parallel_savings_filtered_heuristic.html"> 1020</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_parallel_savings_filtered_heuristic.html">ParallelSavingsFilteredHeuristic</a> : <span class="keyword">public</span> <a class="code hl_class" href="classoperations__research_1_1_savings_filtered_heuristic.html">SavingsFilteredHeuristic</a> {</div>
|
|
<div class="line"><a id="l01021" name="l01021"></a><span class="lineno"> 1021</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l01022" name="l01022"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_parallel_savings_filtered_heuristic.html#a197d1240a83ccf92568885e67d87486d"> 1022</a></span> <a class="code hl_function" href="classoperations__research_1_1_parallel_savings_filtered_heuristic.html#a197d1240a83ccf92568885e67d87486d">ParallelSavingsFilteredHeuristic</a>(<a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>,</div>
|
|
<div class="line"><a id="l01023" name="l01023"></a><span class="lineno"> 1023</span> <a class="code hl_struct" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html">SavingsParameters</a> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>,</div>
|
|
<div class="line"><a id="l01024" name="l01024"></a><span class="lineno"> 1024</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager)</div>
|
|
<div class="line"><a id="l01025" name="l01025"></a><span class="lineno"> 1025</span> : <a class="code hl_class" href="classoperations__research_1_1_savings_filtered_heuristic.html">SavingsFilteredHeuristic</a>(<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>, <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>, filter_manager) {}</div>
|
|
<div class="line"><a id="l01026" name="l01026"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_parallel_savings_filtered_heuristic.html#a9fe69e789776765e59166957a5956a32"> 1026</a></span> <a class="code hl_function" href="classoperations__research_1_1_parallel_savings_filtered_heuristic.html#a9fe69e789776765e59166957a5956a32">~ParallelSavingsFilteredHeuristic</a>()<span class="keyword"> override</span>{};</div>
|
|
<div class="line"><a id="l01027" name="l01027"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_parallel_savings_filtered_heuristic.html#aed804747c45a7e1caf81461f9e45dd91"> 1027</a></span> std::string <a class="code hl_function" href="classoperations__research_1_1_parallel_savings_filtered_heuristic.html#aed804747c45a7e1caf81461f9e45dd91">DebugString</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l01028" name="l01028"></a><span class="lineno"> 1028</span> <span class="keywordflow">return</span> <span class="stringliteral">"ParallelSavingsFilteredHeuristic"</span>;</div>
|
|
<div class="line"><a id="l01029" name="l01029"></a><span class="lineno"> 1029</span> }</div>
|
|
<div class="line"><a id="l01030" name="l01030"></a><span class="lineno"> 1030</span> </div>
|
|
<div class="line"><a id="l01031" name="l01031"></a><span class="lineno"> 1031</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l01042" name="l01042"></a><span class="lineno"> 1042</span> <span class="keywordtype">void</span> BuildRoutesFromSavings() <span class="keyword">override</span>;</div>
|
|
<div class="line"><a id="l01043" name="l01043"></a><span class="lineno"> 1043</span> </div>
|
|
<div class="line"><a id="l01044" name="l01044"></a><span class="lineno"> 1044</span> <span class="keywordtype">double</span> ExtraSavingsMemoryMultiplicativeFactor()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> 2.0; }</div>
|
|
<div class="line"><a id="l01045" name="l01045"></a><span class="lineno"> 1045</span> </div>
|
|
<div class="line"><a id="l01050" name="l01050"></a><span class="lineno"> 1050</span> <span class="keywordtype">void</span> MergeRoutes(<span class="keywordtype">int</span> first_vehicle, <span class="keywordtype">int</span> second_vehicle, int64_t before_node,</div>
|
|
<div class="line"><a id="l01051" name="l01051"></a><span class="lineno"> 1051</span> int64_t after_node);</div>
|
|
<div class="line"><a id="l01052" name="l01052"></a><span class="lineno"> 1052</span> </div>
|
|
<div class="line"><a id="l01054" name="l01054"></a><span class="lineno"> 1054</span> std::vector<int64_t> first_node_on_route_;</div>
|
|
<div class="line"><a id="l01055" name="l01055"></a><span class="lineno"> 1055</span> std::vector<int64_t> last_node_on_route_;</div>
|
|
<div class="line"><a id="l01059" name="l01059"></a><span class="lineno"> 1059</span> std::vector<int> vehicle_of_first_or_last_node_;</div>
|
|
<div class="line"><a id="l01060" name="l01060"></a><span class="lineno"> 1060</span>};</div>
|
|
<div class="line"><a id="l01061" name="l01061"></a><span class="lineno"> 1061</span> </div>
|
|
<div class="line"><a id="l01065" name="l01065"></a><span class="lineno"> 1065</span> </div>
|
|
<div class="line"><a id="l01066" name="l01066"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_christofides_filtered_heuristic.html"> 1066</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_christofides_filtered_heuristic.html">ChristofidesFilteredHeuristic</a> : <span class="keyword">public</span> <a class="code hl_class" href="classoperations__research_1_1_routing_filtered_heuristic.html">RoutingFilteredHeuristic</a> {</div>
|
|
<div class="line"><a id="l01067" name="l01067"></a><span class="lineno"> 1067</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l01068" name="l01068"></a><span class="lineno"> 1068</span> <a class="code hl_function" href="classoperations__research_1_1_christofides_filtered_heuristic.html#af91a0a971d9bbdf32471d229a030a5fc">ChristofidesFilteredHeuristic</a>(<a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>,</div>
|
|
<div class="line"><a id="l01069" name="l01069"></a><span class="lineno"> 1069</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager,</div>
|
|
<div class="line"><a id="l01070" name="l01070"></a><span class="lineno"> 1070</span> <span class="keywordtype">bool</span> use_minimum_matching);</div>
|
|
<div class="line"><a id="l01071" name="l01071"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_christofides_filtered_heuristic.html#ab0717c778b4489b27d8687df6b1ba083"> 1071</a></span> <a class="code hl_function" href="classoperations__research_1_1_christofides_filtered_heuristic.html#ab0717c778b4489b27d8687df6b1ba083">~ChristofidesFilteredHeuristic</a>()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a id="l01072" name="l01072"></a><span class="lineno"> 1072</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_christofides_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">BuildSolutionInternal</a>() <span class="keyword">override</span>;</div>
|
|
<div class="line"><a id="l01073" name="l01073"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_christofides_filtered_heuristic.html#aed804747c45a7e1caf81461f9e45dd91"> 1073</a></span> std::string <a class="code hl_function" href="classoperations__research_1_1_christofides_filtered_heuristic.html#aed804747c45a7e1caf81461f9e45dd91">DebugString</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a id="l01074" name="l01074"></a><span class="lineno"> 1074</span> <span class="keywordflow">return</span> <span class="stringliteral">"ChristofidesFilteredHeuristic"</span>;</div>
|
|
<div class="line"><a id="l01075" name="l01075"></a><span class="lineno"> 1075</span> }</div>
|
|
<div class="line"><a id="l01076" name="l01076"></a><span class="lineno"> 1076</span> </div>
|
|
<div class="line"><a id="l01077" name="l01077"></a><span class="lineno"> 1077</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l01078" name="l01078"></a><span class="lineno"> 1078</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> use_minimum_matching_;</div>
|
|
<div class="line"><a id="l01079" name="l01079"></a><span class="lineno"> 1079</span>};</div>
|
|
<div class="line"><a id="l01080" name="l01080"></a><span class="lineno"> 1080</span> </div>
|
|
<div class="line"><a id="l01083" name="l01083"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sweep_arranger.html"> 1083</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_sweep_arranger.html">SweepArranger</a> {</div>
|
|
<div class="line"><a id="l01084" name="l01084"></a><span class="lineno"> 1084</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l01085" name="l01085"></a><span class="lineno"> 1085</span> <span class="keyword">explicit</span> <a class="code hl_function" href="classoperations__research_1_1_sweep_arranger.html#a2197ac12bb9d1906c420aa46b09448ce">SweepArranger</a>(</div>
|
|
<div class="line"><a id="l01086" name="l01086"></a><span class="lineno"> 1086</span> <span class="keyword">const</span> std::vector<std::pair<int64_t, int64_t>>& points);</div>
|
|
<div class="line"><a id="l01087" name="l01087"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sweep_arranger.html#af531dae235dc7c9501a428a8ddeff432"> 1087</a></span> <span class="keyword">virtual</span> <a class="code hl_function" href="classoperations__research_1_1_sweep_arranger.html#af531dae235dc7c9501a428a8ddeff432">~SweepArranger</a>() {}</div>
|
|
<div class="line"><a id="l01088" name="l01088"></a><span class="lineno"> 1088</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_sweep_arranger.html#a5fceff18e9961fb07c1c02231aef9985">ArrangeIndices</a>(std::vector<int64_t>* indices);</div>
|
|
<div class="line"><a id="l01089" name="l01089"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sweep_arranger.html#abdec0f71a4b3263e9ed49e1d2b4726f2"> 1089</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_sweep_arranger.html#abdec0f71a4b3263e9ed49e1d2b4726f2">SetSectors</a>(<span class="keywordtype">int</span> sectors) { sectors_ = sectors; }</div>
|
|
<div class="line"><a id="l01090" name="l01090"></a><span class="lineno"> 1090</span> </div>
|
|
<div class="line"><a id="l01091" name="l01091"></a><span class="lineno"> 1091</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l01092" name="l01092"></a><span class="lineno"> 1092</span> std::vector<int> coordinates_;</div>
|
|
<div class="line"><a id="l01093" name="l01093"></a><span class="lineno"> 1093</span> <span class="keywordtype">int</span> sectors_;</div>
|
|
<div class="line"><a id="l01094" name="l01094"></a><span class="lineno"> 1094</span> </div>
|
|
<div class="line"><a id="l01095" name="l01095"></a><span class="lineno"> 1095</span> DISALLOW_COPY_AND_ASSIGN(<a class="code hl_class" href="classoperations__research_1_1_sweep_arranger.html">SweepArranger</a>);</div>
|
|
<div class="line"><a id="l01096" name="l01096"></a><span class="lineno"> 1096</span>};</div>
|
|
<div class="line"><a id="l01097" name="l01097"></a><span class="lineno"> 1097</span><span class="preprocessor">#endif </span><span class="comment">// SWIG</span></div>
|
|
<div class="line"><a id="l01098" name="l01098"></a><span class="lineno"> 1098</span> </div>
|
|
<div class="line"><a id="l01099" name="l01099"></a><span class="lineno"> 1099</span><span class="comment">// Returns a DecisionBuilder building a first solution based on the Sweep</span></div>
|
|
<div class="line"><a id="l01100" name="l01100"></a><span class="lineno"> 1100</span><span class="comment">// heuristic. Mostly suitable when cost is proportional to distance.</span></div>
|
|
<div class="line"><a id="l01101" name="l01101"></a><span class="lineno"> 1101</span>DecisionBuilder* <a class="code hl_function" href="namespaceoperations__research.html#ab5b064a7895b1fc8084546441a57b46a">MakeSweepDecisionBuilder</a>(RoutingModel* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div>
|
|
<div class="line"><a id="l01102" name="l01102"></a><span class="lineno"> 1102</span> <span class="keywordtype">bool</span> check_assignment);</div>
|
|
<div class="line"><a id="l01103" name="l01103"></a><span class="lineno"> 1103</span> </div>
|
|
<div class="line"><a id="l01104" name="l01104"></a><span class="lineno"> 1104</span><span class="comment">// Returns a DecisionBuilder making all nodes unperformed.</span></div>
|
|
<div class="line"><a id="l01105" name="l01105"></a><span class="lineno"> 1105</span>DecisionBuilder* <a class="code hl_function" href="namespaceoperations__research.html#a26a2d5d3c5887e436bf4da4c20a99a26">MakeAllUnperformed</a>(RoutingModel* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a id="l01106" name="l01106"></a><span class="lineno"> 1106</span> </div>
|
|
<div class="line"><a id="l01107" name="l01107"></a><span class="lineno"> 1107</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a id="l01108" name="l01108"></a><span class="lineno"> 1108</span> </div>
|
|
<div class="line"><a id="l01109" name="l01109"></a><span class="lineno"> 1109</span><span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_CONSTRAINT_SOLVER_ROUTING_SEARCH_H_</span></div>
|
|
<div class="ttc" id="aadjustable__priority__queue_8h_html"><div class="ttname"><a href="adjustable__priority__queue_8h.html">adjustable_priority_queue.h</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_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#l00894">base/logging.h:894</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#l00890">base/logging.h:890</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="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_a490e921eadeae7db0606158656c85188"><div class="ttname"><a href="class_adjustable_priority_queue.html#a490e921eadeae7db0606158656c85188">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_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="aclassoperations__research_1_1_assignment_container_html_a574bbe757dd231a59843422be3145dee"><div class="ttname"><a href="classoperations__research_1_1_assignment_container.html#a574bbe757dd231a59843422be3145dee">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#l04984">constraint_solver.h:4984</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#l05081">constraint_solver.h:5081</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_html_a88515905299f569432aaba577a912add"><div class="ttname"><a href="classoperations__research_1_1_assignment.html#a88515905299f569432aaba577a912add">operations_research::Assignment::SetValue</a></div><div class="ttdeci">void SetValue(const IntVar *const var, int64_t value)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2assignment_8cc_source.html#l00682">constraint_solver/assignment.cc:682</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_html_aedb0ae1cf8c3e89218604e5c039d6c7b"><div class="ttname"><a href="classoperations__research_1_1_assignment.html#aedb0ae1cf8c3e89218604e5c039d6c7b">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#l05232">constraint_solver.h:5232</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_html_af5fcf5e7a47ae0e325fb1df409ac8e24"><div class="ttname"><a href="classoperations__research_1_1_assignment.html#af5fcf5e7a47ae0e325fb1df409ac8e24">operations_research::Assignment::FastAdd</a></div><div class="ttdeci">IntVarElement * FastAdd(IntVar *const var)</div><div class="ttdoc">Adds without checking if variable has been previously added.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2assignment_8cc_source.html#l00650">constraint_solver/assignment.cc:650</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__search_8h_source.html#l00805">routing_search.h:805</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#l02428">routing_search.cc:2428</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_addition_filtered_heuristic_html_a6d981a9241acb1e6a2da35dc293ad498"><div class="ttname"><a href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html#a6d981a9241acb1e6a2da35dc293ad498">operations_research::CheapestAdditionFilteredHeuristic::~CheapestAdditionFilteredHeuristic</a></div><div class="ttdeci">~CheapestAdditionFilteredHeuristic() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00809">routing_search.h:809</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#l02424">routing_search.cc:2424</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__search_8h_source.html#l00299">routing_search.h:299</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#l00535">routing_search.cc:535</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_a4c042f054da687c4a586dc5d3dfaef10"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a4c042f054da687c4a586dc5d3dfaef10">operations_research::CheapestInsertionFilteredHeuristic::evaluator_</a></div><div class="ttdeci">std::function< int64_t(int64_t, int64_t, int64_t)> evaluator_</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00380">routing_search.h:380</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 class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00586">routing_search.cc:586</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_a750200f78e5b4a8192dc7ad3b6b10eec"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a750200f78e5b4a8192dc7ad3b6b10eec">operations_research::CheapestInsertionFilteredHeuristic::GetInsertionCostForNodeAtPosition</a></div><div class="ttdeci">int64_t GetInsertionCostForNodeAtPosition(int64_t node_to_insert, int64_t insert_after, int64_t 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#l00644">routing_search.cc:644</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_aa8428da25ac9fa3e49779cc7ddebadb3"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#aa8428da25ac9fa3e49779cc7ddebadb3">operations_research::CheapestInsertionFilteredHeuristic::~CheapestInsertionFilteredHeuristic</a></div><div class="ttdeci">~CheapestInsertionFilteredHeuristic() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00307">routing_search.h:307</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_aab2e87c6b0d1adc11fef2b9a9ea8d5a6"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#aab2e87c6b0d1adc11fef2b9a9ea8d5a6">operations_research::CheapestInsertionFilteredHeuristic::GetUnperformedValue</a></div><div class="ttdeci">int64_t GetUnperformedValue(int64_t 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#l00653">routing_search.cc:653</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_ab757210526cd08167062c3bf8cf63982"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ab757210526cd08167062c3bf8cf63982">operations_research::CheapestInsertionFilteredHeuristic::penalty_evaluator_</a></div><div class="ttdeci">std::function< int64_t(int64_t)> penalty_evaluator_</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00381">routing_search.h:381</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_ac06fb0f5750600ea6fd0cba641f5e35f"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ac06fb0f5750600ea6fd0cba641f5e35f">operations_research::CheapestInsertionFilteredHeuristic::CheapestInsertionFilteredHeuristic</a></div><div class="ttdeci">CheapestInsertionFilteredHeuristic(RoutingModel *model, std::function< int64_t(int64_t, int64_t, int64_t)> evaluator, std::function< int64_t(int64_t)> 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#l00524">routing_search.cc:524</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_add2710777ca3960d37c6257cd95edfee"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#add2710777ca3960d37c6257cd95edfee">operations_research::CheapestInsertionFilteredHeuristic::InsertBetween</a></div><div class="ttdeci">void InsertBetween(int64_t node, int64_t predecessor, int64_t successor, int vehicle=-1)</div><div class="ttdoc">Inserts 'node' just after 'predecessor', and just before 'successor' on the route of 'vehicle',...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00606">routing_search.cc:606</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_ade9dca16a1e0dc26a1a8797874413fad"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ade9dca16a1e0dc26a1a8797874413fad">operations_research::CheapestInsertionFilteredHeuristic::AppendInsertionPositionsAfter</a></div><div class="ttdeci">void AppendInsertionPositionsAfter(int64_t node_to_insert, int64_t start, int64_t next_after_start, int vehicle, std::vector< NodeInsertion > *node_insertions)</div><div class="ttdoc">Helper method to the ComputeEvaluatorSortedPositions* methods.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00620">routing_search.cc:620</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__search_8h_source.html#l00331">routing_search.h:331</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_christofides_filtered_heuristic_html"><div class="ttname"><a href="classoperations__research_1_1_christofides_filtered_heuristic.html">operations_research::ChristofidesFilteredHeuristic</a></div><div class="ttdoc">Christofides addition heuristic.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l01066">routing_search.h:1066</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#l03653">routing_search.cc:3653</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_christofides_filtered_heuristic_html_ab0717c778b4489b27d8687df6b1ba083"><div class="ttname"><a href="classoperations__research_1_1_christofides_filtered_heuristic.html#ab0717c778b4489b27d8687df6b1ba083">operations_research::ChristofidesFilteredHeuristic::~ChristofidesFilteredHeuristic</a></div><div class="ttdeci">~ChristofidesFilteredHeuristic() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l01071">routing_search.h:1071</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_christofides_filtered_heuristic_html_aed804747c45a7e1caf81461f9e45dd91"><div class="ttname"><a href="classoperations__research_1_1_christofides_filtered_heuristic.html#aed804747c45a7e1caf81461f9e45dd91">operations_research::ChristofidesFilteredHeuristic::DebugString</a></div><div class="ttdeci">std::string DebugString() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l01073">routing_search.h:1073</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#l03646">routing_search.cc:3646</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic_html"><div class="ttname"><a href="classoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic.html">operations_research::ComparatorCheapestAdditionFilteredHeuristic</a></div><div class="ttdoc">A CheapestAdditionFilteredHeuristic where the notion of 'cheapest arc' comes from an arc comparator.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00870">routing_search.h:871</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#l02616">routing_search.cc:2617</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic_html_aca6c8c82d740691caa27615ee1a2fe9e"><div class="ttname"><a href="classoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic.html#aca6c8c82d740691caa27615ee1a2fe9e">operations_research::ComparatorCheapestAdditionFilteredHeuristic::~ComparatorCheapestAdditionFilteredHeuristic</a></div><div class="ttdeci">~ComparatorCheapestAdditionFilteredHeuristic() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00877">routing_search.h:877</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic_html_aed804747c45a7e1caf81461f9e45dd91"><div class="ttname"><a href="classoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic.html#aed804747c45a7e1caf81461f9e45dd91">operations_research::ComparatorCheapestAdditionFilteredHeuristic::DebugString</a></div><div class="ttdeci">std::string DebugString() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00878">routing_search.h:878</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#l03285">constraint_solver.h:3285</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#l03245">constraint_solver.h:3245</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic_html"><div class="ttname"><a href="classoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic.html">operations_research::EvaluatorCheapestAdditionFilteredHeuristic</a></div><div class="ttdoc">A CheapestAdditionFilteredHeuristic where the notion of 'cheapest arc' comes from an arc evaluator.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00847">routing_search.h:848</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic_html_a3708f86f49ec8005ba0cd16a4bf9ab8f"><div class="ttname"><a href="classoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic.html#a3708f86f49ec8005ba0cd16a4bf9ab8f">operations_research::EvaluatorCheapestAdditionFilteredHeuristic::EvaluatorCheapestAdditionFilteredHeuristic</a></div><div class="ttdeci">EvaluatorCheapestAdditionFilteredHeuristic(RoutingModel *model, std::function< int64_t(int64_t, int64_t)> 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#l02574">routing_search.cc:2575</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic_html_a5e9ebf34788290561f002dfa3b9d60ff"><div class="ttname"><a href="classoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic.html#a5e9ebf34788290561f002dfa3b9d60ff">operations_research::EvaluatorCheapestAdditionFilteredHeuristic::~EvaluatorCheapestAdditionFilteredHeuristic</a></div><div class="ttdeci">~EvaluatorCheapestAdditionFilteredHeuristic() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00854">routing_search.h:854</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic_html_aed804747c45a7e1caf81461f9e45dd91"><div class="ttname"><a href="classoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic.html#aed804747c45a7e1caf81461f9e45dd91">operations_research::EvaluatorCheapestAdditionFilteredHeuristic::DebugString</a></div><div class="ttdeci">std::string DebugString() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00855">routing_search.h:855</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_html"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html">operations_research::GlobalCheapestInsertionFilteredHeuristic</a></div><div class="ttdoc">Filter-based decision builder which builds a solution by inserting nodes at their cheapest position o...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00391">routing_search.h:392</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#l00916">routing_search.cc:916</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_html_a7aa80364c8c66a703b80f0bd883788ad"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#a7aa80364c8c66a703b80f0bd883788ad">operations_research::GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionFilteredHeuristic</a></div><div class="ttdeci">GlobalCheapestInsertionFilteredHeuristic(RoutingModel *model, std::function< int64_t(int64_t, int64_t, int64_t)> evaluator, std::function< int64_t(int64_t)> 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#l00780">routing_search.cc:781</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_html_a8a78d376aa2c8065becb7df9be4a54da"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#a8a78d376aa2c8065becb7df9be4a54da">operations_research::GlobalCheapestInsertionFilteredHeuristic::~GlobalCheapestInsertionFilteredHeuristic</a></div><div class="ttdeci">~GlobalCheapestInsertionFilteredHeuristic() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00425">routing_search.h:425</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_html_aed804747c45a7e1caf81461f9e45dd91"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#aed804747c45a7e1caf81461f9e45dd91">operations_research::GlobalCheapestInsertionFilteredHeuristic::DebugString</a></div><div class="ttdeci">std::string DebugString() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00427">routing_search.h:427</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_element_html_a15828fe5ecfdada586a63d916b7b7354"><div class="ttname"><a href="classoperations__research_1_1_int_var_element.html#a15828fe5ecfdada586a63d916b7b7354">operations_research::IntVarElement::Value</a></div><div class="ttdeci">int64_t Value() const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04718">constraint_solver.h:4718</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_element_html_ac1b2a58bfded95799de1fd7958bdb2a3"><div class="ttname"><a href="classoperations__research_1_1_int_var_element.html#ac1b2a58bfded95799de1fd7958bdb2a3">operations_research::IntVarElement::SetValue</a></div><div class="ttdeci">void SetValue(int64_t v)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04728">constraint_solver.h:4728</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_element_html_ad197164b669d8b5d35fc497754791e39"><div class="ttname"><a href="classoperations__research_1_1_int_var_element.html#ad197164b669d8b5d35fc497754791e39">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#l04701">constraint_solver.h:4701</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_decision_builder_html"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_decision_builder.html">operations_research::IntVarFilteredDecisionBuilder</a></div><div class="ttdoc">Decision builder building a solution using heuristics with local search filters to evaluate its feasi...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00142">routing_search.h:142</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_decision_builder_html_a7108359d8e6c5360f554581971ed253f"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_decision_builder.html#a7108359d8e6c5360f554581971ed253f">operations_research::IntVarFilteredDecisionBuilder::~IntVarFilteredDecisionBuilder</a></div><div class="ttdeci">~IntVarFilteredDecisionBuilder() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00147">routing_search.h:147</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#l00201">routing_search.cc:201</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_decision_builder_html_aac2118d22c4275990bdd1fec28a2a8d3"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_decision_builder.html#aac2118d22c4275990bdd1fec28a2a8d3">operations_research::IntVarFilteredDecisionBuilder::number_of_decisions</a></div><div class="ttdeci">int64_t 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#l00214">routing_search.cc:214</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#l00197">routing_search.cc:197</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#l00222">routing_search.cc:222</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_decision_builder_html_afd4b70bcd23086d4968db3a1d822ee2c"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_decision_builder.html#afd4b70bcd23086d4968db3a1d822ee2c">operations_research::IntVarFilteredDecisionBuilder::number_of_rejects</a></div><div class="ttdeci">int64_t number_of_rejects() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00218">routing_search.cc:218</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__search_8h_source.html#l00162">routing_search.h:162</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a0482d92187ca6a3a2b0b46a009ef24e8"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">operations_research::IntVarFilteredHeuristic::SetValue</a></div><div class="ttdeci">void SetValue(int64_t index, int64_t 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__search_8h_source.html#l00200">routing_search.h:200</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_a0d549adeef4a45d3078daf3d7918b253"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0d549adeef4a45d3078daf3d7918b253">operations_research::IntVarFilteredHeuristic::SecondaryVarIndex</a></div><div class="ttdeci">int64_t SecondaryVarIndex(int64_t index) const</div><div class="ttdoc">Returns the index of a secondary var.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00224">routing_search.h:224</a></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__search_8h_source.html#l00220">routing_search.h:220</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a2f14293a2b4f700691aa788d202004e4"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">operations_research::IntVarFilteredHeuristic::Contains</a></div><div class="ttdeci">bool Contains(int64_t 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__search_8h_source.html#l00215">routing_search.h:215</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a57eacabea8a7dca6ed62b309f476fea6"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a57eacabea8a7dca6ed62b309f476fea6">operations_research::IntVarFilteredHeuristic::~IntVarFilteredHeuristic</a></div><div class="ttdeci">virtual ~IntVarFilteredHeuristic()</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00168">routing_search.h:168</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a64b348f1f572b9ea470c453a027e6d25"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a64b348f1f572b9ea470c453a027e6d25">operations_research::IntVarFilteredHeuristic::StopSearch</a></div><div class="ttdeci">virtual bool StopSearch()</div><div class="ttdoc">Returns true if the search must be stopped.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00197">routing_search.h:197</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__search_8h_source.html#l00235">routing_search.h:235</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#l00253">routing_search.cc:253</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#l00350">routing_search.cc:350</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a8eba5d533fa9df4617c1868d3ec2afc4"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a8eba5d533fa9df4617c1868d3ec2afc4">operations_research::IntVarFilteredHeuristic::DebugString</a></div><div class="ttdeci">virtual std::string DebugString() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00179">routing_search.h:179</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a9d72d8f26ae6d9340f48eb0340c264d1"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a9d72d8f26ae6d9340f48eb0340c264d1">operations_research::IntVarFilteredHeuristic::HasSecondaryVars</a></div><div class="ttdeci">bool HasSecondaryVars() const</div><div class="ttdoc">Returns true if there are secondary variables.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00229">routing_search.h:229</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__search_8h_source.html#l00185">routing_search.h:185</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_aac2118d22c4275990bdd1fec28a2a8d3"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#aac2118d22c4275990bdd1fec28a2a8d3">operations_research::IntVarFilteredHeuristic::number_of_decisions</a></div><div class="ttdeci">int64_t number_of_decisions() const</div><div class="ttdoc">Returns statistics on search, number of decisions sent to filters, number of decisions rejected by fi...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00176">routing_search.h:176</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_abd977c8d4bb6eae7fd1037091282050f"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#abd977c8d4bb6eae7fd1037091282050f">operations_research::IntVarFilteredHeuristic::Var</a></div><div class="ttdeci">IntVar * Var(int64_t index) const</div><div class="ttdoc">Returns the variable of index 'index'.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00222">routing_search.h:222</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_ac377ad448d6eefca4e56758e235ddd25"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">operations_research::IntVarFilteredHeuristic::Value</a></div><div class="ttdeci">int64_t Value(int64_t 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__search_8h_source.html#l00211">routing_search.h:211</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_addc62ce828c9c5ebdf398492bcd04495"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#addc62ce828c9c5ebdf398492bcd04495">operations_research::IntVarFilteredHeuristic::IsSecondaryVar</a></div><div class="ttdeci">bool IsSecondaryVar(int64_t index) const</div><div class="ttdoc">Returns true if 'index' is a secondary variable index.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00231">routing_search.h:231</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_ae0451a92b46be9a570dac925e10dec92"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">operations_research::IntVarFilteredHeuristic::Evaluate</a></div><div class="ttdeci">std::optional< int64_t > Evaluate(bool commit)</div><div class="ttdoc">Evaluates the modifications to the current solution.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00307">routing_search.cc:307</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#l00263">routing_search.cc:263</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_af60e2423a0fdf248c6e5aed0f7368a07"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#af60e2423a0fdf248c6e5aed0f7368a07">operations_research::IntVarFilteredHeuristic::IntVarFilteredHeuristic</a></div><div class="ttdeci">IntVarFilteredHeuristic(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, LocalSearchFilterManager *filter_manager)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00231">routing_search.cc:231</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_afd4b70bcd23086d4968db3a1d822ee2c"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#afd4b70bcd23086d4968db3a1d822ee2c">operations_research::IntVarFilteredHeuristic::number_of_rejects</a></div><div class="ttdeci">int64_t number_of_rejects() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00177">routing_search.h:177</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#l04040">constraint_solver.h:4040</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_html_af8625719d57e4a61b5aa251d99762966"><div class="ttname"><a href="classoperations__research_1_1_int_var.html#af8625719d57e4a61b5aa251d99762966">operations_research::IntVar::Size</a></div><div class="ttdeci">virtual uint64_t Size() const =0</div><div class="ttdoc">This method returns the number of values in the domain of the variable.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_cheapest_insertion_filtered_heuristic_html"><div class="ttname"><a href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html">operations_research::LocalCheapestInsertionFilteredHeuristic</a></div><div class="ttdoc">Filter-base decision builder which builds a solution by inserting nodes at their cheapest position.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00752">routing_search.h:753</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_cheapest_insertion_filtered_heuristic_html_a219891cda8ffb7f9dbb5752360f0cbca"><div class="ttname"><a href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html#a219891cda8ffb7f9dbb5752360f0cbca">operations_research::LocalCheapestInsertionFilteredHeuristic::LocalCheapestInsertionFilteredHeuristic</a></div><div class="ttdeci">LocalCheapestInsertionFilteredHeuristic(RoutingModel *model, std::function< int64_t(int64_t, int64_t, int64_t)> evaluator, bool evaluate_pickup_delivery_costs_independently, 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#l02209">routing_search.cc:2210</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#l02228">routing_search.cc:2228</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_cheapest_insertion_filtered_heuristic_html_ad62667103979689ca2fe11226241015c"><div class="ttname"><a href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html#ad62667103979689ca2fe11226241015c">operations_research::LocalCheapestInsertionFilteredHeuristic::~LocalCheapestInsertionFilteredHeuristic</a></div><div class="ttdeci">~LocalCheapestInsertionFilteredHeuristic() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00761">routing_search.h:761</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_cheapest_insertion_filtered_heuristic_html_aed804747c45a7e1caf81461f9e45dd91"><div class="ttname"><a href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html#aed804747c45a7e1caf81461f9e45dd91">operations_research::LocalCheapestInsertionFilteredHeuristic::DebugString</a></div><div class="ttdeci">std::string DebugString() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00763">routing_search.h:763</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#l01774">constraint_solveri.h:1774</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_math_util_html_a55fc8a3af7c2526c83e83586cd578d89"><div class="ttname"><a href="classoperations__research_1_1_math_util.html#a55fc8a3af7c2526c83e83586cd578d89">operations_research::MathUtil::FastInt64Round</a></div><div class="ttdeci">static int64_t FastInt64Round(double x)</div><div class="ttdef"><b>Definition:</b> <a href="mathutil_8h_source.html#l00138">mathutil.h:138</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_parallel_savings_filtered_heuristic_html"><div class="ttname"><a href="classoperations__research_1_1_parallel_savings_filtered_heuristic.html">operations_research::ParallelSavingsFilteredHeuristic</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l01020">routing_search.h:1020</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_parallel_savings_filtered_heuristic_html_a197d1240a83ccf92568885e67d87486d"><div class="ttname"><a href="classoperations__research_1_1_parallel_savings_filtered_heuristic.html#a197d1240a83ccf92568885e67d87486d">operations_research::ParallelSavingsFilteredHeuristic::ParallelSavingsFilteredHeuristic</a></div><div class="ttdeci">ParallelSavingsFilteredHeuristic(RoutingModel *model, SavingsParameters parameters, LocalSearchFilterManager *filter_manager)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l01022">routing_search.h:1022</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_parallel_savings_filtered_heuristic_html_a9fe69e789776765e59166957a5956a32"><div class="ttname"><a href="classoperations__research_1_1_parallel_savings_filtered_heuristic.html#a9fe69e789776765e59166957a5956a32">operations_research::ParallelSavingsFilteredHeuristic::~ParallelSavingsFilteredHeuristic</a></div><div class="ttdeci">~ParallelSavingsFilteredHeuristic() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l01026">routing_search.h:1026</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_parallel_savings_filtered_heuristic_html_aed804747c45a7e1caf81461f9e45dd91"><div class="ttname"><a href="classoperations__research_1_1_parallel_savings_filtered_heuristic.html#aed804747c45a7e1caf81461f9e45dd91">operations_research::ParallelSavingsFilteredHeuristic::DebugString</a></div><div class="ttdeci">std::string DebugString() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l01027">routing_search.h:1027</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#l00219">constraint_solver.cc:219</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__search_8h_source.html#l00257">routing_search.h:257</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_a0e2e09ac8fcd3f591b0a6ae0cf5ea613"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#a0e2e09ac8fcd3f591b0a6ae0cf5ea613">operations_research::RoutingFilteredHeuristic::~RoutingFilteredHeuristic</a></div><div class="ttdeci">~RoutingFilteredHeuristic() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00262">routing_search.h:262</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__search_8h_source.html#l00268">routing_search.h:268</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_a7cccc6ea4b6f89355769bc0de4548f1d"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#a7cccc6ea4b6f89355769bc0de4548f1d">operations_research::RoutingFilteredHeuristic::SetVehicleIndex</a></div><div class="ttdeci">virtual void SetVehicleIndex(int64_t node, int vehicle)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00284">routing_search.h:284</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__search_8h_source.html#l00270">routing_search.h:270</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_a90dcdb4d66f8781421f5913150a85a06"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">operations_research::RoutingFilteredHeuristic::model</a></div><div class="ttdeci">RoutingModel * model() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00266">routing_search.h:266</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_a93aa105d700ad23091b6f3f55d48a2c1"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#a93aa105d700ad23091b6f3f55d48a2c1">operations_research::RoutingFilteredHeuristic::RoutingFilteredHeuristic</a></div><div class="ttdeci">RoutingFilteredHeuristic(RoutingModel *model, LocalSearchFilterManager *filter_manager, bool omit_secondary_vars=true)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00366">routing_search.cc:366</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_a954a436d9a6c975e9d88f2ec659bb090"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#a954a436d9a6c975e9d88f2ec659bb090">operations_research::RoutingFilteredHeuristic::MakeDisjunctionNodesUnperformed</a></div><div class="ttdeci">void MakeDisjunctionNodesUnperformed(int64_t 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#l00462">routing_search.cc:462</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__search_8h_source.html#l00283">routing_search.h:283</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#l00471">routing_search.cc:471</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__search_8h_source.html#l00285">routing_search.h:285</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#l00483">routing_search.cc:483</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__search_8h_source.html#l00286">routing_search.h:286</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_ae645e8ef4a6929a1c1dbed695f2dd67d"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#ae645e8ef4a6929a1c1dbed695f2dd67d">operations_research::RoutingFilteredHeuristic::BuildSolutionFromRoutes</a></div><div class="ttdeci">const Assignment * BuildSolutionFromRoutes(const std::function< int64_t(int64_t)> &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#l00273">routing_search.cc:273</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#l00210">routing.h:210</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#l00246">routing.h:246</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#l01514">routing.h:1514</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a43c00b1c44d7f5bec9287ce60fadef52"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a43c00b1c44d7f5bec9287ce60fadef52">operations_research::RoutingModel::VehicleVar</a></div><div class="ttdeci">IntVar * VehicleVar(int64_t 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#l01382">routing.h:1382</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a572bd92c25ebc67c72137fd59e53f6d6"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">operations_research::RoutingModel::Size</a></div><div class="ttdeci">int64_t Size() const</div><div class="ttdoc">Returns the number of next variables in the model.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01531">routing.h:1531</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#l01529">routing.h:1529</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_afb80fd36c1fb57d2db049403483e2074"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#afb80fd36c1fb57d2db049403483e2074">operations_research::RoutingModel::End</a></div><div class="ttdeci">int64_t End(int vehicle) const</div><div class="ttdoc">Returns the variable index of the ending node of a vehicle route.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01335">routing.h:1335</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#l02688">routing_search.cc:2688</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__search_8h_source.html#l00899">routing_search.h:899</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a04f0558b5828ce46108dca7e5a3a8504"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a04f0558b5828ce46108dca7e5a3a8504">operations_research::SavingsFilteredHeuristic::SavingsFilteredHeuristic</a></div><div class="ttdeci">SavingsFilteredHeuristic(RoutingModel *model, SavingsParameters parameters, LocalSearchFilterManager *filter_manager)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03070">routing_search.cc:3070</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a059d074075b06daa69a371f96d5ad60c"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a059d074075b06daa69a371f96d5ad60c">operations_research::SavingsFilteredHeuristic::GetVehicleTypeFromSaving</a></div><div class="ttdeci">int64_t 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__search_8h_source.html#l00932">routing_search.h:932</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__search_8h_source.html#l00961">routing_search.h:961</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#l03086">routing_search.cc:3086</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a3f462bd92b7848baac82e1c526d0ed5a"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a3f462bd92b7848baac82e1c526d0ed5a">operations_research::SavingsFilteredHeuristic::GetAfterNodeFromSaving</a></div><div class="ttdeci">int64_t 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__search_8h_source.html#l00940">routing_search.h:940</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a507360c2a0a17cf293d6342c073750ae"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a507360c2a0a17cf293d6342c073750ae">operations_research::SavingsFilteredHeuristic::GetSavingValue</a></div><div class="ttdeci">int64_t 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__search_8h_source.html#l00944">routing_search.h:944</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a508859e48f977fce11a64cd80d9d1c96"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a508859e48f977fce11a64cd80d9d1c96">operations_research::SavingsFilteredHeuristic::Saving</a></div><div class="ttdeci">std::pair< int64_t, int64_t > Saving</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00922">routing_search.h:922</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__search_8h_source.html#l00959">routing_search.h:959</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#l03084">routing_search.cc:3084</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_a8a3744c9b200610bdb36dfbd8b62417b"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a8a3744c9b200610bdb36dfbd8b62417b">operations_research::SavingsFilteredHeuristic::SavingsFilteredHeuristicTestPeer</a></div><div class="ttdeci">friend class SavingsFilteredHeuristicTestPeer</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00997">routing_search.h:997</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_ac059c9526b1114c16b250a4cc809a97b"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#ac059c9526b1114c16b250a4cc809a97b">operations_research::SavingsFilteredHeuristic::GetBeforeNodeFromSaving</a></div><div class="ttdeci">int64_t 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__search_8h_source.html#l00936">routing_search.h:936</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_ad1f89eda8b1c2ad8fe6f5743e475fd5d"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#ad1f89eda8b1c2ad8fe6f5743e475fd5d">operations_research::SavingsFilteredHeuristic::StartNewRouteWithBestVehicleOfType</a></div><div class="ttdeci">int StartNewRouteWithBestVehicleOfType(int type, int64_t before_node, int64_t 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#l03104">routing_search.cc:3104</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_sequential_savings_filtered_heuristic_html"><div class="ttname"><a href="classoperations__research_1_1_sequential_savings_filtered_heuristic.html">operations_research::SequentialSavingsFilteredHeuristic</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l01000">routing_search.h:1000</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sequential_savings_filtered_heuristic_html_a30c753e93fd4c2d8ab4f4f882fd3dcab"><div class="ttname"><a href="classoperations__research_1_1_sequential_savings_filtered_heuristic.html#a30c753e93fd4c2d8ab4f4f882fd3dcab">operations_research::SequentialSavingsFilteredHeuristic::~SequentialSavingsFilteredHeuristic</a></div><div class="ttdeci">~SequentialSavingsFilteredHeuristic() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l01006">routing_search.h:1006</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sequential_savings_filtered_heuristic_html_a4514c0a69bbb45ad7215b498e9a890c2"><div class="ttname"><a href="classoperations__research_1_1_sequential_savings_filtered_heuristic.html#a4514c0a69bbb45ad7215b498e9a890c2">operations_research::SequentialSavingsFilteredHeuristic::SequentialSavingsFilteredHeuristic</a></div><div class="ttdeci">SequentialSavingsFilteredHeuristic(RoutingModel *model, SavingsParameters parameters, LocalSearchFilterManager *filter_manager)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l01002">routing_search.h:1002</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sequential_savings_filtered_heuristic_html_aed804747c45a7e1caf81461f9e45dd91"><div class="ttname"><a href="classoperations__research_1_1_sequential_savings_filtered_heuristic.html#aed804747c45a7e1caf81461f9e45dd91">operations_research::SequentialSavingsFilteredHeuristic::DebugString</a></div><div class="ttdeci">std::string DebugString() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l01007">routing_search.h:1007</a></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#l00245">constraint_solver.h:245</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_af5502e2288132c081fc96fdbcee282e6"><div class="ttname"><a href="classoperations__research_1_1_solver.html#af5502e2288132c081fc96fdbcee282e6">operations_research::Solver::VariableValueComparator</a></div><div class="ttdeci">std::function< bool(int64_t, int64_t, int64_t)> VariableValueComparator</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00751">constraint_solver.h:751</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sweep_arranger_html"><div class="ttname"><a href="classoperations__research_1_1_sweep_arranger.html">operations_research::SweepArranger</a></div><div class="ttdoc">Class to arrange indices by their distance and their angle from the depot.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l01083">routing_search.h:1083</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sweep_arranger_html_a2197ac12bb9d1906c420aa46b09448ce"><div class="ttname"><a href="classoperations__research_1_1_sweep_arranger.html#a2197ac12bb9d1906c420aa46b09448ce">operations_research::SweepArranger::SweepArranger</a></div><div class="ttdeci">SweepArranger(const std::vector< std::pair< int64_t, int64_t > > &points)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03757">routing_search.cc:3757</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sweep_arranger_html_a5fceff18e9961fb07c1c02231aef9985"><div class="ttname"><a href="classoperations__research_1_1_sweep_arranger.html#a5fceff18e9961fb07c1c02231aef9985">operations_research::SweepArranger::ArrangeIndices</a></div><div class="ttdeci">void ArrangeIndices(std::vector< int64_t > *indices)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03768">routing_search.cc:3768</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sweep_arranger_html_abdec0f71a4b3263e9ed49e1d2b4726f2"><div class="ttname"><a href="classoperations__research_1_1_sweep_arranger.html#abdec0f71a4b3263e9ed49e1d2b4726f2">operations_research::SweepArranger::SetSectors</a></div><div class="ttdeci">void SetSectors(int sectors)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l01089">routing_search.h:1089</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sweep_arranger_html_af531dae235dc7c9501a428a8ddeff432"><div class="ttname"><a href="classoperations__research_1_1_sweep_arranger.html#af531dae235dc7c9501a428a8ddeff432">operations_research::SweepArranger::~SweepArranger</a></div><div class="ttdeci">virtual ~SweepArranger()</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l01087">routing_search.h:1087</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_vehicle_type_curator_html"><div class="ttname"><a href="classoperations__research_1_1_vehicle_type_curator.html">operations_research::VehicleTypeCurator</a></div><div class="ttdoc">Helper class that manages vehicles.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00048">routing_search.h:48</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#l00106">routing_search.cc:106</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_vehicle_type_curator_html_a2f14bd5a823d4b8de9bf858ec54466cc"><div class="ttname"><a href="classoperations__research_1_1_vehicle_type_curator.html#a2f14bd5a823d4b8de9bf858ec54466cc">operations_research::VehicleTypeCurator::HasCompatibleVehicleOfType</a></div><div class="ttdeci">bool HasCompatibleVehicleOfType(int type, const std::function< bool(int)> &vehicle_is_compatible) const</div><div class="ttdoc">Searches a compatible vehicle of the given type; returns false if none was found.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00128">routing_search.cc:128</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#l00140">routing_search.cc:140</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_vehicle_type_curator_html_a6b5135fd0df7429d4b75c59930086166"><div class="ttname"><a href="classoperations__research_1_1_vehicle_type_curator.html#a6b5135fd0df7429d4b75c59930086166">operations_research::VehicleTypeCurator::VehicleTypeCurator</a></div><div class="ttdeci">VehicleTypeCurator(const RoutingModel::VehicleTypeContainer &vehicle_type_container)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00050">routing_search.h:50</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#l00077">routing_search.cc:77</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_vehicle_type_curator_html_aa3c0b35c06027c12fb62729bc65046e0"><div class="ttname"><a href="classoperations__research_1_1_vehicle_type_curator.html#aa3c0b35c06027c12fb62729bc65046e0">operations_research::VehicleTypeCurator::NumTypes</a></div><div class="ttdeci">int NumTypes() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00054">routing_search.h:54</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_vehicle_type_curator_html_acf6083fc320b50822c395a662729074b"><div class="ttname"><a href="classoperations__research_1_1_vehicle_type_curator.html#acf6083fc320b50822c395a662729074b">operations_research::VehicleTypeCurator::Type</a></div><div class="ttdeci">int Type(int vehicle) const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00056">routing_search.h:56</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_vehicle_type_curator_html_ae1f5dd925d8845bf8826dfa9bad2518b"><div class="ttname"><a href="classoperations__research_1_1_vehicle_type_curator.html#ae1f5dd925d8845bf8826dfa9bad2518b">operations_research::VehicleTypeCurator::ReinjectVehicleOfClass</a></div><div class="ttdeci">void ReinjectVehicleOfClass(int vehicle, int vehicle_class, int64_t fixed_cost)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00078">routing_search.h:78</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_vehicle_type_curator_html_ae273572e5466d452e207c045ee242b4a"><div class="ttname"><a href="classoperations__research_1_1_vehicle_type_curator.html#ae273572e5466d452e207c045ee242b4a">operations_research::VehicleTypeCurator::GetLowestFixedCostVehicleOfType</a></div><div class="ttdeci">int GetLowestFixedCostVehicleOfType(int type) const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00066">routing_search.h:66</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#l00678">constraint_solver.cc:678</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_8h_html"><div class="ttname"><a href="constraint__solver_8h.html">constraint_solver.h</a></div></div>
|
|
<div class="ttc" id="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#l00119">cp_model_fz_solver.cc:119</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00044">demon_profiler.cc:44</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#l00274">gurobi_interface.cc:274</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="alocal__search_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l02750">local_search.cc:2750</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html"><div class="ttname"><a href="macros_8h.html">macros.h</a></div></div>
|
|
<div class="ttc" id="amathutil_8h_html"><div class="ttname"><a href="mathutil_8h.html">mathutil.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a96eab70b5ead3894afac4d4fff0fd984"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984">operations_research::sat::Value</a></div><div class="ttdeci">std::function< int64_t(const Model &)> Value(IntegerVariable v)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01683">integer.h:1683</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a26a2d5d3c5887e436bf4da4c20a99a26"><div class="ttname"><a href="namespaceoperations__research.html#a26a2d5d3c5887e436bf4da4c20a99a26">operations_research::MakeAllUnperformed</a></div><div class="ttdeci">DecisionBuilder * MakeAllUnperformed(RoutingModel *model)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l04380">routing_search.cc:4380</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a89152c6d7ca6a92ff106fe602c706816"><div class="ttname"><a href="namespaceoperations__research.html#a89152c6d7ca6a92ff106fe602c706816">operations_research::AutomaticFirstSolutionStrategy</a></div><div class="ttdeci">FirstSolutionStrategy::Value AutomaticFirstSolutionStrategy(bool has_pickup_deliveries, bool has_node_precedences, bool has_single_vehicle_node)</div><div class="ttdoc">Returns the best value for the automatic first solution strategy, based on the given model parameters...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00181">routing_search.cc:181</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ab5b064a7895b1fc8084546441a57b46a"><div class="ttname"><a href="namespaceoperations__research.html#ab5b064a7895b1fc8084546441a57b46a">operations_research::MakeSweepDecisionBuilder</a></div><div class="ttdeci">DecisionBuilder * MakeSweepDecisionBuilder(RoutingModel *model, bool check_assignment)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l04346">routing_search.cc:4346</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__index__manager_8h_html"><div class="ttname"><a href="routing__index__manager_8h.html">routing_index_manager.h</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_a1a01a2753d74fedd87264d8bd34a12df"><div class="ttname"><a href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a></div><div class="ttdeci">int vehicle_class</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03819">routing_search.cc:3819</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_a6b7983ccd32c86cbbc3d4d9cda4cac17"><div class="ttname"><a href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a></div><div class="ttdeci">int nodes</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03997">routing_search.cc:3997</a></div></div>
|
|
<div class="ttc" id="asparse__submatrix_8cc_html_a4d53eac2ef2732c28fa9fb663e0c19a7"><div class="ttname"><a href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a></div><div class="ttdeci">std::optional< int64_t > end</div><div class="ttdef"><b>Definition:</b> <a href="sparse__submatrix_8cc_source.html#l00036">sparse_submatrix.cc:36</a></div></div>
|
|
<div class="ttc" id="asparse__submatrix_8cc_html_a9b7656b922ea4ec96097d7380c0e61fe"><div class="ttname"><a href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a></div><div class="ttdeci">int64_t start</div><div class="ttdef"><b>Definition:</b> <a href="sparse__submatrix_8cc_source.html#l00035">sparse_submatrix.cc:35</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion_html"><div class="ttname"><a href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion.html">operations_research::CheapestInsertionFilteredHeuristic::NodeInsertion</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00310">routing_search.h:310</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion_html_a96b8f0fa9ab1e12aed840c7293becbf7"><div class="ttname"><a href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion.html#a96b8f0fa9ab1e12aed840c7293becbf7">operations_research::CheapestInsertionFilteredHeuristic::NodeInsertion::vehicle</a></div><div class="ttdeci">int vehicle</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00312">routing_search.h:312</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion.html#ac072af30c4ffbc834bb4c681f6ecb514">operations_research::CheapestInsertionFilteredHeuristic::NodeInsertion::value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00313">routing_search.h:313</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion_html_af84130a995a03822468f3f7c05fed7d0"><div class="ttname"><a href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion.html#af84130a995a03822468f3f7c05fed7d0">operations_research::CheapestInsertionFilteredHeuristic::NodeInsertion::insert_after</a></div><div class="ttdeci">int64_t insert_after</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00311">routing_search.h:311</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion_html_afdc41377e793261ff493c83aadb4923b"><div class="ttname"><a href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_node_insertion.html#afdc41377e793261ff493c83aadb4923b">operations_research::CheapestInsertionFilteredHeuristic::NodeInsertion::operator<</a></div><div class="ttdeci">bool operator<(const NodeInsertion &other) const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00315">routing_search.h:315</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__search_8h_source.html#l00320">routing_search.h:320</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value_html_a655ac5f27be9e0897ecb004c8f1b2f1c"><div class="ttname"><a href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html#a655ac5f27be9e0897ecb004c8f1b2f1c">operations_research::CheapestInsertionFilteredHeuristic::StartEndValue::distance</a></div><div class="ttdeci">int64_t distance</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00322">routing_search.h:322</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value_html_a7c4b3e8b0b9144aa29c94fc54c74d045"><div class="ttname"><a href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html#a7c4b3e8b0b9144aa29c94fc54c74d045">operations_research::CheapestInsertionFilteredHeuristic::StartEndValue::operator<</a></div><div class="ttdeci">bool operator<(const StartEndValue &other) const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00325">routing_search.h:325</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value_html_a96b8f0fa9ab1e12aed840c7293becbf7"><div class="ttname"><a href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html#a96b8f0fa9ab1e12aed840c7293becbf7">operations_research::CheapestInsertionFilteredHeuristic::StartEndValue::vehicle</a></div><div class="ttdeci">int vehicle</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00323">routing_search.h:323</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value_html_af19794e430154e5ce0b38cdccf19824d"><div class="ttname"><a href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html#af19794e430154e5ce0b38cdccf19824d">operations_research::CheapestInsertionFilteredHeuristic::StartEndValue::num_allowed_vehicles</a></div><div class="ttdeci">int64_t num_allowed_vehicles</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00321">routing_search.h:321</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__search_8h_source.html#l00394">routing_search.h:394</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__search_8h_source.html#l00405">routing_search.h:405</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters_html_a264a3f98da0f7c3a55447f0e77e7ec8c"><div class="ttname"><a href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a264a3f98da0f7c3a55447f0e77e7ec8c">operations_research::GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionParameters::min_neighbors</a></div><div class="ttdeci">int64_t min_neighbors</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00406">routing_search.h:406</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__search_8h_source.html#l00396">routing_search.h:396</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__search_8h_source.html#l00399">routing_search.h:399</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__search_8h_source.html#l00410">routing_search.h:410</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__search_8h_source.html#l00415">routing_search.h:415</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#l00362">routing.h:362</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_routing_model_1_1_vehicle_type_container_html"><div class="ttname"><a href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container.html">operations_research::RoutingModel::VehicleTypeContainer</a></div><div class="ttdoc">Struct used to sort and store vehicles by their type.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00361">routing.h:361</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_routing_model_1_1_vehicle_type_container_html_aa3c0b35c06027c12fb62729bc65046e0"><div class="ttname"><a href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container.html#aa3c0b35c06027c12fb62729bc65046e0">operations_research::RoutingModel::VehicleTypeContainer::NumTypes</a></div><div class="ttdeci">int NumTypes() const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00372">routing.h:372</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_routing_model_1_1_vehicle_type_container_html_acf6083fc320b50822c395a662729074b"><div class="ttname"><a href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container.html#acf6083fc320b50822c395a662729074b">operations_research::RoutingModel::VehicleTypeContainer::Type</a></div><div class="ttdeci">int Type(int vehicle) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00374">routing.h:374</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__search_8h_source.html#l00901">routing_search.h:901</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__search_8h_source.html#l00904">routing_search.h:904</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__search_8h_source.html#l00913">routing_search.h:913</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__search_8h_source.html#l00907">routing_search.h:907</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__search_8h_source.html#l00910">routing_search.h:910</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_8h.html">routing_search.h</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.3 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|