1894 lines
377 KiB
HTML
1894 lines
377 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_neighborhoods.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.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__neighborhoods_8cc_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle"><div class="title">routing_neighborhoods.cc</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="routing__neighborhoods_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#include "<a class="code" href="routing__neighborhoods_8h.html">ortools/constraint_solver/routing_neighborhoods.h</a>"</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span> </div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <functional></span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <iterator></span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include <queue></span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include <tuple></span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include <utility></span></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span> </div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</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="l00027" name="l00027"></a><span class="lineno"> 27</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="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include "<a class="code" href="strong__int_8h.html">ortools/base/strong_int.h</a>"</span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include "<a class="code" href="constraint__solver_8h.html">ortools/constraint_solver/constraint_solver.h</a>"</span></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="preprocessor">#include "<a class="code" href="constraint__solveri_8h.html">ortools/constraint_solver/constraint_solveri.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="routing_8h.html">ortools/constraint_solver/routing.h</a>"</span></div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="preprocessor">#include "<a class="code" href="routing__search_8h.html">ortools/constraint_solver/routing_search.h</a>"</span></div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="preprocessor">#include "<a class="code" href="routing__types_8h.html">ortools/constraint_solver/routing_types.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="bitset_8h.html">ortools/util/bitset.h</a>"</span></div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> </div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> </div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_make_relocate_neighbors_operator.html#a28fd1231bc1d9d0eaaa2224fbf777811"> 38</a></span><a class="code hl_function" href="classoperations__research_1_1_make_relocate_neighbors_operator.html#a28fd1231bc1d9d0eaaa2224fbf777811">MakeRelocateNeighborsOperator::MakeRelocateNeighborsOperator</a>(</div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="keyword">const</span> std::vector<IntVar*>& secondary_vars,</div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> std::function<<span class="keywordtype">int</span>(int64_t)> start_empty_path_class,</div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <a class="code hl_typedef" href="namespaceoperations__research.html#a26868b9d744edcd8d59145e068678885">RoutingTransitCallback2</a> arc_evaluator)</div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> : <a class="code hl_class" href="classoperations__research_1_1_path_operator.html">PathOperator</a>(vars, secondary_vars, 2, true, false,</div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <a class="code hl_namespace" href="namespacestd.html">std</a>::move(start_empty_path_class)),</div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> arc_evaluator_(<a class="code hl_namespace" href="namespacestd.html">std</a>::move(arc_evaluator)) {}</div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> </div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_make_relocate_neighbors_operator.html#a24ea165f00f8e15de94958fc804ff209"> 47</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_make_relocate_neighbors_operator.html#a24ea165f00f8e15de94958fc804ff209">MakeRelocateNeighborsOperator::MakeNeighbor</a>() {</div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="keyword">const</span> int64_t before_chain = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(0);</div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> int64_t chain_end = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a5f9e1016a5bb6a7d5cded8599a50fce1">Next</a>(before_chain);</div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a4f36c21ecd69ac0eda49cd44375e88b4">IsPathEnd</a>(chain_end)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="keyword">const</span> int64_t destination = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(1);</div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <span class="keywordflow">if</span> (chain_end == destination) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <span class="keyword">const</span> int64_t max_arc_value = arc_evaluator_(destination, chain_end);</div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> int64_t <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a5f9e1016a5bb6a7d5cded8599a50fce1">Next</a>(chain_end);</div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="keywordflow">while</span> (!<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a4f36c21ecd69ac0eda49cd44375e88b4">IsPathEnd</a>(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>) && arc_evaluator_(chain_end, <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>) <= max_arc_value) {</div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> == destination) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> chain_end = <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a5f9e1016a5bb6a7d5cded8599a50fce1">Next</a>(chain_end);</div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> }</div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="keywordflow">return</span> MoveChainAndRepair(before_chain, chain_end, destination);</div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span>}</div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> </div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span><span class="keywordtype">bool</span> MakeRelocateNeighborsOperator::MoveChainAndRepair(int64_t before_chain,</div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> int64_t chain_end,</div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> int64_t destination) {</div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a625a8523af421e43b7ac500b934e7dbd">MoveChain</a>(before_chain, chain_end, destination)) {</div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a17bdf687f4bf47cb68ea163f28876608">IsPathStart</a>(destination)) {</div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> int64_t current = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa14dad2d86c18296f9a5227b87d5caad">Prev</a>(destination);</div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> int64_t last = chain_end;</div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="keywordflow">if</span> (current == last) { <span class="comment">// chain was just before destination</span></div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> current = before_chain;</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="keywordflow">while</span> (last >= 0 && !<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a17bdf687f4bf47cb68ea163f28876608">IsPathStart</a>(current) && current != last) {</div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> last = Reposition(current, last);</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> current = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa14dad2d86c18296f9a5227b87d5caad">Prev</a>(current);</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"> 78</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> }</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span>}</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> </div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span>int64_t MakeRelocateNeighborsOperator::Reposition(int64_t before_to_move,</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> int64_t up_to) {</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keyword">const</span> int64_t kNoChange = -1;</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="keyword">const</span> int64_t to_move = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a5f9e1016a5bb6a7d5cded8599a50fce1">Next</a>(before_to_move);</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> int64_t <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a5f9e1016a5bb6a7d5cded8599a50fce1">Next</a>(to_move);</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a88a93be7370ff1f4c043fb335c8aac7c">Var</a>(to_move)->Contains(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)) {</div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="keywordflow">return</span> kNoChange;</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> }</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> int64_t prev = <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a5f9e1016a5bb6a7d5cded8599a50fce1">Next</a>(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="keywordflow">while</span> (prev != up_to) {</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a88a93be7370ff1f4c043fb335c8aac7c">Var</a>(prev)->Contains(to_move) && <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a88a93be7370ff1f4c043fb335c8aac7c">Var</a>(to_move)->Contains(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)) {</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a625a8523af421e43b7ac500b934e7dbd">MoveChain</a>(before_to_move, to_move, prev);</div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="keywordflow">return</span> up_to;</div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> }</div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> prev = <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a5f9e1016a5bb6a7d5cded8599a50fce1">Next</a>(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> }</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a88a93be7370ff1f4c043fb335c8aac7c">Var</a>(prev)->Contains(to_move)) {</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a625a8523af421e43b7ac500b934e7dbd">MoveChain</a>(before_to_move, to_move, prev);</div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="keywordflow">return</span> to_move;</div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> }</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="keywordflow">return</span> kNoChange;</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span>}</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> </div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_make_pair_active_operator.html#a86507a34f9b1d96c7d2358c4c0894fb7"> 108</a></span><a class="code hl_function" href="classoperations__research_1_1_make_pair_active_operator.html#a86507a34f9b1d96c7d2358c4c0894fb7">MakePairActiveOperator::MakePairActiveOperator</a>(</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="keyword">const</span> std::vector<IntVar*>& secondary_vars,</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> std::function<<span class="keywordtype">int</span>(int64_t)> start_empty_path_class,</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research.html#aef7db0bee0a22d1791d040fd3853f3b7">RoutingIndexPairs</a>& pairs)</div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> : <a class="code hl_class" href="classoperations__research_1_1_path_operator.html">PathOperator</a>(vars, secondary_vars, 2, false, true,</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <a class="code hl_namespace" href="namespacestd.html">std</a>::move(start_empty_path_class)),</div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> inactive_pair_(0),</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> inactive_pair_first_index_(0),</div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> inactive_pair_second_index_(0),</div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> pairs_(pairs) {}</div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> </div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_make_pair_active_operator.html#ad14cde260686e5b4174e691675df3139"> 120</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_make_pair_active_operator.html#ad14cde260686e5b4174e691675df3139">MakePairActiveOperator::MakeOneNeighbor</a>() {</div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="keywordflow">while</span> (inactive_pair_ < pairs_.size()) {</div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ad14cde260686e5b4174e691675df3139">PathOperator::MakeOneNeighbor</a>()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab661b8d8259dac8444804d91809fbb0a">ResetPosition</a>();</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="keywordflow">if</span> (inactive_pair_first_index_ < pairs_[inactive_pair_].first.size() - 1) {</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> ++inactive_pair_first_index_;</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (inactive_pair_second_index_ <</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> pairs_[inactive_pair_].second.size() - 1) {</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> inactive_pair_first_index_ = 0;</div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> ++inactive_pair_second_index_;</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> inactive_pair_ = FindNextInactivePair(inactive_pair_ + 1);</div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> inactive_pair_first_index_ = 0;</div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> inactive_pair_second_index_ = 0;</div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> }</div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> }</div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span>}</div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> </div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_make_pair_active_operator.html#a24ea165f00f8e15de94958fc804ff209"> 139</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_make_pair_active_operator.html#a24ea165f00f8e15de94958fc804ff209">MakePairActiveOperator::MakeNeighbor</a>() {</div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a027b0d17fd972bee95a8023e7d4f81c9">StartNode</a>(0), <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a027b0d17fd972bee95a8023e7d4f81c9">StartNode</a>(1));</div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <span class="comment">// Inserting the second node of the pair before the first one which ensures</span></div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="comment">// that the only solutions where both nodes are next to each other have the</span></div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <span class="comment">// first node before the second (the move is not symmetric and doing it this</span></div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="comment">// way ensures that a potential precedence constraint between the nodes of the</span></div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="comment">// pair is not violated).</span></div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a683f9daa3c8c8d6695ed277a470942f5">MakeActive</a>(pairs_[inactive_pair_].second[inactive_pair_second_index_],</div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(1)) &&</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a683f9daa3c8c8d6695ed277a470942f5">MakeActive</a>(pairs_[inactive_pair_].first[inactive_pair_first_index_],</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(0));</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> </div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_make_pair_active_operator.html#a22efab68fd4a93ad85101ceffb01134b"> 152</a></span>int64_t <a class="code hl_function" href="classoperations__research_1_1_make_pair_active_operator.html#a22efab68fd4a93ad85101ceffb01134b">MakePairActiveOperator::GetBaseNodeRestartPosition</a>(<span class="keywordtype">int</span> base_index) {</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="comment">// Base node 1 must be after base node 0 if they are both on the same path.</span></div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="keywordflow">if</span> (base_index == 0 || <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a027b0d17fd972bee95a8023e7d4f81c9">StartNode</a>(base_index) != <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a027b0d17fd972bee95a8023e7d4f81c9">StartNode</a>(base_index - 1)) {</div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a027b0d17fd972bee95a8023e7d4f81c9">StartNode</a>(base_index);</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(base_index - 1);</div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> }</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="l00161" name="l00161"></a><span class="lineno"> 161</span><span class="keywordtype">void</span> MakePairActiveOperator::OnNodeInitialization() {</div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> inactive_pair_ = FindNextInactivePair(0);</div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> inactive_pair_first_index_ = 0;</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> inactive_pair_second_index_ = 0;</div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span>}</div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> </div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span><span class="keywordtype">int</span> MakePairActiveOperator::FindNextInactivePair(<span class="keywordtype">int</span> pair_index)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = pair_index; <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < pairs_.size(); ++<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="keywordflow">if</span> (!ContainsActiveNodes(pairs_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].first) &&</div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> !ContainsActiveNodes(pairs_[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].second)) {</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> }</div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> }</div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="keywordflow">return</span> pairs_.size();</div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span>}</div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> </div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span><span class="keywordtype">bool</span> MakePairActiveOperator::ContainsActiveNodes(</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <span class="keyword">const</span> std::vector<int64_t>& <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="keywordflow">for</span> (int64_t node : <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>) {</div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a03283bdc4a6447ff4882cb1e42662b00">IsInactive</a>(node)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> }</div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span>}</div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> </div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_make_pair_inactive_operator.html#a02e944adb48953a4d4c8200287a14d37"> 185</a></span><a class="code hl_function" href="classoperations__research_1_1_make_pair_inactive_operator.html#a02e944adb48953a4d4c8200287a14d37">MakePairInactiveOperator::MakePairInactiveOperator</a>(</div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="keyword">const</span> std::vector<IntVar*>& secondary_vars,</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> std::function<<span class="keywordtype">int</span>(int64_t)> start_empty_path_class,</div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research.html#aef7db0bee0a22d1791d040fd3853f3b7">RoutingIndexPairs</a>& index_pairs)</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> : <a class="code hl_class" href="classoperations__research_1_1_path_operator.html">PathOperator</a>(vars, secondary_vars, 1, true, false,</div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <a class="code hl_namespace" href="namespacestd.html">std</a>::move(start_empty_path_class)) {</div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a97cd8657e86644c1fb1b3b9f12ddc596">AddPairAlternativeSets</a>(index_pairs);</div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span>}</div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> </div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_make_pair_inactive_operator.html#a24ea165f00f8e15de94958fc804ff209"> 195</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_make_pair_inactive_operator.html#a24ea165f00f8e15de94958fc804ff209">MakePairInactiveOperator::MakeNeighbor</a>() {</div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> <span class="keyword">const</span> int64_t base = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(0);</div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> <span class="keyword">const</span> int64_t first_index = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a5f9e1016a5bb6a7d5cded8599a50fce1">Next</a>(base);</div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <span class="keyword">const</span> int64_t second_index = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa2ea96360ac4370b31fc72090b55e7cc">GetActiveAlternativeSibling</a>(first_index);</div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> <span class="keywordflow">if</span> (second_index < 0) {</div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> }</div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aff25e92fae946063c5a4a786e58e37a2">MakeChainInactive</a>(base, first_index) &&</div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aff25e92fae946063c5a4a786e58e37a2">MakeChainInactive</a>(<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa14dad2d86c18296f9a5227b87d5caad">Prev</a>(second_index), second_index);</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span>}</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> </div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_pair_relocate_operator.html#adc94da037635aa653d2f68388f199086"> 206</a></span><a class="code hl_function" href="classoperations__research_1_1_pair_relocate_operator.html#adc94da037635aa653d2f68388f199086">PairRelocateOperator::PairRelocateOperator</a>(</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> <span class="keyword">const</span> std::vector<IntVar*>& secondary_vars,</div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> std::function<<span class="keywordtype">int</span>(int64_t)> start_empty_path_class,</div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research.html#aef7db0bee0a22d1791d040fd3853f3b7">RoutingIndexPairs</a>& index_pairs)</div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> : <a class="code hl_class" href="classoperations__research_1_1_path_operator.html">PathOperator</a>(vars, secondary_vars, 3, true, false,</div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> <a class="code hl_namespace" href="namespacestd.html">std</a>::move(start_empty_path_class)) {</div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a97cd8657e86644c1fb1b3b9f12ddc596">AddPairAlternativeSets</a>(index_pairs);</div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span>}</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> </div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_pair_relocate_operator.html#a24ea165f00f8e15de94958fc804ff209"> 216</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_pair_relocate_operator.html#a24ea165f00f8e15de94958fc804ff209">PairRelocateOperator::MakeNeighbor</a>() {</div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a027b0d17fd972bee95a8023e7d4f81c9">StartNode</a>(1), <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a027b0d17fd972bee95a8023e7d4f81c9">StartNode</a>(2));</div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> <span class="keyword">const</span> int64_t first_pair_node = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(kPairFirstNode);</div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a17bdf687f4bf47cb68ea163f28876608">IsPathStart</a>(first_pair_node)) {</div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> }</div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> int64_t first_prev = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa14dad2d86c18296f9a5227b87d5caad">Prev</a>(first_pair_node);</div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> <span class="keyword">const</span> <span class="keywordtype">int</span> second_pair_node = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa2ea96360ac4370b31fc72090b55e7cc">GetActiveAlternativeSibling</a>(first_pair_node);</div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> <span class="keywordflow">if</span> (second_pair_node < 0 || <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a4f36c21ecd69ac0eda49cd44375e88b4">IsPathEnd</a>(second_pair_node) ||</div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a17bdf687f4bf47cb68ea163f28876608">IsPathStart</a>(second_pair_node)) {</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> }</div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> <span class="keyword">const</span> int64_t second_prev = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa14dad2d86c18296f9a5227b87d5caad">Prev</a>(second_pair_node);</div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> </div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <span class="keyword">const</span> int64_t first_node_destination = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(kPairFirstNodeDestination);</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> <span class="keywordflow">if</span> (first_node_destination == second_pair_node) {</div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <span class="comment">// The second_pair_node -> first_pair_node link is forbidden.</span></div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> }</div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> </div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> <span class="keyword">const</span> int64_t second_node_destination = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(kPairSecondNodeDestination);</div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> <span class="keywordflow">if</span> (second_prev == first_pair_node && first_node_destination == first_prev &&</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> second_node_destination == first_prev) {</div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> <span class="comment">// If the current sequence is first_prev -> first_pair_node -></span></div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> <span class="comment">// second_pair_node, and both 1st and 2nd are moved both to prev, the result</span></div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> <span class="comment">// of the move will be first_prev -> first_pair_node -> second_pair_node,</span></div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> <span class="comment">// which is no move.</span></div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> }</div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> </div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> <span class="comment">// Relocation is successful if both moves are feasible and at least one of the</span></div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> <span class="comment">// nodes moves.</span></div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> <span class="keywordflow">if</span> (second_pair_node == second_node_destination ||</div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> first_pair_node == first_node_destination) {</div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> }</div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> moved_second_pair_node =</div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a625a8523af421e43b7ac500b934e7dbd">MoveChain</a>(second_prev, second_pair_node, second_node_destination);</div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> <span class="comment">// Explictly calling Prev as second_pair_node might have been moved before</span></div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> <span class="comment">// first_pair_node.</span></div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> moved_first_pair_node =</div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a625a8523af421e43b7ac500b934e7dbd">MoveChain</a>(<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa14dad2d86c18296f9a5227b87d5caad">Prev</a>(first_pair_node), first_pair_node, first_node_destination);</div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> <span class="comment">// Swapping alternatives in.</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_path_operator.html#ab5ccf1d0572985fd266702a181b9cf8d">SwapActiveAndInactive</a>(second_pair_node,</div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a9f9007781da398bc03b61ab99864295c">BaseSiblingAlternativeNode</a>(kPairFirstNode));</div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab5ccf1d0572985fd266702a181b9cf8d">SwapActiveAndInactive</a>(first_pair_node, <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ac94bcebc6d1699e2292cf5fb56970a80">BaseAlternativeNode</a>(kPairFirstNode));</div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> <span class="keywordflow">return</span> moved_first_pair_node || moved_second_pair_node;</div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span>}</div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> </div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_pair_relocate_operator.html#a22efab68fd4a93ad85101ceffb01134b"> 265</a></span>int64_t <a class="code hl_function" href="classoperations__research_1_1_pair_relocate_operator.html#a22efab68fd4a93ad85101ceffb01134b">PairRelocateOperator::GetBaseNodeRestartPosition</a>(<span class="keywordtype">int</span> base_index) {</div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> <span class="comment">// Destination node of the second node of a pair must be after the</span></div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> <span class="comment">// destination node of the first node of a pair.</span></div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> <span class="keywordflow">if</span> (base_index == kPairSecondNodeDestination) {</div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(kPairFirstNodeDestination);</div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a027b0d17fd972bee95a8023e7d4f81c9">StartNode</a>(base_index);</div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> }</div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span>}</div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> </div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_light_pair_relocate_operator.html#abbb14cebfe6adf36fb5a9c6a30768080"> 275</a></span><a class="code hl_function" href="classoperations__research_1_1_light_pair_relocate_operator.html#abbb14cebfe6adf36fb5a9c6a30768080">LightPairRelocateOperator::LightPairRelocateOperator</a>(</div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> <span class="keyword">const</span> std::vector<IntVar*>& secondary_vars,</div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> std::function<<span class="keywordtype">int</span>(int64_t)> start_empty_path_class,</div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research.html#aef7db0bee0a22d1791d040fd3853f3b7">RoutingIndexPairs</a>& index_pairs)</div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> : <a class="code hl_class" href="classoperations__research_1_1_path_operator.html">PathOperator</a>(vars, secondary_vars, 2, true, false,</div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> <a class="code hl_namespace" href="namespacestd.html">std</a>::move(start_empty_path_class)) {</div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a97cd8657e86644c1fb1b3b9f12ddc596">AddPairAlternativeSets</a>(index_pairs);</div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span>}</div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> </div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_light_pair_relocate_operator.html#a24ea165f00f8e15de94958fc804ff209"> 285</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_light_pair_relocate_operator.html#a24ea165f00f8e15de94958fc804ff209">LightPairRelocateOperator::MakeNeighbor</a>() {</div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> <span class="keyword">const</span> int64_t prev1 = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(0);</div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <span class="keyword">const</span> int64_t node1 = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a5f9e1016a5bb6a7d5cded8599a50fce1">Next</a>(prev1);</div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a4f36c21ecd69ac0eda49cd44375e88b4">IsPathEnd</a>(node1)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> <span class="keyword">const</span> int64_t sibling1 = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa2ea96360ac4370b31fc72090b55e7cc">GetActiveAlternativeSibling</a>(node1);</div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> <span class="keywordflow">if</span> (sibling1 == -1) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> <span class="keyword">const</span> int64_t node2 = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(1);</div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> <span class="keywordflow">if</span> (node2 == sibling1) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> <span class="keyword">const</span> int64_t sibling2 = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa2ea96360ac4370b31fc72090b55e7cc">GetActiveAlternativeSibling</a>(node2);</div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> <span class="keywordflow">if</span> (sibling2 == -1) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> <span class="comment">// Note: MoveChain will return false if it is a no-op (moving the chain to its</span></div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> <span class="comment">// current position). However we want to accept the move if at least node1 or</span></div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> <span class="comment">// sibling1 gets moved to a new position. Therefore we want to be sure both</span></div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> <span class="comment">// MoveChains are called and at least one succeeds.</span></div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> ok = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a625a8523af421e43b7ac500b934e7dbd">MoveChain</a>(prev1, node1, node2);</div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a625a8523af421e43b7ac500b934e7dbd">MoveChain</a>(<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa14dad2d86c18296f9a5227b87d5caad">Prev</a>(sibling1), sibling1, sibling2) || ok;</div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span>}</div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> </div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_pair_exchange_operator.html#a42806d77eaa1134f2c10d4e8d3eb8612"> 303</a></span><a class="code hl_function" href="classoperations__research_1_1_pair_exchange_operator.html#a42806d77eaa1134f2c10d4e8d3eb8612">PairExchangeOperator::PairExchangeOperator</a>(</div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> <span class="keyword">const</span> std::vector<IntVar*>& secondary_vars,</div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> std::function<<span class="keywordtype">int</span>(int64_t)> start_empty_path_class,</div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research.html#aef7db0bee0a22d1791d040fd3853f3b7">RoutingIndexPairs</a>& index_pairs)</div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> : <a class="code hl_class" href="classoperations__research_1_1_path_operator.html">PathOperator</a>(vars, secondary_vars, 2, true, true,</div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> <a class="code hl_namespace" href="namespacestd.html">std</a>::move(start_empty_path_class)) {</div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a97cd8657e86644c1fb1b3b9f12ddc596">AddPairAlternativeSets</a>(index_pairs);</div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span>}</div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> </div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_pair_exchange_operator.html#a24ea165f00f8e15de94958fc804ff209"> 313</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_pair_exchange_operator.html#a24ea165f00f8e15de94958fc804ff209">PairExchangeOperator::MakeNeighbor</a>() {</div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> <span class="keyword">const</span> int64_t node1 = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(0);</div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> int64_t prev1, sibling1, sibling_prev1 = -1;</div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> <span class="keywordflow">if</span> (!GetPreviousAndSibling(node1, &prev1, &sibling1, &sibling_prev1)) {</div>
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</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> <span class="keyword">const</span> int64_t node2 = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(1);</div>
|
|
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> int64_t prev2, sibling2, sibling_prev2 = -1;</div>
|
|
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> <span class="keywordflow">if</span> (!GetPreviousAndSibling(node2, &prev2, &sibling2, &sibling_prev2)) {</div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> }</div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> <span class="keywordtype">bool</span> <a class="code hl_variable" href="g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d">status</a> = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> <span class="comment">// Exchanging node1 and node2.</span></div>
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> <span class="keywordflow">if</span> (node1 == prev2) {</div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> <a class="code hl_variable" href="g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d">status</a> = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a625a8523af421e43b7ac500b934e7dbd">MoveChain</a>(prev2, node2, prev1);</div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> <span class="keywordflow">if</span> (sibling_prev1 == node2) sibling_prev1 = node1;</div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> <span class="keywordflow">if</span> (sibling_prev2 == node2) sibling_prev2 = node1;</div>
|
|
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (node2 == prev1) {</div>
|
|
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span> <a class="code hl_variable" href="g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d">status</a> = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a625a8523af421e43b7ac500b934e7dbd">MoveChain</a>(prev1, node1, prev2);</div>
|
|
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span> <span class="keywordflow">if</span> (sibling_prev1 == node1) sibling_prev1 = node2;</div>
|
|
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span> <span class="keywordflow">if</span> (sibling_prev2 == node1) sibling_prev2 = node2;</div>
|
|
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> <a class="code hl_variable" href="g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d">status</a> = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a625a8523af421e43b7ac500b934e7dbd">MoveChain</a>(prev1, node1, node2) && <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a625a8523af421e43b7ac500b934e7dbd">MoveChain</a>(prev2, node2, prev1);</div>
|
|
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> <span class="keywordflow">if</span> (sibling_prev1 == node1) {</div>
|
|
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> sibling_prev1 = node2;</div>
|
|
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (sibling_prev1 == node2) {</div>
|
|
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> sibling_prev1 = node1;</div>
|
|
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> }</div>
|
|
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> <span class="keywordflow">if</span> (sibling_prev2 == node1) {</div>
|
|
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> sibling_prev2 = node2;</div>
|
|
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (sibling_prev2 == node2) {</div>
|
|
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> sibling_prev2 = node1;</div>
|
|
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> }</div>
|
|
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> }</div>
|
|
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d">status</a>) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> <span class="comment">// Exchanging sibling1 and sibling2.</span></div>
|
|
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> <span class="keywordflow">if</span> (sibling1 == sibling_prev2) {</div>
|
|
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> <a class="code hl_variable" href="g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d">status</a> = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a625a8523af421e43b7ac500b934e7dbd">MoveChain</a>(sibling_prev2, sibling2, sibling_prev1);</div>
|
|
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (sibling2 == sibling_prev1) {</div>
|
|
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> <a class="code hl_variable" href="g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d">status</a> = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a625a8523af421e43b7ac500b934e7dbd">MoveChain</a>(sibling_prev1, sibling1, sibling_prev2);</div>
|
|
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span> <a class="code hl_variable" href="g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d">status</a> = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a625a8523af421e43b7ac500b934e7dbd">MoveChain</a>(sibling_prev1, sibling1, sibling2) &&</div>
|
|
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a625a8523af421e43b7ac500b934e7dbd">MoveChain</a>(sibling_prev2, sibling2, sibling_prev1);</div>
|
|
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> }</div>
|
|
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> <span class="comment">// Swapping alternatives in.</span></div>
|
|
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab5ccf1d0572985fd266702a181b9cf8d">SwapActiveAndInactive</a>(sibling1, <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a9f9007781da398bc03b61ab99864295c">BaseSiblingAlternativeNode</a>(0));</div>
|
|
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab5ccf1d0572985fd266702a181b9cf8d">SwapActiveAndInactive</a>(node1, <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ac94bcebc6d1699e2292cf5fb56970a80">BaseAlternativeNode</a>(0));</div>
|
|
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab5ccf1d0572985fd266702a181b9cf8d">SwapActiveAndInactive</a>(sibling2, <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a9f9007781da398bc03b61ab99864295c">BaseSiblingAlternativeNode</a>(1));</div>
|
|
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab5ccf1d0572985fd266702a181b9cf8d">SwapActiveAndInactive</a>(node2, <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ac94bcebc6d1699e2292cf5fb56970a80">BaseAlternativeNode</a>(1));</div>
|
|
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d">status</a>;</div>
|
|
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span>}</div>
|
|
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> </div>
|
|
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span><span class="keywordtype">bool</span> PairExchangeOperator::GetPreviousAndSibling(</div>
|
|
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> int64_t node, int64_t* previous, int64_t* sibling,</div>
|
|
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> int64_t* sibling_previous)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a17bdf687f4bf47cb68ea163f28876608">IsPathStart</a>(node)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> *previous = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa14dad2d86c18296f9a5227b87d5caad">Prev</a>(node);</div>
|
|
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> *sibling = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa2ea96360ac4370b31fc72090b55e7cc">GetActiveAlternativeSibling</a>(node);</div>
|
|
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> *sibling_previous = *sibling >= 0 ? <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa14dad2d86c18296f9a5227b87d5caad">Prev</a>(*sibling) : -1;</div>
|
|
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> <span class="keywordflow">return</span> *sibling_previous >= 0;</div>
|
|
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span>}</div>
|
|
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> </div>
|
|
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_pair_exchange_relocate_operator.html#a39c490e9305bd7dd5ea6eb3387bc0078"> 375</a></span><a class="code hl_function" href="classoperations__research_1_1_pair_exchange_relocate_operator.html#a39c490e9305bd7dd5ea6eb3387bc0078">PairExchangeRelocateOperator::PairExchangeRelocateOperator</a>(</div>
|
|
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> <span class="keyword">const</span> std::vector<IntVar*>& secondary_vars,</div>
|
|
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> std::function<<span class="keywordtype">int</span>(int64_t)> start_empty_path_class,</div>
|
|
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research.html#aef7db0bee0a22d1791d040fd3853f3b7">RoutingIndexPairs</a>& index_pairs)</div>
|
|
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span> : <a class="code hl_class" href="classoperations__research_1_1_path_operator.html">PathOperator</a>(vars, secondary_vars, 6, true, false,</div>
|
|
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span> <a class="code hl_namespace" href="namespacestd.html">std</a>::move(start_empty_path_class)) {</div>
|
|
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a97cd8657e86644c1fb1b3b9f12ddc596">AddPairAlternativeSets</a>(index_pairs);</div>
|
|
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span>}</div>
|
|
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span> </div>
|
|
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_pair_exchange_relocate_operator.html#a24ea165f00f8e15de94958fc804ff209"> 385</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_pair_exchange_relocate_operator.html#a24ea165f00f8e15de94958fc804ff209">PairExchangeRelocateOperator::MakeNeighbor</a>() {</div>
|
|
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a027b0d17fd972bee95a8023e7d4f81c9">StartNode</a>(kSecondPairFirstNodeDestination),</div>
|
|
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a027b0d17fd972bee95a8023e7d4f81c9">StartNode</a>(kSecondPairSecondNodeDestination));</div>
|
|
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a027b0d17fd972bee95a8023e7d4f81c9">StartNode</a>(kSecondPairFirstNode),</div>
|
|
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a027b0d17fd972bee95a8023e7d4f81c9">StartNode</a>(kFirstPairFirstNodeDestination));</div>
|
|
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a027b0d17fd972bee95a8023e7d4f81c9">StartNode</a>(kSecondPairFirstNode),</div>
|
|
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a027b0d17fd972bee95a8023e7d4f81c9">StartNode</a>(kFirstPairSecondNodeDestination));</div>
|
|
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> </div>
|
|
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a027b0d17fd972bee95a8023e7d4f81c9">StartNode</a>(kFirstPairFirstNode) == <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a027b0d17fd972bee95a8023e7d4f81c9">StartNode</a>(kSecondPairFirstNode)) {</div>
|
|
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aec4cb9ff1023933f7c5570a65a7208e7">SetNextBaseToIncrement</a>(kSecondPairFirstNode);</div>
|
|
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</span> }</div>
|
|
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span> <span class="comment">// Through this method, <base>[X][Y] represent the <base> variable for the</span></div>
|
|
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span> <span class="comment">// node Y of pair X. <base> is in node, prev, dest.</span></div>
|
|
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span> int64_t <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>[2][2];</div>
|
|
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span> int64_t prev[2][2];</div>
|
|
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span> int64_t dest[2][2];</div>
|
|
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>[0][0] = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(kFirstPairFirstNode);</div>
|
|
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>[1][0] = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(kSecondPairFirstNode);</div>
|
|
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>[1][0] <= <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>[0][0]) {</div>
|
|
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> <span class="comment">// Exchange is symetric.</span></div>
|
|
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aec4cb9ff1023933f7c5570a65a7208e7">SetNextBaseToIncrement</a>(kSecondPairFirstNode);</div>
|
|
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span> }</div>
|
|
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> <span class="keywordflow">if</span> (!GetPreviousAndSibling(<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>[0][0], &prev[0][0], &<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>[0][1],</div>
|
|
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span> &prev[0][1])) {</div>
|
|
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aec4cb9ff1023933f7c5570a65a7208e7">SetNextBaseToIncrement</a>(kFirstPairFirstNode);</div>
|
|
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span> }</div>
|
|
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"> 414</span> <span class="keywordflow">if</span> (!GetPreviousAndSibling(<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>[1][0], &prev[1][0], &<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>[1][1],</div>
|
|
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"> 415</span> &prev[1][1])) {</div>
|
|
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aec4cb9ff1023933f7c5570a65a7208e7">SetNextBaseToIncrement</a>(kSecondPairFirstNode);</div>
|
|
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno"> 418</span> }</div>
|
|
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"> 419</span> </div>
|
|
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span> <span class="keywordflow">if</span> (!LoadAndCheckDest(0, 0, kFirstPairFirstNodeDestination, <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, dest)) {</div>
|
|
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aec4cb9ff1023933f7c5570a65a7208e7">SetNextBaseToIncrement</a>(kFirstPairFirstNodeDestination);</div>
|
|
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno"> 422</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno"> 423</span> }</div>
|
|
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno"> 424</span> <span class="keywordflow">if</span> (!LoadAndCheckDest(0, 1, kFirstPairSecondNodeDestination, <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, dest)) {</div>
|
|
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno"> 425</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aec4cb9ff1023933f7c5570a65a7208e7">SetNextBaseToIncrement</a>(kFirstPairSecondNodeDestination);</div>
|
|
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno"> 426</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno"> 427</span> }</div>
|
|
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno"> 428</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a027b0d17fd972bee95a8023e7d4f81c9">StartNode</a>(kSecondPairFirstNodeDestination) !=</div>
|
|
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a027b0d17fd972bee95a8023e7d4f81c9">StartNode</a>(kFirstPairFirstNode) ||</div>
|
|
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> !LoadAndCheckDest(1, 0, kSecondPairFirstNodeDestination, <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, dest)) {</div>
|
|
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aec4cb9ff1023933f7c5570a65a7208e7">SetNextBaseToIncrement</a>(kSecondPairFirstNodeDestination);</div>
|
|
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> }</div>
|
|
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> <span class="keywordflow">if</span> (!LoadAndCheckDest(1, 1, kSecondPairSecondNodeDestination, <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, dest)) {</div>
|
|
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aec4cb9ff1023933f7c5570a65a7208e7">SetNextBaseToIncrement</a>(kSecondPairSecondNodeDestination);</div>
|
|
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno"> 436</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno"> 437</span> }</div>
|
|
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno"> 438</span> </div>
|
|
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno"> 439</span> <span class="keywordflow">if</span> (!MoveNode(0, 1, <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, dest, prev)) {</div>
|
|
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno"> 440</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aec4cb9ff1023933f7c5570a65a7208e7">SetNextBaseToIncrement</a>(kFirstPairSecondNodeDestination);</div>
|
|
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno"> 441</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno"> 442</span> }</div>
|
|
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno"> 443</span> <span class="keywordflow">if</span> (!MoveNode(0, 0, <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, dest, prev)) {</div>
|
|
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"> 444</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aec4cb9ff1023933f7c5570a65a7208e7">SetNextBaseToIncrement</a>(kFirstPairSecondNodeDestination);</div>
|
|
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"> 445</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"> 446</span> }</div>
|
|
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno"> 447</span> <span class="keywordflow">if</span> (!MoveNode(1, 1, <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, dest, prev)) {</div>
|
|
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno"> 448</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno"> 449</span> }</div>
|
|
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno"> 450</span> <span class="keywordflow">if</span> (!MoveNode(1, 0, <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, dest, prev)) {</div>
|
|
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno"> 451</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno"> 452</span> }</div>
|
|
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno"> 453</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno"> 454</span>}</div>
|
|
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno"> 455</span> </div>
|
|
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno"> 456</span><span class="keywordtype">bool</span> PairExchangeRelocateOperator::MoveNode(<span class="keywordtype">int</span> pair, <span class="keywordtype">int</span> node,</div>
|
|
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"> 457</span> int64_t <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>[2][2],</div>
|
|
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"> 458</span> int64_t dest[2][2],</div>
|
|
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno"> 459</span> int64_t prev[2][2]) {</div>
|
|
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"> 460</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a625a8523af421e43b7ac500b934e7dbd">MoveChain</a>(prev[pair][node], <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>[pair][node], dest[pair][node])) {</div>
|
|
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno"> 461</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> }</div>
|
|
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span> <span class="comment">// Update the other pair if needed.</span></div>
|
|
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno"> 464</span> <span class="keywordflow">if</span> (prev[1 - pair][0] == dest[pair][node]) {</div>
|
|
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span> prev[1 - pair][0] = <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>[pair][node];</div>
|
|
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> }</div>
|
|
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span> <span class="keywordflow">if</span> (prev[1 - pair][1] == dest[pair][node]) {</div>
|
|
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span> prev[1 - pair][1] = <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>[pair][node];</div>
|
|
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno"> 469</span> }</div>
|
|
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno"> 470</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno"> 471</span>}</div>
|
|
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno"> 472</span> </div>
|
|
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno"> 473</span><span class="keywordtype">bool</span> PairExchangeRelocateOperator::LoadAndCheckDest(<span class="keywordtype">int</span> pair, <span class="keywordtype">int</span> node,</div>
|
|
<div class="line"><a id="l00474" name="l00474"></a><span class="lineno"> 474</span> int64_t base_node,</div>
|
|
<div class="line"><a id="l00475" name="l00475"></a><span class="lineno"> 475</span> int64_t <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>[2][2],</div>
|
|
<div class="line"><a id="l00476" name="l00476"></a><span class="lineno"> 476</span> int64_t dest[2][2])<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno"> 477</span> dest[pair][node] = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(base_node);</div>
|
|
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno"> 478</span> <span class="comment">// A destination cannot be a node that will be moved.</span></div>
|
|
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno"> 479</span> <span class="keywordflow">return</span> !(<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>[0][0] == dest[pair][node] || <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>[0][1] == dest[pair][node] ||</div>
|
|
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno"> 480</span> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>[1][0] == dest[pair][node] || <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>[1][1] == dest[pair][node]);</div>
|
|
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno"> 481</span>}</div>
|
|
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno"> 482</span> </div>
|
|
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_pair_exchange_relocate_operator.html#aeb4fe30538ba848f88b1657accd934c6"> 483</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_pair_exchange_relocate_operator.html#aeb4fe30538ba848f88b1657accd934c6">PairExchangeRelocateOperator::OnSamePathAsPreviousBase</a>(</div>
|
|
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno"> 484</span> int64_t base_index) {</div>
|
|
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno"> 485</span> <span class="comment">// Ensuring the destination of the first pair is on the route of the second.</span></div>
|
|
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno"> 486</span> <span class="comment">// pair.</span></div>
|
|
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno"> 487</span> <span class="comment">// Ensuring that destination of both nodes of a pair are on the same route.</span></div>
|
|
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno"> 488</span> <span class="keywordflow">return</span> base_index == kFirstPairFirstNodeDestination ||</div>
|
|
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno"> 489</span> base_index == kFirstPairSecondNodeDestination ||</div>
|
|
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno"> 490</span> base_index == kSecondPairSecondNodeDestination;</div>
|
|
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno"> 491</span>}</div>
|
|
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno"> 492</span> </div>
|
|
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_pair_exchange_relocate_operator.html#a22efab68fd4a93ad85101ceffb01134b"> 493</a></span>int64_t <a class="code hl_function" href="classoperations__research_1_1_pair_exchange_relocate_operator.html#a22efab68fd4a93ad85101ceffb01134b">PairExchangeRelocateOperator::GetBaseNodeRestartPosition</a>(</div>
|
|
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno"> 494</span> <span class="keywordtype">int</span> base_index) {</div>
|
|
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno"> 495</span> <span class="keywordflow">if</span> (base_index == kFirstPairSecondNodeDestination ||</div>
|
|
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno"> 496</span> base_index == kSecondPairSecondNodeDestination) {</div>
|
|
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno"> 497</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(base_index - 1);</div>
|
|
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"> 498</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno"> 499</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a027b0d17fd972bee95a8023e7d4f81c9">StartNode</a>(base_index);</div>
|
|
<div class="line"><a id="l00500" name="l00500"></a><span class="lineno"> 500</span> }</div>
|
|
<div class="line"><a id="l00501" name="l00501"></a><span class="lineno"> 501</span>}</div>
|
|
<div class="line"><a id="l00502" name="l00502"></a><span class="lineno"> 502</span> </div>
|
|
<div class="line"><a id="l00503" name="l00503"></a><span class="lineno"> 503</span><span class="keywordtype">bool</span> PairExchangeRelocateOperator::GetPreviousAndSibling(</div>
|
|
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno"> 504</span> int64_t node, int64_t* previous, int64_t* sibling,</div>
|
|
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno"> 505</span> int64_t* sibling_previous)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno"> 506</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a17bdf687f4bf47cb68ea163f28876608">IsPathStart</a>(node)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00507" name="l00507"></a><span class="lineno"> 507</span> *previous = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa14dad2d86c18296f9a5227b87d5caad">Prev</a>(node);</div>
|
|
<div class="line"><a id="l00508" name="l00508"></a><span class="lineno"> 508</span> *sibling = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa2ea96360ac4370b31fc72090b55e7cc">GetActiveAlternativeSibling</a>(node);</div>
|
|
<div class="line"><a id="l00509" name="l00509"></a><span class="lineno"> 509</span> *sibling_previous = *sibling >= 0 ? <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa14dad2d86c18296f9a5227b87d5caad">Prev</a>(*sibling) : -1;</div>
|
|
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno"> 510</span> <span class="keywordflow">return</span> *sibling_previous >= 0;</div>
|
|
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno"> 511</span>}</div>
|
|
<div class="line"><a id="l00512" name="l00512"></a><span class="lineno"> 512</span> </div>
|
|
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_swap_index_pair_operator.html#a622930b6b2a33027ce29a1bd5074792c"> 513</a></span><a class="code hl_function" href="classoperations__research_1_1_swap_index_pair_operator.html#a622930b6b2a33027ce29a1bd5074792c">SwapIndexPairOperator::SwapIndexPairOperator</a>(</div>
|
|
<div class="line"><a id="l00514" name="l00514"></a><span class="lineno"> 514</span> <span class="keyword">const</span> std::vector<IntVar*>& vars, <span class="keyword">const</span> std::vector<IntVar*>& path_vars,</div>
|
|
<div class="line"><a id="l00515" name="l00515"></a><span class="lineno"> 515</span> std::function<<span class="keywordtype">int</span>(int64_t)> start_empty_path_class,</div>
|
|
<div class="line"><a id="l00516" name="l00516"></a><span class="lineno"> 516</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research.html#aef7db0bee0a22d1791d040fd3853f3b7">RoutingIndexPairs</a>& index_pairs)</div>
|
|
<div class="line"><a id="l00517" name="l00517"></a><span class="lineno"> 517</span> : <a class="code hl_class" href="classoperations__research_1_1_int_var_local_search_operator.html">IntVarLocalSearchOperator</a>(vars),</div>
|
|
<div class="line"><a id="l00518" name="l00518"></a><span class="lineno"> 518</span> index_pairs_(index_pairs),</div>
|
|
<div class="line"><a id="l00519" name="l00519"></a><span class="lineno"> 519</span> pair_index_(0),</div>
|
|
<div class="line"><a id="l00520" name="l00520"></a><span class="lineno"> 520</span> first_index_(0),</div>
|
|
<div class="line"><a id="l00521" name="l00521"></a><span class="lineno"> 521</span> second_index_(0),</div>
|
|
<div class="line"><a id="l00522" name="l00522"></a><span class="lineno"> 522</span> number_of_nexts_(vars.size()),</div>
|
|
<div class="line"><a id="l00523" name="l00523"></a><span class="lineno"> 523</span> ignore_path_vars_(path_vars.empty()) {</div>
|
|
<div class="line"><a id="l00524" name="l00524"></a><span class="lineno"> 524</span> <span class="keywordflow">if</span> (!ignore_path_vars_) {</div>
|
|
<div class="line"><a id="l00525" name="l00525"></a><span class="lineno"> 525</span> <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#ae2af73491ab2aa6804b443d442026a5e">AddVars</a>(path_vars);</div>
|
|
<div class="line"><a id="l00526" name="l00526"></a><span class="lineno"> 526</span> }</div>
|
|
<div class="line"><a id="l00527" name="l00527"></a><span class="lineno"> 527</span>}</div>
|
|
<div class="line"><a id="l00528" name="l00528"></a><span class="lineno"> 528</span> </div>
|
|
<div class="line"><a id="l00529" name="l00529"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_swap_index_pair_operator.html#a2b47576627076cc054924a89a08f69a6"> 529</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_swap_index_pair_operator.html#a2b47576627076cc054924a89a08f69a6">SwapIndexPairOperator::MakeNextNeighbor</a>(<a class="code hl_class" href="classoperations__research_1_1_assignment.html">Assignment</a>* <a class="code hl_variable" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a>,</div>
|
|
<div class="line"><a id="l00530" name="l00530"></a><span class="lineno"> 530</span> <a class="code hl_class" href="classoperations__research_1_1_assignment.html">Assignment</a>* deltadelta) {</div>
|
|
<div class="line"><a id="l00531" name="l00531"></a><span class="lineno"> 531</span> <span class="keyword">const</span> int64_t kNoPath = -1;</div>
|
|
<div class="line"><a id="l00532" name="l00532"></a><span class="lineno"> 532</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(<a class="code hl_variable" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a> != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00533" name="l00533"></a><span class="lineno"> 533</span> <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a id="l00534" name="l00534"></a><span class="lineno"> 534</span> <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a06eb05df61a9b9fce744928947f43d89">RevertChanges</a>(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00535" name="l00535"></a><span class="lineno"> 535</span> </div>
|
|
<div class="line"><a id="l00536" name="l00536"></a><span class="lineno"> 536</span> <span class="keywordflow">if</span> (pair_index_ < index_pairs_.size()) {</div>
|
|
<div class="line"><a id="l00537" name="l00537"></a><span class="lineno"> 537</span> <span class="keyword">const</span> int64_t path =</div>
|
|
<div class="line"><a id="l00538" name="l00538"></a><span class="lineno"> 538</span> ignore_path_vars_ ? 0LL : <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a3c7b6e2c172f34aad1d952d799be61f2">Value</a>(first_active_ + number_of_nexts_);</div>
|
|
<div class="line"><a id="l00539" name="l00539"></a><span class="lineno"> 539</span> <span class="keyword">const</span> int64_t prev_first = prevs_[first_active_];</div>
|
|
<div class="line"><a id="l00540" name="l00540"></a><span class="lineno"> 540</span> <span class="keyword">const</span> int64_t next_first = <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a3c7b6e2c172f34aad1d952d799be61f2">Value</a>(first_active_);</div>
|
|
<div class="line"><a id="l00541" name="l00541"></a><span class="lineno"> 541</span> <span class="comment">// Making current active "pickup" unperformed.</span></div>
|
|
<div class="line"><a id="l00542" name="l00542"></a><span class="lineno"> 542</span> SetNext(first_active_, first_active_, kNoPath);</div>
|
|
<div class="line"><a id="l00543" name="l00543"></a><span class="lineno"> 543</span> <span class="comment">// Inserting "pickup" alternative at the same position.</span></div>
|
|
<div class="line"><a id="l00544" name="l00544"></a><span class="lineno"> 544</span> <span class="keyword">const</span> int64_t insert_first =</div>
|
|
<div class="line"><a id="l00545" name="l00545"></a><span class="lineno"> 545</span> index_pairs_[pair_index_].first[first_index_];</div>
|
|
<div class="line"><a id="l00546" name="l00546"></a><span class="lineno"> 546</span> SetNext(prev_first, insert_first, path);</div>
|
|
<div class="line"><a id="l00547" name="l00547"></a><span class="lineno"> 547</span> SetNext(insert_first, next_first, path);</div>
|
|
<div class="line"><a id="l00548" name="l00548"></a><span class="lineno"> 548</span> int64_t prev_second = prevs_[second_active_];</div>
|
|
<div class="line"><a id="l00549" name="l00549"></a><span class="lineno"> 549</span> <span class="keywordflow">if</span> (prev_second == first_active_) {</div>
|
|
<div class="line"><a id="l00550" name="l00550"></a><span class="lineno"> 550</span> prev_second = insert_first;</div>
|
|
<div class="line"><a id="l00551" name="l00551"></a><span class="lineno"> 551</span> }</div>
|
|
<div class="line"><a id="l00552" name="l00552"></a><span class="lineno"> 552</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(path, ignore_path_vars_</div>
|
|
<div class="line"><a id="l00553" name="l00553"></a><span class="lineno"> 553</span> ? int64_t{0}</div>
|
|
<div class="line"><a id="l00554" name="l00554"></a><span class="lineno"> 554</span> : <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a3c7b6e2c172f34aad1d952d799be61f2">Value</a>(second_active_ + number_of_nexts_));</div>
|
|
<div class="line"><a id="l00555" name="l00555"></a><span class="lineno"> 555</span> <span class="keyword">const</span> int64_t next_second = <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a3c7b6e2c172f34aad1d952d799be61f2">Value</a>(second_active_);</div>
|
|
<div class="line"><a id="l00556" name="l00556"></a><span class="lineno"> 556</span> <span class="comment">// Making current active "delivery" unperformed.</span></div>
|
|
<div class="line"><a id="l00557" name="l00557"></a><span class="lineno"> 557</span> SetNext(second_active_, second_active_, kNoPath);</div>
|
|
<div class="line"><a id="l00558" name="l00558"></a><span class="lineno"> 558</span> <span class="comment">// Inserting "delivery" alternative at the same position.</span></div>
|
|
<div class="line"><a id="l00559" name="l00559"></a><span class="lineno"> 559</span> <span class="keyword">const</span> int64_t insert_second =</div>
|
|
<div class="line"><a id="l00560" name="l00560"></a><span class="lineno"> 560</span> index_pairs_[pair_index_].second[second_index_];</div>
|
|
<div class="line"><a id="l00561" name="l00561"></a><span class="lineno"> 561</span> SetNext(prev_second, insert_second, path);</div>
|
|
<div class="line"><a id="l00562" name="l00562"></a><span class="lineno"> 562</span> SetNext(insert_second, next_second, path);</div>
|
|
<div class="line"><a id="l00563" name="l00563"></a><span class="lineno"> 563</span> <span class="comment">// Move to next "pickup/delivery" alternative.</span></div>
|
|
<div class="line"><a id="l00564" name="l00564"></a><span class="lineno"> 564</span> ++second_index_;</div>
|
|
<div class="line"><a id="l00565" name="l00565"></a><span class="lineno"> 565</span> <span class="keywordflow">if</span> (second_index_ >= index_pairs_[pair_index_].second.size()) {</div>
|
|
<div class="line"><a id="l00566" name="l00566"></a><span class="lineno"> 566</span> second_index_ = 0;</div>
|
|
<div class="line"><a id="l00567" name="l00567"></a><span class="lineno"> 567</span> ++first_index_;</div>
|
|
<div class="line"><a id="l00568" name="l00568"></a><span class="lineno"> 568</span> <span class="keywordflow">if</span> (first_index_ >= index_pairs_[pair_index_].first.size()) {</div>
|
|
<div class="line"><a id="l00569" name="l00569"></a><span class="lineno"> 569</span> first_index_ = 0;</div>
|
|
<div class="line"><a id="l00570" name="l00570"></a><span class="lineno"> 570</span> ++pair_index_;</div>
|
|
<div class="line"><a id="l00571" name="l00571"></a><span class="lineno"> 571</span> UpdateActiveNodes();</div>
|
|
<div class="line"><a id="l00572" name="l00572"></a><span class="lineno"> 572</span> }</div>
|
|
<div class="line"><a id="l00573" name="l00573"></a><span class="lineno"> 573</span> }</div>
|
|
<div class="line"><a id="l00574" name="l00574"></a><span class="lineno"> 574</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00575" name="l00575"></a><span class="lineno"> 575</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00576" name="l00576"></a><span class="lineno"> 576</span> }</div>
|
|
<div class="line"><a id="l00577" name="l00577"></a><span class="lineno"> 577</span> </div>
|
|
<div class="line"><a id="l00578" name="l00578"></a><span class="lineno"> 578</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#aabafb6d8996f5101db26b30efff406b0">ApplyChanges</a>(<a class="code hl_variable" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a>, deltadelta)) {</div>
|
|
<div class="line"><a id="l00579" name="l00579"></a><span class="lineno"> 579</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"Delta ("</span> << <a class="code hl_function" href="classoperations__research_1_1_swap_index_pair_operator.html#aed804747c45a7e1caf81461f9e45dd91">DebugString</a>() << <span class="stringliteral">") = "</span> << <a class="code hl_variable" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a>->DebugString();</div>
|
|
<div class="line"><a id="l00580" name="l00580"></a><span class="lineno"> 580</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00581" name="l00581"></a><span class="lineno"> 581</span> }</div>
|
|
<div class="line"><a id="l00582" name="l00582"></a><span class="lineno"> 582</span> }</div>
|
|
<div class="line"><a id="l00583" name="l00583"></a><span class="lineno"> 583</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00584" name="l00584"></a><span class="lineno"> 584</span>}</div>
|
|
<div class="line"><a id="l00585" name="l00585"></a><span class="lineno"> 585</span> </div>
|
|
<div class="line"><a id="l00586" name="l00586"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_swap_index_pair_operator.html#a08ba64a7e6c6e507272f75ca518d26f5"> 586</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_swap_index_pair_operator.html#a08ba64a7e6c6e507272f75ca518d26f5">SwapIndexPairOperator::OnStart</a>() {</div>
|
|
<div class="line"><a id="l00587" name="l00587"></a><span class="lineno"> 587</span> prevs_.resize(number_of_nexts_, -1);</div>
|
|
<div class="line"><a id="l00588" name="l00588"></a><span class="lineno"> 588</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0; <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < number_of_nexts_; ++<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a id="l00589" name="l00589"></a><span class="lineno"> 589</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a3c7b6e2c172f34aad1d952d799be61f2">Value</a>(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a id="l00590" name="l00590"></a><span class="lineno"> 590</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> >= prevs_.size()) prevs_.resize(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> + 1, -1);</div>
|
|
<div class="line"><a id="l00591" name="l00591"></a><span class="lineno"> 591</span> prevs_[<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>] = <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a id="l00592" name="l00592"></a><span class="lineno"> 592</span> }</div>
|
|
<div class="line"><a id="l00593" name="l00593"></a><span class="lineno"> 593</span> pair_index_ = 0;</div>
|
|
<div class="line"><a id="l00594" name="l00594"></a><span class="lineno"> 594</span> first_index_ = 0;</div>
|
|
<div class="line"><a id="l00595" name="l00595"></a><span class="lineno"> 595</span> second_index_ = 0;</div>
|
|
<div class="line"><a id="l00596" name="l00596"></a><span class="lineno"> 596</span> first_active_ = -1;</div>
|
|
<div class="line"><a id="l00597" name="l00597"></a><span class="lineno"> 597</span> second_active_ = -1;</div>
|
|
<div class="line"><a id="l00598" name="l00598"></a><span class="lineno"> 598</span> <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a id="l00599" name="l00599"></a><span class="lineno"> 599</span> <span class="keywordflow">if</span> (!UpdateActiveNodes()) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00600" name="l00600"></a><span class="lineno"> 600</span> <span class="keywordflow">if</span> (first_active_ != -1 && second_active_ != -1) {</div>
|
|
<div class="line"><a id="l00601" name="l00601"></a><span class="lineno"> 601</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00602" name="l00602"></a><span class="lineno"> 602</span> }</div>
|
|
<div class="line"><a id="l00603" name="l00603"></a><span class="lineno"> 603</span> ++pair_index_;</div>
|
|
<div class="line"><a id="l00604" name="l00604"></a><span class="lineno"> 604</span> }</div>
|
|
<div class="line"><a id="l00605" name="l00605"></a><span class="lineno"> 605</span>}</div>
|
|
<div class="line"><a id="l00606" name="l00606"></a><span class="lineno"> 606</span> </div>
|
|
<div class="line"><a id="l00607" name="l00607"></a><span class="lineno"> 607</span><span class="keywordtype">bool</span> SwapIndexPairOperator::UpdateActiveNodes() {</div>
|
|
<div class="line"><a id="l00608" name="l00608"></a><span class="lineno"> 608</span> <span class="keywordflow">if</span> (pair_index_ < index_pairs_.size()) {</div>
|
|
<div class="line"><a id="l00609" name="l00609"></a><span class="lineno"> 609</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t first : index_pairs_[pair_index_].first) {</div>
|
|
<div class="line"><a id="l00610" name="l00610"></a><span class="lineno"> 610</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a3c7b6e2c172f34aad1d952d799be61f2">Value</a>(first) != first) {</div>
|
|
<div class="line"><a id="l00611" name="l00611"></a><span class="lineno"> 611</span> first_active_ = first;</div>
|
|
<div class="line"><a id="l00612" name="l00612"></a><span class="lineno"> 612</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00613" name="l00613"></a><span class="lineno"> 613</span> }</div>
|
|
<div class="line"><a id="l00614" name="l00614"></a><span class="lineno"> 614</span> }</div>
|
|
<div class="line"><a id="l00615" name="l00615"></a><span class="lineno"> 615</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t second : index_pairs_[pair_index_].second) {</div>
|
|
<div class="line"><a id="l00616" name="l00616"></a><span class="lineno"> 616</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a3c7b6e2c172f34aad1d952d799be61f2">Value</a>(second) != second) {</div>
|
|
<div class="line"><a id="l00617" name="l00617"></a><span class="lineno"> 617</span> second_active_ = second;</div>
|
|
<div class="line"><a id="l00618" name="l00618"></a><span class="lineno"> 618</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00619" name="l00619"></a><span class="lineno"> 619</span> }</div>
|
|
<div class="line"><a id="l00620" name="l00620"></a><span class="lineno"> 620</span> }</div>
|
|
<div class="line"><a id="l00621" name="l00621"></a><span class="lineno"> 621</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00622" name="l00622"></a><span class="lineno"> 622</span> }</div>
|
|
<div class="line"><a id="l00623" name="l00623"></a><span class="lineno"> 623</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00624" name="l00624"></a><span class="lineno"> 624</span>}</div>
|
|
<div class="line"><a id="l00625" name="l00625"></a><span class="lineno"> 625</span> </div>
|
|
<div class="line"><a id="l00626" name="l00626"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_index_pair_swap_active_operator.html#a12ab83f297096ca5fe0970e01ac7c78c"> 626</a></span><a class="code hl_function" href="classoperations__research_1_1_index_pair_swap_active_operator.html#a12ab83f297096ca5fe0970e01ac7c78c">IndexPairSwapActiveOperator::IndexPairSwapActiveOperator</a>(</div>
|
|
<div class="line"><a id="l00627" name="l00627"></a><span class="lineno"> 627</span> <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a id="l00628" name="l00628"></a><span class="lineno"> 628</span> <span class="keyword">const</span> std::vector<IntVar*>& secondary_vars,</div>
|
|
<div class="line"><a id="l00629" name="l00629"></a><span class="lineno"> 629</span> std::function<<span class="keywordtype">int</span>(int64_t)> start_empty_path_class,</div>
|
|
<div class="line"><a id="l00630" name="l00630"></a><span class="lineno"> 630</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research.html#aef7db0bee0a22d1791d040fd3853f3b7">RoutingIndexPairs</a>& index_pairs)</div>
|
|
<div class="line"><a id="l00631" name="l00631"></a><span class="lineno"> 631</span> : <a class="code hl_class" href="classoperations__research_1_1_path_operator.html">PathOperator</a>(vars, secondary_vars, 1, true, false,</div>
|
|
<div class="line"><a id="l00632" name="l00632"></a><span class="lineno"> 632</span> <a class="code hl_namespace" href="namespacestd.html">std</a>::move(start_empty_path_class)),</div>
|
|
<div class="line"><a id="l00633" name="l00633"></a><span class="lineno"> 633</span> inactive_node_(0) {</div>
|
|
<div class="line"><a id="l00634" name="l00634"></a><span class="lineno"> 634</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a97cd8657e86644c1fb1b3b9f12ddc596">AddPairAlternativeSets</a>(index_pairs);</div>
|
|
<div class="line"><a id="l00635" name="l00635"></a><span class="lineno"> 635</span>}</div>
|
|
<div class="line"><a id="l00636" name="l00636"></a><span class="lineno"> 636</span> </div>
|
|
<div class="line"><a id="l00637" name="l00637"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_index_pair_swap_active_operator.html#a2b47576627076cc054924a89a08f69a6"> 637</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_index_pair_swap_active_operator.html#a2b47576627076cc054924a89a08f69a6">IndexPairSwapActiveOperator::MakeNextNeighbor</a>(<a class="code hl_class" href="classoperations__research_1_1_assignment.html">Assignment</a>* <a class="code hl_variable" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a>,</div>
|
|
<div class="line"><a id="l00638" name="l00638"></a><span class="lineno"> 638</span> <a class="code hl_class" href="classoperations__research_1_1_assignment.html">Assignment</a>* deltadelta) {</div>
|
|
<div class="line"><a id="l00639" name="l00639"></a><span class="lineno"> 639</span> <span class="keywordflow">while</span> (inactive_node_ < <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a24926108b770033792d015cb86aeffb3">Size</a>()) {</div>
|
|
<div class="line"><a id="l00640" name="l00640"></a><span class="lineno"> 640</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a03283bdc4a6447ff4882cb1e42662b00">IsInactive</a>(inactive_node_) ||</div>
|
|
<div class="line"><a id="l00641" name="l00641"></a><span class="lineno"> 641</span> !<a class="code hl_function" href="classoperations__research_1_1_int_var_local_search_operator.html#a2b47576627076cc054924a89a08f69a6">PathOperator::MakeNextNeighbor</a>(<a class="code hl_variable" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a>, deltadelta)) {</div>
|
|
<div class="line"><a id="l00642" name="l00642"></a><span class="lineno"> 642</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab661b8d8259dac8444804d91809fbb0a">ResetPosition</a>();</div>
|
|
<div class="line"><a id="l00643" name="l00643"></a><span class="lineno"> 643</span> ++inactive_node_;</div>
|
|
<div class="line"><a id="l00644" name="l00644"></a><span class="lineno"> 644</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00645" name="l00645"></a><span class="lineno"> 645</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00646" name="l00646"></a><span class="lineno"> 646</span> }</div>
|
|
<div class="line"><a id="l00647" name="l00647"></a><span class="lineno"> 647</span> }</div>
|
|
<div class="line"><a id="l00648" name="l00648"></a><span class="lineno"> 648</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00649" name="l00649"></a><span class="lineno"> 649</span>}</div>
|
|
<div class="line"><a id="l00650" name="l00650"></a><span class="lineno"> 650</span> </div>
|
|
<div class="line"><a id="l00651" name="l00651"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_index_pair_swap_active_operator.html#a24ea165f00f8e15de94958fc804ff209"> 651</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_index_pair_swap_active_operator.html#a24ea165f00f8e15de94958fc804ff209">IndexPairSwapActiveOperator::MakeNeighbor</a>() {</div>
|
|
<div class="line"><a id="l00652" name="l00652"></a><span class="lineno"> 652</span> <span class="keyword">const</span> int64_t base = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(0);</div>
|
|
<div class="line"><a id="l00653" name="l00653"></a><span class="lineno"> 653</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a5f9e1016a5bb6a7d5cded8599a50fce1">Next</a>(base);</div>
|
|
<div class="line"><a id="l00654" name="l00654"></a><span class="lineno"> 654</span> <span class="keyword">const</span> int64_t other = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa2ea96360ac4370b31fc72090b55e7cc">GetActiveAlternativeSibling</a>(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a id="l00655" name="l00655"></a><span class="lineno"> 655</span> <span class="keywordflow">if</span> (other != -1) {</div>
|
|
<div class="line"><a id="l00656" name="l00656"></a><span class="lineno"> 656</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aff25e92fae946063c5a4a786e58e37a2">MakeChainInactive</a>(<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa14dad2d86c18296f9a5227b87d5caad">Prev</a>(other), other) &&</div>
|
|
<div class="line"><a id="l00657" name="l00657"></a><span class="lineno"> 657</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aff25e92fae946063c5a4a786e58e37a2">MakeChainInactive</a>(base, <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>) && <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a683f9daa3c8c8d6695ed277a470942f5">MakeActive</a>(inactive_node_, base);</div>
|
|
<div class="line"><a id="l00658" name="l00658"></a><span class="lineno"> 658</span> }</div>
|
|
<div class="line"><a id="l00659" name="l00659"></a><span class="lineno"> 659</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00660" name="l00660"></a><span class="lineno"> 660</span>}</div>
|
|
<div class="line"><a id="l00661" name="l00661"></a><span class="lineno"> 661</span> </div>
|
|
<div class="line"><a id="l00662" name="l00662"></a><span class="lineno"> 662</span><span class="keywordtype">void</span> IndexPairSwapActiveOperator::OnNodeInitialization() {</div>
|
|
<div class="line"><a id="l00663" name="l00663"></a><span class="lineno"> 663</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a1223e0b8dbca7cd9c296fc4de65080b2">PathOperator::OnNodeInitialization</a>();</div>
|
|
<div class="line"><a id="l00664" name="l00664"></a><span class="lineno"> 664</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a24926108b770033792d015cb86aeffb3">Size</a>(); ++i) {</div>
|
|
<div class="line"><a id="l00665" name="l00665"></a><span class="lineno"> 665</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a03283bdc4a6447ff4882cb1e42662b00">IsInactive</a>(i)) {</div>
|
|
<div class="line"><a id="l00666" name="l00666"></a><span class="lineno"> 666</span> inactive_node_ = i;</div>
|
|
<div class="line"><a id="l00667" name="l00667"></a><span class="lineno"> 667</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00668" name="l00668"></a><span class="lineno"> 668</span> }</div>
|
|
<div class="line"><a id="l00669" name="l00669"></a><span class="lineno"> 669</span> }</div>
|
|
<div class="line"><a id="l00670" name="l00670"></a><span class="lineno"> 670</span> inactive_node_ = <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a24926108b770033792d015cb86aeffb3">Size</a>();</div>
|
|
<div class="line"><a id="l00671" name="l00671"></a><span class="lineno"> 671</span>}</div>
|
|
<div class="line"><a id="l00672" name="l00672"></a><span class="lineno"> 672</span> </div>
|
|
<div class="line"><a id="l00673" name="l00673"></a><span class="lineno"> 673</span><span class="comment">// FilteredHeuristicLocalSearchOperator</span></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"><a class="line" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a068f0179d07363d4d3f462c60e944bf0"> 675</a></span><a class="code hl_function" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a068f0179d07363d4d3f462c60e944bf0">FilteredHeuristicLocalSearchOperator::FilteredHeuristicLocalSearchOperator</a>(</div>
|
|
<div class="line"><a id="l00676" name="l00676"></a><span class="lineno"> 676</span> std::unique_ptr<RoutingFilteredHeuristic> heuristic,</div>
|
|
<div class="line"><a id="l00677" name="l00677"></a><span class="lineno"> 677</span> <span class="keywordtype">bool</span> keep_inverse_values)</div>
|
|
<div class="line"><a id="l00678" name="l00678"></a><span class="lineno"> 678</span> : <a class="code hl_class" href="classoperations__research_1_1_int_var_local_search_operator.html">IntVarLocalSearchOperator</a>(heuristic-><a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->Nexts(),</div>
|
|
<div class="line"><a id="l00679" name="l00679"></a><span class="lineno"> 679</span> keep_inverse_values),</div>
|
|
<div class="line"><a id="l00680" name="l00680"></a><span class="lineno"> 680</span> model_(heuristic-><a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()),</div>
|
|
<div class="line"><a id="l00681" name="l00681"></a><span class="lineno"> 681</span> removed_nodes_(model_->Size()),</div>
|
|
<div class="line"><a id="l00682" name="l00682"></a><span class="lineno"> 682</span> heuristic_(<a class="code hl_namespace" href="namespacestd.html">std</a>::move(heuristic)),</div>
|
|
<div class="line"><a id="l00683" name="l00683"></a><span class="lineno"> 683</span> consider_vehicle_vars_(!model_->CostsAreHomogeneousAcrossVehicles()) {</div>
|
|
<div class="line"><a id="l00684" name="l00684"></a><span class="lineno"> 684</span> <span class="keywordflow">if</span> (consider_vehicle_vars_) {</div>
|
|
<div class="line"><a id="l00685" name="l00685"></a><span class="lineno"> 685</span> <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#ae2af73491ab2aa6804b443d442026a5e">AddVars</a>(<a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a2323c80745919399f8665a07beab1451">VehicleVars</a>());</div>
|
|
<div class="line"><a id="l00686" name="l00686"></a><span class="lineno"> 686</span> }</div>
|
|
<div class="line"><a id="l00687" name="l00687"></a><span class="lineno"> 687</span>}</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><span class="keywordtype">bool</span> FilteredHeuristicLocalSearchOperator::MakeOneNeighbor() {</div>
|
|
<div class="line"><a id="l00690" name="l00690"></a><span class="lineno"> 690</span> <span class="keywordflow">while</span> (<a class="code hl_function" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a7e4daec31b209d577f17eae614d76fe1">IncrementPosition</a>()) {</div>
|
|
<div class="line"><a id="l00691" name="l00691"></a><span class="lineno"> 691</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a3f5d70fe48cb54cbc5d8f6bba55b007d">CheckLimit</a>()) {</div>
|
|
<div class="line"><a id="l00692" name="l00692"></a><span class="lineno"> 692</span> <span class="comment">// NOTE: Even though the limit is checked in the BuildSolutionFromRoutes()</span></div>
|
|
<div class="line"><a id="l00693" name="l00693"></a><span class="lineno"> 693</span> <span class="comment">// method of the heuristics, we still check it here to avoid calling</span></div>
|
|
<div class="line"><a id="l00694" name="l00694"></a><span class="lineno"> 694</span> <span class="comment">// IncrementPosition() and building a solution for every possible position</span></div>
|
|
<div class="line"><a id="l00695" name="l00695"></a><span class="lineno"> 695</span> <span class="comment">// if the time limit is reached.</span></div>
|
|
<div class="line"><a id="l00696" name="l00696"></a><span class="lineno"> 696</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00697" name="l00697"></a><span class="lineno"> 697</span> }</div>
|
|
<div class="line"><a id="l00698" name="l00698"></a><span class="lineno"> 698</span> <span class="comment">// NOTE: No need to call RevertChanges() here as MakeChangeAndInsertNodes()</span></div>
|
|
<div class="line"><a id="l00699" name="l00699"></a><span class="lineno"> 699</span> <span class="comment">// will always return true if any change was made.</span></div>
|
|
<div class="line"><a id="l00700" name="l00700"></a><span class="lineno"> 700</span> <span class="keywordflow">if</span> (MakeChangesAndInsertNodes()) {</div>
|
|
<div class="line"><a id="l00701" name="l00701"></a><span class="lineno"> 701</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</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="l00704" name="l00704"></a><span class="lineno"> 704</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00705" name="l00705"></a><span class="lineno"> 705</span>}</div>
|
|
<div class="line"><a id="l00706" name="l00706"></a><span class="lineno"> 706</span> </div>
|
|
<div class="line"><a id="l00707" name="l00707"></a><span class="lineno"> 707</span><span class="keywordtype">bool</span> FilteredHeuristicLocalSearchOperator::MakeChangesAndInsertNodes() {</div>
|
|
<div class="line"><a id="l00708" name="l00708"></a><span class="lineno"> 708</span> <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#ad988ac45a63930f901dc11713434b945">removed_nodes_</a>.<a class="code hl_function" href="classoperations__research_1_1_sparse_bitset.html#ab4bc8236a9bfe59526e353800a0f0470">SparseClearAll</a>();</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> <span class="keyword">const</span> std::function<int64_t(int64_t)> next_accessor =</div>
|
|
<div class="line"><a id="l00711" name="l00711"></a><span class="lineno"> 711</span> <a class="code hl_function" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a904b8e4b611be6bce384c1f14b48fd15">SetupNextAccessorForNeighbor</a>();</div>
|
|
<div class="line"><a id="l00712" name="l00712"></a><span class="lineno"> 712</span> <span class="keywordflow">if</span> (next_accessor == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l00713" name="l00713"></a><span class="lineno"> 713</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</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="keyword">const</span> Assignment* <span class="keyword">const</span> result_assignment =</div>
|
|
<div class="line"><a id="l00716" name="l00716"></a><span class="lineno"> 716</span> heuristic_->BuildSolutionFromRoutes(next_accessor);</div>
|
|
<div class="line"><a id="l00717" name="l00717"></a><span class="lineno"> 717</span> </div>
|
|
<div class="line"><a id="l00718" name="l00718"></a><span class="lineno"> 718</span> <span class="keywordflow">if</span> (result_assignment == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l00719" name="l00719"></a><span class="lineno"> 719</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00720" name="l00720"></a><span class="lineno"> 720</span> }</div>
|
|
<div class="line"><a id="l00721" name="l00721"></a><span class="lineno"> 721</span> </div>
|
|
<div class="line"><a id="l00722" name="l00722"></a><span class="lineno"> 722</span> <span class="keywordtype">bool</span> has_change = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00723" name="l00723"></a><span class="lineno"> 723</span> <span class="keyword">const</span> std::vector<IntVarElement>& elements =</div>
|
|
<div class="line"><a id="l00724" name="l00724"></a><span class="lineno"> 724</span> result_assignment->IntVarContainer().elements();</div>
|
|
<div class="line"><a id="l00725" name="l00725"></a><span class="lineno"> 725</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); vehicle++) {</div>
|
|
<div class="line"><a id="l00726" name="l00726"></a><span class="lineno"> 726</span> int64_t node_index = <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(vehicle);</div>
|
|
<div class="line"><a id="l00727" name="l00727"></a><span class="lineno"> 727</span> <span class="keywordflow">while</span> (!<a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#acf67dc202e247ce193038850f71306d3">IsEnd</a>(node_index)) {</div>
|
|
<div class="line"><a id="l00728" name="l00728"></a><span class="lineno"> 728</span> <span class="comment">// NOTE: When building the solution in the heuristic, Next vars are added</span></div>
|
|
<div class="line"><a id="l00729" name="l00729"></a><span class="lineno"> 729</span> <span class="comment">// to the assignment at the position corresponding to their index.</span></div>
|
|
<div class="line"><a id="l00730" name="l00730"></a><span class="lineno"> 730</span> <span class="keyword">const</span> IntVarElement& node_element = elements[node_index];</div>
|
|
<div class="line"><a id="l00731" name="l00731"></a><span class="lineno"> 731</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(node_element.Var(), <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a5e7fe0d056275b47eccc1b6bfce0b482">NextVar</a>(node_index));</div>
|
|
<div class="line"><a id="l00732" name="l00732"></a><span class="lineno"> 732</span> </div>
|
|
<div class="line"><a id="l00733" name="l00733"></a><span class="lineno"> 733</span> <span class="keyword">const</span> int64_t new_node_value = node_element.Value();</div>
|
|
<div class="line"><a id="l00734" name="l00734"></a><span class="lineno"> 734</span> <a class="code hl_define" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(new_node_value, node_index);</div>
|
|
<div class="line"><a id="l00735" name="l00735"></a><span class="lineno"> 735</span> </div>
|
|
<div class="line"><a id="l00736" name="l00736"></a><span class="lineno"> 736</span> <span class="keyword">const</span> int64_t vehicle_var_index = VehicleVarIndex(node_index);</div>
|
|
<div class="line"><a id="l00737" name="l00737"></a><span class="lineno"> 737</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a79163ea8990864f185e87eabf1578cca">OldValue</a>(node_index) != new_node_value ||</div>
|
|
<div class="line"><a id="l00738" name="l00738"></a><span class="lineno"> 738</span> (consider_vehicle_vars_ && <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a79163ea8990864f185e87eabf1578cca">OldValue</a>(vehicle_var_index) != vehicle)) {</div>
|
|
<div class="line"><a id="l00739" name="l00739"></a><span class="lineno"> 739</span> has_change = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00740" name="l00740"></a><span class="lineno"> 740</span> <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a20dd03e0437bf484e2ea321595c2e1cd">SetValue</a>(node_index, new_node_value);</div>
|
|
<div class="line"><a id="l00741" name="l00741"></a><span class="lineno"> 741</span> <span class="keywordflow">if</span> (consider_vehicle_vars_) {</div>
|
|
<div class="line"><a id="l00742" name="l00742"></a><span class="lineno"> 742</span> <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a20dd03e0437bf484e2ea321595c2e1cd">SetValue</a>(vehicle_var_index, vehicle);</div>
|
|
<div class="line"><a id="l00743" name="l00743"></a><span class="lineno"> 743</span> }</div>
|
|
<div class="line"><a id="l00744" name="l00744"></a><span class="lineno"> 744</span> }</div>
|
|
<div class="line"><a id="l00745" name="l00745"></a><span class="lineno"> 745</span> node_index = new_node_value;</div>
|
|
<div class="line"><a id="l00746" name="l00746"></a><span class="lineno"> 746</span> }</div>
|
|
<div class="line"><a id="l00747" name="l00747"></a><span class="lineno"> 747</span> }</div>
|
|
<div class="line"><a id="l00748" name="l00748"></a><span class="lineno"> 748</span> <span class="comment">// Check for newly unperformed nodes among the ones removed for insertion by</span></div>
|
|
<div class="line"><a id="l00749" name="l00749"></a><span class="lineno"> 749</span> <span class="comment">// the heuristic.</span></div>
|
|
<div class="line"><a id="l00750" name="l00750"></a><span class="lineno"> 750</span> <span class="keywordflow">for</span> (int64_t node : <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#ad988ac45a63930f901dc11713434b945">removed_nodes_</a>.<a class="code hl_function" href="classoperations__research_1_1_sparse_bitset.html#a7187b794b93178bdf96f632d1f5d8c03">PositionsSetAtLeastOnce</a>()) {</div>
|
|
<div class="line"><a id="l00751" name="l00751"></a><span class="lineno"> 751</span> <span class="keyword">const</span> IntVarElement& node_element = elements[node];</div>
|
|
<div class="line"><a id="l00752" name="l00752"></a><span class="lineno"> 752</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(node_element.Var(), <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a5e7fe0d056275b47eccc1b6bfce0b482">NextVar</a>(node));</div>
|
|
<div class="line"><a id="l00753" name="l00753"></a><span class="lineno"> 753</span> <span class="keywordflow">if</span> (node_element.Value() == node) {</div>
|
|
<div class="line"><a id="l00754" name="l00754"></a><span class="lineno"> 754</span> <a class="code hl_define" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(<a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a79163ea8990864f185e87eabf1578cca">OldValue</a>(node), node);</div>
|
|
<div class="line"><a id="l00755" name="l00755"></a><span class="lineno"> 755</span> has_change = <span class="keyword">true</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_var_local_search_operator.html#a20dd03e0437bf484e2ea321595c2e1cd">SetValue</a>(node, node);</div>
|
|
<div class="line"><a id="l00757" name="l00757"></a><span class="lineno"> 757</span> <span class="keywordflow">if</span> (consider_vehicle_vars_) {</div>
|
|
<div class="line"><a id="l00758" name="l00758"></a><span class="lineno"> 758</span> <span class="keyword">const</span> int64_t vehicle_var_index = VehicleVarIndex(node);</div>
|
|
<div class="line"><a id="l00759" name="l00759"></a><span class="lineno"> 759</span> <a class="code hl_define" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(<a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a79163ea8990864f185e87eabf1578cca">OldValue</a>(vehicle_var_index), -1);</div>
|
|
<div class="line"><a id="l00760" name="l00760"></a><span class="lineno"> 760</span> <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a20dd03e0437bf484e2ea321595c2e1cd">SetValue</a>(vehicle_var_index, -1);</div>
|
|
<div class="line"><a id="l00761" name="l00761"></a><span class="lineno"> 761</span> }</div>
|
|
<div class="line"><a id="l00762" name="l00762"></a><span class="lineno"> 762</span> }</div>
|
|
<div class="line"><a id="l00763" name="l00763"></a><span class="lineno"> 763</span> }</div>
|
|
<div class="line"><a id="l00764" name="l00764"></a><span class="lineno"> 764</span> <span class="keywordflow">return</span> has_change;</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="comment">// FilteredHeuristicPathLNSOperator</span></div>
|
|
<div class="line"><a id="l00768" name="l00768"></a><span class="lineno"> 768</span> </div>
|
|
<div class="line"><a id="l00769" name="l00769"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_filtered_heuristic_path_l_n_s_operator.html#a38cacd12bc9db8fd86e8895320594131"> 769</a></span><a class="code hl_function" href="classoperations__research_1_1_filtered_heuristic_path_l_n_s_operator.html#a38cacd12bc9db8fd86e8895320594131">FilteredHeuristicPathLNSOperator::FilteredHeuristicPathLNSOperator</a>(</div>
|
|
<div class="line"><a id="l00770" name="l00770"></a><span class="lineno"> 770</span> std::unique_ptr<RoutingFilteredHeuristic> heuristic)</div>
|
|
<div class="line"><a id="l00771" name="l00771"></a><span class="lineno"> 771</span> : <a class="code hl_class" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html">FilteredHeuristicLocalSearchOperator</a>(<a class="code hl_namespace" href="namespacestd.html">std</a>::move(heuristic)),</div>
|
|
<div class="line"><a id="l00772" name="l00772"></a><span class="lineno"> 772</span> current_route_(0),</div>
|
|
<div class="line"><a id="l00773" name="l00773"></a><span class="lineno"> 773</span> last_route_(0),</div>
|
|
<div class="line"><a id="l00774" name="l00774"></a><span class="lineno"> 774</span> just_started_(false) {}</div>
|
|
<div class="line"><a id="l00775" name="l00775"></a><span class="lineno"> 775</span> </div>
|
|
<div class="line"><a id="l00776" name="l00776"></a><span class="lineno"> 776</span><span class="keywordtype">void</span> FilteredHeuristicPathLNSOperator::OnStart() {</div>
|
|
<div class="line"><a id="l00777" name="l00777"></a><span class="lineno"> 777</span> <span class="comment">// NOTE: We set last_route_ to current_route_ here to make sure all routes</span></div>
|
|
<div class="line"><a id="l00778" name="l00778"></a><span class="lineno"> 778</span> <span class="comment">// are scanned in IncrementCurrentRouteToNextNonEmpty().</span></div>
|
|
<div class="line"><a id="l00779" name="l00779"></a><span class="lineno"> 779</span> last_route_ = current_route_;</div>
|
|
<div class="line"><a id="l00780" name="l00780"></a><span class="lineno"> 780</span> <span class="keywordflow">if</span> (CurrentRouteIsEmpty()) {</div>
|
|
<div class="line"><a id="l00781" name="l00781"></a><span class="lineno"> 781</span> IncrementCurrentRouteToNextNonEmpty();</div>
|
|
<div class="line"><a id="l00782" name="l00782"></a><span class="lineno"> 782</span> }</div>
|
|
<div class="line"><a id="l00783" name="l00783"></a><span class="lineno"> 783</span> just_started_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00784" name="l00784"></a><span class="lineno"> 784</span>}</div>
|
|
<div class="line"><a id="l00785" name="l00785"></a><span class="lineno"> 785</span> </div>
|
|
<div class="line"><a id="l00786" name="l00786"></a><span class="lineno"> 786</span><span class="keywordtype">bool</span> FilteredHeuristicPathLNSOperator::IncrementPosition() {</div>
|
|
<div class="line"><a id="l00787" name="l00787"></a><span class="lineno"> 787</span> <span class="keywordflow">if</span> (just_started_) {</div>
|
|
<div class="line"><a id="l00788" name="l00788"></a><span class="lineno"> 788</span> just_started_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00789" name="l00789"></a><span class="lineno"> 789</span> <span class="keywordflow">return</span> !CurrentRouteIsEmpty();</div>
|
|
<div class="line"><a id="l00790" name="l00790"></a><span class="lineno"> 790</span> }</div>
|
|
<div class="line"><a id="l00791" name="l00791"></a><span class="lineno"> 791</span> IncrementCurrentRouteToNextNonEmpty();</div>
|
|
<div class="line"><a id="l00792" name="l00792"></a><span class="lineno"> 792</span> <span class="keywordflow">return</span> current_route_ != last_route_;</div>
|
|
<div class="line"><a id="l00793" name="l00793"></a><span class="lineno"> 793</span>}</div>
|
|
<div class="line"><a id="l00794" name="l00794"></a><span class="lineno"> 794</span> </div>
|
|
<div class="line"><a id="l00795" name="l00795"></a><span class="lineno"> 795</span><span class="keywordtype">bool</span> FilteredHeuristicPathLNSOperator::CurrentRouteIsEmpty()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00796" name="l00796"></a><span class="lineno"> 796</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#acf67dc202e247ce193038850f71306d3">IsEnd</a>(<a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a79163ea8990864f185e87eabf1578cca">OldValue</a>(<a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(current_route_)));</div>
|
|
<div class="line"><a id="l00797" name="l00797"></a><span class="lineno"> 797</span>}</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><span class="keywordtype">void</span> FilteredHeuristicPathLNSOperator::IncrementCurrentRouteToNextNonEmpty() {</div>
|
|
<div class="line"><a id="l00800" name="l00800"></a><span class="lineno"> 800</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_routes = <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>();</div>
|
|
<div class="line"><a id="l00801" name="l00801"></a><span class="lineno"> 801</span> <span class="keywordflow">do</span> {</div>
|
|
<div class="line"><a id="l00802" name="l00802"></a><span class="lineno"> 802</span> ++current_route_ %= num_routes;</div>
|
|
<div class="line"><a id="l00803" name="l00803"></a><span class="lineno"> 803</span> <span class="keywordflow">if</span> (current_route_ == last_route_) {</div>
|
|
<div class="line"><a id="l00804" name="l00804"></a><span class="lineno"> 804</span> <span class="comment">// All routes have been scanned.</span></div>
|
|
<div class="line"><a id="l00805" name="l00805"></a><span class="lineno"> 805</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00806" name="l00806"></a><span class="lineno"> 806</span> }</div>
|
|
<div class="line"><a id="l00807" name="l00807"></a><span class="lineno"> 807</span> } <span class="keywordflow">while</span> (CurrentRouteIsEmpty());</div>
|
|
<div class="line"><a id="l00808" name="l00808"></a><span class="lineno"> 808</span>}</div>
|
|
<div class="line"><a id="l00809" name="l00809"></a><span class="lineno"> 809</span> </div>
|
|
<div class="line"><a id="l00810" name="l00810"></a><span class="lineno"> 810</span>std::function<int64_t(int64_t)></div>
|
|
<div class="line"><a id="l00811" name="l00811"></a><span class="lineno"> 811</span>FilteredHeuristicPathLNSOperator::SetupNextAccessorForNeighbor() {</div>
|
|
<div class="line"><a id="l00812" name="l00812"></a><span class="lineno"> 812</span> <span class="keyword">const</span> int64_t start_node = <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(current_route_);</div>
|
|
<div class="line"><a id="l00813" name="l00813"></a><span class="lineno"> 813</span> <span class="keyword">const</span> int64_t end_node = <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#afb80fd36c1fb57d2db049403483e2074">End</a>(current_route_);</div>
|
|
<div class="line"><a id="l00814" name="l00814"></a><span class="lineno"> 814</span> </div>
|
|
<div class="line"><a id="l00815" name="l00815"></a><span class="lineno"> 815</span> int64_t node = <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a3c7b6e2c172f34aad1d952d799be61f2">Value</a>(start_node);</div>
|
|
<div class="line"><a id="l00816" name="l00816"></a><span class="lineno"> 816</span> <span class="keywordflow">while</span> (node != end_node) {</div>
|
|
<div class="line"><a id="l00817" name="l00817"></a><span class="lineno"> 817</span> <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#ad988ac45a63930f901dc11713434b945">removed_nodes_</a>.<a class="code hl_function" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(node);</div>
|
|
<div class="line"><a id="l00818" name="l00818"></a><span class="lineno"> 818</span> node = <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a3c7b6e2c172f34aad1d952d799be61f2">Value</a>(node);</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> </div>
|
|
<div class="line"><a id="l00821" name="l00821"></a><span class="lineno"> 821</span> <span class="keywordflow">return</span> [<span class="keyword">this</span>, start_node, end_node](int64_t node) {</div>
|
|
<div class="line"><a id="l00822" name="l00822"></a><span class="lineno"> 822</span> <span class="keywordflow">if</span> (node == start_node) <span class="keywordflow">return</span> end_node;</div>
|
|
<div class="line"><a id="l00823" name="l00823"></a><span class="lineno"> 823</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a3c7b6e2c172f34aad1d952d799be61f2">Value</a>(node);</div>
|
|
<div class="line"><a id="l00824" name="l00824"></a><span class="lineno"> 824</span> };</div>
|
|
<div class="line"><a id="l00825" name="l00825"></a><span class="lineno"> 825</span>}</div>
|
|
<div class="line"><a id="l00826" name="l00826"></a><span class="lineno"> 826</span> </div>
|
|
<div class="line"><a id="l00827" name="l00827"></a><span class="lineno"> 827</span><span class="comment">// RelocatePathAndHeuristicInsertUnperformedOperator</span></div>
|
|
<div class="line"><a id="l00828" name="l00828"></a><span class="lineno"> 828</span> </div>
|
|
<div class="line"><a id="l00829" name="l00829"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_relocate_path_and_heuristic_insert_unperformed_operator.html#a5ae04552f86762e99d76d37fe26eee15"> 829</a></span><a class="code hl_function" href="classoperations__research_1_1_relocate_path_and_heuristic_insert_unperformed_operator.html#a5ae04552f86762e99d76d37fe26eee15">RelocatePathAndHeuristicInsertUnperformedOperator::</a></div>
|
|
<div class="line"><a id="l00830" name="l00830"></a><span class="lineno"> 830</span><a class="code hl_function" href="classoperations__research_1_1_relocate_path_and_heuristic_insert_unperformed_operator.html#a5ae04552f86762e99d76d37fe26eee15"> RelocatePathAndHeuristicInsertUnperformedOperator</a>(</div>
|
|
<div class="line"><a id="l00831" name="l00831"></a><span class="lineno"> 831</span> std::unique_ptr<RoutingFilteredHeuristic> heuristic)</div>
|
|
<div class="line"><a id="l00832" name="l00832"></a><span class="lineno"> 832</span> : <a class="code hl_class" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html">FilteredHeuristicLocalSearchOperator</a>(<a class="code hl_namespace" href="namespacestd.html">std</a>::move(heuristic)),</div>
|
|
<div class="line"><a id="l00833" name="l00833"></a><span class="lineno"> 833</span> route_to_relocate_index_(0),</div>
|
|
<div class="line"><a id="l00834" name="l00834"></a><span class="lineno"> 834</span> empty_route_index_(0),</div>
|
|
<div class="line"><a id="l00835" name="l00835"></a><span class="lineno"> 835</span> just_started_(false) {}</div>
|
|
<div class="line"><a id="l00836" name="l00836"></a><span class="lineno"> 836</span> </div>
|
|
<div class="line"><a id="l00837" name="l00837"></a><span class="lineno"> 837</span><span class="keywordtype">void</span> RelocatePathAndHeuristicInsertUnperformedOperator::OnStart() {</div>
|
|
<div class="line"><a id="l00838" name="l00838"></a><span class="lineno"> 838</span> has_unperformed_nodes_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00839" name="l00839"></a><span class="lineno"> 839</span> last_node_on_route_.resize(<a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>());</div>
|
|
<div class="line"><a id="l00840" name="l00840"></a><span class="lineno"> 840</span> routes_to_relocate_.clear();</div>
|
|
<div class="line"><a id="l00841" name="l00841"></a><span class="lineno"> 841</span> empty_routes_.clear();</div>
|
|
<div class="line"><a id="l00842" name="l00842"></a><span class="lineno"> 842</span> std::vector<bool> empty_vehicle_of_vehicle_class_added(</div>
|
|
<div class="line"><a id="l00843" name="l00843"></a><span class="lineno"> 843</span> <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a34ab0d5fa45360b5e6a42b9a78cfe5a8">GetVehicleClassesCount</a>(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00844" name="l00844"></a><span class="lineno"> 844</span> <span class="keywordflow">for</span> (int64_t node = 0; node < <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">Size</a>(); node++) {</div>
|
|
<div class="line"><a id="l00845" name="l00845"></a><span class="lineno"> 845</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a79163ea8990864f185e87eabf1578cca">OldValue</a>(node);</div>
|
|
<div class="line"><a id="l00846" name="l00846"></a><span class="lineno"> 846</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> == node) {</div>
|
|
<div class="line"><a id="l00847" name="l00847"></a><span class="lineno"> 847</span> has_unperformed_nodes_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00848" name="l00848"></a><span class="lineno"> 848</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00849" name="l00849"></a><span class="lineno"> 849</span> }</div>
|
|
<div class="line"><a id="l00850" name="l00850"></a><span class="lineno"> 850</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#acf67dc202e247ce193038850f71306d3">IsEnd</a>(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)) {</div>
|
|
<div class="line"><a id="l00851" name="l00851"></a><span class="lineno"> 851</span> last_node_on_route_[<a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aeb9d2afe2e9d5bd929aad759f37e4938">VehicleIndex</a>(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)] = node;</div>
|
|
<div class="line"><a id="l00852" name="l00852"></a><span class="lineno"> 852</span> }</div>
|
|
<div class="line"><a id="l00853" name="l00853"></a><span class="lineno"> 853</span> }</div>
|
|
<div class="line"><a id="l00854" name="l00854"></a><span class="lineno"> 854</span> </div>
|
|
<div class="line"><a id="l00855" name="l00855"></a><span class="lineno"> 855</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); vehicle++) {</div>
|
|
<div class="line"><a id="l00856" name="l00856"></a><span class="lineno"> 856</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a79163ea8990864f185e87eabf1578cca">OldValue</a>(<a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(vehicle));</div>
|
|
<div class="line"><a id="l00857" name="l00857"></a><span class="lineno"> 857</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#acf67dc202e247ce193038850f71306d3">IsEnd</a>(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)) {</div>
|
|
<div class="line"><a id="l00858" name="l00858"></a><span class="lineno"> 858</span> routes_to_relocate_.push_back(vehicle);</div>
|
|
<div class="line"><a id="l00859" name="l00859"></a><span class="lineno"> 859</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00860" name="l00860"></a><span class="lineno"> 860</span> }</div>
|
|
<div class="line"><a id="l00861" name="l00861"></a><span class="lineno"> 861</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> =</div>
|
|
<div class="line"><a id="l00862" name="l00862"></a><span class="lineno"> 862</span> <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a114000eadb54d1a6275add6c1e6fcf33">GetVehicleClassIndexOfVehicle</a>(vehicle).value();</div>
|
|
<div class="line"><a id="l00863" name="l00863"></a><span class="lineno"> 863</span> <span class="keywordflow">if</span> (!empty_vehicle_of_vehicle_class_added[<a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a>]) {</div>
|
|
<div class="line"><a id="l00864" name="l00864"></a><span class="lineno"> 864</span> empty_routes_.push_back(vehicle);</div>
|
|
<div class="line"><a id="l00865" name="l00865"></a><span class="lineno"> 865</span> empty_vehicle_of_vehicle_class_added[<a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a>] = <span class="keyword">true</span>;</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="l00868" name="l00868"></a><span class="lineno"> 868</span> </div>
|
|
<div class="line"><a id="l00869" name="l00869"></a><span class="lineno"> 869</span> <span class="keywordflow">if</span> (empty_route_index_ >= empty_routes_.size()) {</div>
|
|
<div class="line"><a id="l00870" name="l00870"></a><span class="lineno"> 870</span> empty_route_index_ = 0;</div>
|
|
<div class="line"><a id="l00871" name="l00871"></a><span class="lineno"> 871</span> }</div>
|
|
<div class="line"><a id="l00872" name="l00872"></a><span class="lineno"> 872</span> <span class="keywordflow">if</span> (route_to_relocate_index_ >= routes_to_relocate_.size()) {</div>
|
|
<div class="line"><a id="l00873" name="l00873"></a><span class="lineno"> 873</span> route_to_relocate_index_ = 0;</div>
|
|
<div class="line"><a id="l00874" name="l00874"></a><span class="lineno"> 874</span> }</div>
|
|
<div class="line"><a id="l00875" name="l00875"></a><span class="lineno"> 875</span> last_empty_route_index_ = empty_route_index_;</div>
|
|
<div class="line"><a id="l00876" name="l00876"></a><span class="lineno"> 876</span> last_route_to_relocate_index_ = route_to_relocate_index_;</div>
|
|
<div class="line"><a id="l00877" name="l00877"></a><span class="lineno"> 877</span> </div>
|
|
<div class="line"><a id="l00878" name="l00878"></a><span class="lineno"> 878</span> just_started_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00879" name="l00879"></a><span class="lineno"> 879</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><span class="keywordtype">bool</span> RelocatePathAndHeuristicInsertUnperformedOperator::IncrementPosition() {</div>
|
|
<div class="line"><a id="l00882" name="l00882"></a><span class="lineno"> 882</span> <span class="keywordflow">if</span> (!has_unperformed_nodes_ || empty_routes_.empty() ||</div>
|
|
<div class="line"><a id="l00883" name="l00883"></a><span class="lineno"> 883</span> routes_to_relocate_.empty()) {</div>
|
|
<div class="line"><a id="l00884" name="l00884"></a><span class="lineno"> 884</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00885" name="l00885"></a><span class="lineno"> 885</span> }</div>
|
|
<div class="line"><a id="l00886" name="l00886"></a><span class="lineno"> 886</span> <span class="keywordflow">if</span> (just_started_) {</div>
|
|
<div class="line"><a id="l00887" name="l00887"></a><span class="lineno"> 887</span> just_started_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00888" name="l00888"></a><span class="lineno"> 888</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</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> <span class="keywordflow">return</span> IncrementRoutes();</div>
|
|
<div class="line"><a id="l00891" name="l00891"></a><span class="lineno"> 891</span>}</div>
|
|
<div class="line"><a id="l00892" name="l00892"></a><span class="lineno"> 892</span> </div>
|
|
<div class="line"><a id="l00893" name="l00893"></a><span class="lineno"> 893</span><span class="keywordtype">bool</span> RelocatePathAndHeuristicInsertUnperformedOperator::IncrementRoutes() {</div>
|
|
<div class="line"><a id="l00894" name="l00894"></a><span class="lineno"> 894</span> ++empty_route_index_ %= empty_routes_.size();</div>
|
|
<div class="line"><a id="l00895" name="l00895"></a><span class="lineno"> 895</span> <span class="keywordflow">if</span> (empty_route_index_ != last_empty_route_index_) {</div>
|
|
<div class="line"><a id="l00896" name="l00896"></a><span class="lineno"> 896</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00897" name="l00897"></a><span class="lineno"> 897</span> }</div>
|
|
<div class="line"><a id="l00898" name="l00898"></a><span class="lineno"> 898</span> ++route_to_relocate_index_ %= routes_to_relocate_.size();</div>
|
|
<div class="line"><a id="l00899" name="l00899"></a><span class="lineno"> 899</span> <span class="keywordflow">return</span> route_to_relocate_index_ != last_route_to_relocate_index_;</div>
|
|
<div class="line"><a id="l00900" name="l00900"></a><span class="lineno"> 900</span>}</div>
|
|
<div class="line"><a id="l00901" name="l00901"></a><span class="lineno"> 901</span> </div>
|
|
<div class="line"><a id="l00902" name="l00902"></a><span class="lineno"> 902</span>std::function<int64_t(int64_t)></div>
|
|
<div class="line"><a id="l00903" name="l00903"></a><span class="lineno"> 903</span>RelocatePathAndHeuristicInsertUnperformedOperator::</div>
|
|
<div class="line"><a id="l00904" name="l00904"></a><span class="lineno"> 904</span> SetupNextAccessorForNeighbor() {</div>
|
|
<div class="line"><a id="l00905" name="l00905"></a><span class="lineno"> 905</span> <span class="keyword">const</span> <span class="keywordtype">int</span> empty_route = empty_routes_[empty_route_index_];</div>
|
|
<div class="line"><a id="l00906" name="l00906"></a><span class="lineno"> 906</span> <span class="keyword">const</span> <span class="keywordtype">int</span> relocated_route = routes_to_relocate_[route_to_relocate_index_];</div>
|
|
<div class="line"><a id="l00907" name="l00907"></a><span class="lineno"> 907</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a114000eadb54d1a6275add6c1e6fcf33">GetVehicleClassIndexOfVehicle</a>(empty_route) ==</div>
|
|
<div class="line"><a id="l00908" name="l00908"></a><span class="lineno"> 908</span> <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a114000eadb54d1a6275add6c1e6fcf33">GetVehicleClassIndexOfVehicle</a>(relocated_route)) {</div>
|
|
<div class="line"><a id="l00909" name="l00909"></a><span class="lineno"> 909</span> <span class="comment">// Don't try to relocate the route to an empty vehicle of the same class.</span></div>
|
|
<div class="line"><a id="l00910" name="l00910"></a><span class="lineno"> 910</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l00911" name="l00911"></a><span class="lineno"> 911</span> }</div>
|
|
<div class="line"><a id="l00912" name="l00912"></a><span class="lineno"> 912</span> </div>
|
|
<div class="line"><a id="l00913" name="l00913"></a><span class="lineno"> 913</span> <span class="keyword">const</span> int64_t empty_start_node = <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(empty_route);</div>
|
|
<div class="line"><a id="l00914" name="l00914"></a><span class="lineno"> 914</span> <span class="keyword">const</span> int64_t empty_end_node = <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#afb80fd36c1fb57d2db049403483e2074">End</a>(empty_route);</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> <span class="keyword">const</span> int64_t relocated_route_start = <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(relocated_route);</div>
|
|
<div class="line"><a id="l00917" name="l00917"></a><span class="lineno"> 917</span> <span class="keyword">const</span> int64_t first_relocated_node = <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a79163ea8990864f185e87eabf1578cca">OldValue</a>(relocated_route_start);</div>
|
|
<div class="line"><a id="l00918" name="l00918"></a><span class="lineno"> 918</span> <span class="keyword">const</span> int64_t last_relocated_node = last_node_on_route_[relocated_route];</div>
|
|
<div class="line"><a id="l00919" name="l00919"></a><span class="lineno"> 919</span> <span class="keyword">const</span> int64_t relocated_route_end = <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#afb80fd36c1fb57d2db049403483e2074">End</a>(relocated_route);</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="keywordflow">return</span> [<span class="keyword">this</span>, empty_start_node, empty_end_node, first_relocated_node,</div>
|
|
<div class="line"><a id="l00922" name="l00922"></a><span class="lineno"> 922</span> last_relocated_node, relocated_route_start,</div>
|
|
<div class="line"><a id="l00923" name="l00923"></a><span class="lineno"> 923</span> relocated_route_end](int64_t node) {</div>
|
|
<div class="line"><a id="l00924" name="l00924"></a><span class="lineno"> 924</span> <span class="keywordflow">if</span> (node == relocated_route_start) <span class="keywordflow">return</span> relocated_route_end;</div>
|
|
<div class="line"><a id="l00925" name="l00925"></a><span class="lineno"> 925</span> <span class="keywordflow">if</span> (node == empty_start_node) <span class="keywordflow">return</span> first_relocated_node;</div>
|
|
<div class="line"><a id="l00926" name="l00926"></a><span class="lineno"> 926</span> <span class="keywordflow">if</span> (node == last_relocated_node) <span class="keywordflow">return</span> empty_end_node;</div>
|
|
<div class="line"><a id="l00927" name="l00927"></a><span class="lineno"> 927</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a3c7b6e2c172f34aad1d952d799be61f2">Value</a>(node);</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"> 929</span>}</div>
|
|
<div class="line"><a id="l00930" name="l00930"></a><span class="lineno"> 930</span> </div>
|
|
<div class="line"><a id="l00931" name="l00931"></a><span class="lineno"> 931</span><span class="comment">// FilteredHeuristicCloseNodesLNSOperator</span></div>
|
|
<div class="line"><a id="l00932" name="l00932"></a><span class="lineno"> 932</span> </div>
|
|
<div class="line"><a id="l00933" name="l00933"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_filtered_heuristic_close_nodes_l_n_s_operator.html#aa885958c7ae62526a68fd8ec8dcc2060"> 933</a></span><a class="code hl_function" href="classoperations__research_1_1_filtered_heuristic_close_nodes_l_n_s_operator.html#aa885958c7ae62526a68fd8ec8dcc2060">FilteredHeuristicCloseNodesLNSOperator::FilteredHeuristicCloseNodesLNSOperator</a>(</div>
|
|
<div class="line"><a id="l00934" name="l00934"></a><span class="lineno"> 934</span> std::unique_ptr<RoutingFilteredHeuristic> heuristic, <span class="keywordtype">int</span> num_close_nodes)</div>
|
|
<div class="line"><a id="l00935" name="l00935"></a><span class="lineno"> 935</span> : <a class="code hl_class" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html">FilteredHeuristicLocalSearchOperator</a>(<a class="code hl_namespace" href="namespacestd.html">std</a>::move(heuristic),</div>
|
|
<div class="line"><a id="l00936" name="l00936"></a><span class="lineno"> 936</span> <span class="comment">/*keep_inverse_values*/</span> true),</div>
|
|
<div class="line"><a id="l00937" name="l00937"></a><span class="lineno"> 937</span> pickup_delivery_pairs_(model_->GetPickupAndDeliveryPairs()),</div>
|
|
<div class="line"><a id="l00938" name="l00938"></a><span class="lineno"> 938</span> current_node_(0),</div>
|
|
<div class="line"><a id="l00939" name="l00939"></a><span class="lineno"> 939</span> last_node_(0),</div>
|
|
<div class="line"><a id="l00940" name="l00940"></a><span class="lineno"> 940</span> close_nodes_(model_->Size()),</div>
|
|
<div class="line"><a id="l00941" name="l00941"></a><span class="lineno"> 941</span> new_nexts_(model_->Size()),</div>
|
|
<div class="line"><a id="l00942" name="l00942"></a><span class="lineno"> 942</span> changed_nexts_(model_->Size()),</div>
|
|
<div class="line"><a id="l00943" name="l00943"></a><span class="lineno"> 943</span> new_prevs_(model_->Size()),</div>
|
|
<div class="line"><a id="l00944" name="l00944"></a><span class="lineno"> 944</span> changed_prevs_(model_->Size()) {</div>
|
|
<div class="line"><a id="l00945" name="l00945"></a><span class="lineno"> 945</span> <span class="keyword">const</span> int64_t size = <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">Size</a>();</div>
|
|
<div class="line"><a id="l00946" name="l00946"></a><span class="lineno"> 946</span> <span class="keyword">const</span> int64_t max_num_neighbors =</div>
|
|
<div class="line"><a id="l00947" name="l00947"></a><span class="lineno"> 947</span> std::max<int64_t>(0, size - 1 - <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>());</div>
|
|
<div class="line"><a id="l00948" name="l00948"></a><span class="lineno"> 948</span> <span class="keyword">const</span> int64_t num_closest_neighbors =</div>
|
|
<div class="line"><a id="l00949" name="l00949"></a><span class="lineno"> 949</span> std::min<int64_t>(num_close_nodes, max_num_neighbors);</div>
|
|
<div class="line"><a id="l00950" name="l00950"></a><span class="lineno"> 950</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(num_closest_neighbors, 0);</div>
|
|
<div class="line"><a id="l00951" name="l00951"></a><span class="lineno"> 951</span> </div>
|
|
<div class="line"><a id="l00952" name="l00952"></a><span class="lineno"> 952</span> <span class="keywordflow">if</span> (num_closest_neighbors == 0) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00953" name="l00953"></a><span class="lineno"> 953</span> </div>
|
|
<div class="line"><a id="l00954" name="l00954"></a><span class="lineno"> 954</span> <span class="keyword">const</span> int64_t num_cost_classes = <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#ad3b144985c2b4b24cf39b839dbd9c16d">GetCostClassesCount</a>();</div>
|
|
<div class="line"><a id="l00955" name="l00955"></a><span class="lineno"> 955</span> </div>
|
|
<div class="line"><a id="l00956" name="l00956"></a><span class="lineno"> 956</span> <span class="keywordflow">for</span> (int64_t node = 0; node < size; node++) {</div>
|
|
<div class="line"><a id="l00957" name="l00957"></a><span class="lineno"> 957</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a3582f01eabc65ba4b801215ca6420a7c">IsStart</a>(node) || <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#acf67dc202e247ce193038850f71306d3">IsEnd</a>(node)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00958" name="l00958"></a><span class="lineno"> 958</span> </div>
|
|
<div class="line"><a id="l00959" name="l00959"></a><span class="lineno"> 959</span> std::vector<std::pair<<span class="comment">/*cost*/</span> double, <span class="comment">/*node*/</span> int64_t>></div>
|
|
<div class="line"><a id="l00960" name="l00960"></a><span class="lineno"> 960</span> costed_after_nodes;</div>
|
|
<div class="line"><a id="l00961" name="l00961"></a><span class="lineno"> 961</span> costed_after_nodes.reserve(size);</div>
|
|
<div class="line"><a id="l00962" name="l00962"></a><span class="lineno"> 962</span> <span class="keywordflow">for</span> (int64_t after_node = 0; after_node < size; after_node++) {</div>
|
|
<div class="line"><a id="l00963" name="l00963"></a><span class="lineno"> 963</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a3582f01eabc65ba4b801215ca6420a7c">IsStart</a>(after_node) || <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#acf67dc202e247ce193038850f71306d3">IsEnd</a>(after_node) ||</div>
|
|
<div class="line"><a id="l00964" name="l00964"></a><span class="lineno"> 964</span> after_node == node) {</div>
|
|
<div class="line"><a id="l00965" name="l00965"></a><span class="lineno"> 965</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00966" name="l00966"></a><span class="lineno"> 966</span> }</div>
|
|
<div class="line"><a id="l00967" name="l00967"></a><span class="lineno"> 967</span> <span class="keywordtype">double</span> total_cost = 0.0;</div>
|
|
<div class="line"><a id="l00968" name="l00968"></a><span class="lineno"> 968</span> <span class="comment">// NOTE: We don't consider the 'always-zero' cost class when searching for</span></div>
|
|
<div class="line"><a id="l00969" name="l00969"></a><span class="lineno"> 969</span> <span class="comment">// closest neighbors.</span></div>
|
|
<div class="line"><a id="l00970" name="l00970"></a><span class="lineno"> 970</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> cost_class = 1; cost_class < num_cost_classes; cost_class++) {</div>
|
|
<div class="line"><a id="l00971" name="l00971"></a><span class="lineno"> 971</span> total_cost += <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#abfa127093eb53ae531ccb1f4ada6cc8a">GetArcCostForClass</a>(node, after_node, cost_class);</div>
|
|
<div class="line"><a id="l00972" name="l00972"></a><span class="lineno"> 972</span> }</div>
|
|
<div class="line"><a id="l00973" name="l00973"></a><span class="lineno"> 973</span> costed_after_nodes.emplace_back(total_cost, after_node);</div>
|
|
<div class="line"><a id="l00974" name="l00974"></a><span class="lineno"> 974</span> }</div>
|
|
<div class="line"><a id="l00975" name="l00975"></a><span class="lineno"> 975</span> </div>
|
|
<div class="line"><a id="l00976" name="l00976"></a><span class="lineno"> 976</span> std::nth_element(costed_after_nodes.begin(),</div>
|
|
<div class="line"><a id="l00977" name="l00977"></a><span class="lineno"> 977</span> costed_after_nodes.begin() + num_closest_neighbors - 1,</div>
|
|
<div class="line"><a id="l00978" name="l00978"></a><span class="lineno"> 978</span> costed_after_nodes.end());</div>
|
|
<div class="line"><a id="l00979" name="l00979"></a><span class="lineno"> 979</span> std::vector<int64_t>& neighbors = close_nodes_[node];</div>
|
|
<div class="line"><a id="l00980" name="l00980"></a><span class="lineno"> 980</span> neighbors.reserve(num_closest_neighbors);</div>
|
|
<div class="line"><a id="l00981" name="l00981"></a><span class="lineno"> 981</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0; <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < num_closest_neighbors; <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>++) {</div>
|
|
<div class="line"><a id="l00982" name="l00982"></a><span class="lineno"> 982</span> neighbors.push_back(costed_after_nodes[<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>].second);</div>
|
|
<div class="line"><a id="l00983" name="l00983"></a><span class="lineno"> 983</span> }</div>
|
|
<div class="line"><a id="l00984" name="l00984"></a><span class="lineno"> 984</span> }</div>
|
|
<div class="line"><a id="l00985" name="l00985"></a><span class="lineno"> 985</span>}</div>
|
|
<div class="line"><a id="l00986" name="l00986"></a><span class="lineno"> 986</span> </div>
|
|
<div class="line"><a id="l00987" name="l00987"></a><span class="lineno"> 987</span><span class="keywordtype">void</span> FilteredHeuristicCloseNodesLNSOperator::OnStart() {</div>
|
|
<div class="line"><a id="l00988" name="l00988"></a><span class="lineno"> 988</span> last_node_ = current_node_;</div>
|
|
<div class="line"><a id="l00989" name="l00989"></a><span class="lineno"> 989</span> just_started_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00990" name="l00990"></a><span class="lineno"> 990</span>}</div>
|
|
<div class="line"><a id="l00991" name="l00991"></a><span class="lineno"> 991</span> </div>
|
|
<div class="line"><a id="l00992" name="l00992"></a><span class="lineno"> 992</span><span class="keywordtype">bool</span> FilteredHeuristicCloseNodesLNSOperator::IncrementPosition() {</div>
|
|
<div class="line"><a id="l00993" name="l00993"></a><span class="lineno"> 993</span> <span class="keywordflow">if</span> (just_started_) {</div>
|
|
<div class="line"><a id="l00994" name="l00994"></a><span class="lineno"> 994</span> just_started_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00995" name="l00995"></a><span class="lineno"> 995</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</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"> 997</span> ++current_node_ %= <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">Size</a>();</div>
|
|
<div class="line"><a id="l00998" name="l00998"></a><span class="lineno"> 998</span> <span class="keywordflow">return</span> current_node_ != last_node_;</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"> 1000</span> </div>
|
|
<div class="line"><a id="l01001" name="l01001"></a><span class="lineno"> 1001</span><span class="keywordtype">void</span> FilteredHeuristicCloseNodesLNSOperator::RemoveNode(int64_t node) {</div>
|
|
<div class="line"><a id="l01002" name="l01002"></a><span class="lineno"> 1002</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!<a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#acf67dc202e247ce193038850f71306d3">IsEnd</a>(node) && !<a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a3582f01eabc65ba4b801215ca6420a7c">IsStart</a>(node));</div>
|
|
<div class="line"><a id="l01003" name="l01003"></a><span class="lineno"> 1003</span> <a class="code hl_define" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(<a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a3c7b6e2c172f34aad1d952d799be61f2">Value</a>(node), node);</div>
|
|
<div class="line"><a id="l01004" name="l01004"></a><span class="lineno"> 1004</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(IsActive(node));</div>
|
|
<div class="line"><a id="l01005" name="l01005"></a><span class="lineno"> 1005</span> </div>
|
|
<div class="line"><a id="l01006" name="l01006"></a><span class="lineno"> 1006</span> <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#ad988ac45a63930f901dc11713434b945">removed_nodes_</a>.<a class="code hl_function" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(node);</div>
|
|
<div class="line"><a id="l01007" name="l01007"></a><span class="lineno"> 1007</span> <span class="keyword">const</span> int64_t prev = Prev(node);</div>
|
|
<div class="line"><a id="l01008" name="l01008"></a><span class="lineno"> 1008</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = Next(node);</div>
|
|
<div class="line"><a id="l01009" name="l01009"></a><span class="lineno"> 1009</span> changed_nexts_.<a class="code hl_function" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(prev);</div>
|
|
<div class="line"><a id="l01010" name="l01010"></a><span class="lineno"> 1010</span> new_nexts_[prev] = <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a id="l01011" name="l01011"></a><span class="lineno"> 1011</span> <span class="keywordflow">if</span> (next < model_-><a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a24926108b770033792d015cb86aeffb3">Size</a>()) {</div>
|
|
<div class="line"><a id="l01012" name="l01012"></a><span class="lineno"> 1012</span> changed_prevs_.<a class="code hl_function" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a id="l01013" name="l01013"></a><span class="lineno"> 1013</span> new_prevs_[<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>] = prev;</div>
|
|
<div class="line"><a id="l01014" name="l01014"></a><span class="lineno"> 1014</span> }</div>
|
|
<div class="line"><a id="l01015" name="l01015"></a><span class="lineno"> 1015</span>}</div>
|
|
<div class="line"><a id="l01016" name="l01016"></a><span class="lineno"> 1016</span> </div>
|
|
<div class="line"><a id="l01017" name="l01017"></a><span class="lineno"> 1017</span><span class="keywordtype">void</span> FilteredHeuristicCloseNodesLNSOperator::RemoveNodeAndActiveSibling(</div>
|
|
<div class="line"><a id="l01018" name="l01018"></a><span class="lineno"> 1018</span> int64_t node) {</div>
|
|
<div class="line"><a id="l01019" name="l01019"></a><span class="lineno"> 1019</span> <span class="keywordflow">if</span> (!IsActive(node)) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l01020" name="l01020"></a><span class="lineno"> 1020</span> RemoveNode(node);</div>
|
|
<div class="line"><a id="l01021" name="l01021"></a><span class="lineno"> 1021</span> </div>
|
|
<div class="line"><a id="l01022" name="l01022"></a><span class="lineno"> 1022</span> <span class="keywordflow">for</span> (int64_t sibling_node : GetActiveSiblings(node)) {</div>
|
|
<div class="line"><a id="l01023" name="l01023"></a><span class="lineno"> 1023</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a3582f01eabc65ba4b801215ca6420a7c">IsStart</a>(sibling_node) && !<a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#acf67dc202e247ce193038850f71306d3">IsEnd</a>(sibling_node)) {</div>
|
|
<div class="line"><a id="l01024" name="l01024"></a><span class="lineno"> 1024</span> RemoveNode(sibling_node);</div>
|
|
<div class="line"><a id="l01025" name="l01025"></a><span class="lineno"> 1025</span> }</div>
|
|
<div class="line"><a id="l01026" name="l01026"></a><span class="lineno"> 1026</span> }</div>
|
|
<div class="line"><a id="l01027" name="l01027"></a><span class="lineno"> 1027</span>}</div>
|
|
<div class="line"><a id="l01028" name="l01028"></a><span class="lineno"> 1028</span> </div>
|
|
<div class="line"><a id="l01029" name="l01029"></a><span class="lineno"> 1029</span>std::vector<int64_t> FilteredHeuristicCloseNodesLNSOperator::GetActiveSiblings(</div>
|
|
<div class="line"><a id="l01030" name="l01030"></a><span class="lineno"> 1030</span> int64_t node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l01031" name="l01031"></a><span class="lineno"> 1031</span> <span class="comment">// NOTE: In most use-cases, where each node is a pickup or delivery in a</span></div>
|
|
<div class="line"><a id="l01032" name="l01032"></a><span class="lineno"> 1032</span> <span class="comment">// single index pair, this function is in O(k) where k is the number of</span></div>
|
|
<div class="line"><a id="l01033" name="l01033"></a><span class="lineno"> 1033</span> <span class="comment">// alternative deliveries or pickups for this index pair.</span></div>
|
|
<div class="line"><a id="l01034" name="l01034"></a><span class="lineno"> 1034</span> std::vector<int64_t> active_siblings;</div>
|
|
<div class="line"><a id="l01035" name="l01035"></a><span class="lineno"> 1035</span> <span class="keywordflow">for</span> (std::pair<int64_t, int64_t> index_pair :</div>
|
|
<div class="line"><a id="l01036" name="l01036"></a><span class="lineno"> 1036</span> <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#ac6d5e197d4c8db922db0b8e2a8b7074e">GetPickupIndexPairs</a>(node)) {</div>
|
|
<div class="line"><a id="l01037" name="l01037"></a><span class="lineno"> 1037</span> <span class="keywordflow">for</span> (int64_t sibling_delivery :</div>
|
|
<div class="line"><a id="l01038" name="l01038"></a><span class="lineno"> 1038</span> pickup_delivery_pairs_[index_pair.first].second) {</div>
|
|
<div class="line"><a id="l01039" name="l01039"></a><span class="lineno"> 1039</span> <span class="keywordflow">if</span> (IsActive(sibling_delivery)) {</div>
|
|
<div class="line"><a id="l01040" name="l01040"></a><span class="lineno"> 1040</span> active_siblings.push_back(sibling_delivery);</div>
|
|
<div class="line"><a id="l01041" name="l01041"></a><span class="lineno"> 1041</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l01042" name="l01042"></a><span class="lineno"> 1042</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> }</div>
|
|
<div class="line"><a id="l01045" name="l01045"></a><span class="lineno"> 1045</span> <span class="keywordflow">for</span> (std::pair<int64_t, int64_t> index_pair :</div>
|
|
<div class="line"><a id="l01046" name="l01046"></a><span class="lineno"> 1046</span> <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a434b15d056c7e1751925eba475e84c32">GetDeliveryIndexPairs</a>(node)) {</div>
|
|
<div class="line"><a id="l01047" name="l01047"></a><span class="lineno"> 1047</span> <span class="keywordflow">for</span> (int64_t sibling_pickup :</div>
|
|
<div class="line"><a id="l01048" name="l01048"></a><span class="lineno"> 1048</span> pickup_delivery_pairs_[index_pair.first].first) {</div>
|
|
<div class="line"><a id="l01049" name="l01049"></a><span class="lineno"> 1049</span> <span class="keywordflow">if</span> (IsActive(sibling_pickup)) {</div>
|
|
<div class="line"><a id="l01050" name="l01050"></a><span class="lineno"> 1050</span> active_siblings.push_back(sibling_pickup);</div>
|
|
<div class="line"><a id="l01051" name="l01051"></a><span class="lineno"> 1051</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l01052" name="l01052"></a><span class="lineno"> 1052</span> }</div>
|
|
<div class="line"><a id="l01053" name="l01053"></a><span class="lineno"> 1053</span> }</div>
|
|
<div class="line"><a id="l01054" name="l01054"></a><span class="lineno"> 1054</span> }</div>
|
|
<div class="line"><a id="l01055" name="l01055"></a><span class="lineno"> 1055</span> <span class="keywordflow">return</span> active_siblings;</div>
|
|
<div class="line"><a id="l01056" name="l01056"></a><span class="lineno"> 1056</span>}</div>
|
|
<div class="line"><a id="l01057" name="l01057"></a><span class="lineno"> 1057</span> </div>
|
|
<div class="line"><a id="l01058" name="l01058"></a><span class="lineno"> 1058</span>std::function<int64_t(int64_t)></div>
|
|
<div class="line"><a id="l01059" name="l01059"></a><span class="lineno"> 1059</span>FilteredHeuristicCloseNodesLNSOperator::SetupNextAccessorForNeighbor() {</div>
|
|
<div class="line"><a id="l01060" name="l01060"></a><span class="lineno"> 1060</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a3582f01eabc65ba4b801215ca6420a7c">IsStart</a>(current_node_)) {</div>
|
|
<div class="line"><a id="l01061" name="l01061"></a><span class="lineno"> 1061</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l01062" name="l01062"></a><span class="lineno"> 1062</span> }</div>
|
|
<div class="line"><a id="l01063" name="l01063"></a><span class="lineno"> 1063</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!<a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#acf67dc202e247ce193038850f71306d3">IsEnd</a>(current_node_));</div>
|
|
<div class="line"><a id="l01064" name="l01064"></a><span class="lineno"> 1064</span> </div>
|
|
<div class="line"><a id="l01065" name="l01065"></a><span class="lineno"> 1065</span> changed_nexts_.<a class="code hl_function" href="classoperations__research_1_1_sparse_bitset.html#ab4bc8236a9bfe59526e353800a0f0470">SparseClearAll</a>();</div>
|
|
<div class="line"><a id="l01066" name="l01066"></a><span class="lineno"> 1066</span> changed_prevs_.<a class="code hl_function" href="classoperations__research_1_1_sparse_bitset.html#ab4bc8236a9bfe59526e353800a0f0470">SparseClearAll</a>();</div>
|
|
<div class="line"><a id="l01067" name="l01067"></a><span class="lineno"> 1067</span> </div>
|
|
<div class="line"><a id="l01068" name="l01068"></a><span class="lineno"> 1068</span> RemoveNodeAndActiveSibling(current_node_);</div>
|
|
<div class="line"><a id="l01069" name="l01069"></a><span class="lineno"> 1069</span> </div>
|
|
<div class="line"><a id="l01070" name="l01070"></a><span class="lineno"> 1070</span> <span class="keywordflow">for</span> (int64_t neighbor : close_nodes_[current_node_]) {</div>
|
|
<div class="line"><a id="l01071" name="l01071"></a><span class="lineno"> 1071</span> RemoveNodeAndActiveSibling(neighbor);</div>
|
|
<div class="line"><a id="l01072" name="l01072"></a><span class="lineno"> 1072</span> }</div>
|
|
<div class="line"><a id="l01073" name="l01073"></a><span class="lineno"> 1073</span> </div>
|
|
<div class="line"><a id="l01074" name="l01074"></a><span class="lineno"> 1074</span> <span class="keywordflow">return</span> [<span class="keyword">this</span>](int64_t node) { <span class="keywordflow">return</span> Next(node); };</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="comment">// FilteredHeuristicExpensiveChainLNSOperator</span></div>
|
|
<div class="line"><a id="l01078" name="l01078"></a><span class="lineno"> 1078</span> </div>
|
|
<div class="line"><a id="l01079" name="l01079"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_filtered_heuristic_expensive_chain_l_n_s_operator.html#a2f370584bd079a49b94a11d2700f9bab"> 1079</a></span><a class="code hl_function" href="classoperations__research_1_1_filtered_heuristic_expensive_chain_l_n_s_operator.html#a2f370584bd079a49b94a11d2700f9bab">FilteredHeuristicExpensiveChainLNSOperator::</a></div>
|
|
<div class="line"><a id="l01080" name="l01080"></a><span class="lineno"> 1080</span><a class="code hl_function" href="classoperations__research_1_1_filtered_heuristic_expensive_chain_l_n_s_operator.html#a2f370584bd079a49b94a11d2700f9bab"> FilteredHeuristicExpensiveChainLNSOperator</a>(</div>
|
|
<div class="line"><a id="l01081" name="l01081"></a><span class="lineno"> 1081</span> std::unique_ptr<RoutingFilteredHeuristic> heuristic,</div>
|
|
<div class="line"><a id="l01082" name="l01082"></a><span class="lineno"> 1082</span> <span class="keywordtype">int</span> num_arcs_to_consider,</div>
|
|
<div class="line"><a id="l01083" name="l01083"></a><span class="lineno"> 1083</span> std::function<int64_t(int64_t, int64_t, int64_t)></div>
|
|
<div class="line"><a id="l01084" name="l01084"></a><span class="lineno"> 1084</span> arc_cost_for_route_start)</div>
|
|
<div class="line"><a id="l01085" name="l01085"></a><span class="lineno"> 1085</span> : <a class="code hl_class" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html">FilteredHeuristicLocalSearchOperator</a>(<a class="code hl_namespace" href="namespacestd.html">std</a>::move(heuristic)),</div>
|
|
<div class="line"><a id="l01086" name="l01086"></a><span class="lineno"> 1086</span> current_route_(0),</div>
|
|
<div class="line"><a id="l01087" name="l01087"></a><span class="lineno"> 1087</span> last_route_(0),</div>
|
|
<div class="line"><a id="l01088" name="l01088"></a><span class="lineno"> 1088</span> num_arcs_to_consider_(num_arcs_to_consider),</div>
|
|
<div class="line"><a id="l01089" name="l01089"></a><span class="lineno"> 1089</span> current_expensive_arc_indices_({-1, -1}),</div>
|
|
<div class="line"><a id="l01090" name="l01090"></a><span class="lineno"> 1090</span> arc_cost_for_route_start_(std::move(arc_cost_for_route_start)),</div>
|
|
<div class="line"><a id="l01091" name="l01091"></a><span class="lineno"> 1091</span> just_started_(<span class="keyword">false</span>) {</div>
|
|
<div class="line"><a id="l01092" name="l01092"></a><span class="lineno"> 1092</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(num_arcs_to_consider_, 2);</div>
|
|
<div class="line"><a id="l01093" name="l01093"></a><span class="lineno"> 1093</span>}</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><span class="keywordtype">void</span> FilteredHeuristicExpensiveChainLNSOperator::OnStart() {</div>
|
|
<div class="line"><a id="l01096" name="l01096"></a><span class="lineno"> 1096</span> last_route_ = current_route_;</div>
|
|
<div class="line"><a id="l01097" name="l01097"></a><span class="lineno"> 1097</span> just_started_ = <span class="keyword">true</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> </div>
|
|
<div class="line"><a id="l01100" name="l01100"></a><span class="lineno"> 1100</span><span class="keywordtype">bool</span> FilteredHeuristicExpensiveChainLNSOperator::IncrementPosition() {</div>
|
|
<div class="line"><a id="l01101" name="l01101"></a><span class="lineno"> 1101</span> <span class="keywordflow">if</span> (just_started_) {</div>
|
|
<div class="line"><a id="l01102" name="l01102"></a><span class="lineno"> 1102</span> just_started_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01103" name="l01103"></a><span class="lineno"> 1103</span> <span class="keywordflow">return</span> FindMostExpensiveChainsOnRemainingRoutes();</div>
|
|
<div class="line"><a id="l01104" name="l01104"></a><span class="lineno"> 1104</span> }</div>
|
|
<div class="line"><a id="l01105" name="l01105"></a><span class="lineno"> 1105</span> </div>
|
|
<div class="line"><a id="l01106" name="l01106"></a><span class="lineno"> 1106</span> <span class="keywordflow">if</span> (IncrementCurrentArcIndices()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01107" name="l01107"></a><span class="lineno"> 1107</span> </div>
|
|
<div class="line"><a id="l01108" name="l01108"></a><span class="lineno"> 1108</span> <span class="keywordflow">return</span> IncrementRoute() && FindMostExpensiveChainsOnRemainingRoutes();</div>
|
|
<div class="line"><a id="l01109" name="l01109"></a><span class="lineno"> 1109</span>}</div>
|
|
<div class="line"><a id="l01110" name="l01110"></a><span class="lineno"> 1110</span> </div>
|
|
<div class="line"><a id="l01111" name="l01111"></a><span class="lineno"> 1111</span>std::function<int64_t(int64_t)></div>
|
|
<div class="line"><a id="l01112" name="l01112"></a><span class="lineno"> 1112</span>FilteredHeuristicExpensiveChainLNSOperator::SetupNextAccessorForNeighbor() {</div>
|
|
<div class="line"><a id="l01113" name="l01113"></a><span class="lineno"> 1113</span> <span class="keyword">const</span> <span class="keywordtype">int</span> first_arc_index = current_expensive_arc_indices_.first;</div>
|
|
<div class="line"><a id="l01114" name="l01114"></a><span class="lineno"> 1114</span> <span class="keyword">const</span> <span class="keywordtype">int</span> second_arc_index = current_expensive_arc_indices_.second;</div>
|
|
<div class="line"><a id="l01115" name="l01115"></a><span class="lineno"> 1115</span> <a class="code hl_define" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(0, first_arc_index);</div>
|
|
<div class="line"><a id="l01116" name="l01116"></a><span class="lineno"> 1116</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(first_arc_index, second_arc_index);</div>
|
|
<div class="line"><a id="l01117" name="l01117"></a><span class="lineno"> 1117</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(second_arc_index, most_expensive_arc_starts_and_ranks_.size());</div>
|
|
<div class="line"><a id="l01118" name="l01118"></a><span class="lineno"> 1118</span> </div>
|
|
<div class="line"><a id="l01119" name="l01119"></a><span class="lineno"> 1119</span> <span class="keyword">const</span> std::pair<int, int>& first_start_and_rank =</div>
|
|
<div class="line"><a id="l01120" name="l01120"></a><span class="lineno"> 1120</span> most_expensive_arc_starts_and_ranks_[first_arc_index];</div>
|
|
<div class="line"><a id="l01121" name="l01121"></a><span class="lineno"> 1121</span> <span class="keyword">const</span> std::pair<int, int>& second_start_and_rank =</div>
|
|
<div class="line"><a id="l01122" name="l01122"></a><span class="lineno"> 1122</span> most_expensive_arc_starts_and_ranks_[second_arc_index];</div>
|
|
<div class="line"><a id="l01123" name="l01123"></a><span class="lineno"> 1123</span> int64_t before_chain, after_chain;</div>
|
|
<div class="line"><a id="l01124" name="l01124"></a><span class="lineno"> 1124</span> <span class="keywordflow">if</span> (first_start_and_rank.second < second_start_and_rank.second) {</div>
|
|
<div class="line"><a id="l01125" name="l01125"></a><span class="lineno"> 1125</span> before_chain = first_start_and_rank.first;</div>
|
|
<div class="line"><a id="l01126" name="l01126"></a><span class="lineno"> 1126</span> after_chain = <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a79163ea8990864f185e87eabf1578cca">OldValue</a>(second_start_and_rank.first);</div>
|
|
<div class="line"><a id="l01127" name="l01127"></a><span class="lineno"> 1127</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l01128" name="l01128"></a><span class="lineno"> 1128</span> before_chain = second_start_and_rank.first;</div>
|
|
<div class="line"><a id="l01129" name="l01129"></a><span class="lineno"> 1129</span> after_chain = <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a79163ea8990864f185e87eabf1578cca">OldValue</a>(first_start_and_rank.first);</div>
|
|
<div class="line"><a id="l01130" name="l01130"></a><span class="lineno"> 1130</span> }</div>
|
|
<div class="line"><a id="l01131" name="l01131"></a><span class="lineno"> 1131</span> </div>
|
|
<div class="line"><a id="l01132" name="l01132"></a><span class="lineno"> 1132</span> <span class="keywordtype">int</span> node = <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a3c7b6e2c172f34aad1d952d799be61f2">Value</a>(before_chain);</div>
|
|
<div class="line"><a id="l01133" name="l01133"></a><span class="lineno"> 1133</span> <span class="keywordflow">while</span> (node != after_chain) {</div>
|
|
<div class="line"><a id="l01134" name="l01134"></a><span class="lineno"> 1134</span> <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#ad988ac45a63930f901dc11713434b945">removed_nodes_</a>.<a class="code hl_function" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(node);</div>
|
|
<div class="line"><a id="l01135" name="l01135"></a><span class="lineno"> 1135</span> node = <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a3c7b6e2c172f34aad1d952d799be61f2">Value</a>(node);</div>
|
|
<div class="line"><a id="l01136" name="l01136"></a><span class="lineno"> 1136</span> }</div>
|
|
<div class="line"><a id="l01137" name="l01137"></a><span class="lineno"> 1137</span> </div>
|
|
<div class="line"><a id="l01138" name="l01138"></a><span class="lineno"> 1138</span> <span class="keywordflow">return</span> [<span class="keyword">this</span>, before_chain, after_chain](int64_t node) {</div>
|
|
<div class="line"><a id="l01139" name="l01139"></a><span class="lineno"> 1139</span> <span class="keywordflow">if</span> (node == before_chain) <span class="keywordflow">return</span> after_chain;</div>
|
|
<div class="line"><a id="l01140" name="l01140"></a><span class="lineno"> 1140</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_var_local_search_operator.html#a79163ea8990864f185e87eabf1578cca">OldValue</a>(node);</div>
|
|
<div class="line"><a id="l01141" name="l01141"></a><span class="lineno"> 1141</span> };</div>
|
|
<div class="line"><a id="l01142" name="l01142"></a><span class="lineno"> 1142</span>}</div>
|
|
<div class="line"><a id="l01143" name="l01143"></a><span class="lineno"> 1143</span> </div>
|
|
<div class="line"><a id="l01144" name="l01144"></a><span class="lineno"> 1144</span><span class="keywordtype">bool</span> FilteredHeuristicExpensiveChainLNSOperator::IncrementRoute() {</div>
|
|
<div class="line"><a id="l01145" name="l01145"></a><span class="lineno"> 1145</span> ++current_route_ %= <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>();</div>
|
|
<div class="line"><a id="l01146" name="l01146"></a><span class="lineno"> 1146</span> <span class="keywordflow">return</span> current_route_ != last_route_;</div>
|
|
<div class="line"><a id="l01147" name="l01147"></a><span class="lineno"> 1147</span>}</div>
|
|
<div class="line"><a id="l01148" name="l01148"></a><span class="lineno"> 1148</span> </div>
|
|
<div class="line"><a id="l01149" name="l01149"></a><span class="lineno"> 1149</span><span class="keywordtype">bool</span> FilteredHeuristicExpensiveChainLNSOperator::IncrementCurrentArcIndices() {</div>
|
|
<div class="line"><a id="l01150" name="l01150"></a><span class="lineno"> 1150</span> <span class="keywordtype">int</span>& second_index = current_expensive_arc_indices_.second;</div>
|
|
<div class="line"><a id="l01151" name="l01151"></a><span class="lineno"> 1151</span> <span class="keywordflow">if</span> (++second_index < most_expensive_arc_starts_and_ranks_.size()) {</div>
|
|
<div class="line"><a id="l01152" name="l01152"></a><span class="lineno"> 1152</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01153" name="l01153"></a><span class="lineno"> 1153</span> }</div>
|
|
<div class="line"><a id="l01154" name="l01154"></a><span class="lineno"> 1154</span> <span class="keywordtype">int</span>& first_index = current_expensive_arc_indices_.first;</div>
|
|
<div class="line"><a id="l01155" name="l01155"></a><span class="lineno"> 1155</span> <span class="keywordflow">if</span> (first_index + 2 < most_expensive_arc_starts_and_ranks_.size()) {</div>
|
|
<div class="line"><a id="l01156" name="l01156"></a><span class="lineno"> 1156</span> first_index++;</div>
|
|
<div class="line"><a id="l01157" name="l01157"></a><span class="lineno"> 1157</span> second_index = first_index + 1;</div>
|
|
<div class="line"><a id="l01158" name="l01158"></a><span class="lineno"> 1158</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01159" name="l01159"></a><span class="lineno"> 1159</span> }</div>
|
|
<div class="line"><a id="l01160" name="l01160"></a><span class="lineno"> 1160</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01161" name="l01161"></a><span class="lineno"> 1161</span>}</div>
|
|
<div class="line"><a id="l01162" name="l01162"></a><span class="lineno"> 1162</span> </div>
|
|
<div class="line"><a id="l01163" name="l01163"></a><span class="lineno"> 1163</span><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l01164" name="l01164"></a><span class="lineno"> 1164</span> </div>
|
|
<div class="line"><a id="l01165" name="l01165"></a><span class="lineno"> 1165</span><span class="comment">// Returns false if the route starting with 'start' is empty. Otherwise sets</span></div>
|
|
<div class="line"><a id="l01166" name="l01166"></a><span class="lineno"> 1166</span><span class="comment">// most_expensive_arc_starts_and_ranks and first_expensive_arc_indices according</span></div>
|
|
<div class="line"><a id="l01167" name="l01167"></a><span class="lineno"> 1167</span><span class="comment">// to the most expensive chains on the route, and returns true.</span></div>
|
|
<div class="line"><a id="l01168" name="l01168"></a><span class="lineno"> 1168</span><span class="keywordtype">bool</span> FindMostExpensiveArcsOnRoute(</div>
|
|
<div class="line"><a id="l01169" name="l01169"></a><span class="lineno"> 1169</span> <span class="keywordtype">int</span> num_arcs, int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>,</div>
|
|
<div class="line"><a id="l01170" name="l01170"></a><span class="lineno"> 1170</span> <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l01171" name="l01171"></a><span class="lineno"> 1171</span> <span class="keyword">const</span> std::function<<span class="keywordtype">bool</span>(int64_t)>& is_end,</div>
|
|
<div class="line"><a id="l01172" name="l01172"></a><span class="lineno"> 1172</span> <span class="keyword">const</span> std::function<int64_t(int64_t, int64_t, int64_t)>&</div>
|
|
<div class="line"><a id="l01173" name="l01173"></a><span class="lineno"> 1173</span> arc_cost_for_route_start,</div>
|
|
<div class="line"><a id="l01174" name="l01174"></a><span class="lineno"> 1174</span> std::vector<std::pair<int64_t, int>>* most_expensive_arc_starts_and_ranks,</div>
|
|
<div class="line"><a id="l01175" name="l01175"></a><span class="lineno"> 1175</span> std::pair<int, int>* first_expensive_arc_indices) {</div>
|
|
<div class="line"><a id="l01176" name="l01176"></a><span class="lineno"> 1176</span> <span class="keywordflow">if</span> (is_end(next_accessor(<a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>))) {</div>
|
|
<div class="line"><a id="l01177" name="l01177"></a><span class="lineno"> 1177</span> <span class="comment">// Empty route.</span></div>
|
|
<div class="line"><a id="l01178" name="l01178"></a><span class="lineno"> 1178</span> *first_expensive_arc_indices = {-1, -1};</div>
|
|
<div class="line"><a id="l01179" name="l01179"></a><span class="lineno"> 1179</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01180" name="l01180"></a><span class="lineno"> 1180</span> }</div>
|
|
<div class="line"><a id="l01181" name="l01181"></a><span class="lineno"> 1181</span> </div>
|
|
<div class="line"><a id="l01182" name="l01182"></a><span class="lineno"> 1182</span> <span class="comment">// NOTE: The negative ranks are so that for a given cost, lower ranks are</span></div>
|
|
<div class="line"><a id="l01183" name="l01183"></a><span class="lineno"> 1183</span> <span class="comment">// given higher priority.</span></div>
|
|
<div class="line"><a id="l01184" name="l01184"></a><span class="lineno"> 1184</span> <span class="keyword">using</span> ArcCostNegativeRankStart = std::tuple<int64_t, int, int64_t>;</div>
|
|
<div class="line"><a id="l01185" name="l01185"></a><span class="lineno"> 1185</span> std::priority_queue<ArcCostNegativeRankStart,</div>
|
|
<div class="line"><a id="l01186" name="l01186"></a><span class="lineno"> 1186</span> std::vector<ArcCostNegativeRankStart>,</div>
|
|
<div class="line"><a id="l01187" name="l01187"></a><span class="lineno"> 1187</span> std::greater<ArcCostNegativeRankStart>></div>
|
|
<div class="line"><a id="l01188" name="l01188"></a><span class="lineno"> 1188</span> arc_info_pq;</div>
|
|
<div class="line"><a id="l01189" name="l01189"></a><span class="lineno"> 1189</span> </div>
|
|
<div class="line"><a id="l01190" name="l01190"></a><span class="lineno"> 1190</span> int64_t before_node = <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>;</div>
|
|
<div class="line"><a id="l01191" name="l01191"></a><span class="lineno"> 1191</span> <span class="keywordtype">int</span> rank = 0;</div>
|
|
<div class="line"><a id="l01192" name="l01192"></a><span class="lineno"> 1192</span> <span class="keywordflow">while</span> (!is_end(before_node)) {</div>
|
|
<div class="line"><a id="l01193" name="l01193"></a><span class="lineno"> 1193</span> <span class="keyword">const</span> int64_t after_node = next_accessor(before_node);</div>
|
|
<div class="line"><a id="l01194" name="l01194"></a><span class="lineno"> 1194</span> <span class="keyword">const</span> int64_t arc_cost =</div>
|
|
<div class="line"><a id="l01195" name="l01195"></a><span class="lineno"> 1195</span> arc_cost_for_route_start(before_node, after_node, <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>);</div>
|
|
<div class="line"><a id="l01196" name="l01196"></a><span class="lineno"> 1196</span> arc_info_pq.emplace(arc_cost, -rank, before_node);</div>
|
|
<div class="line"><a id="l01197" name="l01197"></a><span class="lineno"> 1197</span> </div>
|
|
<div class="line"><a id="l01198" name="l01198"></a><span class="lineno"> 1198</span> before_node = after_node;</div>
|
|
<div class="line"><a id="l01199" name="l01199"></a><span class="lineno"> 1199</span> rank++;</div>
|
|
<div class="line"><a id="l01200" name="l01200"></a><span class="lineno"> 1200</span> </div>
|
|
<div class="line"><a id="l01201" name="l01201"></a><span class="lineno"> 1201</span> <span class="keywordflow">if</span> (rank > num_arcs) {</div>
|
|
<div class="line"><a id="l01202" name="l01202"></a><span class="lineno"> 1202</span> arc_info_pq.pop();</div>
|
|
<div class="line"><a id="l01203" name="l01203"></a><span class="lineno"> 1203</span> }</div>
|
|
<div class="line"><a id="l01204" name="l01204"></a><span class="lineno"> 1204</span> }</div>
|
|
<div class="line"><a id="l01205" name="l01205"></a><span class="lineno"> 1205</span> </div>
|
|
<div class="line"><a id="l01206" name="l01206"></a><span class="lineno"> 1206</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(rank, 2);</div>
|
|
<div class="line"><a id="l01207" name="l01207"></a><span class="lineno"> 1207</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(arc_info_pq.size(), <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(rank, num_arcs));</div>
|
|
<div class="line"><a id="l01208" name="l01208"></a><span class="lineno"> 1208</span> </div>
|
|
<div class="line"><a id="l01209" name="l01209"></a><span class="lineno"> 1209</span> most_expensive_arc_starts_and_ranks->resize(arc_info_pq.size());</div>
|
|
<div class="line"><a id="l01210" name="l01210"></a><span class="lineno"> 1210</span> <span class="keywordtype">int</span> arc_index = arc_info_pq.size() - 1;</div>
|
|
<div class="line"><a id="l01211" name="l01211"></a><span class="lineno"> 1211</span> <span class="keywordflow">while</span> (!arc_info_pq.empty()) {</div>
|
|
<div class="line"><a id="l01212" name="l01212"></a><span class="lineno"> 1212</span> <span class="keyword">const</span> ArcCostNegativeRankStart& arc_info = arc_info_pq.top();</div>
|
|
<div class="line"><a id="l01213" name="l01213"></a><span class="lineno"> 1213</span> (*most_expensive_arc_starts_and_ranks)[arc_index] = {</div>
|
|
<div class="line"><a id="l01214" name="l01214"></a><span class="lineno"> 1214</span> std::get<2>(arc_info), -std::get<1>(arc_info)};</div>
|
|
<div class="line"><a id="l01215" name="l01215"></a><span class="lineno"> 1215</span> arc_index--;</div>
|
|
<div class="line"><a id="l01216" name="l01216"></a><span class="lineno"> 1216</span> arc_info_pq.pop();</div>
|
|
<div class="line"><a id="l01217" name="l01217"></a><span class="lineno"> 1217</span> }</div>
|
|
<div class="line"><a id="l01218" name="l01218"></a><span class="lineno"> 1218</span> </div>
|
|
<div class="line"><a id="l01219" name="l01219"></a><span class="lineno"> 1219</span> *first_expensive_arc_indices = {0, 1};</div>
|
|
<div class="line"><a id="l01220" name="l01220"></a><span class="lineno"> 1220</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01221" name="l01221"></a><span class="lineno"> 1221</span>}</div>
|
|
<div class="line"><a id="l01222" name="l01222"></a><span class="lineno"> 1222</span> </div>
|
|
<div class="line"><a id="l01223" name="l01223"></a><span class="lineno"> 1223</span>} <span class="comment">// namespace</span></div>
|
|
<div class="line"><a id="l01224" name="l01224"></a><span class="lineno"> 1224</span> </div>
|
|
<div class="line"><a id="l01225" name="l01225"></a><span class="lineno"> 1225</span><span class="keywordtype">bool</span> FilteredHeuristicExpensiveChainLNSOperator::</div>
|
|
<div class="line"><a id="l01226" name="l01226"></a><span class="lineno"> 1226</span> FindMostExpensiveChainsOnRemainingRoutes() {</div>
|
|
<div class="line"><a id="l01227" name="l01227"></a><span class="lineno"> 1227</span> <span class="keywordflow">do</span> {</div>
|
|
<div class="line"><a id="l01228" name="l01228"></a><span class="lineno"> 1228</span> <span class="keywordflow">if</span> (FindMostExpensiveArcsOnRoute(</div>
|
|
<div class="line"><a id="l01229" name="l01229"></a><span class="lineno"> 1229</span> num_arcs_to_consider_, <a class="code hl_variable" href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">model_</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(current_route_),</div>
|
|
<div class="line"><a id="l01230" name="l01230"></a><span class="lineno"> 1230</span> [<span class="keyword">this</span>](int64_t i) { return OldValue(i); },</div>
|
|
<div class="line"><a id="l01231" name="l01231"></a><span class="lineno"> 1231</span> [<span class="keyword">this</span>](int64_t node) { return model_->IsEnd(node); },</div>
|
|
<div class="line"><a id="l01232" name="l01232"></a><span class="lineno"> 1232</span> arc_cost_for_route_start_, &most_expensive_arc_starts_and_ranks_,</div>
|
|
<div class="line"><a id="l01233" name="l01233"></a><span class="lineno"> 1233</span> &current_expensive_arc_indices_)) {</div>
|
|
<div class="line"><a id="l01234" name="l01234"></a><span class="lineno"> 1234</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01235" name="l01235"></a><span class="lineno"> 1235</span> }</div>
|
|
<div class="line"><a id="l01236" name="l01236"></a><span class="lineno"> 1236</span> } <span class="keywordflow">while</span> (IncrementRoute());</div>
|
|
<div class="line"><a id="l01237" name="l01237"></a><span class="lineno"> 1237</span> </div>
|
|
<div class="line"><a id="l01238" name="l01238"></a><span class="lineno"> 1238</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01239" name="l01239"></a><span class="lineno"> 1239</span>}</div>
|
|
<div class="line"><a id="l01240" name="l01240"></a><span class="lineno"> 1240</span> </div>
|
|
<div class="line"><a id="l01241" name="l01241"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_relocate_expensive_chain.html#ad036ef22c3dbe219d5502b2fb85a3128"> 1241</a></span><a class="code hl_function" href="classoperations__research_1_1_relocate_expensive_chain.html#ad036ef22c3dbe219d5502b2fb85a3128">RelocateExpensiveChain::RelocateExpensiveChain</a>(</div>
|
|
<div class="line"><a id="l01242" name="l01242"></a><span class="lineno"> 1242</span> <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a id="l01243" name="l01243"></a><span class="lineno"> 1243</span> <span class="keyword">const</span> std::vector<IntVar*>& secondary_vars,</div>
|
|
<div class="line"><a id="l01244" name="l01244"></a><span class="lineno"> 1244</span> std::function<<span class="keywordtype">int</span>(int64_t)> start_empty_path_class,</div>
|
|
<div class="line"><a id="l01245" name="l01245"></a><span class="lineno"> 1245</span> <span class="keywordtype">int</span> num_arcs_to_consider,</div>
|
|
<div class="line"><a id="l01246" name="l01246"></a><span class="lineno"> 1246</span> std::function<int64_t(int64_t, int64_t, int64_t)> arc_cost_for_path_start)</div>
|
|
<div class="line"><a id="l01247" name="l01247"></a><span class="lineno"> 1247</span> : <a class="code hl_class" href="classoperations__research_1_1_path_operator.html">PathOperator</a>(vars, secondary_vars, 1, false, false,</div>
|
|
<div class="line"><a id="l01248" name="l01248"></a><span class="lineno"> 1248</span> <a class="code hl_namespace" href="namespacestd.html">std</a>::move(start_empty_path_class)),</div>
|
|
<div class="line"><a id="l01249" name="l01249"></a><span class="lineno"> 1249</span> num_arcs_to_consider_(num_arcs_to_consider),</div>
|
|
<div class="line"><a id="l01250" name="l01250"></a><span class="lineno"> 1250</span> current_path_(0),</div>
|
|
<div class="line"><a id="l01251" name="l01251"></a><span class="lineno"> 1251</span> current_expensive_arc_indices_({-1, -1}),</div>
|
|
<div class="line"><a id="l01252" name="l01252"></a><span class="lineno"> 1252</span> arc_cost_for_path_start_(std::move(arc_cost_for_path_start)),</div>
|
|
<div class="line"><a id="l01253" name="l01253"></a><span class="lineno"> 1253</span> end_path_(0),</div>
|
|
<div class="line"><a id="l01254" name="l01254"></a><span class="lineno"> 1254</span> has_non_empty_paths_to_explore_(<span class="keyword">false</span>) {</div>
|
|
<div class="line"><a id="l01255" name="l01255"></a><span class="lineno"> 1255</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(num_arcs_to_consider_, 2);</div>
|
|
<div class="line"><a id="l01256" name="l01256"></a><span class="lineno"> 1256</span>}</div>
|
|
<div class="line"><a id="l01257" name="l01257"></a><span class="lineno"> 1257</span> </div>
|
|
<div class="line"><a id="l01258" name="l01258"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_relocate_expensive_chain.html#a24ea165f00f8e15de94958fc804ff209"> 1258</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_relocate_expensive_chain.html#a24ea165f00f8e15de94958fc804ff209">RelocateExpensiveChain::MakeNeighbor</a>() {</div>
|
|
<div class="line"><a id="l01259" name="l01259"></a><span class="lineno"> 1259</span> <span class="keyword">const</span> <span class="keywordtype">int</span> first_arc_index = current_expensive_arc_indices_.first;</div>
|
|
<div class="line"><a id="l01260" name="l01260"></a><span class="lineno"> 1260</span> <span class="keyword">const</span> <span class="keywordtype">int</span> second_arc_index = current_expensive_arc_indices_.second;</div>
|
|
<div class="line"><a id="l01261" name="l01261"></a><span class="lineno"> 1261</span> <a class="code hl_define" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(0, first_arc_index);</div>
|
|
<div class="line"><a id="l01262" name="l01262"></a><span class="lineno"> 1262</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(first_arc_index, second_arc_index);</div>
|
|
<div class="line"><a id="l01263" name="l01263"></a><span class="lineno"> 1263</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(second_arc_index, most_expensive_arc_starts_and_ranks_.size());</div>
|
|
<div class="line"><a id="l01264" name="l01264"></a><span class="lineno"> 1264</span> </div>
|
|
<div class="line"><a id="l01265" name="l01265"></a><span class="lineno"> 1265</span> <span class="keyword">const</span> std::pair<int, int>& first_start_and_rank =</div>
|
|
<div class="line"><a id="l01266" name="l01266"></a><span class="lineno"> 1266</span> most_expensive_arc_starts_and_ranks_[first_arc_index];</div>
|
|
<div class="line"><a id="l01267" name="l01267"></a><span class="lineno"> 1267</span> <span class="keyword">const</span> std::pair<int, int>& second_start_and_rank =</div>
|
|
<div class="line"><a id="l01268" name="l01268"></a><span class="lineno"> 1268</span> most_expensive_arc_starts_and_ranks_[second_arc_index];</div>
|
|
<div class="line"><a id="l01269" name="l01269"></a><span class="lineno"> 1269</span> <span class="keywordflow">if</span> (first_start_and_rank.second < second_start_and_rank.second) {</div>
|
|
<div class="line"><a id="l01270" name="l01270"></a><span class="lineno"> 1270</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a28146a7f59f91f25281c97d55abce60d">CheckChainValidity</a>(first_start_and_rank.first,</div>
|
|
<div class="line"><a id="l01271" name="l01271"></a><span class="lineno"> 1271</span> second_start_and_rank.first, <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(0)) &&</div>
|
|
<div class="line"><a id="l01272" name="l01272"></a><span class="lineno"> 1272</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a625a8523af421e43b7ac500b934e7dbd">MoveChain</a>(first_start_and_rank.first, second_start_and_rank.first,</div>
|
|
<div class="line"><a id="l01273" name="l01273"></a><span class="lineno"> 1273</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(0));</div>
|
|
<div class="line"><a id="l01274" name="l01274"></a><span class="lineno"> 1274</span> }</div>
|
|
<div class="line"><a id="l01275" name="l01275"></a><span class="lineno"> 1275</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a28146a7f59f91f25281c97d55abce60d">CheckChainValidity</a>(second_start_and_rank.first,</div>
|
|
<div class="line"><a id="l01276" name="l01276"></a><span class="lineno"> 1276</span> first_start_and_rank.first, <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(0)) &&</div>
|
|
<div class="line"><a id="l01277" name="l01277"></a><span class="lineno"> 1277</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a625a8523af421e43b7ac500b934e7dbd">MoveChain</a>(second_start_and_rank.first, first_start_and_rank.first,</div>
|
|
<div class="line"><a id="l01278" name="l01278"></a><span class="lineno"> 1278</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(0));</div>
|
|
<div class="line"><a id="l01279" name="l01279"></a><span class="lineno"> 1279</span>}</div>
|
|
<div class="line"><a id="l01280" name="l01280"></a><span class="lineno"> 1280</span> </div>
|
|
<div class="line"><a id="l01281" name="l01281"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_relocate_expensive_chain.html#ad14cde260686e5b4174e691675df3139"> 1281</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_relocate_expensive_chain.html#ad14cde260686e5b4174e691675df3139">RelocateExpensiveChain::MakeOneNeighbor</a>() {</div>
|
|
<div class="line"><a id="l01282" name="l01282"></a><span class="lineno"> 1282</span> <span class="keywordflow">while</span> (has_non_empty_paths_to_explore_) {</div>
|
|
<div class="line"><a id="l01283" name="l01283"></a><span class="lineno"> 1283</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ad14cde260686e5b4174e691675df3139">PathOperator::MakeOneNeighbor</a>()) {</div>
|
|
<div class="line"><a id="l01284" name="l01284"></a><span class="lineno"> 1284</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab661b8d8259dac8444804d91809fbb0a">ResetPosition</a>();</div>
|
|
<div class="line"><a id="l01285" name="l01285"></a><span class="lineno"> 1285</span> <span class="comment">// Move on to the next expensive arcs on the same path.</span></div>
|
|
<div class="line"><a id="l01286" name="l01286"></a><span class="lineno"> 1286</span> <span class="keywordflow">if</span> (IncrementCurrentArcIndices()) {</div>
|
|
<div class="line"><a id="l01287" name="l01287"></a><span class="lineno"> 1287</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01288" name="l01288"></a><span class="lineno"> 1288</span> }</div>
|
|
<div class="line"><a id="l01289" name="l01289"></a><span class="lineno"> 1289</span> <span class="comment">// Move on to the next non_empty path.</span></div>
|
|
<div class="line"><a id="l01290" name="l01290"></a><span class="lineno"> 1290</span> IncrementCurrentPath();</div>
|
|
<div class="line"><a id="l01291" name="l01291"></a><span class="lineno"> 1291</span> has_non_empty_paths_to_explore_ =</div>
|
|
<div class="line"><a id="l01292" name="l01292"></a><span class="lineno"> 1292</span> current_path_ != end_path_ &&</div>
|
|
<div class="line"><a id="l01293" name="l01293"></a><span class="lineno"> 1293</span> FindMostExpensiveChainsOnRemainingPaths();</div>
|
|
<div class="line"><a id="l01294" name="l01294"></a><span class="lineno"> 1294</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l01295" name="l01295"></a><span class="lineno"> 1295</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01296" name="l01296"></a><span class="lineno"> 1296</span> }</div>
|
|
<div class="line"><a id="l01297" name="l01297"></a><span class="lineno"> 1297</span> }</div>
|
|
<div class="line"><a id="l01298" name="l01298"></a><span class="lineno"> 1298</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01299" name="l01299"></a><span class="lineno"> 1299</span>}</div>
|
|
<div class="line"><a id="l01300" name="l01300"></a><span class="lineno"> 1300</span> </div>
|
|
<div class="line"><a id="l01301" name="l01301"></a><span class="lineno"> 1301</span><span class="keywordtype">void</span> RelocateExpensiveChain::OnNodeInitialization() {</div>
|
|
<div class="line"><a id="l01302" name="l01302"></a><span class="lineno"> 1302</span> <span class="keywordflow">if</span> (current_path_ >= <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a3493d43792939bc2a16ec5b53361095d">path_starts</a>().size()) {</div>
|
|
<div class="line"><a id="l01303" name="l01303"></a><span class="lineno"> 1303</span> <span class="comment">// current_path_ was made empty by last move (and it was the last non-empty</span></div>
|
|
<div class="line"><a id="l01304" name="l01304"></a><span class="lineno"> 1304</span> <span class="comment">// path), restart from 0.</span></div>
|
|
<div class="line"><a id="l01305" name="l01305"></a><span class="lineno"> 1305</span> current_path_ = 0;</div>
|
|
<div class="line"><a id="l01306" name="l01306"></a><span class="lineno"> 1306</span> }</div>
|
|
<div class="line"><a id="l01307" name="l01307"></a><span class="lineno"> 1307</span> end_path_ = current_path_;</div>
|
|
<div class="line"><a id="l01308" name="l01308"></a><span class="lineno"> 1308</span> has_non_empty_paths_to_explore_ = FindMostExpensiveChainsOnRemainingPaths();</div>
|
|
<div class="line"><a id="l01309" name="l01309"></a><span class="lineno"> 1309</span>}</div>
|
|
<div class="line"><a id="l01310" name="l01310"></a><span class="lineno"> 1310</span> </div>
|
|
<div class="line"><a id="l01311" name="l01311"></a><span class="lineno"> 1311</span><span class="keywordtype">void</span> RelocateExpensiveChain::IncrementCurrentPath() {</div>
|
|
<div class="line"><a id="l01312" name="l01312"></a><span class="lineno"> 1312</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_paths = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a3493d43792939bc2a16ec5b53361095d">path_starts</a>().size();</div>
|
|
<div class="line"><a id="l01313" name="l01313"></a><span class="lineno"> 1313</span> <span class="keywordflow">if</span> (++current_path_ == num_paths) {</div>
|
|
<div class="line"><a id="l01314" name="l01314"></a><span class="lineno"> 1314</span> current_path_ = 0;</div>
|
|
<div class="line"><a id="l01315" name="l01315"></a><span class="lineno"> 1315</span> }</div>
|
|
<div class="line"><a id="l01316" name="l01316"></a><span class="lineno"> 1316</span>}</div>
|
|
<div class="line"><a id="l01317" name="l01317"></a><span class="lineno"> 1317</span> </div>
|
|
<div class="line"><a id="l01318" name="l01318"></a><span class="lineno"> 1318</span><span class="keywordtype">bool</span> RelocateExpensiveChain::IncrementCurrentArcIndices() {</div>
|
|
<div class="line"><a id="l01319" name="l01319"></a><span class="lineno"> 1319</span> <span class="keywordtype">int</span>& second_index = current_expensive_arc_indices_.second;</div>
|
|
<div class="line"><a id="l01320" name="l01320"></a><span class="lineno"> 1320</span> <span class="keywordflow">if</span> (++second_index < most_expensive_arc_starts_and_ranks_.size()) {</div>
|
|
<div class="line"><a id="l01321" name="l01321"></a><span class="lineno"> 1321</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01322" name="l01322"></a><span class="lineno"> 1322</span> }</div>
|
|
<div class="line"><a id="l01323" name="l01323"></a><span class="lineno"> 1323</span> <span class="keywordtype">int</span>& first_index = current_expensive_arc_indices_.first;</div>
|
|
<div class="line"><a id="l01324" name="l01324"></a><span class="lineno"> 1324</span> <span class="keywordflow">if</span> (first_index + 2 < most_expensive_arc_starts_and_ranks_.size()) {</div>
|
|
<div class="line"><a id="l01325" name="l01325"></a><span class="lineno"> 1325</span> first_index++;</div>
|
|
<div class="line"><a id="l01326" name="l01326"></a><span class="lineno"> 1326</span> second_index = first_index + 1;</div>
|
|
<div class="line"><a id="l01327" name="l01327"></a><span class="lineno"> 1327</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01328" name="l01328"></a><span class="lineno"> 1328</span> }</div>
|
|
<div class="line"><a id="l01329" name="l01329"></a><span class="lineno"> 1329</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01330" name="l01330"></a><span class="lineno"> 1330</span>}</div>
|
|
<div class="line"><a id="l01331" name="l01331"></a><span class="lineno"> 1331</span> </div>
|
|
<div class="line"><a id="l01332" name="l01332"></a><span class="lineno"> 1332</span><span class="keywordtype">bool</span> RelocateExpensiveChain::FindMostExpensiveChainsOnRemainingPaths() {</div>
|
|
<div class="line"><a id="l01333" name="l01333"></a><span class="lineno"> 1333</span> <span class="keywordflow">do</span> {</div>
|
|
<div class="line"><a id="l01334" name="l01334"></a><span class="lineno"> 1334</span> <span class="keywordflow">if</span> (FindMostExpensiveArcsOnRoute(</div>
|
|
<div class="line"><a id="l01335" name="l01335"></a><span class="lineno"> 1335</span> num_arcs_to_consider_, <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a3493d43792939bc2a16ec5b53361095d">path_starts</a>()[current_path_],</div>
|
|
<div class="line"><a id="l01336" name="l01336"></a><span class="lineno"> 1336</span> [<span class="keyword">this</span>](int64_t i) { <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa5e00890b9ba3ed95dfba829e51f6be4">OldNext</a>(i); },</div>
|
|
<div class="line"><a id="l01337" name="l01337"></a><span class="lineno"> 1337</span> [<span class="keyword">this</span>](int64_t node) { <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a4f36c21ecd69ac0eda49cd44375e88b4">IsPathEnd</a>(node); },</div>
|
|
<div class="line"><a id="l01338" name="l01338"></a><span class="lineno"> 1338</span> arc_cost_for_path_start_, &most_expensive_arc_starts_and_ranks_,</div>
|
|
<div class="line"><a id="l01339" name="l01339"></a><span class="lineno"> 1339</span> &current_expensive_arc_indices_)) {</div>
|
|
<div class="line"><a id="l01340" name="l01340"></a><span class="lineno"> 1340</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01341" name="l01341"></a><span class="lineno"> 1341</span> }</div>
|
|
<div class="line"><a id="l01342" name="l01342"></a><span class="lineno"> 1342</span> IncrementCurrentPath();</div>
|
|
<div class="line"><a id="l01343" name="l01343"></a><span class="lineno"> 1343</span> } <span class="keywordflow">while</span> (current_path_ != end_path_);</div>
|
|
<div class="line"><a id="l01344" name="l01344"></a><span class="lineno"> 1344</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01345" name="l01345"></a><span class="lineno"> 1345</span>}</div>
|
|
<div class="line"><a id="l01346" name="l01346"></a><span class="lineno"> 1346</span> </div>
|
|
<div class="line"><a id="l01347" name="l01347"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_relocate_subtrip.html#a6bcb545cf548018c6a0a83c85fb512c9"> 1347</a></span><a class="code hl_function" href="classoperations__research_1_1_relocate_subtrip.html#a6bcb545cf548018c6a0a83c85fb512c9">RelocateSubtrip::RelocateSubtrip</a>(</div>
|
|
<div class="line"><a id="l01348" name="l01348"></a><span class="lineno"> 1348</span> <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a id="l01349" name="l01349"></a><span class="lineno"> 1349</span> <span class="keyword">const</span> std::vector<IntVar*>& secondary_vars,</div>
|
|
<div class="line"><a id="l01350" name="l01350"></a><span class="lineno"> 1350</span> std::function<<span class="keywordtype">int</span>(int64_t)> start_empty_path_class,</div>
|
|
<div class="line"><a id="l01351" name="l01351"></a><span class="lineno"> 1351</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research.html#aef7db0bee0a22d1791d040fd3853f3b7">RoutingIndexPairs</a>& pairs)</div>
|
|
<div class="line"><a id="l01352" name="l01352"></a><span class="lineno"> 1352</span> : <a class="code hl_class" href="classoperations__research_1_1_path_operator.html">PathOperator</a>(vars, secondary_vars,</div>
|
|
<div class="line"><a id="l01353" name="l01353"></a><span class="lineno"> 1353</span> <span class="comment">/*number_of_base_nodes*/</span> 2, true, false,</div>
|
|
<div class="line"><a id="l01354" name="l01354"></a><span class="lineno"> 1354</span> <a class="code hl_namespace" href="namespacestd.html">std</a>::move(start_empty_path_class)) {</div>
|
|
<div class="line"><a id="l01355" name="l01355"></a><span class="lineno"> 1355</span> is_pickup_node_.resize(<a class="code hl_variable" href="classoperations__research_1_1_path_operator.html#aad7695e494039d607c26afb6acd0644a">number_of_nexts_</a>, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l01356" name="l01356"></a><span class="lineno"> 1356</span> is_delivery_node_.resize(<a class="code hl_variable" href="classoperations__research_1_1_path_operator.html#aad7695e494039d607c26afb6acd0644a">number_of_nexts_</a>, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l01357" name="l01357"></a><span class="lineno"> 1357</span> pair_of_node_.resize(<a class="code hl_variable" href="classoperations__research_1_1_path_operator.html#aad7695e494039d607c26afb6acd0644a">number_of_nexts_</a>, -1);</div>
|
|
<div class="line"><a id="l01358" name="l01358"></a><span class="lineno"> 1358</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pair_index = 0; pair_index < pairs.size(); ++pair_index) {</div>
|
|
<div class="line"><a id="l01359" name="l01359"></a><span class="lineno"> 1359</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> node : pairs[pair_index].first) {</div>
|
|
<div class="line"><a id="l01360" name="l01360"></a><span class="lineno"> 1360</span> is_pickup_node_[node] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01361" name="l01361"></a><span class="lineno"> 1361</span> pair_of_node_[node] = pair_index;</div>
|
|
<div class="line"><a id="l01362" name="l01362"></a><span class="lineno"> 1362</span> }</div>
|
|
<div class="line"><a id="l01363" name="l01363"></a><span class="lineno"> 1363</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> node : pairs[pair_index].second) {</div>
|
|
<div class="line"><a id="l01364" name="l01364"></a><span class="lineno"> 1364</span> is_delivery_node_[node] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01365" name="l01365"></a><span class="lineno"> 1365</span> pair_of_node_[node] = pair_index;</div>
|
|
<div class="line"><a id="l01366" name="l01366"></a><span class="lineno"> 1366</span> }</div>
|
|
<div class="line"><a id="l01367" name="l01367"></a><span class="lineno"> 1367</span> }</div>
|
|
<div class="line"><a id="l01368" name="l01368"></a><span class="lineno"> 1368</span> opened_pairs_bitset_.resize(pairs.size(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l01369" name="l01369"></a><span class="lineno"> 1369</span>}</div>
|
|
<div class="line"><a id="l01370" name="l01370"></a><span class="lineno"> 1370</span> </div>
|
|
<div class="line"><a id="l01371" name="l01371"></a><span class="lineno"> 1371</span><span class="keywordtype">bool</span> RelocateSubtrip::RelocateSubTripFromPickup(<span class="keyword">const</span> int64_t chain_first_node,</div>
|
|
<div class="line"><a id="l01372" name="l01372"></a><span class="lineno"> 1372</span> <span class="keyword">const</span> int64_t insertion_node) {</div>
|
|
<div class="line"><a id="l01373" name="l01373"></a><span class="lineno"> 1373</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a4f36c21ecd69ac0eda49cd44375e88b4">IsPathEnd</a>(insertion_node)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01374" name="l01374"></a><span class="lineno"> 1374</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa14dad2d86c18296f9a5227b87d5caad">Prev</a>(chain_first_node) == insertion_node)</div>
|
|
<div class="line"><a id="l01375" name="l01375"></a><span class="lineno"> 1375</span> <span class="keywordflow">return</span> <span class="keyword">false</span>; <span class="comment">// Skip null move.</span></div>
|
|
<div class="line"><a id="l01376" name="l01376"></a><span class="lineno"> 1376</span> </div>
|
|
<div class="line"><a id="l01377" name="l01377"></a><span class="lineno"> 1377</span> <span class="keywordtype">int</span> num_opened_pairs = 0;</div>
|
|
<div class="line"><a id="l01378" name="l01378"></a><span class="lineno"> 1378</span> <span class="comment">// Split chain into subtrip and rejected nodes.</span></div>
|
|
<div class="line"><a id="l01379" name="l01379"></a><span class="lineno"> 1379</span> rejected_nodes_ = {<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa14dad2d86c18296f9a5227b87d5caad">Prev</a>(chain_first_node)};</div>
|
|
<div class="line"><a id="l01380" name="l01380"></a><span class="lineno"> 1380</span> subtrip_nodes_ = {insertion_node};</div>
|
|
<div class="line"><a id="l01381" name="l01381"></a><span class="lineno"> 1381</span> <span class="keywordtype">int</span> current = chain_first_node;</div>
|
|
<div class="line"><a id="l01382" name="l01382"></a><span class="lineno"> 1382</span> <span class="keywordflow">do</span> {</div>
|
|
<div class="line"><a id="l01383" name="l01383"></a><span class="lineno"> 1383</span> <span class="keywordflow">if</span> (current == insertion_node) {</div>
|
|
<div class="line"><a id="l01384" name="l01384"></a><span class="lineno"> 1384</span> <span class="comment">// opened_pairs_bitset_ must be all false when we leave this function.</span></div>
|
|
<div class="line"><a id="l01385" name="l01385"></a><span class="lineno"> 1385</span> opened_pairs_bitset_.assign(opened_pairs_bitset_.size(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l01386" name="l01386"></a><span class="lineno"> 1386</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01387" name="l01387"></a><span class="lineno"> 1387</span> }</div>
|
|
<div class="line"><a id="l01388" name="l01388"></a><span class="lineno"> 1388</span> <span class="keyword">const</span> <span class="keywordtype">int</span> pair = pair_of_node_[current];</div>
|
|
<div class="line"><a id="l01389" name="l01389"></a><span class="lineno"> 1389</span> <span class="keywordflow">if</span> (is_delivery_node_[current] && !opened_pairs_bitset_[pair]) {</div>
|
|
<div class="line"><a id="l01390" name="l01390"></a><span class="lineno"> 1390</span> rejected_nodes_.push_back(current);</div>
|
|
<div class="line"><a id="l01391" name="l01391"></a><span class="lineno"> 1391</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l01392" name="l01392"></a><span class="lineno"> 1392</span> subtrip_nodes_.push_back(current);</div>
|
|
<div class="line"><a id="l01393" name="l01393"></a><span class="lineno"> 1393</span> <span class="keywordflow">if</span> (is_pickup_node_[current]) {</div>
|
|
<div class="line"><a id="l01394" name="l01394"></a><span class="lineno"> 1394</span> ++num_opened_pairs;</div>
|
|
<div class="line"><a id="l01395" name="l01395"></a><span class="lineno"> 1395</span> opened_pairs_bitset_[pair] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01396" name="l01396"></a><span class="lineno"> 1396</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (is_delivery_node_[current]) {</div>
|
|
<div class="line"><a id="l01397" name="l01397"></a><span class="lineno"> 1397</span> --num_opened_pairs;</div>
|
|
<div class="line"><a id="l01398" name="l01398"></a><span class="lineno"> 1398</span> opened_pairs_bitset_[pair] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01399" name="l01399"></a><span class="lineno"> 1399</span> }</div>
|
|
<div class="line"><a id="l01400" name="l01400"></a><span class="lineno"> 1400</span> }</div>
|
|
<div class="line"><a id="l01401" name="l01401"></a><span class="lineno"> 1401</span> current = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a5f9e1016a5bb6a7d5cded8599a50fce1">Next</a>(current);</div>
|
|
<div class="line"><a id="l01402" name="l01402"></a><span class="lineno"> 1402</span> } <span class="keywordflow">while</span> (num_opened_pairs != 0 && !<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a4f36c21ecd69ac0eda49cd44375e88b4">IsPathEnd</a>(current));</div>
|
|
<div class="line"><a id="l01403" name="l01403"></a><span class="lineno"> 1403</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(num_opened_pairs, 0);</div>
|
|
<div class="line"><a id="l01404" name="l01404"></a><span class="lineno"> 1404</span> rejected_nodes_.push_back(current);</div>
|
|
<div class="line"><a id="l01405" name="l01405"></a><span class="lineno"> 1405</span> subtrip_nodes_.push_back(<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a5f9e1016a5bb6a7d5cded8599a50fce1">Next</a>(insertion_node));</div>
|
|
<div class="line"><a id="l01406" name="l01406"></a><span class="lineno"> 1406</span> </div>
|
|
<div class="line"><a id="l01407" name="l01407"></a><span class="lineno"> 1407</span> <span class="comment">// Set new paths.</span></div>
|
|
<div class="line"><a id="l01408" name="l01408"></a><span class="lineno"> 1408</span> <span class="keyword">const</span> int64_t rejected_path = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#adf2175ee598b241dcc5459573ebdc886">Path</a>(chain_first_node);</div>
|
|
<div class="line"><a id="l01409" name="l01409"></a><span class="lineno"> 1409</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < rejected_nodes_.size(); ++i) {</div>
|
|
<div class="line"><a id="l01410" name="l01410"></a><span class="lineno"> 1410</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a968f3a82c5dbaba4f0725200b00ee97f">SetNext</a>(rejected_nodes_[i - 1], rejected_nodes_[i], rejected_path);</div>
|
|
<div class="line"><a id="l01411" name="l01411"></a><span class="lineno"> 1411</span> }</div>
|
|
<div class="line"><a id="l01412" name="l01412"></a><span class="lineno"> 1412</span> <span class="keyword">const</span> int64_t insertion_path = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#adf2175ee598b241dcc5459573ebdc886">Path</a>(insertion_node);</div>
|
|
<div class="line"><a id="l01413" name="l01413"></a><span class="lineno"> 1413</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < subtrip_nodes_.size(); ++i) {</div>
|
|
<div class="line"><a id="l01414" name="l01414"></a><span class="lineno"> 1414</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a968f3a82c5dbaba4f0725200b00ee97f">SetNext</a>(subtrip_nodes_[i - 1], subtrip_nodes_[i], insertion_path);</div>
|
|
<div class="line"><a id="l01415" name="l01415"></a><span class="lineno"> 1415</span> }</div>
|
|
<div class="line"><a id="l01416" name="l01416"></a><span class="lineno"> 1416</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01417" name="l01417"></a><span class="lineno"> 1417</span>}</div>
|
|
<div class="line"><a id="l01418" name="l01418"></a><span class="lineno"> 1418</span> </div>
|
|
<div class="line"><a id="l01419" name="l01419"></a><span class="lineno"> 1419</span><span class="keywordtype">bool</span> RelocateSubtrip::RelocateSubTripFromDelivery(</div>
|
|
<div class="line"><a id="l01420" name="l01420"></a><span class="lineno"> 1420</span> <span class="keyword">const</span> int64_t chain_last_node, <span class="keyword">const</span> int64_t insertion_node) {</div>
|
|
<div class="line"><a id="l01421" name="l01421"></a><span class="lineno"> 1421</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a4f36c21ecd69ac0eda49cd44375e88b4">IsPathEnd</a>(insertion_node)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01422" name="l01422"></a><span class="lineno"> 1422</span> </div>
|
|
<div class="line"><a id="l01423" name="l01423"></a><span class="lineno"> 1423</span> <span class="comment">// opened_pairs_bitset_ should be all false.</span></div>
|
|
<div class="line"><a id="l01424" name="l01424"></a><span class="lineno"> 1424</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(std::none_of(opened_pairs_bitset_.begin(), opened_pairs_bitset_.end(),</div>
|
|
<div class="line"><a id="l01425" name="l01425"></a><span class="lineno"> 1425</span> [](<span class="keywordtype">bool</span> <a class="code hl_variable" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) { return value; }));</div>
|
|
<div class="line"><a id="l01426" name="l01426"></a><span class="lineno"> 1426</span> <span class="keywordtype">int</span> num_opened_pairs = 0;</div>
|
|
<div class="line"><a id="l01427" name="l01427"></a><span class="lineno"> 1427</span> <span class="comment">// Split chain into subtrip and rejected nodes. Store nodes in reverse order.</span></div>
|
|
<div class="line"><a id="l01428" name="l01428"></a><span class="lineno"> 1428</span> rejected_nodes_ = {<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a5f9e1016a5bb6a7d5cded8599a50fce1">Next</a>(chain_last_node)};</div>
|
|
<div class="line"><a id="l01429" name="l01429"></a><span class="lineno"> 1429</span> subtrip_nodes_ = {<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a5f9e1016a5bb6a7d5cded8599a50fce1">Next</a>(insertion_node)};</div>
|
|
<div class="line"><a id="l01430" name="l01430"></a><span class="lineno"> 1430</span> <span class="keywordtype">int</span> current = chain_last_node;</div>
|
|
<div class="line"><a id="l01431" name="l01431"></a><span class="lineno"> 1431</span> <span class="keywordflow">do</span> {</div>
|
|
<div class="line"><a id="l01432" name="l01432"></a><span class="lineno"> 1432</span> <span class="keywordflow">if</span> (current == insertion_node) {</div>
|
|
<div class="line"><a id="l01433" name="l01433"></a><span class="lineno"> 1433</span> opened_pairs_bitset_.assign(opened_pairs_bitset_.size(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l01434" name="l01434"></a><span class="lineno"> 1434</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01435" name="l01435"></a><span class="lineno"> 1435</span> }</div>
|
|
<div class="line"><a id="l01436" name="l01436"></a><span class="lineno"> 1436</span> <span class="keyword">const</span> <span class="keywordtype">int</span> pair = pair_of_node_[current];</div>
|
|
<div class="line"><a id="l01437" name="l01437"></a><span class="lineno"> 1437</span> <span class="keywordflow">if</span> (is_pickup_node_[current] && !opened_pairs_bitset_[pair]) {</div>
|
|
<div class="line"><a id="l01438" name="l01438"></a><span class="lineno"> 1438</span> rejected_nodes_.push_back(current);</div>
|
|
<div class="line"><a id="l01439" name="l01439"></a><span class="lineno"> 1439</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l01440" name="l01440"></a><span class="lineno"> 1440</span> subtrip_nodes_.push_back(current);</div>
|
|
<div class="line"><a id="l01441" name="l01441"></a><span class="lineno"> 1441</span> <span class="keywordflow">if</span> (is_delivery_node_[current]) {</div>
|
|
<div class="line"><a id="l01442" name="l01442"></a><span class="lineno"> 1442</span> ++num_opened_pairs;</div>
|
|
<div class="line"><a id="l01443" name="l01443"></a><span class="lineno"> 1443</span> opened_pairs_bitset_[pair] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01444" name="l01444"></a><span class="lineno"> 1444</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (is_pickup_node_[current]) {</div>
|
|
<div class="line"><a id="l01445" name="l01445"></a><span class="lineno"> 1445</span> --num_opened_pairs;</div>
|
|
<div class="line"><a id="l01446" name="l01446"></a><span class="lineno"> 1446</span> opened_pairs_bitset_[pair] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01447" name="l01447"></a><span class="lineno"> 1447</span> }</div>
|
|
<div class="line"><a id="l01448" name="l01448"></a><span class="lineno"> 1448</span> }</div>
|
|
<div class="line"><a id="l01449" name="l01449"></a><span class="lineno"> 1449</span> current = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa14dad2d86c18296f9a5227b87d5caad">Prev</a>(current);</div>
|
|
<div class="line"><a id="l01450" name="l01450"></a><span class="lineno"> 1450</span> } <span class="keywordflow">while</span> (num_opened_pairs != 0 && !<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a17bdf687f4bf47cb68ea163f28876608">IsPathStart</a>(current));</div>
|
|
<div class="line"><a id="l01451" name="l01451"></a><span class="lineno"> 1451</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(num_opened_pairs, 0);</div>
|
|
<div class="line"><a id="l01452" name="l01452"></a><span class="lineno"> 1452</span> <span class="keywordflow">if</span> (current == insertion_node) <span class="keywordflow">return</span> <span class="keyword">false</span>; <span class="comment">// Skip null move.</span></div>
|
|
<div class="line"><a id="l01453" name="l01453"></a><span class="lineno"> 1453</span> rejected_nodes_.push_back(current);</div>
|
|
<div class="line"><a id="l01454" name="l01454"></a><span class="lineno"> 1454</span> subtrip_nodes_.push_back(insertion_node);</div>
|
|
<div class="line"><a id="l01455" name="l01455"></a><span class="lineno"> 1455</span> </div>
|
|
<div class="line"><a id="l01456" name="l01456"></a><span class="lineno"> 1456</span> <span class="comment">// TODO(user): either remove those std::reverse() and adapt the loops</span></div>
|
|
<div class="line"><a id="l01457" name="l01457"></a><span class="lineno"> 1457</span> <span class="comment">// below, or refactor the loops into a function that also DCHECKs the path.</span></div>
|
|
<div class="line"><a id="l01458" name="l01458"></a><span class="lineno"> 1458</span> std::reverse(rejected_nodes_.begin(), rejected_nodes_.end());</div>
|
|
<div class="line"><a id="l01459" name="l01459"></a><span class="lineno"> 1459</span> std::reverse(subtrip_nodes_.begin(), subtrip_nodes_.end());</div>
|
|
<div class="line"><a id="l01460" name="l01460"></a><span class="lineno"> 1460</span> </div>
|
|
<div class="line"><a id="l01461" name="l01461"></a><span class="lineno"> 1461</span> <span class="comment">// Set new paths.</span></div>
|
|
<div class="line"><a id="l01462" name="l01462"></a><span class="lineno"> 1462</span> <span class="keyword">const</span> int64_t rejected_path = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#adf2175ee598b241dcc5459573ebdc886">Path</a>(chain_last_node);</div>
|
|
<div class="line"><a id="l01463" name="l01463"></a><span class="lineno"> 1463</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < rejected_nodes_.size(); ++i) {</div>
|
|
<div class="line"><a id="l01464" name="l01464"></a><span class="lineno"> 1464</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a968f3a82c5dbaba4f0725200b00ee97f">SetNext</a>(rejected_nodes_[i - 1], rejected_nodes_[i], rejected_path);</div>
|
|
<div class="line"><a id="l01465" name="l01465"></a><span class="lineno"> 1465</span> }</div>
|
|
<div class="line"><a id="l01466" name="l01466"></a><span class="lineno"> 1466</span> <span class="keyword">const</span> int64_t insertion_path = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#adf2175ee598b241dcc5459573ebdc886">Path</a>(insertion_node);</div>
|
|
<div class="line"><a id="l01467" name="l01467"></a><span class="lineno"> 1467</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < subtrip_nodes_.size(); ++i) {</div>
|
|
<div class="line"><a id="l01468" name="l01468"></a><span class="lineno"> 1468</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a968f3a82c5dbaba4f0725200b00ee97f">SetNext</a>(subtrip_nodes_[i - 1], subtrip_nodes_[i], insertion_path);</div>
|
|
<div class="line"><a id="l01469" name="l01469"></a><span class="lineno"> 1469</span> }</div>
|
|
<div class="line"><a id="l01470" name="l01470"></a><span class="lineno"> 1470</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01471" name="l01471"></a><span class="lineno"> 1471</span>}</div>
|
|
<div class="line"><a id="l01472" name="l01472"></a><span class="lineno"> 1472</span> </div>
|
|
<div class="line"><a id="l01473" name="l01473"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_relocate_subtrip.html#a24ea165f00f8e15de94958fc804ff209"> 1473</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_relocate_subtrip.html#a24ea165f00f8e15de94958fc804ff209">RelocateSubtrip::MakeNeighbor</a>() {</div>
|
|
<div class="line"><a id="l01474" name="l01474"></a><span class="lineno"> 1474</span> <span class="keywordflow">if</span> (is_pickup_node_[<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(0)]) {</div>
|
|
<div class="line"><a id="l01475" name="l01475"></a><span class="lineno"> 1475</span> <span class="keywordflow">return</span> RelocateSubTripFromPickup(<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(0), <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(1));</div>
|
|
<div class="line"><a id="l01476" name="l01476"></a><span class="lineno"> 1476</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (is_delivery_node_[<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(0)]) {</div>
|
|
<div class="line"><a id="l01477" name="l01477"></a><span class="lineno"> 1477</span> <span class="keywordflow">return</span> RelocateSubTripFromDelivery(<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(0), <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(1));</div>
|
|
<div class="line"><a id="l01478" name="l01478"></a><span class="lineno"> 1478</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l01479" name="l01479"></a><span class="lineno"> 1479</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01480" name="l01480"></a><span class="lineno"> 1480</span> }</div>
|
|
<div class="line"><a id="l01481" name="l01481"></a><span class="lineno"> 1481</span>}</div>
|
|
<div class="line"><a id="l01482" name="l01482"></a><span class="lineno"> 1482</span> </div>
|
|
<div class="line"><a id="l01483" name="l01483"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_exchange_subtrip.html#a4a25a95207cf7404f679cfa986c7385e"> 1483</a></span><a class="code hl_function" href="classoperations__research_1_1_exchange_subtrip.html#a4a25a95207cf7404f679cfa986c7385e">ExchangeSubtrip::ExchangeSubtrip</a>(</div>
|
|
<div class="line"><a id="l01484" name="l01484"></a><span class="lineno"> 1484</span> <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a id="l01485" name="l01485"></a><span class="lineno"> 1485</span> <span class="keyword">const</span> std::vector<IntVar*>& secondary_vars,</div>
|
|
<div class="line"><a id="l01486" name="l01486"></a><span class="lineno"> 1486</span> std::function<<span class="keywordtype">int</span>(int64_t)> start_empty_path_class,</div>
|
|
<div class="line"><a id="l01487" name="l01487"></a><span class="lineno"> 1487</span> <span class="keyword">const</span> <a class="code hl_typedef" href="namespaceoperations__research.html#aef7db0bee0a22d1791d040fd3853f3b7">RoutingIndexPairs</a>& pairs)</div>
|
|
<div class="line"><a id="l01488" name="l01488"></a><span class="lineno"> 1488</span> : <a class="code hl_class" href="classoperations__research_1_1_path_operator.html">PathOperator</a>(vars, secondary_vars, 2, true, false,</div>
|
|
<div class="line"><a id="l01489" name="l01489"></a><span class="lineno"> 1489</span> <a class="code hl_namespace" href="namespacestd.html">std</a>::move(start_empty_path_class)) {</div>
|
|
<div class="line"><a id="l01490" name="l01490"></a><span class="lineno"> 1490</span> is_pickup_node_.resize(<a class="code hl_variable" href="classoperations__research_1_1_path_operator.html#aad7695e494039d607c26afb6acd0644a">number_of_nexts_</a>, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l01491" name="l01491"></a><span class="lineno"> 1491</span> is_delivery_node_.resize(<a class="code hl_variable" href="classoperations__research_1_1_path_operator.html#aad7695e494039d607c26afb6acd0644a">number_of_nexts_</a>, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l01492" name="l01492"></a><span class="lineno"> 1492</span> pair_of_node_.resize(<a class="code hl_variable" href="classoperations__research_1_1_path_operator.html#aad7695e494039d607c26afb6acd0644a">number_of_nexts_</a>, -1);</div>
|
|
<div class="line"><a id="l01493" name="l01493"></a><span class="lineno"> 1493</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pair_index = 0; pair_index < pairs.size(); ++pair_index) {</div>
|
|
<div class="line"><a id="l01494" name="l01494"></a><span class="lineno"> 1494</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> node : pairs[pair_index].first) {</div>
|
|
<div class="line"><a id="l01495" name="l01495"></a><span class="lineno"> 1495</span> is_pickup_node_[node] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01496" name="l01496"></a><span class="lineno"> 1496</span> pair_of_node_[node] = pair_index;</div>
|
|
<div class="line"><a id="l01497" name="l01497"></a><span class="lineno"> 1497</span> }</div>
|
|
<div class="line"><a id="l01498" name="l01498"></a><span class="lineno"> 1498</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> node : pairs[pair_index].second) {</div>
|
|
<div class="line"><a id="l01499" name="l01499"></a><span class="lineno"> 1499</span> is_delivery_node_[node] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01500" name="l01500"></a><span class="lineno"> 1500</span> pair_of_node_[node] = pair_index;</div>
|
|
<div class="line"><a id="l01501" name="l01501"></a><span class="lineno"> 1501</span> }</div>
|
|
<div class="line"><a id="l01502" name="l01502"></a><span class="lineno"> 1502</span> }</div>
|
|
<div class="line"><a id="l01503" name="l01503"></a><span class="lineno"> 1503</span> opened_pairs_set_.resize(pairs.size(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l01504" name="l01504"></a><span class="lineno"> 1504</span>}</div>
|
|
<div class="line"><a id="l01505" name="l01505"></a><span class="lineno"> 1505</span> </div>
|
|
<div class="line"><a id="l01506" name="l01506"></a><span class="lineno"> 1506</span><span class="keywordtype">void</span> ExchangeSubtrip::SetPath(<span class="keyword">const</span> std::vector<int64_t>& path, <span class="keywordtype">int</span> path_id) {</div>
|
|
<div class="line"><a id="l01507" name="l01507"></a><span class="lineno"> 1507</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < path.size(); ++i) {</div>
|
|
<div class="line"><a id="l01508" name="l01508"></a><span class="lineno"> 1508</span> <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a968f3a82c5dbaba4f0725200b00ee97f">SetNext</a>(path[i - 1], path[i], path_id);</div>
|
|
<div class="line"><a id="l01509" name="l01509"></a><span class="lineno"> 1509</span> }</div>
|
|
<div class="line"><a id="l01510" name="l01510"></a><span class="lineno"> 1510</span>}</div>
|
|
<div class="line"><a id="l01511" name="l01511"></a><span class="lineno"> 1511</span> </div>
|
|
<div class="line"><a id="l01512" name="l01512"></a><span class="lineno"> 1512</span><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l01513" name="l01513"></a><span class="lineno"> 1513</span><span class="keywordtype">bool</span> VectorContains(<span class="keyword">const</span> std::vector<int64_t>& values, int64_t target) {</div>
|
|
<div class="line"><a id="l01514" name="l01514"></a><span class="lineno"> 1514</span> <span class="keywordflow">return</span> std::find(values.begin(), values.end(), target) != values.end();</div>
|
|
<div class="line"><a id="l01515" name="l01515"></a><span class="lineno"> 1515</span>}</div>
|
|
<div class="line"><a id="l01516" name="l01516"></a><span class="lineno"> 1516</span>} <span class="comment">// namespace</span></div>
|
|
<div class="line"><a id="l01517" name="l01517"></a><span class="lineno"> 1517</span> </div>
|
|
<div class="line"><a id="l01518" name="l01518"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_exchange_subtrip.html#a24ea165f00f8e15de94958fc804ff209"> 1518</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_exchange_subtrip.html#a24ea165f00f8e15de94958fc804ff209">ExchangeSubtrip::MakeNeighbor</a>() {</div>
|
|
<div class="line"><a id="l01519" name="l01519"></a><span class="lineno"> 1519</span> <span class="keywordflow">if</span> (pair_of_node_[<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(0)] == -1) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01520" name="l01520"></a><span class="lineno"> 1520</span> <span class="keywordflow">if</span> (pair_of_node_[<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(1)] == -1) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01521" name="l01521"></a><span class="lineno"> 1521</span> <span class="comment">// Break symmetry: a move generated from (BaseNode(0), BaseNode(1)) is the</span></div>
|
|
<div class="line"><a id="l01522" name="l01522"></a><span class="lineno"> 1522</span> <span class="comment">// same as from (BaseNode(1), BaseNode(1)): no need to do it twice.</span></div>
|
|
<div class="line"><a id="l01523" name="l01523"></a><span class="lineno"> 1523</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(0) >= <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(1)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01524" name="l01524"></a><span class="lineno"> 1524</span> rejects0_.clear();</div>
|
|
<div class="line"><a id="l01525" name="l01525"></a><span class="lineno"> 1525</span> subtrip0_.clear();</div>
|
|
<div class="line"><a id="l01526" name="l01526"></a><span class="lineno"> 1526</span> <span class="keywordflow">if</span> (!ExtractChainsAndCheckCanonical(<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(0), &rejects0_, &subtrip0_)) {</div>
|
|
<div class="line"><a id="l01527" name="l01527"></a><span class="lineno"> 1527</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01528" name="l01528"></a><span class="lineno"> 1528</span> }</div>
|
|
<div class="line"><a id="l01529" name="l01529"></a><span class="lineno"> 1529</span> rejects1_.clear();</div>
|
|
<div class="line"><a id="l01530" name="l01530"></a><span class="lineno"> 1530</span> subtrip1_.clear();</div>
|
|
<div class="line"><a id="l01531" name="l01531"></a><span class="lineno"> 1531</span> <span class="keywordflow">if</span> (!ExtractChainsAndCheckCanonical(<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(1), &rejects1_, &subtrip1_)) {</div>
|
|
<div class="line"><a id="l01532" name="l01532"></a><span class="lineno"> 1532</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01533" name="l01533"></a><span class="lineno"> 1533</span> }</div>
|
|
<div class="line"><a id="l01534" name="l01534"></a><span class="lineno"> 1534</span> </div>
|
|
<div class="line"><a id="l01535" name="l01535"></a><span class="lineno"> 1535</span> <span class="comment">// If paths intersect, skip the move.</span></div>
|
|
<div class="line"><a id="l01536" name="l01536"></a><span class="lineno"> 1536</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#adf2175ee598b241dcc5459573ebdc886">Path</a>(<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(0)) == <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#adf2175ee598b241dcc5459573ebdc886">Path</a>(<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(1))) {</div>
|
|
<div class="line"><a id="l01537" name="l01537"></a><span class="lineno"> 1537</span> <span class="keywordflow">if</span> (VectorContains(rejects0_, subtrip1_.front())) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01538" name="l01538"></a><span class="lineno"> 1538</span> <span class="keywordflow">if</span> (VectorContains(rejects1_, subtrip0_.front())) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01539" name="l01539"></a><span class="lineno"> 1539</span> <span class="keywordflow">if</span> (VectorContains(subtrip0_, subtrip1_.front())) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01540" name="l01540"></a><span class="lineno"> 1540</span> <span class="keywordflow">if</span> (VectorContains(subtrip1_, subtrip0_.front())) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01541" name="l01541"></a><span class="lineno"> 1541</span> }</div>
|
|
<div class="line"><a id="l01542" name="l01542"></a><span class="lineno"> 1542</span> </div>
|
|
<div class="line"><a id="l01543" name="l01543"></a><span class="lineno"> 1543</span> <span class="comment">// Assemble the new paths.</span></div>
|
|
<div class="line"><a id="l01544" name="l01544"></a><span class="lineno"> 1544</span> path0_ = {<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa14dad2d86c18296f9a5227b87d5caad">Prev</a>(subtrip0_.front())};</div>
|
|
<div class="line"><a id="l01545" name="l01545"></a><span class="lineno"> 1545</span> path1_ = {<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa14dad2d86c18296f9a5227b87d5caad">Prev</a>(subtrip1_.front())};</div>
|
|
<div class="line"><a id="l01546" name="l01546"></a><span class="lineno"> 1546</span> <span class="keyword">const</span> int64_t last0 = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a5f9e1016a5bb6a7d5cded8599a50fce1">Next</a>(subtrip0_.back());</div>
|
|
<div class="line"><a id="l01547" name="l01547"></a><span class="lineno"> 1547</span> <span class="keyword">const</span> int64_t last1 = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a5f9e1016a5bb6a7d5cded8599a50fce1">Next</a>(subtrip1_.back());</div>
|
|
<div class="line"><a id="l01548" name="l01548"></a><span class="lineno"> 1548</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> concatenated01 = last0 == subtrip1_.front();</div>
|
|
<div class="line"><a id="l01549" name="l01549"></a><span class="lineno"> 1549</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> concatenated10 = last1 == subtrip0_.front();</div>
|
|
<div class="line"><a id="l01550" name="l01550"></a><span class="lineno"> 1550</span> </div>
|
|
<div class="line"><a id="l01551" name="l01551"></a><span class="lineno"> 1551</span> <span class="keywordflow">if</span> (is_delivery_node_[<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(0)]) <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(subtrip1_, rejects0_);</div>
|
|
<div class="line"><a id="l01552" name="l01552"></a><span class="lineno"> 1552</span> path0_.insert(path0_.end(), subtrip1_.begin(), subtrip1_.end());</div>
|
|
<div class="line"><a id="l01553" name="l01553"></a><span class="lineno"> 1553</span> path0_.insert(path0_.end(), rejects0_.begin(), rejects0_.end());</div>
|
|
<div class="line"><a id="l01554" name="l01554"></a><span class="lineno"> 1554</span> path0_.push_back(last0);</div>
|
|
<div class="line"><a id="l01555" name="l01555"></a><span class="lineno"> 1555</span> </div>
|
|
<div class="line"><a id="l01556" name="l01556"></a><span class="lineno"> 1556</span> <span class="keywordflow">if</span> (is_delivery_node_[<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(1)]) <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(subtrip0_, rejects1_);</div>
|
|
<div class="line"><a id="l01557" name="l01557"></a><span class="lineno"> 1557</span> path1_.insert(path1_.end(), subtrip0_.begin(), subtrip0_.end());</div>
|
|
<div class="line"><a id="l01558" name="l01558"></a><span class="lineno"> 1558</span> path1_.insert(path1_.end(), rejects1_.begin(), rejects1_.end());</div>
|
|
<div class="line"><a id="l01559" name="l01559"></a><span class="lineno"> 1559</span> path1_.push_back(last1);</div>
|
|
<div class="line"><a id="l01560" name="l01560"></a><span class="lineno"> 1560</span> </div>
|
|
<div class="line"><a id="l01561" name="l01561"></a><span class="lineno"> 1561</span> <span class="comment">// When the trips are concatenated, bypass the regular extremities.</span></div>
|
|
<div class="line"><a id="l01562" name="l01562"></a><span class="lineno"> 1562</span> <span class="keywordflow">if</span> (concatenated01) {</div>
|
|
<div class="line"><a id="l01563" name="l01563"></a><span class="lineno"> 1563</span> path0_.pop_back();</div>
|
|
<div class="line"><a id="l01564" name="l01564"></a><span class="lineno"> 1564</span> path1_.front() = path0_.back();</div>
|
|
<div class="line"><a id="l01565" name="l01565"></a><span class="lineno"> 1565</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (concatenated10) {</div>
|
|
<div class="line"><a id="l01566" name="l01566"></a><span class="lineno"> 1566</span> path1_.pop_back();</div>
|
|
<div class="line"><a id="l01567" name="l01567"></a><span class="lineno"> 1567</span> path0_.front() = path1_.back();</div>
|
|
<div class="line"><a id="l01568" name="l01568"></a><span class="lineno"> 1568</span> }</div>
|
|
<div class="line"><a id="l01569" name="l01569"></a><span class="lineno"> 1569</span> </div>
|
|
<div class="line"><a id="l01570" name="l01570"></a><span class="lineno"> 1570</span> <span class="comment">// Change the paths. Since SetNext() modifies Path() values,</span></div>
|
|
<div class="line"><a id="l01571" name="l01571"></a><span class="lineno"> 1571</span> <span class="comment">// record path_id0 and path_id11 before calling SetPath();</span></div>
|
|
<div class="line"><a id="l01572" name="l01572"></a><span class="lineno"> 1572</span> <span class="keyword">const</span> int64_t path0_id = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#adf2175ee598b241dcc5459573ebdc886">Path</a>(<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(0));</div>
|
|
<div class="line"><a id="l01573" name="l01573"></a><span class="lineno"> 1573</span> <span class="keyword">const</span> int64_t path1_id = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#adf2175ee598b241dcc5459573ebdc886">Path</a>(<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">BaseNode</a>(1));</div>
|
|
<div class="line"><a id="l01574" name="l01574"></a><span class="lineno"> 1574</span> SetPath(path0_, path0_id);</div>
|
|
<div class="line"><a id="l01575" name="l01575"></a><span class="lineno"> 1575</span> SetPath(path1_, path1_id);</div>
|
|
<div class="line"><a id="l01576" name="l01576"></a><span class="lineno"> 1576</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01577" name="l01577"></a><span class="lineno"> 1577</span>}</div>
|
|
<div class="line"><a id="l01578" name="l01578"></a><span class="lineno"> 1578</span> </div>
|
|
<div class="line"><a id="l01579" name="l01579"></a><span class="lineno"> 1579</span><span class="keywordtype">bool</span> ExchangeSubtrip::ExtractChainsAndCheckCanonical(</div>
|
|
<div class="line"><a id="l01580" name="l01580"></a><span class="lineno"> 1580</span> int64_t base_node, std::vector<int64_t>* rejects,</div>
|
|
<div class="line"><a id="l01581" name="l01581"></a><span class="lineno"> 1581</span> std::vector<int64_t>* subtrip) {</div>
|
|
<div class="line"><a id="l01582" name="l01582"></a><span class="lineno"> 1582</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> extracted =</div>
|
|
<div class="line"><a id="l01583" name="l01583"></a><span class="lineno"> 1583</span> is_pickup_node_[base_node]</div>
|
|
<div class="line"><a id="l01584" name="l01584"></a><span class="lineno"> 1584</span> ? ExtractChainsFromPickup(base_node, rejects, subtrip)</div>
|
|
<div class="line"><a id="l01585" name="l01585"></a><span class="lineno"> 1585</span> : ExtractChainsFromDelivery(base_node, rejects, subtrip);</div>
|
|
<div class="line"><a id="l01586" name="l01586"></a><span class="lineno"> 1586</span> <span class="keywordflow">if</span> (!extracted) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01587" name="l01587"></a><span class="lineno"> 1587</span> <span class="comment">// Check canonicality.</span></div>
|
|
<div class="line"><a id="l01588" name="l01588"></a><span class="lineno"> 1588</span> <span class="keywordflow">return</span> !is_delivery_node_[base_node] ||</div>
|
|
<div class="line"><a id="l01589" name="l01589"></a><span class="lineno"> 1589</span> pair_of_node_[subtrip->front()] != pair_of_node_[subtrip->back()] ||</div>
|
|
<div class="line"><a id="l01590" name="l01590"></a><span class="lineno"> 1590</span> !rejects->empty();</div>
|
|
<div class="line"><a id="l01591" name="l01591"></a><span class="lineno"> 1591</span>}</div>
|
|
<div class="line"><a id="l01592" name="l01592"></a><span class="lineno"> 1592</span> </div>
|
|
<div class="line"><a id="l01593" name="l01593"></a><span class="lineno"> 1593</span><span class="keywordtype">bool</span> ExchangeSubtrip::ExtractChainsFromPickup(int64_t base_node,</div>
|
|
<div class="line"><a id="l01594" name="l01594"></a><span class="lineno"> 1594</span> std::vector<int64_t>* rejects,</div>
|
|
<div class="line"><a id="l01595" name="l01595"></a><span class="lineno"> 1595</span> std::vector<int64_t>* subtrip) {</div>
|
|
<div class="line"><a id="l01596" name="l01596"></a><span class="lineno"> 1596</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(is_pickup_node_[base_node]);</div>
|
|
<div class="line"><a id="l01597" name="l01597"></a><span class="lineno"> 1597</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(rejects->empty());</div>
|
|
<div class="line"><a id="l01598" name="l01598"></a><span class="lineno"> 1598</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(subtrip->empty());</div>
|
|
<div class="line"><a id="l01599" name="l01599"></a><span class="lineno"> 1599</span> <span class="comment">// Iterate from base_node forwards while maintaining the set of opened pairs.</span></div>
|
|
<div class="line"><a id="l01600" name="l01600"></a><span class="lineno"> 1600</span> <span class="comment">// A pair is opened by a pickup, closed with the corresponding delivery.</span></div>
|
|
<div class="line"><a id="l01601" name="l01601"></a><span class="lineno"> 1601</span> opened_pairs_set_.assign(opened_pairs_set_.size(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l01602" name="l01602"></a><span class="lineno"> 1602</span> <span class="keywordtype">int</span> num_opened_pairs = 0;</div>
|
|
<div class="line"><a id="l01603" name="l01603"></a><span class="lineno"> 1603</span> <span class="keywordtype">int</span> current = base_node;</div>
|
|
<div class="line"><a id="l01604" name="l01604"></a><span class="lineno"> 1604</span> <span class="keywordflow">do</span> {</div>
|
|
<div class="line"><a id="l01605" name="l01605"></a><span class="lineno"> 1605</span> <span class="keyword">const</span> <span class="keywordtype">int</span> pair = pair_of_node_[current];</div>
|
|
<div class="line"><a id="l01606" name="l01606"></a><span class="lineno"> 1606</span> <span class="keywordflow">if</span> (is_delivery_node_[current] && !opened_pairs_set_[pair]) {</div>
|
|
<div class="line"><a id="l01607" name="l01607"></a><span class="lineno"> 1607</span> rejects->push_back(current);</div>
|
|
<div class="line"><a id="l01608" name="l01608"></a><span class="lineno"> 1608</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l01609" name="l01609"></a><span class="lineno"> 1609</span> subtrip->push_back(current);</div>
|
|
<div class="line"><a id="l01610" name="l01610"></a><span class="lineno"> 1610</span> <span class="keywordflow">if</span> (is_pickup_node_[current]) {</div>
|
|
<div class="line"><a id="l01611" name="l01611"></a><span class="lineno"> 1611</span> ++num_opened_pairs;</div>
|
|
<div class="line"><a id="l01612" name="l01612"></a><span class="lineno"> 1612</span> opened_pairs_set_[pair] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01613" name="l01613"></a><span class="lineno"> 1613</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (is_delivery_node_[current]) {</div>
|
|
<div class="line"><a id="l01614" name="l01614"></a><span class="lineno"> 1614</span> --num_opened_pairs;</div>
|
|
<div class="line"><a id="l01615" name="l01615"></a><span class="lineno"> 1615</span> opened_pairs_set_[pair] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01616" name="l01616"></a><span class="lineno"> 1616</span> }</div>
|
|
<div class="line"><a id="l01617" name="l01617"></a><span class="lineno"> 1617</span> }</div>
|
|
<div class="line"><a id="l01618" name="l01618"></a><span class="lineno"> 1618</span> current = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a5f9e1016a5bb6a7d5cded8599a50fce1">Next</a>(current);</div>
|
|
<div class="line"><a id="l01619" name="l01619"></a><span class="lineno"> 1619</span> } <span class="keywordflow">while</span> (num_opened_pairs != 0 && !<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a4f36c21ecd69ac0eda49cd44375e88b4">IsPathEnd</a>(current));</div>
|
|
<div class="line"><a id="l01620" name="l01620"></a><span class="lineno"> 1620</span> <span class="keywordflow">return</span> num_opened_pairs == 0;</div>
|
|
<div class="line"><a id="l01621" name="l01621"></a><span class="lineno"> 1621</span>}</div>
|
|
<div class="line"><a id="l01622" name="l01622"></a><span class="lineno"> 1622</span> </div>
|
|
<div class="line"><a id="l01623" name="l01623"></a><span class="lineno"> 1623</span><span class="keywordtype">bool</span> ExchangeSubtrip::ExtractChainsFromDelivery(int64_t base_node,</div>
|
|
<div class="line"><a id="l01624" name="l01624"></a><span class="lineno"> 1624</span> std::vector<int64_t>* rejects,</div>
|
|
<div class="line"><a id="l01625" name="l01625"></a><span class="lineno"> 1625</span> std::vector<int64_t>* subtrip) {</div>
|
|
<div class="line"><a id="l01626" name="l01626"></a><span class="lineno"> 1626</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(is_delivery_node_[base_node]);</div>
|
|
<div class="line"><a id="l01627" name="l01627"></a><span class="lineno"> 1627</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(rejects->empty());</div>
|
|
<div class="line"><a id="l01628" name="l01628"></a><span class="lineno"> 1628</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(subtrip->empty());</div>
|
|
<div class="line"><a id="l01629" name="l01629"></a><span class="lineno"> 1629</span> <span class="comment">// Iterate from base_node backwards while maintaining the set of opened pairs.</span></div>
|
|
<div class="line"><a id="l01630" name="l01630"></a><span class="lineno"> 1630</span> <span class="comment">// A pair is opened by a delivery, closed with the corresponding pickup.</span></div>
|
|
<div class="line"><a id="l01631" name="l01631"></a><span class="lineno"> 1631</span> opened_pairs_set_.assign(opened_pairs_set_.size(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l01632" name="l01632"></a><span class="lineno"> 1632</span> <span class="keywordtype">int</span> num_opened_pairs = 0;</div>
|
|
<div class="line"><a id="l01633" name="l01633"></a><span class="lineno"> 1633</span> <span class="keywordtype">int</span> current = base_node;</div>
|
|
<div class="line"><a id="l01634" name="l01634"></a><span class="lineno"> 1634</span> <span class="keywordflow">do</span> {</div>
|
|
<div class="line"><a id="l01635" name="l01635"></a><span class="lineno"> 1635</span> <span class="keyword">const</span> <span class="keywordtype">int</span> pair = pair_of_node_[current];</div>
|
|
<div class="line"><a id="l01636" name="l01636"></a><span class="lineno"> 1636</span> <span class="keywordflow">if</span> (is_pickup_node_[current] && !opened_pairs_set_[pair]) {</div>
|
|
<div class="line"><a id="l01637" name="l01637"></a><span class="lineno"> 1637</span> rejects->push_back(current);</div>
|
|
<div class="line"><a id="l01638" name="l01638"></a><span class="lineno"> 1638</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l01639" name="l01639"></a><span class="lineno"> 1639</span> subtrip->push_back(current);</div>
|
|
<div class="line"><a id="l01640" name="l01640"></a><span class="lineno"> 1640</span> <span class="keywordflow">if</span> (is_delivery_node_[current]) {</div>
|
|
<div class="line"><a id="l01641" name="l01641"></a><span class="lineno"> 1641</span> ++num_opened_pairs;</div>
|
|
<div class="line"><a id="l01642" name="l01642"></a><span class="lineno"> 1642</span> opened_pairs_set_[pair] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01643" name="l01643"></a><span class="lineno"> 1643</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (is_pickup_node_[current]) {</div>
|
|
<div class="line"><a id="l01644" name="l01644"></a><span class="lineno"> 1644</span> --num_opened_pairs;</div>
|
|
<div class="line"><a id="l01645" name="l01645"></a><span class="lineno"> 1645</span> opened_pairs_set_[pair] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01646" name="l01646"></a><span class="lineno"> 1646</span> }</div>
|
|
<div class="line"><a id="l01647" name="l01647"></a><span class="lineno"> 1647</span> }</div>
|
|
<div class="line"><a id="l01648" name="l01648"></a><span class="lineno"> 1648</span> current = <a class="code hl_function" href="classoperations__research_1_1_path_operator.html#aa14dad2d86c18296f9a5227b87d5caad">Prev</a>(current);</div>
|
|
<div class="line"><a id="l01649" name="l01649"></a><span class="lineno"> 1649</span> } <span class="keywordflow">while</span> (num_opened_pairs != 0 && !<a class="code hl_function" href="classoperations__research_1_1_path_operator.html#a17bdf687f4bf47cb68ea163f28876608">IsPathStart</a>(current));</div>
|
|
<div class="line"><a id="l01650" name="l01650"></a><span class="lineno"> 1650</span> <span class="keywordflow">if</span> (num_opened_pairs != 0) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01651" name="l01651"></a><span class="lineno"> 1651</span> std::reverse(rejects->begin(), rejects->end());</div>
|
|
<div class="line"><a id="l01652" name="l01652"></a><span class="lineno"> 1652</span> std::reverse(subtrip->begin(), subtrip->end());</div>
|
|
<div class="line"><a id="l01653" name="l01653"></a><span class="lineno"> 1653</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01654" name="l01654"></a><span class="lineno"> 1654</span>}</div>
|
|
<div class="line"><a id="l01655" name="l01655"></a><span class="lineno"> 1655</span> </div>
|
|
<div class="line"><a id="l01656" name="l01656"></a><span class="lineno"> 1656</span>} <span class="comment">// namespace operations_research</span></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_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00495">base/logging.h:495</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a4395e95bab44e222cb2e77251017a0e2"><div class="ttname"><a href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a></div><div class="ttdeci">#define DCHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00893">base/logging.h:893</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a46e69120fbd3b36e6960e096d23b66f0"><div class="ttname"><a href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a></div><div class="ttdeci">#define DCHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00892">base/logging.h:892</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_aae2dc65d9ea248d54bf39daa986dd295"><div class="ttname"><a href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a></div><div class="ttdeci">#define DCHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00895">base/logging.h:895</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="abase_2logging_8h_html_ae89df3243bbb8341130c7b3f44145ea0"><div class="ttname"><a href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a></div><div class="ttdeci">#define DCHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00891">base/logging.h:891</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_afcaa7cadd41741bb855c2ada1d2ef927"><div class="ttname"><a href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a></div><div class="ttdeci">#define VLOG(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00984">base/logging.h:984</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="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_exchange_subtrip_html_a24ea165f00f8e15de94958fc804ff209"><div class="ttname"><a href="classoperations__research_1_1_exchange_subtrip.html#a24ea165f00f8e15de94958fc804ff209">operations_research::ExchangeSubtrip::MakeNeighbor</a></div><div class="ttdeci">bool MakeNeighbor() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l01518">routing_neighborhoods.cc:1518</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_exchange_subtrip_html_a4a25a95207cf7404f679cfa986c7385e"><div class="ttname"><a href="classoperations__research_1_1_exchange_subtrip.html#a4a25a95207cf7404f679cfa986c7385e">operations_research::ExchangeSubtrip::ExchangeSubtrip</a></div><div class="ttdeci">ExchangeSubtrip(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, const RoutingIndexPairs &pairs)</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l01483">routing_neighborhoods.cc:1483</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_filtered_heuristic_close_nodes_l_n_s_operator_html_aa885958c7ae62526a68fd8ec8dcc2060"><div class="ttname"><a href="classoperations__research_1_1_filtered_heuristic_close_nodes_l_n_s_operator.html#aa885958c7ae62526a68fd8ec8dcc2060">operations_research::FilteredHeuristicCloseNodesLNSOperator::FilteredHeuristicCloseNodesLNSOperator</a></div><div class="ttdeci">FilteredHeuristicCloseNodesLNSOperator(std::unique_ptr< RoutingFilteredHeuristic > heuristic, int num_close_nodes)</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00933">routing_neighborhoods.cc:933</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_filtered_heuristic_expensive_chain_l_n_s_operator_html_a2f370584bd079a49b94a11d2700f9bab"><div class="ttname"><a href="classoperations__research_1_1_filtered_heuristic_expensive_chain_l_n_s_operator.html#a2f370584bd079a49b94a11d2700f9bab">operations_research::FilteredHeuristicExpensiveChainLNSOperator::FilteredHeuristicExpensiveChainLNSOperator</a></div><div class="ttdeci">FilteredHeuristicExpensiveChainLNSOperator(std::unique_ptr< RoutingFilteredHeuristic > heuristic, int num_arcs_to_consider, std::function< int64_t(int64_t, int64_t, int64_t)> arc_cost_for_route_start)</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l01079">routing_neighborhoods.cc:1080</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_filtered_heuristic_local_search_operator_html"><div class="ttname"><a href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html">operations_research::FilteredHeuristicLocalSearchOperator</a></div><div class="ttdoc">Class of operators using a RoutingFilteredHeuristic to insert unperformed nodes after changes have be...</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8h_source.html#l00358">routing_neighborhoods.h:358</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_filtered_heuristic_local_search_operator_html_a068f0179d07363d4d3f462c60e944bf0"><div class="ttname"><a href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a068f0179d07363d4d3f462c60e944bf0">operations_research::FilteredHeuristicLocalSearchOperator::FilteredHeuristicLocalSearchOperator</a></div><div class="ttdeci">FilteredHeuristicLocalSearchOperator(std::unique_ptr< RoutingFilteredHeuristic > heuristic, bool keep_inverse_values=false)</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00675">routing_neighborhoods.cc:675</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_filtered_heuristic_local_search_operator_html_a79fb08fc120a08f42d6f63eb9a2713a1"><div class="ttname"><a href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a79fb08fc120a08f42d6f63eb9a2713a1">operations_research::FilteredHeuristicLocalSearchOperator::model_</a></div><div class="ttdeci">RoutingModel *const model_</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8h_source.html#l00388">routing_neighborhoods.h:388</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_filtered_heuristic_local_search_operator_html_a7e4daec31b209d577f17eae614d76fe1"><div class="ttname"><a href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a7e4daec31b209d577f17eae614d76fe1">operations_research::FilteredHeuristicLocalSearchOperator::IncrementPosition</a></div><div class="ttdeci">virtual bool IncrementPosition()=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_filtered_heuristic_local_search_operator_html_a904b8e4b611be6bce384c1f14b48fd15"><div class="ttname"><a href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#a904b8e4b611be6bce384c1f14b48fd15">operations_research::FilteredHeuristicLocalSearchOperator::SetupNextAccessorForNeighbor</a></div><div class="ttdeci">virtual std::function< int64_t(int64_t)> SetupNextAccessorForNeighbor()=0</div><div class="ttdoc">Virtual method to return the next_accessor to be passed to the heuristic to build a new solution.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_filtered_heuristic_local_search_operator_html_ad988ac45a63930f901dc11713434b945"><div class="ttname"><a href="classoperations__research_1_1_filtered_heuristic_local_search_operator.html#ad988ac45a63930f901dc11713434b945">operations_research::FilteredHeuristicLocalSearchOperator::removed_nodes_</a></div><div class="ttdeci">SparseBitset removed_nodes_</div><div class="ttdoc">Keeps track of removed nodes when making a neighbor.</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8h_source.html#l00390">routing_neighborhoods.h:390</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_filtered_heuristic_path_l_n_s_operator_html_a38cacd12bc9db8fd86e8895320594131"><div class="ttname"><a href="classoperations__research_1_1_filtered_heuristic_path_l_n_s_operator.html#a38cacd12bc9db8fd86e8895320594131">operations_research::FilteredHeuristicPathLNSOperator::FilteredHeuristicPathLNSOperator</a></div><div class="ttdeci">FilteredHeuristicPathLNSOperator(std::unique_ptr< RoutingFilteredHeuristic > heuristic)</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00769">routing_neighborhoods.cc:769</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_index_pair_swap_active_operator_html_a12ab83f297096ca5fe0970e01ac7c78c"><div class="ttname"><a href="classoperations__research_1_1_index_pair_swap_active_operator.html#a12ab83f297096ca5fe0970e01ac7c78c">operations_research::IndexPairSwapActiveOperator::IndexPairSwapActiveOperator</a></div><div class="ttdeci">IndexPairSwapActiveOperator(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, const RoutingIndexPairs &index_pairs)</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00626">routing_neighborhoods.cc:626</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_index_pair_swap_active_operator_html_a24ea165f00f8e15de94958fc804ff209"><div class="ttname"><a href="classoperations__research_1_1_index_pair_swap_active_operator.html#a24ea165f00f8e15de94958fc804ff209">operations_research::IndexPairSwapActiveOperator::MakeNeighbor</a></div><div class="ttdeci">bool MakeNeighbor() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00651">routing_neighborhoods.cc:651</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_index_pair_swap_active_operator_html_a2b47576627076cc054924a89a08f69a6"><div class="ttname"><a href="classoperations__research_1_1_index_pair_swap_active_operator.html#a2b47576627076cc054924a89a08f69a6">operations_research::IndexPairSwapActiveOperator::MakeNextNeighbor</a></div><div class="ttdeci">bool MakeNextNeighbor(Assignment *delta, Assignment *deltadelta) override</div><div class="ttdoc">Redefines MakeNextNeighbor to export a simpler interface.</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00637">routing_neighborhoods.cc:637</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_local_search_operator_html"><div class="ttname"><a href="classoperations__research_1_1_int_var_local_search_operator.html">operations_research::IntVarLocalSearchOperator</a></div><div class="ttdoc">Specialization of LocalSearchOperator built from an array of IntVars which specifies the scope of the...</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01021">constraint_solveri.h:1022</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_local_search_operator_html_a2b47576627076cc054924a89a08f69a6"><div class="ttname"><a href="classoperations__research_1_1_int_var_local_search_operator.html#a2b47576627076cc054924a89a08f69a6">operations_research::IntVarLocalSearchOperator::MakeNextNeighbor</a></div><div class="ttdeci">bool MakeNextNeighbor(Assignment *delta, Assignment *deltadelta) override</div><div class="ttdoc">Redefines MakeNextNeighbor to export a simpler interface.</div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l00076">local_search.cc:76</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_light_pair_relocate_operator_html_a24ea165f00f8e15de94958fc804ff209"><div class="ttname"><a href="classoperations__research_1_1_light_pair_relocate_operator.html#a24ea165f00f8e15de94958fc804ff209">operations_research::LightPairRelocateOperator::MakeNeighbor</a></div><div class="ttdeci">bool MakeNeighbor() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00285">routing_neighborhoods.cc:285</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_light_pair_relocate_operator_html_abbb14cebfe6adf36fb5a9c6a30768080"><div class="ttname"><a href="classoperations__research_1_1_light_pair_relocate_operator.html#abbb14cebfe6adf36fb5a9c6a30768080">operations_research::LightPairRelocateOperator::LightPairRelocateOperator</a></div><div class="ttdeci">LightPairRelocateOperator(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, const RoutingIndexPairs &index_pairs)</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00275">routing_neighborhoods.cc:275</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_make_pair_active_operator_html_a22efab68fd4a93ad85101ceffb01134b"><div class="ttname"><a href="classoperations__research_1_1_make_pair_active_operator.html#a22efab68fd4a93ad85101ceffb01134b">operations_research::MakePairActiveOperator::GetBaseNodeRestartPosition</a></div><div class="ttdeci">int64_t GetBaseNodeRestartPosition(int base_index) override</div><div class="ttdoc">Returns the index of the node to which the base node of index base_index must be set to when it reach...</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00152">routing_neighborhoods.cc:152</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_make_pair_active_operator_html_a24ea165f00f8e15de94958fc804ff209"><div class="ttname"><a href="classoperations__research_1_1_make_pair_active_operator.html#a24ea165f00f8e15de94958fc804ff209">operations_research::MakePairActiveOperator::MakeNeighbor</a></div><div class="ttdeci">bool MakeNeighbor() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00139">routing_neighborhoods.cc:139</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_make_pair_active_operator_html_a86507a34f9b1d96c7d2358c4c0894fb7"><div class="ttname"><a href="classoperations__research_1_1_make_pair_active_operator.html#a86507a34f9b1d96c7d2358c4c0894fb7">operations_research::MakePairActiveOperator::MakePairActiveOperator</a></div><div class="ttdeci">MakePairActiveOperator(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, const RoutingIndexPairs &pairs)</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00108">routing_neighborhoods.cc:108</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_make_pair_active_operator_html_ad14cde260686e5b4174e691675df3139"><div class="ttname"><a href="classoperations__research_1_1_make_pair_active_operator.html#ad14cde260686e5b4174e691675df3139">operations_research::MakePairActiveOperator::MakeOneNeighbor</a></div><div class="ttdeci">bool MakeOneNeighbor() override</div><div class="ttdoc">This method should not be overridden. Override MakeNeighbor() instead.</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00120">routing_neighborhoods.cc:120</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_make_pair_inactive_operator_html_a02e944adb48953a4d4c8200287a14d37"><div class="ttname"><a href="classoperations__research_1_1_make_pair_inactive_operator.html#a02e944adb48953a4d4c8200287a14d37">operations_research::MakePairInactiveOperator::MakePairInactiveOperator</a></div><div class="ttdeci">MakePairInactiveOperator(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, const RoutingIndexPairs &index_pairs)</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00185">routing_neighborhoods.cc:185</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_make_pair_inactive_operator_html_a24ea165f00f8e15de94958fc804ff209"><div class="ttname"><a href="classoperations__research_1_1_make_pair_inactive_operator.html#a24ea165f00f8e15de94958fc804ff209">operations_research::MakePairInactiveOperator::MakeNeighbor</a></div><div class="ttdeci">bool MakeNeighbor() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00195">routing_neighborhoods.cc:195</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_make_relocate_neighbors_operator_html_a24ea165f00f8e15de94958fc804ff209"><div class="ttname"><a href="classoperations__research_1_1_make_relocate_neighbors_operator.html#a24ea165f00f8e15de94958fc804ff209">operations_research::MakeRelocateNeighborsOperator::MakeNeighbor</a></div><div class="ttdeci">bool MakeNeighbor() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00047">routing_neighborhoods.cc:47</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_make_relocate_neighbors_operator_html_a28fd1231bc1d9d0eaaa2224fbf777811"><div class="ttname"><a href="classoperations__research_1_1_make_relocate_neighbors_operator.html#a28fd1231bc1d9d0eaaa2224fbf777811">operations_research::MakeRelocateNeighborsOperator::MakeRelocateNeighborsOperator</a></div><div class="ttdeci">MakeRelocateNeighborsOperator(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, RoutingTransitCallback2 arc_evaluator)</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00038">routing_neighborhoods.cc:38</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_pair_exchange_operator_html_a24ea165f00f8e15de94958fc804ff209"><div class="ttname"><a href="classoperations__research_1_1_pair_exchange_operator.html#a24ea165f00f8e15de94958fc804ff209">operations_research::PairExchangeOperator::MakeNeighbor</a></div><div class="ttdeci">bool MakeNeighbor() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00313">routing_neighborhoods.cc:313</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_pair_exchange_operator_html_a42806d77eaa1134f2c10d4e8d3eb8612"><div class="ttname"><a href="classoperations__research_1_1_pair_exchange_operator.html#a42806d77eaa1134f2c10d4e8d3eb8612">operations_research::PairExchangeOperator::PairExchangeOperator</a></div><div class="ttdeci">PairExchangeOperator(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, const RoutingIndexPairs &index_pairs)</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00303">routing_neighborhoods.cc:303</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_pair_exchange_relocate_operator_html_a22efab68fd4a93ad85101ceffb01134b"><div class="ttname"><a href="classoperations__research_1_1_pair_exchange_relocate_operator.html#a22efab68fd4a93ad85101ceffb01134b">operations_research::PairExchangeRelocateOperator::GetBaseNodeRestartPosition</a></div><div class="ttdeci">int64_t GetBaseNodeRestartPosition(int base_index) override</div><div class="ttdoc">Returns the index of the node to which the base node of index base_index must be set to when it reach...</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00493">routing_neighborhoods.cc:493</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_pair_exchange_relocate_operator_html_a24ea165f00f8e15de94958fc804ff209"><div class="ttname"><a href="classoperations__research_1_1_pair_exchange_relocate_operator.html#a24ea165f00f8e15de94958fc804ff209">operations_research::PairExchangeRelocateOperator::MakeNeighbor</a></div><div class="ttdeci">bool MakeNeighbor() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00385">routing_neighborhoods.cc:385</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_pair_exchange_relocate_operator_html_a39c490e9305bd7dd5ea6eb3387bc0078"><div class="ttname"><a href="classoperations__research_1_1_pair_exchange_relocate_operator.html#a39c490e9305bd7dd5ea6eb3387bc0078">operations_research::PairExchangeRelocateOperator::PairExchangeRelocateOperator</a></div><div class="ttdeci">PairExchangeRelocateOperator(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, const RoutingIndexPairs &index_pairs)</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00375">routing_neighborhoods.cc:375</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_pair_exchange_relocate_operator_html_aeb4fe30538ba848f88b1657accd934c6"><div class="ttname"><a href="classoperations__research_1_1_pair_exchange_relocate_operator.html#aeb4fe30538ba848f88b1657accd934c6">operations_research::PairExchangeRelocateOperator::OnSamePathAsPreviousBase</a></div><div class="ttdeci">bool OnSamePathAsPreviousBase(int64_t base_index) override</div><div class="ttdoc">Returns true if a base node has to be on the same path as the "previous" base node (base node of inde...</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00483">routing_neighborhoods.cc:483</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_pair_relocate_operator_html_a22efab68fd4a93ad85101ceffb01134b"><div class="ttname"><a href="classoperations__research_1_1_pair_relocate_operator.html#a22efab68fd4a93ad85101ceffb01134b">operations_research::PairRelocateOperator::GetBaseNodeRestartPosition</a></div><div class="ttdeci">int64_t GetBaseNodeRestartPosition(int base_index) override</div><div class="ttdoc">Returns the index of the node to which the base node of index base_index must be set to when it reach...</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00265">routing_neighborhoods.cc:265</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_pair_relocate_operator_html_a24ea165f00f8e15de94958fc804ff209"><div class="ttname"><a href="classoperations__research_1_1_pair_relocate_operator.html#a24ea165f00f8e15de94958fc804ff209">operations_research::PairRelocateOperator::MakeNeighbor</a></div><div class="ttdeci">bool MakeNeighbor() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00216">routing_neighborhoods.cc:216</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_pair_relocate_operator_html_adc94da037635aa653d2f68388f199086"><div class="ttname"><a href="classoperations__research_1_1_pair_relocate_operator.html#adc94da037635aa653d2f68388f199086">operations_research::PairRelocateOperator::PairRelocateOperator</a></div><div class="ttdeci">PairRelocateOperator(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, const RoutingIndexPairs &index_pairs)</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00206">routing_neighborhoods.cc:206</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html">operations_research::PathOperator</a></div><div class="ttdoc">Base class of the local search operators dedicated to path modifications (a path is a set of nodes li...</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01313">constraint_solveri.h:1313</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_a027b0d17fd972bee95a8023e7d4f81c9"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#a027b0d17fd972bee95a8023e7d4f81c9">operations_research::PathOperator::StartNode</a></div><div class="ttdeci">int64_t StartNode(int i) const</div><div class="ttdoc">Returns the start node of the ith base node.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01412">constraint_solveri.h:1412</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_a03283bdc4a6447ff4882cb1e42662b00"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#a03283bdc4a6447ff4882cb1e42662b00">operations_research::PathOperator::IsInactive</a></div><div class="ttdeci">bool IsInactive(int64_t node) const</div><div class="ttdoc">Returns true if node is inactive.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01504">constraint_solveri.h:1504</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_a1223e0b8dbca7cd9c296fc4de65080b2"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#a1223e0b8dbca7cd9c296fc4de65080b2">operations_research::PathOperator::OnNodeInitialization</a></div><div class="ttdeci">virtual void OnNodeInitialization()</div><div class="ttdoc">Called by OnStart() after initializing node information.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01383">constraint_solveri.h:1383</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_a17bdf687f4bf47cb68ea163f28876608"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#a17bdf687f4bf47cb68ea163f28876608">operations_research::PathOperator::IsPathStart</a></div><div class="ttdeci">bool IsPathStart(int64_t node) const</div><div class="ttdoc">Returns true if node is the first node on the path.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01501">constraint_solveri.h:1501</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_a28146a7f59f91f25281c97d55abce60d"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#a28146a7f59f91f25281c97d55abce60d">operations_research::PathOperator::CheckChainValidity</a></div><div class="ttdeci">bool CheckChainValidity(int64_t before_chain, int64_t chain_end, int64_t exclude) const</div><div class="ttdoc">Returns true if the chain is a valid path without cycles from before_chain to chain_end and does not ...</div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l00839">local_search.cc:839</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_a3493d43792939bc2a16ec5b53361095d"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#a3493d43792939bc2a16ec5b53361095d">operations_research::PathOperator::path_starts</a></div><div class="ttdeci">const std::vector< int64_t > & path_starts() const</div><div class="ttdoc">Returns the vector of path start nodes.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01414">constraint_solveri.h:1414</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_a4f36c21ecd69ac0eda49cd44375e88b4"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#a4f36c21ecd69ac0eda49cd44375e88b4">operations_research::PathOperator::IsPathEnd</a></div><div class="ttdeci">bool IsPathEnd(int64_t node) const</div><div class="ttdoc">Returns true if node is the last node on the path; defined by the fact that node is outside the range...</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01498">constraint_solveri.h:1498</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_a5f9e1016a5bb6a7d5cded8599a50fce1"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#a5f9e1016a5bb6a7d5cded8599a50fce1">operations_research::PathOperator::Next</a></div><div class="ttdeci">int64_t Next(int64_t node) const</div><div class="ttdoc">Returns the node after node in the current delta.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01356">constraint_solveri.h:1356</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_a625a8523af421e43b7ac500b934e7dbd"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#a625a8523af421e43b7ac500b934e7dbd">operations_research::PathOperator::MoveChain</a></div><div class="ttdeci">bool MoveChain(int64_t before_chain, int64_t chain_end, int64_t destination)</div><div class="ttdoc">Moves the chain starting after the node before_chain and ending at the node chain_end after the node ...</div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l00412">local_search.cc:412</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_a683f9daa3c8c8d6695ed277a470942f5"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#a683f9daa3c8c8d6695ed277a470942f5">operations_research::PathOperator::MakeActive</a></div><div class="ttdeci">bool MakeActive(int64_t node, int64_t destination)</div><div class="ttdoc">Insert the inactive node after destination.</div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l00458">local_search.cc:458</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_a968f3a82c5dbaba4f0725200b00ee97f"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#a968f3a82c5dbaba4f0725200b00ee97f">operations_research::PathOperator::SetNext</a></div><div class="ttdeci">void SetNext(int64_t from, int64_t to, int64_t path)</div><div class="ttdoc">Sets 'to' to be the node after 'from' on the given path.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01486">constraint_solveri.h:1486</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_a97cd8657e86644c1fb1b3b9f12ddc596"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#a97cd8657e86644c1fb1b3b9f12ddc596">operations_research::PathOperator::AddPairAlternativeSets</a></div><div class="ttdeci">void AddPairAlternativeSets(const std::vector< std::pair< std::vector< int64_t >, std::vector< int64_t > > > &pair_alternative_sets)</div><div class="ttdoc">Adds all sets of node alternatives of a vector of alternative pairs.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01532">constraint_solveri.h:1532</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_a9f9007781da398bc03b61ab99864295c"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#a9f9007781da398bc03b61ab99864295c">operations_research::PathOperator::BaseSiblingAlternativeNode</a></div><div class="ttdeci">int64_t BaseSiblingAlternativeNode(int i) const</div><div class="ttdoc">Returns the alternative node for the sibling of the ith base node.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01402">constraint_solveri.h:1402</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_aa14dad2d86c18296f9a5227b87d5caad"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#aa14dad2d86c18296f9a5227b87d5caad">operations_research::PathOperator::Prev</a></div><div class="ttdeci">int64_t Prev(int64_t node) const</div><div class="ttdoc">Returns the node before node in the current delta.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01362">constraint_solveri.h:1362</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_aa2ea96360ac4370b31fc72090b55e7cc"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#aa2ea96360ac4370b31fc72090b55e7cc">operations_research::PathOperator::GetActiveAlternativeSibling</a></div><div class="ttdeci">int64_t GetActiveAlternativeSibling(int node) const</div><div class="ttdoc">Returns the active node in the alternative set of the sibling of the given node.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01560">constraint_solveri.h:1560</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_aa5e00890b9ba3ed95dfba829e51f6be4"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#aa5e00890b9ba3ed95dfba829e51f6be4">operations_research::PathOperator::OldNext</a></div><div class="ttdeci">int64_t OldNext(int64_t node) const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01454">constraint_solveri.h:1454</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_aad7695e494039d607c26afb6acd0644a"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#aad7695e494039d607c26afb6acd0644a">operations_research::PathOperator::number_of_nexts_</a></div><div class="ttdeci">const int number_of_nexts_</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01572">constraint_solveri.h:1572</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_ab5ccf1d0572985fd266702a181b9cf8d"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#ab5ccf1d0572985fd266702a181b9cf8d">operations_research::PathOperator::SwapActiveAndInactive</a></div><div class="ttdeci">bool SwapActiveAndInactive(int64_t active, int64_t inactive)</div><div class="ttdoc">Replaces active by inactive in the current path, making active inactive.</div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l00485">local_search.cc:485</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_ab661b8d8259dac8444804d91809fbb0a"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#ab661b8d8259dac8444804d91809fbb0a">operations_research::PathOperator::ResetPosition</a></div><div class="ttdeci">void ResetPosition()</div><div class="ttdoc">Reset the position of the operator to its position when Start() was last called; this can be used to ...</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01514">constraint_solveri.h:1514</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_ab8846cc7a17291cb0dffd4c0fc4933ea"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#ab8846cc7a17291cb0dffd4c0fc4933ea">operations_research::PathOperator::BaseNode</a></div><div class="ttdeci">int64_t BaseNode(int i) const</div><div class="ttdoc">Returns the ith base node of the operator.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01386">constraint_solveri.h:1386</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_ac94bcebc6d1699e2292cf5fb56970a80"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#ac94bcebc6d1699e2292cf5fb56970a80">operations_research::PathOperator::BaseAlternativeNode</a></div><div class="ttdeci">int64_t BaseAlternativeNode(int i) const</div><div class="ttdoc">Returns the alternative node for the ith base node.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01390">constraint_solveri.h:1390</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_ad14cde260686e5b4174e691675df3139"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#ad14cde260686e5b4174e691675df3139">operations_research::PathOperator::MakeOneNeighbor</a></div><div class="ttdeci">bool MakeOneNeighbor() override</div><div class="ttdoc">This method should not be overridden. Override MakeNeighbor() instead.</div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l00388">local_search.cc:388</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_adf2175ee598b241dcc5459573ebdc886"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#adf2175ee598b241dcc5459573ebdc886">operations_research::PathOperator::Path</a></div><div class="ttdeci">int64_t Path(int64_t node) const</div><div class="ttdoc">Returns the index of the path to which node belongs in the current delta.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01370">constraint_solveri.h:1370</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_aec4cb9ff1023933f7c5570a65a7208e7"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#aec4cb9ff1023933f7c5570a65a7208e7">operations_research::PathOperator::SetNextBaseToIncrement</a></div><div class="ttdeci">virtual void SetNextBaseToIncrement(int64_t base_index)</div><div class="ttdoc">Set the next base to increment on next iteration.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01447">constraint_solveri.h:1447</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_path_operator_html_aff25e92fae946063c5a4a786e58e37a2"><div class="ttname"><a href="classoperations__research_1_1_path_operator.html#aff25e92fae946063c5a4a786e58e37a2">operations_research::PathOperator::MakeChainInactive</a></div><div class="ttdeci">bool MakeChainInactive(int64_t before_chain, int64_t chain_end)</div><div class="ttdoc">Makes the nodes on the chain starting after before_chain and ending at chain_end inactive.</div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l00468">local_search.cc:468</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_relocate_expensive_chain_html_a24ea165f00f8e15de94958fc804ff209"><div class="ttname"><a href="classoperations__research_1_1_relocate_expensive_chain.html#a24ea165f00f8e15de94958fc804ff209">operations_research::RelocateExpensiveChain::MakeNeighbor</a></div><div class="ttdeci">bool MakeNeighbor() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l01258">routing_neighborhoods.cc:1258</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_relocate_expensive_chain_html_ad036ef22c3dbe219d5502b2fb85a3128"><div class="ttname"><a href="classoperations__research_1_1_relocate_expensive_chain.html#ad036ef22c3dbe219d5502b2fb85a3128">operations_research::RelocateExpensiveChain::RelocateExpensiveChain</a></div><div class="ttdeci">RelocateExpensiveChain(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, int num_arcs_to_consider, std::function< int64_t(int64_t, int64_t, int64_t)> arc_cost_for_path_start)</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l01241">routing_neighborhoods.cc:1241</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_relocate_expensive_chain_html_ad14cde260686e5b4174e691675df3139"><div class="ttname"><a href="classoperations__research_1_1_relocate_expensive_chain.html#ad14cde260686e5b4174e691675df3139">operations_research::RelocateExpensiveChain::MakeOneNeighbor</a></div><div class="ttdeci">bool MakeOneNeighbor() override</div><div class="ttdoc">This method should not be overridden. Override MakeNeighbor() instead.</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l01281">routing_neighborhoods.cc:1281</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_relocate_path_and_heuristic_insert_unperformed_operator_html_a5ae04552f86762e99d76d37fe26eee15"><div class="ttname"><a href="classoperations__research_1_1_relocate_path_and_heuristic_insert_unperformed_operator.html#a5ae04552f86762e99d76d37fe26eee15">operations_research::RelocatePathAndHeuristicInsertUnperformedOperator::RelocatePathAndHeuristicInsertUnperformedOperator</a></div><div class="ttdeci">RelocatePathAndHeuristicInsertUnperformedOperator(std::unique_ptr< RoutingFilteredHeuristic > heuristic)</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00829">routing_neighborhoods.cc:830</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_relocate_subtrip_html_a24ea165f00f8e15de94958fc804ff209"><div class="ttname"><a href="classoperations__research_1_1_relocate_subtrip.html#a24ea165f00f8e15de94958fc804ff209">operations_research::RelocateSubtrip::MakeNeighbor</a></div><div class="ttdeci">bool MakeNeighbor() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l01473">routing_neighborhoods.cc:1473</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_relocate_subtrip_html_a6bcb545cf548018c6a0a83c85fb512c9"><div class="ttname"><a href="classoperations__research_1_1_relocate_subtrip.html#a6bcb545cf548018c6a0a83c85fb512c9">operations_research::RelocateSubtrip::RelocateSubtrip</a></div><div class="ttdeci">RelocateSubtrip(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, const RoutingIndexPairs &pairs)</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l01347">routing_neighborhoods.cc:1347</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a114000eadb54d1a6275add6c1e6fcf33"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a114000eadb54d1a6275add6c1e6fcf33">operations_research::RoutingModel::GetVehicleClassIndexOfVehicle</a></div><div class="ttdeci">VehicleClassIndex GetVehicleClassIndexOfVehicle(int64_t vehicle) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01442">routing.h:1442</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a2323c80745919399f8665a07beab1451"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a2323c80745919399f8665a07beab1451">operations_research::RoutingModel::VehicleVars</a></div><div class="ttdeci">const std::vector< IntVar * > & VehicleVars() const</div><div class="ttdoc">Returns all vehicle variables of the model, such that VehicleVars(i) is the vehicle variable of the n...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01356">routing.h:1356</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a34ab0d5fa45360b5e6a42b9a78cfe5a8"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a34ab0d5fa45360b5e6a42b9a78cfe5a8">operations_research::RoutingModel::GetVehicleClassesCount</a></div><div class="ttdeci">int GetVehicleClassesCount() const</div><div class="ttdoc">Returns the number of different vehicle classes in the model.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01462">routing.h:1462</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a3582f01eabc65ba4b801215ca6420a7c"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a3582f01eabc65ba4b801215ca6420a7c">operations_research::RoutingModel::IsStart</a></div><div class="ttdeci">bool IsStart(int64_t index) const</div><div class="ttdoc">Returns true if 'index' represents the first node of a route.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l03939">routing.cc:3939</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_a434b15d056c7e1751925eba475e84c32"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a434b15d056c7e1751925eba475e84c32">operations_research::RoutingModel::GetDeliveryIndexPairs</a></div><div class="ttdeci">const std::vector< std::pair< int, int > > & GetDeliveryIndexPairs(int64_t node_index) const</div><div class="ttdoc">Same as above for deliveries.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l02072">routing.cc:2072</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_a5e7fe0d056275b47eccc1b6bfce0b482"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a5e7fe0d056275b47eccc1b6bfce0b482">operations_research::RoutingModel::NextVar</a></div><div class="ttdeci">IntVar * NextVar(int64_t index) const</div><div class="ttdoc">!defined(SWIGPYTHON)</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01366">routing.h:1366</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_aa650ea2c539fab98337ae2f6ca553f3d"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">operations_research::RoutingModel::Start</a></div><div class="ttdeci">int64_t Start(int vehicle) const</div><div class="ttdoc">Model inspection.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01333">routing.h:1333</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_abfa127093eb53ae531ccb1f4ada6cc8a"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#abfa127093eb53ae531ccb1f4ada6cc8a">operations_research::RoutingModel::GetArcCostForClass</a></div><div class="ttdeci">int64_t GetArcCostForClass(int64_t from_index, int64_t to_index, int64_t cost_class_index) const</div><div class="ttdoc">Returns the cost of the segment between two nodes for a given cost class.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l03971">routing.cc:3971</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_ac6d5e197d4c8db922db0b8e2a8b7074e"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#ac6d5e197d4c8db922db0b8e2a8b7074e">operations_research::RoutingModel::GetPickupIndexPairs</a></div><div class="ttdeci">const std::vector< std::pair< int, int > > & GetPickupIndexPairs(int64_t node_index) const</div><div class="ttdoc">Returns pairs for which the node is a pickup; the first element of each pair is the index in the pick...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l02066">routing.cc:2066</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_acf67dc202e247ce193038850f71306d3"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#acf67dc202e247ce193038850f71306d3">operations_research::RoutingModel::IsEnd</a></div><div class="ttdeci">bool IsEnd(int64_t index) const</div><div class="ttdoc">Returns true if 'index' represents the last node of a route.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01339">routing.h:1339</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_ad3b144985c2b4b24cf39b839dbd9c16d"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#ad3b144985c2b4b24cf39b839dbd9c16d">operations_research::RoutingModel::GetCostClassesCount</a></div><div class="ttdeci">int GetCostClassesCount() const</div><div class="ttdoc">Returns the number of different cost classes in the model.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01437">routing.h:1437</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_aeb9d2afe2e9d5bd929aad759f37e4938"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#aeb9d2afe2e9d5bd929aad759f37e4938">operations_research::RoutingModel::VehicleIndex</a></div><div class="ttdeci">int VehicleIndex(int64_t index) const</div><div class="ttdoc">Returns the vehicle of the given start/end index, and -1 if the given index is not a vehicle start/en...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01342">routing.h:1342</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_sparse_bitset_html_a41f798a04019147982b29c576ff9d8b7"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">operations_research::SparseBitset::Set</a></div><div class="ttdeci">void Set(IntegerType index)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00809">bitset.h:809</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_a7187b794b93178bdf96f632d1f5d8c03"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#a7187b794b93178bdf96f632d1f5d8c03">operations_research::SparseBitset::PositionsSetAtLeastOnce</a></div><div class="ttdeci">const std::vector< IntegerType > & PositionsSetAtLeastOnce() const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00819">bitset.h:819</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_ab4bc8236a9bfe59526e353800a0f0470"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#ab4bc8236a9bfe59526e353800a0f0470">operations_research::SparseBitset::SparseClearAll</a></div><div class="ttdeci">void SparseClearAll()</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00776">bitset.h:776</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_swap_index_pair_operator_html_a08ba64a7e6c6e507272f75ca518d26f5"><div class="ttname"><a href="classoperations__research_1_1_swap_index_pair_operator.html#a08ba64a7e6c6e507272f75ca518d26f5">operations_research::SwapIndexPairOperator::OnStart</a></div><div class="ttdeci">void OnStart() override</div><div class="ttdoc">Called by Start() after synchronizing the operator with the current assignment.</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00586">routing_neighborhoods.cc:586</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_swap_index_pair_operator_html_a2b47576627076cc054924a89a08f69a6"><div class="ttname"><a href="classoperations__research_1_1_swap_index_pair_operator.html#a2b47576627076cc054924a89a08f69a6">operations_research::SwapIndexPairOperator::MakeNextNeighbor</a></div><div class="ttdeci">bool MakeNextNeighbor(Assignment *delta, Assignment *deltadelta) override</div><div class="ttdoc">Redefines MakeNextNeighbor to export a simpler interface.</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00529">routing_neighborhoods.cc:529</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_swap_index_pair_operator_html_a622930b6b2a33027ce29a1bd5074792c"><div class="ttname"><a href="classoperations__research_1_1_swap_index_pair_operator.html#a622930b6b2a33027ce29a1bd5074792c">operations_research::SwapIndexPairOperator::SwapIndexPairOperator</a></div><div class="ttdeci">SwapIndexPairOperator(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &path_vars, std::function< int(int64_t)> start_empty_path_class, const RoutingIndexPairs &index_pairs)</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8cc_source.html#l00513">routing_neighborhoods.cc:513</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_swap_index_pair_operator_html_aed804747c45a7e1caf81461f9e45dd91"><div class="ttname"><a href="classoperations__research_1_1_swap_index_pair_operator.html#aed804747c45a7e1caf81461f9e45dd91">operations_research::SwapIndexPairOperator::DebugString</a></div><div class="ttdeci">std::string DebugString() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__neighborhoods_8h_source.html#l00304">routing_neighborhoods.h:304</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_var_local_search_operator_html_a06eb05df61a9b9fce744928947f43d89"><div class="ttname"><a href="classoperations__research_1_1_var_local_search_operator.html#a06eb05df61a9b9fce744928947f43d89">operations_research::VarLocalSearchOperator< IntVar, int64_t, IntVarLocalSearchHandler >::RevertChanges</a></div><div class="ttdeci">void RevertChanges(bool incremental)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00882">constraint_solveri.h:882</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_var_local_search_operator_html_a20dd03e0437bf484e2ea321595c2e1cd"><div class="ttname"><a href="classoperations__research_1_1_var_local_search_operator.html#a20dd03e0437bf484e2ea321595c2e1cd">operations_research::VarLocalSearchOperator< IntVar, int64_t, IntVarLocalSearchHandler >::SetValue</a></div><div class="ttdeci">void SetValue(int64_t index, const int64_t &value)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00845">constraint_solveri.h:845</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_var_local_search_operator_html_a24926108b770033792d015cb86aeffb3"><div class="ttname"><a href="classoperations__research_1_1_var_local_search_operator.html#a24926108b770033792d015cb86aeffb3">operations_research::VarLocalSearchOperator< IntVar, int64_t, IntVarLocalSearchHandler >::Size</a></div><div class="ttdeci">int Size() const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00834">constraint_solveri.h:834</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_var_local_search_operator_html_a3c7b6e2c172f34aad1d952d799be61f2"><div class="ttname"><a href="classoperations__research_1_1_var_local_search_operator.html#a3c7b6e2c172f34aad1d952d799be61f2">operations_research::VarLocalSearchOperator< IntVar, int64_t, IntVarLocalSearchHandler >::Value</a></div><div class="ttdeci">const int64_t & Value(int64_t index) const</div><div class="ttdoc">Returns the value in the current assignment of the variable of given index.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00837">constraint_solveri.h:837</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_var_local_search_operator_html_a79163ea8990864f185e87eabf1578cca"><div class="ttname"><a href="classoperations__research_1_1_var_local_search_operator.html#a79163ea8990864f185e87eabf1578cca">operations_research::VarLocalSearchOperator< IntVar, int64_t, IntVarLocalSearchHandler >::OldValue</a></div><div class="ttdeci">const int64_t & OldValue(int64_t index) const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00844">constraint_solveri.h:844</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_var_local_search_operator_html_a88a93be7370ff1f4c043fb335c8aac7c"><div class="ttname"><a href="classoperations__research_1_1_var_local_search_operator.html#a88a93be7370ff1f4c043fb335c8aac7c">operations_research::VarLocalSearchOperator< IntVar, int64_t, IntVarLocalSearchHandler >::Var</a></div><div class="ttdeci">IntVar * Var(int64_t index) const</div><div class="ttdoc">Returns the variable of given index.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00842">constraint_solveri.h:842</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_var_local_search_operator_html_aabafb6d8996f5101db26b30efff406b0"><div class="ttname"><a href="classoperations__research_1_1_var_local_search_operator.html#aabafb6d8996f5101db26b30efff406b0">operations_research::VarLocalSearchOperator< IntVar, int64_t, IntVarLocalSearchHandler >::ApplyChanges</a></div><div class="ttdeci">bool ApplyChanges(Assignment *delta, Assignment *deltadelta) const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00858">constraint_solveri.h:858</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_var_local_search_operator_html_ae2af73491ab2aa6804b443d442026a5e"><div class="ttname"><a href="classoperations__research_1_1_var_local_search_operator.html#ae2af73491ab2aa6804b443d442026a5e">operations_research::VarLocalSearchOperator< IntVar, int64_t, IntVarLocalSearchHandler >::AddVars</a></div><div class="ttdeci">void AddVars(const std::vector< IntVar * > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00895">constraint_solveri.h:895</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="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="ag__gurobi_8cc_html_a2237393c7ae7ad7344c9885066d5ab6d"><div class="ttname"><a href="g__gurobi_8cc.html#a2237393c7ae7ad7344c9885066d5ab6d">status</a></div><div class="ttdeci">absl::Status status</div><div class="ttdef"><b>Definition:</b> <a href="g__gurobi_8cc_source.html#l00035">g_gurobi.cc:35</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="anamespaceoperations__research_1_1math__opt_html_a5de89a1f6e3f80a49a0d76136d8044e2"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">operations_research::math_opt::swap</a></div><div class="ttdeci">void swap(IdMap< K, V > &a, IdMap< K, V > &b)</div><div class="ttdef"><b>Definition:</b> <a href="id__map_8h_source.html#l00262">id_map.h:262</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_a26868b9d744edcd8d59145e068678885"><div class="ttname"><a href="namespaceoperations__research.html#a26868b9d744edcd8d59145e068678885">operations_research::RoutingTransitCallback2</a></div><div class="ttdeci">std::function< int64_t(int64_t, int64_t)> RoutingTransitCallback2</div><div class="ttdef"><b>Definition:</b> <a href="routing__types_8h_source.html#l00043">routing_types.h:43</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aef7db0bee0a22d1791d040fd3853f3b7"><div class="ttname"><a href="namespaceoperations__research.html#aef7db0bee0a22d1791d040fd3853f3b7">operations_research::RoutingIndexPairs</a></div><div class="ttdeci">std::vector< RoutingIndexPair > RoutingIndexPairs</div><div class="ttdef"><b>Definition:</b> <a href="routing__types_8h_source.html#l00046">routing_types.h:46</a></div></div>
|
|
<div class="ttc" id="anamespacestd_html"><div class="ttname"><a href="namespacestd.html">std</a></div><div class="ttdoc">STL namespace.</div></div>
|
|
<div class="ttc" id="aresource_8cc_html_af12056bc2a8e3ec563f0940d87abbd2e"><div class="ttname"><a href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a></div><div class="ttdeci">int64_t delta</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l01694">resource.cc:1694</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__neighborhoods_8h_html"><div class="ttname"><a href="routing__neighborhoods_8h.html">routing_neighborhoods.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="arouting__search_8h_html"><div class="ttname"><a href="routing__search_8h.html">routing_search.h</a></div></div>
|
|
<div class="ttc" id="arouting__types_8h_html"><div class="ttname"><a href="routing__types_8h.html">routing_types.h</a></div></div>
|
|
<div class="ttc" id="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="astrong__int_8h_html"><div class="ttname"><a href="strong__int_8h.html">strong_int.h</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_afbb39f66221aac28bbdefd1dca2b2b0.html">constraint_solver</a></li><li class="navelem"><a class="el" href="routing__neighborhoods_8cc.html">routing_neighborhoods.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.3 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|