5034 lines
998 KiB
HTML
5034 lines
998 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.3"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: routing_search.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__search_8cc_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle"><div class="title">routing_search.cc</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="routing__search_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a 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="comment">// Implementation of all classes related to routing and search.</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="comment">// This includes decision builders, local search neighborhood operators</span></div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="comment">// and local search filters.</span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="comment">// TODO(user): Move all existing routing search code here.</span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span> </div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include "<a class="code" href="routing__search_8h.html">ortools/constraint_solver/routing_search.h</a>"</span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span> </div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include <cmath></span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include <deque></span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include <functional></span></div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include <iterator></span></div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include <limits></span></div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include <numeric></span></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="preprocessor">#include <queue></span></div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="preprocessor">#include <set></span></div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="preprocessor">#include <tuple></span></div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="preprocessor">#include <utility></span></div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> </div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="preprocessor">#include "absl/base/attributes.h"</span></div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="preprocessor">#include "absl/container/flat_hash_map.h"</span></div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span><span class="preprocessor">#include "absl/container/flat_hash_set.h"</span></div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span><span class="preprocessor">#include "absl/flags/flag.h"</span></div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span><span class="preprocessor">#include "absl/memory/memory.h"</span></div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="preprocessor">#include "absl/meta/type_traits.h"</span></div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span><span class="preprocessor">#include "absl/strings/str_cat.h"</span></div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span><span class="preprocessor">#include "absl/strings/string_view.h"</span></div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span><span class="preprocessor">#include "<a class="code" href="adjustable__priority__queue-inl_8h.html">ortools/base/adjustable_priority_queue-inl.h</a>"</span></div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span><span class="preprocessor">#include "<a class="code" href="adjustable__priority__queue_8h.html">ortools/base/adjustable_priority_queue.h</a>"</span></div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</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="l00048" name="l00048"></a><span class="lineno"> 48</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="l00049" name="l00049"></a><span class="lineno"> 49</span><span class="preprocessor">#include "<a class="code" href="macros_8h.html">ortools/base/macros.h</a>"</span></div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span><span class="preprocessor">#include "<a class="code" href="map__util_8h.html">ortools/base/map_util.h</a>"</span></div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span><span class="preprocessor">#include "<a class="code" href="stl__util_8h.html">ortools/base/stl_util.h</a>"</span></div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</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="l00053" name="l00053"></a><span class="lineno"> 53</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="l00054" name="l00054"></a><span class="lineno"> 54</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="l00055" name="l00055"></a><span class="lineno"> 55</span><span class="preprocessor">#include "<a class="code" href="routing__index__manager_8h.html">ortools/constraint_solver/routing_index_manager.h</a>"</span></div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</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="l00057" name="l00057"></a><span class="lineno"> 57</span><span class="preprocessor">#include "<a class="code" href="christofides_8h.html">ortools/graph/christofides.h</a>"</span></div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span><span class="preprocessor">#include "<a class="code" href="bitset_8h.html">ortools/util/bitset.h</a>"</span></div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span><span class="preprocessor">#include "<a class="code" href="range__query__function_8h.html">ortools/util/range_query_function.h</a>"</span></div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span><span class="preprocessor">#include "<a class="code" href="saturated__arithmetic_8h.html">ortools/util/saturated_arithmetic.h</a>"</span></div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> </div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span><span class="keyword">class </span>LocalSearchPhaseParameters;</div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> </div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"><a class="line" href="routing__search_8cc.html#acc95d14bc59afe35d789e11bbacfab6f"> 66</a></span><a class="code hl_function" href="routing__search_8cc.html#acc95d14bc59afe35d789e11bbacfab6f">ABSL_FLAG</a>(<span class="keywordtype">bool</span>, routing_shift_insertion_cost_by_penalty, <span class="keyword">true</span>,</div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="stringliteral">"Shift insertion costs by the penalty of the inserted node(s)."</span>);</div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> </div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="routing__search_8cc.html#a15b2283cda558b516f2abd4f72d60161"> 69</a></span><a class="code hl_function" href="routing__search_8cc.html#acc95d14bc59afe35d789e11bbacfab6f">ABSL_FLAG</a>(int64_t, sweep_sectors, 1,</div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="stringliteral">"The number of sectors the space is divided into before it is sweeped"</span></div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="stringliteral">" by the ray."</span>);</div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> </div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> </div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span><span class="comment">// --- VehicleTypeCurator ---</span></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"><a class="line" href="classoperations__research_1_1_vehicle_type_curator.html#a814500d3b9447208c46bd15c6f95f96d"> 77</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_vehicle_type_curator.html#a814500d3b9447208c46bd15c6f95f96d">VehicleTypeCurator::Reset</a>(<span class="keyword">const</span> std::function<<span class="keywordtype">bool</span>(<span class="keywordtype">int</span>)>& store_vehicle) {</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="keyword">const</span> std::vector<std::set<VehicleClassEntry>>& all_vehicle_classes_per_type =</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> vehicle_type_container_-><a class="code hl_variable" href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container.html#ab04b34ed94012cf2d892d6e9347ee9f6">sorted_vehicle_classes_per_type</a>;</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> sorted_vehicle_classes_per_type_.resize(all_vehicle_classes_per_type.size());</div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="keyword">const</span> std::vector<std::deque<int>>& all_vehicles_per_class =</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> vehicle_type_container_-><a class="code hl_variable" href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container.html#ad39f5508cc37e45b2d759832d343c177">vehicles_per_vehicle_class</a>;</div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> vehicles_per_vehicle_class_.resize(all_vehicles_per_class.size());</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> </div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> type = 0; type < all_vehicle_classes_per_type.size(); type++) {</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> std::set<VehicleClassEntry>& stored_class_entries =</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> sorted_vehicle_classes_per_type_[type];</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> stored_class_entries.clear();</div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="keywordflow">for</span> (<a class="code hl_struct" href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container_1_1_vehicle_class_entry.html">VehicleClassEntry</a> class_entry : all_vehicle_classes_per_type[type]) {</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</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> = class_entry.vehicle_class;</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> std::vector<int>& stored_vehicles =</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> vehicles_per_vehicle_class_[<a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a>];</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> stored_vehicles.clear();</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle : all_vehicles_per_class[<a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a>]) {</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="keywordflow">if</span> (store_vehicle(vehicle)) {</div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> stored_vehicles.push_back(vehicle);</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> }</div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="keywordflow">if</span> (!stored_vehicles.empty()) {</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> stored_class_entries.insert(class_entry);</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> }</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> }</div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> }</div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span>}</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> </div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_vehicle_type_curator.html#a14dcf3d10159ae170c79ac9cac11cf5b"> 106</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_vehicle_type_curator.html#a14dcf3d10159ae170c79ac9cac11cf5b">VehicleTypeCurator::Update</a>(</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="keyword">const</span> std::function<<span class="keywordtype">bool</span>(<span class="keywordtype">int</span>)>& remove_vehicle) {</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="keywordflow">for</span> (std::set<VehicleClassEntry>& class_entries :</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> sorted_vehicle_classes_per_type_) {</div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="keyword">auto</span> class_entry_it = class_entries.begin();</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <span class="keywordflow">while</span> (class_entry_it != class_entries.end()) {</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</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> = class_entry_it->vehicle_class;</div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> std::vector<int>& vehicles = vehicles_per_vehicle_class_[<a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a>];</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> vehicles.erase(std::remove_if(vehicles.begin(), vehicles.end(),</div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> [&remove_vehicle](<span class="keywordtype">int</span> vehicle) {</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> return remove_vehicle(vehicle);</div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> }),</div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> vehicles.end());</div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> <span class="keywordflow">if</span> (vehicles.empty()) {</div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> class_entry_it = class_entries.erase(class_entry_it);</div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> class_entry_it++;</div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> }</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> }</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> }</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span>}</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> </div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_vehicle_type_curator.html#a2f14bd5a823d4b8de9bf858ec54466cc"> 128</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_vehicle_type_curator.html#a2f14bd5a823d4b8de9bf858ec54466cc">VehicleTypeCurator::HasCompatibleVehicleOfType</a>(</div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="keywordtype">int</span> type, <span class="keyword">const</span> std::function<<span class="keywordtype">bool</span>(<span class="keywordtype">int</span>)>& vehicle_is_compatible)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container_1_1_vehicle_class_entry.html">VehicleClassEntry</a>& vehicle_class_entry :</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> sorted_vehicle_classes_per_type_[type]) {</div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle :</div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> vehicles_per_vehicle_class_[vehicle_class_entry.vehicle_class]) {</div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <span class="keywordflow">if</span> (vehicle_is_compatible(vehicle)) <span class="keywordflow">return</span> <span class="keyword">true</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> }</div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="keywordflow">return</span> <span class="keyword">false</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"> 139</span> </div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_vehicle_type_curator.html#a3c728b8544bdbae03f52979a1fda6f90"> 140</a></span>std::pair<int, int> <a class="code hl_function" href="classoperations__research_1_1_vehicle_type_curator.html#a3c728b8544bdbae03f52979a1fda6f90">VehicleTypeCurator::GetCompatibleVehicleOfType</a>(</div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <span class="keywordtype">int</span> type, std::function<<span class="keywordtype">bool</span>(<span class="keywordtype">int</span>)> vehicle_is_compatible,</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> std::function<<span class="keywordtype">bool</span>(<span class="keywordtype">int</span>)> stop_and_return_vehicle) {</div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> std::set<VehicleTypeCurator::VehicleClassEntry>& sorted_classes =</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> sorted_vehicle_classes_per_type_[type];</div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="keyword">auto</span> vehicle_class_it = sorted_classes.begin();</div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> </div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="keywordflow">while</span> (vehicle_class_it != sorted_classes.end()) {</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a> = vehicle_class_it->vehicle_class;</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> std::vector<int>& vehicles = vehicles_per_vehicle_class_[<a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a>];</div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!vehicles.empty());</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"> 152</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> vehicle_it = vehicles.begin(); vehicle_it != vehicles.end();</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> vehicle_it++) {</div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = *vehicle_it;</div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <span class="keywordflow">if</span> (vehicle_is_compatible(vehicle)) {</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> vehicles.erase(vehicle_it);</div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="keywordflow">if</span> (vehicles.empty()) {</div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> sorted_classes.erase(vehicle_class_it);</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> <span class="keywordflow">return</span> {vehicle, -1};</div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> }</div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <span class="keywordflow">if</span> (stop_and_return_vehicle(vehicle)) {</div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="keywordflow">return</span> {-1, vehicle};</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> }</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> <span class="comment">// If no compatible vehicle was found in this class, move on to the next</span></div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> <span class="comment">// vehicle class.</span></div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> vehicle_class_it++;</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> }</div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <span class="comment">// No compatible vehicle of the given type was found and the stopping</span></div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="comment">// condition wasn't met.</span></div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="keywordflow">return</span> {-1, -1};</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> </div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span><span class="comment">// - Models with pickup/deliveries or node precedences are best handled by</span></div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span><span class="comment">// PARALLEL_CHEAPEST_INSERTION.</span></div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span><span class="comment">// - As of January 2018, models with single nodes and at least one node with</span></div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span><span class="comment">// only one allowed vehicle are better solved by PATH_MOST_CONSTRAINED_ARC.</span></div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span><span class="comment">// - In all other cases, PATH_CHEAPEST_ARC is used.</span></div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span><span class="comment">// TODO(user): Make this smarter.</span></div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a89152c6d7ca6a92ff106fe602c706816"> 181</a></span><a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984">FirstSolutionStrategy::Value</a> <a class="code hl_function" href="namespaceoperations__research.html#a89152c6d7ca6a92ff106fe602c706816">AutomaticFirstSolutionStrategy</a>(</div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <span class="keywordtype">bool</span> has_pickup_deliveries, <span class="keywordtype">bool</span> has_node_precedences,</div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <span class="keywordtype">bool</span> has_single_vehicle_node) {</div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> <span class="keywordflow">if</span> (has_pickup_deliveries || has_node_precedences) {</div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <span class="keywordflow">return</span> FirstSolutionStrategy::PARALLEL_CHEAPEST_INSERTION;</div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> }</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="keywordflow">if</span> (has_single_vehicle_node) {</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <span class="keywordflow">return</span> FirstSolutionStrategy::PATH_MOST_CONSTRAINED_ARC;</div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> }</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="keywordflow">return</span> FirstSolutionStrategy::PATH_CHEAPEST_ARC;</div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span>}</div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> </div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span><span class="comment">// --- First solution decision builder ---</span></div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> </div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span><span class="comment">// IntVarFilteredDecisionBuilder</span></div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> </div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#acf25bca8c52b674f343820aaf3d339b5"> 197</a></span><a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#acf25bca8c52b674f343820aaf3d339b5">IntVarFilteredDecisionBuilder::IntVarFilteredDecisionBuilder</a>(</div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> std::unique_ptr<IntVarFilteredHeuristic> heuristic)</div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> : heuristic_(<a class="code hl_namespace" href="namespacestd.html">std</a>::move(heuristic)) {}</div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> </div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#a8c71ca62b0ac538bf37374602e4259bb"> 201</a></span><a class="code hl_class" href="classoperations__research_1_1_decision.html">Decision</a>* <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#a8c71ca62b0ac538bf37374602e4259bb">IntVarFilteredDecisionBuilder::Next</a>(<a class="code hl_class" href="classoperations__research_1_1_solver.html">Solver</a>* solver) {</div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <a class="code hl_class" href="classoperations__research_1_1_assignment.html">Assignment</a>* <span class="keyword">const</span> assignment = heuristic_->BuildSolution();</div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <span class="keywordflow">if</span> (assignment != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"Number of decisions: "</span> << heuristic_->number_of_decisions();</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> <a class="code hl_define" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"Number of rejected decisions: "</span></div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> << heuristic_->number_of_rejects();</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> assignment-><a class="code hl_function" href="classoperations__research_1_1_assignment.html#a1896fe755b612dbebd2c46638f8977a2">Restore</a>();</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> solver-><a class="code hl_function" href="classoperations__research_1_1_solver.html#aeb92d4addb41255c9732cacfcb54f795">Fail</a>();</div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> }</div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span>}</div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> </div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#aac2118d22c4275990bdd1fec28a2a8d3"> 214</a></span>int64_t <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#aac2118d22c4275990bdd1fec28a2a8d3">IntVarFilteredDecisionBuilder::number_of_decisions</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="keywordflow">return</span> heuristic_->number_of_decisions();</div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span>}</div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> </div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#afd4b70bcd23086d4968db3a1d822ee2c"> 218</a></span>int64_t <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#afd4b70bcd23086d4968db3a1d822ee2c">IntVarFilteredDecisionBuilder::number_of_rejects</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> <span class="keywordflow">return</span> heuristic_->number_of_rejects();</div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</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"><a class="line" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#aed804747c45a7e1caf81461f9e45dd91"> 222</a></span>std::string <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_decision_builder.html#aed804747c45a7e1caf81461f9e45dd91">IntVarFilteredDecisionBuilder::DebugString</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> <span class="keywordflow">return</span> absl::StrCat(<span class="stringliteral">"IntVarFilteredDecisionBuilder("</span>,</div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> heuristic_->DebugString(), <span class="stringliteral">")"</span>);</div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span>}</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> </div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span><span class="comment">// --- First solution heuristics ---</span></div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> </div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span><span class="comment">// IntVarFilteredHeuristic</span></div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> </div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#af60e2423a0fdf248c6e5aed0f7368a07"> 231</a></span><a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#af60e2423a0fdf248c6e5aed0f7368a07">IntVarFilteredHeuristic::IntVarFilteredHeuristic</a>(</div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <a class="code hl_class" href="classoperations__research_1_1_solver.html">Solver</a>* solver, <span class="keyword">const</span> std::vector<IntVar*>& vars,</div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> <span class="keyword">const</span> std::vector<IntVar*>& secondary_vars,</div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager)</div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> : assignment_(solver->MakeAssignment()),</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> solver_(solver),</div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>(vars),</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> base_vars_size_(vars.size()),</div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> delta_(solver->MakeAssignment()),</div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> is_in_delta_(<a class="code hl_variable" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size(), false),</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> empty_(solver->MakeAssignment()),</div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> filter_manager_(filter_manager),</div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> objective_upper_bound_(<a class="code hl_namespace" href="namespacestd.html">std</a>::numeric_limits<int64_t>::<a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a>()),</div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> number_of_decisions_(0),</div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> number_of_rejects_(0) {</div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> <span class="keywordflow">if</span> (!secondary_vars.empty()) {</div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> vars_.insert(vars_.end(), secondary_vars.begin(), secondary_vars.end());</div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> }</div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> <a class="code hl_variable" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a6743122cc2fc4818b402ba3d484c6ea4">assignment_</a>-><a class="code hl_function" href="classoperations__research_1_1_assignment.html#ac76f6d6854dc981871832c7714c4a4bb">MutableIntVarContainer</a>()-><a class="code hl_function" href="classoperations__research_1_1_assignment_container.html#ad9cf0e91780366986c2f047bd796cdd5">Resize</a>(vars_.size());</div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> delta_indices_.reserve(vars_.size());</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> </div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a7ae7a2033e2a22ad1dedbf2f3ec8745f"> 253</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a7ae7a2033e2a22ad1dedbf2f3ec8745f">IntVarFilteredHeuristic::ResetSolution</a>() {</div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> number_of_decisions_ = 0;</div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> number_of_rejects_ = 0;</div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> <span class="comment">// Wiping assignment when starting a new search.</span></div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> <a class="code hl_variable" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a6743122cc2fc4818b402ba3d484c6ea4">assignment_</a>-><a class="code hl_function" href="classoperations__research_1_1_assignment.html#ac76f6d6854dc981871832c7714c4a4bb">MutableIntVarContainer</a>()-><a class="code hl_function" href="classoperations__research_1_1_assignment_container.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> <a class="code hl_variable" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a6743122cc2fc4818b402ba3d484c6ea4">assignment_</a>-><a class="code hl_function" href="classoperations__research_1_1_assignment.html#ac76f6d6854dc981871832c7714c4a4bb">MutableIntVarContainer</a>()-><a class="code hl_function" href="classoperations__research_1_1_assignment_container.html#ad9cf0e91780366986c2f047bd796cdd5">Resize</a>(vars_.size());</div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> delta_-><a class="code hl_function" href="classoperations__research_1_1_assignment.html#ac76f6d6854dc981871832c7714c4a4bb">MutableIntVarContainer</a>()-><a class="code hl_function" href="classoperations__research_1_1_assignment_container.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</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_int_var_filtered_heuristic.html#a8447b106d07db2466b60e534964730d3">SynchronizeFilters</a>();</div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span>}</div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> </div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#af3787f4febdbe5033e9834b770476f5d"> 263</a></span><a class="code hl_class" href="classoperations__research_1_1_assignment.html">Assignment</a>* <span class="keyword">const</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#af3787f4febdbe5033e9834b770476f5d">IntVarFilteredHeuristic::BuildSolution</a>() {</div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#aa1103b3a47f7bf316a81ed91ba3e4657">InitializeSolution</a>()) {</div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> }</div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0c46fa4dcc0fed2329041bbe90fc575a">BuildSolutionInternal</a>()) {</div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a6743122cc2fc4818b402ba3d484c6ea4">assignment_</a>;</div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> }</div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span>}</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"><a class="line" href="classoperations__research_1_1_routing_filtered_heuristic.html#ae645e8ef4a6929a1c1dbed695f2dd67d"> 273</a></span><span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_assignment.html">Assignment</a>* <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#ae645e8ef4a6929a1c1dbed695f2dd67d">RoutingFilteredHeuristic::BuildSolutionFromRoutes</a>(</div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor) {</div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> <span class="comment">// NOTE(b/219043402): The filter manager must first be synchronized with a</span></div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> <span class="comment">// valid solution that properly connects route starts to route ends in order</span></div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> <span class="comment">// for future FilterAccept() calls to correctly detect infeasibilities.</span></div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <span class="keywordflow">if</span> (!InitializeSolution()) {</div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> }</div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> </div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> v = 0; v < model_-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); v++) {</div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> int64_t node = model_-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(v);</div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> <span class="keywordflow">while</span> (!model_-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#acf67dc202e247ce193038850f71306d3">IsEnd</a>(node)) {</div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = next_accessor(node);</div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> <a class="code hl_define" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, node);</div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(node, <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> <span class="comment">// TODO(user): Add vehicle values to delta when this method will be</span></div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> <span class="comment">// used with cost filtering. The code should be similar to this:</span></div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> <span class="comment">// if (HasSecondaryVars()) {</span></div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> <span class="comment">// SetValue(SecondaryVarIndex(node), v);</span></div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> <span class="comment">// }</span></div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a7cccc6ea4b6f89355769bc0de4548f1d">SetVehicleIndex</a>(node, v);</div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> node = <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> }</div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> }</div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value()) {</div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#aafb639a547b12967feeefae66a3d3276">ResetVehicleIndices</a>();</div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> }</div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0c46fa4dcc0fed2329041bbe90fc575a">BuildSolutionInternal</a>()) {</div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a6743122cc2fc4818b402ba3d484c6ea4">assignment_</a>;</div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> }</div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span>}</div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> </div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92"> 307</a></span>std::optional<int64_t> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">IntVarFilteredHeuristic::Evaluate</a>(<span class="keywordtype">bool</span> commit) {</div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> ++number_of_decisions_;</div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> accept = FilterAccept();</div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> <span class="keywordflow">if</span> (accept) {</div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> <span class="keywordflow">if</span> (filter_manager_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> <span class="comment">// objective upper_bound_ is used to reduce the number of potential</span></div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> <span class="comment">// insertion candidates, specifically when filter_manager_ filters cost.</span></div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> <span class="comment">// Rationale: the best cost candidate will always be valid and will be</span></div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> <span class="comment">// inserted so no use accepting degrading ones. However when a candidate</span></div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> <span class="comment">// is committed, the upper bound is relaxed to make sure further</span></div>
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> <span class="comment">// (cost-degrading) insertions will be accepted</span></div>
|
|
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> <span class="comment">// (cf. SynchronizeFilters()).</span></div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> <a class="code hl_define" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(filter_manager_-><a class="code hl_function" href="classoperations__research_1_1_local_search_filter_manager.html#a16e0093badb54c2c26a272d6f245155e">GetAcceptedObjectiveValue</a>(),</div>
|
|
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> objective_upper_bound_);</div>
|
|
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> objective_upper_bound_ = filter_manager_-><a class="code hl_function" href="classoperations__research_1_1_local_search_filter_manager.html#a16e0093badb54c2c26a272d6f245155e">GetAcceptedObjectiveValue</a>();</div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> }</div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> <span class="keywordflow">if</span> (commit) {</div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_assignment_container.html">Assignment::IntContainer</a>& delta_container =</div>
|
|
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> delta_-><a class="code hl_function" href="classoperations__research_1_1_assignment.html#aedb0ae1cf8c3e89218604e5c039d6c7b">IntVarContainer</a>();</div>
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> <span class="keyword">const</span> <span class="keywordtype">int</span> delta_size = delta_container.<a class="code hl_function" href="classoperations__research_1_1_assignment_container.html#a24926108b770033792d015cb86aeffb3">Size</a>();</div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> <a class="code hl_class" href="classoperations__research_1_1_assignment_container.html">Assignment::IntContainer</a>* <span class="keyword">const</span> container =</div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> <a class="code hl_variable" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a6743122cc2fc4818b402ba3d484c6ea4">assignment_</a>-><a class="code hl_function" href="classoperations__research_1_1_assignment.html#ac76f6d6854dc981871832c7714c4a4bb">MutableIntVarContainer</a>();</div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < delta_size; ++i) {</div>
|
|
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_int_var_element.html">IntVarElement</a>& delta_element = delta_container.<a class="code hl_function" href="classoperations__research_1_1_assignment_container.html#a574bbe757dd231a59843422be3145dee">Element</a>(i);</div>
|
|
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span> <a class="code hl_class" href="classoperations__research_1_1_int_var.html">IntVar</a>* <span class="keyword">const</span> <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = delta_element.<a class="code hl_function" href="classoperations__research_1_1_int_var_element.html#ad197164b669d8b5d35fc497754791e39">Var</a>();</div>
|
|
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, vars_[delta_indices_[i]]);</div>
|
|
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span> container-><a class="code hl_function" href="classoperations__research_1_1_assignment_container.html#a662646ce0309b7580051cdeb4f8a4d5a">AddAtPosition</a>(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, delta_indices_[i])</div>
|
|
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> -><a class="code hl_function" href="classoperations__research_1_1_int_var_element.html#ac1b2a58bfded95799de1fd7958bdb2a3">SetValue</a>(delta_element.<a class="code hl_function" href="classoperations__research_1_1_int_var_element.html#a15828fe5ecfdada586a63d916b7b7354">Value</a>());</div>
|
|
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> }</div>
|
|
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a8447b106d07db2466b60e534964730d3">SynchronizeFilters</a>();</div>
|
|
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> }</div>
|
|
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> ++number_of_rejects_;</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="comment">// Reset is_in_delta to all false.</span></div>
|
|
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> delta_index : delta_indices_) {</div>
|
|
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> is_in_delta_[delta_index] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> }</div>
|
|
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> delta_-><a class="code hl_function" href="classoperations__research_1_1_assignment.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
|
|
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> delta_indices_.clear();</div>
|
|
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> <span class="keywordflow">return</span> accept ? std::optional<int64_t>{objective_upper_bound_} : std::nullopt;</div>
|
|
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span>}</div>
|
|
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> </div>
|
|
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a8447b106d07db2466b60e534964730d3"> 350</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a8447b106d07db2466b60e534964730d3">IntVarFilteredHeuristic::SynchronizeFilters</a>() {</div>
|
|
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> <span class="keywordflow">if</span> (filter_manager_) filter_manager_-><a class="code hl_function" href="classoperations__research_1_1_local_search_filter_manager.html#ae90693395653f673140e7bee51daf656">Synchronize</a>(<a class="code hl_variable" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a6743122cc2fc4818b402ba3d484c6ea4">assignment_</a>, delta_);</div>
|
|
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> <span class="comment">// Resetting the upper bound to allow cost-increasing insertions.</span></div>
|
|
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> objective_upper_bound_ = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span>}</div>
|
|
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> </div>
|
|
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span><span class="keywordtype">bool</span> IntVarFilteredHeuristic::FilterAccept() {</div>
|
|
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> <span class="keywordflow">if</span> (!filter_manager_) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_monitor.html">LocalSearchMonitor</a>* <span class="keyword">const</span> monitor = solver_-><a class="code hl_function" href="classoperations__research_1_1_solver.html#a869f7ed2cc6505c59ecf1eb8ecb2288a">GetLocalSearchMonitor</a>();</div>
|
|
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> <span class="keywordflow">return</span> filter_manager_-><a class="code hl_function" href="classoperations__research_1_1_local_search_filter_manager.html#a712060303eea0e26ca9a072b57bbf227">Accept</a>(monitor, delta_, empty_,</div>
|
|
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>(),</div>
|
|
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> objective_upper_bound_);</div>
|
|
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span>}</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><span class="comment">// RoutingFilteredHeuristic</span></div>
|
|
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> </div>
|
|
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_filtered_heuristic.html#a93aa105d700ad23091b6f3f55d48a2c1"> 366</a></span><a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a93aa105d700ad23091b6f3f55d48a2c1">RoutingFilteredHeuristic::RoutingFilteredHeuristic</a>(</div>
|
|
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager,</div>
|
|
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> <span class="keywordtype">bool</span> omit_secondary_vars)</div>
|
|
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> : <a class="code hl_class" href="classoperations__research_1_1_int_var_filtered_heuristic.html">IntVarFilteredHeuristic</a>(</div>
|
|
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->solver(), <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Nexts(),</div>
|
|
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> omit_secondary_vars || <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->CostsAreHomogeneousAcrossVehicles()</div>
|
|
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> ? <a class="code hl_namespace" href="namespacestd.html">std</a>::vector<<a class="code hl_class" href="classoperations__research_1_1_int_var.html">IntVar</a>*>()</div>
|
|
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> : <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->VehicleVars(),</div>
|
|
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> filter_manager),</div>
|
|
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> model_(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {}</div>
|
|
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> </div>
|
|
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span><span class="keywordtype">bool</span> RoutingFilteredHeuristic::InitializeSolution() {</div>
|
|
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a7ae7a2033e2a22ad1dedbf2f3ec8745f">ResetSolution</a>();</div>
|
|
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#aafb639a547b12967feeefae66a3d3276">ResetVehicleIndices</a>();</div>
|
|
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span> <span class="comment">// Find the chains of nodes (when nodes have their "Next" value bound in the</span></div>
|
|
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span> <span class="comment">// current solution, it forms a link in a chain). Eventually, starts[end]</span></div>
|
|
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> <span class="comment">// will contain the index of the first node of the chain ending at node 'end'</span></div>
|
|
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span> <span class="comment">// and ends[start] will be the last node of the chain starting at node</span></div>
|
|
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span> <span class="comment">// 'start'. Values of starts[node] and ends[node] for other nodes is used</span></div>
|
|
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span> <span class="comment">// for intermediary computations and do not necessarily reflect actual chain</span></div>
|
|
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span> <span class="comment">// starts and ends.</span></div>
|
|
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> </div>
|
|
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> <span class="comment">// Start by adding partial start chains to current assignment.</span></div>
|
|
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span> start_chain_ends_.resize(<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->vehicles());</div>
|
|
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> end_chain_starts_.resize(<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->vehicles());</div>
|
|
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> </div>
|
|
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#aafb639a547b12967feeefae66a3d3276">ResetVehicleIndices</a>();</div>
|
|
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">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="l00394" name="l00394"></a><span class="lineno"> 394</span> int64_t node = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(vehicle);</div>
|
|
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> <span class="keywordflow">while</span> (!<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->IsEnd(node) && <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#abd977c8d4bb6eae7fd1037091282050f">Var</a>(node)->Bound()) {</div>
|
|
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</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_int_var_filtered_heuristic.html#abd977c8d4bb6eae7fd1037091282050f">Var</a>(node)-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#a62b340f6d1dde6a36560bd88a382ada7">Min</a>();</div>
|
|
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(node, <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a9d72d8f26ae6d9340f48eb0340c264d1">HasSecondaryVars</a>()) {</div>
|
|
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0d549adeef4a45d3078daf3d7918b253">SecondaryVarIndex</a>(node), vehicle);</div>
|
|
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span> }</div>
|
|
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a7cccc6ea4b6f89355769bc0de4548f1d">SetVehicleIndex</a>(node, vehicle);</div>
|
|
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span> node = <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span> }</div>
|
|
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span> start_chain_ends_[vehicle] = node;</div>
|
|
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> }</div>
|
|
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span> </div>
|
|
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span> std::vector<int64_t> starts(<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>() + <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->vehicles(), -1);</div>
|
|
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span> std::vector<int64_t> ends(<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>() + <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->vehicles(), -1);</div>
|
|
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>() + <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); ++node) {</div>
|
|
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span> <span class="comment">// Each node starts as a singleton chain.</span></div>
|
|
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span> starts[node] = node;</div>
|
|
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> ends[node] = node;</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> std::vector<bool> touched(<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"> 415</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>(); ++node) {</div>
|
|
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span> <span class="keywordtype">int</span> current = node;</div>
|
|
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span> <span class="keywordflow">while</span> (!<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#acf67dc202e247ce193038850f71306d3">IsEnd</a>(current) && !touched[current]) {</div>
|
|
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno"> 418</span> touched[current] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"> 419</span> IntVar* <span class="keyword">const</span> next_var = <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#abd977c8d4bb6eae7fd1037091282050f">Var</a>(current);</div>
|
|
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span> <span class="keywordflow">if</span> (next_var->Bound()) {</div>
|
|
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</span> current = next_var->Value();</div>
|
|
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno"> 422</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="comment">// Merge the sub-chain starting from 'node' and ending at 'current' with</span></div>
|
|
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno"> 425</span> <span class="comment">// the existing sub-chain starting at 'current'.</span></div>
|
|
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno"> 426</span> starts[ends[current]] = starts[node];</div>
|
|
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno"> 427</span> ends[starts[node]] = ends[current];</div>
|
|
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno"> 428</span> }</div>
|
|
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> </div>
|
|
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> <span class="comment">// Set each route to be the concatenation of the chain at its start and the</span></div>
|
|
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> <span class="comment">// chain at its end, without nodes in between.</span></div>
|
|
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">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="l00433" name="l00433"></a><span class="lineno"> 433</span> end_chain_starts_[vehicle] = starts[<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#afb80fd36c1fb57d2db049403483e2074">End</a>(vehicle)];</div>
|
|
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> int64_t node = start_chain_ends_[vehicle];</div>
|
|
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->IsEnd(node)) {</div>
|
|
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno"> 436</span> int64_t <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = starts[<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#afb80fd36c1fb57d2db049403483e2074">End</a>(vehicle)];</div>
|
|
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno"> 437</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(node, <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno"> 438</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a9d72d8f26ae6d9340f48eb0340c264d1">HasSecondaryVars</a>()) {</div>
|
|
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno"> 439</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0d549adeef4a45d3078daf3d7918b253">SecondaryVarIndex</a>(node), vehicle);</div>
|
|
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno"> 440</span> }</div>
|
|
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno"> 441</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a7cccc6ea4b6f89355769bc0de4548f1d">SetVehicleIndex</a>(node, vehicle);</div>
|
|
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno"> 442</span> node = <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno"> 443</span> <span class="keywordflow">while</span> (!<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->IsEnd(node)) {</div>
|
|
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"> 444</span> <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#abd977c8d4bb6eae7fd1037091282050f">Var</a>(node)-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#a62b340f6d1dde6a36560bd88a382ada7">Min</a>();</div>
|
|
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"> 445</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(node, <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"> 446</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a9d72d8f26ae6d9340f48eb0340c264d1">HasSecondaryVars</a>()) {</div>
|
|
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno"> 447</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0d549adeef4a45d3078daf3d7918b253">SecondaryVarIndex</a>(node), vehicle);</div>
|
|
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno"> 448</span> }</div>
|
|
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno"> 449</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a7cccc6ea4b6f89355769bc0de4548f1d">SetVehicleIndex</a>(node, vehicle);</div>
|
|
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno"> 450</span> node = <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno"> 451</span> }</div>
|
|
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno"> 452</span> }</div>
|
|
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno"> 453</span> }</div>
|
|
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno"> 454</span> </div>
|
|
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno"> 455</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value()) {</div>
|
|
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno"> 456</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#aafb639a547b12967feeefae66a3d3276">ResetVehicleIndices</a>();</div>
|
|
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"> 457</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"> 458</span> }</div>
|
|
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno"> 459</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"> 460</span>}</div>
|
|
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno"> 461</span> </div>
|
|
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_filtered_heuristic.html#a954a436d9a6c975e9d88f2ec659bb090"> 462</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a954a436d9a6c975e9d88f2ec659bb090">RoutingFilteredHeuristic::MakeDisjunctionNodesUnperformed</a>(int64_t node) {</div>
|
|
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a14ddf0a3cc644cd510603b1cd84e08be">ForEachNodeInDisjunctionWithMaxCardinalityFromIndex</a>(</div>
|
|
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno"> 464</span> node, 1, [<span class="keyword">this</span>, node](<span class="keywordtype">int</span> alternate) {</div>
|
|
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span> <span class="keywordflow">if</span> (node != alternate && !<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(alternate)) {</div>
|
|
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(alternate, alternate);</div>
|
|
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span> }</div>
|
|
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span> });</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> </div>
|
|
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_filtered_heuristic.html#a97049801609b8cb68c0428970f916fd4"> 471</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a97049801609b8cb68c0428970f916fd4">RoutingFilteredHeuristic::MakeUnassignedNodesUnperformed</a>() {</div>
|
|
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno"> 472</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a> = 0; <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a> < model_-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">Size</a>(); ++<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>) {</div>
|
|
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno"> 473</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#addc62ce828c9c5ebdf398492bcd04495">IsSecondaryVar</a>(<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>));</div>
|
|
<div class="line"><a id="l00474" name="l00474"></a><span class="lineno"> 474</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>)) {</div>
|
|
<div class="line"><a id="l00475" name="l00475"></a><span class="lineno"> 475</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>, <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>);</div>
|
|
<div class="line"><a id="l00476" name="l00476"></a><span class="lineno"> 476</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a9d72d8f26ae6d9340f48eb0340c264d1">HasSecondaryVars</a>()) {</div>
|
|
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno"> 477</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0d549adeef4a45d3078daf3d7918b253">SecondaryVarIndex</a>(<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>), -1);</div>
|
|
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno"> 478</span> }</div>
|
|
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno"> 479</span> }</div>
|
|
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno"> 480</span> }</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_routing_filtered_heuristic.html#abaca104cf41b5a5e3554f8ad72cdc28c"> 483</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#abaca104cf41b5a5e3554f8ad72cdc28c">RoutingFilteredHeuristic::MakePartiallyPerformedPairsUnperformed</a>() {</div>
|
|
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno"> 484</span> std::vector<bool> to_make_unperformed(<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno"> 485</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& [pickups, deliveries] :</div>
|
|
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno"> 486</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->GetPickupAndDeliveryPairs()) {</div>
|
|
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno"> 487</span> int64_t performed_pickup = -1;</div>
|
|
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno"> 488</span> <span class="keywordflow">for</span> (int64_t pickup : pickups) {</div>
|
|
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno"> 489</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(pickup) && <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(pickup) != pickup) {</div>
|
|
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno"> 490</span> performed_pickup = pickup;</div>
|
|
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno"> 491</span> <span class="keywordflow">break</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"> 493</span> }</div>
|
|
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno"> 494</span> int64_t performed_delivery = -1;</div>
|
|
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno"> 495</span> <span class="keywordflow">for</span> (int64_t delivery : deliveries) {</div>
|
|
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno"> 496</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(delivery) && <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(delivery) != delivery) {</div>
|
|
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno"> 497</span> performed_delivery = delivery;</div>
|
|
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"> 498</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno"> 499</span> }</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> <span class="keywordflow">if</span> ((performed_pickup == -1) != (performed_delivery == -1)) {</div>
|
|
<div class="line"><a id="l00502" name="l00502"></a><span class="lineno"> 502</span> <span class="keywordflow">if</span> (performed_pickup != -1) {</div>
|
|
<div class="line"><a id="l00503" name="l00503"></a><span class="lineno"> 503</span> to_make_unperformed[performed_pickup] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno"> 504</span> }</div>
|
|
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno"> 505</span> <span class="keywordflow">if</span> (performed_delivery != -1) {</div>
|
|
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno"> 506</span> to_make_unperformed[performed_delivery] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00507" name="l00507"></a><span class="lineno"> 507</span> }</div>
|
|
<div class="line"><a id="l00508" name="l00508"></a><span class="lineno"> 508</span> }</div>
|
|
<div class="line"><a id="l00509" name="l00509"></a><span class="lineno"> 509</span> }</div>
|
|
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno"> 510</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a> = 0; <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a> < <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>(); ++<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>) {</div>
|
|
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno"> 511</span> <span class="keywordflow">if</span> (to_make_unperformed[<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>] || !<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00512" name="l00512"></a><span class="lineno"> 512</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_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>);</div>
|
|
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno"> 513</span> <span class="keywordflow">while</span> (<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> < <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>() && to_make_unperformed[<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>]) {</div>
|
|
<div class="line"><a id="l00514" name="l00514"></a><span class="lineno"> 514</span> <span class="keyword">const</span> int64_t next_of_next = <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a id="l00515" name="l00515"></a><span class="lineno"> 515</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>, next_of_next);</div>
|
|
<div class="line"><a id="l00516" name="l00516"></a><span class="lineno"> 516</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a id="l00517" name="l00517"></a><span class="lineno"> 517</span> <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = next_of_next;</div>
|
|
<div class="line"><a id="l00518" name="l00518"></a><span class="lineno"> 518</span> }</div>
|
|
<div class="line"><a id="l00519" name="l00519"></a><span class="lineno"> 519</span> }</div>
|
|
<div class="line"><a id="l00520" name="l00520"></a><span class="lineno"> 520</span>}</div>
|
|
<div class="line"><a id="l00521" name="l00521"></a><span class="lineno"> 521</span> </div>
|
|
<div class="line"><a id="l00522" name="l00522"></a><span class="lineno"> 522</span><span class="comment">// CheapestInsertionFilteredHeuristic</span></div>
|
|
<div class="line"><a id="l00523" name="l00523"></a><span class="lineno"> 523</span> </div>
|
|
<div class="line"><a id="l00524" name="l00524"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ac06fb0f5750600ea6fd0cba641f5e35f"> 524</a></span><a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ac06fb0f5750600ea6fd0cba641f5e35f">CheapestInsertionFilteredHeuristic::CheapestInsertionFilteredHeuristic</a>(</div>
|
|
<div class="line"><a id="l00525" name="l00525"></a><span class="lineno"> 525</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div>
|
|
<div class="line"><a id="l00526" name="l00526"></a><span class="lineno"> 526</span> std::function<int64_t(int64_t, int64_t, int64_t)> evaluator,</div>
|
|
<div class="line"><a id="l00527" name="l00527"></a><span class="lineno"> 527</span> std::function<int64_t(int64_t)> penalty_evaluator,</div>
|
|
<div class="line"><a id="l00528" name="l00528"></a><span class="lineno"> 528</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager)</div>
|
|
<div class="line"><a id="l00529" name="l00529"></a><span class="lineno"> 529</span> : <a class="code hl_class" href="classoperations__research_1_1_routing_filtered_heuristic.html">RoutingFilteredHeuristic</a>(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, filter_manager,</div>
|
|
<div class="line"><a id="l00530" name="l00530"></a><span class="lineno"> 530</span> <span class="comment">/*omit_secondary_vars=*/</span>evaluator != nullptr),</div>
|
|
<div class="line"><a id="l00531" name="l00531"></a><span class="lineno"> 531</span> <a class="code hl_variable" href="search_8cc.html#ab8e7cdbcc8db4792b2ca9b8d4f5b0772">evaluator_</a>(<a class="code hl_namespace" href="namespacestd.html">std</a>::move(evaluator)),</div>
|
|
<div class="line"><a id="l00532" name="l00532"></a><span class="lineno"> 532</span> penalty_evaluator_(<a class="code hl_namespace" href="namespacestd.html">std</a>::move(penalty_evaluator)) {}</div>
|
|
<div class="line"><a id="l00533" name="l00533"></a><span class="lineno"> 533</span> </div>
|
|
<div class="line"><a id="l00534" name="l00534"></a><span class="lineno"> 534</span>std::vector<std::vector<CheapestInsertionFilteredHeuristic::StartEndValue>></div>
|
|
<div class="line"><a id="l00535" name="l00535"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a356517cd51c4b6259d7f439718719eaa"> 535</a></span><a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a356517cd51c4b6259d7f439718719eaa">CheapestInsertionFilteredHeuristic::ComputeStartEndDistanceForVehicles</a>(</div>
|
|
<div class="line"><a id="l00536" name="l00536"></a><span class="lineno"> 536</span> <span class="keyword">const</span> std::vector<int>& vehicles) {</div>
|
|
<div class="line"><a id="l00537" name="l00537"></a><span class="lineno"> 537</span> <span class="keyword">const</span> absl::flat_hash_set<int> vehicle_set(vehicles.begin(), vehicles.end());</div>
|
|
<div class="line"><a id="l00538" name="l00538"></a><span class="lineno"> 538</span> std::vector<std::vector<StartEndValue>> start_end_distances_per_node(</div>
|
|
<div class="line"><a id="l00539" name="l00539"></a><span class="lineno"> 539</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>());</div>
|
|
<div class="line"><a id="l00540" name="l00540"></a><span class="lineno"> 540</span> </div>
|
|
<div class="line"><a id="l00541" name="l00541"></a><span class="lineno"> 541</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">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="l00542" name="l00542"></a><span class="lineno"> 542</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(node)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00543" name="l00543"></a><span class="lineno"> 543</span> std::vector<StartEndValue>& start_end_distances =</div>
|
|
<div class="line"><a id="l00544" name="l00544"></a><span class="lineno"> 544</span> start_end_distances_per_node[node];</div>
|
|
<div class="line"><a id="l00545" name="l00545"></a><span class="lineno"> 545</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_int_var.html">IntVar</a>* <span class="keyword">const</span> vehicle_var = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a43c00b1c44d7f5bec9287ce60fadef52">VehicleVar</a>(node);</div>
|
|
<div class="line"><a id="l00546" name="l00546"></a><span class="lineno"> 546</span> <span class="keyword">const</span> int64_t num_allowed_vehicles = vehicle_var-><a class="code hl_function" href="classoperations__research_1_1_int_var.html#af8625719d57e4a61b5aa251d99762966">Size</a>();</div>
|
|
<div class="line"><a id="l00547" name="l00547"></a><span class="lineno"> 547</span> </div>
|
|
<div class="line"><a id="l00548" name="l00548"></a><span class="lineno"> 548</span> <span class="keyword">const</span> <span class="keyword">auto</span> add_distance = [<span class="keyword">this</span>, node, num_allowed_vehicles,</div>
|
|
<div class="line"><a id="l00549" name="l00549"></a><span class="lineno"> 549</span> &start_end_distances](<span class="keywordtype">int</span> vehicle) {</div>
|
|
<div class="line"><a id="l00550" name="l00550"></a><span class="lineno"> 550</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a> = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(vehicle);</div>
|
|
<div class="line"><a id="l00551" name="l00551"></a><span class="lineno"> 551</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a> = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#afb80fd36c1fb57d2db049403483e2074">End</a>(vehicle);</div>
|
|
<div class="line"><a id="l00552" name="l00552"></a><span class="lineno"> 552</span> </div>
|
|
<div class="line"><a id="l00553" name="l00553"></a><span class="lineno"> 553</span> <span class="comment">// We compute the distance of node to the start/end nodes of the route.</span></div>
|
|
<div class="line"><a id="l00554" name="l00554"></a><span class="lineno"> 554</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="routing__search_8cc.html#a79b8e036dca6911e3295a47d99f21f43">distance</a> =</div>
|
|
<div class="line"><a id="l00555" name="l00555"></a><span class="lineno"> 555</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->GetArcCostForVehicle(<a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>, node, vehicle),</div>
|
|
<div class="line"><a id="l00556" name="l00556"></a><span class="lineno"> 556</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->GetArcCostForVehicle(node, <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>, vehicle));</div>
|
|
<div class="line"><a id="l00557" name="l00557"></a><span class="lineno"> 557</span> start_end_distances.push_back({num_allowed_vehicles, <a class="code hl_variable" href="routing__search_8cc.html#a79b8e036dca6911e3295a47d99f21f43">distance</a>, vehicle});</div>
|
|
<div class="line"><a id="l00558" name="l00558"></a><span class="lineno"> 558</span> };</div>
|
|
<div class="line"><a id="l00559" name="l00559"></a><span class="lineno"> 559</span> <span class="comment">// Iterating over an IntVar domain is faster than calling Contains.</span></div>
|
|
<div class="line"><a id="l00560" name="l00560"></a><span class="lineno"> 560</span> <span class="comment">// Therefore we iterate on 'vehicles' only if it's smaller than the domain</span></div>
|
|
<div class="line"><a id="l00561" name="l00561"></a><span class="lineno"> 561</span> <span class="comment">// size of the VehicleVar.</span></div>
|
|
<div class="line"><a id="l00562" name="l00562"></a><span class="lineno"> 562</span> <span class="keywordflow">if</span> (num_allowed_vehicles < vehicles.size()) {</div>
|
|
<div class="line"><a id="l00563" name="l00563"></a><span class="lineno"> 563</span> std::unique_ptr<IntVarIterator> it(</div>
|
|
<div class="line"><a id="l00564" name="l00564"></a><span class="lineno"> 564</span> vehicle_var-><a class="code hl_function" href="classoperations__research_1_1_int_var.html#affdd564449bc36ce5db44cfc1c9e86d4">MakeDomainIterator</a>(<span class="keyword">false</span>));</div>
|
|
<div class="line"><a id="l00565" name="l00565"></a><span class="lineno"> 565</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t vehicle : <a class="code hl_class" href="classoperations__research_1_1_init_and_get_values.html">InitAndGetValues</a>(it.get())) {</div>
|
|
<div class="line"><a id="l00566" name="l00566"></a><span class="lineno"> 566</span> <span class="keywordflow">if</span> (vehicle < 0 || !vehicle_set.contains(vehicle)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00567" name="l00567"></a><span class="lineno"> 567</span> add_distance(vehicle);</div>
|
|
<div class="line"><a id="l00568" name="l00568"></a><span class="lineno"> 568</span> }</div>
|
|
<div class="line"><a id="l00569" name="l00569"></a><span class="lineno"> 569</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00570" name="l00570"></a><span class="lineno"> 570</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> vehicle : vehicles) {</div>
|
|
<div class="line"><a id="l00571" name="l00571"></a><span class="lineno"> 571</span> <span class="keywordflow">if</span> (!vehicle_var-><a class="code hl_function" href="classoperations__research_1_1_int_var.html#a0723abf37f7a5a8a604fd1bcd96a7be0">Contains</a>(vehicle)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00572" name="l00572"></a><span class="lineno"> 572</span> add_distance(vehicle);</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> }</div>
|
|
<div class="line"><a id="l00575" name="l00575"></a><span class="lineno"> 575</span> <span class="comment">// Sort the distances for the node to all start/ends of available vehicles</span></div>
|
|
<div class="line"><a id="l00576" name="l00576"></a><span class="lineno"> 576</span> <span class="comment">// in decreasing order.</span></div>
|
|
<div class="line"><a id="l00577" name="l00577"></a><span class="lineno"> 577</span> std::sort(start_end_distances.begin(), start_end_distances.end(),</div>
|
|
<div class="line"><a id="l00578" name="l00578"></a><span class="lineno"> 578</span> [](<span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html">StartEndValue</a>& first, <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html">StartEndValue</a>& second) {</div>
|
|
<div class="line"><a id="l00579" name="l00579"></a><span class="lineno"> 579</span> return second < first;</div>
|
|
<div class="line"><a id="l00580" name="l00580"></a><span class="lineno"> 580</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> <span class="keywordflow">return</span> start_end_distances_per_node;</div>
|
|
<div class="line"><a id="l00583" name="l00583"></a><span class="lineno"> 583</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><span class="keyword">template</span> <<span class="keyword">class</span> Queue></div>
|
|
<div class="line"><a id="l00586" name="l00586"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a69d38e86eb8fc2fa4df0d8839c8dd5a9"> 586</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a69d38e86eb8fc2fa4df0d8839c8dd5a9">CheapestInsertionFilteredHeuristic::InitializePriorityQueue</a>(</div>
|
|
<div class="line"><a id="l00587" name="l00587"></a><span class="lineno"> 587</span> std::vector<std::vector<StartEndValue>>* start_end_distances_per_node,</div>
|
|
<div class="line"><a id="l00588" name="l00588"></a><span class="lineno"> 588</span> <a class="code hl_class" href="classoperations__research_1_1_queue.html">Queue</a>* priority_queue) {</div>
|
|
<div class="line"><a id="l00589" name="l00589"></a><span class="lineno"> 589</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_nodes = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">Size</a>();</div>
|
|
<div class="line"><a id="l00590" name="l00590"></a><span class="lineno"> 590</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(start_end_distances_per_node->size(), num_nodes);</div>
|
|
<div class="line"><a id="l00591" name="l00591"></a><span class="lineno"> 591</span> </div>
|
|
<div class="line"><a id="l00592" name="l00592"></a><span class="lineno"> 592</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < num_nodes; node++) {</div>
|
|
<div class="line"><a id="l00593" name="l00593"></a><span class="lineno"> 593</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(node)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00594" name="l00594"></a><span class="lineno"> 594</span> std::vector<StartEndValue>& start_end_distances =</div>
|
|
<div class="line"><a id="l00595" name="l00595"></a><span class="lineno"> 595</span> (*start_end_distances_per_node)[node];</div>
|
|
<div class="line"><a id="l00596" name="l00596"></a><span class="lineno"> 596</span> <span class="keywordflow">if</span> (start_end_distances.empty()) {</div>
|
|
<div class="line"><a id="l00597" name="l00597"></a><span class="lineno"> 597</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00598" name="l00598"></a><span class="lineno"> 598</span> }</div>
|
|
<div class="line"><a id="l00599" name="l00599"></a><span class="lineno"> 599</span> <span class="comment">// Put the best StartEndValue for this node in the priority queue.</span></div>
|
|
<div class="line"><a id="l00600" name="l00600"></a><span class="lineno"> 600</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html">StartEndValue</a>& start_end_value = start_end_distances.back();</div>
|
|
<div class="line"><a id="l00601" name="l00601"></a><span class="lineno"> 601</span> priority_queue->push(std::make_pair(start_end_value, node));</div>
|
|
<div class="line"><a id="l00602" name="l00602"></a><span class="lineno"> 602</span> start_end_distances.pop_back();</div>
|
|
<div class="line"><a id="l00603" name="l00603"></a><span class="lineno"> 603</span> }</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"><a class="line" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#add2710777ca3960d37c6257cd95edfee"> 606</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#add2710777ca3960d37c6257cd95edfee">CheapestInsertionFilteredHeuristic::InsertBetween</a>(int64_t node,</div>
|
|
<div class="line"><a id="l00607" name="l00607"></a><span class="lineno"> 607</span> int64_t predecessor,</div>
|
|
<div class="line"><a id="l00608" name="l00608"></a><span class="lineno"> 608</span> int64_t successor,</div>
|
|
<div class="line"><a id="l00609" name="l00609"></a><span class="lineno"> 609</span> <span class="keywordtype">int</span> vehicle) {</div>
|
|
<div class="line"><a id="l00610" name="l00610"></a><span class="lineno"> 610</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(predecessor, node);</div>
|
|
<div class="line"><a id="l00611" name="l00611"></a><span class="lineno"> 611</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(node, successor);</div>
|
|
<div class="line"><a id="l00612" name="l00612"></a><span class="lineno"> 612</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a954a436d9a6c975e9d88f2ec659bb090">MakeDisjunctionNodesUnperformed</a>(node);</div>
|
|
<div class="line"><a id="l00613" name="l00613"></a><span class="lineno"> 613</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a9d72d8f26ae6d9340f48eb0340c264d1">HasSecondaryVars</a>() && vehicle != -1) {</div>
|
|
<div class="line"><a id="l00614" name="l00614"></a><span class="lineno"> 614</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0d549adeef4a45d3078daf3d7918b253">SecondaryVarIndex</a>(predecessor), vehicle);</div>
|
|
<div class="line"><a id="l00615" name="l00615"></a><span class="lineno"> 615</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0d549adeef4a45d3078daf3d7918b253">SecondaryVarIndex</a>(node), vehicle);</div>
|
|
<div class="line"><a id="l00616" name="l00616"></a><span class="lineno"> 616</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0d549adeef4a45d3078daf3d7918b253">SecondaryVarIndex</a>(successor), vehicle);</div>
|
|
<div class="line"><a id="l00617" name="l00617"></a><span class="lineno"> 617</span> }</div>
|
|
<div class="line"><a id="l00618" name="l00618"></a><span class="lineno"> 618</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"><a class="line" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ade9dca16a1e0dc26a1a8797874413fad"> 620</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ade9dca16a1e0dc26a1a8797874413fad">CheapestInsertionFilteredHeuristic::AppendInsertionPositionsAfter</a>(</div>
|
|
<div class="line"><a id="l00621" name="l00621"></a><span class="lineno"> 621</span> int64_t node_to_insert, int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>, int64_t next_after_start,</div>
|
|
<div class="line"><a id="l00622" name="l00622"></a><span class="lineno"> 622</span> <span class="keywordtype">int</span> vehicle, std::vector<NodeInsertion>* node_insertions) {</div>
|
|
<div class="line"><a id="l00623" name="l00623"></a><span class="lineno"> 623</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(node_insertions != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00624" name="l00624"></a><span class="lineno"> 624</span> int64_t insert_after = <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>;</div>
|
|
<div class="line"><a id="l00625" name="l00625"></a><span class="lineno"> 625</span> <span class="keywordflow">while</span> (!<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->IsEnd(insert_after)) {</div>
|
|
<div class="line"><a id="l00626" name="l00626"></a><span class="lineno"> 626</span> <span class="keyword">const</span> int64_t insert_before =</div>
|
|
<div class="line"><a id="l00627" name="l00627"></a><span class="lineno"> 627</span> (insert_after == <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>) ? next_after_start : <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(insert_after);</div>
|
|
<div class="line"><a id="l00628" name="l00628"></a><span class="lineno"> 628</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a4c042f054da687c4a586dc5d3dfaef10">evaluator_</a> == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l00629" name="l00629"></a><span class="lineno"> 629</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#add2710777ca3960d37c6257cd95edfee">InsertBetween</a>(node_to_insert, insert_after, insert_before, vehicle);</div>
|
|
<div class="line"><a id="l00630" name="l00630"></a><span class="lineno"> 630</span> std::optional<int64_t> insertion_cost = <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00631" name="l00631"></a><span class="lineno"> 631</span> <span class="keywordflow">if</span> (insertion_cost.has_value()) {</div>
|
|
<div class="line"><a id="l00632" name="l00632"></a><span class="lineno"> 632</span> node_insertions->push_back({insert_after, vehicle, *insertion_cost});</div>
|
|
<div class="line"><a id="l00633" name="l00633"></a><span class="lineno"> 633</span> }</div>
|
|
<div class="line"><a id="l00634" name="l00634"></a><span class="lineno"> 634</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00635" name="l00635"></a><span class="lineno"> 635</span> node_insertions->push_back(</div>
|
|
<div class="line"><a id="l00636" name="l00636"></a><span class="lineno"> 636</span> {insert_after, vehicle,</div>
|
|
<div class="line"><a id="l00637" name="l00637"></a><span class="lineno"> 637</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a750200f78e5b4a8192dc7ad3b6b10eec">GetInsertionCostForNodeAtPosition</a>(node_to_insert, insert_after,</div>
|
|
<div class="line"><a id="l00638" name="l00638"></a><span class="lineno"> 638</span> insert_before, vehicle)});</div>
|
|
<div class="line"><a id="l00639" name="l00639"></a><span class="lineno"> 639</span> }</div>
|
|
<div class="line"><a id="l00640" name="l00640"></a><span class="lineno"> 640</span> insert_after = insert_before;</div>
|
|
<div class="line"><a id="l00641" name="l00641"></a><span class="lineno"> 641</span> }</div>
|
|
<div class="line"><a id="l00642" name="l00642"></a><span class="lineno"> 642</span>}</div>
|
|
<div class="line"><a id="l00643" name="l00643"></a><span class="lineno"> 643</span> </div>
|
|
<div class="line"><a id="l00644" name="l00644"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a750200f78e5b4a8192dc7ad3b6b10eec"> 644</a></span>int64_t <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a750200f78e5b4a8192dc7ad3b6b10eec">CheapestInsertionFilteredHeuristic::GetInsertionCostForNodeAtPosition</a>(</div>
|
|
<div class="line"><a id="l00645" name="l00645"></a><span class="lineno"> 645</span> int64_t node_to_insert, int64_t insert_after, int64_t insert_before,</div>
|
|
<div class="line"><a id="l00646" name="l00646"></a><span class="lineno"> 646</span> <span class="keywordtype">int</span> vehicle)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00647" name="l00647"></a><span class="lineno"> 647</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code hl_variable" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a4c042f054da687c4a586dc5d3dfaef10">evaluator_</a> != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00648" name="l00648"></a><span class="lineno"> 648</span> <span class="keywordflow">return</span> <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(<a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code hl_variable" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a4c042f054da687c4a586dc5d3dfaef10">evaluator_</a>(insert_after, node_to_insert, vehicle),</div>
|
|
<div class="line"><a id="l00649" name="l00649"></a><span class="lineno"> 649</span> <a class="code hl_variable" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a4c042f054da687c4a586dc5d3dfaef10">evaluator_</a>(node_to_insert, insert_before, vehicle)),</div>
|
|
<div class="line"><a id="l00650" name="l00650"></a><span class="lineno"> 650</span> <a class="code hl_variable" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a4c042f054da687c4a586dc5d3dfaef10">evaluator_</a>(insert_after, insert_before, vehicle));</div>
|
|
<div class="line"><a id="l00651" name="l00651"></a><span class="lineno"> 651</span>}</div>
|
|
<div class="line"><a id="l00652" name="l00652"></a><span class="lineno"> 652</span> </div>
|
|
<div class="line"><a id="l00653" name="l00653"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#aab2e87c6b0d1adc11fef2b9a9ea8d5a6"> 653</a></span>int64_t <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#aab2e87c6b0d1adc11fef2b9a9ea8d5a6">CheapestInsertionFilteredHeuristic::GetUnperformedValue</a>(</div>
|
|
<div class="line"><a id="l00654" name="l00654"></a><span class="lineno"> 654</span> int64_t node_to_insert)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00655" name="l00655"></a><span class="lineno"> 655</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ab757210526cd08167062c3bf8cf63982">penalty_evaluator_</a> != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l00656" name="l00656"></a><span class="lineno"> 656</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ab757210526cd08167062c3bf8cf63982">penalty_evaluator_</a>(node_to_insert);</div>
|
|
<div class="line"><a id="l00657" name="l00657"></a><span class="lineno"> 657</span> }</div>
|
|
<div class="line"><a id="l00658" name="l00658"></a><span class="lineno"> 658</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a id="l00659" name="l00659"></a><span class="lineno"> 659</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><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l00662" name="l00662"></a><span class="lineno"> 662</span><span class="keyword">template</span> <<span class="keyword">class</span> T></div>
|
|
<div class="line"><a id="l00663" name="l00663"></a><span class="lineno"> 663</span><span class="keywordtype">void</span> SortAndExtractPairSeconds(std::vector<std::pair<int64_t, T>>* pairs,</div>
|
|
<div class="line"><a id="l00664" name="l00664"></a><span class="lineno"> 664</span> std::vector<T>* sorted_seconds) {</div>
|
|
<div class="line"><a id="l00665" name="l00665"></a><span class="lineno"> 665</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(pairs != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00666" name="l00666"></a><span class="lineno"> 666</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(sorted_seconds != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00667" name="l00667"></a><span class="lineno"> 667</span> std::sort(pairs->begin(), pairs->end());</div>
|
|
<div class="line"><a id="l00668" name="l00668"></a><span class="lineno"> 668</span> sorted_seconds->reserve(pairs->size());</div>
|
|
<div class="line"><a id="l00669" name="l00669"></a><span class="lineno"> 669</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> std::pair<int64_t, T>& p : *pairs) {</div>
|
|
<div class="line"><a id="l00670" name="l00670"></a><span class="lineno"> 670</span> sorted_seconds->push_back(p.second);</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">// namespace</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"> 675</span><span class="comment">// Priority queue entries used by global cheapest insertion heuristic.</span></div>
|
|
<div class="line"><a id="l00676" name="l00676"></a><span class="lineno"> 676</span> </div>
|
|
<div class="line"><a id="l00677" name="l00677"></a><span class="lineno"> 677</span><span class="comment">// Entry in priority queue containing the insertion positions of a node pair.</span></div>
|
|
<div class="line"><a id="l00678" name="l00678"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html"> 678</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html">GlobalCheapestInsertionFilteredHeuristic::PairEntry</a> {</div>
|
|
<div class="line"><a id="l00679" name="l00679"></a><span class="lineno"> 679</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00680" name="l00680"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a7d3d92c5f0049a565a9683bf2d5883a6"> 680</a></span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a7d3d92c5f0049a565a9683bf2d5883a6">PairEntry</a>(<span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#af73c9d66c39b338f5d4bf402664a6775">pickup_to_insert</a>, <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a8ce7a57de817af9900a5ce211fac39ec">pickup_insert_after</a>,</div>
|
|
<div class="line"><a id="l00681" name="l00681"></a><span class="lineno"> 681</span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#ac555a592bc8f46d40e664dc2c663eae6">delivery_to_insert</a>, <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#aab26acce6ace06adcdf9a2cb3a40b874">delivery_insert_after</a>, <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">vehicle</a>,</div>
|
|
<div class="line"><a id="l00682" name="l00682"></a><span class="lineno"> 682</span> int64_t bucket)</div>
|
|
<div class="line"><a id="l00683" name="l00683"></a><span class="lineno"> 683</span> : value_(<a class="code hl_namespace" href="namespacestd.html">std</a>::numeric_limits<int64_t>::<a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a>()),</div>
|
|
<div class="line"><a id="l00684" name="l00684"></a><span class="lineno"> 684</span> heap_index_(-1),</div>
|
|
<div class="line"><a id="l00685" name="l00685"></a><span class="lineno"> 685</span> pickup_to_insert_(<a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#af73c9d66c39b338f5d4bf402664a6775">pickup_to_insert</a>),</div>
|
|
<div class="line"><a id="l00686" name="l00686"></a><span class="lineno"> 686</span> pickup_insert_after_(<a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a8ce7a57de817af9900a5ce211fac39ec">pickup_insert_after</a>),</div>
|
|
<div class="line"><a id="l00687" name="l00687"></a><span class="lineno"> 687</span> delivery_to_insert_(<a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#ac555a592bc8f46d40e664dc2c663eae6">delivery_to_insert</a>),</div>
|
|
<div class="line"><a id="l00688" name="l00688"></a><span class="lineno"> 688</span> delivery_insert_after_(<a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#aab26acce6ace06adcdf9a2cb3a40b874">delivery_insert_after</a>),</div>
|
|
<div class="line"><a id="l00689" name="l00689"></a><span class="lineno"> 689</span> vehicle_(<a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">vehicle</a>),</div>
|
|
<div class="line"><a id="l00690" name="l00690"></a><span class="lineno"> 690</span> bucket_(bucket) {}</div>
|
|
<div class="line"><a id="l00691" name="l00691"></a><span class="lineno"> 691</span> <span class="comment">// Note: for compatibility reasons, comparator follows tie-breaking rules used</span></div>
|
|
<div class="line"><a id="l00692" name="l00692"></a><span class="lineno"> 692</span> <span class="comment">// in the first version of GlobalCheapestInsertion.</span></div>
|
|
<div class="line"><a id="l00693" name="l00693"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a0c50cfb15d402d295b87b81310c486c5"> 693</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a0c50cfb15d402d295b87b81310c486c5">operator<</a>(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html">PairEntry</a>& other)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00694" name="l00694"></a><span class="lineno"> 694</span> <span class="comment">// We give higher priority to insertions from lower buckets.</span></div>
|
|
<div class="line"><a id="l00695" name="l00695"></a><span class="lineno"> 695</span> <span class="keywordflow">if</span> (bucket_ != other.bucket_) {</div>
|
|
<div class="line"><a id="l00696" name="l00696"></a><span class="lineno"> 696</span> <span class="keywordflow">return</span> bucket_ > other.bucket_;</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">// We then compare by value, then we favor insertions (vehicle != -1).</span></div>
|
|
<div class="line"><a id="l00699" name="l00699"></a><span class="lineno"> 699</span> <span class="comment">// The rest of the tie-breaking is done with std::tie.</span></div>
|
|
<div class="line"><a id="l00700" name="l00700"></a><span class="lineno"> 700</span> <span class="keywordflow">if</span> (value_ != other.value_) {</div>
|
|
<div class="line"><a id="l00701" name="l00701"></a><span class="lineno"> 701</span> <span class="keywordflow">return</span> value_ > other.value_;</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> <span class="keywordflow">if</span> ((vehicle_ == -1) ^ (other.vehicle_ == -1)) {</div>
|
|
<div class="line"><a id="l00704" name="l00704"></a><span class="lineno"> 704</span> <span class="keywordflow">return</span> vehicle_ == -1;</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> <span class="keywordflow">return</span> std::tie(pickup_insert_after_, pickup_to_insert_,</div>
|
|
<div class="line"><a id="l00707" name="l00707"></a><span class="lineno"> 707</span> delivery_insert_after_, delivery_to_insert_, vehicle_) ></div>
|
|
<div class="line"><a id="l00708" name="l00708"></a><span class="lineno"> 708</span> std::tie(other.pickup_insert_after_, other.pickup_to_insert_,</div>
|
|
<div class="line"><a id="l00709" name="l00709"></a><span class="lineno"> 709</span> other.delivery_insert_after_, other.delivery_to_insert_,</div>
|
|
<div class="line"><a id="l00710" name="l00710"></a><span class="lineno"> 710</span> other.vehicle_);</div>
|
|
<div class="line"><a id="l00711" name="l00711"></a><span class="lineno"> 711</span> }</div>
|
|
<div class="line"><a id="l00712" name="l00712"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#ab87ca3233f48737b65fc2edb553575f9"> 712</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#ab87ca3233f48737b65fc2edb553575f9">SetHeapIndex</a>(<span class="keywordtype">int</span> h) { heap_index_ = h; }</div>
|
|
<div class="line"><a id="l00713" name="l00713"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a356efb311b542164bd4667883d0973bb"> 713</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a356efb311b542164bd4667883d0973bb">GetHeapIndex</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> heap_index_; }</div>
|
|
<div class="line"><a id="l00714" name="l00714"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#ae627561faf9239ac230cece97499aa62"> 714</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#ae627561faf9239ac230cece97499aa62">set_value</a>(int64_t <a class="code hl_variable" href="routing__search_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) { value_ = <a class="code hl_variable" href="routing__search_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>; }</div>
|
|
<div class="line"><a id="l00715" name="l00715"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#af73c9d66c39b338f5d4bf402664a6775"> 715</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#af73c9d66c39b338f5d4bf402664a6775">pickup_to_insert</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> pickup_to_insert_; }</div>
|
|
<div class="line"><a id="l00716" name="l00716"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a8ce7a57de817af9900a5ce211fac39ec"> 716</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a8ce7a57de817af9900a5ce211fac39ec">pickup_insert_after</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> pickup_insert_after_; }</div>
|
|
<div class="line"><a id="l00717" name="l00717"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#aa3ef697633fc4e2bfca732b37f4d6713"> 717</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#aa3ef697633fc4e2bfca732b37f4d6713">set_pickup_insert_after</a>(<span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a8ce7a57de817af9900a5ce211fac39ec">pickup_insert_after</a>) {</div>
|
|
<div class="line"><a id="l00718" name="l00718"></a><span class="lineno"> 718</span> pickup_insert_after_ = <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a8ce7a57de817af9900a5ce211fac39ec">pickup_insert_after</a>;</div>
|
|
<div class="line"><a id="l00719" name="l00719"></a><span class="lineno"> 719</span> }</div>
|
|
<div class="line"><a id="l00720" name="l00720"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#ac555a592bc8f46d40e664dc2c663eae6"> 720</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#ac555a592bc8f46d40e664dc2c663eae6">delivery_to_insert</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> delivery_to_insert_; }</div>
|
|
<div class="line"><a id="l00721" name="l00721"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#aab26acce6ace06adcdf9a2cb3a40b874"> 721</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#aab26acce6ace06adcdf9a2cb3a40b874">delivery_insert_after</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> delivery_insert_after_; }</div>
|
|
<div class="line"><a id="l00722" name="l00722"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a22aa7b1daf1b464e9ec1b675390aca94"> 722</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">vehicle</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vehicle_; }</div>
|
|
<div class="line"><a id="l00723" name="l00723"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a307aa57dbe7730a98fc3c297c5924439"> 723</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a307aa57dbe7730a98fc3c297c5924439">set_vehicle</a>(<span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">vehicle</a>) { vehicle_ = <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">vehicle</a>; }</div>
|
|
<div class="line"><a id="l00724" name="l00724"></a><span class="lineno"> 724</span> </div>
|
|
<div class="line"><a id="l00725" name="l00725"></a><span class="lineno"> 725</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00726" name="l00726"></a><span class="lineno"> 726</span> int64_t value_;</div>
|
|
<div class="line"><a id="l00727" name="l00727"></a><span class="lineno"> 727</span> <span class="keywordtype">int</span> heap_index_;</div>
|
|
<div class="line"><a id="l00728" name="l00728"></a><span class="lineno"> 728</span> <span class="keyword">const</span> <span class="keywordtype">int</span> pickup_to_insert_;</div>
|
|
<div class="line"><a id="l00729" name="l00729"></a><span class="lineno"> 729</span> <span class="keywordtype">int</span> pickup_insert_after_;</div>
|
|
<div class="line"><a id="l00730" name="l00730"></a><span class="lineno"> 730</span> <span class="keyword">const</span> <span class="keywordtype">int</span> delivery_to_insert_;</div>
|
|
<div class="line"><a id="l00731" name="l00731"></a><span class="lineno"> 731</span> <span class="keyword">const</span> <span class="keywordtype">int</span> delivery_insert_after_;</div>
|
|
<div class="line"><a id="l00732" name="l00732"></a><span class="lineno"> 732</span> <span class="keywordtype">int</span> vehicle_;</div>
|
|
<div class="line"><a id="l00733" name="l00733"></a><span class="lineno"> 733</span> <span class="keyword">const</span> int64_t bucket_;</div>
|
|
<div class="line"><a id="l00734" name="l00734"></a><span class="lineno"> 734</span>};</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="comment">// Entry in priority queue containing the insertion position of a node.</span></div>
|
|
<div class="line"><a id="l00737" name="l00737"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html"> 737</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html">GlobalCheapestInsertionFilteredHeuristic::NodeEntry</a> {</div>
|
|
<div class="line"><a id="l00738" name="l00738"></a><span class="lineno"> 738</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00739" name="l00739"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a497aaa5a23f8532dfe19650423c0d977"> 739</a></span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a497aaa5a23f8532dfe19650423c0d977">NodeEntry</a>(<span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#afab5e0005c90180f14fc2a92d965af11">node_to_insert</a>, <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a33395f038b6a134edbe336a9a65f97eb">insert_after</a>, <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">vehicle</a>, int64_t bucket)</div>
|
|
<div class="line"><a id="l00740" name="l00740"></a><span class="lineno"> 740</span> : value_(<a class="code hl_namespace" href="namespacestd.html">std</a>::numeric_limits<int64_t>::<a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a>()),</div>
|
|
<div class="line"><a id="l00741" name="l00741"></a><span class="lineno"> 741</span> heap_index_(-1),</div>
|
|
<div class="line"><a id="l00742" name="l00742"></a><span class="lineno"> 742</span> node_to_insert_(<a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#afab5e0005c90180f14fc2a92d965af11">node_to_insert</a>),</div>
|
|
<div class="line"><a id="l00743" name="l00743"></a><span class="lineno"> 743</span> insert_after_(<a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a33395f038b6a134edbe336a9a65f97eb">insert_after</a>),</div>
|
|
<div class="line"><a id="l00744" name="l00744"></a><span class="lineno"> 744</span> vehicle_(<a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">vehicle</a>),</div>
|
|
<div class="line"><a id="l00745" name="l00745"></a><span class="lineno"> 745</span> bucket_(bucket) {}</div>
|
|
<div class="line"><a id="l00746" name="l00746"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a1288842502bf13a418539580ccdfa679"> 746</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a1288842502bf13a418539580ccdfa679">operator<</a>(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html">NodeEntry</a>& other)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00747" name="l00747"></a><span class="lineno"> 747</span> <span class="comment">// See PairEntry::operator<(), above. This one is similar.</span></div>
|
|
<div class="line"><a id="l00748" name="l00748"></a><span class="lineno"> 748</span> <span class="keywordflow">if</span> (bucket_ != other.bucket_) {</div>
|
|
<div class="line"><a id="l00749" name="l00749"></a><span class="lineno"> 749</span> <span class="keywordflow">return</span> bucket_ > other.bucket_;</div>
|
|
<div class="line"><a id="l00750" name="l00750"></a><span class="lineno"> 750</span> }</div>
|
|
<div class="line"><a id="l00751" name="l00751"></a><span class="lineno"> 751</span> <span class="keywordflow">if</span> (value_ != other.value_) {</div>
|
|
<div class="line"><a id="l00752" name="l00752"></a><span class="lineno"> 752</span> <span class="keywordflow">return</span> value_ > other.value_;</div>
|
|
<div class="line"><a id="l00753" name="l00753"></a><span class="lineno"> 753</span> }</div>
|
|
<div class="line"><a id="l00754" name="l00754"></a><span class="lineno"> 754</span> <span class="keywordflow">if</span> ((vehicle_ == -1) ^ (other.vehicle_ == -1)) {</div>
|
|
<div class="line"><a id="l00755" name="l00755"></a><span class="lineno"> 755</span> <span class="keywordflow">return</span> vehicle_ == -1;</div>
|
|
<div class="line"><a id="l00756" name="l00756"></a><span class="lineno"> 756</span> }</div>
|
|
<div class="line"><a id="l00757" name="l00757"></a><span class="lineno"> 757</span> <span class="keywordflow">return</span> std::tie(insert_after_, node_to_insert_, vehicle_) ></div>
|
|
<div class="line"><a id="l00758" name="l00758"></a><span class="lineno"> 758</span> std::tie(other.insert_after_, other.node_to_insert_, other.vehicle_);</div>
|
|
<div class="line"><a id="l00759" name="l00759"></a><span class="lineno"> 759</span> }</div>
|
|
<div class="line"><a id="l00760" name="l00760"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#ab87ca3233f48737b65fc2edb553575f9"> 760</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#ab87ca3233f48737b65fc2edb553575f9">SetHeapIndex</a>(<span class="keywordtype">int</span> h) { heap_index_ = h; }</div>
|
|
<div class="line"><a id="l00761" name="l00761"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a356efb311b542164bd4667883d0973bb"> 761</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a356efb311b542164bd4667883d0973bb">GetHeapIndex</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> heap_index_; }</div>
|
|
<div class="line"><a id="l00762" name="l00762"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#ae627561faf9239ac230cece97499aa62"> 762</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#ae627561faf9239ac230cece97499aa62">set_value</a>(int64_t <a class="code hl_variable" href="routing__search_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>) { value_ = <a class="code hl_variable" href="routing__search_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>; }</div>
|
|
<div class="line"><a id="l00763" name="l00763"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#afab5e0005c90180f14fc2a92d965af11"> 763</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#afab5e0005c90180f14fc2a92d965af11">node_to_insert</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> node_to_insert_; }</div>
|
|
<div class="line"><a id="l00764" name="l00764"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a33395f038b6a134edbe336a9a65f97eb"> 764</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a33395f038b6a134edbe336a9a65f97eb">insert_after</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> insert_after_; }</div>
|
|
<div class="line"><a id="l00765" name="l00765"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a6fa49ad5682919b9982d9c7b55d21683"> 765</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a6fa49ad5682919b9982d9c7b55d21683">set_insert_after</a>(<span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a33395f038b6a134edbe336a9a65f97eb">insert_after</a>) { insert_after_ = <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a33395f038b6a134edbe336a9a65f97eb">insert_after</a>; }</div>
|
|
<div class="line"><a id="l00766" name="l00766"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a22aa7b1daf1b464e9ec1b675390aca94"> 766</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">vehicle</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> vehicle_; }</div>
|
|
<div class="line"><a id="l00767" name="l00767"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a307aa57dbe7730a98fc3c297c5924439"> 767</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a307aa57dbe7730a98fc3c297c5924439">set_vehicle</a>(<span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">vehicle</a>) { vehicle_ = <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">vehicle</a>; }</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"> 769</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00770" name="l00770"></a><span class="lineno"> 770</span> int64_t value_;</div>
|
|
<div class="line"><a id="l00771" name="l00771"></a><span class="lineno"> 771</span> <span class="keywordtype">int</span> heap_index_;</div>
|
|
<div class="line"><a id="l00772" name="l00772"></a><span class="lineno"> 772</span> <span class="keyword">const</span> <span class="keywordtype">int</span> node_to_insert_;</div>
|
|
<div class="line"><a id="l00773" name="l00773"></a><span class="lineno"> 773</span> <span class="keywordtype">int</span> insert_after_;</div>
|
|
<div class="line"><a id="l00774" name="l00774"></a><span class="lineno"> 774</span> <span class="keywordtype">int</span> vehicle_;</div>
|
|
<div class="line"><a id="l00775" name="l00775"></a><span class="lineno"> 775</span> <span class="keyword">const</span> int64_t bucket_;</div>
|
|
<div class="line"><a id="l00776" name="l00776"></a><span class="lineno"> 776</span>};</div>
|
|
<div class="line"><a id="l00777" name="l00777"></a><span class="lineno"> 777</span> </div>
|
|
<div class="line"><a id="l00778" name="l00778"></a><span class="lineno"> 778</span><span class="comment">// GlobalCheapestInsertionFilteredHeuristic</span></div>
|
|
<div class="line"><a id="l00779" name="l00779"></a><span class="lineno"> 779</span> </div>
|
|
<div class="line"><a id="l00780" name="l00780"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#a7aa80364c8c66a703b80f0bd883788ad"> 780</a></span><a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#a7aa80364c8c66a703b80f0bd883788ad">GlobalCheapestInsertionFilteredHeuristic::</a></div>
|
|
<div class="line"><a id="l00781" name="l00781"></a><span class="lineno"> 781</span><a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#a7aa80364c8c66a703b80f0bd883788ad"> GlobalCheapestInsertionFilteredHeuristic</a>(</div>
|
|
<div class="line"><a id="l00782" name="l00782"></a><span class="lineno"> 782</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div>
|
|
<div class="line"><a id="l00783" name="l00783"></a><span class="lineno"> 783</span> std::function<int64_t(int64_t, int64_t, int64_t)> evaluator,</div>
|
|
<div class="line"><a id="l00784" name="l00784"></a><span class="lineno"> 784</span> std::function<int64_t(int64_t)> penalty_evaluator,</div>
|
|
<div class="line"><a id="l00785" name="l00785"></a><span class="lineno"> 785</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager,</div>
|
|
<div class="line"><a id="l00786" name="l00786"></a><span class="lineno"> 786</span> <a class="code hl_struct" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html">GlobalCheapestInsertionParameters</a> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>)</div>
|
|
<div class="line"><a id="l00787" name="l00787"></a><span class="lineno"> 787</span> : <a class="code hl_class" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html">CheapestInsertionFilteredHeuristic</a>(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code hl_namespace" href="namespacestd.html">std</a>::move(evaluator),</div>
|
|
<div class="line"><a id="l00788" name="l00788"></a><span class="lineno"> 788</span> <a class="code hl_namespace" href="namespacestd.html">std</a>::move(penalty_evaluator),</div>
|
|
<div class="line"><a id="l00789" name="l00789"></a><span class="lineno"> 789</span> filter_manager),</div>
|
|
<div class="line"><a id="l00790" name="l00790"></a><span class="lineno"> 790</span> gci_params_(<a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>),</div>
|
|
<div class="line"><a id="l00791" name="l00791"></a><span class="lineno"> 791</span> node_index_to_vehicle_(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Size(), -1),</div>
|
|
<div class="line"><a id="l00792" name="l00792"></a><span class="lineno"> 792</span> empty_vehicle_type_curator_(nullptr) {</div>
|
|
<div class="line"><a id="l00793" name="l00793"></a><span class="lineno"> 793</span> <a class="code hl_define" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(gci_params_.<a class="code hl_variable" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a0aa77787d0df1b489476bfc6714ef819">neighbors_ratio</a>, 0);</div>
|
|
<div class="line"><a id="l00794" name="l00794"></a><span class="lineno"> 794</span> <a class="code hl_define" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(gci_params_.<a class="code hl_variable" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a0aa77787d0df1b489476bfc6714ef819">neighbors_ratio</a>, 1);</div>
|
|
<div class="line"><a id="l00795" name="l00795"></a><span class="lineno"> 795</span> <a class="code hl_define" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(gci_params_.<a class="code hl_variable" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a264a3f98da0f7c3a55447f0e77e7ec8c">min_neighbors</a>, 1);</div>
|
|
<div class="line"><a id="l00796" name="l00796"></a><span class="lineno"> 796</span> </div>
|
|
<div class="line"><a id="l00797" name="l00797"></a><span class="lineno"> 797</span> <span class="keywordflow">if</span> (NumNeighbors() >= NumNonStartEndNodes() - 1) {</div>
|
|
<div class="line"><a id="l00798" name="l00798"></a><span class="lineno"> 798</span> <span class="comment">// All nodes are neighbors, so we set the neighbors_ratio to 1 to avoid</span></div>
|
|
<div class="line"><a id="l00799" name="l00799"></a><span class="lineno"> 799</span> <span class="comment">// unnecessary computations in the code.</span></div>
|
|
<div class="line"><a id="l00800" name="l00800"></a><span class="lineno"> 800</span> gci_params_.<a class="code hl_variable" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a0aa77787d0df1b489476bfc6714ef819">neighbors_ratio</a> = 1;</div>
|
|
<div class="line"><a id="l00801" name="l00801"></a><span class="lineno"> 801</span> }</div>
|
|
<div class="line"><a id="l00802" name="l00802"></a><span class="lineno"> 802</span> </div>
|
|
<div class="line"><a id="l00803" name="l00803"></a><span class="lineno"> 803</span> <span class="keywordflow">if</span> (gci_params_.<a class="code hl_variable" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a0aa77787d0df1b489476bfc6714ef819">neighbors_ratio</a> == 1) {</div>
|
|
<div class="line"><a id="l00804" name="l00804"></a><span class="lineno"> 804</span> gci_params_.<a class="code hl_variable" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a7d91387b5081be8f22d053d93eb9edf4">use_neighbors_ratio_for_initialization</a> = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00805" name="l00805"></a><span class="lineno"> 805</span> all_nodes_.resize(<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">Size</a>());</div>
|
|
<div class="line"><a id="l00806" name="l00806"></a><span class="lineno"> 806</span> std::iota(all_nodes_.begin(), all_nodes_.end(), 0);</div>
|
|
<div class="line"><a id="l00807" name="l00807"></a><span class="lineno"> 807</span> }</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><span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::ComputeNeighborhoods() {</div>
|
|
<div class="line"><a id="l00811" name="l00811"></a><span class="lineno"> 811</span> <span class="keywordflow">if</span> (gci_params_.<a class="code hl_variable" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a0aa77787d0df1b489476bfc6714ef819">neighbors_ratio</a> == 1 ||</div>
|
|
<div class="line"><a id="l00812" name="l00812"></a><span class="lineno"> 812</span> !node_index_to_neighbors_by_cost_class_.empty()) {</div>
|
|
<div class="line"><a id="l00813" name="l00813"></a><span class="lineno"> 813</span> <span class="comment">// Neighborhood computations not needed or already done.</span></div>
|
|
<div class="line"><a id="l00814" name="l00814"></a><span class="lineno"> 814</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00815" name="l00815"></a><span class="lineno"> 815</span> }</div>
|
|
<div class="line"><a id="l00816" name="l00816"></a><span class="lineno"> 816</span> </div>
|
|
<div class="line"><a id="l00817" name="l00817"></a><span class="lineno"> 817</span> <span class="comment">// TODO(user): Refactor the neighborhood computations in RoutingModel.</span></div>
|
|
<div class="line"><a id="l00818" name="l00818"></a><span class="lineno"> 818</span> <span class="keyword">const</span> int64_t num_neighbors = NumNeighbors();</div>
|
|
<div class="line"><a id="l00819" name="l00819"></a><span class="lineno"> 819</span> <span class="comment">// If num_neighbors was greater or equal num_non_start_end_nodes - 1,</span></div>
|
|
<div class="line"><a id="l00820" name="l00820"></a><span class="lineno"> 820</span> <span class="comment">// gci_params_.neighbors_ratio should have been set to 1.</span></div>
|
|
<div class="line"><a id="l00821" name="l00821"></a><span class="lineno"> 821</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(num_neighbors, NumNonStartEndNodes() - 1);</div>
|
|
<div class="line"><a id="l00822" name="l00822"></a><span class="lineno"> 822</span> </div>
|
|
<div class="line"><a id="l00823" name="l00823"></a><span class="lineno"> 823</span> <span class="keyword">const</span> RoutingModel& routing_model = *<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>();</div>
|
|
<div class="line"><a id="l00824" name="l00824"></a><span class="lineno"> 824</span> <span class="keyword">const</span> int64_t size = routing_model.Size();</div>
|
|
<div class="line"><a id="l00825" name="l00825"></a><span class="lineno"> 825</span> node_index_to_neighbors_by_cost_class_.resize(size);</div>
|
|
<div class="line"><a id="l00826" name="l00826"></a><span class="lineno"> 826</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_cost_classes = routing_model.GetCostClassesCount();</div>
|
|
<div class="line"><a id="l00827" name="l00827"></a><span class="lineno"> 827</span> <span class="keywordflow">for</span> (int64_t node_index = 0; node_index < size; node_index++) {</div>
|
|
<div class="line"><a id="l00828" name="l00828"></a><span class="lineno"> 828</span> node_index_to_neighbors_by_cost_class_[node_index].resize(num_cost_classes);</div>
|
|
<div class="line"><a id="l00829" name="l00829"></a><span class="lineno"> 829</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> cc = 0; cc < num_cost_classes; cc++) {</div>
|
|
<div class="line"><a id="l00830" name="l00830"></a><span class="lineno"> 830</span> node_index_to_neighbors_by_cost_class_[node_index][cc] =</div>
|
|
<div class="line"><a id="l00831" name="l00831"></a><span class="lineno"> 831</span> absl::make_unique<SparseBitset<int64_t>>(size);</div>
|
|
<div class="line"><a id="l00832" name="l00832"></a><span class="lineno"> 832</span> }</div>
|
|
<div class="line"><a id="l00833" name="l00833"></a><span class="lineno"> 833</span> }</div>
|
|
<div class="line"><a id="l00834" name="l00834"></a><span class="lineno"> 834</span> </div>
|
|
<div class="line"><a id="l00835" name="l00835"></a><span class="lineno"> 835</span> <span class="keywordflow">for</span> (int64_t node_index = 0; node_index < size; ++node_index) {</div>
|
|
<div class="line"><a id="l00836" name="l00836"></a><span class="lineno"> 836</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!routing_model.IsEnd(node_index));</div>
|
|
<div class="line"><a id="l00837" name="l00837"></a><span class="lineno"> 837</span> <span class="keywordflow">if</span> (routing_model.IsStart(node_index)) {</div>
|
|
<div class="line"><a id="l00838" name="l00838"></a><span class="lineno"> 838</span> <span class="comment">// We don't compute neighbors for vehicle starts: all nodes are considered</span></div>
|
|
<div class="line"><a id="l00839" name="l00839"></a><span class="lineno"> 839</span> <span class="comment">// neighbors for a vehicle start.</span></div>
|
|
<div class="line"><a id="l00840" name="l00840"></a><span class="lineno"> 840</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00841" name="l00841"></a><span class="lineno"> 841</span> }</div>
|
|
<div class="line"><a id="l00842" name="l00842"></a><span class="lineno"> 842</span> </div>
|
|
<div class="line"><a id="l00843" name="l00843"></a><span class="lineno"> 843</span> <span class="comment">// TODO(user): Use the model's IndexNeighborFinder when available.</span></div>
|
|
<div class="line"><a id="l00844" name="l00844"></a><span class="lineno"> 844</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> cost_class = 0; cost_class < num_cost_classes; cost_class++) {</div>
|
|
<div class="line"><a id="l00845" name="l00845"></a><span class="lineno"> 845</span> <span class="keywordflow">if</span> (!routing_model.HasVehicleWithCostClassIndex(</div>
|
|
<div class="line"><a id="l00846" name="l00846"></a><span class="lineno"> 846</span> RoutingCostClassIndex(cost_class))) {</div>
|
|
<div class="line"><a id="l00847" name="l00847"></a><span class="lineno"> 847</span> <span class="comment">// No vehicle with this cost class, avoid unnecessary computations.</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> std::vector<std::pair<<span class="comment">/*cost*/</span> int64_t, <span class="comment">/*node*/</span> int64_t>></div>
|
|
<div class="line"><a id="l00851" name="l00851"></a><span class="lineno"> 851</span> costed_after_nodes;</div>
|
|
<div class="line"><a id="l00852" name="l00852"></a><span class="lineno"> 852</span> costed_after_nodes.reserve(size);</div>
|
|
<div class="line"><a id="l00853" name="l00853"></a><span class="lineno"> 853</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> after_node = 0; after_node < size; ++after_node) {</div>
|
|
<div class="line"><a id="l00854" name="l00854"></a><span class="lineno"> 854</span> <span class="keywordflow">if</span> (after_node != node_index && !routing_model.IsStart(after_node)) {</div>
|
|
<div class="line"><a id="l00855" name="l00855"></a><span class="lineno"> 855</span> costed_after_nodes.push_back(</div>
|
|
<div class="line"><a id="l00856" name="l00856"></a><span class="lineno"> 856</span> std::make_pair(routing_model.GetArcCostForClass(</div>
|
|
<div class="line"><a id="l00857" name="l00857"></a><span class="lineno"> 857</span> node_index, after_node, cost_class),</div>
|
|
<div class="line"><a id="l00858" name="l00858"></a><span class="lineno"> 858</span> after_node));</div>
|
|
<div class="line"><a id="l00859" name="l00859"></a><span class="lineno"> 859</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> std::nth_element(costed_after_nodes.begin(),</div>
|
|
<div class="line"><a id="l00862" name="l00862"></a><span class="lineno"> 862</span> costed_after_nodes.begin() + num_neighbors - 1,</div>
|
|
<div class="line"><a id="l00863" name="l00863"></a><span class="lineno"> 863</span> costed_after_nodes.end());</div>
|
|
<div class="line"><a id="l00864" name="l00864"></a><span class="lineno"> 864</span> costed_after_nodes.resize(num_neighbors);</div>
|
|
<div class="line"><a id="l00865" name="l00865"></a><span class="lineno"> 865</span> </div>
|
|
<div class="line"><a id="l00866" name="l00866"></a><span class="lineno"> 866</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> [<a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>, neighbor] : costed_after_nodes) {</div>
|
|
<div class="line"><a id="l00867" name="l00867"></a><span class="lineno"> 867</span> node_index_to_neighbors_by_cost_class_[node_index][cost_class]->Set(</div>
|
|
<div class="line"><a id="l00868" name="l00868"></a><span class="lineno"> 868</span> neighbor);</div>
|
|
<div class="line"><a id="l00869" name="l00869"></a><span class="lineno"> 869</span> </div>
|
|
<div class="line"><a id="l00870" name="l00870"></a><span class="lineno"> 870</span> <span class="comment">// Add reverse neighborhood.</span></div>
|
|
<div class="line"><a id="l00871" name="l00871"></a><span class="lineno"> 871</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!routing_model.IsEnd(neighbor) &&</div>
|
|
<div class="line"><a id="l00872" name="l00872"></a><span class="lineno"> 872</span> !routing_model.IsStart(neighbor));</div>
|
|
<div class="line"><a id="l00873" name="l00873"></a><span class="lineno"> 873</span> node_index_to_neighbors_by_cost_class_[neighbor][cost_class]->Set(</div>
|
|
<div class="line"><a id="l00874" name="l00874"></a><span class="lineno"> 874</span> node_index);</div>
|
|
<div class="line"><a id="l00875" name="l00875"></a><span class="lineno"> 875</span> }</div>
|
|
<div class="line"><a id="l00876" name="l00876"></a><span class="lineno"> 876</span> <span class="comment">// Add all vehicle starts as neighbors to this node and vice-versa.</span></div>
|
|
<div class="line"><a id="l00877" name="l00877"></a><span class="lineno"> 877</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < routing_model.vehicles(); vehicle++) {</div>
|
|
<div class="line"><a id="l00878" name="l00878"></a><span class="lineno"> 878</span> <span class="keyword">const</span> int64_t vehicle_start = routing_model.Start(vehicle);</div>
|
|
<div class="line"><a id="l00879" name="l00879"></a><span class="lineno"> 879</span> node_index_to_neighbors_by_cost_class_[node_index][cost_class]->Set(</div>
|
|
<div class="line"><a id="l00880" name="l00880"></a><span class="lineno"> 880</span> vehicle_start);</div>
|
|
<div class="line"><a id="l00881" name="l00881"></a><span class="lineno"> 881</span> node_index_to_neighbors_by_cost_class_[vehicle_start][cost_class]->Set(</div>
|
|
<div class="line"><a id="l00882" name="l00882"></a><span class="lineno"> 882</span> node_index);</div>
|
|
<div class="line"><a id="l00883" name="l00883"></a><span class="lineno"> 883</span> }</div>
|
|
<div class="line"><a id="l00884" name="l00884"></a><span class="lineno"> 884</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>}</div>
|
|
<div class="line"><a id="l00887" name="l00887"></a><span class="lineno"> 887</span> </div>
|
|
<div class="line"><a id="l00888" name="l00888"></a><span class="lineno"> 888</span><span class="keywordtype">bool</span> GlobalCheapestInsertionFilteredHeuristic::IsNeighborForCostClass(</div>
|
|
<div class="line"><a id="l00889" name="l00889"></a><span class="lineno"> 889</span> <span class="keywordtype">int</span> cost_class, int64_t node_index, int64_t neighbor_index)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00890" name="l00890"></a><span class="lineno"> 890</span> <span class="keywordflow">return</span> gci_params_.<a class="code hl_variable" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a0aa77787d0df1b489476bfc6714ef819">neighbors_ratio</a> == 1 ||</div>
|
|
<div class="line"><a id="l00891" name="l00891"></a><span class="lineno"> 891</span> (*node_index_to_neighbors_by_cost_class_[node_index]</div>
|
|
<div class="line"><a id="l00892" name="l00892"></a><span class="lineno"> 892</span> [cost_class])[neighbor_index];</div>
|
|
<div class="line"><a id="l00893" name="l00893"></a><span class="lineno"> 893</span>}</div>
|
|
<div class="line"><a id="l00894" name="l00894"></a><span class="lineno"> 894</span> </div>
|
|
<div class="line"><a id="l00895" name="l00895"></a><span class="lineno"> 895</span><span class="keywordtype">bool</span> GlobalCheapestInsertionFilteredHeuristic::CheckVehicleIndices()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00896" name="l00896"></a><span class="lineno"> 896</span> std::vector<bool> node_is_visited(<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>(), -1);</div>
|
|
<div class="line"><a id="l00897" name="l00897"></a><span class="lineno"> 897</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> v = 0; v < <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); v++) {</div>
|
|
<div class="line"><a id="l00898" name="l00898"></a><span class="lineno"> 898</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(v); !<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#acf67dc202e247ce193038850f71306d3">IsEnd</a>(node);</div>
|
|
<div class="line"><a id="l00899" name="l00899"></a><span class="lineno"> 899</span> node = <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(node)) {</div>
|
|
<div class="line"><a id="l00900" name="l00900"></a><span class="lineno"> 900</span> <span class="keywordflow">if</span> (node_index_to_vehicle_[node] != v) {</div>
|
|
<div class="line"><a id="l00901" name="l00901"></a><span class="lineno"> 901</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00902" name="l00902"></a><span class="lineno"> 902</span> }</div>
|
|
<div class="line"><a id="l00903" name="l00903"></a><span class="lineno"> 903</span> node_is_visited[node] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00904" name="l00904"></a><span class="lineno"> 904</span> }</div>
|
|
<div class="line"><a id="l00905" name="l00905"></a><span class="lineno"> 905</span> }</div>
|
|
<div class="line"><a id="l00906" name="l00906"></a><span class="lineno"> 906</span> </div>
|
|
<div class="line"><a id="l00907" name="l00907"></a><span class="lineno"> 907</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">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="l00908" name="l00908"></a><span class="lineno"> 908</span> <span class="keywordflow">if</span> (!node_is_visited[node] && node_index_to_vehicle_[node] != -1) {</div>
|
|
<div class="line"><a id="l00909" name="l00909"></a><span class="lineno"> 909</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00910" name="l00910"></a><span class="lineno"> 910</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="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00914" name="l00914"></a><span class="lineno"> 914</span>}</div>
|
|
<div class="line"><a id="l00915" name="l00915"></a><span class="lineno"> 915</span> </div>
|
|
<div class="line"><a id="l00916" name="l00916"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289"> 916</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">GlobalCheapestInsertionFilteredHeuristic::BuildSolutionInternal</a>() {</div>
|
|
<div class="line"><a id="l00917" name="l00917"></a><span class="lineno"> 917</span> ComputeNeighborhoods();</div>
|
|
<div class="line"><a id="l00918" name="l00918"></a><span class="lineno"> 918</span> <span class="keywordflow">if</span> (empty_vehicle_type_curator_ == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l00919" name="l00919"></a><span class="lineno"> 919</span> empty_vehicle_type_curator_ = absl::make_unique<VehicleTypeCurator>(</div>
|
|
<div class="line"><a id="l00920" name="l00920"></a><span class="lineno"> 920</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->GetVehicleTypeContainer());</div>
|
|
<div class="line"><a id="l00921" name="l00921"></a><span class="lineno"> 921</span> }</div>
|
|
<div class="line"><a id="l00922" name="l00922"></a><span class="lineno"> 922</span> <span class="comment">// Store all empty vehicles in the empty_vehicle_type_curator_.</span></div>
|
|
<div class="line"><a id="l00923" name="l00923"></a><span class="lineno"> 923</span> empty_vehicle_type_curator_->Reset(</div>
|
|
<div class="line"><a id="l00924" name="l00924"></a><span class="lineno"> 924</span> [<span class="keyword">this</span>](<span class="keywordtype">int</span> vehicle) { <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(vehicle); });</div>
|
|
<div class="line"><a id="l00925" name="l00925"></a><span class="lineno"> 925</span> <span class="comment">// Insert partially inserted pairs.</span></div>
|
|
<div class="line"><a id="l00926" name="l00926"></a><span class="lineno"> 926</span> <span class="keyword">const</span> <a class="code hl_typedef" href="classoperations__research_1_1_routing_model.html#a76874cd778ea1b9220673e019f9e7abe">RoutingModel::IndexPairs</a>& pickup_delivery_pairs =</div>
|
|
<div class="line"><a id="l00927" name="l00927"></a><span class="lineno"> 927</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a251dfaa30251901d13cd2f33a92571ac">GetPickupAndDeliveryPairs</a>();</div>
|
|
<div class="line"><a id="l00928" name="l00928"></a><span class="lineno"> 928</span> std::map<int64_t, std::vector<int>> pairs_to_insert_by_bucket;</div>
|
|
<div class="line"><a id="l00929" name="l00929"></a><span class="lineno"> 929</span> absl::flat_hash_map<int, std::map<int64_t, std::vector<int>>></div>
|
|
<div class="line"><a id="l00930" name="l00930"></a><span class="lineno"> 930</span> vehicle_to_pair_nodes;</div>
|
|
<div class="line"><a id="l00931" name="l00931"></a><span class="lineno"> 931</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a> = 0; <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a> < pickup_delivery_pairs.size(); <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>++) {</div>
|
|
<div class="line"><a id="l00932" name="l00932"></a><span class="lineno"> 932</span> <span class="keyword">const</span> <a class="code hl_typedef" href="classoperations__research_1_1_routing_model.html#a1636c49d2587c3d9df16918345b82378">RoutingModel::IndexPair</a>& index_pair = pickup_delivery_pairs[<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>];</div>
|
|
<div class="line"><a id="l00933" name="l00933"></a><span class="lineno"> 933</span> <span class="keywordtype">int</span> pickup_vehicle = -1;</div>
|
|
<div class="line"><a id="l00934" name="l00934"></a><span class="lineno"> 934</span> <span class="keywordflow">for</span> (int64_t pickup : index_pair.first) {</div>
|
|
<div class="line"><a id="l00935" name="l00935"></a><span class="lineno"> 935</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(pickup)) {</div>
|
|
<div class="line"><a id="l00936" name="l00936"></a><span class="lineno"> 936</span> pickup_vehicle = node_index_to_vehicle_[pickup];</div>
|
|
<div class="line"><a id="l00937" name="l00937"></a><span class="lineno"> 937</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00938" name="l00938"></a><span class="lineno"> 938</span> }</div>
|
|
<div class="line"><a id="l00939" name="l00939"></a><span class="lineno"> 939</span> }</div>
|
|
<div class="line"><a id="l00940" name="l00940"></a><span class="lineno"> 940</span> <span class="keywordtype">int</span> delivery_vehicle = -1;</div>
|
|
<div class="line"><a id="l00941" name="l00941"></a><span class="lineno"> 941</span> <span class="keywordflow">for</span> (int64_t delivery : index_pair.second) {</div>
|
|
<div class="line"><a id="l00942" name="l00942"></a><span class="lineno"> 942</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(delivery)) {</div>
|
|
<div class="line"><a id="l00943" name="l00943"></a><span class="lineno"> 943</span> delivery_vehicle = node_index_to_vehicle_[delivery];</div>
|
|
<div class="line"><a id="l00944" name="l00944"></a><span class="lineno"> 944</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00945" name="l00945"></a><span class="lineno"> 945</span> }</div>
|
|
<div class="line"><a id="l00946" name="l00946"></a><span class="lineno"> 946</span> }</div>
|
|
<div class="line"><a id="l00947" name="l00947"></a><span class="lineno"> 947</span> <span class="keywordflow">if</span> (pickup_vehicle < 0 && delivery_vehicle < 0) {</div>
|
|
<div class="line"><a id="l00948" name="l00948"></a><span class="lineno"> 948</span> pairs_to_insert_by_bucket[GetBucketOfPair(index_pair)].push_back(<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>);</div>
|
|
<div class="line"><a id="l00949" name="l00949"></a><span class="lineno"> 949</span> }</div>
|
|
<div class="line"><a id="l00950" name="l00950"></a><span class="lineno"> 950</span> <span class="keywordflow">if</span> (pickup_vehicle >= 0 && delivery_vehicle < 0) {</div>
|
|
<div class="line"><a id="l00951" name="l00951"></a><span class="lineno"> 951</span> std::vector<int>& pair_nodes = vehicle_to_pair_nodes[pickup_vehicle][1];</div>
|
|
<div class="line"><a id="l00952" name="l00952"></a><span class="lineno"> 952</span> <span class="keywordflow">for</span> (int64_t delivery : index_pair.second) {</div>
|
|
<div class="line"><a id="l00953" name="l00953"></a><span class="lineno"> 953</span> pair_nodes.push_back(delivery);</div>
|
|
<div class="line"><a id="l00954" name="l00954"></a><span class="lineno"> 954</span> }</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">if</span> (pickup_vehicle < 0 && delivery_vehicle >= 0) {</div>
|
|
<div class="line"><a id="l00957" name="l00957"></a><span class="lineno"> 957</span> std::vector<int>& pair_nodes = vehicle_to_pair_nodes[delivery_vehicle][1];</div>
|
|
<div class="line"><a id="l00958" name="l00958"></a><span class="lineno"> 958</span> <span class="keywordflow">for</span> (int64_t pickup : index_pair.first) {</div>
|
|
<div class="line"><a id="l00959" name="l00959"></a><span class="lineno"> 959</span> pair_nodes.push_back(pickup);</div>
|
|
<div class="line"><a id="l00960" name="l00960"></a><span class="lineno"> 960</span> }</div>
|
|
<div class="line"><a id="l00961" name="l00961"></a><span class="lineno"> 961</span> }</div>
|
|
<div class="line"><a id="l00962" name="l00962"></a><span class="lineno"> 962</span> }</div>
|
|
<div class="line"><a id="l00963" name="l00963"></a><span class="lineno"> 963</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& [vehicle, <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>] : vehicle_to_pair_nodes) {</div>
|
|
<div class="line"><a id="l00964" name="l00964"></a><span class="lineno"> 964</span> <span class="keywordflow">if</span> (!InsertNodesOnRoutes(<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, {vehicle})) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00965" name="l00965"></a><span class="lineno"> 965</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="keywordflow">if</span> (!InsertPairsAndNodesByRequirementTopologicalOrder()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00968" name="l00968"></a><span class="lineno"> 968</span> </div>
|
|
<div class="line"><a id="l00969" name="l00969"></a><span class="lineno"> 969</span> <span class="comment">// TODO(user): Adapt the pair insertions to also support seed and</span></div>
|
|
<div class="line"><a id="l00970" name="l00970"></a><span class="lineno"> 970</span> <span class="comment">// sequential insertion.</span></div>
|
|
<div class="line"><a id="l00971" name="l00971"></a><span class="lineno"> 971</span> <span class="keywordflow">if</span> (!InsertPairs(pairs_to_insert_by_bucket)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00972" name="l00972"></a><span class="lineno"> 972</span> std::map<int64_t, std::vector<int>> nodes_by_bucket;</div>
|
|
<div class="line"><a id="l00973" name="l00973"></a><span class="lineno"> 973</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">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="l00974" name="l00974"></a><span class="lineno"> 974</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(node) && <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#ac6d5e197d4c8db922db0b8e2a8b7074e">GetPickupIndexPairs</a>(node).empty() &&</div>
|
|
<div class="line"><a id="l00975" name="l00975"></a><span class="lineno"> 975</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a434b15d056c7e1751925eba475e84c32">GetDeliveryIndexPairs</a>(node).empty()) {</div>
|
|
<div class="line"><a id="l00976" name="l00976"></a><span class="lineno"> 976</span> nodes_by_bucket[GetBucketOfNode(node)].push_back(node);</div>
|
|
<div class="line"><a id="l00977" name="l00977"></a><span class="lineno"> 977</span> }</div>
|
|
<div class="line"><a id="l00978" name="l00978"></a><span class="lineno"> 978</span> }</div>
|
|
<div class="line"><a id="l00979" name="l00979"></a><span class="lineno"> 979</span> InsertFarthestNodesAsSeeds();</div>
|
|
<div class="line"><a id="l00980" name="l00980"></a><span class="lineno"> 980</span> <span class="keywordflow">if</span> (gci_params_.<a class="code hl_variable" href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a28b4894c7c18183ac19b81d1b6d97e2f">is_sequential</a>) {</div>
|
|
<div class="line"><a id="l00981" name="l00981"></a><span class="lineno"> 981</span> <span class="keywordflow">if</span> (!SequentialInsertNodes(nodes_by_bucket)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00982" name="l00982"></a><span class="lineno"> 982</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!InsertNodesOnRoutes(nodes_by_bucket, {})) {</div>
|
|
<div class="line"><a id="l00983" name="l00983"></a><span class="lineno"> 983</span> <span class="keywordflow">return</span> <span class="keyword">false</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> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a97049801609b8cb68c0428970f916fd4">MakeUnassignedNodesUnperformed</a>();</div>
|
|
<div class="line"><a id="l00986" name="l00986"></a><span class="lineno"> 986</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(CheckVehicleIndices());</div>
|
|
<div class="line"><a id="l00987" name="l00987"></a><span class="lineno"> 987</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value();</div>
|
|
<div class="line"><a id="l00988" name="l00988"></a><span class="lineno"> 988</span>}</div>
|
|
<div class="line"><a id="l00989" name="l00989"></a><span class="lineno"> 989</span> </div>
|
|
<div class="line"><a id="l00990" name="l00990"></a><span class="lineno"> 990</span><span class="keywordtype">bool</span> GlobalCheapestInsertionFilteredHeuristic::</div>
|
|
<div class="line"><a id="l00991" name="l00991"></a><span class="lineno"> 991</span> InsertPairsAndNodesByRequirementTopologicalOrder() {</div>
|
|
<div class="line"><a id="l00992" name="l00992"></a><span class="lineno"> 992</span> <span class="keyword">const</span> <a class="code hl_typedef" href="classoperations__research_1_1_routing_model.html#a76874cd778ea1b9220673e019f9e7abe">RoutingModel::IndexPairs</a>& pickup_delivery_pairs =</div>
|
|
<div class="line"><a id="l00993" name="l00993"></a><span class="lineno"> 993</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a251dfaa30251901d13cd2f33a92571ac">GetPickupAndDeliveryPairs</a>();</div>
|
|
<div class="line"><a id="l00994" name="l00994"></a><span class="lineno"> 994</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> std::vector<int>& types :</div>
|
|
<div class="line"><a id="l00995" name="l00995"></a><span class="lineno"> 995</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->GetTopologicallySortedVisitTypes()) {</div>
|
|
<div class="line"><a id="l00996" name="l00996"></a><span class="lineno"> 996</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> type : types) {</div>
|
|
<div class="line"><a id="l00997" name="l00997"></a><span class="lineno"> 997</span> std::map<int64_t, std::vector<int>> pairs_to_insert_by_bucket;</div>
|
|
<div class="line"><a id="l00998" name="l00998"></a><span class="lineno"> 998</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a> : <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->GetPairIndicesOfType(type)) {</div>
|
|
<div class="line"><a id="l00999" name="l00999"></a><span class="lineno"> 999</span> pairs_to_insert_by_bucket[GetBucketOfPair(pickup_delivery_pairs[<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>])]</div>
|
|
<div class="line"><a id="l01000" name="l01000"></a><span class="lineno"> 1000</span> .push_back(<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>);</div>
|
|
<div class="line"><a id="l01001" name="l01001"></a><span class="lineno"> 1001</span> }</div>
|
|
<div class="line"><a id="l01002" name="l01002"></a><span class="lineno"> 1002</span> <span class="keywordflow">if</span> (!InsertPairs(pairs_to_insert_by_bucket)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01003" name="l01003"></a><span class="lineno"> 1003</span> std::map<int64_t, std::vector<int>> nodes_by_bucket;</div>
|
|
<div class="line"><a id="l01004" name="l01004"></a><span class="lineno"> 1004</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node : <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->GetSingleNodesOfType(type)) {</div>
|
|
<div class="line"><a id="l01005" name="l01005"></a><span class="lineno"> 1005</span> nodes_by_bucket[GetBucketOfNode(node)].push_back(node);</div>
|
|
<div class="line"><a id="l01006" name="l01006"></a><span class="lineno"> 1006</span> }</div>
|
|
<div class="line"><a id="l01007" name="l01007"></a><span class="lineno"> 1007</span> <span class="keywordflow">if</span> (!InsertNodesOnRoutes(nodes_by_bucket, {})) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01008" name="l01008"></a><span class="lineno"> 1008</span> }</div>
|
|
<div class="line"><a id="l01009" name="l01009"></a><span class="lineno"> 1009</span> }</div>
|
|
<div class="line"><a id="l01010" name="l01010"></a><span class="lineno"> 1010</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01011" name="l01011"></a><span class="lineno"> 1011</span>}</div>
|
|
<div class="line"><a id="l01012" name="l01012"></a><span class="lineno"> 1012</span> </div>
|
|
<div class="line"><a id="l01013" name="l01013"></a><span class="lineno"> 1013</span><span class="keywordtype">bool</span> GlobalCheapestInsertionFilteredHeuristic::InsertPairs(</div>
|
|
<div class="line"><a id="l01014" name="l01014"></a><span class="lineno"> 1014</span> <span class="keyword">const</span> std::map<int64_t, std::vector<int>>& pair_indices_by_bucket) {</div>
|
|
<div class="line"><a id="l01015" name="l01015"></a><span class="lineno"> 1015</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<PairEntry></a> priority_queue;</div>
|
|
<div class="line"><a id="l01016" name="l01016"></a><span class="lineno"> 1016</span> std::vector<PairEntries> pickup_to_entries;</div>
|
|
<div class="line"><a id="l01017" name="l01017"></a><span class="lineno"> 1017</span> std::vector<PairEntries> delivery_to_entries;</div>
|
|
<div class="line"><a id="l01018" name="l01018"></a><span class="lineno"> 1018</span> std::vector<int> pair_indices_to_insert;</div>
|
|
<div class="line"><a id="l01019" name="l01019"></a><span class="lineno"> 1019</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& [bucket, pair_indices] : pair_indices_by_bucket) {</div>
|
|
<div class="line"><a id="l01020" name="l01020"></a><span class="lineno"> 1020</span> pair_indices_to_insert.insert(pair_indices_to_insert.end(),</div>
|
|
<div class="line"><a id="l01021" name="l01021"></a><span class="lineno"> 1021</span> pair_indices.begin(), pair_indices.end());</div>
|
|
<div class="line"><a id="l01022" name="l01022"></a><span class="lineno"> 1022</span> <span class="keywordflow">if</span> (!InitializePairPositions(pair_indices_to_insert, &priority_queue,</div>
|
|
<div class="line"><a id="l01023" name="l01023"></a><span class="lineno"> 1023</span> &pickup_to_entries, &delivery_to_entries)) {</div>
|
|
<div class="line"><a id="l01024" name="l01024"></a><span class="lineno"> 1024</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</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> <span class="keywordflow">while</span> (!priority_queue.<a class="code hl_function" href="class_adjustable_priority_queue.html#a8e12342fc420701fbffd97025421575a">IsEmpty</a>()) {</div>
|
|
<div class="line"><a id="l01027" name="l01027"></a><span class="lineno"> 1027</span> <span class="keywordflow">if</span> (StopSearchAndCleanup(&priority_queue)) {</div>
|
|
<div class="line"><a id="l01028" name="l01028"></a><span class="lineno"> 1028</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01029" name="l01029"></a><span class="lineno"> 1029</span> }</div>
|
|
<div class="line"><a id="l01030" name="l01030"></a><span class="lineno"> 1030</span> PairEntry* <span class="keyword">const</span> entry = priority_queue.<a class="code hl_function" href="class_adjustable_priority_queue.html#a503e1bfef34fc7acf03340ddd74b5872">Top</a>();</div>
|
|
<div class="line"><a id="l01031" name="l01031"></a><span class="lineno"> 1031</span> <span class="keyword">const</span> int64_t pickup = entry->pickup_to_insert();</div>
|
|
<div class="line"><a id="l01032" name="l01032"></a><span class="lineno"> 1032</span> <span class="keyword">const</span> int64_t delivery = entry->delivery_to_insert();</div>
|
|
<div class="line"><a id="l01033" name="l01033"></a><span class="lineno"> 1033</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(pickup) || <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(delivery)) {</div>
|
|
<div class="line"><a id="l01034" name="l01034"></a><span class="lineno"> 1034</span> DeletePairEntry(entry, &priority_queue, &pickup_to_entries,</div>
|
|
<div class="line"><a id="l01035" name="l01035"></a><span class="lineno"> 1035</span> &delivery_to_entries);</div>
|
|
<div class="line"><a id="l01036" name="l01036"></a><span class="lineno"> 1036</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01037" name="l01037"></a><span class="lineno"> 1037</span> }</div>
|
|
<div class="line"><a id="l01038" name="l01038"></a><span class="lineno"> 1038</span> </div>
|
|
<div class="line"><a id="l01039" name="l01039"></a><span class="lineno"> 1039</span> <span class="keyword">const</span> <span class="keywordtype">int</span> entry_vehicle = entry->vehicle();</div>
|
|
<div class="line"><a id="l01040" name="l01040"></a><span class="lineno"> 1040</span> <span class="keywordflow">if</span> (entry_vehicle == -1) {</div>
|
|
<div class="line"><a id="l01041" name="l01041"></a><span class="lineno"> 1041</span> <span class="comment">// Pair is unperformed.</span></div>
|
|
<div class="line"><a id="l01042" name="l01042"></a><span class="lineno"> 1042</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(pickup, pickup);</div>
|
|
<div class="line"><a id="l01043" name="l01043"></a><span class="lineno"> 1043</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(delivery, delivery);</div>
|
|
<div class="line"><a id="l01044" name="l01044"></a><span class="lineno"> 1044</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value()) {</div>
|
|
<div class="line"><a id="l01045" name="l01045"></a><span class="lineno"> 1045</span> DeletePairEntry(entry, &priority_queue, &pickup_to_entries,</div>
|
|
<div class="line"><a id="l01046" name="l01046"></a><span class="lineno"> 1046</span> &delivery_to_entries);</div>
|
|
<div class="line"><a id="l01047" name="l01047"></a><span class="lineno"> 1047</span> }</div>
|
|
<div class="line"><a id="l01048" name="l01048"></a><span class="lineno"> 1048</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01049" name="l01049"></a><span class="lineno"> 1049</span> }</div>
|
|
<div class="line"><a id="l01050" name="l01050"></a><span class="lineno"> 1050</span> </div>
|
|
<div class="line"><a id="l01051" name="l01051"></a><span class="lineno"> 1051</span> <span class="comment">// Pair is performed.</span></div>
|
|
<div class="line"><a id="l01052" name="l01052"></a><span class="lineno"> 1052</span> <span class="keywordflow">if</span> (UseEmptyVehicleTypeCuratorForVehicle(entry_vehicle)) {</div>
|
|
<div class="line"><a id="l01053" name="l01053"></a><span class="lineno"> 1053</span> <span class="keywordflow">if</span> (!InsertPairEntryUsingEmptyVehicleTypeCurator(</div>
|
|
<div class="line"><a id="l01054" name="l01054"></a><span class="lineno"> 1054</span> pair_indices_to_insert, entry, &priority_queue,</div>
|
|
<div class="line"><a id="l01055" name="l01055"></a><span class="lineno"> 1055</span> &pickup_to_entries, &delivery_to_entries)) {</div>
|
|
<div class="line"><a id="l01056" name="l01056"></a><span class="lineno"> 1056</span> <span class="keywordflow">return</span> <span class="keyword">false</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> <span class="comment">// The entry corresponded to an insertion on an empty vehicle, which was</span></div>
|
|
<div class="line"><a id="l01059" name="l01059"></a><span class="lineno"> 1059</span> <span class="comment">// handled by the call to InsertPairEntryUsingEmptyVehicleTypeCurator().</span></div>
|
|
<div class="line"><a id="l01060" name="l01060"></a><span class="lineno"> 1060</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01061" name="l01061"></a><span class="lineno"> 1061</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> <span class="keyword">const</span> int64_t pickup_insert_after = entry->pickup_insert_after();</div>
|
|
<div class="line"><a id="l01064" name="l01064"></a><span class="lineno"> 1064</span> <span class="keyword">const</span> int64_t pickup_insert_before = <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(pickup_insert_after);</div>
|
|
<div class="line"><a id="l01065" name="l01065"></a><span class="lineno"> 1065</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#add2710777ca3960d37c6257cd95edfee">InsertBetween</a>(pickup, pickup_insert_after, pickup_insert_before);</div>
|
|
<div class="line"><a id="l01066" name="l01066"></a><span class="lineno"> 1066</span> </div>
|
|
<div class="line"><a id="l01067" name="l01067"></a><span class="lineno"> 1067</span> <span class="keyword">const</span> int64_t delivery_insert_after = entry->delivery_insert_after();</div>
|
|
<div class="line"><a id="l01068" name="l01068"></a><span class="lineno"> 1068</span> <span class="keyword">const</span> int64_t delivery_insert_before = (delivery_insert_after == pickup)</div>
|
|
<div class="line"><a id="l01069" name="l01069"></a><span class="lineno"> 1069</span> ? pickup_insert_before</div>
|
|
<div class="line"><a id="l01070" name="l01070"></a><span class="lineno"> 1070</span> : <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(delivery_insert_after);</div>
|
|
<div class="line"><a id="l01071" name="l01071"></a><span class="lineno"> 1071</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#add2710777ca3960d37c6257cd95edfee">InsertBetween</a>(delivery, delivery_insert_after, delivery_insert_before);</div>
|
|
<div class="line"><a id="l01072" name="l01072"></a><span class="lineno"> 1072</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value()) {</div>
|
|
<div class="line"><a id="l01073" name="l01073"></a><span class="lineno"> 1073</span> <span class="keywordflow">if</span> (!UpdateAfterPairInsertion(</div>
|
|
<div class="line"><a id="l01074" name="l01074"></a><span class="lineno"> 1074</span> pair_indices_to_insert, entry_vehicle, pickup,</div>
|
|
<div class="line"><a id="l01075" name="l01075"></a><span class="lineno"> 1075</span> pickup_insert_after, delivery, delivery_insert_after,</div>
|
|
<div class="line"><a id="l01076" name="l01076"></a><span class="lineno"> 1076</span> &priority_queue, &pickup_to_entries, &delivery_to_entries)) {</div>
|
|
<div class="line"><a id="l01077" name="l01077"></a><span class="lineno"> 1077</span> <span class="keywordflow">return</span> <span class="keyword">false</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"> 1079</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l01080" name="l01080"></a><span class="lineno"> 1080</span> DeletePairEntry(entry, &priority_queue, &pickup_to_entries,</div>
|
|
<div class="line"><a id="l01081" name="l01081"></a><span class="lineno"> 1081</span> &delivery_to_entries);</div>
|
|
<div class="line"><a id="l01082" name="l01082"></a><span class="lineno"> 1082</span> }</div>
|
|
<div class="line"><a id="l01083" name="l01083"></a><span class="lineno"> 1083</span> }</div>
|
|
<div class="line"><a id="l01084" name="l01084"></a><span class="lineno"> 1084</span> <span class="comment">// In case all pairs could not be inserted, pushing uninserted ones to the</span></div>
|
|
<div class="line"><a id="l01085" name="l01085"></a><span class="lineno"> 1085</span> <span class="comment">// next bucket.</span></div>
|
|
<div class="line"><a id="l01086" name="l01086"></a><span class="lineno"> 1086</span> <span class="keyword">const</span> <a class="code hl_typedef" href="classoperations__research_1_1_routing_model.html#a76874cd778ea1b9220673e019f9e7abe">RoutingModel::IndexPairs</a>& pickup_delivery_pairs =</div>
|
|
<div class="line"><a id="l01087" name="l01087"></a><span class="lineno"> 1087</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a251dfaa30251901d13cd2f33a92571ac">GetPickupAndDeliveryPairs</a>();</div>
|
|
<div class="line"><a id="l01088" name="l01088"></a><span class="lineno"> 1088</span> pair_indices_to_insert.erase(</div>
|
|
<div class="line"><a id="l01089" name="l01089"></a><span class="lineno"> 1089</span> std::remove_if(</div>
|
|
<div class="line"><a id="l01090" name="l01090"></a><span class="lineno"> 1090</span> pair_indices_to_insert.begin(), pair_indices_to_insert.end(),</div>
|
|
<div class="line"><a id="l01091" name="l01091"></a><span class="lineno"> 1091</span> [<span class="keyword">this</span>, &pickup_delivery_pairs](<span class="keywordtype">int</span> pair_index) {</div>
|
|
<div class="line"><a id="l01092" name="l01092"></a><span class="lineno"> 1092</span> <span class="comment">// Checking a pickup has been inserted is enough to make sure the</span></div>
|
|
<div class="line"><a id="l01093" name="l01093"></a><span class="lineno"> 1093</span> <span class="comment">// full pair has been inserted since a pickup cannot be inserted</span></div>
|
|
<div class="line"><a id="l01094" name="l01094"></a><span class="lineno"> 1094</span> <span class="comment">// without its delivery (and vice versa).</span></div>
|
|
<div class="line"><a id="l01095" name="l01095"></a><span class="lineno"> 1095</span> for (int64_t pickup : pickup_delivery_pairs[pair_index].first) {</div>
|
|
<div class="line"><a id="l01096" name="l01096"></a><span class="lineno"> 1096</span> if (Contains(pickup)) return true;</div>
|
|
<div class="line"><a id="l01097" name="l01097"></a><span class="lineno"> 1097</span> }</div>
|
|
<div class="line"><a id="l01098" name="l01098"></a><span class="lineno"> 1098</span> <span class="keywordflow">return</span> <span class="keyword">false</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> pair_indices_to_insert.end());</div>
|
|
<div class="line"><a id="l01101" name="l01101"></a><span class="lineno"> 1101</span> }</div>
|
|
<div class="line"><a id="l01102" name="l01102"></a><span class="lineno"> 1102</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01103" name="l01103"></a><span class="lineno"> 1103</span>}</div>
|
|
<div class="line"><a id="l01104" name="l01104"></a><span class="lineno"> 1104</span> </div>
|
|
<div class="line"><a id="l01105" name="l01105"></a><span class="lineno"> 1105</span><span class="keywordtype">bool</span> GlobalCheapestInsertionFilteredHeuristic::</div>
|
|
<div class="line"><a id="l01106" name="l01106"></a><span class="lineno"> 1106</span> InsertPairEntryUsingEmptyVehicleTypeCurator(</div>
|
|
<div class="line"><a id="l01107" name="l01107"></a><span class="lineno"> 1107</span> <span class="keyword">const</span> std::vector<int>& pair_indices,</div>
|
|
<div class="line"><a id="l01108" name="l01108"></a><span class="lineno"> 1108</span> GlobalCheapestInsertionFilteredHeuristic::PairEntry* <span class="keyword">const</span> pair_entry,</div>
|
|
<div class="line"><a id="l01109" name="l01109"></a><span class="lineno"> 1109</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a id="l01110" name="l01110"></a><span class="lineno"> 1110</span> GlobalCheapestInsertionFilteredHeuristic::PairEntry>*</div>
|
|
<div class="line"><a id="l01111" name="l01111"></a><span class="lineno"> 1111</span> priority_queue,</div>
|
|
<div class="line"><a id="l01112" name="l01112"></a><span class="lineno"> 1112</span> std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a id="l01113" name="l01113"></a><span class="lineno"> 1113</span> pickup_to_entries,</div>
|
|
<div class="line"><a id="l01114" name="l01114"></a><span class="lineno"> 1114</span> std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a id="l01115" name="l01115"></a><span class="lineno"> 1115</span> delivery_to_entries) {</div>
|
|
<div class="line"><a id="l01116" name="l01116"></a><span class="lineno"> 1116</span> <span class="keyword">const</span> <span class="keywordtype">int</span> entry_vehicle = pair_entry->vehicle();</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#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(UseEmptyVehicleTypeCuratorForVehicle(entry_vehicle));</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="comment">// Trying to insert on an empty vehicle.</span></div>
|
|
<div class="line"><a id="l01120" name="l01120"></a><span class="lineno"> 1120</span> <span class="comment">// As we only have one pair_entry per empty vehicle type, we try inserting on</span></div>
|
|
<div class="line"><a id="l01121" name="l01121"></a><span class="lineno"> 1121</span> <span class="comment">// all vehicles of this type with the same fixed cost, as they all have the</span></div>
|
|
<div class="line"><a id="l01122" name="l01122"></a><span class="lineno"> 1122</span> <span class="comment">// same insertion value.</span></div>
|
|
<div class="line"><a id="l01123" name="l01123"></a><span class="lineno"> 1123</span> <span class="keyword">const</span> int64_t pickup = pair_entry->pickup_to_insert();</div>
|
|
<div class="line"><a id="l01124" name="l01124"></a><span class="lineno"> 1124</span> <span class="keyword">const</span> int64_t delivery = pair_entry->delivery_to_insert();</div>
|
|
<div class="line"><a id="l01125" name="l01125"></a><span class="lineno"> 1125</span> <span class="keyword">const</span> int64_t entry_fixed_cost =</div>
|
|
<div class="line"><a id="l01126" name="l01126"></a><span class="lineno"> 1126</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->GetFixedCostOfVehicle(entry_vehicle);</div>
|
|
<div class="line"><a id="l01127" name="l01127"></a><span class="lineno"> 1127</span> <span class="keyword">auto</span> vehicle_is_compatible = [<span class="keyword">this</span>, entry_fixed_cost, pickup,</div>
|
|
<div class="line"><a id="l01128" name="l01128"></a><span class="lineno"> 1128</span> delivery](<span class="keywordtype">int</span> vehicle) {</div>
|
|
<div class="line"><a id="l01129" name="l01129"></a><span class="lineno"> 1129</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->GetFixedCostOfVehicle(vehicle) != entry_fixed_cost) {</div>
|
|
<div class="line"><a id="l01130" name="l01130"></a><span class="lineno"> 1130</span> <span class="keywordflow">return</span> <span class="keyword">false</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="comment">// NOTE: Only empty vehicles should be in the vehicle_curator_.</span></div>
|
|
<div class="line"><a id="l01133" name="l01133"></a><span class="lineno"> 1133</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(VehicleIsEmpty(vehicle));</div>
|
|
<div class="line"><a id="l01134" name="l01134"></a><span class="lineno"> 1134</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a> = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->End(vehicle);</div>
|
|
<div class="line"><a id="l01135" name="l01135"></a><span class="lineno"> 1135</span> InsertBetween(pickup, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->Start(vehicle), <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>, vehicle);</div>
|
|
<div class="line"><a id="l01136" name="l01136"></a><span class="lineno"> 1136</span> InsertBetween(delivery, pickup, <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>, vehicle);</div>
|
|
<div class="line"><a id="l01137" name="l01137"></a><span class="lineno"> 1137</span> <span class="keywordflow">return</span> Evaluate(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value();</div>
|
|
<div class="line"><a id="l01138" name="l01138"></a><span class="lineno"> 1138</span> };</div>
|
|
<div class="line"><a id="l01139" name="l01139"></a><span class="lineno"> 1139</span> <span class="comment">// Since the vehicles of the same type are sorted by increasing fixed</span></div>
|
|
<div class="line"><a id="l01140" name="l01140"></a><span class="lineno"> 1140</span> <span class="comment">// cost by the curator, we can stop as soon as a vehicle with a fixed cost</span></div>
|
|
<div class="line"><a id="l01141" name="l01141"></a><span class="lineno"> 1141</span> <span class="comment">// higher than the entry_fixed_cost is found which is empty, and adapt the</span></div>
|
|
<div class="line"><a id="l01142" name="l01142"></a><span class="lineno"> 1142</span> <span class="comment">// pair entry with this new vehicle.</span></div>
|
|
<div class="line"><a id="l01143" name="l01143"></a><span class="lineno"> 1143</span> <span class="keyword">auto</span> stop_and_return_vehicle = [<span class="keyword">this</span>, entry_fixed_cost](<span class="keywordtype">int</span> vehicle) {</div>
|
|
<div class="line"><a id="l01144" name="l01144"></a><span class="lineno"> 1144</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->GetFixedCostOfVehicle(vehicle) > entry_fixed_cost;</div>
|
|
<div class="line"><a id="l01145" name="l01145"></a><span class="lineno"> 1145</span> };</div>
|
|
<div class="line"><a id="l01146" name="l01146"></a><span class="lineno"> 1146</span> <span class="keyword">const</span> <span class="keyword">auto</span> [compatible_vehicle, next_fixed_cost_empty_vehicle] =</div>
|
|
<div class="line"><a id="l01147" name="l01147"></a><span class="lineno"> 1147</span> empty_vehicle_type_curator_->GetCompatibleVehicleOfType(</div>
|
|
<div class="line"><a id="l01148" name="l01148"></a><span class="lineno"> 1148</span> empty_vehicle_type_curator_->Type(entry_vehicle),</div>
|
|
<div class="line"><a id="l01149" name="l01149"></a><span class="lineno"> 1149</span> vehicle_is_compatible, stop_and_return_vehicle);</div>
|
|
<div class="line"><a id="l01150" name="l01150"></a><span class="lineno"> 1150</span> <span class="keywordflow">if</span> (compatible_vehicle >= 0) {</div>
|
|
<div class="line"><a id="l01151" name="l01151"></a><span class="lineno"> 1151</span> <span class="comment">// The pair was inserted on this vehicle.</span></div>
|
|
<div class="line"><a id="l01152" name="l01152"></a><span class="lineno"> 1152</span> <span class="keyword">const</span> int64_t vehicle_start = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->Start(compatible_vehicle);</div>
|
|
<div class="line"><a id="l01153" name="l01153"></a><span class="lineno"> 1153</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_previous_vehicle_entries =</div>
|
|
<div class="line"><a id="l01154" name="l01154"></a><span class="lineno"> 1154</span> pickup_to_entries->at(vehicle_start).size() +</div>
|
|
<div class="line"><a id="l01155" name="l01155"></a><span class="lineno"> 1155</span> delivery_to_entries->at(vehicle_start).size();</div>
|
|
<div class="line"><a id="l01156" name="l01156"></a><span class="lineno"> 1156</span> <span class="keywordflow">if</span> (!UpdateAfterPairInsertion(</div>
|
|
<div class="line"><a id="l01157" name="l01157"></a><span class="lineno"> 1157</span> pair_indices, compatible_vehicle, pickup, vehicle_start, delivery,</div>
|
|
<div class="line"><a id="l01158" name="l01158"></a><span class="lineno"> 1158</span> pickup, priority_queue, pickup_to_entries, delivery_to_entries)) {</div>
|
|
<div class="line"><a id="l01159" name="l01159"></a><span class="lineno"> 1159</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01160" name="l01160"></a><span class="lineno"> 1160</span> }</div>
|
|
<div class="line"><a id="l01161" name="l01161"></a><span class="lineno"> 1161</span> <span class="keywordflow">if</span> (compatible_vehicle != entry_vehicle) {</div>
|
|
<div class="line"><a id="l01162" name="l01162"></a><span class="lineno"> 1162</span> <span class="comment">// The pair was inserted on another empty vehicle of the same type</span></div>
|
|
<div class="line"><a id="l01163" name="l01163"></a><span class="lineno"> 1163</span> <span class="comment">// and same fixed cost as entry_vehicle.</span></div>
|
|
<div class="line"><a id="l01164" name="l01164"></a><span class="lineno"> 1164</span> <span class="comment">// Since this vehicle is empty and has the same fixed cost as the</span></div>
|
|
<div class="line"><a id="l01165" name="l01165"></a><span class="lineno"> 1165</span> <span class="comment">// entry_vehicle, it shouldn't be the representative of empty vehicles</span></div>
|
|
<div class="line"><a id="l01166" name="l01166"></a><span class="lineno"> 1166</span> <span class="comment">// for any pickup/delivery in the priority queue.</span></div>
|
|
<div class="line"><a id="l01167" name="l01167"></a><span class="lineno"> 1167</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(num_previous_vehicle_entries, 0);</div>
|
|
<div class="line"><a id="l01168" name="l01168"></a><span class="lineno"> 1168</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01169" name="l01169"></a><span class="lineno"> 1169</span> }</div>
|
|
<div class="line"><a id="l01170" name="l01170"></a><span class="lineno"> 1170</span> <span class="comment">// The previously unused entry_vehicle is now used, so we use the next</span></div>
|
|
<div class="line"><a id="l01171" name="l01171"></a><span class="lineno"> 1171</span> <span class="comment">// available vehicle of the same type to compute and store insertions on</span></div>
|
|
<div class="line"><a id="l01172" name="l01172"></a><span class="lineno"> 1172</span> <span class="comment">// empty vehicles.</span></div>
|
|
<div class="line"><a id="l01173" name="l01173"></a><span class="lineno"> 1173</span> <span class="keyword">const</span> <span class="keywordtype">int</span> new_empty_vehicle =</div>
|
|
<div class="line"><a id="l01174" name="l01174"></a><span class="lineno"> 1174</span> empty_vehicle_type_curator_->GetLowestFixedCostVehicleOfType(</div>
|
|
<div class="line"><a id="l01175" name="l01175"></a><span class="lineno"> 1175</span> empty_vehicle_type_curator_->Type(compatible_vehicle));</div>
|
|
<div class="line"><a id="l01176" name="l01176"></a><span class="lineno"> 1176</span> </div>
|
|
<div class="line"><a id="l01177" name="l01177"></a><span class="lineno"> 1177</span> <span class="keywordflow">if</span> (new_empty_vehicle >= 0) {</div>
|
|
<div class="line"><a id="l01178" name="l01178"></a><span class="lineno"> 1178</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(VehicleIsEmpty(new_empty_vehicle));</div>
|
|
<div class="line"><a id="l01179" name="l01179"></a><span class="lineno"> 1179</span> <span class="comment">// Add node entries after this vehicle start for uninserted pairs which</span></div>
|
|
<div class="line"><a id="l01180" name="l01180"></a><span class="lineno"> 1180</span> <span class="comment">// don't have entries on this empty vehicle.</span></div>
|
|
<div class="line"><a id="l01181" name="l01181"></a><span class="lineno"> 1181</span> UpdatePairPositions(pair_indices, new_empty_vehicle,</div>
|
|
<div class="line"><a id="l01182" name="l01182"></a><span class="lineno"> 1182</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->Start(new_empty_vehicle), priority_queue,</div>
|
|
<div class="line"><a id="l01183" name="l01183"></a><span class="lineno"> 1183</span> pickup_to_entries, delivery_to_entries);</div>
|
|
<div class="line"><a id="l01184" name="l01184"></a><span class="lineno"> 1184</span> }</div>
|
|
<div class="line"><a id="l01185" name="l01185"></a><span class="lineno"> 1185</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (next_fixed_cost_empty_vehicle >= 0) {</div>
|
|
<div class="line"><a id="l01186" name="l01186"></a><span class="lineno"> 1186</span> <span class="comment">// Could not insert on this vehicle or any other vehicle of the same type</span></div>
|
|
<div class="line"><a id="l01187" name="l01187"></a><span class="lineno"> 1187</span> <span class="comment">// with the same fixed cost, but found an empty vehicle of this type with</span></div>
|
|
<div class="line"><a id="l01188" name="l01188"></a><span class="lineno"> 1188</span> <span class="comment">// higher fixed cost.</span></div>
|
|
<div class="line"><a id="l01189" name="l01189"></a><span class="lineno"> 1189</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(VehicleIsEmpty(next_fixed_cost_empty_vehicle));</div>
|
|
<div class="line"><a id="l01190" name="l01190"></a><span class="lineno"> 1190</span> <span class="comment">// Update the pair entry to correspond to an insertion on this</span></div>
|
|
<div class="line"><a id="l01191" name="l01191"></a><span class="lineno"> 1191</span> <span class="comment">// next_fixed_cost_empty_vehicle instead of the previous entry_vehicle.</span></div>
|
|
<div class="line"><a id="l01192" name="l01192"></a><span class="lineno"> 1192</span> pair_entry->set_vehicle(next_fixed_cost_empty_vehicle);</div>
|
|
<div class="line"><a id="l01193" name="l01193"></a><span class="lineno"> 1193</span> pickup_to_entries->at(pair_entry->pickup_insert_after()).erase(pair_entry);</div>
|
|
<div class="line"><a id="l01194" name="l01194"></a><span class="lineno"> 1194</span> pair_entry->set_pickup_insert_after(</div>
|
|
<div class="line"><a id="l01195" name="l01195"></a><span class="lineno"> 1195</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->Start(next_fixed_cost_empty_vehicle));</div>
|
|
<div class="line"><a id="l01196" name="l01196"></a><span class="lineno"> 1196</span> pickup_to_entries->at(pair_entry->pickup_insert_after()).insert(pair_entry);</div>
|
|
<div class="line"><a id="l01197" name="l01197"></a><span class="lineno"> 1197</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(pair_entry->delivery_insert_after(), pickup);</div>
|
|
<div class="line"><a id="l01198" name="l01198"></a><span class="lineno"> 1198</span> UpdatePairEntry(pair_entry, priority_queue);</div>
|
|
<div class="line"><a id="l01199" name="l01199"></a><span class="lineno"> 1199</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l01200" name="l01200"></a><span class="lineno"> 1200</span> DeletePairEntry(pair_entry, priority_queue, pickup_to_entries,</div>
|
|
<div class="line"><a id="l01201" name="l01201"></a><span class="lineno"> 1201</span> delivery_to_entries);</div>
|
|
<div class="line"><a id="l01202" name="l01202"></a><span class="lineno"> 1202</span> }</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> <span class="keywordflow">return</span> <span class="keyword">true</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> </div>
|
|
<div class="line"><a id="l01207" name="l01207"></a><span class="lineno"> 1207</span><span class="keywordtype">bool</span> GlobalCheapestInsertionFilteredHeuristic::InsertNodesOnRoutes(</div>
|
|
<div class="line"><a id="l01208" name="l01208"></a><span class="lineno"> 1208</span> <span class="keyword">const</span> std::map<int64_t, std::vector<int>>& nodes_by_bucket,</div>
|
|
<div class="line"><a id="l01209" name="l01209"></a><span class="lineno"> 1209</span> <span class="keyword">const</span> absl::flat_hash_set<int>& vehicles) {</div>
|
|
<div class="line"><a id="l01210" name="l01210"></a><span class="lineno"> 1210</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<NodeEntry></a> priority_queue;</div>
|
|
<div class="line"><a id="l01211" name="l01211"></a><span class="lineno"> 1211</span> std::vector<NodeEntries> position_to_node_entries;</div>
|
|
<div class="line"><a id="l01212" name="l01212"></a><span class="lineno"> 1212</span> std::vector<int> nodes_to_insert;</div>
|
|
<div class="line"><a id="l01213" name="l01213"></a><span class="lineno"> 1213</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& [bucket, <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>] : nodes_by_bucket) {</div>
|
|
<div class="line"><a id="l01214" name="l01214"></a><span class="lineno"> 1214</span> nodes_to_insert.insert(nodes_to_insert.end(), <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.begin(), <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>.end());</div>
|
|
<div class="line"><a id="l01215" name="l01215"></a><span class="lineno"> 1215</span> <span class="keywordflow">if</span> (!InitializePositions(nodes_to_insert, vehicles, &priority_queue,</div>
|
|
<div class="line"><a id="l01216" name="l01216"></a><span class="lineno"> 1216</span> &position_to_node_entries)) {</div>
|
|
<div class="line"><a id="l01217" name="l01217"></a><span class="lineno"> 1217</span> <span class="keywordflow">return</span> <span class="keyword">false</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> <span class="comment">// The following boolean indicates whether or not all vehicles are being</span></div>
|
|
<div class="line"><a id="l01220" name="l01220"></a><span class="lineno"> 1220</span> <span class="comment">// considered for insertion of the nodes simultaneously.</span></div>
|
|
<div class="line"><a id="l01221" name="l01221"></a><span class="lineno"> 1221</span> <span class="comment">// In the sequential version of the heuristic, as well as when inserting</span></div>
|
|
<div class="line"><a id="l01222" name="l01222"></a><span class="lineno"> 1222</span> <span class="comment">// single pickup or deliveries from pickup/delivery pairs, this will be</span></div>
|
|
<div class="line"><a id="l01223" name="l01223"></a><span class="lineno"> 1223</span> <span class="comment">// false. In the general parallel version of the heuristic, all_vehicles is</span></div>
|
|
<div class="line"><a id="l01224" name="l01224"></a><span class="lineno"> 1224</span> <span class="comment">// true.</span></div>
|
|
<div class="line"><a id="l01225" name="l01225"></a><span class="lineno"> 1225</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> all_vehicles =</div>
|
|
<div class="line"><a id="l01226" name="l01226"></a><span class="lineno"> 1226</span> vehicles.empty() || vehicles.size() == <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->vehicles();</div>
|
|
<div class="line"><a id="l01227" name="l01227"></a><span class="lineno"> 1227</span> </div>
|
|
<div class="line"><a id="l01228" name="l01228"></a><span class="lineno"> 1228</span> <span class="keywordflow">while</span> (!priority_queue.<a class="code hl_function" href="class_adjustable_priority_queue.html#a8e12342fc420701fbffd97025421575a">IsEmpty</a>()) {</div>
|
|
<div class="line"><a id="l01229" name="l01229"></a><span class="lineno"> 1229</span> NodeEntry* <span class="keyword">const</span> node_entry = priority_queue.<a class="code hl_function" href="class_adjustable_priority_queue.html#a503e1bfef34fc7acf03340ddd74b5872">Top</a>();</div>
|
|
<div class="line"><a id="l01230" name="l01230"></a><span class="lineno"> 1230</span> <span class="keywordflow">if</span> (StopSearchAndCleanup(&priority_queue)) {</div>
|
|
<div class="line"><a id="l01231" name="l01231"></a><span class="lineno"> 1231</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01232" name="l01232"></a><span class="lineno"> 1232</span> }</div>
|
|
<div class="line"><a id="l01233" name="l01233"></a><span class="lineno"> 1233</span> <span class="keyword">const</span> int64_t node_to_insert = node_entry->node_to_insert();</div>
|
|
<div class="line"><a id="l01234" name="l01234"></a><span class="lineno"> 1234</span> <span class="keywordflow">if</span> (Contains(node_to_insert)) {</div>
|
|
<div class="line"><a id="l01235" name="l01235"></a><span class="lineno"> 1235</span> DeleteNodeEntry(node_entry, &priority_queue, &position_to_node_entries);</div>
|
|
<div class="line"><a id="l01236" name="l01236"></a><span class="lineno"> 1236</span> <span class="keywordflow">continue</span>;</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> </div>
|
|
<div class="line"><a id="l01239" name="l01239"></a><span class="lineno"> 1239</span> <span class="keyword">const</span> <span class="keywordtype">int</span> entry_vehicle = node_entry->vehicle();</div>
|
|
<div class="line"><a id="l01240" name="l01240"></a><span class="lineno"> 1240</span> <span class="keywordflow">if</span> (entry_vehicle == -1) {</div>
|
|
<div class="line"><a id="l01241" name="l01241"></a><span class="lineno"> 1241</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(all_vehicles);</div>
|
|
<div class="line"><a id="l01242" name="l01242"></a><span class="lineno"> 1242</span> <span class="comment">// Make node unperformed.</span></div>
|
|
<div class="line"><a id="l01243" name="l01243"></a><span class="lineno"> 1243</span> SetValue(node_to_insert, node_to_insert);</div>
|
|
<div class="line"><a id="l01244" name="l01244"></a><span class="lineno"> 1244</span> <span class="keywordflow">if</span> (!Evaluate(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value()) {</div>
|
|
<div class="line"><a id="l01245" name="l01245"></a><span class="lineno"> 1245</span> DeleteNodeEntry(node_entry, &priority_queue,</div>
|
|
<div class="line"><a id="l01246" name="l01246"></a><span class="lineno"> 1246</span> &position_to_node_entries);</div>
|
|
<div class="line"><a id="l01247" name="l01247"></a><span class="lineno"> 1247</span> }</div>
|
|
<div class="line"><a id="l01248" name="l01248"></a><span class="lineno"> 1248</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01249" name="l01249"></a><span class="lineno"> 1249</span> }</div>
|
|
<div class="line"><a id="l01250" name="l01250"></a><span class="lineno"> 1250</span> </div>
|
|
<div class="line"><a id="l01251" name="l01251"></a><span class="lineno"> 1251</span> <span class="comment">// Make node performed.</span></div>
|
|
<div class="line"><a id="l01252" name="l01252"></a><span class="lineno"> 1252</span> <span class="keywordflow">if</span> (UseEmptyVehicleTypeCuratorForVehicle(entry_vehicle, all_vehicles)) {</div>
|
|
<div class="line"><a id="l01253" name="l01253"></a><span class="lineno"> 1253</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(all_vehicles);</div>
|
|
<div class="line"><a id="l01254" name="l01254"></a><span class="lineno"> 1254</span> <span class="keywordflow">if</span> (!InsertNodeEntryUsingEmptyVehicleTypeCurator(</div>
|
|
<div class="line"><a id="l01255" name="l01255"></a><span class="lineno"> 1255</span> nodes_to_insert, all_vehicles, node_entry, &priority_queue,</div>
|
|
<div class="line"><a id="l01256" name="l01256"></a><span class="lineno"> 1256</span> &position_to_node_entries)) {</div>
|
|
<div class="line"><a id="l01257" name="l01257"></a><span class="lineno"> 1257</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01258" name="l01258"></a><span class="lineno"> 1258</span> }</div>
|
|
<div class="line"><a id="l01259" name="l01259"></a><span class="lineno"> 1259</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01260" name="l01260"></a><span class="lineno"> 1260</span> }</div>
|
|
<div class="line"><a id="l01261" name="l01261"></a><span class="lineno"> 1261</span> </div>
|
|
<div class="line"><a id="l01262" name="l01262"></a><span class="lineno"> 1262</span> <span class="keyword">const</span> int64_t insert_after = node_entry->insert_after();</div>
|
|
<div class="line"><a id="l01263" name="l01263"></a><span class="lineno"> 1263</span> InsertBetween(node_to_insert, insert_after, <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984">Value</a>(insert_after));</div>
|
|
<div class="line"><a id="l01264" name="l01264"></a><span class="lineno"> 1264</span> <span class="keywordflow">if</span> (Evaluate(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value()) {</div>
|
|
<div class="line"><a id="l01265" name="l01265"></a><span class="lineno"> 1265</span> <span class="keywordflow">if</span> (!UpdatePositions(nodes_to_insert, entry_vehicle, node_to_insert,</div>
|
|
<div class="line"><a id="l01266" name="l01266"></a><span class="lineno"> 1266</span> all_vehicles, &priority_queue,</div>
|
|
<div class="line"><a id="l01267" name="l01267"></a><span class="lineno"> 1267</span> &position_to_node_entries) ||</div>
|
|
<div class="line"><a id="l01268" name="l01268"></a><span class="lineno"> 1268</span> !UpdatePositions(nodes_to_insert, entry_vehicle, insert_after,</div>
|
|
<div class="line"><a id="l01269" name="l01269"></a><span class="lineno"> 1269</span> all_vehicles, &priority_queue,</div>
|
|
<div class="line"><a id="l01270" name="l01270"></a><span class="lineno"> 1270</span> &position_to_node_entries)) {</div>
|
|
<div class="line"><a id="l01271" name="l01271"></a><span class="lineno"> 1271</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01272" name="l01272"></a><span class="lineno"> 1272</span> }</div>
|
|
<div class="line"><a id="l01273" name="l01273"></a><span class="lineno"> 1273</span> SetVehicleIndex(node_to_insert, entry_vehicle);</div>
|
|
<div class="line"><a id="l01274" name="l01274"></a><span class="lineno"> 1274</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l01275" name="l01275"></a><span class="lineno"> 1275</span> DeleteNodeEntry(node_entry, &priority_queue, &position_to_node_entries);</div>
|
|
<div class="line"><a id="l01276" name="l01276"></a><span class="lineno"> 1276</span> }</div>
|
|
<div class="line"><a id="l01277" name="l01277"></a><span class="lineno"> 1277</span> }</div>
|
|
<div class="line"><a id="l01278" name="l01278"></a><span class="lineno"> 1278</span> <span class="comment">// In case all nodes could not be inserted, pushing uninserted ones to the</span></div>
|
|
<div class="line"><a id="l01279" name="l01279"></a><span class="lineno"> 1279</span> <span class="comment">// next bucket.</span></div>
|
|
<div class="line"><a id="l01280" name="l01280"></a><span class="lineno"> 1280</span> nodes_to_insert.erase(</div>
|
|
<div class="line"><a id="l01281" name="l01281"></a><span class="lineno"> 1281</span> std::remove_if(nodes_to_insert.begin(), nodes_to_insert.end(),</div>
|
|
<div class="line"><a id="l01282" name="l01282"></a><span class="lineno"> 1282</span> [<span class="keyword">this</span>](<span class="keywordtype">int</span> node) { return Contains(node); }),</div>
|
|
<div class="line"><a id="l01283" name="l01283"></a><span class="lineno"> 1283</span> nodes_to_insert.end());</div>
|
|
<div class="line"><a id="l01284" name="l01284"></a><span class="lineno"> 1284</span> }</div>
|
|
<div class="line"><a id="l01285" name="l01285"></a><span class="lineno"> 1285</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01286" name="l01286"></a><span class="lineno"> 1286</span>}</div>
|
|
<div class="line"><a id="l01287" name="l01287"></a><span class="lineno"> 1287</span> </div>
|
|
<div class="line"><a id="l01288" name="l01288"></a><span class="lineno"> 1288</span><span class="keywordtype">bool</span> GlobalCheapestInsertionFilteredHeuristic::</div>
|
|
<div class="line"><a id="l01289" name="l01289"></a><span class="lineno"> 1289</span> InsertNodeEntryUsingEmptyVehicleTypeCurator(</div>
|
|
<div class="line"><a id="l01290" name="l01290"></a><span class="lineno"> 1290</span> <span class="keyword">const</span> std::vector<int>& <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, <span class="keywordtype">bool</span> all_vehicles,</div>
|
|
<div class="line"><a id="l01291" name="l01291"></a><span class="lineno"> 1291</span> GlobalCheapestInsertionFilteredHeuristic::NodeEntry* <span class="keyword">const</span> node_entry,</div>
|
|
<div class="line"><a id="l01292" name="l01292"></a><span class="lineno"> 1292</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a id="l01293" name="l01293"></a><span class="lineno"> 1293</span> GlobalCheapestInsertionFilteredHeuristic::NodeEntry>*</div>
|
|
<div class="line"><a id="l01294" name="l01294"></a><span class="lineno"> 1294</span> priority_queue,</div>
|
|
<div class="line"><a id="l01295" name="l01295"></a><span class="lineno"> 1295</span> std::vector<GlobalCheapestInsertionFilteredHeuristic::NodeEntries>*</div>
|
|
<div class="line"><a id="l01296" name="l01296"></a><span class="lineno"> 1296</span> position_to_node_entries) {</div>
|
|
<div class="line"><a id="l01297" name="l01297"></a><span class="lineno"> 1297</span> <span class="keyword">const</span> <span class="keywordtype">int</span> entry_vehicle = node_entry->vehicle();</div>
|
|
<div class="line"><a id="l01298" name="l01298"></a><span class="lineno"> 1298</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(UseEmptyVehicleTypeCuratorForVehicle(entry_vehicle, all_vehicles));</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> <span class="comment">// Trying to insert on an empty vehicle, and all vehicles are being</span></div>
|
|
<div class="line"><a id="l01301" name="l01301"></a><span class="lineno"> 1301</span> <span class="comment">// considered simultaneously.</span></div>
|
|
<div class="line"><a id="l01302" name="l01302"></a><span class="lineno"> 1302</span> <span class="comment">// As we only have one node_entry per type, we try inserting on all vehicles</span></div>
|
|
<div class="line"><a id="l01303" name="l01303"></a><span class="lineno"> 1303</span> <span class="comment">// of this type with the same fixed cost as they all have the same insertion</span></div>
|
|
<div class="line"><a id="l01304" name="l01304"></a><span class="lineno"> 1304</span> <span class="comment">// value.</span></div>
|
|
<div class="line"><a id="l01305" name="l01305"></a><span class="lineno"> 1305</span> <span class="keyword">const</span> int64_t node_to_insert = node_entry->node_to_insert();</div>
|
|
<div class="line"><a id="l01306" name="l01306"></a><span class="lineno"> 1306</span> <span class="keyword">const</span> int64_t entry_fixed_cost =</div>
|
|
<div class="line"><a id="l01307" name="l01307"></a><span class="lineno"> 1307</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->GetFixedCostOfVehicle(entry_vehicle);</div>
|
|
<div class="line"><a id="l01308" name="l01308"></a><span class="lineno"> 1308</span> <span class="keyword">auto</span> vehicle_is_compatible = [<span class="keyword">this</span>, entry_fixed_cost,</div>
|
|
<div class="line"><a id="l01309" name="l01309"></a><span class="lineno"> 1309</span> node_to_insert](<span class="keywordtype">int</span> vehicle) {</div>
|
|
<div class="line"><a id="l01310" name="l01310"></a><span class="lineno"> 1310</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->GetFixedCostOfVehicle(vehicle) != entry_fixed_cost) {</div>
|
|
<div class="line"><a id="l01311" name="l01311"></a><span class="lineno"> 1311</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01312" name="l01312"></a><span class="lineno"> 1312</span> }</div>
|
|
<div class="line"><a id="l01313" name="l01313"></a><span class="lineno"> 1313</span> <span class="comment">// NOTE: Only empty vehicles should be in the vehicle_curator_.</span></div>
|
|
<div class="line"><a id="l01314" name="l01314"></a><span class="lineno"> 1314</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(VehicleIsEmpty(vehicle));</div>
|
|
<div class="line"><a id="l01315" name="l01315"></a><span class="lineno"> 1315</span> InsertBetween(node_to_insert, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->Start(vehicle),</div>
|
|
<div class="line"><a id="l01316" name="l01316"></a><span class="lineno"> 1316</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->End(vehicle), vehicle);</div>
|
|
<div class="line"><a id="l01317" name="l01317"></a><span class="lineno"> 1317</span> <span class="keywordflow">return</span> Evaluate(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value();</div>
|
|
<div class="line"><a id="l01318" name="l01318"></a><span class="lineno"> 1318</span> };</div>
|
|
<div class="line"><a id="l01319" name="l01319"></a><span class="lineno"> 1319</span> <span class="comment">// Since the vehicles of the same type are sorted by increasing fixed</span></div>
|
|
<div class="line"><a id="l01320" name="l01320"></a><span class="lineno"> 1320</span> <span class="comment">// cost by the curator, we can stop as soon as an empty vehicle with a fixed</span></div>
|
|
<div class="line"><a id="l01321" name="l01321"></a><span class="lineno"> 1321</span> <span class="comment">// cost higher than the entry_fixed_cost is found, and add new entries for</span></div>
|
|
<div class="line"><a id="l01322" name="l01322"></a><span class="lineno"> 1322</span> <span class="comment">// this new vehicle.</span></div>
|
|
<div class="line"><a id="l01323" name="l01323"></a><span class="lineno"> 1323</span> <span class="keyword">auto</span> stop_and_return_vehicle = [<span class="keyword">this</span>, entry_fixed_cost](<span class="keywordtype">int</span> vehicle) {</div>
|
|
<div class="line"><a id="l01324" name="l01324"></a><span class="lineno"> 1324</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->GetFixedCostOfVehicle(vehicle) > entry_fixed_cost;</div>
|
|
<div class="line"><a id="l01325" name="l01325"></a><span class="lineno"> 1325</span> };</div>
|
|
<div class="line"><a id="l01326" name="l01326"></a><span class="lineno"> 1326</span> <span class="keyword">const</span> <span class="keyword">auto</span> [compatible_vehicle, next_fixed_cost_empty_vehicle] =</div>
|
|
<div class="line"><a id="l01327" name="l01327"></a><span class="lineno"> 1327</span> empty_vehicle_type_curator_->GetCompatibleVehicleOfType(</div>
|
|
<div class="line"><a id="l01328" name="l01328"></a><span class="lineno"> 1328</span> empty_vehicle_type_curator_->Type(entry_vehicle),</div>
|
|
<div class="line"><a id="l01329" name="l01329"></a><span class="lineno"> 1329</span> vehicle_is_compatible, stop_and_return_vehicle);</div>
|
|
<div class="line"><a id="l01330" name="l01330"></a><span class="lineno"> 1330</span> <span class="keywordflow">if</span> (compatible_vehicle >= 0) {</div>
|
|
<div class="line"><a id="l01331" name="l01331"></a><span class="lineno"> 1331</span> <span class="comment">// The node was inserted on this vehicle.</span></div>
|
|
<div class="line"><a id="l01332" name="l01332"></a><span class="lineno"> 1332</span> <span class="keywordflow">if</span> (!UpdatePositions(<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, compatible_vehicle, node_to_insert,</div>
|
|
<div class="line"><a id="l01333" name="l01333"></a><span class="lineno"> 1333</span> all_vehicles, priority_queue,</div>
|
|
<div class="line"><a id="l01334" name="l01334"></a><span class="lineno"> 1334</span> position_to_node_entries)) {</div>
|
|
<div class="line"><a id="l01335" name="l01335"></a><span class="lineno"> 1335</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01336" name="l01336"></a><span class="lineno"> 1336</span> }</div>
|
|
<div class="line"><a id="l01337" name="l01337"></a><span class="lineno"> 1337</span> <span class="keyword">const</span> int64_t compatible_start = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->Start(compatible_vehicle);</div>
|
|
<div class="line"><a id="l01338" name="l01338"></a><span class="lineno"> 1338</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> no_prior_entries_for_this_vehicle =</div>
|
|
<div class="line"><a id="l01339" name="l01339"></a><span class="lineno"> 1339</span> position_to_node_entries->at(compatible_start).empty();</div>
|
|
<div class="line"><a id="l01340" name="l01340"></a><span class="lineno"> 1340</span> <span class="keywordflow">if</span> (!UpdatePositions(<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, compatible_vehicle, compatible_start,</div>
|
|
<div class="line"><a id="l01341" name="l01341"></a><span class="lineno"> 1341</span> all_vehicles, priority_queue,</div>
|
|
<div class="line"><a id="l01342" name="l01342"></a><span class="lineno"> 1342</span> position_to_node_entries)) {</div>
|
|
<div class="line"><a id="l01343" name="l01343"></a><span class="lineno"> 1343</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01344" name="l01344"></a><span class="lineno"> 1344</span> }</div>
|
|
<div class="line"><a id="l01345" name="l01345"></a><span class="lineno"> 1345</span> SetVehicleIndex(node_to_insert, compatible_vehicle);</div>
|
|
<div class="line"><a id="l01346" name="l01346"></a><span class="lineno"> 1346</span> <span class="keywordflow">if</span> (compatible_vehicle != entry_vehicle) {</div>
|
|
<div class="line"><a id="l01347" name="l01347"></a><span class="lineno"> 1347</span> <span class="comment">// The node was inserted on another empty vehicle of the same type</span></div>
|
|
<div class="line"><a id="l01348" name="l01348"></a><span class="lineno"> 1348</span> <span class="comment">// and same fixed cost as entry_vehicle.</span></div>
|
|
<div class="line"><a id="l01349" name="l01349"></a><span class="lineno"> 1349</span> <span class="comment">// Since this vehicle is empty and has the same fixed cost as the</span></div>
|
|
<div class="line"><a id="l01350" name="l01350"></a><span class="lineno"> 1350</span> <span class="comment">// entry_vehicle, it shouldn't be the representative of empty vehicles</span></div>
|
|
<div class="line"><a id="l01351" name="l01351"></a><span class="lineno"> 1351</span> <span class="comment">// for any node in the priority queue.</span></div>
|
|
<div class="line"><a id="l01352" name="l01352"></a><span class="lineno"> 1352</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(no_prior_entries_for_this_vehicle);</div>
|
|
<div class="line"><a id="l01353" name="l01353"></a><span class="lineno"> 1353</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01354" name="l01354"></a><span class="lineno"> 1354</span> }</div>
|
|
<div class="line"><a id="l01355" name="l01355"></a><span class="lineno"> 1355</span> <span class="comment">// The previously unused entry_vehicle is now used, so we use the next</span></div>
|
|
<div class="line"><a id="l01356" name="l01356"></a><span class="lineno"> 1356</span> <span class="comment">// available vehicle of the same type to compute and store insertions on</span></div>
|
|
<div class="line"><a id="l01357" name="l01357"></a><span class="lineno"> 1357</span> <span class="comment">// empty vehicles.</span></div>
|
|
<div class="line"><a id="l01358" name="l01358"></a><span class="lineno"> 1358</span> <span class="keyword">const</span> <span class="keywordtype">int</span> new_empty_vehicle =</div>
|
|
<div class="line"><a id="l01359" name="l01359"></a><span class="lineno"> 1359</span> empty_vehicle_type_curator_->GetLowestFixedCostVehicleOfType(</div>
|
|
<div class="line"><a id="l01360" name="l01360"></a><span class="lineno"> 1360</span> empty_vehicle_type_curator_->Type(compatible_vehicle));</div>
|
|
<div class="line"><a id="l01361" name="l01361"></a><span class="lineno"> 1361</span> </div>
|
|
<div class="line"><a id="l01362" name="l01362"></a><span class="lineno"> 1362</span> <span class="keywordflow">if</span> (new_empty_vehicle >= 0) {</div>
|
|
<div class="line"><a id="l01363" name="l01363"></a><span class="lineno"> 1363</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(VehicleIsEmpty(new_empty_vehicle));</div>
|
|
<div class="line"><a id="l01364" name="l01364"></a><span class="lineno"> 1364</span> <span class="comment">// Add node entries after this vehicle start for uninserted nodes which</span></div>
|
|
<div class="line"><a id="l01365" name="l01365"></a><span class="lineno"> 1365</span> <span class="comment">// don't have entries on this empty vehicle.</span></div>
|
|
<div class="line"><a id="l01366" name="l01366"></a><span class="lineno"> 1366</span> <span class="keywordflow">if</span> (!UpdatePositions(<a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, new_empty_vehicle,</div>
|
|
<div class="line"><a id="l01367" name="l01367"></a><span class="lineno"> 1367</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->Start(new_empty_vehicle), all_vehicles,</div>
|
|
<div class="line"><a id="l01368" name="l01368"></a><span class="lineno"> 1368</span> priority_queue, position_to_node_entries)) {</div>
|
|
<div class="line"><a id="l01369" name="l01369"></a><span class="lineno"> 1369</span> <span class="keywordflow">return</span> <span class="keyword">false</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> }</div>
|
|
<div class="line"><a id="l01372" name="l01372"></a><span class="lineno"> 1372</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (next_fixed_cost_empty_vehicle >= 0) {</div>
|
|
<div class="line"><a id="l01373" name="l01373"></a><span class="lineno"> 1373</span> <span class="comment">// Could not insert on this vehicle or any other vehicle of the same</span></div>
|
|
<div class="line"><a id="l01374" name="l01374"></a><span class="lineno"> 1374</span> <span class="comment">// type with the same fixed cost, but found an empty vehicle of this type</span></div>
|
|
<div class="line"><a id="l01375" name="l01375"></a><span class="lineno"> 1375</span> <span class="comment">// with higher fixed cost.</span></div>
|
|
<div class="line"><a id="l01376" name="l01376"></a><span class="lineno"> 1376</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(VehicleIsEmpty(next_fixed_cost_empty_vehicle));</div>
|
|
<div class="line"><a id="l01377" name="l01377"></a><span class="lineno"> 1377</span> <span class="comment">// Update the insertion entry to be on next_empty_vehicle instead of the</span></div>
|
|
<div class="line"><a id="l01378" name="l01378"></a><span class="lineno"> 1378</span> <span class="comment">// previous entry_vehicle.</span></div>
|
|
<div class="line"><a id="l01379" name="l01379"></a><span class="lineno"> 1379</span> position_to_node_entries->at(node_entry->insert_after()).erase(node_entry);</div>
|
|
<div class="line"><a id="l01380" name="l01380"></a><span class="lineno"> 1380</span> node_entry->set_insert_after(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->Start(next_fixed_cost_empty_vehicle));</div>
|
|
<div class="line"><a id="l01381" name="l01381"></a><span class="lineno"> 1381</span> position_to_node_entries->at(node_entry->insert_after()).insert(node_entry);</div>
|
|
<div class="line"><a id="l01382" name="l01382"></a><span class="lineno"> 1382</span> node_entry->set_vehicle(next_fixed_cost_empty_vehicle);</div>
|
|
<div class="line"><a id="l01383" name="l01383"></a><span class="lineno"> 1383</span> UpdateNodeEntry(node_entry, priority_queue);</div>
|
|
<div class="line"><a id="l01384" name="l01384"></a><span class="lineno"> 1384</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l01385" name="l01385"></a><span class="lineno"> 1385</span> DeleteNodeEntry(node_entry, priority_queue, position_to_node_entries);</div>
|
|
<div class="line"><a id="l01386" name="l01386"></a><span class="lineno"> 1386</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="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01389" name="l01389"></a><span class="lineno"> 1389</span>}</div>
|
|
<div class="line"><a id="l01390" name="l01390"></a><span class="lineno"> 1390</span> </div>
|
|
<div class="line"><a id="l01391" name="l01391"></a><span class="lineno"> 1391</span><span class="keywordtype">bool</span> GlobalCheapestInsertionFilteredHeuristic::SequentialInsertNodes(</div>
|
|
<div class="line"><a id="l01392" name="l01392"></a><span class="lineno"> 1392</span> <span class="keyword">const</span> std::map<int64_t, std::vector<int>>& nodes_by_bucket) {</div>
|
|
<div class="line"><a id="l01393" name="l01393"></a><span class="lineno"> 1393</span> std::vector<bool> is_vehicle_used;</div>
|
|
<div class="line"><a id="l01394" name="l01394"></a><span class="lineno"> 1394</span> absl::flat_hash_set<int> used_vehicles;</div>
|
|
<div class="line"><a id="l01395" name="l01395"></a><span class="lineno"> 1395</span> std::vector<int> unused_vehicles;</div>
|
|
<div class="line"><a id="l01396" name="l01396"></a><span class="lineno"> 1396</span> </div>
|
|
<div class="line"><a id="l01397" name="l01397"></a><span class="lineno"> 1397</span> DetectUsedVehicles(&is_vehicle_used, &unused_vehicles, &used_vehicles);</div>
|
|
<div class="line"><a id="l01398" name="l01398"></a><span class="lineno"> 1398</span> <span class="keywordflow">if</span> (!used_vehicles.empty() &&</div>
|
|
<div class="line"><a id="l01399" name="l01399"></a><span class="lineno"> 1399</span> !InsertNodesOnRoutes(nodes_by_bucket, used_vehicles)) {</div>
|
|
<div class="line"><a id="l01400" name="l01400"></a><span class="lineno"> 1400</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01401" name="l01401"></a><span class="lineno"> 1401</span> }</div>
|
|
<div class="line"><a id="l01402" name="l01402"></a><span class="lineno"> 1402</span> </div>
|
|
<div class="line"><a id="l01403" name="l01403"></a><span class="lineno"> 1403</span> std::vector<std::vector<StartEndValue>> start_end_distances_per_node =</div>
|
|
<div class="line"><a id="l01404" name="l01404"></a><span class="lineno"> 1404</span> ComputeStartEndDistanceForVehicles(unused_vehicles);</div>
|
|
<div class="line"><a id="l01405" name="l01405"></a><span class="lineno"> 1405</span> std::priority_queue<Seed, std::vector<Seed>, std::greater<Seed>></div>
|
|
<div class="line"><a id="l01406" name="l01406"></a><span class="lineno"> 1406</span> first_node_queue;</div>
|
|
<div class="line"><a id="l01407" name="l01407"></a><span class="lineno"> 1407</span> InitializePriorityQueue(&start_end_distances_per_node, &first_node_queue);</div>
|
|
<div class="line"><a id="l01408" name="l01408"></a><span class="lineno"> 1408</span> </div>
|
|
<div class="line"><a id="l01409" name="l01409"></a><span class="lineno"> 1409</span> <span class="keywordtype">int</span> vehicle = InsertSeedNode(&start_end_distances_per_node, &first_node_queue,</div>
|
|
<div class="line"><a id="l01410" name="l01410"></a><span class="lineno"> 1410</span> &is_vehicle_used);</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="keywordflow">while</span> (vehicle >= 0) {</div>
|
|
<div class="line"><a id="l01413" name="l01413"></a><span class="lineno"> 1413</span> <span class="keywordflow">if</span> (!InsertNodesOnRoutes(nodes_by_bucket, {vehicle})) {</div>
|
|
<div class="line"><a id="l01414" name="l01414"></a><span class="lineno"> 1414</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</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> vehicle = InsertSeedNode(&start_end_distances_per_node, &first_node_queue,</div>
|
|
<div class="line"><a id="l01417" name="l01417"></a><span class="lineno"> 1417</span> &is_vehicle_used);</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="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01420" name="l01420"></a><span class="lineno"> 1420</span>}</div>
|
|
<div class="line"><a id="l01421" name="l01421"></a><span class="lineno"> 1421</span> </div>
|
|
<div class="line"><a id="l01422" name="l01422"></a><span class="lineno"> 1422</span><span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::DetectUsedVehicles(</div>
|
|
<div class="line"><a id="l01423" name="l01423"></a><span class="lineno"> 1423</span> std::vector<bool>* is_vehicle_used, std::vector<int>* unused_vehicles,</div>
|
|
<div class="line"><a id="l01424" name="l01424"></a><span class="lineno"> 1424</span> absl::flat_hash_set<int>* used_vehicles) {</div>
|
|
<div class="line"><a id="l01425" name="l01425"></a><span class="lineno"> 1425</span> is_vehicle_used->clear();</div>
|
|
<div class="line"><a id="l01426" name="l01426"></a><span class="lineno"> 1426</span> is_vehicle_used->resize(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->vehicles());</div>
|
|
<div class="line"><a id="l01427" name="l01427"></a><span class="lineno"> 1427</span> </div>
|
|
<div class="line"><a id="l01428" name="l01428"></a><span class="lineno"> 1428</span> used_vehicles->clear();</div>
|
|
<div class="line"><a id="l01429" name="l01429"></a><span class="lineno"> 1429</span> used_vehicles->reserve(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->vehicles());</div>
|
|
<div class="line"><a id="l01430" name="l01430"></a><span class="lineno"> 1430</span> </div>
|
|
<div class="line"><a id="l01431" name="l01431"></a><span class="lineno"> 1431</span> unused_vehicles->clear();</div>
|
|
<div class="line"><a id="l01432" name="l01432"></a><span class="lineno"> 1432</span> unused_vehicles->reserve(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->vehicles());</div>
|
|
<div class="line"><a id="l01433" name="l01433"></a><span class="lineno"> 1433</span> </div>
|
|
<div class="line"><a id="l01434" name="l01434"></a><span class="lineno"> 1434</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->vehicles(); vehicle++) {</div>
|
|
<div class="line"><a id="l01435" name="l01435"></a><span class="lineno"> 1435</span> <span class="keywordflow">if</span> (!VehicleIsEmpty(vehicle)) {</div>
|
|
<div class="line"><a id="l01436" name="l01436"></a><span class="lineno"> 1436</span> (*is_vehicle_used)[vehicle] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01437" name="l01437"></a><span class="lineno"> 1437</span> used_vehicles->insert(vehicle);</div>
|
|
<div class="line"><a id="l01438" name="l01438"></a><span class="lineno"> 1438</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l01439" name="l01439"></a><span class="lineno"> 1439</span> (*is_vehicle_used)[vehicle] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01440" name="l01440"></a><span class="lineno"> 1440</span> unused_vehicles->push_back(vehicle);</div>
|
|
<div class="line"><a id="l01441" name="l01441"></a><span class="lineno"> 1441</span> }</div>
|
|
<div class="line"><a id="l01442" name="l01442"></a><span class="lineno"> 1442</span> }</div>
|
|
<div class="line"><a id="l01443" name="l01443"></a><span class="lineno"> 1443</span>}</div>
|
|
<div class="line"><a id="l01444" name="l01444"></a><span class="lineno"> 1444</span> </div>
|
|
<div class="line"><a id="l01445" name="l01445"></a><span class="lineno"> 1445</span><span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::InsertFarthestNodesAsSeeds() {</div>
|
|
<div class="line"><a id="l01446" name="l01446"></a><span class="lineno"> 1446</span> <span class="keywordflow">if</span> (gci_params_.farthest_seeds_ratio <= 0) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l01447" name="l01447"></a><span class="lineno"> 1447</span> <span class="comment">// Insert at least 1 farthest Seed if the parameter is positive.</span></div>
|
|
<div class="line"><a id="l01448" name="l01448"></a><span class="lineno"> 1448</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_seeds = <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(</div>
|
|
<div class="line"><a id="l01449" name="l01449"></a><span class="lineno"> 1449</span> std::ceil(gci_params_.farthest_seeds_ratio * <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->vehicles()));</div>
|
|
<div class="line"><a id="l01450" name="l01450"></a><span class="lineno"> 1450</span> </div>
|
|
<div class="line"><a id="l01451" name="l01451"></a><span class="lineno"> 1451</span> std::vector<bool> is_vehicle_used;</div>
|
|
<div class="line"><a id="l01452" name="l01452"></a><span class="lineno"> 1452</span> absl::flat_hash_set<int> used_vehicles;</div>
|
|
<div class="line"><a id="l01453" name="l01453"></a><span class="lineno"> 1453</span> std::vector<int> unused_vehicles;</div>
|
|
<div class="line"><a id="l01454" name="l01454"></a><span class="lineno"> 1454</span> DetectUsedVehicles(&is_vehicle_used, &unused_vehicles, &used_vehicles);</div>
|
|
<div class="line"><a id="l01455" name="l01455"></a><span class="lineno"> 1455</span> std::vector<std::vector<StartEndValue>> start_end_distances_per_node =</div>
|
|
<div class="line"><a id="l01456" name="l01456"></a><span class="lineno"> 1456</span> ComputeStartEndDistanceForVehicles(unused_vehicles);</div>
|
|
<div class="line"><a id="l01457" name="l01457"></a><span class="lineno"> 1457</span> </div>
|
|
<div class="line"><a id="l01458" name="l01458"></a><span class="lineno"> 1458</span> <span class="comment">// Priority queue where the Seeds with a larger distance are given higher</span></div>
|
|
<div class="line"><a id="l01459" name="l01459"></a><span class="lineno"> 1459</span> <span class="comment">// priority.</span></div>
|
|
<div class="line"><a id="l01460" name="l01460"></a><span class="lineno"> 1460</span> std::priority_queue<Seed> farthest_node_queue;</div>
|
|
<div class="line"><a id="l01461" name="l01461"></a><span class="lineno"> 1461</span> InitializePriorityQueue(&start_end_distances_per_node, &farthest_node_queue);</div>
|
|
<div class="line"><a id="l01462" name="l01462"></a><span class="lineno"> 1462</span> </div>
|
|
<div class="line"><a id="l01463" name="l01463"></a><span class="lineno"> 1463</span> <span class="keywordtype">int</span> inserted_seeds = 0;</div>
|
|
<div class="line"><a id="l01464" name="l01464"></a><span class="lineno"> 1464</span> <span class="keywordflow">while</span> (inserted_seeds++ < num_seeds) {</div>
|
|
<div class="line"><a id="l01465" name="l01465"></a><span class="lineno"> 1465</span> <span class="keywordflow">if</span> (InsertSeedNode(&start_end_distances_per_node, &farthest_node_queue,</div>
|
|
<div class="line"><a id="l01466" name="l01466"></a><span class="lineno"> 1466</span> &is_vehicle_used) < 0) {</div>
|
|
<div class="line"><a id="l01467" name="l01467"></a><span class="lineno"> 1467</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l01468" name="l01468"></a><span class="lineno"> 1468</span> }</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> </div>
|
|
<div class="line"><a id="l01471" name="l01471"></a><span class="lineno"> 1471</span> <span class="comment">// NOTE: As we don't use the empty_vehicle_type_curator_ when inserting seed</span></div>
|
|
<div class="line"><a id="l01472" name="l01472"></a><span class="lineno"> 1472</span> <span class="comment">// nodes on routes, some previously empty vehicles may now be used, so we</span></div>
|
|
<div class="line"><a id="l01473" name="l01473"></a><span class="lineno"> 1473</span> <span class="comment">// update the curator accordingly to ensure it still only stores empty</span></div>
|
|
<div class="line"><a id="l01474" name="l01474"></a><span class="lineno"> 1474</span> <span class="comment">// vehicles.</span></div>
|
|
<div class="line"><a id="l01475" name="l01475"></a><span class="lineno"> 1475</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(empty_vehicle_type_curator_ != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l01476" name="l01476"></a><span class="lineno"> 1476</span> empty_vehicle_type_curator_->Update(</div>
|
|
<div class="line"><a id="l01477" name="l01477"></a><span class="lineno"> 1477</span> [<span class="keyword">this</span>](<span class="keywordtype">int</span> vehicle) { <span class="keywordflow">return</span> !VehicleIsEmpty(vehicle); });</div>
|
|
<div class="line"><a id="l01478" name="l01478"></a><span class="lineno"> 1478</span>}</div>
|
|
<div class="line"><a id="l01479" name="l01479"></a><span class="lineno"> 1479</span> </div>
|
|
<div class="line"><a id="l01480" name="l01480"></a><span class="lineno"> 1480</span><span class="keyword">template</span> <<span class="keyword">class</span> Queue></div>
|
|
<div class="line"><a id="l01481" name="l01481"></a><span class="lineno"> 1481</span><span class="keywordtype">int</span> GlobalCheapestInsertionFilteredHeuristic::InsertSeedNode(</div>
|
|
<div class="line"><a id="l01482" name="l01482"></a><span class="lineno"> 1482</span> std::vector<std::vector<StartEndValue>>* start_end_distances_per_node,</div>
|
|
<div class="line"><a id="l01483" name="l01483"></a><span class="lineno"> 1483</span> Queue* priority_queue, std::vector<bool>* is_vehicle_used) {</div>
|
|
<div class="line"><a id="l01484" name="l01484"></a><span class="lineno"> 1484</span> <span class="keywordflow">while</span> (!priority_queue->empty()) {</div>
|
|
<div class="line"><a id="l01485" name="l01485"></a><span class="lineno"> 1485</span> <span class="keywordflow">if</span> (StopSearch()) <span class="keywordflow">return</span> -1;</div>
|
|
<div class="line"><a id="l01486" name="l01486"></a><span class="lineno"> 1486</span> <span class="keyword">const</span> Seed& seed = priority_queue->top();</div>
|
|
<div class="line"><a id="l01487" name="l01487"></a><span class="lineno"> 1487</span> </div>
|
|
<div class="line"><a id="l01488" name="l01488"></a><span class="lineno"> 1488</span> <span class="keyword">const</span> <span class="keywordtype">int</span> seed_node = seed.second;</div>
|
|
<div class="line"><a id="l01489" name="l01489"></a><span class="lineno"> 1489</span> <span class="keyword">const</span> <span class="keywordtype">int</span> seed_vehicle = seed.first.vehicle;</div>
|
|
<div class="line"><a id="l01490" name="l01490"></a><span class="lineno"> 1490</span> </div>
|
|
<div class="line"><a id="l01491" name="l01491"></a><span class="lineno"> 1491</span> std::vector<StartEndValue>& other_start_end_values =</div>
|
|
<div class="line"><a id="l01492" name="l01492"></a><span class="lineno"> 1492</span> (*start_end_distances_per_node)[seed_node];</div>
|
|
<div class="line"><a id="l01493" name="l01493"></a><span class="lineno"> 1493</span> </div>
|
|
<div class="line"><a id="l01494" name="l01494"></a><span class="lineno"> 1494</span> <span class="keywordflow">if</span> (Contains(seed_node)) {</div>
|
|
<div class="line"><a id="l01495" name="l01495"></a><span class="lineno"> 1495</span> <span class="comment">// The node is already inserted, it is therefore no longer considered as</span></div>
|
|
<div class="line"><a id="l01496" name="l01496"></a><span class="lineno"> 1496</span> <span class="comment">// a potential seed.</span></div>
|
|
<div class="line"><a id="l01497" name="l01497"></a><span class="lineno"> 1497</span> priority_queue->pop();</div>
|
|
<div class="line"><a id="l01498" name="l01498"></a><span class="lineno"> 1498</span> other_start_end_values.clear();</div>
|
|
<div class="line"><a id="l01499" name="l01499"></a><span class="lineno"> 1499</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01500" name="l01500"></a><span class="lineno"> 1500</span> }</div>
|
|
<div class="line"><a id="l01501" name="l01501"></a><span class="lineno"> 1501</span> <span class="keywordflow">if</span> (!(*is_vehicle_used)[seed_vehicle]) {</div>
|
|
<div class="line"><a id="l01502" name="l01502"></a><span class="lineno"> 1502</span> <span class="comment">// Try to insert this seed_node on this vehicle's route.</span></div>
|
|
<div class="line"><a id="l01503" name="l01503"></a><span class="lineno"> 1503</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a> = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->Start(seed_vehicle);</div>
|
|
<div class="line"><a id="l01504" name="l01504"></a><span class="lineno"> 1504</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a> = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->End(seed_vehicle);</div>
|
|
<div class="line"><a id="l01505" name="l01505"></a><span class="lineno"> 1505</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(<a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984">Value</a>(<a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>), <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>);</div>
|
|
<div class="line"><a id="l01506" name="l01506"></a><span class="lineno"> 1506</span> InsertBetween(seed_node, <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>, <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>, seed_vehicle);</div>
|
|
<div class="line"><a id="l01507" name="l01507"></a><span class="lineno"> 1507</span> <span class="keywordflow">if</span> (Evaluate(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value()) {</div>
|
|
<div class="line"><a id="l01508" name="l01508"></a><span class="lineno"> 1508</span> priority_queue->pop();</div>
|
|
<div class="line"><a id="l01509" name="l01509"></a><span class="lineno"> 1509</span> (*is_vehicle_used)[seed_vehicle] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01510" name="l01510"></a><span class="lineno"> 1510</span> other_start_end_values.clear();</div>
|
|
<div class="line"><a id="l01511" name="l01511"></a><span class="lineno"> 1511</span> SetVehicleIndex(seed_node, seed_vehicle);</div>
|
|
<div class="line"><a id="l01512" name="l01512"></a><span class="lineno"> 1512</span> <span class="keywordflow">return</span> seed_vehicle;</div>
|
|
<div class="line"><a id="l01513" name="l01513"></a><span class="lineno"> 1513</span> }</div>
|
|
<div class="line"><a id="l01514" name="l01514"></a><span class="lineno"> 1514</span> }</div>
|
|
<div class="line"><a id="l01515" name="l01515"></a><span class="lineno"> 1515</span> <span class="comment">// Either the vehicle is already used, or the Commit() wasn't successful.</span></div>
|
|
<div class="line"><a id="l01516" name="l01516"></a><span class="lineno"> 1516</span> <span class="comment">// In both cases, we remove this Seed from the priority queue, and insert</span></div>
|
|
<div class="line"><a id="l01517" name="l01517"></a><span class="lineno"> 1517</span> <span class="comment">// the next StartEndValue from start_end_distances_per_node[seed_node]</span></div>
|
|
<div class="line"><a id="l01518" name="l01518"></a><span class="lineno"> 1518</span> <span class="comment">// in the priority queue.</span></div>
|
|
<div class="line"><a id="l01519" name="l01519"></a><span class="lineno"> 1519</span> priority_queue->pop();</div>
|
|
<div class="line"><a id="l01520" name="l01520"></a><span class="lineno"> 1520</span> <span class="keywordflow">if</span> (!other_start_end_values.empty()) {</div>
|
|
<div class="line"><a id="l01521" name="l01521"></a><span class="lineno"> 1521</span> <span class="keyword">const</span> StartEndValue& next_seed_value = other_start_end_values.back();</div>
|
|
<div class="line"><a id="l01522" name="l01522"></a><span class="lineno"> 1522</span> priority_queue->push(std::make_pair(next_seed_value, seed_node));</div>
|
|
<div class="line"><a id="l01523" name="l01523"></a><span class="lineno"> 1523</span> other_start_end_values.pop_back();</div>
|
|
<div class="line"><a id="l01524" name="l01524"></a><span class="lineno"> 1524</span> }</div>
|
|
<div class="line"><a id="l01525" name="l01525"></a><span class="lineno"> 1525</span> }</div>
|
|
<div class="line"><a id="l01526" name="l01526"></a><span class="lineno"> 1526</span> <span class="comment">// No seed node was inserted.</span></div>
|
|
<div class="line"><a id="l01527" name="l01527"></a><span class="lineno"> 1527</span> <span class="keywordflow">return</span> -1;</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> </div>
|
|
<div class="line"><a id="l01530" name="l01530"></a><span class="lineno"> 1530</span><span class="keywordtype">bool</span> GlobalCheapestInsertionFilteredHeuristic::InitializePairPositions(</div>
|
|
<div class="line"><a id="l01531" name="l01531"></a><span class="lineno"> 1531</span> <span class="keyword">const</span> std::vector<int>& pair_indices,</div>
|
|
<div class="line"><a id="l01532" name="l01532"></a><span class="lineno"> 1532</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a id="l01533" name="l01533"></a><span class="lineno"> 1533</span> GlobalCheapestInsertionFilteredHeuristic::PairEntry>* priority_queue,</div>
|
|
<div class="line"><a id="l01534" name="l01534"></a><span class="lineno"> 1534</span> std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a id="l01535" name="l01535"></a><span class="lineno"> 1535</span> pickup_to_entries,</div>
|
|
<div class="line"><a id="l01536" name="l01536"></a><span class="lineno"> 1536</span> std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a id="l01537" name="l01537"></a><span class="lineno"> 1537</span> delivery_to_entries) {</div>
|
|
<div class="line"><a id="l01538" name="l01538"></a><span class="lineno"> 1538</span> priority_queue->Clear();</div>
|
|
<div class="line"><a id="l01539" name="l01539"></a><span class="lineno"> 1539</span> pickup_to_entries->clear();</div>
|
|
<div class="line"><a id="l01540" name="l01540"></a><span class="lineno"> 1540</span> pickup_to_entries->resize(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->Size());</div>
|
|
<div class="line"><a id="l01541" name="l01541"></a><span class="lineno"> 1541</span> delivery_to_entries->clear();</div>
|
|
<div class="line"><a id="l01542" name="l01542"></a><span class="lineno"> 1542</span> delivery_to_entries->resize(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->Size());</div>
|
|
<div class="line"><a id="l01543" name="l01543"></a><span class="lineno"> 1543</span> <span class="keyword">const</span> RoutingModel::IndexPairs& pickup_delivery_pairs =</div>
|
|
<div class="line"><a id="l01544" name="l01544"></a><span class="lineno"> 1544</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->GetPickupAndDeliveryPairs();</div>
|
|
<div class="line"><a id="l01545" name="l01545"></a><span class="lineno"> 1545</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a> : pair_indices) {</div>
|
|
<div class="line"><a id="l01546" name="l01546"></a><span class="lineno"> 1546</span> <span class="keyword">const</span> RoutingModel::IndexPair& index_pair = pickup_delivery_pairs[<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>];</div>
|
|
<div class="line"><a id="l01547" name="l01547"></a><span class="lineno"> 1547</span> <span class="keywordflow">for</span> (int64_t pickup : index_pair.first) {</div>
|
|
<div class="line"><a id="l01548" name="l01548"></a><span class="lineno"> 1548</span> <span class="keywordflow">if</span> (Contains(pickup)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01549" name="l01549"></a><span class="lineno"> 1549</span> <span class="keywordflow">for</span> (int64_t delivery : index_pair.second) {</div>
|
|
<div class="line"><a id="l01550" name="l01550"></a><span class="lineno"> 1550</span> <span class="keywordflow">if</span> (Contains(delivery)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01551" name="l01551"></a><span class="lineno"> 1551</span> <span class="keywordflow">if</span> (StopSearchAndCleanup(priority_queue)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01552" name="l01552"></a><span class="lineno"> 1552</span> <span class="comment">// Add insertion entry making pair unperformed. When the pair is part</span></div>
|
|
<div class="line"><a id="l01553" name="l01553"></a><span class="lineno"> 1553</span> <span class="comment">// of a disjunction we do not try to make any of its pairs unperformed</span></div>
|
|
<div class="line"><a id="l01554" name="l01554"></a><span class="lineno"> 1554</span> <span class="comment">// as it requires having an entry with all pairs being unperformed.</span></div>
|
|
<div class="line"><a id="l01555" name="l01555"></a><span class="lineno"> 1555</span> <span class="comment">// TODO(user): Adapt the code to make pair disjunctions unperformed.</span></div>
|
|
<div class="line"><a id="l01556" name="l01556"></a><span class="lineno"> 1556</span> <span class="keywordflow">if</span> (gci_params_.add_unperformed_entries &&</div>
|
|
<div class="line"><a id="l01557" name="l01557"></a><span class="lineno"> 1557</span> index_pair.first.size() == 1 && index_pair.second.size() == 1 &&</div>
|
|
<div class="line"><a id="l01558" name="l01558"></a><span class="lineno"> 1558</span> GetUnperformedValue(pickup) !=</div>
|
|
<div class="line"><a id="l01559" name="l01559"></a><span class="lineno"> 1559</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>() &&</div>
|
|
<div class="line"><a id="l01560" name="l01560"></a><span class="lineno"> 1560</span> GetUnperformedValue(delivery) !=</div>
|
|
<div class="line"><a id="l01561" name="l01561"></a><span class="lineno"> 1561</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div>
|
|
<div class="line"><a id="l01562" name="l01562"></a><span class="lineno"> 1562</span> AddPairEntry(pickup, -1, delivery, -1, -1, priority_queue, <span class="keyword">nullptr</span>,</div>
|
|
<div class="line"><a id="l01563" name="l01563"></a><span class="lineno"> 1563</span> <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l01564" name="l01564"></a><span class="lineno"> 1564</span> }</div>
|
|
<div class="line"><a id="l01565" name="l01565"></a><span class="lineno"> 1565</span> <span class="comment">// Add all other insertion entries with pair performed.</span></div>
|
|
<div class="line"><a id="l01566" name="l01566"></a><span class="lineno"> 1566</span> InitializeInsertionEntriesPerformingPair(</div>
|
|
<div class="line"><a id="l01567" name="l01567"></a><span class="lineno"> 1567</span> pickup, delivery, priority_queue, pickup_to_entries,</div>
|
|
<div class="line"><a id="l01568" name="l01568"></a><span class="lineno"> 1568</span> delivery_to_entries);</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> }</div>
|
|
<div class="line"><a id="l01571" name="l01571"></a><span class="lineno"> 1571</span> }</div>
|
|
<div class="line"><a id="l01572" name="l01572"></a><span class="lineno"> 1572</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01573" name="l01573"></a><span class="lineno"> 1573</span>}</div>
|
|
<div class="line"><a id="l01574" name="l01574"></a><span class="lineno"> 1574</span> </div>
|
|
<div class="line"><a id="l01575" name="l01575"></a><span class="lineno"> 1575</span><span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::</div>
|
|
<div class="line"><a id="l01576" name="l01576"></a><span class="lineno"> 1576</span> InitializeInsertionEntriesPerformingPair(</div>
|
|
<div class="line"><a id="l01577" name="l01577"></a><span class="lineno"> 1577</span> int64_t pickup, int64_t delivery,</div>
|
|
<div class="line"><a id="l01578" name="l01578"></a><span class="lineno"> 1578</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a id="l01579" name="l01579"></a><span class="lineno"> 1579</span> GlobalCheapestInsertionFilteredHeuristic::PairEntry>*</div>
|
|
<div class="line"><a id="l01580" name="l01580"></a><span class="lineno"> 1580</span> priority_queue,</div>
|
|
<div class="line"><a id="l01581" name="l01581"></a><span class="lineno"> 1581</span> std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a id="l01582" name="l01582"></a><span class="lineno"> 1582</span> pickup_to_entries,</div>
|
|
<div class="line"><a id="l01583" name="l01583"></a><span class="lineno"> 1583</span> std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a id="l01584" name="l01584"></a><span class="lineno"> 1584</span> delivery_to_entries) {</div>
|
|
<div class="line"><a id="l01585" name="l01585"></a><span class="lineno"> 1585</span> <span class="keywordflow">if</span> (!gci_params_.use_neighbors_ratio_for_initialization) {</div>
|
|
<div class="line"><a id="l01586" name="l01586"></a><span class="lineno"> 1586</span> <span class="keyword">struct </span>PairInsertion {</div>
|
|
<div class="line"><a id="l01587" name="l01587"></a><span class="lineno"> 1587</span> int64_t insert_pickup_after;</div>
|
|
<div class="line"><a id="l01588" name="l01588"></a><span class="lineno"> 1588</span> int64_t insert_delivery_after;</div>
|
|
<div class="line"><a id="l01589" name="l01589"></a><span class="lineno"> 1589</span> <span class="keywordtype">int</span> vehicle;</div>
|
|
<div class="line"><a id="l01590" name="l01590"></a><span class="lineno"> 1590</span> };</div>
|
|
<div class="line"><a id="l01591" name="l01591"></a><span class="lineno"> 1591</span> std::vector<PairInsertion> pair_insertions;</div>
|
|
<div class="line"><a id="l01592" name="l01592"></a><span class="lineno"> 1592</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->vehicles(); ++vehicle) {</div>
|
|
<div class="line"><a id="l01593" name="l01593"></a><span class="lineno"> 1593</span> <span class="keywordflow">if</span> (VehicleIsEmpty(vehicle) &&</div>
|
|
<div class="line"><a id="l01594" name="l01594"></a><span class="lineno"> 1594</span> empty_vehicle_type_curator_->GetLowestFixedCostVehicleOfType(</div>
|
|
<div class="line"><a id="l01595" name="l01595"></a><span class="lineno"> 1595</span> empty_vehicle_type_curator_->Type(vehicle)) != vehicle) {</div>
|
|
<div class="line"><a id="l01596" name="l01596"></a><span class="lineno"> 1596</span> <span class="comment">// We only consider the least expensive empty vehicle of each type for</span></div>
|
|
<div class="line"><a id="l01597" name="l01597"></a><span class="lineno"> 1597</span> <span class="comment">// entries.</span></div>
|
|
<div class="line"><a id="l01598" name="l01598"></a><span class="lineno"> 1598</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01599" name="l01599"></a><span class="lineno"> 1599</span> }</div>
|
|
<div class="line"><a id="l01600" name="l01600"></a><span class="lineno"> 1600</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a> = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->Start(vehicle);</div>
|
|
<div class="line"><a id="l01601" name="l01601"></a><span class="lineno"> 1601</span> std::vector<NodeInsertion> pickup_insertions;</div>
|
|
<div class="line"><a id="l01602" name="l01602"></a><span class="lineno"> 1602</span> AppendInsertionPositionsAfter(pickup, <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>, <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984">Value</a>(<a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>), vehicle,</div>
|
|
<div class="line"><a id="l01603" name="l01603"></a><span class="lineno"> 1603</span> &pickup_insertions);</div>
|
|
<div class="line"><a id="l01604" name="l01604"></a><span class="lineno"> 1604</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> [insert_pickup_after, pickup_vehicle,</div>
|
|
<div class="line"><a id="l01605" name="l01605"></a><span class="lineno"> 1605</span> unused_pickup_value] : pickup_insertions) {</div>
|
|
<div class="line"><a id="l01606" name="l01606"></a><span class="lineno"> 1606</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->IsEnd(insert_pickup_after));</div>
|
|
<div class="line"><a id="l01607" name="l01607"></a><span class="lineno"> 1607</span> std::vector<NodeInsertion> delivery_insertions;</div>
|
|
<div class="line"><a id="l01608" name="l01608"></a><span class="lineno"> 1608</span> AppendInsertionPositionsAfter(delivery, pickup,</div>
|
|
<div class="line"><a id="l01609" name="l01609"></a><span class="lineno"> 1609</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984">Value</a>(insert_pickup_after), vehicle,</div>
|
|
<div class="line"><a id="l01610" name="l01610"></a><span class="lineno"> 1610</span> &delivery_insertions);</div>
|
|
<div class="line"><a id="l01611" name="l01611"></a><span class="lineno"> 1611</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> [insert_delivery_after, delivery_vehicle,</div>
|
|
<div class="line"><a id="l01612" name="l01612"></a><span class="lineno"> 1612</span> unused_delivery_value] : delivery_insertions) {</div>
|
|
<div class="line"><a id="l01613" name="l01613"></a><span class="lineno"> 1613</span> pair_insertions.push_back(</div>
|
|
<div class="line"><a id="l01614" name="l01614"></a><span class="lineno"> 1614</span> {insert_pickup_after, insert_delivery_after, vehicle});</div>
|
|
<div class="line"><a id="l01615" name="l01615"></a><span class="lineno"> 1615</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> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& [insert_pickup_after, insert_delivery_after, vehicle] :</div>
|
|
<div class="line"><a id="l01619" name="l01619"></a><span class="lineno"> 1619</span> pair_insertions) {</div>
|
|
<div class="line"><a id="l01620" name="l01620"></a><span class="lineno"> 1620</span> <a class="code hl_define" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(insert_pickup_after, insert_delivery_after);</div>
|
|
<div class="line"><a id="l01621" name="l01621"></a><span class="lineno"> 1621</span> AddPairEntry(pickup, insert_pickup_after, delivery, insert_delivery_after,</div>
|
|
<div class="line"><a id="l01622" name="l01622"></a><span class="lineno"> 1622</span> vehicle, priority_queue, pickup_to_entries,</div>
|
|
<div class="line"><a id="l01623" name="l01623"></a><span class="lineno"> 1623</span> delivery_to_entries);</div>
|
|
<div class="line"><a id="l01624" name="l01624"></a><span class="lineno"> 1624</span> }</div>
|
|
<div class="line"><a id="l01625" name="l01625"></a><span class="lineno"> 1625</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l01626" name="l01626"></a><span class="lineno"> 1626</span> }</div>
|
|
<div class="line"><a id="l01627" name="l01627"></a><span class="lineno"> 1627</span> </div>
|
|
<div class="line"><a id="l01628" name="l01628"></a><span class="lineno"> 1628</span> <span class="comment">// We're only considering the closest neighbors as insertion positions for</span></div>
|
|
<div class="line"><a id="l01629" name="l01629"></a><span class="lineno"> 1629</span> <span class="comment">// the pickup/delivery pair.</span></div>
|
|
<div class="line"><a id="l01630" name="l01630"></a><span class="lineno"> 1630</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> cost_class = 0; cost_class < <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->GetCostClassesCount();</div>
|
|
<div class="line"><a id="l01631" name="l01631"></a><span class="lineno"> 1631</span> cost_class++) {</div>
|
|
<div class="line"><a id="l01632" name="l01632"></a><span class="lineno"> 1632</span> absl::flat_hash_set<std::pair<int64_t, int64_t>></div>
|
|
<div class="line"><a id="l01633" name="l01633"></a><span class="lineno"> 1633</span> existing_insertion_positions;</div>
|
|
<div class="line"><a id="l01634" name="l01634"></a><span class="lineno"> 1634</span> <span class="comment">// Explore the neighborhood of the pickup.</span></div>
|
|
<div class="line"><a id="l01635" name="l01635"></a><span class="lineno"> 1635</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t pickup_insert_after :</div>
|
|
<div class="line"><a id="l01636" name="l01636"></a><span class="lineno"> 1636</span> GetNeighborsOfNodeForCostClass(cost_class, pickup)) {</div>
|
|
<div class="line"><a id="l01637" name="l01637"></a><span class="lineno"> 1637</span> <span class="keywordflow">if</span> (!Contains(pickup_insert_after)) {</div>
|
|
<div class="line"><a id="l01638" name="l01638"></a><span class="lineno"> 1638</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01639" name="l01639"></a><span class="lineno"> 1639</span> }</div>
|
|
<div class="line"><a id="l01640" name="l01640"></a><span class="lineno"> 1640</span> <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = node_index_to_vehicle_[pickup_insert_after];</div>
|
|
<div class="line"><a id="l01641" name="l01641"></a><span class="lineno"> 1641</span> <span class="keywordflow">if</span> (vehicle < 0 ||</div>
|
|
<div class="line"><a id="l01642" name="l01642"></a><span class="lineno"> 1642</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->GetCostClassIndexOfVehicle(vehicle).value() != cost_class) {</div>
|
|
<div class="line"><a id="l01643" name="l01643"></a><span class="lineno"> 1643</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01644" name="l01644"></a><span class="lineno"> 1644</span> }</div>
|
|
<div class="line"><a id="l01645" name="l01645"></a><span class="lineno"> 1645</span> </div>
|
|
<div class="line"><a id="l01646" name="l01646"></a><span class="lineno"> 1646</span> <span class="keywordflow">if</span> (VehicleIsEmpty(vehicle) &&</div>
|
|
<div class="line"><a id="l01647" name="l01647"></a><span class="lineno"> 1647</span> empty_vehicle_type_curator_->GetLowestFixedCostVehicleOfType(</div>
|
|
<div class="line"><a id="l01648" name="l01648"></a><span class="lineno"> 1648</span> empty_vehicle_type_curator_->Type(vehicle)) != vehicle) {</div>
|
|
<div class="line"><a id="l01649" name="l01649"></a><span class="lineno"> 1649</span> <span class="comment">// We only consider the least expensive empty vehicle of each type for</span></div>
|
|
<div class="line"><a id="l01650" name="l01650"></a><span class="lineno"> 1650</span> <span class="comment">// entries.</span></div>
|
|
<div class="line"><a id="l01651" name="l01651"></a><span class="lineno"> 1651</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01652" name="l01652"></a><span class="lineno"> 1652</span> }</div>
|
|
<div class="line"><a id="l01653" name="l01653"></a><span class="lineno"> 1653</span> </div>
|
|
<div class="line"><a id="l01654" name="l01654"></a><span class="lineno"> 1654</span> int64_t delivery_insert_after = pickup;</div>
|
|
<div class="line"><a id="l01655" name="l01655"></a><span class="lineno"> 1655</span> <span class="keywordflow">while</span> (!<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->IsEnd(delivery_insert_after)) {</div>
|
|
<div class="line"><a id="l01656" name="l01656"></a><span class="lineno"> 1656</span> <span class="keyword">const</span> std::pair<int64_t, int64_t> insertion_position = {</div>
|
|
<div class="line"><a id="l01657" name="l01657"></a><span class="lineno"> 1657</span> pickup_insert_after, delivery_insert_after};</div>
|
|
<div class="line"><a id="l01658" name="l01658"></a><span class="lineno"> 1658</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!existing_insertion_positions.contains(insertion_position));</div>
|
|
<div class="line"><a id="l01659" name="l01659"></a><span class="lineno"> 1659</span> existing_insertion_positions.insert(insertion_position);</div>
|
|
<div class="line"><a id="l01660" name="l01660"></a><span class="lineno"> 1660</span> </div>
|
|
<div class="line"><a id="l01661" name="l01661"></a><span class="lineno"> 1661</span> AddPairEntry(pickup, pickup_insert_after, delivery,</div>
|
|
<div class="line"><a id="l01662" name="l01662"></a><span class="lineno"> 1662</span> delivery_insert_after, vehicle, priority_queue,</div>
|
|
<div class="line"><a id="l01663" name="l01663"></a><span class="lineno"> 1663</span> pickup_to_entries, delivery_to_entries);</div>
|
|
<div class="line"><a id="l01664" name="l01664"></a><span class="lineno"> 1664</span> delivery_insert_after = (delivery_insert_after == pickup)</div>
|
|
<div class="line"><a id="l01665" name="l01665"></a><span class="lineno"> 1665</span> ? <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984">Value</a>(pickup_insert_after)</div>
|
|
<div class="line"><a id="l01666" name="l01666"></a><span class="lineno"> 1666</span> : <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984">Value</a>(delivery_insert_after);</div>
|
|
<div class="line"><a id="l01667" name="l01667"></a><span class="lineno"> 1667</span> }</div>
|
|
<div class="line"><a id="l01668" name="l01668"></a><span class="lineno"> 1668</span> }</div>
|
|
<div class="line"><a id="l01669" name="l01669"></a><span class="lineno"> 1669</span> </div>
|
|
<div class="line"><a id="l01670" name="l01670"></a><span class="lineno"> 1670</span> <span class="comment">// Explore the neighborhood of the delivery.</span></div>
|
|
<div class="line"><a id="l01671" name="l01671"></a><span class="lineno"> 1671</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t delivery_insert_after :</div>
|
|
<div class="line"><a id="l01672" name="l01672"></a><span class="lineno"> 1672</span> GetNeighborsOfNodeForCostClass(cost_class, delivery)) {</div>
|
|
<div class="line"><a id="l01673" name="l01673"></a><span class="lineno"> 1673</span> <span class="keywordflow">if</span> (!Contains(delivery_insert_after)) {</div>
|
|
<div class="line"><a id="l01674" name="l01674"></a><span class="lineno"> 1674</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01675" name="l01675"></a><span class="lineno"> 1675</span> }</div>
|
|
<div class="line"><a id="l01676" name="l01676"></a><span class="lineno"> 1676</span> <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = node_index_to_vehicle_[delivery_insert_after];</div>
|
|
<div class="line"><a id="l01677" name="l01677"></a><span class="lineno"> 1677</span> <span class="keywordflow">if</span> (vehicle < 0 ||</div>
|
|
<div class="line"><a id="l01678" name="l01678"></a><span class="lineno"> 1678</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->GetCostClassIndexOfVehicle(vehicle).<a class="code hl_variable" href="routing__search_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>() != cost_class) {</div>
|
|
<div class="line"><a id="l01679" name="l01679"></a><span class="lineno"> 1679</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01680" name="l01680"></a><span class="lineno"> 1680</span> }</div>
|
|
<div class="line"><a id="l01681" name="l01681"></a><span class="lineno"> 1681</span> </div>
|
|
<div class="line"><a id="l01682" name="l01682"></a><span class="lineno"> 1682</span> <span class="keywordflow">if</span> (VehicleIsEmpty(vehicle)) {</div>
|
|
<div class="line"><a id="l01683" name="l01683"></a><span class="lineno"> 1683</span> <span class="comment">// Vehicle is empty.</span></div>
|
|
<div class="line"><a id="l01684" name="l01684"></a><span class="lineno"> 1684</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(delivery_insert_after, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->Start(vehicle));</div>
|
|
<div class="line"><a id="l01685" name="l01685"></a><span class="lineno"> 1685</span> }</div>
|
|
<div class="line"><a id="l01686" name="l01686"></a><span class="lineno"> 1686</span> </div>
|
|
<div class="line"><a id="l01687" name="l01687"></a><span class="lineno"> 1687</span> int64_t pickup_insert_after = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->Start(vehicle);</div>
|
|
<div class="line"><a id="l01688" name="l01688"></a><span class="lineno"> 1688</span> <span class="keywordflow">while</span> (pickup_insert_after != delivery_insert_after) {</div>
|
|
<div class="line"><a id="l01689" name="l01689"></a><span class="lineno"> 1689</span> <span class="keywordflow">if</span> (!existing_insertion_positions.contains(</div>
|
|
<div class="line"><a id="l01690" name="l01690"></a><span class="lineno"> 1690</span> std::make_pair(pickup_insert_after, delivery_insert_after))) {</div>
|
|
<div class="line"><a id="l01691" name="l01691"></a><span class="lineno"> 1691</span> AddPairEntry(pickup, pickup_insert_after, delivery,</div>
|
|
<div class="line"><a id="l01692" name="l01692"></a><span class="lineno"> 1692</span> delivery_insert_after, vehicle, priority_queue,</div>
|
|
<div class="line"><a id="l01693" name="l01693"></a><span class="lineno"> 1693</span> pickup_to_entries, delivery_to_entries);</div>
|
|
<div class="line"><a id="l01694" name="l01694"></a><span class="lineno"> 1694</span> }</div>
|
|
<div class="line"><a id="l01695" name="l01695"></a><span class="lineno"> 1695</span> pickup_insert_after = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984">Value</a>(pickup_insert_after);</div>
|
|
<div class="line"><a id="l01696" name="l01696"></a><span class="lineno"> 1696</span> }</div>
|
|
<div class="line"><a id="l01697" name="l01697"></a><span class="lineno"> 1697</span> }</div>
|
|
<div class="line"><a id="l01698" name="l01698"></a><span class="lineno"> 1698</span> }</div>
|
|
<div class="line"><a id="l01699" name="l01699"></a><span class="lineno"> 1699</span>}</div>
|
|
<div class="line"><a id="l01700" name="l01700"></a><span class="lineno"> 1700</span> </div>
|
|
<div class="line"><a id="l01701" name="l01701"></a><span class="lineno"> 1701</span><span class="keywordtype">bool</span> GlobalCheapestInsertionFilteredHeuristic::UpdateAfterPairInsertion(</div>
|
|
<div class="line"><a id="l01702" name="l01702"></a><span class="lineno"> 1702</span> <span class="keyword">const</span> std::vector<int>& pair_indices, <span class="keywordtype">int</span> vehicle, int64_t pickup,</div>
|
|
<div class="line"><a id="l01703" name="l01703"></a><span class="lineno"> 1703</span> int64_t pickup_position, int64_t delivery, int64_t delivery_position,</div>
|
|
<div class="line"><a id="l01704" name="l01704"></a><span class="lineno"> 1704</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<PairEntry></a>* priority_queue,</div>
|
|
<div class="line"><a id="l01705" name="l01705"></a><span class="lineno"> 1705</span> std::vector<PairEntries>* pickup_to_entries,</div>
|
|
<div class="line"><a id="l01706" name="l01706"></a><span class="lineno"> 1706</span> std::vector<PairEntries>* delivery_to_entries) {</div>
|
|
<div class="line"><a id="l01707" name="l01707"></a><span class="lineno"> 1707</span> <span class="keywordflow">if</span> (!UpdatePairPositions(pair_indices, vehicle, pickup_position,</div>
|
|
<div class="line"><a id="l01708" name="l01708"></a><span class="lineno"> 1708</span> priority_queue, pickup_to_entries,</div>
|
|
<div class="line"><a id="l01709" name="l01709"></a><span class="lineno"> 1709</span> delivery_to_entries) ||</div>
|
|
<div class="line"><a id="l01710" name="l01710"></a><span class="lineno"> 1710</span> !UpdatePairPositions(pair_indices, vehicle, pickup, priority_queue,</div>
|
|
<div class="line"><a id="l01711" name="l01711"></a><span class="lineno"> 1711</span> pickup_to_entries, delivery_to_entries) ||</div>
|
|
<div class="line"><a id="l01712" name="l01712"></a><span class="lineno"> 1712</span> !UpdatePairPositions(pair_indices, vehicle, delivery, priority_queue,</div>
|
|
<div class="line"><a id="l01713" name="l01713"></a><span class="lineno"> 1713</span> pickup_to_entries, delivery_to_entries)) {</div>
|
|
<div class="line"><a id="l01714" name="l01714"></a><span class="lineno"> 1714</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01715" name="l01715"></a><span class="lineno"> 1715</span> }</div>
|
|
<div class="line"><a id="l01716" name="l01716"></a><span class="lineno"> 1716</span> <span class="keywordflow">if</span> (delivery_position != pickup &&</div>
|
|
<div class="line"><a id="l01717" name="l01717"></a><span class="lineno"> 1717</span> !UpdatePairPositions(pair_indices, vehicle, delivery_position,</div>
|
|
<div class="line"><a id="l01718" name="l01718"></a><span class="lineno"> 1718</span> priority_queue, pickup_to_entries,</div>
|
|
<div class="line"><a id="l01719" name="l01719"></a><span class="lineno"> 1719</span> delivery_to_entries)) {</div>
|
|
<div class="line"><a id="l01720" name="l01720"></a><span class="lineno"> 1720</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01721" name="l01721"></a><span class="lineno"> 1721</span> }</div>
|
|
<div class="line"><a id="l01722" name="l01722"></a><span class="lineno"> 1722</span> SetVehicleIndex(pickup, vehicle);</div>
|
|
<div class="line"><a id="l01723" name="l01723"></a><span class="lineno"> 1723</span> SetVehicleIndex(delivery, vehicle);</div>
|
|
<div class="line"><a id="l01724" name="l01724"></a><span class="lineno"> 1724</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01725" name="l01725"></a><span class="lineno"> 1725</span>}</div>
|
|
<div class="line"><a id="l01726" name="l01726"></a><span class="lineno"> 1726</span> </div>
|
|
<div class="line"><a id="l01727" name="l01727"></a><span class="lineno"> 1727</span><span class="keywordtype">bool</span> GlobalCheapestInsertionFilteredHeuristic::UpdatePickupPositions(</div>
|
|
<div class="line"><a id="l01728" name="l01728"></a><span class="lineno"> 1728</span> <span class="keyword">const</span> std::vector<int>& pair_indices, <span class="keywordtype">int</span> vehicle,</div>
|
|
<div class="line"><a id="l01729" name="l01729"></a><span class="lineno"> 1729</span> int64_t pickup_insert_after,</div>
|
|
<div class="line"><a id="l01730" name="l01730"></a><span class="lineno"> 1730</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a id="l01731" name="l01731"></a><span class="lineno"> 1731</span> GlobalCheapestInsertionFilteredHeuristic::PairEntry>* priority_queue,</div>
|
|
<div class="line"><a id="l01732" name="l01732"></a><span class="lineno"> 1732</span> std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a id="l01733" name="l01733"></a><span class="lineno"> 1733</span> pickup_to_entries,</div>
|
|
<div class="line"><a id="l01734" name="l01734"></a><span class="lineno"> 1734</span> std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a id="l01735" name="l01735"></a><span class="lineno"> 1735</span> delivery_to_entries) {</div>
|
|
<div class="line"><a id="l01736" name="l01736"></a><span class="lineno"> 1736</span> <span class="comment">// First, remove entries which have already been inserted and keep track of</span></div>
|
|
<div class="line"><a id="l01737" name="l01737"></a><span class="lineno"> 1737</span> <span class="comment">// the entries which are being kept and must be updated.</span></div>
|
|
<div class="line"><a id="l01738" name="l01738"></a><span class="lineno"> 1738</span> <span class="keyword">using</span> Pair = std::pair<int64_t, int64_t>;</div>
|
|
<div class="line"><a id="l01739" name="l01739"></a><span class="lineno"> 1739</span> <span class="keyword">using</span> Insertion = std::pair<Pair, <span class="comment">/*delivery_insert_after*/</span> int64_t>;</div>
|
|
<div class="line"><a id="l01740" name="l01740"></a><span class="lineno"> 1740</span> absl::flat_hash_set<Insertion> existing_insertions;</div>
|
|
<div class="line"><a id="l01741" name="l01741"></a><span class="lineno"> 1741</span> std::vector<PairEntry*> to_remove;</div>
|
|
<div class="line"><a id="l01742" name="l01742"></a><span class="lineno"> 1742</span> <span class="keywordflow">for</span> (PairEntry* <span class="keyword">const</span> pair_entry :</div>
|
|
<div class="line"><a id="l01743" name="l01743"></a><span class="lineno"> 1743</span> pickup_to_entries->at(pickup_insert_after)) {</div>
|
|
<div class="line"><a id="l01744" name="l01744"></a><span class="lineno"> 1744</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(priority_queue-><a class="code hl_function" href="class_adjustable_priority_queue.html#a7d1005d75f40525f91a2acb84348bc3c">Contains</a>(pair_entry));</div>
|
|
<div class="line"><a id="l01745" name="l01745"></a><span class="lineno"> 1745</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(pair_entry->pickup_insert_after(), pickup_insert_after);</div>
|
|
<div class="line"><a id="l01746" name="l01746"></a><span class="lineno"> 1746</span> <span class="keywordflow">if</span> (Contains(pair_entry->pickup_to_insert()) ||</div>
|
|
<div class="line"><a id="l01747" name="l01747"></a><span class="lineno"> 1747</span> Contains(pair_entry->delivery_to_insert())) {</div>
|
|
<div class="line"><a id="l01748" name="l01748"></a><span class="lineno"> 1748</span> to_remove.push_back(pair_entry);</div>
|
|
<div class="line"><a id="l01749" name="l01749"></a><span class="lineno"> 1749</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l01750" name="l01750"></a><span class="lineno"> 1750</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(delivery_to_entries->at(pair_entry->delivery_insert_after())</div>
|
|
<div class="line"><a id="l01751" name="l01751"></a><span class="lineno"> 1751</span> .contains(pair_entry));</div>
|
|
<div class="line"><a id="l01752" name="l01752"></a><span class="lineno"> 1752</span> UpdatePairEntry(pair_entry, priority_queue);</div>
|
|
<div class="line"><a id="l01753" name="l01753"></a><span class="lineno"> 1753</span> existing_insertions.insert(</div>
|
|
<div class="line"><a id="l01754" name="l01754"></a><span class="lineno"> 1754</span> {{pair_entry->pickup_to_insert(), pair_entry->delivery_to_insert()},</div>
|
|
<div class="line"><a id="l01755" name="l01755"></a><span class="lineno"> 1755</span> pair_entry->delivery_insert_after()});</div>
|
|
<div class="line"><a id="l01756" name="l01756"></a><span class="lineno"> 1756</span> }</div>
|
|
<div class="line"><a id="l01757" name="l01757"></a><span class="lineno"> 1757</span> }</div>
|
|
<div class="line"><a id="l01758" name="l01758"></a><span class="lineno"> 1758</span> <span class="keywordflow">for</span> (PairEntry* <span class="keyword">const</span> pair_entry : to_remove) {</div>
|
|
<div class="line"><a id="l01759" name="l01759"></a><span class="lineno"> 1759</span> DeletePairEntry(pair_entry, priority_queue, pickup_to_entries,</div>
|
|
<div class="line"><a id="l01760" name="l01760"></a><span class="lineno"> 1760</span> delivery_to_entries);</div>
|
|
<div class="line"><a id="l01761" name="l01761"></a><span class="lineno"> 1761</span> }</div>
|
|
<div class="line"><a id="l01762" name="l01762"></a><span class="lineno"> 1762</span> <span class="comment">// Create new entries for which the pickup is to be inserted after</span></div>
|
|
<div class="line"><a id="l01763" name="l01763"></a><span class="lineno"> 1763</span> <span class="comment">// pickup_insert_after.</span></div>
|
|
<div class="line"><a id="l01764" name="l01764"></a><span class="lineno"> 1764</span> <span class="keyword">const</span> <span class="keywordtype">int</span> cost_class = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->GetCostClassIndexOfVehicle(vehicle).value();</div>
|
|
<div class="line"><a id="l01765" name="l01765"></a><span class="lineno"> 1765</span> <span class="keyword">const</span> int64_t pickup_insert_before = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984">Value</a>(pickup_insert_after);</div>
|
|
<div class="line"><a id="l01766" name="l01766"></a><span class="lineno"> 1766</span> <span class="keyword">const</span> RoutingModel::IndexPairs& pickup_delivery_pairs =</div>
|
|
<div class="line"><a id="l01767" name="l01767"></a><span class="lineno"> 1767</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->GetPickupAndDeliveryPairs();</div>
|
|
<div class="line"><a id="l01768" name="l01768"></a><span class="lineno"> 1768</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pair_index : pair_indices) {</div>
|
|
<div class="line"><a id="l01769" name="l01769"></a><span class="lineno"> 1769</span> <span class="keywordflow">if</span> (StopSearchAndCleanup(priority_queue)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01770" name="l01770"></a><span class="lineno"> 1770</span> <span class="keyword">const</span> RoutingModel::IndexPair& index_pair =</div>
|
|
<div class="line"><a id="l01771" name="l01771"></a><span class="lineno"> 1771</span> pickup_delivery_pairs[pair_index];</div>
|
|
<div class="line"><a id="l01772" name="l01772"></a><span class="lineno"> 1772</span> <span class="keywordflow">for</span> (int64_t pickup : index_pair.first) {</div>
|
|
<div class="line"><a id="l01773" name="l01773"></a><span class="lineno"> 1773</span> <span class="keywordflow">if</span> (Contains(pickup) ||</div>
|
|
<div class="line"><a id="l01774" name="l01774"></a><span class="lineno"> 1774</span> !IsNeighborForCostClass(cost_class, pickup_insert_after, pickup)) {</div>
|
|
<div class="line"><a id="l01775" name="l01775"></a><span class="lineno"> 1775</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01776" name="l01776"></a><span class="lineno"> 1776</span> }</div>
|
|
<div class="line"><a id="l01777" name="l01777"></a><span class="lineno"> 1777</span> <span class="keywordflow">for</span> (int64_t delivery : index_pair.second) {</div>
|
|
<div class="line"><a id="l01778" name="l01778"></a><span class="lineno"> 1778</span> <span class="keywordflow">if</span> (Contains(delivery)) {</div>
|
|
<div class="line"><a id="l01779" name="l01779"></a><span class="lineno"> 1779</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01780" name="l01780"></a><span class="lineno"> 1780</span> }</div>
|
|
<div class="line"><a id="l01781" name="l01781"></a><span class="lineno"> 1781</span> int64_t delivery_insert_after = pickup;</div>
|
|
<div class="line"><a id="l01782" name="l01782"></a><span class="lineno"> 1782</span> <span class="keywordflow">while</span> (!<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->IsEnd(delivery_insert_after)) {</div>
|
|
<div class="line"><a id="l01783" name="l01783"></a><span class="lineno"> 1783</span> <span class="keyword">const</span> Insertion insertion = {{pickup, delivery},</div>
|
|
<div class="line"><a id="l01784" name="l01784"></a><span class="lineno"> 1784</span> delivery_insert_after};</div>
|
|
<div class="line"><a id="l01785" name="l01785"></a><span class="lineno"> 1785</span> <span class="keywordflow">if</span> (!existing_insertions.contains(insertion)) {</div>
|
|
<div class="line"><a id="l01786" name="l01786"></a><span class="lineno"> 1786</span> AddPairEntry(pickup, pickup_insert_after, delivery,</div>
|
|
<div class="line"><a id="l01787" name="l01787"></a><span class="lineno"> 1787</span> delivery_insert_after, vehicle, priority_queue,</div>
|
|
<div class="line"><a id="l01788" name="l01788"></a><span class="lineno"> 1788</span> pickup_to_entries, delivery_to_entries);</div>
|
|
<div class="line"><a id="l01789" name="l01789"></a><span class="lineno"> 1789</span> }</div>
|
|
<div class="line"><a id="l01790" name="l01790"></a><span class="lineno"> 1790</span> <span class="keywordflow">if</span> (delivery_insert_after == pickup) {</div>
|
|
<div class="line"><a id="l01791" name="l01791"></a><span class="lineno"> 1791</span> delivery_insert_after = pickup_insert_before;</div>
|
|
<div class="line"><a id="l01792" name="l01792"></a><span class="lineno"> 1792</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l01793" name="l01793"></a><span class="lineno"> 1793</span> delivery_insert_after = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984">Value</a>(delivery_insert_after);</div>
|
|
<div class="line"><a id="l01794" name="l01794"></a><span class="lineno"> 1794</span> }</div>
|
|
<div class="line"><a id="l01795" name="l01795"></a><span class="lineno"> 1795</span> }</div>
|
|
<div class="line"><a id="l01796" name="l01796"></a><span class="lineno"> 1796</span> }</div>
|
|
<div class="line"><a id="l01797" name="l01797"></a><span class="lineno"> 1797</span> }</div>
|
|
<div class="line"><a id="l01798" name="l01798"></a><span class="lineno"> 1798</span> }</div>
|
|
<div class="line"><a id="l01799" name="l01799"></a><span class="lineno"> 1799</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01800" name="l01800"></a><span class="lineno"> 1800</span>}</div>
|
|
<div class="line"><a id="l01801" name="l01801"></a><span class="lineno"> 1801</span> </div>
|
|
<div class="line"><a id="l01802" name="l01802"></a><span class="lineno"> 1802</span><span class="keywordtype">bool</span> GlobalCheapestInsertionFilteredHeuristic::UpdateDeliveryPositions(</div>
|
|
<div class="line"><a id="l01803" name="l01803"></a><span class="lineno"> 1803</span> <span class="keyword">const</span> std::vector<int>& pair_indices, <span class="keywordtype">int</span> vehicle,</div>
|
|
<div class="line"><a id="l01804" name="l01804"></a><span class="lineno"> 1804</span> int64_t delivery_insert_after,</div>
|
|
<div class="line"><a id="l01805" name="l01805"></a><span class="lineno"> 1805</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a id="l01806" name="l01806"></a><span class="lineno"> 1806</span> GlobalCheapestInsertionFilteredHeuristic::PairEntry>* priority_queue,</div>
|
|
<div class="line"><a id="l01807" name="l01807"></a><span class="lineno"> 1807</span> std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a id="l01808" name="l01808"></a><span class="lineno"> 1808</span> pickup_to_entries,</div>
|
|
<div class="line"><a id="l01809" name="l01809"></a><span class="lineno"> 1809</span> std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a id="l01810" name="l01810"></a><span class="lineno"> 1810</span> delivery_to_entries) {</div>
|
|
<div class="line"><a id="l01811" name="l01811"></a><span class="lineno"> 1811</span> <span class="comment">// First, remove entries which have already been inserted and keep track of</span></div>
|
|
<div class="line"><a id="l01812" name="l01812"></a><span class="lineno"> 1812</span> <span class="comment">// the entries which are being kept and must be updated.</span></div>
|
|
<div class="line"><a id="l01813" name="l01813"></a><span class="lineno"> 1813</span> <span class="keyword">using</span> Pair = std::pair<int64_t, int64_t>;</div>
|
|
<div class="line"><a id="l01814" name="l01814"></a><span class="lineno"> 1814</span> <span class="keyword">using</span> Insertion = std::pair<Pair, <span class="comment">/*pickup_insert_after*/</span> int64_t>;</div>
|
|
<div class="line"><a id="l01815" name="l01815"></a><span class="lineno"> 1815</span> absl::flat_hash_set<Insertion> existing_insertions;</div>
|
|
<div class="line"><a id="l01816" name="l01816"></a><span class="lineno"> 1816</span> std::vector<PairEntry*> to_remove;</div>
|
|
<div class="line"><a id="l01817" name="l01817"></a><span class="lineno"> 1817</span> <span class="keywordflow">for</span> (PairEntry* <span class="keyword">const</span> pair_entry :</div>
|
|
<div class="line"><a id="l01818" name="l01818"></a><span class="lineno"> 1818</span> delivery_to_entries->at(delivery_insert_after)) {</div>
|
|
<div class="line"><a id="l01819" name="l01819"></a><span class="lineno"> 1819</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(priority_queue-><a class="code hl_function" href="class_adjustable_priority_queue.html#a7d1005d75f40525f91a2acb84348bc3c">Contains</a>(pair_entry));</div>
|
|
<div class="line"><a id="l01820" name="l01820"></a><span class="lineno"> 1820</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(pair_entry->delivery_insert_after(), delivery_insert_after);</div>
|
|
<div class="line"><a id="l01821" name="l01821"></a><span class="lineno"> 1821</span> <span class="keywordflow">if</span> (Contains(pair_entry->pickup_to_insert()) ||</div>
|
|
<div class="line"><a id="l01822" name="l01822"></a><span class="lineno"> 1822</span> Contains(pair_entry->delivery_to_insert())) {</div>
|
|
<div class="line"><a id="l01823" name="l01823"></a><span class="lineno"> 1823</span> to_remove.push_back(pair_entry);</div>
|
|
<div class="line"><a id="l01824" name="l01824"></a><span class="lineno"> 1824</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l01825" name="l01825"></a><span class="lineno"> 1825</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(pickup_to_entries->at(pair_entry->pickup_insert_after())</div>
|
|
<div class="line"><a id="l01826" name="l01826"></a><span class="lineno"> 1826</span> .contains(pair_entry));</div>
|
|
<div class="line"><a id="l01827" name="l01827"></a><span class="lineno"> 1827</span> existing_insertions.insert(</div>
|
|
<div class="line"><a id="l01828" name="l01828"></a><span class="lineno"> 1828</span> {{pair_entry->pickup_to_insert(), pair_entry->delivery_to_insert()},</div>
|
|
<div class="line"><a id="l01829" name="l01829"></a><span class="lineno"> 1829</span> pair_entry->pickup_insert_after()});</div>
|
|
<div class="line"><a id="l01830" name="l01830"></a><span class="lineno"> 1830</span> UpdatePairEntry(pair_entry, priority_queue);</div>
|
|
<div class="line"><a id="l01831" name="l01831"></a><span class="lineno"> 1831</span> }</div>
|
|
<div class="line"><a id="l01832" name="l01832"></a><span class="lineno"> 1832</span> }</div>
|
|
<div class="line"><a id="l01833" name="l01833"></a><span class="lineno"> 1833</span> <span class="keywordflow">for</span> (PairEntry* <span class="keyword">const</span> pair_entry : to_remove) {</div>
|
|
<div class="line"><a id="l01834" name="l01834"></a><span class="lineno"> 1834</span> DeletePairEntry(pair_entry, priority_queue, pickup_to_entries,</div>
|
|
<div class="line"><a id="l01835" name="l01835"></a><span class="lineno"> 1835</span> delivery_to_entries);</div>
|
|
<div class="line"><a id="l01836" name="l01836"></a><span class="lineno"> 1836</span> }</div>
|
|
<div class="line"><a id="l01837" name="l01837"></a><span class="lineno"> 1837</span> <span class="comment">// Create new entries for which the delivery is to be inserted after</span></div>
|
|
<div class="line"><a id="l01838" name="l01838"></a><span class="lineno"> 1838</span> <span class="comment">// delivery_insert_after.</span></div>
|
|
<div class="line"><a id="l01839" name="l01839"></a><span class="lineno"> 1839</span> <span class="keyword">const</span> <span class="keywordtype">int</span> cost_class = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->GetCostClassIndexOfVehicle(vehicle).value();</div>
|
|
<div class="line"><a id="l01840" name="l01840"></a><span class="lineno"> 1840</span> <span class="keyword">const</span> RoutingModel::IndexPairs& pickup_delivery_pairs =</div>
|
|
<div class="line"><a id="l01841" name="l01841"></a><span class="lineno"> 1841</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->GetPickupAndDeliveryPairs();</div>
|
|
<div class="line"><a id="l01842" name="l01842"></a><span class="lineno"> 1842</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pair_index : pair_indices) {</div>
|
|
<div class="line"><a id="l01843" name="l01843"></a><span class="lineno"> 1843</span> <span class="keywordflow">if</span> (StopSearchAndCleanup(priority_queue)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l01844" name="l01844"></a><span class="lineno"> 1844</span> <span class="keyword">const</span> RoutingModel::IndexPair& index_pair =</div>
|
|
<div class="line"><a id="l01845" name="l01845"></a><span class="lineno"> 1845</span> pickup_delivery_pairs[pair_index];</div>
|
|
<div class="line"><a id="l01846" name="l01846"></a><span class="lineno"> 1846</span> <span class="keywordflow">for</span> (int64_t delivery : index_pair.second) {</div>
|
|
<div class="line"><a id="l01847" name="l01847"></a><span class="lineno"> 1847</span> <span class="keywordflow">if</span> (Contains(delivery) ||</div>
|
|
<div class="line"><a id="l01848" name="l01848"></a><span class="lineno"> 1848</span> !IsNeighborForCostClass(cost_class, delivery_insert_after,</div>
|
|
<div class="line"><a id="l01849" name="l01849"></a><span class="lineno"> 1849</span> delivery)) {</div>
|
|
<div class="line"><a id="l01850" name="l01850"></a><span class="lineno"> 1850</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01851" name="l01851"></a><span class="lineno"> 1851</span> }</div>
|
|
<div class="line"><a id="l01852" name="l01852"></a><span class="lineno"> 1852</span> <span class="keywordflow">for</span> (int64_t pickup : index_pair.first) {</div>
|
|
<div class="line"><a id="l01853" name="l01853"></a><span class="lineno"> 1853</span> <span class="keywordflow">if</span> (Contains(pickup)) {</div>
|
|
<div class="line"><a id="l01854" name="l01854"></a><span class="lineno"> 1854</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01855" name="l01855"></a><span class="lineno"> 1855</span> }</div>
|
|
<div class="line"><a id="l01856" name="l01856"></a><span class="lineno"> 1856</span> int64_t pickup_insert_after = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->Start(vehicle);</div>
|
|
<div class="line"><a id="l01857" name="l01857"></a><span class="lineno"> 1857</span> <span class="keywordflow">while</span> (pickup_insert_after != delivery_insert_after) {</div>
|
|
<div class="line"><a id="l01858" name="l01858"></a><span class="lineno"> 1858</span> <span class="keyword">const</span> Insertion insertion = {{pickup, delivery}, pickup_insert_after};</div>
|
|
<div class="line"><a id="l01859" name="l01859"></a><span class="lineno"> 1859</span> <span class="keywordflow">if</span> (!existing_insertions.contains(insertion)) {</div>
|
|
<div class="line"><a id="l01860" name="l01860"></a><span class="lineno"> 1860</span> AddPairEntry(pickup, pickup_insert_after, delivery,</div>
|
|
<div class="line"><a id="l01861" name="l01861"></a><span class="lineno"> 1861</span> delivery_insert_after, vehicle, priority_queue,</div>
|
|
<div class="line"><a id="l01862" name="l01862"></a><span class="lineno"> 1862</span> pickup_to_entries, delivery_to_entries);</div>
|
|
<div class="line"><a id="l01863" name="l01863"></a><span class="lineno"> 1863</span> }</div>
|
|
<div class="line"><a id="l01864" name="l01864"></a><span class="lineno"> 1864</span> pickup_insert_after = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984">Value</a>(pickup_insert_after);</div>
|
|
<div class="line"><a id="l01865" name="l01865"></a><span class="lineno"> 1865</span> }</div>
|
|
<div class="line"><a id="l01866" name="l01866"></a><span class="lineno"> 1866</span> }</div>
|
|
<div class="line"><a id="l01867" name="l01867"></a><span class="lineno"> 1867</span> }</div>
|
|
<div class="line"><a id="l01868" name="l01868"></a><span class="lineno"> 1868</span> }</div>
|
|
<div class="line"><a id="l01869" name="l01869"></a><span class="lineno"> 1869</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01870" name="l01870"></a><span class="lineno"> 1870</span>}</div>
|
|
<div class="line"><a id="l01871" name="l01871"></a><span class="lineno"> 1871</span> </div>
|
|
<div class="line"><a id="l01872" name="l01872"></a><span class="lineno"> 1872</span><span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::DeletePairEntry(</div>
|
|
<div class="line"><a id="l01873" name="l01873"></a><span class="lineno"> 1873</span> GlobalCheapestInsertionFilteredHeuristic::PairEntry* entry,</div>
|
|
<div class="line"><a id="l01874" name="l01874"></a><span class="lineno"> 1874</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a id="l01875" name="l01875"></a><span class="lineno"> 1875</span> GlobalCheapestInsertionFilteredHeuristic::PairEntry>* priority_queue,</div>
|
|
<div class="line"><a id="l01876" name="l01876"></a><span class="lineno"> 1876</span> std::vector<PairEntries>* pickup_to_entries,</div>
|
|
<div class="line"><a id="l01877" name="l01877"></a><span class="lineno"> 1877</span> std::vector<PairEntries>* delivery_to_entries) {</div>
|
|
<div class="line"><a id="l01878" name="l01878"></a><span class="lineno"> 1878</span> priority_queue-><a class="code hl_function" href="class_adjustable_priority_queue.html#a36647f60b5f27624275724445403ea1d">Remove</a>(entry);</div>
|
|
<div class="line"><a id="l01879" name="l01879"></a><span class="lineno"> 1879</span> <span class="keywordflow">if</span> (entry->pickup_insert_after() != -1) {</div>
|
|
<div class="line"><a id="l01880" name="l01880"></a><span class="lineno"> 1880</span> pickup_to_entries->at(entry->pickup_insert_after()).erase(entry);</div>
|
|
<div class="line"><a id="l01881" name="l01881"></a><span class="lineno"> 1881</span> }</div>
|
|
<div class="line"><a id="l01882" name="l01882"></a><span class="lineno"> 1882</span> <span class="keywordflow">if</span> (entry->delivery_insert_after() != -1) {</div>
|
|
<div class="line"><a id="l01883" name="l01883"></a><span class="lineno"> 1883</span> delivery_to_entries->at(entry->delivery_insert_after()).erase(entry);</div>
|
|
<div class="line"><a id="l01884" name="l01884"></a><span class="lineno"> 1884</span> }</div>
|
|
<div class="line"><a id="l01885" name="l01885"></a><span class="lineno"> 1885</span> <span class="keyword">delete</span> entry;</div>
|
|
<div class="line"><a id="l01886" name="l01886"></a><span class="lineno"> 1886</span>}</div>
|
|
<div class="line"><a id="l01887" name="l01887"></a><span class="lineno"> 1887</span> </div>
|
|
<div class="line"><a id="l01888" name="l01888"></a><span class="lineno"> 1888</span><span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::AddPairEntry(</div>
|
|
<div class="line"><a id="l01889" name="l01889"></a><span class="lineno"> 1889</span> int64_t pickup, int64_t pickup_insert_after, int64_t delivery,</div>
|
|
<div class="line"><a id="l01890" name="l01890"></a><span class="lineno"> 1890</span> int64_t delivery_insert_after, <span class="keywordtype">int</span> vehicle,</div>
|
|
<div class="line"><a id="l01891" name="l01891"></a><span class="lineno"> 1891</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a id="l01892" name="l01892"></a><span class="lineno"> 1892</span> GlobalCheapestInsertionFilteredHeuristic::PairEntry>* priority_queue,</div>
|
|
<div class="line"><a id="l01893" name="l01893"></a><span class="lineno"> 1893</span> std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a id="l01894" name="l01894"></a><span class="lineno"> 1894</span> pickup_entries,</div>
|
|
<div class="line"><a id="l01895" name="l01895"></a><span class="lineno"> 1895</span> std::vector<GlobalCheapestInsertionFilteredHeuristic::PairEntries>*</div>
|
|
<div class="line"><a id="l01896" name="l01896"></a><span class="lineno"> 1896</span> delivery_entries)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l01897" name="l01897"></a><span class="lineno"> 1897</span> <span class="keyword">const</span> IntVar* pickup_vehicle_var = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->VehicleVar(pickup);</div>
|
|
<div class="line"><a id="l01898" name="l01898"></a><span class="lineno"> 1898</span> <span class="keyword">const</span> IntVar* delivery_vehicle_var = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->VehicleVar(delivery);</div>
|
|
<div class="line"><a id="l01899" name="l01899"></a><span class="lineno"> 1899</span> <span class="keywordflow">if</span> (!pickup_vehicle_var->Contains(vehicle) ||</div>
|
|
<div class="line"><a id="l01900" name="l01900"></a><span class="lineno"> 1900</span> !delivery_vehicle_var->Contains(vehicle)) {</div>
|
|
<div class="line"><a id="l01901" name="l01901"></a><span class="lineno"> 1901</span> <span class="keywordflow">if</span> (vehicle == -1 || !VehicleIsEmpty(vehicle)) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l01902" name="l01902"></a><span class="lineno"> 1902</span> <span class="comment">// We need to check there is not an equivalent empty vehicle the pair</span></div>
|
|
<div class="line"><a id="l01903" name="l01903"></a><span class="lineno"> 1903</span> <span class="comment">// could fit on.</span></div>
|
|
<div class="line"><a id="l01904" name="l01904"></a><span class="lineno"> 1904</span> <span class="keyword">const</span> <span class="keyword">auto</span> vehicle_is_compatible = [pickup_vehicle_var,</div>
|
|
<div class="line"><a id="l01905" name="l01905"></a><span class="lineno"> 1905</span> delivery_vehicle_var](<span class="keywordtype">int</span> vehicle) {</div>
|
|
<div class="line"><a id="l01906" name="l01906"></a><span class="lineno"> 1906</span> <span class="keywordflow">return</span> pickup_vehicle_var->Contains(vehicle) &&</div>
|
|
<div class="line"><a id="l01907" name="l01907"></a><span class="lineno"> 1907</span> delivery_vehicle_var->Contains(vehicle);</div>
|
|
<div class="line"><a id="l01908" name="l01908"></a><span class="lineno"> 1908</span> };</div>
|
|
<div class="line"><a id="l01909" name="l01909"></a><span class="lineno"> 1909</span> <span class="keywordflow">if</span> (!empty_vehicle_type_curator_->HasCompatibleVehicleOfType(</div>
|
|
<div class="line"><a id="l01910" name="l01910"></a><span class="lineno"> 1910</span> empty_vehicle_type_curator_->Type(vehicle),</div>
|
|
<div class="line"><a id="l01911" name="l01911"></a><span class="lineno"> 1911</span> vehicle_is_compatible)) {</div>
|
|
<div class="line"><a id="l01912" name="l01912"></a><span class="lineno"> 1912</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l01913" name="l01913"></a><span class="lineno"> 1913</span> }</div>
|
|
<div class="line"><a id="l01914" name="l01914"></a><span class="lineno"> 1914</span> }</div>
|
|
<div class="line"><a id="l01915" name="l01915"></a><span class="lineno"> 1915</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_allowed_vehicles =</div>
|
|
<div class="line"><a id="l01916" name="l01916"></a><span class="lineno"> 1916</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(pickup_vehicle_var->Size(), delivery_vehicle_var->Size());</div>
|
|
<div class="line"><a id="l01917" name="l01917"></a><span class="lineno"> 1917</span> <span class="keywordflow">if</span> (pickup_insert_after == -1) {</div>
|
|
<div class="line"><a id="l01918" name="l01918"></a><span class="lineno"> 1918</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(delivery_insert_after, -1);</div>
|
|
<div class="line"><a id="l01919" name="l01919"></a><span class="lineno"> 1919</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(vehicle, -1);</div>
|
|
<div class="line"><a id="l01920" name="l01920"></a><span class="lineno"> 1920</span> PairEntry* pair_entry =</div>
|
|
<div class="line"><a id="l01921" name="l01921"></a><span class="lineno"> 1921</span> <span class="keyword">new</span> PairEntry(pickup, -1, delivery, -1, -1, num_allowed_vehicles);</div>
|
|
<div class="line"><a id="l01922" name="l01922"></a><span class="lineno"> 1922</span> pair_entry->set_value(</div>
|
|
<div class="line"><a id="l01923" name="l01923"></a><span class="lineno"> 1923</span> absl::GetFlag(FLAGS_routing_shift_insertion_cost_by_penalty)</div>
|
|
<div class="line"><a id="l01924" name="l01924"></a><span class="lineno"> 1924</span> ? 0</div>
|
|
<div class="line"><a id="l01925" name="l01925"></a><span class="lineno"> 1925</span> : <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(GetUnperformedValue(pickup),</div>
|
|
<div class="line"><a id="l01926" name="l01926"></a><span class="lineno"> 1926</span> GetUnperformedValue(delivery)));</div>
|
|
<div class="line"><a id="l01927" name="l01927"></a><span class="lineno"> 1927</span> priority_queue-><a class="code hl_function" href="class_adjustable_priority_queue.html#ac312fa979ea8afd5deabd6b581b3bb1f">Add</a>(pair_entry);</div>
|
|
<div class="line"><a id="l01928" name="l01928"></a><span class="lineno"> 1928</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l01929" name="l01929"></a><span class="lineno"> 1929</span> }</div>
|
|
<div class="line"><a id="l01930" name="l01930"></a><span class="lineno"> 1930</span> </div>
|
|
<div class="line"><a id="l01931" name="l01931"></a><span class="lineno"> 1931</span> PairEntry* <span class="keyword">const</span> pair_entry =</div>
|
|
<div class="line"><a id="l01932" name="l01932"></a><span class="lineno"> 1932</span> <span class="keyword">new</span> PairEntry(pickup, pickup_insert_after, delivery,</div>
|
|
<div class="line"><a id="l01933" name="l01933"></a><span class="lineno"> 1933</span> delivery_insert_after, vehicle, num_allowed_vehicles);</div>
|
|
<div class="line"><a id="l01934" name="l01934"></a><span class="lineno"> 1934</span> pair_entry->set_value(GetInsertionValueForPairAtPositions(</div>
|
|
<div class="line"><a id="l01935" name="l01935"></a><span class="lineno"> 1935</span> pickup, pickup_insert_after, delivery, delivery_insert_after, vehicle));</div>
|
|
<div class="line"><a id="l01936" name="l01936"></a><span class="lineno"> 1936</span> </div>
|
|
<div class="line"><a id="l01937" name="l01937"></a><span class="lineno"> 1937</span> <span class="comment">// Add entry to priority_queue and pickup_/delivery_entries.</span></div>
|
|
<div class="line"><a id="l01938" name="l01938"></a><span class="lineno"> 1938</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!priority_queue-><a class="code hl_function" href="class_adjustable_priority_queue.html#a7d1005d75f40525f91a2acb84348bc3c">Contains</a>(pair_entry));</div>
|
|
<div class="line"><a id="l01939" name="l01939"></a><span class="lineno"> 1939</span> pickup_entries->at(pickup_insert_after).insert(pair_entry);</div>
|
|
<div class="line"><a id="l01940" name="l01940"></a><span class="lineno"> 1940</span> delivery_entries->at(delivery_insert_after).insert(pair_entry);</div>
|
|
<div class="line"><a id="l01941" name="l01941"></a><span class="lineno"> 1941</span> priority_queue-><a class="code hl_function" href="class_adjustable_priority_queue.html#ac312fa979ea8afd5deabd6b581b3bb1f">Add</a>(pair_entry);</div>
|
|
<div class="line"><a id="l01942" name="l01942"></a><span class="lineno"> 1942</span>}</div>
|
|
<div class="line"><a id="l01943" name="l01943"></a><span class="lineno"> 1943</span> </div>
|
|
<div class="line"><a id="l01944" name="l01944"></a><span class="lineno"> 1944</span><span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::UpdatePairEntry(</div>
|
|
<div class="line"><a id="l01945" name="l01945"></a><span class="lineno"> 1945</span> GlobalCheapestInsertionFilteredHeuristic::PairEntry* <span class="keyword">const</span> pair_entry,</div>
|
|
<div class="line"><a id="l01946" name="l01946"></a><span class="lineno"> 1946</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a id="l01947" name="l01947"></a><span class="lineno"> 1947</span> GlobalCheapestInsertionFilteredHeuristic::PairEntry>* priority_queue)<span class="keyword"></span></div>
|
|
<div class="line"><a id="l01948" name="l01948"></a><span class="lineno"> 1948</span><span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l01949" name="l01949"></a><span class="lineno"> 1949</span> pair_entry->set_value(GetInsertionValueForPairAtPositions(</div>
|
|
<div class="line"><a id="l01950" name="l01950"></a><span class="lineno"> 1950</span> pair_entry->pickup_to_insert(), pair_entry->pickup_insert_after(),</div>
|
|
<div class="line"><a id="l01951" name="l01951"></a><span class="lineno"> 1951</span> pair_entry->delivery_to_insert(), pair_entry->delivery_insert_after(),</div>
|
|
<div class="line"><a id="l01952" name="l01952"></a><span class="lineno"> 1952</span> pair_entry->vehicle()));</div>
|
|
<div class="line"><a id="l01953" name="l01953"></a><span class="lineno"> 1953</span> </div>
|
|
<div class="line"><a id="l01954" name="l01954"></a><span class="lineno"> 1954</span> <span class="comment">// Update the priority_queue.</span></div>
|
|
<div class="line"><a id="l01955" name="l01955"></a><span class="lineno"> 1955</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(priority_queue-><a class="code hl_function" href="class_adjustable_priority_queue.html#a7d1005d75f40525f91a2acb84348bc3c">Contains</a>(pair_entry));</div>
|
|
<div class="line"><a id="l01956" name="l01956"></a><span class="lineno"> 1956</span> priority_queue-><a class="code hl_function" href="class_adjustable_priority_queue.html#a506169056c5f470fabdf77aa1934a5a3">NoteChangedPriority</a>(pair_entry);</div>
|
|
<div class="line"><a id="l01957" name="l01957"></a><span class="lineno"> 1957</span>}</div>
|
|
<div class="line"><a id="l01958" name="l01958"></a><span class="lineno"> 1958</span> </div>
|
|
<div class="line"><a id="l01959" name="l01959"></a><span class="lineno"> 1959</span>int64_t</div>
|
|
<div class="line"><a id="l01960" name="l01960"></a><span class="lineno"> 1960</span>GlobalCheapestInsertionFilteredHeuristic::GetInsertionValueForPairAtPositions(</div>
|
|
<div class="line"><a id="l01961" name="l01961"></a><span class="lineno"> 1961</span> int64_t pickup, int64_t pickup_insert_after, int64_t delivery,</div>
|
|
<div class="line"><a id="l01962" name="l01962"></a><span class="lineno"> 1962</span> int64_t delivery_insert_after, <span class="keywordtype">int</span> vehicle)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l01963" name="l01963"></a><span class="lineno"> 1963</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(pickup_insert_after, 0);</div>
|
|
<div class="line"><a id="l01964" name="l01964"></a><span class="lineno"> 1964</span> <span class="keyword">const</span> int64_t pickup_insert_before = <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984">Value</a>(pickup_insert_after);</div>
|
|
<div class="line"><a id="l01965" name="l01965"></a><span class="lineno"> 1965</span> <span class="keyword">const</span> int64_t pickup_value = GetInsertionCostForNodeAtPosition(</div>
|
|
<div class="line"><a id="l01966" name="l01966"></a><span class="lineno"> 1966</span> pickup, pickup_insert_after, pickup_insert_before, vehicle);</div>
|
|
<div class="line"><a id="l01967" name="l01967"></a><span class="lineno"> 1967</span> </div>
|
|
<div class="line"><a id="l01968" name="l01968"></a><span class="lineno"> 1968</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(delivery_insert_after, 0);</div>
|
|
<div class="line"><a id="l01969" name="l01969"></a><span class="lineno"> 1969</span> <span class="keyword">const</span> int64_t delivery_insert_before = (delivery_insert_after == pickup)</div>
|
|
<div class="line"><a id="l01970" name="l01970"></a><span class="lineno"> 1970</span> ? pickup_insert_before</div>
|
|
<div class="line"><a id="l01971" name="l01971"></a><span class="lineno"> 1971</span> : <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984">Value</a>(delivery_insert_after);</div>
|
|
<div class="line"><a id="l01972" name="l01972"></a><span class="lineno"> 1972</span> <span class="keyword">const</span> int64_t delivery_value = GetInsertionCostForNodeAtPosition(</div>
|
|
<div class="line"><a id="l01973" name="l01973"></a><span class="lineno"> 1973</span> delivery, delivery_insert_after, delivery_insert_before, vehicle);</div>
|
|
<div class="line"><a id="l01974" name="l01974"></a><span class="lineno"> 1974</span> </div>
|
|
<div class="line"><a id="l01975" name="l01975"></a><span class="lineno"> 1975</span> <span class="keyword">const</span> int64_t penalty_shift =</div>
|
|
<div class="line"><a id="l01976" name="l01976"></a><span class="lineno"> 1976</span> absl::GetFlag(FLAGS_routing_shift_insertion_cost_by_penalty)</div>
|
|
<div class="line"><a id="l01977" name="l01977"></a><span class="lineno"> 1977</span> ? <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(GetUnperformedValue(pickup), GetUnperformedValue(delivery))</div>
|
|
<div class="line"><a id="l01978" name="l01978"></a><span class="lineno"> 1978</span> : 0;</div>
|
|
<div class="line"><a id="l01979" name="l01979"></a><span class="lineno"> 1979</span> <span class="keywordflow">return</span> <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(<a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(pickup_value, delivery_value), penalty_shift);</div>
|
|
<div class="line"><a id="l01980" name="l01980"></a><span class="lineno"> 1980</span>}</div>
|
|
<div class="line"><a id="l01981" name="l01981"></a><span class="lineno"> 1981</span> </div>
|
|
<div class="line"><a id="l01982" name="l01982"></a><span class="lineno"> 1982</span><span class="keywordtype">bool</span> GlobalCheapestInsertionFilteredHeuristic::InitializePositions(</div>
|
|
<div class="line"><a id="l01983" name="l01983"></a><span class="lineno"> 1983</span> <span class="keyword">const</span> std::vector<int>& <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, <span class="keyword">const</span> absl::flat_hash_set<int>& vehicles,</div>
|
|
<div class="line"><a id="l01984" name="l01984"></a><span class="lineno"> 1984</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a id="l01985" name="l01985"></a><span class="lineno"> 1985</span> GlobalCheapestInsertionFilteredHeuristic::NodeEntry>* priority_queue,</div>
|
|
<div class="line"><a id="l01986" name="l01986"></a><span class="lineno"> 1986</span> std::vector<GlobalCheapestInsertionFilteredHeuristic::NodeEntries>*</div>
|
|
<div class="line"><a id="l01987" name="l01987"></a><span class="lineno"> 1987</span> position_to_node_entries) {</div>
|
|
<div class="line"><a id="l01988" name="l01988"></a><span class="lineno"> 1988</span> priority_queue-><a class="code hl_function" href="class_adjustable_priority_queue.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
|
|
<div class="line"><a id="l01989" name="l01989"></a><span class="lineno"> 1989</span> position_to_node_entries->clear();</div>
|
|
<div class="line"><a id="l01990" name="l01990"></a><span class="lineno"> 1990</span> position_to_node_entries->resize(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->Size());</div>
|
|
<div class="line"><a id="l01991" name="l01991"></a><span class="lineno"> 1991</span> </div>
|
|
<div class="line"><a id="l01992" name="l01992"></a><span class="lineno"> 1992</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_vehicles =</div>
|
|
<div class="line"><a id="l01993" name="l01993"></a><span class="lineno"> 1993</span> vehicles.empty() ? <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->vehicles() : vehicles.size();</div>
|
|
<div class="line"><a id="l01994" name="l01994"></a><span class="lineno"> 1994</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> all_vehicles = (num_vehicles == <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->vehicles());</div>
|
|
<div class="line"><a id="l01995" name="l01995"></a><span class="lineno"> 1995</span> </div>
|
|
<div class="line"><a id="l01996" name="l01996"></a><span class="lineno"> 1996</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node : <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>) {</div>
|
|
<div class="line"><a id="l01997" name="l01997"></a><span class="lineno"> 1997</span> <span class="keywordflow">if</span> (Contains(node)) {</div>
|
|
<div class="line"><a id="l01998" name="l01998"></a><span class="lineno"> 1998</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01999" name="l01999"></a><span class="lineno"> 1999</span> }</div>
|
|
<div class="line"><a id="l02000" name="l02000"></a><span class="lineno"> 2000</span> <span class="keywordflow">if</span> (StopSearchAndCleanup(priority_queue)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l02001" name="l02001"></a><span class="lineno"> 2001</span> <span class="comment">// Add insertion entry making node unperformed.</span></div>
|
|
<div class="line"><a id="l02002" name="l02002"></a><span class="lineno"> 2002</span> <span class="keywordflow">if</span> (gci_params_.add_unperformed_entries &&</div>
|
|
<div class="line"><a id="l02003" name="l02003"></a><span class="lineno"> 2003</span> GetUnperformedValue(node) != <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div>
|
|
<div class="line"><a id="l02004" name="l02004"></a><span class="lineno"> 2004</span> AddNodeEntry(node, -1, -1, all_vehicles, priority_queue, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l02005" name="l02005"></a><span class="lineno"> 2005</span> }</div>
|
|
<div class="line"><a id="l02006" name="l02006"></a><span class="lineno"> 2006</span> <span class="comment">// Add all insertion entries making node performed.</span></div>
|
|
<div class="line"><a id="l02007" name="l02007"></a><span class="lineno"> 2007</span> InitializeInsertionEntriesPerformingNode(node, vehicles, priority_queue,</div>
|
|
<div class="line"><a id="l02008" name="l02008"></a><span class="lineno"> 2008</span> position_to_node_entries);</div>
|
|
<div class="line"><a id="l02009" name="l02009"></a><span class="lineno"> 2009</span> }</div>
|
|
<div class="line"><a id="l02010" name="l02010"></a><span class="lineno"> 2010</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l02011" name="l02011"></a><span class="lineno"> 2011</span>}</div>
|
|
<div class="line"><a id="l02012" name="l02012"></a><span class="lineno"> 2012</span> </div>
|
|
<div class="line"><a id="l02013" name="l02013"></a><span class="lineno"> 2013</span><span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::</div>
|
|
<div class="line"><a id="l02014" name="l02014"></a><span class="lineno"> 2014</span> InitializeInsertionEntriesPerformingNode(</div>
|
|
<div class="line"><a id="l02015" name="l02015"></a><span class="lineno"> 2015</span> int64_t node, <span class="keyword">const</span> absl::flat_hash_set<int>& vehicles,</div>
|
|
<div class="line"><a id="l02016" name="l02016"></a><span class="lineno"> 2016</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a id="l02017" name="l02017"></a><span class="lineno"> 2017</span> GlobalCheapestInsertionFilteredHeuristic::NodeEntry>*</div>
|
|
<div class="line"><a id="l02018" name="l02018"></a><span class="lineno"> 2018</span> priority_queue,</div>
|
|
<div class="line"><a id="l02019" name="l02019"></a><span class="lineno"> 2019</span> std::vector<GlobalCheapestInsertionFilteredHeuristic::NodeEntries>*</div>
|
|
<div class="line"><a id="l02020" name="l02020"></a><span class="lineno"> 2020</span> position_to_node_entries) {</div>
|
|
<div class="line"><a id="l02021" name="l02021"></a><span class="lineno"> 2021</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_vehicles =</div>
|
|
<div class="line"><a id="l02022" name="l02022"></a><span class="lineno"> 2022</span> vehicles.empty() ? <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->vehicles() : vehicles.size();</div>
|
|
<div class="line"><a id="l02023" name="l02023"></a><span class="lineno"> 2023</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> all_vehicles = (num_vehicles == <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->vehicles());</div>
|
|
<div class="line"><a id="l02024" name="l02024"></a><span class="lineno"> 2024</span> </div>
|
|
<div class="line"><a id="l02025" name="l02025"></a><span class="lineno"> 2025</span> <span class="keywordflow">if</span> (!gci_params_.use_neighbors_ratio_for_initialization) {</div>
|
|
<div class="line"><a id="l02026" name="l02026"></a><span class="lineno"> 2026</span> <span class="keyword">auto</span> vehicles_it = vehicles.begin();</div>
|
|
<div class="line"><a id="l02027" name="l02027"></a><span class="lineno"> 2027</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> v = 0; v < num_vehicles; v++) {</div>
|
|
<div class="line"><a id="l02028" name="l02028"></a><span class="lineno"> 2028</span> <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = vehicles.empty() ? v : *vehicles_it++;</div>
|
|
<div class="line"><a id="l02029" name="l02029"></a><span class="lineno"> 2029</span> </div>
|
|
<div class="line"><a id="l02030" name="l02030"></a><span class="lineno"> 2030</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a> = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->Start(vehicle);</div>
|
|
<div class="line"><a id="l02031" name="l02031"></a><span class="lineno"> 2031</span> <span class="keywordflow">if</span> (all_vehicles && VehicleIsEmpty(vehicle) &&</div>
|
|
<div class="line"><a id="l02032" name="l02032"></a><span class="lineno"> 2032</span> empty_vehicle_type_curator_->GetLowestFixedCostVehicleOfType(</div>
|
|
<div class="line"><a id="l02033" name="l02033"></a><span class="lineno"> 2033</span> empty_vehicle_type_curator_->Type(vehicle)) != vehicle) {</div>
|
|
<div class="line"><a id="l02034" name="l02034"></a><span class="lineno"> 2034</span> <span class="comment">// We only consider the least expensive empty vehicle of each type for</span></div>
|
|
<div class="line"><a id="l02035" name="l02035"></a><span class="lineno"> 2035</span> <span class="comment">// entries.</span></div>
|
|
<div class="line"><a id="l02036" name="l02036"></a><span class="lineno"> 2036</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l02037" name="l02037"></a><span class="lineno"> 2037</span> }</div>
|
|
<div class="line"><a id="l02038" name="l02038"></a><span class="lineno"> 2038</span> std::vector<NodeInsertion> insertions;</div>
|
|
<div class="line"><a id="l02039" name="l02039"></a><span class="lineno"> 2039</span> AppendInsertionPositionsAfter(node, <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>, <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984">Value</a>(<a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>), vehicle,</div>
|
|
<div class="line"><a id="l02040" name="l02040"></a><span class="lineno"> 2040</span> &insertions);</div>
|
|
<div class="line"><a id="l02041" name="l02041"></a><span class="lineno"> 2041</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> [insert_after, insertion_vehicle, <a class="code hl_variable" href="routing__search_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>] : insertions) {</div>
|
|
<div class="line"><a id="l02042" name="l02042"></a><span class="lineno"> 2042</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(insertion_vehicle, vehicle);</div>
|
|
<div class="line"><a id="l02043" name="l02043"></a><span class="lineno"> 2043</span> AddNodeEntry(node, insert_after, vehicle, all_vehicles, priority_queue,</div>
|
|
<div class="line"><a id="l02044" name="l02044"></a><span class="lineno"> 2044</span> position_to_node_entries);</div>
|
|
<div class="line"><a id="l02045" name="l02045"></a><span class="lineno"> 2045</span> }</div>
|
|
<div class="line"><a id="l02046" name="l02046"></a><span class="lineno"> 2046</span> }</div>
|
|
<div class="line"><a id="l02047" name="l02047"></a><span class="lineno"> 2047</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l02048" name="l02048"></a><span class="lineno"> 2048</span> }</div>
|
|
<div class="line"><a id="l02049" name="l02049"></a><span class="lineno"> 2049</span> </div>
|
|
<div class="line"><a id="l02050" name="l02050"></a><span class="lineno"> 2050</span> <span class="comment">// We're only considering the closest neighbors as insertion positions for</span></div>
|
|
<div class="line"><a id="l02051" name="l02051"></a><span class="lineno"> 2051</span> <span class="comment">// the node.</span></div>
|
|
<div class="line"><a id="l02052" name="l02052"></a><span class="lineno"> 2052</span> <span class="keyword">const</span> <span class="keyword">auto</span> insert_on_vehicle_for_cost_class = [<span class="keyword">this</span>, &vehicles, all_vehicles](</div>
|
|
<div class="line"><a id="l02053" name="l02053"></a><span class="lineno"> 2053</span> <span class="keywordtype">int</span> v, <span class="keywordtype">int</span> cost_class) {</div>
|
|
<div class="line"><a id="l02054" name="l02054"></a><span class="lineno"> 2054</span> <span class="keywordflow">return</span> (<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->GetCostClassIndexOfVehicle(v).value() == cost_class) &&</div>
|
|
<div class="line"><a id="l02055" name="l02055"></a><span class="lineno"> 2055</span> (all_vehicles || vehicles.contains(v));</div>
|
|
<div class="line"><a id="l02056" name="l02056"></a><span class="lineno"> 2056</span> };</div>
|
|
<div class="line"><a id="l02057" name="l02057"></a><span class="lineno"> 2057</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> cost_class = 0; cost_class < <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->GetCostClassesCount();</div>
|
|
<div class="line"><a id="l02058" name="l02058"></a><span class="lineno"> 2058</span> cost_class++) {</div>
|
|
<div class="line"><a id="l02059" name="l02059"></a><span class="lineno"> 2059</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t insert_after :</div>
|
|
<div class="line"><a id="l02060" name="l02060"></a><span class="lineno"> 2060</span> GetNeighborsOfNodeForCostClass(cost_class, node)) {</div>
|
|
<div class="line"><a id="l02061" name="l02061"></a><span class="lineno"> 2061</span> <span class="keywordflow">if</span> (!Contains(insert_after)) {</div>
|
|
<div class="line"><a id="l02062" name="l02062"></a><span class="lineno"> 2062</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l02063" name="l02063"></a><span class="lineno"> 2063</span> }</div>
|
|
<div class="line"><a id="l02064" name="l02064"></a><span class="lineno"> 2064</span> <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = node_index_to_vehicle_[insert_after];</div>
|
|
<div class="line"><a id="l02065" name="l02065"></a><span class="lineno"> 2065</span> <span class="keywordflow">if</span> (vehicle == -1 ||</div>
|
|
<div class="line"><a id="l02066" name="l02066"></a><span class="lineno"> 2066</span> !insert_on_vehicle_for_cost_class(vehicle, cost_class)) {</div>
|
|
<div class="line"><a id="l02067" name="l02067"></a><span class="lineno"> 2067</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l02068" name="l02068"></a><span class="lineno"> 2068</span> }</div>
|
|
<div class="line"><a id="l02069" name="l02069"></a><span class="lineno"> 2069</span> <span class="keywordflow">if</span> (all_vehicles && VehicleIsEmpty(vehicle) &&</div>
|
|
<div class="line"><a id="l02070" name="l02070"></a><span class="lineno"> 2070</span> empty_vehicle_type_curator_->GetLowestFixedCostVehicleOfType(</div>
|
|
<div class="line"><a id="l02071" name="l02071"></a><span class="lineno"> 2071</span> empty_vehicle_type_curator_->Type(vehicle)) != vehicle) {</div>
|
|
<div class="line"><a id="l02072" name="l02072"></a><span class="lineno"> 2072</span> <span class="comment">// We only consider the least expensive empty vehicle of each type for</span></div>
|
|
<div class="line"><a id="l02073" name="l02073"></a><span class="lineno"> 2073</span> <span class="comment">// entries.</span></div>
|
|
<div class="line"><a id="l02074" name="l02074"></a><span class="lineno"> 2074</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l02075" name="l02075"></a><span class="lineno"> 2075</span> }</div>
|
|
<div class="line"><a id="l02076" name="l02076"></a><span class="lineno"> 2076</span> AddNodeEntry(node, insert_after, vehicle, all_vehicles, priority_queue,</div>
|
|
<div class="line"><a id="l02077" name="l02077"></a><span class="lineno"> 2077</span> position_to_node_entries);</div>
|
|
<div class="line"><a id="l02078" name="l02078"></a><span class="lineno"> 2078</span> }</div>
|
|
<div class="line"><a id="l02079" name="l02079"></a><span class="lineno"> 2079</span> }</div>
|
|
<div class="line"><a id="l02080" name="l02080"></a><span class="lineno"> 2080</span>}</div>
|
|
<div class="line"><a id="l02081" name="l02081"></a><span class="lineno"> 2081</span> </div>
|
|
<div class="line"><a id="l02082" name="l02082"></a><span class="lineno"> 2082</span><span class="keywordtype">bool</span> GlobalCheapestInsertionFilteredHeuristic::UpdatePositions(</div>
|
|
<div class="line"><a id="l02083" name="l02083"></a><span class="lineno"> 2083</span> <span class="keyword">const</span> std::vector<int>& <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>, <span class="keywordtype">int</span> vehicle, int64_t insert_after,</div>
|
|
<div class="line"><a id="l02084" name="l02084"></a><span class="lineno"> 2084</span> <span class="keywordtype">bool</span> all_vehicles,</div>
|
|
<div class="line"><a id="l02085" name="l02085"></a><span class="lineno"> 2085</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a id="l02086" name="l02086"></a><span class="lineno"> 2086</span> GlobalCheapestInsertionFilteredHeuristic::NodeEntry>* priority_queue,</div>
|
|
<div class="line"><a id="l02087" name="l02087"></a><span class="lineno"> 2087</span> std::vector<GlobalCheapestInsertionFilteredHeuristic::NodeEntries>*</div>
|
|
<div class="line"><a id="l02088" name="l02088"></a><span class="lineno"> 2088</span> node_entries) {</div>
|
|
<div class="line"><a id="l02089" name="l02089"></a><span class="lineno"> 2089</span> <span class="comment">// Either create new entries if we are inserting after a newly inserted node</span></div>
|
|
<div class="line"><a id="l02090" name="l02090"></a><span class="lineno"> 2090</span> <span class="comment">// or remove entries which have already been inserted.</span></div>
|
|
<div class="line"><a id="l02091" name="l02091"></a><span class="lineno"> 2091</span> std::vector<NodeEntry*> to_remove;</div>
|
|
<div class="line"><a id="l02092" name="l02092"></a><span class="lineno"> 2092</span> absl::flat_hash_set<int> existing_insertions;</div>
|
|
<div class="line"><a id="l02093" name="l02093"></a><span class="lineno"> 2093</span> <span class="keywordflow">for</span> (NodeEntry* <span class="keyword">const</span> node_entry : node_entries->at(insert_after)) {</div>
|
|
<div class="line"><a id="l02094" name="l02094"></a><span class="lineno"> 2094</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(node_entry->insert_after(), insert_after);</div>
|
|
<div class="line"><a id="l02095" name="l02095"></a><span class="lineno"> 2095</span> <span class="keyword">const</span> int64_t node_to_insert = node_entry->node_to_insert();</div>
|
|
<div class="line"><a id="l02096" name="l02096"></a><span class="lineno"> 2096</span> <span class="keywordflow">if</span> (Contains(node_to_insert)) {</div>
|
|
<div class="line"><a id="l02097" name="l02097"></a><span class="lineno"> 2097</span> to_remove.push_back(node_entry);</div>
|
|
<div class="line"><a id="l02098" name="l02098"></a><span class="lineno"> 2098</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l02099" name="l02099"></a><span class="lineno"> 2099</span> UpdateNodeEntry(node_entry, priority_queue);</div>
|
|
<div class="line"><a id="l02100" name="l02100"></a><span class="lineno"> 2100</span> existing_insertions.insert(node_to_insert);</div>
|
|
<div class="line"><a id="l02101" name="l02101"></a><span class="lineno"> 2101</span> }</div>
|
|
<div class="line"><a id="l02102" name="l02102"></a><span class="lineno"> 2102</span> }</div>
|
|
<div class="line"><a id="l02103" name="l02103"></a><span class="lineno"> 2103</span> <span class="keywordflow">for</span> (NodeEntry* <span class="keyword">const</span> node_entry : to_remove) {</div>
|
|
<div class="line"><a id="l02104" name="l02104"></a><span class="lineno"> 2104</span> DeleteNodeEntry(node_entry, priority_queue, node_entries);</div>
|
|
<div class="line"><a id="l02105" name="l02105"></a><span class="lineno"> 2105</span> }</div>
|
|
<div class="line"><a id="l02106" name="l02106"></a><span class="lineno"> 2106</span> <span class="keyword">const</span> <span class="keywordtype">int</span> cost_class = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->GetCostClassIndexOfVehicle(vehicle).value();</div>
|
|
<div class="line"><a id="l02107" name="l02107"></a><span class="lineno"> 2107</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node_to_insert : <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>) {</div>
|
|
<div class="line"><a id="l02108" name="l02108"></a><span class="lineno"> 2108</span> <span class="keywordflow">if</span> (StopSearchAndCleanup(priority_queue)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l02109" name="l02109"></a><span class="lineno"> 2109</span> <span class="keywordflow">if</span> (!Contains(node_to_insert) &&</div>
|
|
<div class="line"><a id="l02110" name="l02110"></a><span class="lineno"> 2110</span> !existing_insertions.contains(node_to_insert) &&</div>
|
|
<div class="line"><a id="l02111" name="l02111"></a><span class="lineno"> 2111</span> IsNeighborForCostClass(cost_class, insert_after, node_to_insert)) {</div>
|
|
<div class="line"><a id="l02112" name="l02112"></a><span class="lineno"> 2112</span> AddNodeEntry(node_to_insert, insert_after, vehicle, all_vehicles,</div>
|
|
<div class="line"><a id="l02113" name="l02113"></a><span class="lineno"> 2113</span> priority_queue, node_entries);</div>
|
|
<div class="line"><a id="l02114" name="l02114"></a><span class="lineno"> 2114</span> }</div>
|
|
<div class="line"><a id="l02115" name="l02115"></a><span class="lineno"> 2115</span> }</div>
|
|
<div class="line"><a id="l02116" name="l02116"></a><span class="lineno"> 2116</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l02117" name="l02117"></a><span class="lineno"> 2117</span>}</div>
|
|
<div class="line"><a id="l02118" name="l02118"></a><span class="lineno"> 2118</span> </div>
|
|
<div class="line"><a id="l02119" name="l02119"></a><span class="lineno"> 2119</span><span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::DeleteNodeEntry(</div>
|
|
<div class="line"><a id="l02120" name="l02120"></a><span class="lineno"> 2120</span> GlobalCheapestInsertionFilteredHeuristic::NodeEntry* entry,</div>
|
|
<div class="line"><a id="l02121" name="l02121"></a><span class="lineno"> 2121</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a><</div>
|
|
<div class="line"><a id="l02122" name="l02122"></a><span class="lineno"> 2122</span> GlobalCheapestInsertionFilteredHeuristic::NodeEntry>* priority_queue,</div>
|
|
<div class="line"><a id="l02123" name="l02123"></a><span class="lineno"> 2123</span> std::vector<NodeEntries>* node_entries) {</div>
|
|
<div class="line"><a id="l02124" name="l02124"></a><span class="lineno"> 2124</span> priority_queue-><a class="code hl_function" href="class_adjustable_priority_queue.html#a36647f60b5f27624275724445403ea1d">Remove</a>(entry);</div>
|
|
<div class="line"><a id="l02125" name="l02125"></a><span class="lineno"> 2125</span> <span class="keywordflow">if</span> (entry->insert_after() != -1) {</div>
|
|
<div class="line"><a id="l02126" name="l02126"></a><span class="lineno"> 2126</span> node_entries->at(entry->insert_after()).erase(entry);</div>
|
|
<div class="line"><a id="l02127" name="l02127"></a><span class="lineno"> 2127</span> }</div>
|
|
<div class="line"><a id="l02128" name="l02128"></a><span class="lineno"> 2128</span> <span class="keyword">delete</span> entry;</div>
|
|
<div class="line"><a id="l02129" name="l02129"></a><span class="lineno"> 2129</span>}</div>
|
|
<div class="line"><a id="l02130" name="l02130"></a><span class="lineno"> 2130</span> </div>
|
|
<div class="line"><a id="l02131" name="l02131"></a><span class="lineno"> 2131</span><span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::AddNodeEntry(</div>
|
|
<div class="line"><a id="l02132" name="l02132"></a><span class="lineno"> 2132</span> int64_t node, int64_t insert_after, <span class="keywordtype">int</span> vehicle, <span class="keywordtype">bool</span> all_vehicles,</div>
|
|
<div class="line"><a id="l02133" name="l02133"></a><span class="lineno"> 2133</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<NodeEntry></a>* priority_queue,</div>
|
|
<div class="line"><a id="l02134" name="l02134"></a><span class="lineno"> 2134</span> std::vector<NodeEntries>* node_entries)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l02135" name="l02135"></a><span class="lineno"> 2135</span> <span class="keyword">const</span> int64_t node_penalty = GetUnperformedValue(node);</div>
|
|
<div class="line"><a id="l02136" name="l02136"></a><span class="lineno"> 2136</span> <span class="keyword">const</span> int64_t penalty_shift =</div>
|
|
<div class="line"><a id="l02137" name="l02137"></a><span class="lineno"> 2137</span> absl::GetFlag(FLAGS_routing_shift_insertion_cost_by_penalty)</div>
|
|
<div class="line"><a id="l02138" name="l02138"></a><span class="lineno"> 2138</span> ? node_penalty</div>
|
|
<div class="line"><a id="l02139" name="l02139"></a><span class="lineno"> 2139</span> : 0;</div>
|
|
<div class="line"><a id="l02140" name="l02140"></a><span class="lineno"> 2140</span> <span class="keyword">const</span> IntVar* <span class="keyword">const</span> vehicle_var = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->VehicleVar(node);</div>
|
|
<div class="line"><a id="l02141" name="l02141"></a><span class="lineno"> 2141</span> <span class="keywordflow">if</span> (!vehicle_var->Contains(vehicle)) {</div>
|
|
<div class="line"><a id="l02142" name="l02142"></a><span class="lineno"> 2142</span> <span class="keywordflow">if</span> (vehicle == -1 || !VehicleIsEmpty(vehicle)) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l02143" name="l02143"></a><span class="lineno"> 2143</span> <span class="comment">// We need to check there is not an equivalent empty vehicle the node</span></div>
|
|
<div class="line"><a id="l02144" name="l02144"></a><span class="lineno"> 2144</span> <span class="comment">// could fit on.</span></div>
|
|
<div class="line"><a id="l02145" name="l02145"></a><span class="lineno"> 2145</span> <span class="keyword">const</span> <span class="keyword">auto</span> vehicle_is_compatible = [vehicle_var](<span class="keywordtype">int</span> vehicle) {</div>
|
|
<div class="line"><a id="l02146" name="l02146"></a><span class="lineno"> 2146</span> <span class="keywordflow">return</span> vehicle_var->Contains(vehicle);</div>
|
|
<div class="line"><a id="l02147" name="l02147"></a><span class="lineno"> 2147</span> };</div>
|
|
<div class="line"><a id="l02148" name="l02148"></a><span class="lineno"> 2148</span> <span class="keywordflow">if</span> (!empty_vehicle_type_curator_->HasCompatibleVehicleOfType(</div>
|
|
<div class="line"><a id="l02149" name="l02149"></a><span class="lineno"> 2149</span> empty_vehicle_type_curator_->Type(vehicle),</div>
|
|
<div class="line"><a id="l02150" name="l02150"></a><span class="lineno"> 2150</span> vehicle_is_compatible)) {</div>
|
|
<div class="line"><a id="l02151" name="l02151"></a><span class="lineno"> 2151</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l02152" name="l02152"></a><span class="lineno"> 2152</span> }</div>
|
|
<div class="line"><a id="l02153" name="l02153"></a><span class="lineno"> 2153</span> }</div>
|
|
<div class="line"><a id="l02154" name="l02154"></a><span class="lineno"> 2154</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_allowed_vehicles = vehicle_var->Size();</div>
|
|
<div class="line"><a id="l02155" name="l02155"></a><span class="lineno"> 2155</span> <span class="keywordflow">if</span> (insert_after == -1) {</div>
|
|
<div class="line"><a id="l02156" name="l02156"></a><span class="lineno"> 2156</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(vehicle, -1);</div>
|
|
<div class="line"><a id="l02157" name="l02157"></a><span class="lineno"> 2157</span> <span class="keywordflow">if</span> (!all_vehicles) {</div>
|
|
<div class="line"><a id="l02158" name="l02158"></a><span class="lineno"> 2158</span> <span class="comment">// NOTE: In the case where we're not considering all routes</span></div>
|
|
<div class="line"><a id="l02159" name="l02159"></a><span class="lineno"> 2159</span> <span class="comment">// simultaneously, we don't add insertion entries making nodes</span></div>
|
|
<div class="line"><a id="l02160" name="l02160"></a><span class="lineno"> 2160</span> <span class="comment">// unperformed.</span></div>
|
|
<div class="line"><a id="l02161" name="l02161"></a><span class="lineno"> 2161</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l02162" name="l02162"></a><span class="lineno"> 2162</span> }</div>
|
|
<div class="line"><a id="l02163" name="l02163"></a><span class="lineno"> 2163</span> NodeEntry* <span class="keyword">const</span> node_entry =</div>
|
|
<div class="line"><a id="l02164" name="l02164"></a><span class="lineno"> 2164</span> <span class="keyword">new</span> NodeEntry(node, -1, -1, num_allowed_vehicles);</div>
|
|
<div class="line"><a id="l02165" name="l02165"></a><span class="lineno"> 2165</span> node_entry->set_value(<a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(node_penalty, penalty_shift));</div>
|
|
<div class="line"><a id="l02166" name="l02166"></a><span class="lineno"> 2166</span> priority_queue-><a class="code hl_function" href="class_adjustable_priority_queue.html#ac312fa979ea8afd5deabd6b581b3bb1f">Add</a>(node_entry);</div>
|
|
<div class="line"><a id="l02167" name="l02167"></a><span class="lineno"> 2167</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l02168" name="l02168"></a><span class="lineno"> 2168</span> }</div>
|
|
<div class="line"><a id="l02169" name="l02169"></a><span class="lineno"> 2169</span> </div>
|
|
<div class="line"><a id="l02170" name="l02170"></a><span class="lineno"> 2170</span> <span class="keyword">const</span> int64_t insertion_cost = GetInsertionCostForNodeAtPosition(</div>
|
|
<div class="line"><a id="l02171" name="l02171"></a><span class="lineno"> 2171</span> node, insert_after, <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984">Value</a>(insert_after), vehicle);</div>
|
|
<div class="line"><a id="l02172" name="l02172"></a><span class="lineno"> 2172</span> <span class="keywordflow">if</span> (!all_vehicles && insertion_cost > node_penalty) {</div>
|
|
<div class="line"><a id="l02173" name="l02173"></a><span class="lineno"> 2173</span> <span class="comment">// NOTE: When all vehicles aren't considered for insertion, we don't</span></div>
|
|
<div class="line"><a id="l02174" name="l02174"></a><span class="lineno"> 2174</span> <span class="comment">// add entries making nodes unperformed, so we don't add insertions</span></div>
|
|
<div class="line"><a id="l02175" name="l02175"></a><span class="lineno"> 2175</span> <span class="comment">// which cost more than the node penalty either.</span></div>
|
|
<div class="line"><a id="l02176" name="l02176"></a><span class="lineno"> 2176</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l02177" name="l02177"></a><span class="lineno"> 2177</span> }</div>
|
|
<div class="line"><a id="l02178" name="l02178"></a><span class="lineno"> 2178</span> </div>
|
|
<div class="line"><a id="l02179" name="l02179"></a><span class="lineno"> 2179</span> NodeEntry* <span class="keyword">const</span> node_entry =</div>
|
|
<div class="line"><a id="l02180" name="l02180"></a><span class="lineno"> 2180</span> <span class="keyword">new</span> NodeEntry(node, insert_after, vehicle, num_allowed_vehicles);</div>
|
|
<div class="line"><a id="l02181" name="l02181"></a><span class="lineno"> 2181</span> node_entry->set_value(<a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(insertion_cost, penalty_shift));</div>
|
|
<div class="line"><a id="l02182" name="l02182"></a><span class="lineno"> 2182</span> <span class="comment">// Add entry to priority_queue and node_entries.</span></div>
|
|
<div class="line"><a id="l02183" name="l02183"></a><span class="lineno"> 2183</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!priority_queue-><a class="code hl_function" href="class_adjustable_priority_queue.html#a7d1005d75f40525f91a2acb84348bc3c">Contains</a>(node_entry));</div>
|
|
<div class="line"><a id="l02184" name="l02184"></a><span class="lineno"> 2184</span> node_entries->at(insert_after).insert(node_entry);</div>
|
|
<div class="line"><a id="l02185" name="l02185"></a><span class="lineno"> 2185</span> priority_queue-><a class="code hl_function" href="class_adjustable_priority_queue.html#ac312fa979ea8afd5deabd6b581b3bb1f">Add</a>(node_entry);</div>
|
|
<div class="line"><a id="l02186" name="l02186"></a><span class="lineno"> 2186</span>}</div>
|
|
<div class="line"><a id="l02187" name="l02187"></a><span class="lineno"> 2187</span> </div>
|
|
<div class="line"><a id="l02188" name="l02188"></a><span class="lineno"> 2188</span><span class="keywordtype">void</span> GlobalCheapestInsertionFilteredHeuristic::UpdateNodeEntry(</div>
|
|
<div class="line"><a id="l02189" name="l02189"></a><span class="lineno"> 2189</span> NodeEntry* <span class="keyword">const</span> node_entry,</div>
|
|
<div class="line"><a id="l02190" name="l02190"></a><span class="lineno"> 2190</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<NodeEntry></a>* priority_queue)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l02191" name="l02191"></a><span class="lineno"> 2191</span> <span class="keyword">const</span> int64_t node = node_entry->node_to_insert();</div>
|
|
<div class="line"><a id="l02192" name="l02192"></a><span class="lineno"> 2192</span> <span class="keyword">const</span> int64_t insert_after = node_entry->insert_after();</div>
|
|
<div class="line"><a id="l02193" name="l02193"></a><span class="lineno"> 2193</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(insert_after, 0);</div>
|
|
<div class="line"><a id="l02194" name="l02194"></a><span class="lineno"> 2194</span> <span class="keyword">const</span> int64_t insertion_cost = GetInsertionCostForNodeAtPosition(</div>
|
|
<div class="line"><a id="l02195" name="l02195"></a><span class="lineno"> 2195</span> node, insert_after, <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984">Value</a>(insert_after), node_entry->vehicle());</div>
|
|
<div class="line"><a id="l02196" name="l02196"></a><span class="lineno"> 2196</span> <span class="keyword">const</span> int64_t penalty_shift =</div>
|
|
<div class="line"><a id="l02197" name="l02197"></a><span class="lineno"> 2197</span> absl::GetFlag(FLAGS_routing_shift_insertion_cost_by_penalty)</div>
|
|
<div class="line"><a id="l02198" name="l02198"></a><span class="lineno"> 2198</span> ? GetUnperformedValue(node)</div>
|
|
<div class="line"><a id="l02199" name="l02199"></a><span class="lineno"> 2199</span> : 0;</div>
|
|
<div class="line"><a id="l02200" name="l02200"></a><span class="lineno"> 2200</span> </div>
|
|
<div class="line"><a id="l02201" name="l02201"></a><span class="lineno"> 2201</span> node_entry->set_value(<a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(insertion_cost, penalty_shift));</div>
|
|
<div class="line"><a id="l02202" name="l02202"></a><span class="lineno"> 2202</span> <span class="comment">// Update the priority_queue.</span></div>
|
|
<div class="line"><a id="l02203" name="l02203"></a><span class="lineno"> 2203</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(priority_queue-><a class="code hl_function" href="class_adjustable_priority_queue.html#a7d1005d75f40525f91a2acb84348bc3c">Contains</a>(node_entry));</div>
|
|
<div class="line"><a id="l02204" name="l02204"></a><span class="lineno"> 2204</span> priority_queue-><a class="code hl_function" href="class_adjustable_priority_queue.html#a506169056c5f470fabdf77aa1934a5a3">NoteChangedPriority</a>(node_entry);</div>
|
|
<div class="line"><a id="l02205" name="l02205"></a><span class="lineno"> 2205</span>}</div>
|
|
<div class="line"><a id="l02206" name="l02206"></a><span class="lineno"> 2206</span> </div>
|
|
<div class="line"><a id="l02207" name="l02207"></a><span class="lineno"> 2207</span><span class="comment">// LocalCheapestInsertionFilteredHeuristic</span></div>
|
|
<div class="line"><a id="l02208" name="l02208"></a><span class="lineno"> 2208</span><span class="comment">// TODO(user): Add support for penalty costs.</span></div>
|
|
<div class="line"><a id="l02209" name="l02209"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html#a219891cda8ffb7f9dbb5752360f0cbca"> 2209</a></span>LocalCheapestInsertionFilteredHeuristic::</div>
|
|
<div class="line"><a id="l02210" name="l02210"></a><span class="lineno"> 2210</span> LocalCheapestInsertionFilteredHeuristic(</div>
|
|
<div class="line"><a id="l02211" name="l02211"></a><span class="lineno"> 2211</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div>
|
|
<div class="line"><a id="l02212" name="l02212"></a><span class="lineno"> 2212</span> std::function<int64_t(int64_t, int64_t, int64_t)> evaluator,</div>
|
|
<div class="line"><a id="l02213" name="l02213"></a><span class="lineno"> 2213</span> <span class="keywordtype">bool</span> evaluate_pickup_delivery_costs_independently,</div>
|
|
<div class="line"><a id="l02214" name="l02214"></a><span class="lineno"> 2214</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager)</div>
|
|
<div class="line"><a id="l02215" name="l02215"></a><span class="lineno"> 2215</span> : <a class="code hl_class" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html">CheapestInsertionFilteredHeuristic</a>(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code hl_namespace" href="namespacestd.html">std</a>::move(evaluator), nullptr,</div>
|
|
<div class="line"><a id="l02216" name="l02216"></a><span class="lineno"> 2216</span> filter_manager),</div>
|
|
<div class="line"><a id="l02217" name="l02217"></a><span class="lineno"> 2217</span> evaluate_pickup_delivery_costs_independently_(</div>
|
|
<div class="line"><a id="l02218" name="l02218"></a><span class="lineno"> 2218</span> evaluate_pickup_delivery_costs_independently) {</div>
|
|
<div class="line"><a id="l02219" name="l02219"></a><span class="lineno"> 2219</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code hl_variable" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a4c042f054da687c4a586dc5d3dfaef10">evaluator_</a> != <span class="keyword">nullptr</span> ||</div>
|
|
<div class="line"><a id="l02220" name="l02220"></a><span class="lineno"> 2220</span> !evaluate_pickup_delivery_costs_independently_);</div>
|
|
<div class="line"><a id="l02221" name="l02221"></a><span class="lineno"> 2221</span> std::vector<int> all_vehicles(<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>());</div>
|
|
<div class="line"><a id="l02222" name="l02222"></a><span class="lineno"> 2222</span> std::iota(std::begin(all_vehicles), <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">std::end</a>(all_vehicles), 0);</div>
|
|
<div class="line"><a id="l02223" name="l02223"></a><span class="lineno"> 2223</span> </div>
|
|
<div class="line"><a id="l02224" name="l02224"></a><span class="lineno"> 2224</span> start_end_distances_per_node_ =</div>
|
|
<div class="line"><a id="l02225" name="l02225"></a><span class="lineno"> 2225</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a356517cd51c4b6259d7f439718719eaa">ComputeStartEndDistanceForVehicles</a>(all_vehicles);</div>
|
|
<div class="line"><a id="l02226" name="l02226"></a><span class="lineno"> 2226</span>}</div>
|
|
<div class="line"><a id="l02227" name="l02227"></a><span class="lineno"> 2227</span> </div>
|
|
<div class="line"><a id="l02228" name="l02228"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289"> 2228</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">LocalCheapestInsertionFilteredHeuristic::BuildSolutionInternal</a>() {</div>
|
|
<div class="line"><a id="l02229" name="l02229"></a><span class="lineno"> 2229</span> <span class="comment">// Marking if we've tried inserting a node.</span></div>
|
|
<div class="line"><a id="l02230" name="l02230"></a><span class="lineno"> 2230</span> std::vector<bool> visited(<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l02231" name="l02231"></a><span class="lineno"> 2231</span> <span class="comment">// Iterating on pickup and delivery pairs</span></div>
|
|
<div class="line"><a id="l02232" name="l02232"></a><span class="lineno"> 2232</span> <span class="keyword">const</span> <a class="code hl_typedef" href="classoperations__research_1_1_routing_model.html#a76874cd778ea1b9220673e019f9e7abe">RoutingModel::IndexPairs</a>& index_pairs =</div>
|
|
<div class="line"><a id="l02233" name="l02233"></a><span class="lineno"> 2233</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a251dfaa30251901d13cd2f33a92571ac">GetPickupAndDeliveryPairs</a>();</div>
|
|
<div class="line"><a id="l02234" name="l02234"></a><span class="lineno"> 2234</span> <span class="comment">// Sort pairs according to number of possible vehicles.</span></div>
|
|
<div class="line"><a id="l02235" name="l02235"></a><span class="lineno"> 2235</span> <span class="keyword">struct </span>PairDomainSize {</div>
|
|
<div class="line"><a id="l02236" name="l02236"></a><span class="lineno"> 2236</span> uint64_t domain_size;</div>
|
|
<div class="line"><a id="l02237" name="l02237"></a><span class="lineno"> 2237</span> <span class="keywordtype">int</span> pair_index;</div>
|
|
<div class="line"><a id="l02238" name="l02238"></a><span class="lineno"> 2238</span> </div>
|
|
<div class="line"><a id="l02239" name="l02239"></a><span class="lineno"> 2239</span> <span class="keywordtype">bool</span> operator<(<span class="keyword">const</span> PairDomainSize& other)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l02240" name="l02240"></a><span class="lineno"> 2240</span> <span class="keywordflow">return</span> std::tie(domain_size, pair_index) <</div>
|
|
<div class="line"><a id="l02241" name="l02241"></a><span class="lineno"> 2241</span> std::tie(other.domain_size, other.pair_index);</div>
|
|
<div class="line"><a id="l02242" name="l02242"></a><span class="lineno"> 2242</span> }</div>
|
|
<div class="line"><a id="l02243" name="l02243"></a><span class="lineno"> 2243</span> };</div>
|
|
<div class="line"><a id="l02244" name="l02244"></a><span class="lineno"> 2244</span> std::vector<PairDomainSize> pair_domain_sizes;</div>
|
|
<div class="line"><a id="l02245" name="l02245"></a><span class="lineno"> 2245</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pair_index = 0; pair_index < index_pairs.size(); ++pair_index) {</div>
|
|
<div class="line"><a id="l02246" name="l02246"></a><span class="lineno"> 2246</span> uint64_t domain_size = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<uint64_t>::max</a>();</div>
|
|
<div class="line"><a id="l02247" name="l02247"></a><span class="lineno"> 2247</span> <span class="keywordflow">for</span> (int64_t pickup : index_pairs[pair_index].first) {</div>
|
|
<div class="line"><a id="l02248" name="l02248"></a><span class="lineno"> 2248</span> domain_size = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(domain_size, <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->VehicleVar(pickup)-><a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>());</div>
|
|
<div class="line"><a id="l02249" name="l02249"></a><span class="lineno"> 2249</span> }</div>
|
|
<div class="line"><a id="l02250" name="l02250"></a><span class="lineno"> 2250</span> <span class="keywordflow">for</span> (int64_t delivery : index_pairs[pair_index].second) {</div>
|
|
<div class="line"><a id="l02251" name="l02251"></a><span class="lineno"> 2251</span> domain_size =</div>
|
|
<div class="line"><a id="l02252" name="l02252"></a><span class="lineno"> 2252</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(domain_size, <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->VehicleVar(delivery)-><a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>());</div>
|
|
<div class="line"><a id="l02253" name="l02253"></a><span class="lineno"> 2253</span> }</div>
|
|
<div class="line"><a id="l02254" name="l02254"></a><span class="lineno"> 2254</span> pair_domain_sizes.push_back({domain_size, pair_index});</div>
|
|
<div class="line"><a id="l02255" name="l02255"></a><span class="lineno"> 2255</span> }</div>
|
|
<div class="line"><a id="l02256" name="l02256"></a><span class="lineno"> 2256</span> std::sort(pair_domain_sizes.begin(), pair_domain_sizes.end());</div>
|
|
<div class="line"><a id="l02257" name="l02257"></a><span class="lineno"> 2257</span> <span class="keyword">const</span> <span class="keyword">auto</span> insert_pair = [<span class="keyword">this</span>](int64_t pickup, int64_t insert_pickup_after,</div>
|
|
<div class="line"><a id="l02258" name="l02258"></a><span class="lineno"> 2258</span> int64_t delivery,</div>
|
|
<div class="line"><a id="l02259" name="l02259"></a><span class="lineno"> 2259</span> int64_t insert_delivery_after, <span class="keywordtype">int</span> vehicle) {</div>
|
|
<div class="line"><a id="l02260" name="l02260"></a><span class="lineno"> 2260</span> <span class="keyword">const</span> int64_t insert_pickup_before = <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(insert_pickup_after);</div>
|
|
<div class="line"><a id="l02261" name="l02261"></a><span class="lineno"> 2261</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#add2710777ca3960d37c6257cd95edfee">InsertBetween</a>(pickup, insert_pickup_after, insert_pickup_before, vehicle);</div>
|
|
<div class="line"><a id="l02262" name="l02262"></a><span class="lineno"> 2262</span> <a class="code hl_define" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(insert_delivery_after, insert_pickup_after);</div>
|
|
<div class="line"><a id="l02263" name="l02263"></a><span class="lineno"> 2263</span> <span class="keyword">const</span> int64_t insert_delivery_before = (insert_delivery_after == pickup)</div>
|
|
<div class="line"><a id="l02264" name="l02264"></a><span class="lineno"> 2264</span> ? insert_pickup_before</div>
|
|
<div class="line"><a id="l02265" name="l02265"></a><span class="lineno"> 2265</span> : <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(insert_delivery_after);</div>
|
|
<div class="line"><a id="l02266" name="l02266"></a><span class="lineno"> 2266</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#add2710777ca3960d37c6257cd95edfee">InsertBetween</a>(delivery, insert_delivery_after, insert_delivery_before,</div>
|
|
<div class="line"><a id="l02267" name="l02267"></a><span class="lineno"> 2267</span> vehicle);</div>
|
|
<div class="line"><a id="l02268" name="l02268"></a><span class="lineno"> 2268</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value();</div>
|
|
<div class="line"><a id="l02269" name="l02269"></a><span class="lineno"> 2269</span> };</div>
|
|
<div class="line"><a id="l02270" name="l02270"></a><span class="lineno"> 2270</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> [unused_domain_size, pair_index] : pair_domain_sizes) {</div>
|
|
<div class="line"><a id="l02271" name="l02271"></a><span class="lineno"> 2271</span> <span class="keyword">const</span> <span class="keyword">auto</span>& index_pair = index_pairs[pair_index];</div>
|
|
<div class="line"><a id="l02272" name="l02272"></a><span class="lineno"> 2272</span> <span class="keywordtype">bool</span> pair_inserted = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l02273" name="l02273"></a><span class="lineno"> 2273</span> <span class="keywordflow">for</span> (int64_t pickup : index_pair.first) {</div>
|
|
<div class="line"><a id="l02274" name="l02274"></a><span class="lineno"> 2274</span> <span class="keywordflow">if</span> (pair_inserted || <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(pickup)) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l02275" name="l02275"></a><span class="lineno"> 2275</span> std::vector<NodeInsertion> pickup_insertion_positions;</div>
|
|
<div class="line"><a id="l02276" name="l02276"></a><span class="lineno"> 2276</span> <span class="keywordflow">for</span> (int64_t delivery : index_pair.second) {</div>
|
|
<div class="line"><a id="l02277" name="l02277"></a><span class="lineno"> 2277</span> <span class="comment">// If either is already in the solution, let it be inserted in the</span></div>
|
|
<div class="line"><a id="l02278" name="l02278"></a><span class="lineno"> 2278</span> <span class="comment">// standard node insertion loop.</span></div>
|
|
<div class="line"><a id="l02279" name="l02279"></a><span class="lineno"> 2279</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(delivery)) pair_inserted = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l02280" name="l02280"></a><span class="lineno"> 2280</span> <span class="keywordflow">if</span> (pair_inserted) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l02281" name="l02281"></a><span class="lineno"> 2281</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l02282" name="l02282"></a><span class="lineno"> 2282</span> visited[pickup] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l02283" name="l02283"></a><span class="lineno"> 2283</span> visited[delivery] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l02284" name="l02284"></a><span class="lineno"> 2284</span> <span class="keywordflow">if</span> (evaluate_pickup_delivery_costs_independently_) {</div>
|
|
<div class="line"><a id="l02285" name="l02285"></a><span class="lineno"> 2285</span> <span class="comment">// Lazily fetching pickup insertion positions.</span></div>
|
|
<div class="line"><a id="l02286" name="l02286"></a><span class="lineno"> 2286</span> <span class="keywordflow">if</span> (pickup_insertion_positions.empty()) {</div>
|
|
<div class="line"><a id="l02287" name="l02287"></a><span class="lineno"> 2287</span> pickup_insertion_positions =</div>
|
|
<div class="line"><a id="l02288" name="l02288"></a><span class="lineno"> 2288</span> ComputeEvaluatorSortedPositions(pickup);</div>
|
|
<div class="line"><a id="l02289" name="l02289"></a><span class="lineno"> 2289</span> }</div>
|
|
<div class="line"><a id="l02290" name="l02290"></a><span class="lineno"> 2290</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> [insert_pickup_after, pickup_vehicle,</div>
|
|
<div class="line"><a id="l02291" name="l02291"></a><span class="lineno"> 2291</span> unused_pickup_value] : pickup_insertion_positions) {</div>
|
|
<div class="line"><a id="l02292" name="l02292"></a><span class="lineno"> 2292</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> [insert_delivery_after, unused_delivery_vehicle,</div>
|
|
<div class="line"><a id="l02293" name="l02293"></a><span class="lineno"> 2293</span> unused_delivery_value] :</div>
|
|
<div class="line"><a id="l02294" name="l02294"></a><span class="lineno"> 2294</span> ComputeEvaluatorSortedPositionsOnRouteAfter(</div>
|
|
<div class="line"><a id="l02295" name="l02295"></a><span class="lineno"> 2295</span> delivery, pickup, <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(insert_pickup_after),</div>
|
|
<div class="line"><a id="l02296" name="l02296"></a><span class="lineno"> 2296</span> pickup_vehicle)) {</div>
|
|
<div class="line"><a id="l02297" name="l02297"></a><span class="lineno"> 2297</span> <span class="keywordflow">if</span> (insert_pair(pickup, insert_pickup_after, delivery,</div>
|
|
<div class="line"><a id="l02298" name="l02298"></a><span class="lineno"> 2298</span> insert_delivery_after, pickup_vehicle)) {</div>
|
|
<div class="line"><a id="l02299" name="l02299"></a><span class="lineno"> 2299</span> pair_inserted = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l02300" name="l02300"></a><span class="lineno"> 2300</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l02301" name="l02301"></a><span class="lineno"> 2301</span> }</div>
|
|
<div class="line"><a id="l02302" name="l02302"></a><span class="lineno"> 2302</span> }</div>
|
|
<div class="line"><a id="l02303" name="l02303"></a><span class="lineno"> 2303</span> <span class="keywordflow">if</span> (pair_inserted) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l02304" name="l02304"></a><span class="lineno"> 2304</span> }</div>
|
|
<div class="line"><a id="l02305" name="l02305"></a><span class="lineno"> 2305</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l02306" name="l02306"></a><span class="lineno"> 2306</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> [insert_pickup_after, insert_delivery_after,</div>
|
|
<div class="line"><a id="l02307" name="l02307"></a><span class="lineno"> 2307</span> unused_value, vehicle] :</div>
|
|
<div class="line"><a id="l02308" name="l02308"></a><span class="lineno"> 2308</span> ComputeEvaluatorSortedPairPositions(pickup, delivery)) {</div>
|
|
<div class="line"><a id="l02309" name="l02309"></a><span class="lineno"> 2309</span> <span class="keywordflow">if</span> (insert_pair(pickup, insert_pickup_after, delivery,</div>
|
|
<div class="line"><a id="l02310" name="l02310"></a><span class="lineno"> 2310</span> insert_delivery_after, vehicle)) {</div>
|
|
<div class="line"><a id="l02311" name="l02311"></a><span class="lineno"> 2311</span> pair_inserted = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l02312" name="l02312"></a><span class="lineno"> 2312</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l02313" name="l02313"></a><span class="lineno"> 2313</span> }</div>
|
|
<div class="line"><a id="l02314" name="l02314"></a><span class="lineno"> 2314</span> }</div>
|
|
<div class="line"><a id="l02315" name="l02315"></a><span class="lineno"> 2315</span> }</div>
|
|
<div class="line"><a id="l02316" name="l02316"></a><span class="lineno"> 2316</span> }</div>
|
|
<div class="line"><a id="l02317" name="l02317"></a><span class="lineno"> 2317</span> }</div>
|
|
<div class="line"><a id="l02318" name="l02318"></a><span class="lineno"> 2318</span> }</div>
|
|
<div class="line"><a id="l02319" name="l02319"></a><span class="lineno"> 2319</span> </div>
|
|
<div class="line"><a id="l02320" name="l02320"></a><span class="lineno"> 2320</span> std::priority_queue<Seed> node_queue;</div>
|
|
<div class="line"><a id="l02321" name="l02321"></a><span class="lineno"> 2321</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a69d38e86eb8fc2fa4df0d8839c8dd5a9">InitializePriorityQueue</a>(&start_end_distances_per_node_, &node_queue);</div>
|
|
<div class="line"><a id="l02322" name="l02322"></a><span class="lineno"> 2322</span> </div>
|
|
<div class="line"><a id="l02323" name="l02323"></a><span class="lineno"> 2323</span> <span class="comment">// Possible positions where the current node can be inserted.</span></div>
|
|
<div class="line"><a id="l02324" name="l02324"></a><span class="lineno"> 2324</span> <span class="keywordflow">while</span> (!node_queue.empty()) {</div>
|
|
<div class="line"><a id="l02325" name="l02325"></a><span class="lineno"> 2325</span> <span class="keyword">const</span> <span class="keywordtype">int</span> node = node_queue.top().second;</div>
|
|
<div class="line"><a id="l02326" name="l02326"></a><span class="lineno"> 2326</span> node_queue.pop();</div>
|
|
<div class="line"><a id="l02327" name="l02327"></a><span class="lineno"> 2327</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(node) || visited[node]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l02328" name="l02328"></a><span class="lineno"> 2328</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> [insert_after, vehicle, unused_value] :</div>
|
|
<div class="line"><a id="l02329" name="l02329"></a><span class="lineno"> 2329</span> ComputeEvaluatorSortedPositions(node)) {</div>
|
|
<div class="line"><a id="l02330" name="l02330"></a><span class="lineno"> 2330</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l02331" name="l02331"></a><span class="lineno"> 2331</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#add2710777ca3960d37c6257cd95edfee">InsertBetween</a>(node, insert_after, <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(insert_after), vehicle);</div>
|
|
<div class="line"><a id="l02332" name="l02332"></a><span class="lineno"> 2332</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value()) {</div>
|
|
<div class="line"><a id="l02333" name="l02333"></a><span class="lineno"> 2333</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l02334" name="l02334"></a><span class="lineno"> 2334</span> }</div>
|
|
<div class="line"><a id="l02335" name="l02335"></a><span class="lineno"> 2335</span> }</div>
|
|
<div class="line"><a id="l02336" name="l02336"></a><span class="lineno"> 2336</span> }</div>
|
|
<div class="line"><a id="l02337" name="l02337"></a><span class="lineno"> 2337</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a97049801609b8cb68c0428970f916fd4">MakeUnassignedNodesUnperformed</a>();</div>
|
|
<div class="line"><a id="l02338" name="l02338"></a><span class="lineno"> 2338</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value();</div>
|
|
<div class="line"><a id="l02339" name="l02339"></a><span class="lineno"> 2339</span>}</div>
|
|
<div class="line"><a id="l02340" name="l02340"></a><span class="lineno"> 2340</span> </div>
|
|
<div class="line"><a id="l02341" name="l02341"></a><span class="lineno"> 2341</span>std::vector<LocalCheapestInsertionFilteredHeuristic::NodeInsertion></div>
|
|
<div class="line"><a id="l02342" name="l02342"></a><span class="lineno"> 2342</span>LocalCheapestInsertionFilteredHeuristic::ComputeEvaluatorSortedPositions(</div>
|
|
<div class="line"><a id="l02343" name="l02343"></a><span class="lineno"> 2343</span> int64_t node) {</div>
|
|
<div class="line"><a id="l02344" name="l02344"></a><span class="lineno"> 2344</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(node));</div>
|
|
<div class="line"><a id="l02345" name="l02345"></a><span class="lineno"> 2345</span> std::vector<NodeInsertion> sorted_insertions;</div>
|
|
<div class="line"><a id="l02346" name="l02346"></a><span class="lineno"> 2346</span> <span class="keyword">const</span> <span class="keywordtype">int</span> size = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">Size</a>();</div>
|
|
<div class="line"><a id="l02347" name="l02347"></a><span class="lineno"> 2347</span> <span class="keywordflow">if</span> (node < size) {</div>
|
|
<div class="line"><a id="l02348" name="l02348"></a><span class="lineno"> 2348</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">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="l02349" name="l02349"></a><span class="lineno"> 2349</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a> = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(vehicle);</div>
|
|
<div class="line"><a id="l02350" name="l02350"></a><span class="lineno"> 2350</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ade9dca16a1e0dc26a1a8797874413fad">AppendInsertionPositionsAfter</a>(node, <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>, <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(<a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>), vehicle,</div>
|
|
<div class="line"><a id="l02351" name="l02351"></a><span class="lineno"> 2351</span> &sorted_insertions);</div>
|
|
<div class="line"><a id="l02352" name="l02352"></a><span class="lineno"> 2352</span> }</div>
|
|
<div class="line"><a id="l02353" name="l02353"></a><span class="lineno"> 2353</span> std::sort(sorted_insertions.begin(), sorted_insertions.end());</div>
|
|
<div class="line"><a id="l02354" name="l02354"></a><span class="lineno"> 2354</span> }</div>
|
|
<div class="line"><a id="l02355" name="l02355"></a><span class="lineno"> 2355</span> <span class="keywordflow">return</span> sorted_insertions;</div>
|
|
<div class="line"><a id="l02356" name="l02356"></a><span class="lineno"> 2356</span>}</div>
|
|
<div class="line"><a id="l02357" name="l02357"></a><span class="lineno"> 2357</span> </div>
|
|
<div class="line"><a id="l02358" name="l02358"></a><span class="lineno"> 2358</span>std::vector<LocalCheapestInsertionFilteredHeuristic::NodeInsertion></div>
|
|
<div class="line"><a id="l02359" name="l02359"></a><span class="lineno"> 2359</span>LocalCheapestInsertionFilteredHeuristic::</div>
|
|
<div class="line"><a id="l02360" name="l02360"></a><span class="lineno"> 2360</span> ComputeEvaluatorSortedPositionsOnRouteAfter(int64_t node, int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>,</div>
|
|
<div class="line"><a id="l02361" name="l02361"></a><span class="lineno"> 2361</span> int64_t next_after_start,</div>
|
|
<div class="line"><a id="l02362" name="l02362"></a><span class="lineno"> 2362</span> <span class="keywordtype">int</span> vehicle) {</div>
|
|
<div class="line"><a id="l02363" name="l02363"></a><span class="lineno"> 2363</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(node));</div>
|
|
<div class="line"><a id="l02364" name="l02364"></a><span class="lineno"> 2364</span> std::vector<NodeInsertion> sorted_insertions;</div>
|
|
<div class="line"><a id="l02365" name="l02365"></a><span class="lineno"> 2365</span> <span class="keyword">const</span> <span class="keywordtype">int</span> size = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">Size</a>();</div>
|
|
<div class="line"><a id="l02366" name="l02366"></a><span class="lineno"> 2366</span> <span class="keywordflow">if</span> (node < size) {</div>
|
|
<div class="line"><a id="l02367" name="l02367"></a><span class="lineno"> 2367</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ade9dca16a1e0dc26a1a8797874413fad">AppendInsertionPositionsAfter</a>(node, <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>, next_after_start, vehicle,</div>
|
|
<div class="line"><a id="l02368" name="l02368"></a><span class="lineno"> 2368</span> &sorted_insertions);</div>
|
|
<div class="line"><a id="l02369" name="l02369"></a><span class="lineno"> 2369</span> std::sort(sorted_insertions.begin(), sorted_insertions.end());</div>
|
|
<div class="line"><a id="l02370" name="l02370"></a><span class="lineno"> 2370</span> }</div>
|
|
<div class="line"><a id="l02371" name="l02371"></a><span class="lineno"> 2371</span> <span class="keywordflow">return</span> sorted_insertions;</div>
|
|
<div class="line"><a id="l02372" name="l02372"></a><span class="lineno"> 2372</span>}</div>
|
|
<div class="line"><a id="l02373" name="l02373"></a><span class="lineno"> 2373</span> </div>
|
|
<div class="line"><a id="l02374" name="l02374"></a><span class="lineno"> 2374</span>std::vector<LocalCheapestInsertionFilteredHeuristic::PickupDeliveryInsertion></div>
|
|
<div class="line"><a id="l02375" name="l02375"></a><span class="lineno"> 2375</span>LocalCheapestInsertionFilteredHeuristic::ComputeEvaluatorSortedPairPositions(</div>
|
|
<div class="line"><a id="l02376" name="l02376"></a><span class="lineno"> 2376</span> int64_t pickup, int64_t delivery) {</div>
|
|
<div class="line"><a id="l02377" name="l02377"></a><span class="lineno"> 2377</span> std::vector<PickupDeliveryInsertion> sorted_pickup_delivery_insertions;</div>
|
|
<div class="line"><a id="l02378" name="l02378"></a><span class="lineno"> 2378</span> <span class="keyword">const</span> <span class="keywordtype">int</span> size = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">Size</a>();</div>
|
|
<div class="line"><a id="l02379" name="l02379"></a><span class="lineno"> 2379</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(pickup, size);</div>
|
|
<div class="line"><a id="l02380" name="l02380"></a><span class="lineno"> 2380</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(delivery, size);</div>
|
|
<div class="line"><a id="l02381" name="l02381"></a><span class="lineno"> 2381</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">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="l02382" name="l02382"></a><span class="lineno"> 2382</span> int64_t insert_pickup_after = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(vehicle);</div>
|
|
<div class="line"><a id="l02383" name="l02383"></a><span class="lineno"> 2383</span> <span class="keywordflow">while</span> (!<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->IsEnd(insert_pickup_after)) {</div>
|
|
<div class="line"><a id="l02384" name="l02384"></a><span class="lineno"> 2384</span> <span class="keyword">const</span> int64_t insert_pickup_before = <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(insert_pickup_after);</div>
|
|
<div class="line"><a id="l02385" name="l02385"></a><span class="lineno"> 2385</span> int64_t insert_delivery_after = pickup;</div>
|
|
<div class="line"><a id="l02386" name="l02386"></a><span class="lineno"> 2386</span> <span class="keywordflow">while</span> (!<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->IsEnd(insert_delivery_after)) {</div>
|
|
<div class="line"><a id="l02387" name="l02387"></a><span class="lineno"> 2387</span> <span class="keyword">const</span> int64_t insert_delivery_before =</div>
|
|
<div class="line"><a id="l02388" name="l02388"></a><span class="lineno"> 2388</span> insert_delivery_after == pickup ? insert_pickup_before</div>
|
|
<div class="line"><a id="l02389" name="l02389"></a><span class="lineno"> 2389</span> : <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(insert_delivery_after);</div>
|
|
<div class="line"><a id="l02390" name="l02390"></a><span class="lineno"> 2390</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a4c042f054da687c4a586dc5d3dfaef10">evaluator_</a> == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l02391" name="l02391"></a><span class="lineno"> 2391</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#add2710777ca3960d37c6257cd95edfee">InsertBetween</a>(pickup, insert_pickup_after, insert_pickup_before,</div>
|
|
<div class="line"><a id="l02392" name="l02392"></a><span class="lineno"> 2392</span> vehicle);</div>
|
|
<div class="line"><a id="l02393" name="l02393"></a><span class="lineno"> 2393</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#add2710777ca3960d37c6257cd95edfee">InsertBetween</a>(delivery, insert_delivery_after, insert_delivery_before,</div>
|
|
<div class="line"><a id="l02394" name="l02394"></a><span class="lineno"> 2394</span> vehicle);</div>
|
|
<div class="line"><a id="l02395" name="l02395"></a><span class="lineno"> 2395</span> std::optional<int64_t> insertion_cost = <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l02396" name="l02396"></a><span class="lineno"> 2396</span> <span class="keywordflow">if</span> (insertion_cost.has_value()) {</div>
|
|
<div class="line"><a id="l02397" name="l02397"></a><span class="lineno"> 2397</span> sorted_pickup_delivery_insertions.push_back(</div>
|
|
<div class="line"><a id="l02398" name="l02398"></a><span class="lineno"> 2398</span> {insert_pickup_after, insert_delivery_after, *insertion_cost,</div>
|
|
<div class="line"><a id="l02399" name="l02399"></a><span class="lineno"> 2399</span> vehicle});</div>
|
|
<div class="line"><a id="l02400" name="l02400"></a><span class="lineno"> 2400</span> }</div>
|
|
<div class="line"><a id="l02401" name="l02401"></a><span class="lineno"> 2401</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l02402" name="l02402"></a><span class="lineno"> 2402</span> sorted_pickup_delivery_insertions.push_back(</div>
|
|
<div class="line"><a id="l02403" name="l02403"></a><span class="lineno"> 2403</span> {insert_pickup_after, insert_delivery_after,</div>
|
|
<div class="line"><a id="l02404" name="l02404"></a><span class="lineno"> 2404</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a750200f78e5b4a8192dc7ad3b6b10eec">GetInsertionCostForNodeAtPosition</a>(</div>
|
|
<div class="line"><a id="l02405" name="l02405"></a><span class="lineno"> 2405</span> pickup, insert_pickup_after, insert_pickup_before,</div>
|
|
<div class="line"><a id="l02406" name="l02406"></a><span class="lineno"> 2406</span> vehicle),</div>
|
|
<div class="line"><a id="l02407" name="l02407"></a><span class="lineno"> 2407</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a750200f78e5b4a8192dc7ad3b6b10eec">GetInsertionCostForNodeAtPosition</a>(</div>
|
|
<div class="line"><a id="l02408" name="l02408"></a><span class="lineno"> 2408</span> delivery, insert_delivery_after,</div>
|
|
<div class="line"><a id="l02409" name="l02409"></a><span class="lineno"> 2409</span> insert_delivery_before, vehicle)),</div>
|
|
<div class="line"><a id="l02410" name="l02410"></a><span class="lineno"> 2410</span> vehicle});</div>
|
|
<div class="line"><a id="l02411" name="l02411"></a><span class="lineno"> 2411</span> }</div>
|
|
<div class="line"><a id="l02412" name="l02412"></a><span class="lineno"> 2412</span> insert_delivery_after = insert_delivery_before;</div>
|
|
<div class="line"><a id="l02413" name="l02413"></a><span class="lineno"> 2413</span> }</div>
|
|
<div class="line"><a id="l02414" name="l02414"></a><span class="lineno"> 2414</span> insert_pickup_after = insert_pickup_before;</div>
|
|
<div class="line"><a id="l02415" name="l02415"></a><span class="lineno"> 2415</span> }</div>
|
|
<div class="line"><a id="l02416" name="l02416"></a><span class="lineno"> 2416</span> }</div>
|
|
<div class="line"><a id="l02417" name="l02417"></a><span class="lineno"> 2417</span> std::sort(sorted_pickup_delivery_insertions.begin(),</div>
|
|
<div class="line"><a id="l02418" name="l02418"></a><span class="lineno"> 2418</span> sorted_pickup_delivery_insertions.end());</div>
|
|
<div class="line"><a id="l02419" name="l02419"></a><span class="lineno"> 2419</span> <span class="keywordflow">return</span> sorted_pickup_delivery_insertions;</div>
|
|
<div class="line"><a id="l02420" name="l02420"></a><span class="lineno"> 2420</span>}</div>
|
|
<div class="line"><a id="l02421" name="l02421"></a><span class="lineno"> 2421</span> </div>
|
|
<div class="line"><a id="l02422" name="l02422"></a><span class="lineno"> 2422</span><span class="comment">// CheapestAdditionFilteredHeuristic</span></div>
|
|
<div class="line"><a id="l02423" name="l02423"></a><span class="lineno"> 2423</span> </div>
|
|
<div class="line"><a id="l02424" name="l02424"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html#afec155b0f80a58cf5d632413078cc4f2"> 2424</a></span><a class="code hl_function" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html#afec155b0f80a58cf5d632413078cc4f2">CheapestAdditionFilteredHeuristic::CheapestAdditionFilteredHeuristic</a>(</div>
|
|
<div class="line"><a id="l02425" name="l02425"></a><span class="lineno"> 2425</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager)</div>
|
|
<div class="line"><a id="l02426" name="l02426"></a><span class="lineno"> 2426</span> : <a class="code hl_class" href="classoperations__research_1_1_routing_filtered_heuristic.html">RoutingFilteredHeuristic</a>(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, filter_manager) {}</div>
|
|
<div class="line"><a id="l02427" name="l02427"></a><span class="lineno"> 2427</span> </div>
|
|
<div class="line"><a id="l02428" name="l02428"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289"> 2428</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">CheapestAdditionFilteredHeuristic::BuildSolutionInternal</a>() {</div>
|
|
<div class="line"><a id="l02429" name="l02429"></a><span class="lineno"> 2429</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a> = -1;</div>
|
|
<div class="line"><a id="l02430" name="l02430"></a><span class="lineno"> 2430</span> <span class="keyword">const</span> <a class="code hl_typedef" href="classoperations__research_1_1_routing_model.html#a76874cd778ea1b9220673e019f9e7abe">RoutingModel::IndexPairs</a>& pairs = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a251dfaa30251901d13cd2f33a92571ac">GetPickupAndDeliveryPairs</a>();</div>
|
|
<div class="line"><a id="l02431" name="l02431"></a><span class="lineno"> 2431</span> std::vector<std::vector<int64_t>> deliveries(<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>());</div>
|
|
<div class="line"><a id="l02432" name="l02432"></a><span class="lineno"> 2432</span> std::vector<std::vector<int64_t>> pickups(<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">Size</a>());</div>
|
|
<div class="line"><a id="l02433" name="l02433"></a><span class="lineno"> 2433</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_typedef" href="classoperations__research_1_1_routing_model.html#a1636c49d2587c3d9df16918345b82378">RoutingModel::IndexPair</a>& pair : pairs) {</div>
|
|
<div class="line"><a id="l02434" name="l02434"></a><span class="lineno"> 2434</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> first : pair.first) {</div>
|
|
<div class="line"><a id="l02435" name="l02435"></a><span class="lineno"> 2435</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> second : pair.second) {</div>
|
|
<div class="line"><a id="l02436" name="l02436"></a><span class="lineno"> 2436</span> deliveries[first].push_back(second);</div>
|
|
<div class="line"><a id="l02437" name="l02437"></a><span class="lineno"> 2437</span> pickups[second].push_back(first);</div>
|
|
<div class="line"><a id="l02438" name="l02438"></a><span class="lineno"> 2438</span> }</div>
|
|
<div class="line"><a id="l02439" name="l02439"></a><span class="lineno"> 2439</span> }</div>
|
|
<div class="line"><a id="l02440" name="l02440"></a><span class="lineno"> 2440</span> }</div>
|
|
<div class="line"><a id="l02441" name="l02441"></a><span class="lineno"> 2441</span> <span class="comment">// To mimic the behavior of PathSelector (cf. search.cc), iterating on</span></div>
|
|
<div class="line"><a id="l02442" name="l02442"></a><span class="lineno"> 2442</span> <span class="comment">// routes with partial route at their start first then on routes with largest</span></div>
|
|
<div class="line"><a id="l02443" name="l02443"></a><span class="lineno"> 2443</span> <span class="comment">// index.</span></div>
|
|
<div class="line"><a id="l02444" name="l02444"></a><span class="lineno"> 2444</span> std::vector<int> sorted_vehicles(<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->vehicles(), 0);</div>
|
|
<div class="line"><a id="l02445" name="l02445"></a><span class="lineno"> 2445</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">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="l02446" name="l02446"></a><span class="lineno"> 2446</span> sorted_vehicles[vehicle] = vehicle;</div>
|
|
<div class="line"><a id="l02447" name="l02447"></a><span class="lineno"> 2447</span> }</div>
|
|
<div class="line"><a id="l02448" name="l02448"></a><span class="lineno"> 2448</span> std::sort(sorted_vehicles.begin(), sorted_vehicles.end(),</div>
|
|
<div class="line"><a id="l02449" name="l02449"></a><span class="lineno"> 2449</span> PartialRoutesAndLargeVehicleIndicesFirst(*<span class="keyword">this</span>));</div>
|
|
<div class="line"><a id="l02450" name="l02450"></a><span class="lineno"> 2450</span> <span class="comment">// Neighbors of the node currently being extended.</span></div>
|
|
<div class="line"><a id="l02451" name="l02451"></a><span class="lineno"> 2451</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> vehicle : sorted_vehicles) {</div>
|
|
<div class="line"><a id="l02452" name="l02452"></a><span class="lineno"> 2452</span> int64_t last_node = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a2ace3be57d4d81121e8ebbd3642052c0">GetStartChainEnd</a>(vehicle);</div>
|
|
<div class="line"><a id="l02453" name="l02453"></a><span class="lineno"> 2453</span> <span class="keywordtype">bool</span> extend_route = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l02454" name="l02454"></a><span class="lineno"> 2454</span> <span class="comment">// Extend the route of the current vehicle while it's possible. We can</span></div>
|
|
<div class="line"><a id="l02455" name="l02455"></a><span class="lineno"> 2455</span> <span class="comment">// iterate more than once if pickup and delivery pairs have been inserted</span></div>
|
|
<div class="line"><a id="l02456" name="l02456"></a><span class="lineno"> 2456</span> <span class="comment">// in the last iteration (see comment below); the new iteration will try to</span></div>
|
|
<div class="line"><a id="l02457" name="l02457"></a><span class="lineno"> 2457</span> <span class="comment">// extend the route after the last delivery on the route.</span></div>
|
|
<div class="line"><a id="l02458" name="l02458"></a><span class="lineno"> 2458</span> <span class="keywordflow">while</span> (extend_route) {</div>
|
|
<div class="line"><a id="l02459" name="l02459"></a><span class="lineno"> 2459</span> extend_route = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l02460" name="l02460"></a><span class="lineno"> 2460</span> <span class="keywordtype">bool</span> found = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l02461" name="l02461"></a><span class="lineno"> 2461</span> int64_t <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a> = last_node;</div>
|
|
<div class="line"><a id="l02462" name="l02462"></a><span class="lineno"> 2462</span> int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a> = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a8a3ae6ba0baf1765da1a2f4a6cecc730">GetEndChainStart</a>(vehicle);</div>
|
|
<div class="line"><a id="l02463" name="l02463"></a><span class="lineno"> 2463</span> <span class="comment">// Extend the route until either the end node of the vehicle is reached</span></div>
|
|
<div class="line"><a id="l02464" name="l02464"></a><span class="lineno"> 2464</span> <span class="comment">// or no node or node pair can be added. Deliveries in pickup and</span></div>
|
|
<div class="line"><a id="l02465" name="l02465"></a><span class="lineno"> 2465</span> <span class="comment">// delivery pairs are added at the same time as pickups, at the end of the</span></div>
|
|
<div class="line"><a id="l02466" name="l02466"></a><span class="lineno"> 2466</span> <span class="comment">// route, in reverse order of the pickups. Deliveries are never added</span></div>
|
|
<div class="line"><a id="l02467" name="l02467"></a><span class="lineno"> 2467</span> <span class="comment">// alone.</span></div>
|
|
<div class="line"><a id="l02468" name="l02468"></a><span class="lineno"> 2468</span> <span class="keywordflow">while</span> (found && !<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->IsEnd(<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>)) {</div>
|
|
<div class="line"><a id="l02469" name="l02469"></a><span class="lineno"> 2469</span> found = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l02470" name="l02470"></a><span class="lineno"> 2470</span> std::vector<int64_t> neighbors;</div>
|
|
<div class="line"><a id="l02471" name="l02471"></a><span class="lineno"> 2471</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a> < <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->Nexts().size()) {</div>
|
|
<div class="line"><a id="l02472" name="l02472"></a><span class="lineno"> 2472</span> std::unique_ptr<IntVarIterator> it(</div>
|
|
<div class="line"><a id="l02473" name="l02473"></a><span class="lineno"> 2473</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->Nexts()[<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>]->MakeDomainIterator(<span class="keyword">false</span>));</div>
|
|
<div class="line"><a id="l02474" name="l02474"></a><span class="lineno"> 2474</span> <span class="keyword">auto</span> next_values = <a class="code hl_class" href="classoperations__research_1_1_init_and_get_values.html">InitAndGetValues</a>(it.get());</div>
|
|
<div class="line"><a id="l02475" name="l02475"></a><span class="lineno"> 2475</span> neighbors = GetPossibleNextsFromIterator(<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>, next_values.begin(),</div>
|
|
<div class="line"><a id="l02476" name="l02476"></a><span class="lineno"> 2476</span> next_values.end());</div>
|
|
<div class="line"><a id="l02477" name="l02477"></a><span class="lineno"> 2477</span> }</div>
|
|
<div class="line"><a id="l02478" name="l02478"></a><span class="lineno"> 2478</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; !found && i < neighbors.size(); ++i) {</div>
|
|
<div class="line"><a id="l02479" name="l02479"></a><span class="lineno"> 2479</span> int64_t <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = -1;</div>
|
|
<div class="line"><a id="l02480" name="l02480"></a><span class="lineno"> 2480</span> <span class="keywordflow">switch</span> (i) {</div>
|
|
<div class="line"><a id="l02481" name="l02481"></a><span class="lineno"> 2481</span> <span class="keywordflow">case</span> 0:</div>
|
|
<div class="line"><a id="l02482" name="l02482"></a><span class="lineno"> 2482</span> <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = FindTopSuccessor(<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>, neighbors);</div>
|
|
<div class="line"><a id="l02483" name="l02483"></a><span class="lineno"> 2483</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l02484" name="l02484"></a><span class="lineno"> 2484</span> <span class="keywordflow">case</span> 1:</div>
|
|
<div class="line"><a id="l02485" name="l02485"></a><span class="lineno"> 2485</span> SortSuccessors(<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>, &neighbors);</div>
|
|
<div class="line"><a id="l02486" name="l02486"></a><span class="lineno"> 2486</span> ABSL_FALLTHROUGH_INTENDED;</div>
|
|
<div class="line"><a id="l02487" name="l02487"></a><span class="lineno"> 2487</span> <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a id="l02488" name="l02488"></a><span class="lineno"> 2488</span> <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = neighbors[i];</div>
|
|
<div class="line"><a id="l02489" name="l02489"></a><span class="lineno"> 2489</span> }</div>
|
|
<div class="line"><a id="l02490" name="l02490"></a><span class="lineno"> 2490</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->IsEnd(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>) && <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> != <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>) {</div>
|
|
<div class="line"><a id="l02491" name="l02491"></a><span class="lineno"> 2491</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l02492" name="l02492"></a><span class="lineno"> 2492</span> }</div>
|
|
<div class="line"><a id="l02493" name="l02493"></a><span class="lineno"> 2493</span> <span class="comment">// Only add a delivery if one of its pickups has been added already.</span></div>
|
|
<div class="line"><a id="l02494" name="l02494"></a><span class="lineno"> 2494</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->IsEnd(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>) && !pickups[<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>].empty()) {</div>
|
|
<div class="line"><a id="l02495" name="l02495"></a><span class="lineno"> 2495</span> <span class="keywordtype">bool</span> contains_pickups = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l02496" name="l02496"></a><span class="lineno"> 2496</span> <span class="keywordflow">for</span> (int64_t pickup : pickups[<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>]) {</div>
|
|
<div class="line"><a id="l02497" name="l02497"></a><span class="lineno"> 2497</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(pickup)) {</div>
|
|
<div class="line"><a id="l02498" name="l02498"></a><span class="lineno"> 2498</span> contains_pickups = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l02499" name="l02499"></a><span class="lineno"> 2499</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l02500" name="l02500"></a><span class="lineno"> 2500</span> }</div>
|
|
<div class="line"><a id="l02501" name="l02501"></a><span class="lineno"> 2501</span> }</div>
|
|
<div class="line"><a id="l02502" name="l02502"></a><span class="lineno"> 2502</span> <span class="keywordflow">if</span> (!contains_pickups) {</div>
|
|
<div class="line"><a id="l02503" name="l02503"></a><span class="lineno"> 2503</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l02504" name="l02504"></a><span class="lineno"> 2504</span> }</div>
|
|
<div class="line"><a id="l02505" name="l02505"></a><span class="lineno"> 2505</span> }</div>
|
|
<div class="line"><a id="l02506" name="l02506"></a><span class="lineno"> 2506</span> std::vector<int64_t> next_deliveries;</div>
|
|
<div class="line"><a id="l02507" name="l02507"></a><span class="lineno"> 2507</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> < deliveries.size()) {</div>
|
|
<div class="line"><a id="l02508" name="l02508"></a><span class="lineno"> 2508</span> next_deliveries = GetPossibleNextsFromIterator(</div>
|
|
<div class="line"><a id="l02509" name="l02509"></a><span class="lineno"> 2509</span> <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, deliveries[<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>].begin(), deliveries[<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>].<a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>());</div>
|
|
<div class="line"><a id="l02510" name="l02510"></a><span class="lineno"> 2510</span> }</div>
|
|
<div class="line"><a id="l02511" name="l02511"></a><span class="lineno"> 2511</span> <span class="keywordflow">if</span> (next_deliveries.empty()) next_deliveries = {<a class="code hl_variable" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a>};</div>
|
|
<div class="line"><a id="l02512" name="l02512"></a><span class="lineno"> 2512</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; !found && j < next_deliveries.size(); ++j) {</div>
|
|
<div class="line"><a id="l02513" name="l02513"></a><span class="lineno"> 2513</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l02514" name="l02514"></a><span class="lineno"> 2514</span> <span class="keywordtype">int</span> delivery = -1;</div>
|
|
<div class="line"><a id="l02515" name="l02515"></a><span class="lineno"> 2515</span> <span class="keywordflow">switch</span> (j) {</div>
|
|
<div class="line"><a id="l02516" name="l02516"></a><span class="lineno"> 2516</span> <span class="keywordflow">case</span> 0:</div>
|
|
<div class="line"><a id="l02517" name="l02517"></a><span class="lineno"> 2517</span> delivery = FindTopSuccessor(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, next_deliveries);</div>
|
|
<div class="line"><a id="l02518" name="l02518"></a><span class="lineno"> 2518</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l02519" name="l02519"></a><span class="lineno"> 2519</span> <span class="keywordflow">case</span> 1:</div>
|
|
<div class="line"><a id="l02520" name="l02520"></a><span class="lineno"> 2520</span> SortSuccessors(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, &next_deliveries);</div>
|
|
<div class="line"><a id="l02521" name="l02521"></a><span class="lineno"> 2521</span> ABSL_FALLTHROUGH_INTENDED;</div>
|
|
<div class="line"><a id="l02522" name="l02522"></a><span class="lineno"> 2522</span> <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a id="l02523" name="l02523"></a><span class="lineno"> 2523</span> delivery = next_deliveries[j];</div>
|
|
<div class="line"><a id="l02524" name="l02524"></a><span class="lineno"> 2524</span> }</div>
|
|
<div class="line"><a id="l02525" name="l02525"></a><span class="lineno"> 2525</span> <span class="comment">// Insert "next" after "index", and before "end" if it is not the</span></div>
|
|
<div class="line"><a id="l02526" name="l02526"></a><span class="lineno"> 2526</span> <span class="comment">// end already.</span></div>
|
|
<div class="line"><a id="l02527" name="l02527"></a><span class="lineno"> 2527</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>, <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a id="l02528" name="l02528"></a><span class="lineno"> 2528</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->IsEnd(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)) {</div>
|
|
<div class="line"><a id="l02529" name="l02529"></a><span class="lineno"> 2529</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>);</div>
|
|
<div class="line"><a id="l02530" name="l02530"></a><span class="lineno"> 2530</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a954a436d9a6c975e9d88f2ec659bb090">MakeDisjunctionNodesUnperformed</a>(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a id="l02531" name="l02531"></a><span class="lineno"> 2531</span> <span class="keywordflow">if</span> (delivery != <a class="code hl_variable" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a>) {</div>
|
|
<div class="line"><a id="l02532" name="l02532"></a><span class="lineno"> 2532</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, delivery);</div>
|
|
<div class="line"><a id="l02533" name="l02533"></a><span class="lineno"> 2533</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(delivery, <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>);</div>
|
|
<div class="line"><a id="l02534" name="l02534"></a><span class="lineno"> 2534</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a954a436d9a6c975e9d88f2ec659bb090">MakeDisjunctionNodesUnperformed</a>(delivery);</div>
|
|
<div class="line"><a id="l02535" name="l02535"></a><span class="lineno"> 2535</span> }</div>
|
|
<div class="line"><a id="l02536" name="l02536"></a><span class="lineno"> 2536</span> }</div>
|
|
<div class="line"><a id="l02537" name="l02537"></a><span class="lineno"> 2537</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value()) {</div>
|
|
<div class="line"><a id="l02538" name="l02538"></a><span class="lineno"> 2538</span> <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a> = <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a id="l02539" name="l02539"></a><span class="lineno"> 2539</span> found = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l02540" name="l02540"></a><span class="lineno"> 2540</span> <span class="keywordflow">if</span> (delivery != <a class="code hl_variable" href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">kUnassigned</a>) {</div>
|
|
<div class="line"><a id="l02541" name="l02541"></a><span class="lineno"> 2541</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->IsEnd(<a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>) && last_node != delivery) {</div>
|
|
<div class="line"><a id="l02542" name="l02542"></a><span class="lineno"> 2542</span> last_node = delivery;</div>
|
|
<div class="line"><a id="l02543" name="l02543"></a><span class="lineno"> 2543</span> extend_route = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l02544" name="l02544"></a><span class="lineno"> 2544</span> }</div>
|
|
<div class="line"><a id="l02545" name="l02545"></a><span class="lineno"> 2545</span> <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a> = delivery;</div>
|
|
<div class="line"><a id="l02546" name="l02546"></a><span class="lineno"> 2546</span> }</div>
|
|
<div class="line"><a id="l02547" name="l02547"></a><span class="lineno"> 2547</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l02548" name="l02548"></a><span class="lineno"> 2548</span> }</div>
|
|
<div class="line"><a id="l02549" name="l02549"></a><span class="lineno"> 2549</span> }</div>
|
|
<div class="line"><a id="l02550" name="l02550"></a><span class="lineno"> 2550</span> }</div>
|
|
<div class="line"><a id="l02551" name="l02551"></a><span class="lineno"> 2551</span> }</div>
|
|
<div class="line"><a id="l02552" name="l02552"></a><span class="lineno"> 2552</span> }</div>
|
|
<div class="line"><a id="l02553" name="l02553"></a><span class="lineno"> 2553</span> }</div>
|
|
<div class="line"><a id="l02554" name="l02554"></a><span class="lineno"> 2554</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a97049801609b8cb68c0428970f916fd4">MakeUnassignedNodesUnperformed</a>();</div>
|
|
<div class="line"><a id="l02555" name="l02555"></a><span class="lineno"> 2555</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value();</div>
|
|
<div class="line"><a id="l02556" name="l02556"></a><span class="lineno"> 2556</span>}</div>
|
|
<div class="line"><a id="l02557" name="l02557"></a><span class="lineno"> 2557</span> </div>
|
|
<div class="line"><a id="l02558" name="l02558"></a><span class="lineno"> 2558</span><span class="keywordtype">bool</span> CheapestAdditionFilteredHeuristic::</div>
|
|
<div class="line"><a id="l02559" name="l02559"></a><span class="lineno"> 2559</span> PartialRoutesAndLargeVehicleIndicesFirst::operator()(<span class="keywordtype">int</span> vehicle1,</div>
|
|
<div class="line"><a id="l02560" name="l02560"></a><span class="lineno"> 2560</span> <span class="keywordtype">int</span> vehicle2)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l02561" name="l02561"></a><span class="lineno"> 2561</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> has_partial_route1 = (builder_.model()->Start(vehicle1) !=</div>
|
|
<div class="line"><a id="l02562" name="l02562"></a><span class="lineno"> 2562</span> builder_.GetStartChainEnd(vehicle1));</div>
|
|
<div class="line"><a id="l02563" name="l02563"></a><span class="lineno"> 2563</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> has_partial_route2 = (builder_.model()->Start(vehicle2) !=</div>
|
|
<div class="line"><a id="l02564" name="l02564"></a><span class="lineno"> 2564</span> builder_.GetStartChainEnd(vehicle2));</div>
|
|
<div class="line"><a id="l02565" name="l02565"></a><span class="lineno"> 2565</span> <span class="keywordflow">if</span> (has_partial_route1 == has_partial_route2) {</div>
|
|
<div class="line"><a id="l02566" name="l02566"></a><span class="lineno"> 2566</span> <span class="keywordflow">return</span> vehicle2 < vehicle1;</div>
|
|
<div class="line"><a id="l02567" name="l02567"></a><span class="lineno"> 2567</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l02568" name="l02568"></a><span class="lineno"> 2568</span> <span class="keywordflow">return</span> has_partial_route2 < has_partial_route1;</div>
|
|
<div class="line"><a id="l02569" name="l02569"></a><span class="lineno"> 2569</span> }</div>
|
|
<div class="line"><a id="l02570" name="l02570"></a><span class="lineno"> 2570</span>}</div>
|
|
<div class="line"><a id="l02571" name="l02571"></a><span class="lineno"> 2571</span> </div>
|
|
<div class="line"><a id="l02572" name="l02572"></a><span class="lineno"> 2572</span><span class="comment">// EvaluatorCheapestAdditionFilteredHeuristic</span></div>
|
|
<div class="line"><a id="l02573" name="l02573"></a><span class="lineno"> 2573</span> </div>
|
|
<div class="line"><a id="l02574" name="l02574"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic.html#a3708f86f49ec8005ba0cd16a4bf9ab8f"> 2574</a></span><a class="code hl_function" href="classoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic.html#a3708f86f49ec8005ba0cd16a4bf9ab8f">EvaluatorCheapestAdditionFilteredHeuristic::</a></div>
|
|
<div class="line"><a id="l02575" name="l02575"></a><span class="lineno"> 2575</span><a class="code hl_function" href="classoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic.html#a3708f86f49ec8005ba0cd16a4bf9ab8f"> EvaluatorCheapestAdditionFilteredHeuristic</a>(</div>
|
|
<div class="line"><a id="l02576" name="l02576"></a><span class="lineno"> 2576</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, std::function<int64_t(int64_t, int64_t)> evaluator,</div>
|
|
<div class="line"><a id="l02577" name="l02577"></a><span class="lineno"> 2577</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager)</div>
|
|
<div class="line"><a id="l02578" name="l02578"></a><span class="lineno"> 2578</span> : <a class="code hl_class" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html">CheapestAdditionFilteredHeuristic</a>(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, filter_manager),</div>
|
|
<div class="line"><a id="l02579" name="l02579"></a><span class="lineno"> 2579</span> <a class="code hl_variable" href="search_8cc.html#ab8e7cdbcc8db4792b2ca9b8d4f5b0772">evaluator_</a>(<a class="code hl_namespace" href="namespacestd.html">std</a>::move(evaluator)) {}</div>
|
|
<div class="line"><a id="l02580" name="l02580"></a><span class="lineno"> 2580</span> </div>
|
|
<div class="line"><a id="l02581" name="l02581"></a><span class="lineno"> 2581</span>int64_t EvaluatorCheapestAdditionFilteredHeuristic::FindTopSuccessor(</div>
|
|
<div class="line"><a id="l02582" name="l02582"></a><span class="lineno"> 2582</span> int64_t node, <span class="keyword">const</span> std::vector<int64_t>& successors) {</div>
|
|
<div class="line"><a id="l02583" name="l02583"></a><span class="lineno"> 2583</span> int64_t best_evaluation = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a id="l02584" name="l02584"></a><span class="lineno"> 2584</span> int64_t best_successor = -1;</div>
|
|
<div class="line"><a id="l02585" name="l02585"></a><span class="lineno"> 2585</span> <span class="keywordflow">for</span> (int64_t successor : successors) {</div>
|
|
<div class="line"><a id="l02586" name="l02586"></a><span class="lineno"> 2586</span> <span class="keyword">const</span> int64_t evaluation = (successor >= 0)</div>
|
|
<div class="line"><a id="l02587" name="l02587"></a><span class="lineno"> 2587</span> ? evaluator_(node, successor)</div>
|
|
<div class="line"><a id="l02588" name="l02588"></a><span class="lineno"> 2588</span> : <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a id="l02589" name="l02589"></a><span class="lineno"> 2589</span> <span class="keywordflow">if</span> (evaluation < best_evaluation ||</div>
|
|
<div class="line"><a id="l02590" name="l02590"></a><span class="lineno"> 2590</span> (evaluation == best_evaluation && successor > best_successor)) {</div>
|
|
<div class="line"><a id="l02591" name="l02591"></a><span class="lineno"> 2591</span> best_evaluation = evaluation;</div>
|
|
<div class="line"><a id="l02592" name="l02592"></a><span class="lineno"> 2592</span> best_successor = successor;</div>
|
|
<div class="line"><a id="l02593" name="l02593"></a><span class="lineno"> 2593</span> }</div>
|
|
<div class="line"><a id="l02594" name="l02594"></a><span class="lineno"> 2594</span> }</div>
|
|
<div class="line"><a id="l02595" name="l02595"></a><span class="lineno"> 2595</span> <span class="keywordflow">return</span> best_successor;</div>
|
|
<div class="line"><a id="l02596" name="l02596"></a><span class="lineno"> 2596</span>}</div>
|
|
<div class="line"><a id="l02597" name="l02597"></a><span class="lineno"> 2597</span> </div>
|
|
<div class="line"><a id="l02598" name="l02598"></a><span class="lineno"> 2598</span><span class="keywordtype">void</span> EvaluatorCheapestAdditionFilteredHeuristic::SortSuccessors(</div>
|
|
<div class="line"><a id="l02599" name="l02599"></a><span class="lineno"> 2599</span> int64_t node, std::vector<int64_t>* successors) {</div>
|
|
<div class="line"><a id="l02600" name="l02600"></a><span class="lineno"> 2600</span> std::vector<std::pair<int64_t, int64_t>> values;</div>
|
|
<div class="line"><a id="l02601" name="l02601"></a><span class="lineno"> 2601</span> values.reserve(successors->size());</div>
|
|
<div class="line"><a id="l02602" name="l02602"></a><span class="lineno"> 2602</span> <span class="keywordflow">for</span> (int64_t successor : *successors) {</div>
|
|
<div class="line"><a id="l02603" name="l02603"></a><span class="lineno"> 2603</span> <span class="comment">// Tie-breaking on largest node index to mimic the behavior of</span></div>
|
|
<div class="line"><a id="l02604" name="l02604"></a><span class="lineno"> 2604</span> <span class="comment">// CheapestValueSelector (search.cc).</span></div>
|
|
<div class="line"><a id="l02605" name="l02605"></a><span class="lineno"> 2605</span> values.push_back({evaluator_(node, successor), -successor});</div>
|
|
<div class="line"><a id="l02606" name="l02606"></a><span class="lineno"> 2606</span> }</div>
|
|
<div class="line"><a id="l02607" name="l02607"></a><span class="lineno"> 2607</span> std::sort(values.begin(), values.end());</div>
|
|
<div class="line"><a id="l02608" name="l02608"></a><span class="lineno"> 2608</span> successors->clear();</div>
|
|
<div class="line"><a id="l02609" name="l02609"></a><span class="lineno"> 2609</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> <a class="code hl_variable" href="routing__search_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> : values) {</div>
|
|
<div class="line"><a id="l02610" name="l02610"></a><span class="lineno"> 2610</span> successors->push_back(-<a class="code hl_variable" href="routing__search_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>.second);</div>
|
|
<div class="line"><a id="l02611" name="l02611"></a><span class="lineno"> 2611</span> }</div>
|
|
<div class="line"><a id="l02612" name="l02612"></a><span class="lineno"> 2612</span>}</div>
|
|
<div class="line"><a id="l02613" name="l02613"></a><span class="lineno"> 2613</span> </div>
|
|
<div class="line"><a id="l02614" name="l02614"></a><span class="lineno"> 2614</span><span class="comment">// ComparatorCheapestAdditionFilteredHeuristic</span></div>
|
|
<div class="line"><a id="l02615" name="l02615"></a><span class="lineno"> 2615</span> </div>
|
|
<div class="line"><a id="l02616" name="l02616"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic.html#a760174569c84ca68a545381dad33b38c"> 2616</a></span><a class="code hl_function" href="classoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic.html#a760174569c84ca68a545381dad33b38c">ComparatorCheapestAdditionFilteredHeuristic::</a></div>
|
|
<div class="line"><a id="l02617" name="l02617"></a><span class="lineno"> 2617</span><a class="code hl_function" href="classoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic.html#a760174569c84ca68a545381dad33b38c"> ComparatorCheapestAdditionFilteredHeuristic</a>(</div>
|
|
<div class="line"><a id="l02618" name="l02618"></a><span class="lineno"> 2618</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code hl_typedef" href="classoperations__research_1_1_solver.html#af5502e2288132c081fc96fdbcee282e6">Solver::VariableValueComparator</a> comparator,</div>
|
|
<div class="line"><a id="l02619" name="l02619"></a><span class="lineno"> 2619</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager)</div>
|
|
<div class="line"><a id="l02620" name="l02620"></a><span class="lineno"> 2620</span> : <a class="code hl_class" href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html">CheapestAdditionFilteredHeuristic</a>(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, filter_manager),</div>
|
|
<div class="line"><a id="l02621" name="l02621"></a><span class="lineno"> 2621</span> comparator_(<a class="code hl_namespace" href="namespacestd.html">std</a>::move(comparator)) {}</div>
|
|
<div class="line"><a id="l02622" name="l02622"></a><span class="lineno"> 2622</span> </div>
|
|
<div class="line"><a id="l02623" name="l02623"></a><span class="lineno"> 2623</span>int64_t ComparatorCheapestAdditionFilteredHeuristic::FindTopSuccessor(</div>
|
|
<div class="line"><a id="l02624" name="l02624"></a><span class="lineno"> 2624</span> int64_t node, <span class="keyword">const</span> std::vector<int64_t>& successors) {</div>
|
|
<div class="line"><a id="l02625" name="l02625"></a><span class="lineno"> 2625</span> <span class="keywordflow">return</span> *std::min_element(successors.begin(), successors.end(),</div>
|
|
<div class="line"><a id="l02626" name="l02626"></a><span class="lineno"> 2626</span> [<span class="keyword">this</span>, node](<span class="keywordtype">int</span> successor1, <span class="keywordtype">int</span> successor2) {</div>
|
|
<div class="line"><a id="l02627" name="l02627"></a><span class="lineno"> 2627</span> return comparator_(node, successor1, successor2);</div>
|
|
<div class="line"><a id="l02628" name="l02628"></a><span class="lineno"> 2628</span> });</div>
|
|
<div class="line"><a id="l02629" name="l02629"></a><span class="lineno"> 2629</span>}</div>
|
|
<div class="line"><a id="l02630" name="l02630"></a><span class="lineno"> 2630</span> </div>
|
|
<div class="line"><a id="l02631" name="l02631"></a><span class="lineno"> 2631</span><span class="keywordtype">void</span> ComparatorCheapestAdditionFilteredHeuristic::SortSuccessors(</div>
|
|
<div class="line"><a id="l02632" name="l02632"></a><span class="lineno"> 2632</span> int64_t node, std::vector<int64_t>* successors) {</div>
|
|
<div class="line"><a id="l02633" name="l02633"></a><span class="lineno"> 2633</span> std::sort(successors->begin(), successors->end(),</div>
|
|
<div class="line"><a id="l02634" name="l02634"></a><span class="lineno"> 2634</span> [<span class="keyword">this</span>, node](<span class="keywordtype">int</span> successor1, <span class="keywordtype">int</span> successor2) {</div>
|
|
<div class="line"><a id="l02635" name="l02635"></a><span class="lineno"> 2635</span> return comparator_(node, successor1, successor2);</div>
|
|
<div class="line"><a id="l02636" name="l02636"></a><span class="lineno"> 2636</span> });</div>
|
|
<div class="line"><a id="l02637" name="l02637"></a><span class="lineno"> 2637</span>}</div>
|
|
<div class="line"><a id="l02638" name="l02638"></a><span class="lineno"> 2638</span> </div>
|
|
<div class="line"><a id="l02639" name="l02639"></a><span class="lineno"> 2639</span><span class="comment">// Class storing and allowing access to the savings according to the number of</span></div>
|
|
<div class="line"><a id="l02640" name="l02640"></a><span class="lineno"> 2640</span><span class="comment">// vehicle types.</span></div>
|
|
<div class="line"><a id="l02641" name="l02641"></a><span class="lineno"> 2641</span><span class="comment">// The savings are stored and sorted in sorted_savings_per_vehicle_type_.</span></div>
|
|
<div class="line"><a id="l02642" name="l02642"></a><span class="lineno"> 2642</span><span class="comment">// Furthermore, when there is more than one vehicle type, the savings for a same</span></div>
|
|
<div class="line"><a id="l02643" name="l02643"></a><span class="lineno"> 2643</span><span class="comment">// before-->after arc are sorted in costs_and_savings_per_arc_[arc] by</span></div>
|
|
<div class="line"><a id="l02644" name="l02644"></a><span class="lineno"> 2644</span><span class="comment">// increasing cost(s-->before-->after-->e), where s and e are the start and end</span></div>
|
|
<div class="line"><a id="l02645" name="l02645"></a><span class="lineno"> 2645</span><span class="comment">// of the route, in order to make sure the arc is served by the route with the</span></div>
|
|
<div class="line"><a id="l02646" name="l02646"></a><span class="lineno"> 2646</span><span class="comment">// closest depot (start/end) possible.</span></div>
|
|
<div class="line"><a id="l02647" name="l02647"></a><span class="lineno"> 2647</span><span class="comment">// When there is only one vehicle "type" (i.e. all vehicles have the same</span></div>
|
|
<div class="line"><a id="l02648" name="l02648"></a><span class="lineno"> 2648</span><span class="comment">// start/end and cost class), each arc has a single saving value associated to</span></div>
|
|
<div class="line"><a id="l02649" name="l02649"></a><span class="lineno"> 2649</span><span class="comment">// it, so we ignore this last step to avoid unnecessary computations, and only</span></div>
|
|
<div class="line"><a id="l02650" name="l02650"></a><span class="lineno"> 2650</span><span class="comment">// work with sorted_savings_per_vehicle_type_[0].</span></div>
|
|
<div class="line"><a id="l02651" name="l02651"></a><span class="lineno"> 2651</span><span class="comment">// In case of multiple vehicle types, the best savings for each arc, i.e. the</span></div>
|
|
<div class="line"><a id="l02652" name="l02652"></a><span class="lineno"> 2652</span><span class="comment">// savings corresponding to the closest vehicle type, are inserted and sorted in</span></div>
|
|
<div class="line"><a id="l02653" name="l02653"></a><span class="lineno"> 2653</span><span class="comment">// sorted_savings_.</span></div>
|
|
<div class="line"><a id="l02654" name="l02654"></a><span class="lineno"> 2654</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l02655" name="l02655"></a><span class="lineno"> 2655</span><span class="comment">// This class also handles skipped Savings:</span></div>
|
|
<div class="line"><a id="l02656" name="l02656"></a><span class="lineno"> 2656</span><span class="comment">// The vectors skipped_savings_starting/ending_at_ contain all the Savings that</span></div>
|
|
<div class="line"><a id="l02657" name="l02657"></a><span class="lineno"> 2657</span><span class="comment">// weren't added to the model, which we want to consider for later:</span></div>
|
|
<div class="line"><a id="l02658" name="l02658"></a><span class="lineno"> 2658</span><span class="comment">// 1) When a Saving before-->after with both nodes uncontained cannot be used to</span></div>
|
|
<div class="line"><a id="l02659" name="l02659"></a><span class="lineno"> 2659</span><span class="comment">// start a new route (no more available vehicles or could not commit on any</span></div>
|
|
<div class="line"><a id="l02660" name="l02660"></a><span class="lineno"> 2660</span><span class="comment">// of those available).</span></div>
|
|
<div class="line"><a id="l02661" name="l02661"></a><span class="lineno"> 2661</span><span class="comment">// 2) When only one of the nodes of the Saving is contained but on a different</span></div>
|
|
<div class="line"><a id="l02662" name="l02662"></a><span class="lineno"> 2662</span><span class="comment">// vehicle type.</span></div>
|
|
<div class="line"><a id="l02663" name="l02663"></a><span class="lineno"> 2663</span><span class="comment">// In these cases, the Update() method is called with update_best_saving = true,</span></div>
|
|
<div class="line"><a id="l02664" name="l02664"></a><span class="lineno"> 2664</span><span class="comment">// which in turn calls SkipSavingForArc() (within</span></div>
|
|
<div class="line"><a id="l02665" name="l02665"></a><span class="lineno"> 2665</span><span class="comment">// UpdateNextAndSkippedSavingsForArcWithType()) to mark the Saving for this arc</span></div>
|
|
<div class="line"><a id="l02666" name="l02666"></a><span class="lineno"> 2666</span><span class="comment">// (with the correct type in the second case) as "skipped", by storing it in</span></div>
|
|
<div class="line"><a id="l02667" name="l02667"></a><span class="lineno"> 2667</span><span class="comment">// skipped_savings_starting_at_[before] and skipped_savings_ending_at_[after].</span></div>
|
|
<div class="line"><a id="l02668" name="l02668"></a><span class="lineno"> 2668</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l02669" name="l02669"></a><span class="lineno"> 2669</span><span class="comment">// UpdateNextAndSkippedSavingsForArcWithType() also updates the next_savings_</span></div>
|
|
<div class="line"><a id="l02670" name="l02670"></a><span class="lineno"> 2670</span><span class="comment">// vector, which stores the savings to go through once we've iterated through</span></div>
|
|
<div class="line"><a id="l02671" name="l02671"></a><span class="lineno"> 2671</span><span class="comment">// all sorted_savings_.</span></div>
|
|
<div class="line"><a id="l02672" name="l02672"></a><span class="lineno"> 2672</span><span class="comment">// In the first case above, where neither nodes are contained, we skip the</span></div>
|
|
<div class="line"><a id="l02673" name="l02673"></a><span class="lineno"> 2673</span><span class="comment">// current Saving (current_saving_), and add the next best Saving for this arc</span></div>
|
|
<div class="line"><a id="l02674" name="l02674"></a><span class="lineno"> 2674</span><span class="comment">// to next_savings_ (in case this skipped Saving is never considered).</span></div>
|
|
<div class="line"><a id="l02675" name="l02675"></a><span class="lineno"> 2675</span><span class="comment">// In the second case with a specific type, we search for the Saving with the</span></div>
|
|
<div class="line"><a id="l02676" name="l02676"></a><span class="lineno"> 2676</span><span class="comment">// correct type for this arc, and add it to both next_savings_ and the skipped</span></div>
|
|
<div class="line"><a id="l02677" name="l02677"></a><span class="lineno"> 2677</span><span class="comment">// Savings.</span></div>
|
|
<div class="line"><a id="l02678" name="l02678"></a><span class="lineno"> 2678</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l02679" name="l02679"></a><span class="lineno"> 2679</span><span class="comment">// The skipped Savings are then re-considered when one of their ends gets</span></div>
|
|
<div class="line"><a id="l02680" name="l02680"></a><span class="lineno"> 2680</span><span class="comment">// inserted:</span></div>
|
|
<div class="line"><a id="l02681" name="l02681"></a><span class="lineno"> 2681</span><span class="comment">// When another Saving other_node-->before (or after-->other_node) gets</span></div>
|
|
<div class="line"><a id="l02682" name="l02682"></a><span class="lineno"> 2682</span><span class="comment">// inserted, all skipped Savings in skipped_savings_starting_at_[before] (or</span></div>
|
|
<div class="line"><a id="l02683" name="l02683"></a><span class="lineno"> 2683</span><span class="comment">// skipped_savings_ending_at_[after]) are once again considered by calling</span></div>
|
|
<div class="line"><a id="l02684" name="l02684"></a><span class="lineno"> 2684</span><span class="comment">// ReinjectSkippedSavingsStartingAt() (or ReinjectSkippedSavingsEndingAt()).</span></div>
|
|
<div class="line"><a id="l02685" name="l02685"></a><span class="lineno"> 2685</span><span class="comment">// Then, when calling GetSaving(), we iterate through the reinjected Savings in</span></div>
|
|
<div class="line"><a id="l02686" name="l02686"></a><span class="lineno"> 2686</span><span class="comment">// order of insertion in the vectors while there are reinjected savings.</span></div>
|
|
<div class="line"><a id="l02687" name="l02687"></a><span class="lineno"> 2687</span><span class="keyword">template</span> <<span class="keyword">typename</span> Saving></div>
|
|
<div class="line"><a id="l02688" name="l02688"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html"> 2688</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html">SavingsFilteredHeuristic::SavingsContainer</a> {</div>
|
|
<div class="line"><a id="l02689" name="l02689"></a><span class="lineno"> 2689</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l02690" name="l02690"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ab4ff697245c706fa950702d316f073ba"> 2690</a></span> <span class="keyword">explicit</span> <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ab4ff697245c706fa950702d316f073ba">SavingsContainer</a>(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_savings_filtered_heuristic.html">SavingsFilteredHeuristic</a>* savings_db,</div>
|
|
<div class="line"><a id="l02691" name="l02691"></a><span class="lineno"> 2691</span> <span class="keywordtype">int</span> vehicle_types)</div>
|
|
<div class="line"><a id="l02692" name="l02692"></a><span class="lineno"> 2692</span> : savings_db_(savings_db),</div>
|
|
<div class="line"><a id="l02693" name="l02693"></a><span class="lineno"> 2693</span> index_in_sorted_savings_(0),</div>
|
|
<div class="line"><a id="l02694" name="l02694"></a><span class="lineno"> 2694</span> vehicle_types_(vehicle_types),</div>
|
|
<div class="line"><a id="l02695" name="l02695"></a><span class="lineno"> 2695</span> single_vehicle_type_(vehicle_types == 1),</div>
|
|
<div class="line"><a id="l02696" name="l02696"></a><span class="lineno"> 2696</span> using_incoming_reinjected_saving_(false),</div>
|
|
<div class="line"><a id="l02697" name="l02697"></a><span class="lineno"> 2697</span> sorted_(false),</div>
|
|
<div class="line"><a id="l02698" name="l02698"></a><span class="lineno"> 2698</span> to_update_(true) {}</div>
|
|
<div class="line"><a id="l02699" name="l02699"></a><span class="lineno"> 2699</span> </div>
|
|
<div class="line"><a id="l02700" name="l02700"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ad0f88a06a9005604e199132660aa3609"> 2700</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ad0f88a06a9005604e199132660aa3609">InitializeContainer</a>(int64_t size, int64_t saving_neighbors) {</div>
|
|
<div class="line"><a id="l02701" name="l02701"></a><span class="lineno"> 2701</span> sorted_savings_per_vehicle_type_.clear();</div>
|
|
<div class="line"><a id="l02702" name="l02702"></a><span class="lineno"> 2702</span> sorted_savings_per_vehicle_type_.resize(vehicle_types_);</div>
|
|
<div class="line"><a id="l02703" name="l02703"></a><span class="lineno"> 2703</span> <span class="keywordflow">for</span> (std::vector<Saving>& savings : sorted_savings_per_vehicle_type_) {</div>
|
|
<div class="line"><a id="l02704" name="l02704"></a><span class="lineno"> 2704</span> savings.reserve(size * saving_neighbors);</div>
|
|
<div class="line"><a id="l02705" name="l02705"></a><span class="lineno"> 2705</span> }</div>
|
|
<div class="line"><a id="l02706" name="l02706"></a><span class="lineno"> 2706</span> </div>
|
|
<div class="line"><a id="l02707" name="l02707"></a><span class="lineno"> 2707</span> sorted_savings_.clear();</div>
|
|
<div class="line"><a id="l02708" name="l02708"></a><span class="lineno"> 2708</span> costs_and_savings_per_arc_.clear();</div>
|
|
<div class="line"><a id="l02709" name="l02709"></a><span class="lineno"> 2709</span> arc_indices_per_before_node_.clear();</div>
|
|
<div class="line"><a id="l02710" name="l02710"></a><span class="lineno"> 2710</span> </div>
|
|
<div class="line"><a id="l02711" name="l02711"></a><span class="lineno"> 2711</span> <span class="keywordflow">if</span> (!single_vehicle_type_) {</div>
|
|
<div class="line"><a id="l02712" name="l02712"></a><span class="lineno"> 2712</span> costs_and_savings_per_arc_.reserve(size * saving_neighbors);</div>
|
|
<div class="line"><a id="l02713" name="l02713"></a><span class="lineno"> 2713</span> arc_indices_per_before_node_.resize(size);</div>
|
|
<div class="line"><a id="l02714" name="l02714"></a><span class="lineno"> 2714</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> before_node = 0; before_node < size; before_node++) {</div>
|
|
<div class="line"><a id="l02715" name="l02715"></a><span class="lineno"> 2715</span> arc_indices_per_before_node_[before_node].reserve(saving_neighbors);</div>
|
|
<div class="line"><a id="l02716" name="l02716"></a><span class="lineno"> 2716</span> }</div>
|
|
<div class="line"><a id="l02717" name="l02717"></a><span class="lineno"> 2717</span> }</div>
|
|
<div class="line"><a id="l02718" name="l02718"></a><span class="lineno"> 2718</span> skipped_savings_starting_at_.clear();</div>
|
|
<div class="line"><a id="l02719" name="l02719"></a><span class="lineno"> 2719</span> skipped_savings_starting_at_.resize(size);</div>
|
|
<div class="line"><a id="l02720" name="l02720"></a><span class="lineno"> 2720</span> skipped_savings_ending_at_.clear();</div>
|
|
<div class="line"><a id="l02721" name="l02721"></a><span class="lineno"> 2721</span> skipped_savings_ending_at_.resize(size);</div>
|
|
<div class="line"><a id="l02722" name="l02722"></a><span class="lineno"> 2722</span> incoming_reinjected_savings_ = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l02723" name="l02723"></a><span class="lineno"> 2723</span> outgoing_reinjected_savings_ = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l02724" name="l02724"></a><span class="lineno"> 2724</span> incoming_new_reinjected_savings_ = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l02725" name="l02725"></a><span class="lineno"> 2725</span> outgoing_new_reinjected_savings_ = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l02726" name="l02726"></a><span class="lineno"> 2726</span> }</div>
|
|
<div class="line"><a id="l02727" name="l02727"></a><span class="lineno"> 2727</span> </div>
|
|
<div class="line"><a id="l02728" name="l02728"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#af86ec2894c059ac7bc63b492d5fb6fbd"> 2728</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#af86ec2894c059ac7bc63b492d5fb6fbd">AddNewSaving</a>(<span class="keyword">const</span> <a class="code hl_typedef" href="classoperations__research_1_1_savings_filtered_heuristic.html#a508859e48f977fce11a64cd80d9d1c96">Saving</a>& saving, int64_t total_cost,</div>
|
|
<div class="line"><a id="l02729" name="l02729"></a><span class="lineno"> 2729</span> int64_t before_node, int64_t after_node, <span class="keywordtype">int</span> vehicle_type) {</div>
|
|
<div class="line"><a id="l02730" name="l02730"></a><span class="lineno"> 2730</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!sorted_savings_per_vehicle_type_.empty())</div>
|
|
<div class="line"><a id="l02731" name="l02731"></a><span class="lineno"> 2731</span> << <span class="stringliteral">"Container not initialized!"</span>;</div>
|
|
<div class="line"><a id="l02732" name="l02732"></a><span class="lineno"> 2732</span> sorted_savings_per_vehicle_type_[vehicle_type].push_back(saving);</div>
|
|
<div class="line"><a id="l02733" name="l02733"></a><span class="lineno"> 2733</span> UpdateArcIndicesCostsAndSavings(before_node, after_node,</div>
|
|
<div class="line"><a id="l02734" name="l02734"></a><span class="lineno"> 2734</span> {total_cost, saving});</div>
|
|
<div class="line"><a id="l02735" name="l02735"></a><span class="lineno"> 2735</span> }</div>
|
|
<div class="line"><a id="l02736" name="l02736"></a><span class="lineno"> 2736</span> </div>
|
|
<div class="line"><a id="l02737" name="l02737"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ae424c3360277f457eba79fd25b4eed3b"> 2737</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ae424c3360277f457eba79fd25b4eed3b">Sort</a>() {</div>
|
|
<div class="line"><a id="l02738" name="l02738"></a><span class="lineno"> 2738</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!sorted_) << <span class="stringliteral">"Container already sorted!"</span>;</div>
|
|
<div class="line"><a id="l02739" name="l02739"></a><span class="lineno"> 2739</span> </div>
|
|
<div class="line"><a id="l02740" name="l02740"></a><span class="lineno"> 2740</span> <span class="keywordflow">for</span> (std::vector<Saving>& savings : sorted_savings_per_vehicle_type_) {</div>
|
|
<div class="line"><a id="l02741" name="l02741"></a><span class="lineno"> 2741</span> std::sort(savings.begin(), savings.end());</div>
|
|
<div class="line"><a id="l02742" name="l02742"></a><span class="lineno"> 2742</span> }</div>
|
|
<div class="line"><a id="l02743" name="l02743"></a><span class="lineno"> 2743</span> </div>
|
|
<div class="line"><a id="l02744" name="l02744"></a><span class="lineno"> 2744</span> <span class="keywordflow">if</span> (single_vehicle_type_) {</div>
|
|
<div class="line"><a id="l02745" name="l02745"></a><span class="lineno"> 2745</span> <span class="keyword">const</span> <span class="keyword">auto</span>& savings = sorted_savings_per_vehicle_type_[0];</div>
|
|
<div class="line"><a id="l02746" name="l02746"></a><span class="lineno"> 2746</span> sorted_savings_.resize(savings.size());</div>
|
|
<div class="line"><a id="l02747" name="l02747"></a><span class="lineno"> 2747</span> std::transform(savings.begin(), savings.end(), sorted_savings_.begin(),</div>
|
|
<div class="line"><a id="l02748" name="l02748"></a><span class="lineno"> 2748</span> [](<span class="keyword">const</span> <a class="code hl_typedef" href="classoperations__research_1_1_savings_filtered_heuristic.html#a508859e48f977fce11a64cd80d9d1c96">Saving</a>& saving) {</div>
|
|
<div class="line"><a id="l02749" name="l02749"></a><span class="lineno"> 2749</span> return SavingAndArc({saving, <span class="comment">/*arc_index*/</span> -1});</div>
|
|
<div class="line"><a id="l02750" name="l02750"></a><span class="lineno"> 2750</span> });</div>
|
|
<div class="line"><a id="l02751" name="l02751"></a><span class="lineno"> 2751</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l02752" name="l02752"></a><span class="lineno"> 2752</span> <span class="comment">// For each arc, sort the savings by decreasing total cost</span></div>
|
|
<div class="line"><a id="l02753" name="l02753"></a><span class="lineno"> 2753</span> <span class="comment">// start-->a-->b-->end.</span></div>
|
|
<div class="line"><a id="l02754" name="l02754"></a><span class="lineno"> 2754</span> <span class="comment">// The best saving for each arc is therefore the last of its vector.</span></div>
|
|
<div class="line"><a id="l02755" name="l02755"></a><span class="lineno"> 2755</span> sorted_savings_.reserve(vehicle_types_ *</div>
|
|
<div class="line"><a id="l02756" name="l02756"></a><span class="lineno"> 2756</span> costs_and_savings_per_arc_.size());</div>
|
|
<div class="line"><a id="l02757" name="l02757"></a><span class="lineno"> 2757</span> </div>
|
|
<div class="line"><a id="l02758" name="l02758"></a><span class="lineno"> 2758</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> arc_index = 0; arc_index < costs_and_savings_per_arc_.size();</div>
|
|
<div class="line"><a id="l02759" name="l02759"></a><span class="lineno"> 2759</span> arc_index++) {</div>
|
|
<div class="line"><a id="l02760" name="l02760"></a><span class="lineno"> 2760</span> std::vector<std::pair<int64_t, Saving>>& costs_and_savings =</div>
|
|
<div class="line"><a id="l02761" name="l02761"></a><span class="lineno"> 2761</span> costs_and_savings_per_arc_[arc_index];</div>
|
|
<div class="line"><a id="l02762" name="l02762"></a><span class="lineno"> 2762</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!costs_and_savings.empty());</div>
|
|
<div class="line"><a id="l02763" name="l02763"></a><span class="lineno"> 2763</span> </div>
|
|
<div class="line"><a id="l02764" name="l02764"></a><span class="lineno"> 2764</span> std::sort(</div>
|
|
<div class="line"><a id="l02765" name="l02765"></a><span class="lineno"> 2765</span> costs_and_savings.begin(), costs_and_savings.end(),</div>
|
|
<div class="line"><a id="l02766" name="l02766"></a><span class="lineno"> 2766</span> [](<span class="keyword">const</span> std::pair<int64_t, Saving>& cs1,</div>
|
|
<div class="line"><a id="l02767" name="l02767"></a><span class="lineno"> 2767</span> <span class="keyword">const</span> std::pair<int64_t, Saving>& cs2) { return cs1 > cs2; });</div>
|
|
<div class="line"><a id="l02768" name="l02768"></a><span class="lineno"> 2768</span> </div>
|
|
<div class="line"><a id="l02769" name="l02769"></a><span class="lineno"> 2769</span> <span class="comment">// Insert all Savings for this arc with the lowest cost into</span></div>
|
|
<div class="line"><a id="l02770" name="l02770"></a><span class="lineno"> 2770</span> <span class="comment">// sorted_savings_.</span></div>
|
|
<div class="line"><a id="l02771" name="l02771"></a><span class="lineno"> 2771</span> <span class="comment">// TODO(user): Also do this when reiterating on next_savings_.</span></div>
|
|
<div class="line"><a id="l02772" name="l02772"></a><span class="lineno"> 2772</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a> = costs_and_savings.back().first;</div>
|
|
<div class="line"><a id="l02773" name="l02773"></a><span class="lineno"> 2773</span> <span class="keywordflow">while</span> (!costs_and_savings.empty() &&</div>
|
|
<div class="line"><a id="l02774" name="l02774"></a><span class="lineno"> 2774</span> costs_and_savings.back().first == <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>) {</div>
|
|
<div class="line"><a id="l02775" name="l02775"></a><span class="lineno"> 2775</span> sorted_savings_.push_back(</div>
|
|
<div class="line"><a id="l02776" name="l02776"></a><span class="lineno"> 2776</span> {costs_and_savings.back().second, arc_index});</div>
|
|
<div class="line"><a id="l02777" name="l02777"></a><span class="lineno"> 2777</span> costs_and_savings.pop_back();</div>
|
|
<div class="line"><a id="l02778" name="l02778"></a><span class="lineno"> 2778</span> }</div>
|
|
<div class="line"><a id="l02779" name="l02779"></a><span class="lineno"> 2779</span> }</div>
|
|
<div class="line"><a id="l02780" name="l02780"></a><span class="lineno"> 2780</span> std::sort(sorted_savings_.begin(), sorted_savings_.end());</div>
|
|
<div class="line"><a id="l02781" name="l02781"></a><span class="lineno"> 2781</span> next_saving_type_and_index_for_arc_.clear();</div>
|
|
<div class="line"><a id="l02782" name="l02782"></a><span class="lineno"> 2782</span> next_saving_type_and_index_for_arc_.resize(</div>
|
|
<div class="line"><a id="l02783" name="l02783"></a><span class="lineno"> 2783</span> costs_and_savings_per_arc_.size(), {-1, -1});</div>
|
|
<div class="line"><a id="l02784" name="l02784"></a><span class="lineno"> 2784</span> }</div>
|
|
<div class="line"><a id="l02785" name="l02785"></a><span class="lineno"> 2785</span> sorted_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l02786" name="l02786"></a><span class="lineno"> 2786</span> index_in_sorted_savings_ = 0;</div>
|
|
<div class="line"><a id="l02787" name="l02787"></a><span class="lineno"> 2787</span> to_update_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l02788" name="l02788"></a><span class="lineno"> 2788</span> }</div>
|
|
<div class="line"><a id="l02789" name="l02789"></a><span class="lineno"> 2789</span> </div>
|
|
<div class="line"><a id="l02790" name="l02790"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a6e4036b54f3ff84ef42fa4acabf6158b"> 2790</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a6e4036b54f3ff84ef42fa4acabf6158b">HasSaving</a>() {</div>
|
|
<div class="line"><a id="l02791" name="l02791"></a><span class="lineno"> 2791</span> <span class="keywordflow">return</span> index_in_sorted_savings_ < sorted_savings_.size() ||</div>
|
|
<div class="line"><a id="l02792" name="l02792"></a><span class="lineno"> 2792</span> HasReinjectedSavings();</div>
|
|
<div class="line"><a id="l02793" name="l02793"></a><span class="lineno"> 2793</span> }</div>
|
|
<div class="line"><a id="l02794" name="l02794"></a><span class="lineno"> 2794</span> </div>
|
|
<div class="line"><a id="l02795" name="l02795"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ab2c8a5a9d539f1fb49d767045f8c9297"> 2795</a></span> <a class="code hl_typedef" href="classoperations__research_1_1_savings_filtered_heuristic.html#a508859e48f977fce11a64cd80d9d1c96">Saving</a> <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ab2c8a5a9d539f1fb49d767045f8c9297">GetSaving</a>() {</div>
|
|
<div class="line"><a id="l02796" name="l02796"></a><span class="lineno"> 2796</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(sorted_) << <span class="stringliteral">"Calling GetSaving() before Sort() !"</span>;</div>
|
|
<div class="line"><a id="l02797" name="l02797"></a><span class="lineno"> 2797</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!to_update_)</div>
|
|
<div class="line"><a id="l02798" name="l02798"></a><span class="lineno"> 2798</span> << <span class="stringliteral">"Update() should be called between two calls to GetSaving() !"</span>;</div>
|
|
<div class="line"><a id="l02799" name="l02799"></a><span class="lineno"> 2799</span> </div>
|
|
<div class="line"><a id="l02800" name="l02800"></a><span class="lineno"> 2800</span> to_update_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l02801" name="l02801"></a><span class="lineno"> 2801</span> </div>
|
|
<div class="line"><a id="l02802" name="l02802"></a><span class="lineno"> 2802</span> <span class="keywordflow">if</span> (HasReinjectedSavings()) {</div>
|
|
<div class="line"><a id="l02803" name="l02803"></a><span class="lineno"> 2803</span> <span class="keywordflow">if</span> (incoming_reinjected_savings_ != <span class="keyword">nullptr</span> &&</div>
|
|
<div class="line"><a id="l02804" name="l02804"></a><span class="lineno"> 2804</span> outgoing_reinjected_savings_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l02805" name="l02805"></a><span class="lineno"> 2805</span> <span class="comment">// Get the best Saving among the two.</span></div>
|
|
<div class="line"><a id="l02806" name="l02806"></a><span class="lineno"> 2806</span> SavingAndArc& incoming_saving = incoming_reinjected_savings_->front();</div>
|
|
<div class="line"><a id="l02807" name="l02807"></a><span class="lineno"> 2807</span> SavingAndArc& outgoing_saving = outgoing_reinjected_savings_->front();</div>
|
|
<div class="line"><a id="l02808" name="l02808"></a><span class="lineno"> 2808</span> <span class="keywordflow">if</span> (incoming_saving < outgoing_saving) {</div>
|
|
<div class="line"><a id="l02809" name="l02809"></a><span class="lineno"> 2809</span> current_saving_ = incoming_saving;</div>
|
|
<div class="line"><a id="l02810" name="l02810"></a><span class="lineno"> 2810</span> using_incoming_reinjected_saving_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l02811" name="l02811"></a><span class="lineno"> 2811</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l02812" name="l02812"></a><span class="lineno"> 2812</span> current_saving_ = outgoing_saving;</div>
|
|
<div class="line"><a id="l02813" name="l02813"></a><span class="lineno"> 2813</span> using_incoming_reinjected_saving_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l02814" name="l02814"></a><span class="lineno"> 2814</span> }</div>
|
|
<div class="line"><a id="l02815" name="l02815"></a><span class="lineno"> 2815</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l02816" name="l02816"></a><span class="lineno"> 2816</span> <span class="keywordflow">if</span> (incoming_reinjected_savings_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l02817" name="l02817"></a><span class="lineno"> 2817</span> current_saving_ = incoming_reinjected_savings_->front();</div>
|
|
<div class="line"><a id="l02818" name="l02818"></a><span class="lineno"> 2818</span> using_incoming_reinjected_saving_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l02819" name="l02819"></a><span class="lineno"> 2819</span> }</div>
|
|
<div class="line"><a id="l02820" name="l02820"></a><span class="lineno"> 2820</span> <span class="keywordflow">if</span> (outgoing_reinjected_savings_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l02821" name="l02821"></a><span class="lineno"> 2821</span> current_saving_ = outgoing_reinjected_savings_->front();</div>
|
|
<div class="line"><a id="l02822" name="l02822"></a><span class="lineno"> 2822</span> using_incoming_reinjected_saving_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l02823" name="l02823"></a><span class="lineno"> 2823</span> }</div>
|
|
<div class="line"><a id="l02824" name="l02824"></a><span class="lineno"> 2824</span> }</div>
|
|
<div class="line"><a id="l02825" name="l02825"></a><span class="lineno"> 2825</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l02826" name="l02826"></a><span class="lineno"> 2826</span> current_saving_ = sorted_savings_[index_in_sorted_savings_];</div>
|
|
<div class="line"><a id="l02827" name="l02827"></a><span class="lineno"> 2827</span> }</div>
|
|
<div class="line"><a id="l02828" name="l02828"></a><span class="lineno"> 2828</span> <span class="keywordflow">return</span> current_saving_.saving;</div>
|
|
<div class="line"><a id="l02829" name="l02829"></a><span class="lineno"> 2829</span> }</div>
|
|
<div class="line"><a id="l02830" name="l02830"></a><span class="lineno"> 2830</span> </div>
|
|
<div class="line"><a id="l02831" name="l02831"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ad7378ee53fe29a5ac2b72c1ae77a3d03"> 2831</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ad7378ee53fe29a5ac2b72c1ae77a3d03">Update</a>(<span class="keywordtype">bool</span> update_best_saving, <span class="keywordtype">int</span> type = -1) {</div>
|
|
<div class="line"><a id="l02832" name="l02832"></a><span class="lineno"> 2832</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(to_update_) << <span class="stringliteral">"Container already up to date!"</span>;</div>
|
|
<div class="line"><a id="l02833" name="l02833"></a><span class="lineno"> 2833</span> <span class="keywordflow">if</span> (update_best_saving) {</div>
|
|
<div class="line"><a id="l02834" name="l02834"></a><span class="lineno"> 2834</span> <span class="keyword">const</span> int64_t arc_index = current_saving_.arc_index;</div>
|
|
<div class="line"><a id="l02835" name="l02835"></a><span class="lineno"> 2835</span> UpdateNextAndSkippedSavingsForArcWithType(arc_index, type);</div>
|
|
<div class="line"><a id="l02836" name="l02836"></a><span class="lineno"> 2836</span> }</div>
|
|
<div class="line"><a id="l02837" name="l02837"></a><span class="lineno"> 2837</span> <span class="keywordflow">if</span> (!HasReinjectedSavings()) {</div>
|
|
<div class="line"><a id="l02838" name="l02838"></a><span class="lineno"> 2838</span> index_in_sorted_savings_++;</div>
|
|
<div class="line"><a id="l02839" name="l02839"></a><span class="lineno"> 2839</span> </div>
|
|
<div class="line"><a id="l02840" name="l02840"></a><span class="lineno"> 2840</span> <span class="keywordflow">if</span> (index_in_sorted_savings_ == sorted_savings_.size()) {</div>
|
|
<div class="line"><a id="l02841" name="l02841"></a><span class="lineno"> 2841</span> sorted_savings_.swap(next_savings_);</div>
|
|
<div class="line"><a id="l02842" name="l02842"></a><span class="lineno"> 2842</span> <a class="code hl_function" href="namespacegtl.html#a92a0e7b0e74024284adc849a4499940f">gtl::STLClearObject</a>(&next_savings_);</div>
|
|
<div class="line"><a id="l02843" name="l02843"></a><span class="lineno"> 2843</span> index_in_sorted_savings_ = 0;</div>
|
|
<div class="line"><a id="l02844" name="l02844"></a><span class="lineno"> 2844</span> </div>
|
|
<div class="line"><a id="l02845" name="l02845"></a><span class="lineno"> 2845</span> std::sort(sorted_savings_.begin(), sorted_savings_.end());</div>
|
|
<div class="line"><a id="l02846" name="l02846"></a><span class="lineno"> 2846</span> next_saving_type_and_index_for_arc_.clear();</div>
|
|
<div class="line"><a id="l02847" name="l02847"></a><span class="lineno"> 2847</span> next_saving_type_and_index_for_arc_.resize(</div>
|
|
<div class="line"><a id="l02848" name="l02848"></a><span class="lineno"> 2848</span> costs_and_savings_per_arc_.size(), {-1, -1});</div>
|
|
<div class="line"><a id="l02849" name="l02849"></a><span class="lineno"> 2849</span> }</div>
|
|
<div class="line"><a id="l02850" name="l02850"></a><span class="lineno"> 2850</span> }</div>
|
|
<div class="line"><a id="l02851" name="l02851"></a><span class="lineno"> 2851</span> UpdateReinjectedSavings();</div>
|
|
<div class="line"><a id="l02852" name="l02852"></a><span class="lineno"> 2852</span> to_update_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l02853" name="l02853"></a><span class="lineno"> 2853</span> }</div>
|
|
<div class="line"><a id="l02854" name="l02854"></a><span class="lineno"> 2854</span> </div>
|
|
<div class="line"><a id="l02855" name="l02855"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#abf0869704ce65d912e6dcc71945ee737"> 2855</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#abf0869704ce65d912e6dcc71945ee737">UpdateWithType</a>(<span class="keywordtype">int</span> type) {</div>
|
|
<div class="line"><a id="l02856" name="l02856"></a><span class="lineno"> 2856</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!single_vehicle_type_);</div>
|
|
<div class="line"><a id="l02857" name="l02857"></a><span class="lineno"> 2857</span> Update(<span class="comment">/*update_best_saving*/</span> <span class="keyword">true</span>, type);</div>
|
|
<div class="line"><a id="l02858" name="l02858"></a><span class="lineno"> 2858</span> }</div>
|
|
<div class="line"><a id="l02859" name="l02859"></a><span class="lineno"> 2859</span> </div>
|
|
<div class="line"><a id="l02860" name="l02860"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a31131f99ff37daf00617f798df4fc8f1"> 2860</a></span> <span class="keyword">const</span> std::vector<Saving>& <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a31131f99ff37daf00617f798df4fc8f1">GetSortedSavingsForVehicleType</a>(<span class="keywordtype">int</span> type) {</div>
|
|
<div class="line"><a id="l02861" name="l02861"></a><span class="lineno"> 2861</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(sorted_) << <span class="stringliteral">"Savings not sorted yet!"</span>;</div>
|
|
<div class="line"><a id="l02862" name="l02862"></a><span class="lineno"> 2862</span> <a class="code hl_define" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(type, vehicle_types_);</div>
|
|
<div class="line"><a id="l02863" name="l02863"></a><span class="lineno"> 2863</span> <span class="keywordflow">return</span> sorted_savings_per_vehicle_type_[type];</div>
|
|
<div class="line"><a id="l02864" name="l02864"></a><span class="lineno"> 2864</span> }</div>
|
|
<div class="line"><a id="l02865" name="l02865"></a><span class="lineno"> 2865</span> </div>
|
|
<div class="line"><a id="l02866" name="l02866"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#acdad3624ab0076a5609acc5722b6d379"> 2866</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#acdad3624ab0076a5609acc5722b6d379">ReinjectSkippedSavingsStartingAt</a>(int64_t node) {</div>
|
|
<div class="line"><a id="l02867" name="l02867"></a><span class="lineno"> 2867</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(outgoing_new_reinjected_savings_ == <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l02868" name="l02868"></a><span class="lineno"> 2868</span> outgoing_new_reinjected_savings_ = &(skipped_savings_starting_at_[node]);</div>
|
|
<div class="line"><a id="l02869" name="l02869"></a><span class="lineno"> 2869</span> }</div>
|
|
<div class="line"><a id="l02870" name="l02870"></a><span class="lineno"> 2870</span> </div>
|
|
<div class="line"><a id="l02871" name="l02871"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a3ec322819bf67a83f0cc68eb55ae1bb2"> 2871</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a3ec322819bf67a83f0cc68eb55ae1bb2">ReinjectSkippedSavingsEndingAt</a>(int64_t node) {</div>
|
|
<div class="line"><a id="l02872" name="l02872"></a><span class="lineno"> 2872</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(incoming_new_reinjected_savings_ == <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l02873" name="l02873"></a><span class="lineno"> 2873</span> incoming_new_reinjected_savings_ = &(skipped_savings_ending_at_[node]);</div>
|
|
<div class="line"><a id="l02874" name="l02874"></a><span class="lineno"> 2874</span> }</div>
|
|
<div class="line"><a id="l02875" name="l02875"></a><span class="lineno"> 2875</span> </div>
|
|
<div class="line"><a id="l02876" name="l02876"></a><span class="lineno"> 2876</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l02877" name="l02877"></a><span class="lineno"> 2877</span> <span class="keyword">struct </span>SavingAndArc {</div>
|
|
<div class="line"><a id="l02878" name="l02878"></a><span class="lineno"> 2878</span> <a class="code hl_typedef" href="classoperations__research_1_1_savings_filtered_heuristic.html#a508859e48f977fce11a64cd80d9d1c96">Saving</a> saving;</div>
|
|
<div class="line"><a id="l02879" name="l02879"></a><span class="lineno"> 2879</span> int64_t arc_index;</div>
|
|
<div class="line"><a id="l02880" name="l02880"></a><span class="lineno"> 2880</span> </div>
|
|
<div class="line"><a id="l02881" name="l02881"></a><span class="lineno"> 2881</span> <span class="keywordtype">bool</span> operator<(<span class="keyword">const</span> SavingAndArc& other)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l02882" name="l02882"></a><span class="lineno"> 2882</span> <span class="keywordflow">return</span> std::tie(saving, arc_index) <</div>
|
|
<div class="line"><a id="l02883" name="l02883"></a><span class="lineno"> 2883</span> std::tie(other.saving, other.arc_index);</div>
|
|
<div class="line"><a id="l02884" name="l02884"></a><span class="lineno"> 2884</span> }</div>
|
|
<div class="line"><a id="l02885" name="l02885"></a><span class="lineno"> 2885</span> };</div>
|
|
<div class="line"><a id="l02886" name="l02886"></a><span class="lineno"> 2886</span> </div>
|
|
<div class="line"><a id="l02887" name="l02887"></a><span class="lineno"> 2887</span> <span class="comment">// Skips the Saving for the arc before_node-->after_node, by adding it to the</span></div>
|
|
<div class="line"><a id="l02888" name="l02888"></a><span class="lineno"> 2888</span> <span class="comment">// skipped_savings_ vector of the nodes, if they're uncontained.</span></div>
|
|
<div class="line"><a id="l02889" name="l02889"></a><span class="lineno"> 2889</span> <span class="keywordtype">void</span> SkipSavingForArc(<span class="keyword">const</span> SavingAndArc& saving_and_arc) {</div>
|
|
<div class="line"><a id="l02890" name="l02890"></a><span class="lineno"> 2890</span> <span class="keyword">const</span> Saving& saving = saving_and_arc.saving;</div>
|
|
<div class="line"><a id="l02891" name="l02891"></a><span class="lineno"> 2891</span> <span class="keyword">const</span> int64_t before_node = savings_db_->GetBeforeNodeFromSaving(saving);</div>
|
|
<div class="line"><a id="l02892" name="l02892"></a><span class="lineno"> 2892</span> <span class="keyword">const</span> int64_t after_node = savings_db_->GetAfterNodeFromSaving(saving);</div>
|
|
<div class="line"><a id="l02893" name="l02893"></a><span class="lineno"> 2893</span> <span class="keywordflow">if</span> (!savings_db_->Contains(before_node)) {</div>
|
|
<div class="line"><a id="l02894" name="l02894"></a><span class="lineno"> 2894</span> skipped_savings_starting_at_[before_node].push_back(saving_and_arc);</div>
|
|
<div class="line"><a id="l02895" name="l02895"></a><span class="lineno"> 2895</span> }</div>
|
|
<div class="line"><a id="l02896" name="l02896"></a><span class="lineno"> 2896</span> <span class="keywordflow">if</span> (!savings_db_->Contains(after_node)) {</div>
|
|
<div class="line"><a id="l02897" name="l02897"></a><span class="lineno"> 2897</span> skipped_savings_ending_at_[after_node].push_back(saving_and_arc);</div>
|
|
<div class="line"><a id="l02898" name="l02898"></a><span class="lineno"> 2898</span> }</div>
|
|
<div class="line"><a id="l02899" name="l02899"></a><span class="lineno"> 2899</span> }</div>
|
|
<div class="line"><a id="l02900" name="l02900"></a><span class="lineno"> 2900</span> </div>
|
|
<div class="line"><a id="l02901" name="l02901"></a><span class="lineno"> 2901</span> <span class="comment">// Called within Update() when update_best_saving is true, this method updates</span></div>
|
|
<div class="line"><a id="l02902" name="l02902"></a><span class="lineno"> 2902</span> <span class="comment">// the next_savings_ and skipped savings vectors for a given arc_index and</span></div>
|
|
<div class="line"><a id="l02903" name="l02903"></a><span class="lineno"> 2903</span> <span class="comment">// vehicle type.</span></div>
|
|
<div class="line"><a id="l02904" name="l02904"></a><span class="lineno"> 2904</span> <span class="comment">// When a Saving with the right type has already been added to next_savings_</span></div>
|
|
<div class="line"><a id="l02905" name="l02905"></a><span class="lineno"> 2905</span> <span class="comment">// for this arc, no action is needed on next_savings_.</span></div>
|
|
<div class="line"><a id="l02906" name="l02906"></a><span class="lineno"> 2906</span> <span class="comment">// Otherwise, if such a Saving exists, GetNextSavingForArcWithType() will find</span></div>
|
|
<div class="line"><a id="l02907" name="l02907"></a><span class="lineno"> 2907</span> <span class="comment">// and assign it to next_saving, which is then used to update next_savings_.</span></div>
|
|
<div class="line"><a id="l02908" name="l02908"></a><span class="lineno"> 2908</span> <span class="comment">// Finally, the right Saving is skipped for this arc: if looking for a</span></div>
|
|
<div class="line"><a id="l02909" name="l02909"></a><span class="lineno"> 2909</span> <span class="comment">// specific type (i.e. type != -1), next_saving (which has the correct type)</span></div>
|
|
<div class="line"><a id="l02910" name="l02910"></a><span class="lineno"> 2910</span> <span class="comment">// is skipped, otherwise the current_saving_ is.</span></div>
|
|
<div class="line"><a id="l02911" name="l02911"></a><span class="lineno"> 2911</span> <span class="keywordtype">void</span> UpdateNextAndSkippedSavingsForArcWithType(int64_t arc_index, <span class="keywordtype">int</span> type) {</div>
|
|
<div class="line"><a id="l02912" name="l02912"></a><span class="lineno"> 2912</span> <span class="keywordflow">if</span> (single_vehicle_type_) {</div>
|
|
<div class="line"><a id="l02913" name="l02913"></a><span class="lineno"> 2913</span> <span class="comment">// No next Saving, skip the current Saving.</span></div>
|
|
<div class="line"><a id="l02914" name="l02914"></a><span class="lineno"> 2914</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(type, -1);</div>
|
|
<div class="line"><a id="l02915" name="l02915"></a><span class="lineno"> 2915</span> SkipSavingForArc(current_saving_);</div>
|
|
<div class="line"><a id="l02916" name="l02916"></a><span class="lineno"> 2916</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l02917" name="l02917"></a><span class="lineno"> 2917</span> }</div>
|
|
<div class="line"><a id="l02918" name="l02918"></a><span class="lineno"> 2918</span> <a class="code hl_define" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(arc_index, 0);</div>
|
|
<div class="line"><a id="l02919" name="l02919"></a><span class="lineno"> 2919</span> <span class="keyword">auto</span>& type_and_index = next_saving_type_and_index_for_arc_[arc_index];</div>
|
|
<div class="line"><a id="l02920" name="l02920"></a><span class="lineno"> 2920</span> <span class="keyword">const</span> <span class="keywordtype">int</span> previous_index = type_and_index.second;</div>
|
|
<div class="line"><a id="l02921" name="l02921"></a><span class="lineno"> 2921</span> <span class="keyword">const</span> <span class="keywordtype">int</span> previous_type = type_and_index.first;</div>
|
|
<div class="line"><a id="l02922" name="l02922"></a><span class="lineno"> 2922</span> <span class="keywordtype">bool</span> next_saving_added = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l02923" name="l02923"></a><span class="lineno"> 2923</span> Saving next_saving;</div>
|
|
<div class="line"><a id="l02924" name="l02924"></a><span class="lineno"> 2924</span> </div>
|
|
<div class="line"><a id="l02925" name="l02925"></a><span class="lineno"> 2925</span> <span class="keywordflow">if</span> (previous_index >= 0) {</div>
|
|
<div class="line"><a id="l02926" name="l02926"></a><span class="lineno"> 2926</span> <span class="comment">// Next Saving already added for this arc.</span></div>
|
|
<div class="line"><a id="l02927" name="l02927"></a><span class="lineno"> 2927</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(previous_type, 0);</div>
|
|
<div class="line"><a id="l02928" name="l02928"></a><span class="lineno"> 2928</span> <span class="keywordflow">if</span> (type == -1 || previous_type == type) {</div>
|
|
<div class="line"><a id="l02929" name="l02929"></a><span class="lineno"> 2929</span> <span class="comment">// Not looking for a specific type, or correct type already in</span></div>
|
|
<div class="line"><a id="l02930" name="l02930"></a><span class="lineno"> 2930</span> <span class="comment">// next_savings_.</span></div>
|
|
<div class="line"><a id="l02931" name="l02931"></a><span class="lineno"> 2931</span> next_saving_added = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l02932" name="l02932"></a><span class="lineno"> 2932</span> next_saving = next_savings_[previous_index].saving;</div>
|
|
<div class="line"><a id="l02933" name="l02933"></a><span class="lineno"> 2933</span> }</div>
|
|
<div class="line"><a id="l02934" name="l02934"></a><span class="lineno"> 2934</span> }</div>
|
|
<div class="line"><a id="l02935" name="l02935"></a><span class="lineno"> 2935</span> </div>
|
|
<div class="line"><a id="l02936" name="l02936"></a><span class="lineno"> 2936</span> <span class="keywordflow">if</span> (!next_saving_added &&</div>
|
|
<div class="line"><a id="l02937" name="l02937"></a><span class="lineno"> 2937</span> GetNextSavingForArcWithType(arc_index, type, &next_saving)) {</div>
|
|
<div class="line"><a id="l02938" name="l02938"></a><span class="lineno"> 2938</span> type_and_index.first = savings_db_->GetVehicleTypeFromSaving(next_saving);</div>
|
|
<div class="line"><a id="l02939" name="l02939"></a><span class="lineno"> 2939</span> <span class="keywordflow">if</span> (previous_index >= 0) {</div>
|
|
<div class="line"><a id="l02940" name="l02940"></a><span class="lineno"> 2940</span> <span class="comment">// Update the previous saving.</span></div>
|
|
<div class="line"><a id="l02941" name="l02941"></a><span class="lineno"> 2941</span> next_savings_[previous_index] = {next_saving, arc_index};</div>
|
|
<div class="line"><a id="l02942" name="l02942"></a><span class="lineno"> 2942</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l02943" name="l02943"></a><span class="lineno"> 2943</span> <span class="comment">// Insert the new next Saving for this arc.</span></div>
|
|
<div class="line"><a id="l02944" name="l02944"></a><span class="lineno"> 2944</span> type_and_index.second = next_savings_.size();</div>
|
|
<div class="line"><a id="l02945" name="l02945"></a><span class="lineno"> 2945</span> next_savings_.push_back({next_saving, arc_index});</div>
|
|
<div class="line"><a id="l02946" name="l02946"></a><span class="lineno"> 2946</span> }</div>
|
|
<div class="line"><a id="l02947" name="l02947"></a><span class="lineno"> 2947</span> next_saving_added = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l02948" name="l02948"></a><span class="lineno"> 2948</span> }</div>
|
|
<div class="line"><a id="l02949" name="l02949"></a><span class="lineno"> 2949</span> </div>
|
|
<div class="line"><a id="l02950" name="l02950"></a><span class="lineno"> 2950</span> <span class="comment">// Skip the Saving based on the vehicle type.</span></div>
|
|
<div class="line"><a id="l02951" name="l02951"></a><span class="lineno"> 2951</span> <span class="keywordflow">if</span> (type == -1) {</div>
|
|
<div class="line"><a id="l02952" name="l02952"></a><span class="lineno"> 2952</span> <span class="comment">// Skip the current Saving.</span></div>
|
|
<div class="line"><a id="l02953" name="l02953"></a><span class="lineno"> 2953</span> SkipSavingForArc(current_saving_);</div>
|
|
<div class="line"><a id="l02954" name="l02954"></a><span class="lineno"> 2954</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l02955" name="l02955"></a><span class="lineno"> 2955</span> <span class="comment">// Skip the Saving with the correct type, already added to next_savings_</span></div>
|
|
<div class="line"><a id="l02956" name="l02956"></a><span class="lineno"> 2956</span> <span class="comment">// if it was found.</span></div>
|
|
<div class="line"><a id="l02957" name="l02957"></a><span class="lineno"> 2957</span> <span class="keywordflow">if</span> (next_saving_added) {</div>
|
|
<div class="line"><a id="l02958" name="l02958"></a><span class="lineno"> 2958</span> SkipSavingForArc({next_saving, arc_index});</div>
|
|
<div class="line"><a id="l02959" name="l02959"></a><span class="lineno"> 2959</span> }</div>
|
|
<div class="line"><a id="l02960" name="l02960"></a><span class="lineno"> 2960</span> }</div>
|
|
<div class="line"><a id="l02961" name="l02961"></a><span class="lineno"> 2961</span> }</div>
|
|
<div class="line"><a id="l02962" name="l02962"></a><span class="lineno"> 2962</span> </div>
|
|
<div class="line"><a id="l02963" name="l02963"></a><span class="lineno"> 2963</span> <span class="keywordtype">void</span> UpdateReinjectedSavings() {</div>
|
|
<div class="line"><a id="l02964" name="l02964"></a><span class="lineno"> 2964</span> UpdateGivenReinjectedSavings(incoming_new_reinjected_savings_,</div>
|
|
<div class="line"><a id="l02965" name="l02965"></a><span class="lineno"> 2965</span> &incoming_reinjected_savings_,</div>
|
|
<div class="line"><a id="l02966" name="l02966"></a><span class="lineno"> 2966</span> using_incoming_reinjected_saving_);</div>
|
|
<div class="line"><a id="l02967" name="l02967"></a><span class="lineno"> 2967</span> UpdateGivenReinjectedSavings(outgoing_new_reinjected_savings_,</div>
|
|
<div class="line"><a id="l02968" name="l02968"></a><span class="lineno"> 2968</span> &outgoing_reinjected_savings_,</div>
|
|
<div class="line"><a id="l02969" name="l02969"></a><span class="lineno"> 2969</span> !using_incoming_reinjected_saving_);</div>
|
|
<div class="line"><a id="l02970" name="l02970"></a><span class="lineno"> 2970</span> incoming_new_reinjected_savings_ = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l02971" name="l02971"></a><span class="lineno"> 2971</span> outgoing_new_reinjected_savings_ = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l02972" name="l02972"></a><span class="lineno"> 2972</span> }</div>
|
|
<div class="line"><a id="l02973" name="l02973"></a><span class="lineno"> 2973</span> </div>
|
|
<div class="line"><a id="l02974" name="l02974"></a><span class="lineno"> 2974</span> <span class="keywordtype">void</span> UpdateGivenReinjectedSavings(</div>
|
|
<div class="line"><a id="l02975" name="l02975"></a><span class="lineno"> 2975</span> std::deque<SavingAndArc>* new_reinjected_savings,</div>
|
|
<div class="line"><a id="l02976" name="l02976"></a><span class="lineno"> 2976</span> std::deque<SavingAndArc>** reinjected_savings,</div>
|
|
<div class="line"><a id="l02977" name="l02977"></a><span class="lineno"> 2977</span> <span class="keywordtype">bool</span> using_reinjected_savings) {</div>
|
|
<div class="line"><a id="l02978" name="l02978"></a><span class="lineno"> 2978</span> <span class="keywordflow">if</span> (new_reinjected_savings == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l02979" name="l02979"></a><span class="lineno"> 2979</span> <span class="comment">// No new reinjected savings, update the previous ones if needed.</span></div>
|
|
<div class="line"><a id="l02980" name="l02980"></a><span class="lineno"> 2980</span> <span class="keywordflow">if</span> (*reinjected_savings != <span class="keyword">nullptr</span> && using_reinjected_savings) {</div>
|
|
<div class="line"><a id="l02981" name="l02981"></a><span class="lineno"> 2981</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!(*reinjected_savings)->empty());</div>
|
|
<div class="line"><a id="l02982" name="l02982"></a><span class="lineno"> 2982</span> (*reinjected_savings)->pop_front();</div>
|
|
<div class="line"><a id="l02983" name="l02983"></a><span class="lineno"> 2983</span> <span class="keywordflow">if</span> ((*reinjected_savings)->empty()) {</div>
|
|
<div class="line"><a id="l02984" name="l02984"></a><span class="lineno"> 2984</span> *reinjected_savings = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l02985" name="l02985"></a><span class="lineno"> 2985</span> }</div>
|
|
<div class="line"><a id="l02986" name="l02986"></a><span class="lineno"> 2986</span> }</div>
|
|
<div class="line"><a id="l02987" name="l02987"></a><span class="lineno"> 2987</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l02988" name="l02988"></a><span class="lineno"> 2988</span> }</div>
|
|
<div class="line"><a id="l02989" name="l02989"></a><span class="lineno"> 2989</span> </div>
|
|
<div class="line"><a id="l02990" name="l02990"></a><span class="lineno"> 2990</span> <span class="comment">// New savings reinjected.</span></div>
|
|
<div class="line"><a id="l02991" name="l02991"></a><span class="lineno"> 2991</span> <span class="comment">// Forget about the previous reinjected savings and add the new ones if</span></div>
|
|
<div class="line"><a id="l02992" name="l02992"></a><span class="lineno"> 2992</span> <span class="comment">// there are any.</span></div>
|
|
<div class="line"><a id="l02993" name="l02993"></a><span class="lineno"> 2993</span> <span class="keywordflow">if</span> (*reinjected_savings != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l02994" name="l02994"></a><span class="lineno"> 2994</span> (*reinjected_savings)->clear();</div>
|
|
<div class="line"><a id="l02995" name="l02995"></a><span class="lineno"> 2995</span> }</div>
|
|
<div class="line"><a id="l02996" name="l02996"></a><span class="lineno"> 2996</span> *reinjected_savings = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l02997" name="l02997"></a><span class="lineno"> 2997</span> <span class="keywordflow">if</span> (!new_reinjected_savings->empty()) {</div>
|
|
<div class="line"><a id="l02998" name="l02998"></a><span class="lineno"> 2998</span> *reinjected_savings = new_reinjected_savings;</div>
|
|
<div class="line"><a id="l02999" name="l02999"></a><span class="lineno"> 2999</span> }</div>
|
|
<div class="line"><a id="l03000" name="l03000"></a><span class="lineno"> 3000</span> }</div>
|
|
<div class="line"><a id="l03001" name="l03001"></a><span class="lineno"> 3001</span> </div>
|
|
<div class="line"><a id="l03002" name="l03002"></a><span class="lineno"> 3002</span> <span class="keywordtype">bool</span> HasReinjectedSavings() {</div>
|
|
<div class="line"><a id="l03003" name="l03003"></a><span class="lineno"> 3003</span> <span class="keywordflow">return</span> outgoing_reinjected_savings_ != <span class="keyword">nullptr</span> ||</div>
|
|
<div class="line"><a id="l03004" name="l03004"></a><span class="lineno"> 3004</span> incoming_reinjected_savings_ != <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l03005" name="l03005"></a><span class="lineno"> 3005</span> }</div>
|
|
<div class="line"><a id="l03006" name="l03006"></a><span class="lineno"> 3006</span> </div>
|
|
<div class="line"><a id="l03007" name="l03007"></a><span class="lineno"> 3007</span> <span class="keywordtype">void</span> UpdateArcIndicesCostsAndSavings(</div>
|
|
<div class="line"><a id="l03008" name="l03008"></a><span class="lineno"> 3008</span> int64_t before_node, int64_t after_node,</div>
|
|
<div class="line"><a id="l03009" name="l03009"></a><span class="lineno"> 3009</span> <span class="keyword">const</span> std::pair<int64_t, Saving>& cost_and_saving) {</div>
|
|
<div class="line"><a id="l03010" name="l03010"></a><span class="lineno"> 3010</span> <span class="keywordflow">if</span> (single_vehicle_type_) {</div>
|
|
<div class="line"><a id="l03011" name="l03011"></a><span class="lineno"> 3011</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l03012" name="l03012"></a><span class="lineno"> 3012</span> }</div>
|
|
<div class="line"><a id="l03013" name="l03013"></a><span class="lineno"> 3013</span> absl::flat_hash_map<int, int>& arc_indices =</div>
|
|
<div class="line"><a id="l03014" name="l03014"></a><span class="lineno"> 3014</span> arc_indices_per_before_node_[before_node];</div>
|
|
<div class="line"><a id="l03015" name="l03015"></a><span class="lineno"> 3015</span> <span class="keyword">const</span> <span class="keyword">auto</span>& arc_inserted = arc_indices.insert(</div>
|
|
<div class="line"><a id="l03016" name="l03016"></a><span class="lineno"> 3016</span> std::make_pair(after_node, costs_and_savings_per_arc_.size()));</div>
|
|
<div class="line"><a id="l03017" name="l03017"></a><span class="lineno"> 3017</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a> = arc_inserted.first->second;</div>
|
|
<div class="line"><a id="l03018" name="l03018"></a><span class="lineno"> 3018</span> <span class="keywordflow">if</span> (arc_inserted.second) {</div>
|
|
<div class="line"><a id="l03019" name="l03019"></a><span class="lineno"> 3019</span> costs_and_savings_per_arc_.push_back({cost_and_saving});</div>
|
|
<div class="line"><a id="l03020" name="l03020"></a><span class="lineno"> 3020</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l03021" name="l03021"></a><span class="lineno"> 3021</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>, costs_and_savings_per_arc_.size());</div>
|
|
<div class="line"><a id="l03022" name="l03022"></a><span class="lineno"> 3022</span> costs_and_savings_per_arc_[<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>].push_back(cost_and_saving);</div>
|
|
<div class="line"><a id="l03023" name="l03023"></a><span class="lineno"> 3023</span> }</div>
|
|
<div class="line"><a id="l03024" name="l03024"></a><span class="lineno"> 3024</span> }</div>
|
|
<div class="line"><a id="l03025" name="l03025"></a><span class="lineno"> 3025</span> </div>
|
|
<div class="line"><a id="l03026" name="l03026"></a><span class="lineno"> 3026</span> <span class="keywordtype">bool</span> GetNextSavingForArcWithType(int64_t arc_index, <span class="keywordtype">int</span> type,</div>
|
|
<div class="line"><a id="l03027" name="l03027"></a><span class="lineno"> 3027</span> Saving* next_saving) {</div>
|
|
<div class="line"><a id="l03028" name="l03028"></a><span class="lineno"> 3028</span> std::vector<std::pair<int64_t, Saving>>& costs_and_savings =</div>
|
|
<div class="line"><a id="l03029" name="l03029"></a><span class="lineno"> 3029</span> costs_and_savings_per_arc_[arc_index];</div>
|
|
<div class="line"><a id="l03030" name="l03030"></a><span class="lineno"> 3030</span> </div>
|
|
<div class="line"><a id="l03031" name="l03031"></a><span class="lineno"> 3031</span> <span class="keywordtype">bool</span> found_saving = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l03032" name="l03032"></a><span class="lineno"> 3032</span> <span class="keywordflow">while</span> (!costs_and_savings.empty() && !found_saving) {</div>
|
|
<div class="line"><a id="l03033" name="l03033"></a><span class="lineno"> 3033</span> <span class="keyword">const</span> Saving& saving = costs_and_savings.back().second;</div>
|
|
<div class="line"><a id="l03034" name="l03034"></a><span class="lineno"> 3034</span> <span class="keywordflow">if</span> (type == -1 || savings_db_->GetVehicleTypeFromSaving(saving) == type) {</div>
|
|
<div class="line"><a id="l03035" name="l03035"></a><span class="lineno"> 3035</span> *next_saving = saving;</div>
|
|
<div class="line"><a id="l03036" name="l03036"></a><span class="lineno"> 3036</span> found_saving = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l03037" name="l03037"></a><span class="lineno"> 3037</span> }</div>
|
|
<div class="line"><a id="l03038" name="l03038"></a><span class="lineno"> 3038</span> costs_and_savings.pop_back();</div>
|
|
<div class="line"><a id="l03039" name="l03039"></a><span class="lineno"> 3039</span> }</div>
|
|
<div class="line"><a id="l03040" name="l03040"></a><span class="lineno"> 3040</span> <span class="keywordflow">return</span> found_saving;</div>
|
|
<div class="line"><a id="l03041" name="l03041"></a><span class="lineno"> 3041</span> }</div>
|
|
<div class="line"><a id="l03042" name="l03042"></a><span class="lineno"> 3042</span> </div>
|
|
<div class="line"><a id="l03043" name="l03043"></a><span class="lineno"> 3043</span> <span class="keyword">const</span> SavingsFilteredHeuristic* <span class="keyword">const</span> savings_db_;</div>
|
|
<div class="line"><a id="l03044" name="l03044"></a><span class="lineno"> 3044</span> int64_t index_in_sorted_savings_;</div>
|
|
<div class="line"><a id="l03045" name="l03045"></a><span class="lineno"> 3045</span> std::vector<std::vector<Saving>> sorted_savings_per_vehicle_type_;</div>
|
|
<div class="line"><a id="l03046" name="l03046"></a><span class="lineno"> 3046</span> std::vector<SavingAndArc> sorted_savings_;</div>
|
|
<div class="line"><a id="l03047" name="l03047"></a><span class="lineno"> 3047</span> std::vector<SavingAndArc> next_savings_;</div>
|
|
<div class="line"><a id="l03048" name="l03048"></a><span class="lineno"> 3048</span> std::vector<std::pair<<span class="comment">/*type*/</span> int, <span class="comment">/*index*/</span> <span class="keywordtype">int</span>>></div>
|
|
<div class="line"><a id="l03049" name="l03049"></a><span class="lineno"> 3049</span> next_saving_type_and_index_for_arc_;</div>
|
|
<div class="line"><a id="l03050" name="l03050"></a><span class="lineno"> 3050</span> SavingAndArc current_saving_;</div>
|
|
<div class="line"><a id="l03051" name="l03051"></a><span class="lineno"> 3051</span> std::vector<std::vector<std::pair<<span class="comment">/*cost*/</span> int64_t, Saving>>></div>
|
|
<div class="line"><a id="l03052" name="l03052"></a><span class="lineno"> 3052</span> costs_and_savings_per_arc_;</div>
|
|
<div class="line"><a id="l03053" name="l03053"></a><span class="lineno"> 3053</span> std::vector<absl::flat_hash_map<<span class="comment">/*after_node*/</span> int, <span class="comment">/*arc_index*/</span> <span class="keywordtype">int</span>>></div>
|
|
<div class="line"><a id="l03054" name="l03054"></a><span class="lineno"> 3054</span> arc_indices_per_before_node_;</div>
|
|
<div class="line"><a id="l03055" name="l03055"></a><span class="lineno"> 3055</span> std::vector<std::deque<SavingAndArc>> skipped_savings_starting_at_;</div>
|
|
<div class="line"><a id="l03056" name="l03056"></a><span class="lineno"> 3056</span> std::vector<std::deque<SavingAndArc>> skipped_savings_ending_at_;</div>
|
|
<div class="line"><a id="l03057" name="l03057"></a><span class="lineno"> 3057</span> std::deque<SavingAndArc>* outgoing_reinjected_savings_;</div>
|
|
<div class="line"><a id="l03058" name="l03058"></a><span class="lineno"> 3058</span> std::deque<SavingAndArc>* incoming_reinjected_savings_;</div>
|
|
<div class="line"><a id="l03059" name="l03059"></a><span class="lineno"> 3059</span> std::deque<SavingAndArc>* outgoing_new_reinjected_savings_;</div>
|
|
<div class="line"><a id="l03060" name="l03060"></a><span class="lineno"> 3060</span> std::deque<SavingAndArc>* incoming_new_reinjected_savings_;</div>
|
|
<div class="line"><a id="l03061" name="l03061"></a><span class="lineno"> 3061</span> <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle_types_;</div>
|
|
<div class="line"><a id="l03062" name="l03062"></a><span class="lineno"> 3062</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> single_vehicle_type_;</div>
|
|
<div class="line"><a id="l03063" name="l03063"></a><span class="lineno"> 3063</span> <span class="keywordtype">bool</span> using_incoming_reinjected_saving_;</div>
|
|
<div class="line"><a id="l03064" name="l03064"></a><span class="lineno"> 3064</span> <span class="keywordtype">bool</span> sorted_;</div>
|
|
<div class="line"><a id="l03065" name="l03065"></a><span class="lineno"> 3065</span> <span class="keywordtype">bool</span> to_update_;</div>
|
|
<div class="line"><a id="l03066" name="l03066"></a><span class="lineno"> 3066</span>};</div>
|
|
<div class="line"><a id="l03067" name="l03067"></a><span class="lineno"> 3067</span> </div>
|
|
<div class="line"><a id="l03068" name="l03068"></a><span class="lineno"> 3068</span><span class="comment">// SavingsFilteredHeuristic</span></div>
|
|
<div class="line"><a id="l03069" name="l03069"></a><span class="lineno"> 3069</span> </div>
|
|
<div class="line"><a id="l03070" name="l03070"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic.html#a04f0558b5828ce46108dca7e5a3a8504"> 3070</a></span><a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#a04f0558b5828ce46108dca7e5a3a8504">SavingsFilteredHeuristic::SavingsFilteredHeuristic</a>(</div>
|
|
<div class="line"><a id="l03071" name="l03071"></a><span class="lineno"> 3071</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code hl_struct" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html">SavingsParameters</a> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>,</div>
|
|
<div class="line"><a id="l03072" name="l03072"></a><span class="lineno"> 3072</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager)</div>
|
|
<div class="line"><a id="l03073" name="l03073"></a><span class="lineno"> 3073</span> : <a class="code hl_class" href="classoperations__research_1_1_routing_filtered_heuristic.html">RoutingFilteredHeuristic</a>(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, filter_manager),</div>
|
|
<div class="line"><a id="l03074" name="l03074"></a><span class="lineno"> 3074</span> vehicle_type_curator_(nullptr),</div>
|
|
<div class="line"><a id="l03075" name="l03075"></a><span class="lineno"> 3075</span> savings_params_(<a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>) {</div>
|
|
<div class="line"><a id="l03076" name="l03076"></a><span class="lineno"> 3076</span> <a class="code hl_define" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(savings_params_.<a class="code hl_variable" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a0aa77787d0df1b489476bfc6714ef819">neighbors_ratio</a>, 0);</div>
|
|
<div class="line"><a id="l03077" name="l03077"></a><span class="lineno"> 3077</span> <a class="code hl_define" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(savings_params_.<a class="code hl_variable" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a0aa77787d0df1b489476bfc6714ef819">neighbors_ratio</a>, 1);</div>
|
|
<div class="line"><a id="l03078" name="l03078"></a><span class="lineno"> 3078</span> <a class="code hl_define" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(savings_params_.<a class="code hl_variable" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a33bd2c84a2be54d10959e5c0d81f86b5">max_memory_usage_bytes</a>, 0);</div>
|
|
<div class="line"><a id="l03079" name="l03079"></a><span class="lineno"> 3079</span> <a class="code hl_define" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(savings_params_.<a class="code hl_variable" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a222a2814083966736ad9aefde1dde290">arc_coefficient</a>, 0);</div>
|
|
<div class="line"><a id="l03080" name="l03080"></a><span class="lineno"> 3080</span> <span class="keyword">const</span> <span class="keywordtype">int</span> size = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">Size</a>();</div>
|
|
<div class="line"><a id="l03081" name="l03081"></a><span class="lineno"> 3081</span> size_squared_ = size * size;</div>
|
|
<div class="line"><a id="l03082" name="l03082"></a><span class="lineno"> 3082</span>}</div>
|
|
<div class="line"><a id="l03083" name="l03083"></a><span class="lineno"> 3083</span> </div>
|
|
<div class="line"><a id="l03084" name="l03084"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic.html#a69f73ddf69522d81d6dd919c316cae8a"> 3084</a></span><a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#a69f73ddf69522d81d6dd919c316cae8a">SavingsFilteredHeuristic::~SavingsFilteredHeuristic</a>() {}</div>
|
|
<div class="line"><a id="l03085" name="l03085"></a><span class="lineno"> 3085</span> </div>
|
|
<div class="line"><a id="l03086" name="l03086"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289"> 3086</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">SavingsFilteredHeuristic::BuildSolutionInternal</a>() {</div>
|
|
<div class="line"><a id="l03087" name="l03087"></a><span class="lineno"> 3087</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a> == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l03088" name="l03088"></a><span class="lineno"> 3088</span> <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a> = absl::make_unique<VehicleTypeCurator>(</div>
|
|
<div class="line"><a id="l03089" name="l03089"></a><span class="lineno"> 3089</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->GetVehicleTypeContainer());</div>
|
|
<div class="line"><a id="l03090" name="l03090"></a><span class="lineno"> 3090</span> }</div>
|
|
<div class="line"><a id="l03091" name="l03091"></a><span class="lineno"> 3091</span> <span class="comment">// Only store empty vehicles in the vehicle_type_curator_.</span></div>
|
|
<div class="line"><a id="l03092" name="l03092"></a><span class="lineno"> 3092</span> <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a>->Reset(</div>
|
|
<div class="line"><a id="l03093" name="l03093"></a><span class="lineno"> 3093</span> [<span class="keyword">this</span>](<span class="keywordtype">int</span> vehicle) { <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(vehicle); });</div>
|
|
<div class="line"><a id="l03094" name="l03094"></a><span class="lineno"> 3094</span> <span class="keywordflow">if</span> (!ComputeSavings()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l03095" name="l03095"></a><span class="lineno"> 3095</span> <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#aeb4e0e0b0899af694678658062b4f037">BuildRoutesFromSavings</a>();</div>
|
|
<div class="line"><a id="l03096" name="l03096"></a><span class="lineno"> 3096</span> <span class="comment">// Free all the space used to store the Savings in the container.</span></div>
|
|
<div class="line"><a id="l03097" name="l03097"></a><span class="lineno"> 3097</span> <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>.reset();</div>
|
|
<div class="line"><a id="l03098" name="l03098"></a><span class="lineno"> 3098</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a97049801609b8cb68c0428970f916fd4">MakeUnassignedNodesUnperformed</a>();</div>
|
|
<div class="line"><a id="l03099" name="l03099"></a><span class="lineno"> 3099</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l03100" name="l03100"></a><span class="lineno"> 3100</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#abaca104cf41b5a5e3554f8ad72cdc28c">MakePartiallyPerformedPairsUnperformed</a>();</div>
|
|
<div class="line"><a id="l03101" name="l03101"></a><span class="lineno"> 3101</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value();</div>
|
|
<div class="line"><a id="l03102" name="l03102"></a><span class="lineno"> 3102</span>}</div>
|
|
<div class="line"><a id="l03103" name="l03103"></a><span class="lineno"> 3103</span> </div>
|
|
<div class="line"><a id="l03104" name="l03104"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_savings_filtered_heuristic.html#ad1f89eda8b1c2ad8fe6f5743e475fd5d"> 3104</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#ad1f89eda8b1c2ad8fe6f5743e475fd5d">SavingsFilteredHeuristic::StartNewRouteWithBestVehicleOfType</a>(</div>
|
|
<div class="line"><a id="l03105" name="l03105"></a><span class="lineno"> 3105</span> <span class="keywordtype">int</span> type, int64_t before_node, int64_t after_node) {</div>
|
|
<div class="line"><a id="l03106" name="l03106"></a><span class="lineno"> 3106</span> <span class="keyword">auto</span> vehicle_is_compatible = [<span class="keyword">this</span>, before_node, after_node](<span class="keywordtype">int</span> vehicle) {</div>
|
|
<div class="line"><a id="l03107" name="l03107"></a><span class="lineno"> 3107</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a43c00b1c44d7f5bec9287ce60fadef52">VehicleVar</a>(before_node)-><a class="code hl_function" href="classoperations__research_1_1_int_var.html#a0723abf37f7a5a8a604fd1bcd96a7be0">Contains</a>(vehicle) ||</div>
|
|
<div class="line"><a id="l03108" name="l03108"></a><span class="lineno"> 3108</span> !<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a43c00b1c44d7f5bec9287ce60fadef52">VehicleVar</a>(after_node)-><a class="code hl_function" href="classoperations__research_1_1_int_var.html#a0723abf37f7a5a8a604fd1bcd96a7be0">Contains</a>(vehicle)) {</div>
|
|
<div class="line"><a id="l03109" name="l03109"></a><span class="lineno"> 3109</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l03110" name="l03110"></a><span class="lineno"> 3110</span> }</div>
|
|
<div class="line"><a id="l03111" name="l03111"></a><span class="lineno"> 3111</span> <span class="comment">// Try to commit the arc on this vehicle.</span></div>
|
|
<div class="line"><a id="l03112" name="l03112"></a><span class="lineno"> 3112</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">VehicleIsEmpty</a>(vehicle));</div>
|
|
<div class="line"><a id="l03113" name="l03113"></a><span class="lineno"> 3113</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a> = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(vehicle);</div>
|
|
<div class="line"><a id="l03114" name="l03114"></a><span class="lineno"> 3114</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a> = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#afb80fd36c1fb57d2db049403483e2074">End</a>(vehicle);</div>
|
|
<div class="line"><a id="l03115" name="l03115"></a><span class="lineno"> 3115</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(<a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>, before_node);</div>
|
|
<div class="line"><a id="l03116" name="l03116"></a><span class="lineno"> 3116</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(before_node, after_node);</div>
|
|
<div class="line"><a id="l03117" name="l03117"></a><span class="lineno"> 3117</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(after_node, <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>);</div>
|
|
<div class="line"><a id="l03118" name="l03118"></a><span class="lineno"> 3118</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value();</div>
|
|
<div class="line"><a id="l03119" name="l03119"></a><span class="lineno"> 3119</span> };</div>
|
|
<div class="line"><a id="l03120" name="l03120"></a><span class="lineno"> 3120</span> </div>
|
|
<div class="line"><a id="l03121" name="l03121"></a><span class="lineno"> 3121</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a></div>
|
|
<div class="line"><a id="l03122" name="l03122"></a><span class="lineno"> 3122</span> ->GetCompatibleVehicleOfType(</div>
|
|
<div class="line"><a id="l03123" name="l03123"></a><span class="lineno"> 3123</span> type, vehicle_is_compatible,</div>
|
|
<div class="line"><a id="l03124" name="l03124"></a><span class="lineno"> 3124</span> <span class="comment">/*stop_and_return_vehicle*/</span> [](<span class="keywordtype">int</span>) { <span class="keywordflow">return</span> <span class="keyword">false</span>; })</div>
|
|
<div class="line"><a id="l03125" name="l03125"></a><span class="lineno"> 3125</span> .first;</div>
|
|
<div class="line"><a id="l03126" name="l03126"></a><span class="lineno"> 3126</span>}</div>
|
|
<div class="line"><a id="l03127" name="l03127"></a><span class="lineno"> 3127</span> </div>
|
|
<div class="line"><a id="l03128" name="l03128"></a><span class="lineno"> 3128</span><span class="keywordtype">void</span> SavingsFilteredHeuristic::AddSymmetricArcsToAdjacencyLists(</div>
|
|
<div class="line"><a id="l03129" name="l03129"></a><span class="lineno"> 3129</span> std::vector<std::vector<int64_t>>* adjacency_lists) {</div>
|
|
<div class="line"><a id="l03130" name="l03130"></a><span class="lineno"> 3130</span> <span class="keywordflow">for</span> (int64_t node = 0; node < adjacency_lists->size(); node++) {</div>
|
|
<div class="line"><a id="l03131" name="l03131"></a><span class="lineno"> 3131</span> <span class="keywordflow">for</span> (int64_t neighbor : (*adjacency_lists)[node]) {</div>
|
|
<div class="line"><a id="l03132" name="l03132"></a><span class="lineno"> 3132</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->IsStart(neighbor) || <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->IsEnd(neighbor)) {</div>
|
|
<div class="line"><a id="l03133" name="l03133"></a><span class="lineno"> 3133</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l03134" name="l03134"></a><span class="lineno"> 3134</span> }</div>
|
|
<div class="line"><a id="l03135" name="l03135"></a><span class="lineno"> 3135</span> (*adjacency_lists)[neighbor].push_back(node);</div>
|
|
<div class="line"><a id="l03136" name="l03136"></a><span class="lineno"> 3136</span> }</div>
|
|
<div class="line"><a id="l03137" name="l03137"></a><span class="lineno"> 3137</span> }</div>
|
|
<div class="line"><a id="l03138" name="l03138"></a><span class="lineno"> 3138</span> std::transform(adjacency_lists->begin(), adjacency_lists->end(),</div>
|
|
<div class="line"><a id="l03139" name="l03139"></a><span class="lineno"> 3139</span> adjacency_lists->begin(), [](std::vector<int64_t> vec) {</div>
|
|
<div class="line"><a id="l03140" name="l03140"></a><span class="lineno"> 3140</span> std::sort(vec.begin(), vec.end());</div>
|
|
<div class="line"><a id="l03141" name="l03141"></a><span class="lineno"> 3141</span> vec.erase(std::unique(vec.begin(), vec.end()), vec.end());</div>
|
|
<div class="line"><a id="l03142" name="l03142"></a><span class="lineno"> 3142</span> return vec;</div>
|
|
<div class="line"><a id="l03143" name="l03143"></a><span class="lineno"> 3143</span> });</div>
|
|
<div class="line"><a id="l03144" name="l03144"></a><span class="lineno"> 3144</span>}</div>
|
|
<div class="line"><a id="l03145" name="l03145"></a><span class="lineno"> 3145</span> </div>
|
|
<div class="line"><a id="l03146" name="l03146"></a><span class="lineno"> 3146</span><span class="comment">// Computes the savings related to each pair of non-start and non-end nodes.</span></div>
|
|
<div class="line"><a id="l03147" name="l03147"></a><span class="lineno"> 3147</span><span class="comment">// The savings value for an arc a-->b for a vehicle starting at node s and</span></div>
|
|
<div class="line"><a id="l03148" name="l03148"></a><span class="lineno"> 3148</span><span class="comment">// ending at node e is:</span></div>
|
|
<div class="line"><a id="l03149" name="l03149"></a><span class="lineno"> 3149</span><span class="comment">// saving = cost(s-->a-->e) + cost(s-->b-->e) - cost(s-->a-->b-->e), i.e.</span></div>
|
|
<div class="line"><a id="l03150" name="l03150"></a><span class="lineno"> 3150</span><span class="comment">// saving = cost(a-->e) + cost(s-->b) - cost(a-->b)</span></div>
|
|
<div class="line"><a id="l03151" name="l03151"></a><span class="lineno"> 3151</span><span class="comment">// The saving value also considers a coefficient for the cost of the arc</span></div>
|
|
<div class="line"><a id="l03152" name="l03152"></a><span class="lineno"> 3152</span><span class="comment">// a-->b, which results in:</span></div>
|
|
<div class="line"><a id="l03153" name="l03153"></a><span class="lineno"> 3153</span><span class="comment">// saving = cost(a-->e) + cost(s-->b) - [arc_coefficient_ * cost(a-->b)]</span></div>
|
|
<div class="line"><a id="l03154" name="l03154"></a><span class="lineno"> 3154</span><span class="comment">// The higher this saving value, the better the arc.</span></div>
|
|
<div class="line"><a id="l03155" name="l03155"></a><span class="lineno"> 3155</span><span class="comment">// Here, the value stored for the savings is -saving, which are therefore</span></div>
|
|
<div class="line"><a id="l03156" name="l03156"></a><span class="lineno"> 3156</span><span class="comment">// considered in decreasing order.</span></div>
|
|
<div class="line"><a id="l03157" name="l03157"></a><span class="lineno"> 3157</span><span class="keywordtype">bool</span> SavingsFilteredHeuristic::ComputeSavings() {</div>
|
|
<div class="line"><a id="l03158" name="l03158"></a><span class="lineno"> 3158</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_vehicle_types = <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a>->NumTypes();</div>
|
|
<div class="line"><a id="l03159" name="l03159"></a><span class="lineno"> 3159</span> <span class="keyword">const</span> <span class="keywordtype">int</span> size = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">Size</a>();</div>
|
|
<div class="line"><a id="l03160" name="l03160"></a><span class="lineno"> 3160</span> </div>
|
|
<div class="line"><a id="l03161" name="l03161"></a><span class="lineno"> 3161</span> std::vector<int64_t> uncontained_non_start_end_nodes;</div>
|
|
<div class="line"><a id="l03162" name="l03162"></a><span class="lineno"> 3162</span> uncontained_non_start_end_nodes.reserve(size);</div>
|
|
<div class="line"><a id="l03163" name="l03163"></a><span class="lineno"> 3163</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < size; node++) {</div>
|
|
<div class="line"><a id="l03164" name="l03164"></a><span class="lineno"> 3164</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->IsStart(node) && !<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->IsEnd(node) && !<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(node)) {</div>
|
|
<div class="line"><a id="l03165" name="l03165"></a><span class="lineno"> 3165</span> uncontained_non_start_end_nodes.push_back(node);</div>
|
|
<div class="line"><a id="l03166" name="l03166"></a><span class="lineno"> 3166</span> }</div>
|
|
<div class="line"><a id="l03167" name="l03167"></a><span class="lineno"> 3167</span> }</div>
|
|
<div class="line"><a id="l03168" name="l03168"></a><span class="lineno"> 3168</span> </div>
|
|
<div class="line"><a id="l03169" name="l03169"></a><span class="lineno"> 3169</span> <span class="keyword">const</span> int64_t saving_neighbors =</div>
|
|
<div class="line"><a id="l03170" name="l03170"></a><span class="lineno"> 3170</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(MaxNumNeighborsPerNode(num_vehicle_types),</div>
|
|
<div class="line"><a id="l03171" name="l03171"></a><span class="lineno"> 3171</span> <span class="keyword">static_cast<</span>int64_t<span class="keyword">></span>(uncontained_non_start_end_nodes.size()));</div>
|
|
<div class="line"><a id="l03172" name="l03172"></a><span class="lineno"> 3172</span> </div>
|
|
<div class="line"><a id="l03173" name="l03173"></a><span class="lineno"> 3173</span> <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a> =</div>
|
|
<div class="line"><a id="l03174" name="l03174"></a><span class="lineno"> 3174</span> absl::make_unique<SavingsContainer<Saving>>(<span class="keyword">this</span>, num_vehicle_types);</div>
|
|
<div class="line"><a id="l03175" name="l03175"></a><span class="lineno"> 3175</span> <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->InitializeContainer(size, saving_neighbors);</div>
|
|
<div class="line"><a id="l03176" name="l03176"></a><span class="lineno"> 3176</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l03177" name="l03177"></a><span class="lineno"> 3177</span> std::vector<std::vector<int64_t>> adjacency_lists(size);</div>
|
|
<div class="line"><a id="l03178" name="l03178"></a><span class="lineno"> 3178</span> </div>
|
|
<div class="line"><a id="l03179" name="l03179"></a><span class="lineno"> 3179</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> type = 0; type < num_vehicle_types; ++type) {</div>
|
|
<div class="line"><a id="l03180" name="l03180"></a><span class="lineno"> 3180</span> <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle =</div>
|
|
<div class="line"><a id="l03181" name="l03181"></a><span class="lineno"> 3181</span> <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a>->GetLowestFixedCostVehicleOfType(type);</div>
|
|
<div class="line"><a id="l03182" name="l03182"></a><span class="lineno"> 3182</span> <span class="keywordflow">if</span> (vehicle < 0) {</div>
|
|
<div class="line"><a id="l03183" name="l03183"></a><span class="lineno"> 3183</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l03184" name="l03184"></a><span class="lineno"> 3184</span> }</div>
|
|
<div class="line"><a id="l03185" name="l03185"></a><span class="lineno"> 3185</span> </div>
|
|
<div class="line"><a id="l03186" name="l03186"></a><span class="lineno"> 3186</span> <span class="keyword">const</span> int64_t cost_class =</div>
|
|
<div class="line"><a id="l03187" name="l03187"></a><span class="lineno"> 3187</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#ae378d23c967e818f321bd4498b5c74f2">GetCostClassIndexOfVehicle</a>(vehicle).value();</div>
|
|
<div class="line"><a id="l03188" name="l03188"></a><span class="lineno"> 3188</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a> = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(vehicle);</div>
|
|
<div class="line"><a id="l03189" name="l03189"></a><span class="lineno"> 3189</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a> = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#afb80fd36c1fb57d2db049403483e2074">End</a>(vehicle);</div>
|
|
<div class="line"><a id="l03190" name="l03190"></a><span class="lineno"> 3190</span> <span class="keyword">const</span> int64_t fixed_cost = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a34bd38fe78ef5896f2a623170f1be5d0">GetFixedCostOfVehicle</a>(vehicle);</div>
|
|
<div class="line"><a id="l03191" name="l03191"></a><span class="lineno"> 3191</span> </div>
|
|
<div class="line"><a id="l03192" name="l03192"></a><span class="lineno"> 3192</span> <span class="comment">// Compute the neighbors for each non-start/end node not already inserted in</span></div>
|
|
<div class="line"><a id="l03193" name="l03193"></a><span class="lineno"> 3193</span> <span class="comment">// the model.</span></div>
|
|
<div class="line"><a id="l03194" name="l03194"></a><span class="lineno"> 3194</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> before_node : uncontained_non_start_end_nodes) {</div>
|
|
<div class="line"><a id="l03195" name="l03195"></a><span class="lineno"> 3195</span> std::vector<std::pair<<span class="comment">/*cost*/</span> int64_t, <span class="comment">/*node*/</span> int64_t>></div>
|
|
<div class="line"><a id="l03196" name="l03196"></a><span class="lineno"> 3196</span> costed_after_nodes;</div>
|
|
<div class="line"><a id="l03197" name="l03197"></a><span class="lineno"> 3197</span> costed_after_nodes.reserve(uncontained_non_start_end_nodes.size());</div>
|
|
<div class="line"><a id="l03198" name="l03198"></a><span class="lineno"> 3198</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l03199" name="l03199"></a><span class="lineno"> 3199</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> after_node : uncontained_non_start_end_nodes) {</div>
|
|
<div class="line"><a id="l03200" name="l03200"></a><span class="lineno"> 3200</span> <span class="keywordflow">if</span> (after_node != before_node) {</div>
|
|
<div class="line"><a id="l03201" name="l03201"></a><span class="lineno"> 3201</span> costed_after_nodes.push_back(std::make_pair(</div>
|
|
<div class="line"><a id="l03202" name="l03202"></a><span class="lineno"> 3202</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->GetArcCostForClass(before_node, after_node, cost_class),</div>
|
|
<div class="line"><a id="l03203" name="l03203"></a><span class="lineno"> 3203</span> after_node));</div>
|
|
<div class="line"><a id="l03204" name="l03204"></a><span class="lineno"> 3204</span> }</div>
|
|
<div class="line"><a id="l03205" name="l03205"></a><span class="lineno"> 3205</span> }</div>
|
|
<div class="line"><a id="l03206" name="l03206"></a><span class="lineno"> 3206</span> <span class="keywordflow">if</span> (saving_neighbors < costed_after_nodes.size()) {</div>
|
|
<div class="line"><a id="l03207" name="l03207"></a><span class="lineno"> 3207</span> std::nth_element(costed_after_nodes.begin(),</div>
|
|
<div class="line"><a id="l03208" name="l03208"></a><span class="lineno"> 3208</span> costed_after_nodes.begin() + saving_neighbors,</div>
|
|
<div class="line"><a id="l03209" name="l03209"></a><span class="lineno"> 3209</span> costed_after_nodes.end());</div>
|
|
<div class="line"><a id="l03210" name="l03210"></a><span class="lineno"> 3210</span> costed_after_nodes.resize(saving_neighbors);</div>
|
|
<div class="line"><a id="l03211" name="l03211"></a><span class="lineno"> 3211</span> }</div>
|
|
<div class="line"><a id="l03212" name="l03212"></a><span class="lineno"> 3212</span> adjacency_lists[before_node].resize(costed_after_nodes.size());</div>
|
|
<div class="line"><a id="l03213" name="l03213"></a><span class="lineno"> 3213</span> std::transform(costed_after_nodes.begin(), costed_after_nodes.end(),</div>
|
|
<div class="line"><a id="l03214" name="l03214"></a><span class="lineno"> 3214</span> adjacency_lists[before_node].begin(),</div>
|
|
<div class="line"><a id="l03215" name="l03215"></a><span class="lineno"> 3215</span> [](std::pair<int64_t, int64_t> cost_and_node) {</div>
|
|
<div class="line"><a id="l03216" name="l03216"></a><span class="lineno"> 3216</span> return cost_and_node.second;</div>
|
|
<div class="line"><a id="l03217" name="l03217"></a><span class="lineno"> 3217</span> });</div>
|
|
<div class="line"><a id="l03218" name="l03218"></a><span class="lineno"> 3218</span> }</div>
|
|
<div class="line"><a id="l03219" name="l03219"></a><span class="lineno"> 3219</span> <span class="keywordflow">if</span> (savings_params_.<a class="code hl_variable" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a8857f65b46da9e2012c7bd939a978442">add_reverse_arcs</a>) {</div>
|
|
<div class="line"><a id="l03220" name="l03220"></a><span class="lineno"> 3220</span> AddSymmetricArcsToAdjacencyLists(&adjacency_lists);</div>
|
|
<div class="line"><a id="l03221" name="l03221"></a><span class="lineno"> 3221</span> }</div>
|
|
<div class="line"><a id="l03222" name="l03222"></a><span class="lineno"> 3222</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l03223" name="l03223"></a><span class="lineno"> 3223</span> </div>
|
|
<div class="line"><a id="l03224" name="l03224"></a><span class="lineno"> 3224</span> <span class="comment">// Build the savings for this vehicle type given the adjacency_lists.</span></div>
|
|
<div class="line"><a id="l03225" name="l03225"></a><span class="lineno"> 3225</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> before_node : uncontained_non_start_end_nodes) {</div>
|
|
<div class="line"><a id="l03226" name="l03226"></a><span class="lineno"> 3226</span> <span class="keyword">const</span> int64_t before_to_end_cost =</div>
|
|
<div class="line"><a id="l03227" name="l03227"></a><span class="lineno"> 3227</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#abfa127093eb53ae531ccb1f4ada6cc8a">GetArcCostForClass</a>(before_node, <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>, cost_class);</div>
|
|
<div class="line"><a id="l03228" name="l03228"></a><span class="lineno"> 3228</span> <span class="keyword">const</span> int64_t start_to_before_cost =</div>
|
|
<div class="line"><a id="l03229" name="l03229"></a><span class="lineno"> 3229</span> <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->GetArcCostForClass(<a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>, before_node, cost_class),</div>
|
|
<div class="line"><a id="l03230" name="l03230"></a><span class="lineno"> 3230</span> fixed_cost);</div>
|
|
<div class="line"><a id="l03231" name="l03231"></a><span class="lineno"> 3231</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l03232" name="l03232"></a><span class="lineno"> 3232</span> <span class="keywordflow">for</span> (int64_t after_node : adjacency_lists[before_node]) {</div>
|
|
<div class="line"><a id="l03233" name="l03233"></a><span class="lineno"> 3233</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->IsStart(after_node) || <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->IsEnd(after_node) ||</div>
|
|
<div class="line"><a id="l03234" name="l03234"></a><span class="lineno"> 3234</span> before_node == after_node || <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(after_node)) {</div>
|
|
<div class="line"><a id="l03235" name="l03235"></a><span class="lineno"> 3235</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l03236" name="l03236"></a><span class="lineno"> 3236</span> }</div>
|
|
<div class="line"><a id="l03237" name="l03237"></a><span class="lineno"> 3237</span> <span class="keyword">const</span> int64_t arc_cost =</div>
|
|
<div class="line"><a id="l03238" name="l03238"></a><span class="lineno"> 3238</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#abfa127093eb53ae531ccb1f4ada6cc8a">GetArcCostForClass</a>(before_node, after_node, cost_class);</div>
|
|
<div class="line"><a id="l03239" name="l03239"></a><span class="lineno"> 3239</span> <span class="keyword">const</span> int64_t start_to_after_cost =</div>
|
|
<div class="line"><a id="l03240" name="l03240"></a><span class="lineno"> 3240</span> <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->GetArcCostForClass(<a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>, after_node, cost_class),</div>
|
|
<div class="line"><a id="l03241" name="l03241"></a><span class="lineno"> 3241</span> fixed_cost);</div>
|
|
<div class="line"><a id="l03242" name="l03242"></a><span class="lineno"> 3242</span> <span class="keyword">const</span> int64_t after_to_end_cost =</div>
|
|
<div class="line"><a id="l03243" name="l03243"></a><span class="lineno"> 3243</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#abfa127093eb53ae531ccb1f4ada6cc8a">GetArcCostForClass</a>(after_node, <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>, cost_class);</div>
|
|
<div class="line"><a id="l03244" name="l03244"></a><span class="lineno"> 3244</span> </div>
|
|
<div class="line"><a id="l03245" name="l03245"></a><span class="lineno"> 3245</span> <span class="keyword">const</span> <span class="keywordtype">double</span> weighted_arc_cost_fp =</div>
|
|
<div class="line"><a id="l03246" name="l03246"></a><span class="lineno"> 3246</span> savings_params_.<a class="code hl_variable" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a222a2814083966736ad9aefde1dde290">arc_coefficient</a> * arc_cost;</div>
|
|
<div class="line"><a id="l03247" name="l03247"></a><span class="lineno"> 3247</span> <span class="keyword">const</span> int64_t weighted_arc_cost =</div>
|
|
<div class="line"><a id="l03248" name="l03248"></a><span class="lineno"> 3248</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">weighted_arc_cost_fp < std::numeric_limits<int64_t>::max</a>()</div>
|
|
<div class="line"><a id="l03249" name="l03249"></a><span class="lineno"> 3249</span> ? <span class="keyword">static_cast<</span>int64_t<span class="keyword">></span>(weighted_arc_cost_fp)</div>
|
|
<div class="line"><a id="l03250" name="l03250"></a><span class="lineno"> 3250</span> : <a class="code hl_namespace" href="namespacestd.html">std</a>::numeric_limits<int64_t>::<a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a>();</div>
|
|
<div class="line"><a id="l03251" name="l03251"></a><span class="lineno"> 3251</span> <span class="keyword">const</span> int64_t saving_value = <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(</div>
|
|
<div class="line"><a id="l03252" name="l03252"></a><span class="lineno"> 3252</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(before_to_end_cost, start_to_after_cost), weighted_arc_cost);</div>
|
|
<div class="line"><a id="l03253" name="l03253"></a><span class="lineno"> 3253</span> </div>
|
|
<div class="line"><a id="l03254" name="l03254"></a><span class="lineno"> 3254</span> <span class="keyword">const</span> <a class="code hl_typedef" href="classoperations__research_1_1_savings_filtered_heuristic.html#a508859e48f977fce11a64cd80d9d1c96">Saving</a> saving =</div>
|
|
<div class="line"><a id="l03255" name="l03255"></a><span class="lineno"> 3255</span> BuildSaving(-saving_value, type, before_node, after_node);</div>
|
|
<div class="line"><a id="l03256" name="l03256"></a><span class="lineno"> 3256</span> </div>
|
|
<div class="line"><a id="l03257" name="l03257"></a><span class="lineno"> 3257</span> <span class="keyword">const</span> int64_t total_cost =</div>
|
|
<div class="line"><a id="l03258" name="l03258"></a><span class="lineno"> 3258</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(start_to_before_cost, arc_cost), after_to_end_cost);</div>
|
|
<div class="line"><a id="l03259" name="l03259"></a><span class="lineno"> 3259</span> </div>
|
|
<div class="line"><a id="l03260" name="l03260"></a><span class="lineno"> 3260</span> <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->AddNewSaving(saving, total_cost, before_node,</div>
|
|
<div class="line"><a id="l03261" name="l03261"></a><span class="lineno"> 3261</span> after_node, type);</div>
|
|
<div class="line"><a id="l03262" name="l03262"></a><span class="lineno"> 3262</span> }</div>
|
|
<div class="line"><a id="l03263" name="l03263"></a><span class="lineno"> 3263</span> }</div>
|
|
<div class="line"><a id="l03264" name="l03264"></a><span class="lineno"> 3264</span> }</div>
|
|
<div class="line"><a id="l03265" name="l03265"></a><span class="lineno"> 3265</span> <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->Sort();</div>
|
|
<div class="line"><a id="l03266" name="l03266"></a><span class="lineno"> 3266</span> <span class="keywordflow">return</span> !<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>();</div>
|
|
<div class="line"><a id="l03267" name="l03267"></a><span class="lineno"> 3267</span>}</div>
|
|
<div class="line"><a id="l03268" name="l03268"></a><span class="lineno"> 3268</span> </div>
|
|
<div class="line"><a id="l03269" name="l03269"></a><span class="lineno"> 3269</span>int64_t SavingsFilteredHeuristic::MaxNumNeighborsPerNode(</div>
|
|
<div class="line"><a id="l03270" name="l03270"></a><span class="lineno"> 3270</span> <span class="keywordtype">int</span> num_vehicle_types)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l03271" name="l03271"></a><span class="lineno"> 3271</span> <span class="keyword">const</span> int64_t size = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">Size</a>();</div>
|
|
<div class="line"><a id="l03272" name="l03272"></a><span class="lineno"> 3272</span> </div>
|
|
<div class="line"><a id="l03273" name="l03273"></a><span class="lineno"> 3273</span> <span class="keyword">const</span> int64_t num_neighbors_with_ratio =</div>
|
|
<div class="line"><a id="l03274" name="l03274"></a><span class="lineno"> 3274</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(1.0, size * savings_params_.<a class="code hl_variable" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a0aa77787d0df1b489476bfc6714ef819">neighbors_ratio</a>);</div>
|
|
<div class="line"><a id="l03275" name="l03275"></a><span class="lineno"> 3275</span> </div>
|
|
<div class="line"><a id="l03276" name="l03276"></a><span class="lineno"> 3276</span> <span class="comment">// A single Saving takes 2*8 bytes of memory.</span></div>
|
|
<div class="line"><a id="l03277" name="l03277"></a><span class="lineno"> 3277</span> <span class="comment">// max_memory_usage_in_savings_unit = num_savings * multiplicative_factor,</span></div>
|
|
<div class="line"><a id="l03278" name="l03278"></a><span class="lineno"> 3278</span> <span class="comment">// Where multiplicative_factor is the memory taken (in Savings unit) for each</span></div>
|
|
<div class="line"><a id="l03279" name="l03279"></a><span class="lineno"> 3279</span> <span class="comment">// computed Saving.</span></div>
|
|
<div class="line"><a id="l03280" name="l03280"></a><span class="lineno"> 3280</span> <span class="keyword">const</span> <span class="keywordtype">double</span> max_memory_usage_in_savings_unit =</div>
|
|
<div class="line"><a id="l03281" name="l03281"></a><span class="lineno"> 3281</span> savings_params_.<a class="code hl_variable" href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a33bd2c84a2be54d10959e5c0d81f86b5">max_memory_usage_bytes</a> / 16;</div>
|
|
<div class="line"><a id="l03282" name="l03282"></a><span class="lineno"> 3282</span> </div>
|
|
<div class="line"><a id="l03283" name="l03283"></a><span class="lineno"> 3283</span> <span class="comment">// In the SavingsContainer, for each Saving, the Savings are stored:</span></div>
|
|
<div class="line"><a id="l03284" name="l03284"></a><span class="lineno"> 3284</span> <span class="comment">// - Once in "sorted_savings_per_vehicle_type", and (at most) once in</span></div>
|
|
<div class="line"><a id="l03285" name="l03285"></a><span class="lineno"> 3285</span> <span class="comment">// "sorted_savings_" --> factor 2</span></div>
|
|
<div class="line"><a id="l03286" name="l03286"></a><span class="lineno"> 3286</span> <span class="comment">// - If num_vehicle_types > 1, they're also stored by arc_index in</span></div>
|
|
<div class="line"><a id="l03287" name="l03287"></a><span class="lineno"> 3287</span> <span class="comment">// "costs_and_savings_per_arc", along with their int64_t cost --> factor 1.5</span></div>
|
|
<div class="line"><a id="l03288" name="l03288"></a><span class="lineno"> 3288</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l03289" name="l03289"></a><span class="lineno"> 3289</span> <span class="comment">// On top of that,</span></div>
|
|
<div class="line"><a id="l03290" name="l03290"></a><span class="lineno"> 3290</span> <span class="comment">// - In the sequential version, the Saving* are also stored by in-coming and</span></div>
|
|
<div class="line"><a id="l03291" name="l03291"></a><span class="lineno"> 3291</span> <span class="comment">// outgoing node (in in/out_savings_ptr), adding another 2*8 bytes per</span></div>
|
|
<div class="line"><a id="l03292" name="l03292"></a><span class="lineno"> 3292</span> <span class="comment">// Saving --> factor 1.</span></div>
|
|
<div class="line"><a id="l03293" name="l03293"></a><span class="lineno"> 3293</span> <span class="comment">// - In the parallel version, skipped Savings are also stored in</span></div>
|
|
<div class="line"><a id="l03294" name="l03294"></a><span class="lineno"> 3294</span> <span class="comment">// skipped_savings_starting/ending_at_, resulting in a maximum added factor</span></div>
|
|
<div class="line"><a id="l03295" name="l03295"></a><span class="lineno"> 3295</span> <span class="comment">// of 2 for each Saving.</span></div>
|
|
<div class="line"><a id="l03296" name="l03296"></a><span class="lineno"> 3296</span> <span class="comment">// These extra factors are given by ExtraSavingsMemoryMultiplicativeFactor().</span></div>
|
|
<div class="line"><a id="l03297" name="l03297"></a><span class="lineno"> 3297</span> <span class="keywordtype">double</span> multiplicative_factor = 2.0 + <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#a84b19d1c2e9a93a7e02dc12972c9c969">ExtraSavingsMemoryMultiplicativeFactor</a>();</div>
|
|
<div class="line"><a id="l03298" name="l03298"></a><span class="lineno"> 3298</span> <span class="keywordflow">if</span> (num_vehicle_types > 1) {</div>
|
|
<div class="line"><a id="l03299" name="l03299"></a><span class="lineno"> 3299</span> multiplicative_factor += 1.5;</div>
|
|
<div class="line"><a id="l03300" name="l03300"></a><span class="lineno"> 3300</span> }</div>
|
|
<div class="line"><a id="l03301" name="l03301"></a><span class="lineno"> 3301</span> <span class="keyword">const</span> <span class="keywordtype">double</span> num_savings =</div>
|
|
<div class="line"><a id="l03302" name="l03302"></a><span class="lineno"> 3302</span> max_memory_usage_in_savings_unit / multiplicative_factor;</div>
|
|
<div class="line"><a id="l03303" name="l03303"></a><span class="lineno"> 3303</span> <span class="keyword">const</span> int64_t num_neighbors_with_memory_restriction =</div>
|
|
<div class="line"><a id="l03304" name="l03304"></a><span class="lineno"> 3304</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(1.0, num_savings / (num_vehicle_types * size));</div>
|
|
<div class="line"><a id="l03305" name="l03305"></a><span class="lineno"> 3305</span> </div>
|
|
<div class="line"><a id="l03306" name="l03306"></a><span class="lineno"> 3306</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(num_neighbors_with_ratio,</div>
|
|
<div class="line"><a id="l03307" name="l03307"></a><span class="lineno"> 3307</span> num_neighbors_with_memory_restriction);</div>
|
|
<div class="line"><a id="l03308" name="l03308"></a><span class="lineno"> 3308</span>}</div>
|
|
<div class="line"><a id="l03309" name="l03309"></a><span class="lineno"> 3309</span> </div>
|
|
<div class="line"><a id="l03310" name="l03310"></a><span class="lineno"> 3310</span><span class="comment">// SequentialSavingsFilteredHeuristic</span></div>
|
|
<div class="line"><a id="l03311" name="l03311"></a><span class="lineno"> 3311</span> </div>
|
|
<div class="line"><a id="l03312" name="l03312"></a><span class="lineno"> 3312</span><span class="keywordtype">void</span> SequentialSavingsFilteredHeuristic::BuildRoutesFromSavings() {</div>
|
|
<div class="line"><a id="l03313" name="l03313"></a><span class="lineno"> 3313</span> <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle_types = <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a>->NumTypes();</div>
|
|
<div class="line"><a id="l03314" name="l03314"></a><span class="lineno"> 3314</span> <a class="code hl_define" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(vehicle_types, 0);</div>
|
|
<div class="line"><a id="l03315" name="l03315"></a><span class="lineno"> 3315</span> <span class="keyword">const</span> <span class="keywordtype">int</span> size = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">Size</a>();</div>
|
|
<div class="line"><a id="l03316" name="l03316"></a><span class="lineno"> 3316</span> <span class="comment">// Store savings for each incoming and outgoing node and by vehicle type. This</span></div>
|
|
<div class="line"><a id="l03317" name="l03317"></a><span class="lineno"> 3317</span> <span class="comment">// is necessary to quickly extend partial chains without scanning all savings.</span></div>
|
|
<div class="line"><a id="l03318" name="l03318"></a><span class="lineno"> 3318</span> std::vector<std::vector<const Saving*>> in_savings_ptr(size * vehicle_types);</div>
|
|
<div class="line"><a id="l03319" name="l03319"></a><span class="lineno"> 3319</span> std::vector<std::vector<const Saving*>> out_savings_ptr(size * vehicle_types);</div>
|
|
<div class="line"><a id="l03320" name="l03320"></a><span class="lineno"> 3320</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> type = 0; type < vehicle_types; type++) {</div>
|
|
<div class="line"><a id="l03321" name="l03321"></a><span class="lineno"> 3321</span> <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle_type_offset = type * size;</div>
|
|
<div class="line"><a id="l03322" name="l03322"></a><span class="lineno"> 3322</span> <span class="keyword">const</span> std::vector<Saving>& sorted_savings_for_type =</div>
|
|
<div class="line"><a id="l03323" name="l03323"></a><span class="lineno"> 3323</span> <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->GetSortedSavingsForVehicleType(type);</div>
|
|
<div class="line"><a id="l03324" name="l03324"></a><span class="lineno"> 3324</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_typedef" href="classoperations__research_1_1_savings_filtered_heuristic.html#a508859e48f977fce11a64cd80d9d1c96">Saving</a>& saving : sorted_savings_for_type) {</div>
|
|
<div class="line"><a id="l03325" name="l03325"></a><span class="lineno"> 3325</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_savings_filtered_heuristic.html#a059d074075b06daa69a371f96d5ad60c">GetVehicleTypeFromSaving</a>(saving), type);</div>
|
|
<div class="line"><a id="l03326" name="l03326"></a><span class="lineno"> 3326</span> <span class="keyword">const</span> <span class="keywordtype">int</span> before_node = <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#ac059c9526b1114c16b250a4cc809a97b">GetBeforeNodeFromSaving</a>(saving);</div>
|
|
<div class="line"><a id="l03327" name="l03327"></a><span class="lineno"> 3327</span> in_savings_ptr[vehicle_type_offset + before_node].push_back(&saving);</div>
|
|
<div class="line"><a id="l03328" name="l03328"></a><span class="lineno"> 3328</span> <span class="keyword">const</span> <span class="keywordtype">int</span> after_node = <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#a3f462bd92b7848baac82e1c526d0ed5a">GetAfterNodeFromSaving</a>(saving);</div>
|
|
<div class="line"><a id="l03329" name="l03329"></a><span class="lineno"> 3329</span> out_savings_ptr[vehicle_type_offset + after_node].push_back(&saving);</div>
|
|
<div class="line"><a id="l03330" name="l03330"></a><span class="lineno"> 3330</span> }</div>
|
|
<div class="line"><a id="l03331" name="l03331"></a><span class="lineno"> 3331</span> }</div>
|
|
<div class="line"><a id="l03332" name="l03332"></a><span class="lineno"> 3332</span> </div>
|
|
<div class="line"><a id="l03333" name="l03333"></a><span class="lineno"> 3333</span> <span class="comment">// Build routes from savings.</span></div>
|
|
<div class="line"><a id="l03334" name="l03334"></a><span class="lineno"> 3334</span> <span class="keywordflow">while</span> (<a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->HasSaving()) {</div>
|
|
<div class="line"><a id="l03335" name="l03335"></a><span class="lineno"> 3335</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l03336" name="l03336"></a><span class="lineno"> 3336</span> <span class="comment">// First find the best saving to start a new route.</span></div>
|
|
<div class="line"><a id="l03337" name="l03337"></a><span class="lineno"> 3337</span> <span class="keyword">const</span> <a class="code hl_typedef" href="classoperations__research_1_1_savings_filtered_heuristic.html#a508859e48f977fce11a64cd80d9d1c96">Saving</a> saving = <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->GetSaving();</div>
|
|
<div class="line"><a id="l03338" name="l03338"></a><span class="lineno"> 3338</span> <span class="keywordtype">int</span> before_node = <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#ac059c9526b1114c16b250a4cc809a97b">GetBeforeNodeFromSaving</a>(saving);</div>
|
|
<div class="line"><a id="l03339" name="l03339"></a><span class="lineno"> 3339</span> <span class="keywordtype">int</span> after_node = <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#a3f462bd92b7848baac82e1c526d0ed5a">GetAfterNodeFromSaving</a>(saving);</div>
|
|
<div class="line"><a id="l03340" name="l03340"></a><span class="lineno"> 3340</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> nodes_not_contained =</div>
|
|
<div class="line"><a id="l03341" name="l03341"></a><span class="lineno"> 3341</span> !<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(before_node) && !<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(after_node);</div>
|
|
<div class="line"><a id="l03342" name="l03342"></a><span class="lineno"> 3342</span> </div>
|
|
<div class="line"><a id="l03343" name="l03343"></a><span class="lineno"> 3343</span> <span class="keywordtype">bool</span> committed = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l03344" name="l03344"></a><span class="lineno"> 3344</span> </div>
|
|
<div class="line"><a id="l03345" name="l03345"></a><span class="lineno"> 3345</span> <span class="keywordflow">if</span> (nodes_not_contained) {</div>
|
|
<div class="line"><a id="l03346" name="l03346"></a><span class="lineno"> 3346</span> <span class="comment">// Find the right vehicle to start the route with this Saving.</span></div>
|
|
<div class="line"><a id="l03347" name="l03347"></a><span class="lineno"> 3347</span> <span class="keyword">const</span> <span class="keywordtype">int</span> type = <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#a059d074075b06daa69a371f96d5ad60c">GetVehicleTypeFromSaving</a>(saving);</div>
|
|
<div class="line"><a id="l03348" name="l03348"></a><span class="lineno"> 3348</span> <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle =</div>
|
|
<div class="line"><a id="l03349" name="l03349"></a><span class="lineno"> 3349</span> <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#ad1f89eda8b1c2ad8fe6f5743e475fd5d">StartNewRouteWithBestVehicleOfType</a>(type, before_node, after_node);</div>
|
|
<div class="line"><a id="l03350" name="l03350"></a><span class="lineno"> 3350</span> </div>
|
|
<div class="line"><a id="l03351" name="l03351"></a><span class="lineno"> 3351</span> <span class="keywordflow">if</span> (vehicle >= 0) {</div>
|
|
<div class="line"><a id="l03352" name="l03352"></a><span class="lineno"> 3352</span> committed = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l03353" name="l03353"></a><span class="lineno"> 3353</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a> = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(vehicle);</div>
|
|
<div class="line"><a id="l03354" name="l03354"></a><span class="lineno"> 3354</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a> = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#afb80fd36c1fb57d2db049403483e2074">End</a>(vehicle);</div>
|
|
<div class="line"><a id="l03355" name="l03355"></a><span class="lineno"> 3355</span> <span class="comment">// Then extend the route from both ends of the partial route.</span></div>
|
|
<div class="line"><a id="l03356" name="l03356"></a><span class="lineno"> 3356</span> <span class="keywordtype">int</span> in_index = 0;</div>
|
|
<div class="line"><a id="l03357" name="l03357"></a><span class="lineno"> 3357</span> <span class="keywordtype">int</span> out_index = 0;</div>
|
|
<div class="line"><a id="l03358" name="l03358"></a><span class="lineno"> 3358</span> <span class="keyword">const</span> <span class="keywordtype">int</span> saving_offset = type * size;</div>
|
|
<div class="line"><a id="l03359" name="l03359"></a><span class="lineno"> 3359</span> </div>
|
|
<div class="line"><a id="l03360" name="l03360"></a><span class="lineno"> 3360</span> <span class="keywordflow">while</span> (in_index < in_savings_ptr[saving_offset + after_node].size() ||</div>
|
|
<div class="line"><a id="l03361" name="l03361"></a><span class="lineno"> 3361</span> out_index <</div>
|
|
<div class="line"><a id="l03362" name="l03362"></a><span class="lineno"> 3362</span> out_savings_ptr[saving_offset + before_node].size()) {</div>
|
|
<div class="line"><a id="l03363" name="l03363"></a><span class="lineno"> 3363</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l03364" name="l03364"></a><span class="lineno"> 3364</span> <span class="comment">// First determine how to extend the route.</span></div>
|
|
<div class="line"><a id="l03365" name="l03365"></a><span class="lineno"> 3365</span> <span class="keywordtype">int</span> before_before_node = -1;</div>
|
|
<div class="line"><a id="l03366" name="l03366"></a><span class="lineno"> 3366</span> <span class="keywordtype">int</span> after_after_node = -1;</div>
|
|
<div class="line"><a id="l03367" name="l03367"></a><span class="lineno"> 3367</span> <span class="keywordflow">if</span> (in_index < in_savings_ptr[saving_offset + after_node].size()) {</div>
|
|
<div class="line"><a id="l03368" name="l03368"></a><span class="lineno"> 3368</span> <span class="keyword">const</span> <a class="code hl_typedef" href="classoperations__research_1_1_savings_filtered_heuristic.html#a508859e48f977fce11a64cd80d9d1c96">Saving</a>& in_saving =</div>
|
|
<div class="line"><a id="l03369" name="l03369"></a><span class="lineno"> 3369</span> *(in_savings_ptr[saving_offset + after_node][in_index]);</div>
|
|
<div class="line"><a id="l03370" name="l03370"></a><span class="lineno"> 3370</span> <span class="keywordflow">if</span> (out_index <</div>
|
|
<div class="line"><a id="l03371" name="l03371"></a><span class="lineno"> 3371</span> out_savings_ptr[saving_offset + before_node].size()) {</div>
|
|
<div class="line"><a id="l03372" name="l03372"></a><span class="lineno"> 3372</span> <span class="keyword">const</span> <a class="code hl_typedef" href="classoperations__research_1_1_savings_filtered_heuristic.html#a508859e48f977fce11a64cd80d9d1c96">Saving</a>& out_saving =</div>
|
|
<div class="line"><a id="l03373" name="l03373"></a><span class="lineno"> 3373</span> *(out_savings_ptr[saving_offset + before_node][out_index]);</div>
|
|
<div class="line"><a id="l03374" name="l03374"></a><span class="lineno"> 3374</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#a507360c2a0a17cf293d6342c073750ae">GetSavingValue</a>(in_saving) < <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#a507360c2a0a17cf293d6342c073750ae">GetSavingValue</a>(out_saving)) {</div>
|
|
<div class="line"><a id="l03375" name="l03375"></a><span class="lineno"> 3375</span> <span class="comment">// Should extend after after_node</span></div>
|
|
<div class="line"><a id="l03376" name="l03376"></a><span class="lineno"> 3376</span> after_after_node = <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#a3f462bd92b7848baac82e1c526d0ed5a">GetAfterNodeFromSaving</a>(in_saving);</div>
|
|
<div class="line"><a id="l03377" name="l03377"></a><span class="lineno"> 3377</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l03378" name="l03378"></a><span class="lineno"> 3378</span> <span class="comment">// Should extend before before_node</span></div>
|
|
<div class="line"><a id="l03379" name="l03379"></a><span class="lineno"> 3379</span> before_before_node = <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#ac059c9526b1114c16b250a4cc809a97b">GetBeforeNodeFromSaving</a>(out_saving);</div>
|
|
<div class="line"><a id="l03380" name="l03380"></a><span class="lineno"> 3380</span> }</div>
|
|
<div class="line"><a id="l03381" name="l03381"></a><span class="lineno"> 3381</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l03382" name="l03382"></a><span class="lineno"> 3382</span> <span class="comment">// Should extend after after_node</span></div>
|
|
<div class="line"><a id="l03383" name="l03383"></a><span class="lineno"> 3383</span> after_after_node = <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#a3f462bd92b7848baac82e1c526d0ed5a">GetAfterNodeFromSaving</a>(in_saving);</div>
|
|
<div class="line"><a id="l03384" name="l03384"></a><span class="lineno"> 3384</span> }</div>
|
|
<div class="line"><a id="l03385" name="l03385"></a><span class="lineno"> 3385</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l03386" name="l03386"></a><span class="lineno"> 3386</span> <span class="comment">// Should extend before before_node</span></div>
|
|
<div class="line"><a id="l03387" name="l03387"></a><span class="lineno"> 3387</span> before_before_node = <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#ac059c9526b1114c16b250a4cc809a97b">GetBeforeNodeFromSaving</a>(</div>
|
|
<div class="line"><a id="l03388" name="l03388"></a><span class="lineno"> 3388</span> *(out_savings_ptr[saving_offset + before_node][out_index]));</div>
|
|
<div class="line"><a id="l03389" name="l03389"></a><span class="lineno"> 3389</span> }</div>
|
|
<div class="line"><a id="l03390" name="l03390"></a><span class="lineno"> 3390</span> <span class="comment">// Extend the route</span></div>
|
|
<div class="line"><a id="l03391" name="l03391"></a><span class="lineno"> 3391</span> <span class="keywordflow">if</span> (after_after_node != -1) {</div>
|
|
<div class="line"><a id="l03392" name="l03392"></a><span class="lineno"> 3392</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(before_before_node, -1);</div>
|
|
<div class="line"><a id="l03393" name="l03393"></a><span class="lineno"> 3393</span> <span class="comment">// Extending after after_node</span></div>
|
|
<div class="line"><a id="l03394" name="l03394"></a><span class="lineno"> 3394</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(after_after_node)) {</div>
|
|
<div class="line"><a id="l03395" name="l03395"></a><span class="lineno"> 3395</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(after_node, after_after_node);</div>
|
|
<div class="line"><a id="l03396" name="l03396"></a><span class="lineno"> 3396</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(after_after_node, <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>);</div>
|
|
<div class="line"><a id="l03397" name="l03397"></a><span class="lineno"> 3397</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value()) {</div>
|
|
<div class="line"><a id="l03398" name="l03398"></a><span class="lineno"> 3398</span> in_index = 0;</div>
|
|
<div class="line"><a id="l03399" name="l03399"></a><span class="lineno"> 3399</span> after_node = after_after_node;</div>
|
|
<div class="line"><a id="l03400" name="l03400"></a><span class="lineno"> 3400</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l03401" name="l03401"></a><span class="lineno"> 3401</span> ++in_index;</div>
|
|
<div class="line"><a id="l03402" name="l03402"></a><span class="lineno"> 3402</span> }</div>
|
|
<div class="line"><a id="l03403" name="l03403"></a><span class="lineno"> 3403</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l03404" name="l03404"></a><span class="lineno"> 3404</span> ++in_index;</div>
|
|
<div class="line"><a id="l03405" name="l03405"></a><span class="lineno"> 3405</span> }</div>
|
|
<div class="line"><a id="l03406" name="l03406"></a><span class="lineno"> 3406</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l03407" name="l03407"></a><span class="lineno"> 3407</span> <span class="comment">// Extending before before_node</span></div>
|
|
<div class="line"><a id="l03408" name="l03408"></a><span class="lineno"> 3408</span> <a class="code hl_define" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(before_before_node, 0);</div>
|
|
<div class="line"><a id="l03409" name="l03409"></a><span class="lineno"> 3409</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(before_before_node)) {</div>
|
|
<div class="line"><a id="l03410" name="l03410"></a><span class="lineno"> 3410</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(<a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>, before_before_node);</div>
|
|
<div class="line"><a id="l03411" name="l03411"></a><span class="lineno"> 3411</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(before_before_node, before_node);</div>
|
|
<div class="line"><a id="l03412" name="l03412"></a><span class="lineno"> 3412</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value()) {</div>
|
|
<div class="line"><a id="l03413" name="l03413"></a><span class="lineno"> 3413</span> out_index = 0;</div>
|
|
<div class="line"><a id="l03414" name="l03414"></a><span class="lineno"> 3414</span> before_node = before_before_node;</div>
|
|
<div class="line"><a id="l03415" name="l03415"></a><span class="lineno"> 3415</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l03416" name="l03416"></a><span class="lineno"> 3416</span> ++out_index;</div>
|
|
<div class="line"><a id="l03417" name="l03417"></a><span class="lineno"> 3417</span> }</div>
|
|
<div class="line"><a id="l03418" name="l03418"></a><span class="lineno"> 3418</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l03419" name="l03419"></a><span class="lineno"> 3419</span> ++out_index;</div>
|
|
<div class="line"><a id="l03420" name="l03420"></a><span class="lineno"> 3420</span> }</div>
|
|
<div class="line"><a id="l03421" name="l03421"></a><span class="lineno"> 3421</span> }</div>
|
|
<div class="line"><a id="l03422" name="l03422"></a><span class="lineno"> 3422</span> }</div>
|
|
<div class="line"><a id="l03423" name="l03423"></a><span class="lineno"> 3423</span> }</div>
|
|
<div class="line"><a id="l03424" name="l03424"></a><span class="lineno"> 3424</span> }</div>
|
|
<div class="line"><a id="l03425" name="l03425"></a><span class="lineno"> 3425</span> <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->Update(nodes_not_contained && !committed);</div>
|
|
<div class="line"><a id="l03426" name="l03426"></a><span class="lineno"> 3426</span> }</div>
|
|
<div class="line"><a id="l03427" name="l03427"></a><span class="lineno"> 3427</span>}</div>
|
|
<div class="line"><a id="l03428" name="l03428"></a><span class="lineno"> 3428</span> </div>
|
|
<div class="line"><a id="l03429" name="l03429"></a><span class="lineno"> 3429</span><span class="comment">// ParallelSavingsFilteredHeuristic</span></div>
|
|
<div class="line"><a id="l03430" name="l03430"></a><span class="lineno"> 3430</span> </div>
|
|
<div class="line"><a id="l03431" name="l03431"></a><span class="lineno"> 3431</span><span class="keywordtype">void</span> ParallelSavingsFilteredHeuristic::BuildRoutesFromSavings() {</div>
|
|
<div class="line"><a id="l03432" name="l03432"></a><span class="lineno"> 3432</span> <span class="comment">// Initialize the vehicles of the first/last non start/end nodes served by</span></div>
|
|
<div class="line"><a id="l03433" name="l03433"></a><span class="lineno"> 3433</span> <span class="comment">// each route.</span></div>
|
|
<div class="line"><a id="l03434" name="l03434"></a><span class="lineno"> 3434</span> <span class="keyword">const</span> int64_t size = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">Size</a>();</div>
|
|
<div class="line"><a id="l03435" name="l03435"></a><span class="lineno"> 3435</span> <span class="keyword">const</span> <span class="keywordtype">int</span> vehicles = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>();</div>
|
|
<div class="line"><a id="l03436" name="l03436"></a><span class="lineno"> 3436</span> </div>
|
|
<div class="line"><a id="l03437" name="l03437"></a><span class="lineno"> 3437</span> first_node_on_route_.resize(vehicles, -1);</div>
|
|
<div class="line"><a id="l03438" name="l03438"></a><span class="lineno"> 3438</span> last_node_on_route_.resize(vehicles, -1);</div>
|
|
<div class="line"><a id="l03439" name="l03439"></a><span class="lineno"> 3439</span> vehicle_of_first_or_last_node_.resize(size, -1);</div>
|
|
<div class="line"><a id="l03440" name="l03440"></a><span class="lineno"> 3440</span> </div>
|
|
<div class="line"><a id="l03441" name="l03441"></a><span class="lineno"> 3441</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < vehicles; vehicle++) {</div>
|
|
<div class="line"><a id="l03442" name="l03442"></a><span class="lineno"> 3442</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a> = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(vehicle);</div>
|
|
<div class="line"><a id="l03443" name="l03443"></a><span class="lineno"> 3443</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a> = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#afb80fd36c1fb57d2db049403483e2074">End</a>(vehicle);</div>
|
|
<div class="line"><a id="l03444" name="l03444"></a><span class="lineno"> 3444</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(<a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>)) {</div>
|
|
<div class="line"><a id="l03445" name="l03445"></a><span class="lineno"> 3445</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l03446" name="l03446"></a><span class="lineno"> 3446</span> }</div>
|
|
<div class="line"><a id="l03447" name="l03447"></a><span class="lineno"> 3447</span> int64_t node = <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(<a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>);</div>
|
|
<div class="line"><a id="l03448" name="l03448"></a><span class="lineno"> 3448</span> <span class="keywordflow">if</span> (node != <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>) {</div>
|
|
<div class="line"><a id="l03449" name="l03449"></a><span class="lineno"> 3449</span> vehicle_of_first_or_last_node_[node] = vehicle;</div>
|
|
<div class="line"><a id="l03450" name="l03450"></a><span class="lineno"> 3450</span> first_node_on_route_[vehicle] = node;</div>
|
|
<div class="line"><a id="l03451" name="l03451"></a><span class="lineno"> 3451</span> </div>
|
|
<div class="line"><a id="l03452" name="l03452"></a><span class="lineno"> 3452</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_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(node);</div>
|
|
<div class="line"><a id="l03453" name="l03453"></a><span class="lineno"> 3453</span> <span class="keywordflow">while</span> (<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> != <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>) {</div>
|
|
<div class="line"><a id="l03454" name="l03454"></a><span class="lineno"> 3454</span> node = <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a id="l03455" name="l03455"></a><span class="lineno"> 3455</span> <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(node);</div>
|
|
<div class="line"><a id="l03456" name="l03456"></a><span class="lineno"> 3456</span> }</div>
|
|
<div class="line"><a id="l03457" name="l03457"></a><span class="lineno"> 3457</span> vehicle_of_first_or_last_node_[node] = vehicle;</div>
|
|
<div class="line"><a id="l03458" name="l03458"></a><span class="lineno"> 3458</span> last_node_on_route_[vehicle] = node;</div>
|
|
<div class="line"><a id="l03459" name="l03459"></a><span class="lineno"> 3459</span> }</div>
|
|
<div class="line"><a id="l03460" name="l03460"></a><span class="lineno"> 3460</span> }</div>
|
|
<div class="line"><a id="l03461" name="l03461"></a><span class="lineno"> 3461</span> </div>
|
|
<div class="line"><a id="l03462" name="l03462"></a><span class="lineno"> 3462</span> <span class="keywordflow">while</span> (<a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->HasSaving()) {</div>
|
|
<div class="line"><a id="l03463" name="l03463"></a><span class="lineno"> 3463</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l03464" name="l03464"></a><span class="lineno"> 3464</span> <span class="keyword">const</span> <a class="code hl_typedef" href="classoperations__research_1_1_savings_filtered_heuristic.html#a508859e48f977fce11a64cd80d9d1c96">Saving</a> saving = <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->GetSaving();</div>
|
|
<div class="line"><a id="l03465" name="l03465"></a><span class="lineno"> 3465</span> <span class="keyword">const</span> int64_t before_node = <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#ac059c9526b1114c16b250a4cc809a97b">GetBeforeNodeFromSaving</a>(saving);</div>
|
|
<div class="line"><a id="l03466" name="l03466"></a><span class="lineno"> 3466</span> <span class="keyword">const</span> int64_t after_node = <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#a3f462bd92b7848baac82e1c526d0ed5a">GetAfterNodeFromSaving</a>(saving);</div>
|
|
<div class="line"><a id="l03467" name="l03467"></a><span class="lineno"> 3467</span> <span class="keyword">const</span> <span class="keywordtype">int</span> type = <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#a059d074075b06daa69a371f96d5ad60c">GetVehicleTypeFromSaving</a>(saving);</div>
|
|
<div class="line"><a id="l03468" name="l03468"></a><span class="lineno"> 3468</span> </div>
|
|
<div class="line"><a id="l03469" name="l03469"></a><span class="lineno"> 3469</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(before_node) && !<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(after_node)) {</div>
|
|
<div class="line"><a id="l03470" name="l03470"></a><span class="lineno"> 3470</span> <span class="comment">// Neither nodes are contained, start a new route.</span></div>
|
|
<div class="line"><a id="l03471" name="l03471"></a><span class="lineno"> 3471</span> <span class="keywordtype">bool</span> committed = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l03472" name="l03472"></a><span class="lineno"> 3472</span> </div>
|
|
<div class="line"><a id="l03473" name="l03473"></a><span class="lineno"> 3473</span> <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle =</div>
|
|
<div class="line"><a id="l03474" name="l03474"></a><span class="lineno"> 3474</span> <a class="code hl_function" href="classoperations__research_1_1_savings_filtered_heuristic.html#ad1f89eda8b1c2ad8fe6f5743e475fd5d">StartNewRouteWithBestVehicleOfType</a>(type, before_node, after_node);</div>
|
|
<div class="line"><a id="l03475" name="l03475"></a><span class="lineno"> 3475</span> </div>
|
|
<div class="line"><a id="l03476" name="l03476"></a><span class="lineno"> 3476</span> <span class="keywordflow">if</span> (vehicle >= 0) {</div>
|
|
<div class="line"><a id="l03477" name="l03477"></a><span class="lineno"> 3477</span> committed = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l03478" name="l03478"></a><span class="lineno"> 3478</span> <span class="comment">// Store before_node and after_node as first and last nodes of the route</span></div>
|
|
<div class="line"><a id="l03479" name="l03479"></a><span class="lineno"> 3479</span> vehicle_of_first_or_last_node_[before_node] = vehicle;</div>
|
|
<div class="line"><a id="l03480" name="l03480"></a><span class="lineno"> 3480</span> vehicle_of_first_or_last_node_[after_node] = vehicle;</div>
|
|
<div class="line"><a id="l03481" name="l03481"></a><span class="lineno"> 3481</span> first_node_on_route_[vehicle] = before_node;</div>
|
|
<div class="line"><a id="l03482" name="l03482"></a><span class="lineno"> 3482</span> last_node_on_route_[vehicle] = after_node;</div>
|
|
<div class="line"><a id="l03483" name="l03483"></a><span class="lineno"> 3483</span> <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->ReinjectSkippedSavingsStartingAt(after_node);</div>
|
|
<div class="line"><a id="l03484" name="l03484"></a><span class="lineno"> 3484</span> <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->ReinjectSkippedSavingsEndingAt(before_node);</div>
|
|
<div class="line"><a id="l03485" name="l03485"></a><span class="lineno"> 3485</span> }</div>
|
|
<div class="line"><a id="l03486" name="l03486"></a><span class="lineno"> 3486</span> <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->Update(!committed);</div>
|
|
<div class="line"><a id="l03487" name="l03487"></a><span class="lineno"> 3487</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l03488" name="l03488"></a><span class="lineno"> 3488</span> }</div>
|
|
<div class="line"><a id="l03489" name="l03489"></a><span class="lineno"> 3489</span> </div>
|
|
<div class="line"><a id="l03490" name="l03490"></a><span class="lineno"> 3490</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(before_node) && <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(after_node)) {</div>
|
|
<div class="line"><a id="l03491" name="l03491"></a><span class="lineno"> 3491</span> <span class="comment">// Merge the two routes if before_node is last and after_node first of its</span></div>
|
|
<div class="line"><a id="l03492" name="l03492"></a><span class="lineno"> 3492</span> <span class="comment">// route, the two nodes aren't already on the same route, and the vehicle</span></div>
|
|
<div class="line"><a id="l03493" name="l03493"></a><span class="lineno"> 3493</span> <span class="comment">// types are compatible.</span></div>
|
|
<div class="line"><a id="l03494" name="l03494"></a><span class="lineno"> 3494</span> <span class="keyword">const</span> <span class="keywordtype">int</span> v1 = vehicle_of_first_or_last_node_[before_node];</div>
|
|
<div class="line"><a id="l03495" name="l03495"></a><span class="lineno"> 3495</span> <span class="keyword">const</span> int64_t last_node = v1 == -1 ? -1 : last_node_on_route_[v1];</div>
|
|
<div class="line"><a id="l03496" name="l03496"></a><span class="lineno"> 3496</span> </div>
|
|
<div class="line"><a id="l03497" name="l03497"></a><span class="lineno"> 3497</span> <span class="keyword">const</span> <span class="keywordtype">int</span> v2 = vehicle_of_first_or_last_node_[after_node];</div>
|
|
<div class="line"><a id="l03498" name="l03498"></a><span class="lineno"> 3498</span> <span class="keyword">const</span> int64_t first_node = v2 == -1 ? -1 : first_node_on_route_[v2];</div>
|
|
<div class="line"><a id="l03499" name="l03499"></a><span class="lineno"> 3499</span> </div>
|
|
<div class="line"><a id="l03500" name="l03500"></a><span class="lineno"> 3500</span> <span class="keywordflow">if</span> (before_node == last_node && after_node == first_node && v1 != v2 &&</div>
|
|
<div class="line"><a id="l03501" name="l03501"></a><span class="lineno"> 3501</span> <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a>->Type(v1) == <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a>->Type(v2)) {</div>
|
|
<div class="line"><a id="l03502" name="l03502"></a><span class="lineno"> 3502</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(before_node), <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->End(v1));</div>
|
|
<div class="line"><a id="l03503" name="l03503"></a><span class="lineno"> 3503</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->Start(v2)), after_node);</div>
|
|
<div class="line"><a id="l03504" name="l03504"></a><span class="lineno"> 3504</span> </div>
|
|
<div class="line"><a id="l03505" name="l03505"></a><span class="lineno"> 3505</span> <span class="comment">// We try merging the two routes.</span></div>
|
|
<div class="line"><a id="l03506" name="l03506"></a><span class="lineno"> 3506</span> <span class="comment">// TODO(user): Try to use skipped savings to start new routes when</span></div>
|
|
<div class="line"><a id="l03507" name="l03507"></a><span class="lineno"> 3507</span> <span class="comment">// a vehicle becomes available after a merge (not trivial because it can</span></div>
|
|
<div class="line"><a id="l03508" name="l03508"></a><span class="lineno"> 3508</span> <span class="comment">// result in an infinite loop).</span></div>
|
|
<div class="line"><a id="l03509" name="l03509"></a><span class="lineno"> 3509</span> MergeRoutes(v1, v2, before_node, after_node);</div>
|
|
<div class="line"><a id="l03510" name="l03510"></a><span class="lineno"> 3510</span> }</div>
|
|
<div class="line"><a id="l03511" name="l03511"></a><span class="lineno"> 3511</span> }</div>
|
|
<div class="line"><a id="l03512" name="l03512"></a><span class="lineno"> 3512</span> </div>
|
|
<div class="line"><a id="l03513" name="l03513"></a><span class="lineno"> 3513</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(before_node) && !<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(after_node)) {</div>
|
|
<div class="line"><a id="l03514" name="l03514"></a><span class="lineno"> 3514</span> <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = vehicle_of_first_or_last_node_[before_node];</div>
|
|
<div class="line"><a id="l03515" name="l03515"></a><span class="lineno"> 3515</span> <span class="keyword">const</span> int64_t last_node =</div>
|
|
<div class="line"><a id="l03516" name="l03516"></a><span class="lineno"> 3516</span> vehicle == -1 ? -1 : last_node_on_route_[vehicle];</div>
|
|
<div class="line"><a id="l03517" name="l03517"></a><span class="lineno"> 3517</span> </div>
|
|
<div class="line"><a id="l03518" name="l03518"></a><span class="lineno"> 3518</span> <span class="keywordflow">if</span> (before_node == last_node) {</div>
|
|
<div class="line"><a id="l03519" name="l03519"></a><span class="lineno"> 3519</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a> = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#afb80fd36c1fb57d2db049403483e2074">End</a>(vehicle);</div>
|
|
<div class="line"><a id="l03520" name="l03520"></a><span class="lineno"> 3520</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(before_node), <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>);</div>
|
|
<div class="line"><a id="l03521" name="l03521"></a><span class="lineno"> 3521</span> </div>
|
|
<div class="line"><a id="l03522" name="l03522"></a><span class="lineno"> 3522</span> <span class="keyword">const</span> <span class="keywordtype">int</span> route_type = <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a>->Type(vehicle);</div>
|
|
<div class="line"><a id="l03523" name="l03523"></a><span class="lineno"> 3523</span> <span class="keywordflow">if</span> (type != route_type) {</div>
|
|
<div class="line"><a id="l03524" name="l03524"></a><span class="lineno"> 3524</span> <span class="comment">// The saving doesn't correspond to the type of the vehicle serving</span></div>
|
|
<div class="line"><a id="l03525" name="l03525"></a><span class="lineno"> 3525</span> <span class="comment">// before_node. We update the container with the correct type.</span></div>
|
|
<div class="line"><a id="l03526" name="l03526"></a><span class="lineno"> 3526</span> <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->UpdateWithType(route_type);</div>
|
|
<div class="line"><a id="l03527" name="l03527"></a><span class="lineno"> 3527</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l03528" name="l03528"></a><span class="lineno"> 3528</span> }</div>
|
|
<div class="line"><a id="l03529" name="l03529"></a><span class="lineno"> 3529</span> </div>
|
|
<div class="line"><a id="l03530" name="l03530"></a><span class="lineno"> 3530</span> <span class="comment">// Try adding after_node on route of before_node.</span></div>
|
|
<div class="line"><a id="l03531" name="l03531"></a><span class="lineno"> 3531</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(before_node, after_node);</div>
|
|
<div class="line"><a id="l03532" name="l03532"></a><span class="lineno"> 3532</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(after_node, <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>);</div>
|
|
<div class="line"><a id="l03533" name="l03533"></a><span class="lineno"> 3533</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value()) {</div>
|
|
<div class="line"><a id="l03534" name="l03534"></a><span class="lineno"> 3534</span> <span class="keywordflow">if</span> (first_node_on_route_[vehicle] != before_node) {</div>
|
|
<div class="line"><a id="l03535" name="l03535"></a><span class="lineno"> 3535</span> <span class="comment">// before_node is no longer the start or end of its route</span></div>
|
|
<div class="line"><a id="l03536" name="l03536"></a><span class="lineno"> 3536</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_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->Start(vehicle)), before_node);</div>
|
|
<div class="line"><a id="l03537" name="l03537"></a><span class="lineno"> 3537</span> vehicle_of_first_or_last_node_[before_node] = -1;</div>
|
|
<div class="line"><a id="l03538" name="l03538"></a><span class="lineno"> 3538</span> }</div>
|
|
<div class="line"><a id="l03539" name="l03539"></a><span class="lineno"> 3539</span> vehicle_of_first_or_last_node_[after_node] = vehicle;</div>
|
|
<div class="line"><a id="l03540" name="l03540"></a><span class="lineno"> 3540</span> last_node_on_route_[vehicle] = after_node;</div>
|
|
<div class="line"><a id="l03541" name="l03541"></a><span class="lineno"> 3541</span> <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->ReinjectSkippedSavingsStartingAt(after_node);</div>
|
|
<div class="line"><a id="l03542" name="l03542"></a><span class="lineno"> 3542</span> }</div>
|
|
<div class="line"><a id="l03543" name="l03543"></a><span class="lineno"> 3543</span> }</div>
|
|
<div class="line"><a id="l03544" name="l03544"></a><span class="lineno"> 3544</span> }</div>
|
|
<div class="line"><a id="l03545" name="l03545"></a><span class="lineno"> 3545</span> </div>
|
|
<div class="line"><a id="l03546" name="l03546"></a><span class="lineno"> 3546</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(before_node) && <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(after_node)) {</div>
|
|
<div class="line"><a id="l03547" name="l03547"></a><span class="lineno"> 3547</span> <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = vehicle_of_first_or_last_node_[after_node];</div>
|
|
<div class="line"><a id="l03548" name="l03548"></a><span class="lineno"> 3548</span> <span class="keyword">const</span> int64_t first_node =</div>
|
|
<div class="line"><a id="l03549" name="l03549"></a><span class="lineno"> 3549</span> vehicle == -1 ? -1 : first_node_on_route_[vehicle];</div>
|
|
<div class="line"><a id="l03550" name="l03550"></a><span class="lineno"> 3550</span> </div>
|
|
<div class="line"><a id="l03551" name="l03551"></a><span class="lineno"> 3551</span> <span class="keywordflow">if</span> (after_node == first_node) {</div>
|
|
<div class="line"><a id="l03552" name="l03552"></a><span class="lineno"> 3552</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a> = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(vehicle);</div>
|
|
<div class="line"><a id="l03553" name="l03553"></a><span class="lineno"> 3553</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(<a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>), after_node);</div>
|
|
<div class="line"><a id="l03554" name="l03554"></a><span class="lineno"> 3554</span> </div>
|
|
<div class="line"><a id="l03555" name="l03555"></a><span class="lineno"> 3555</span> <span class="keyword">const</span> <span class="keywordtype">int</span> route_type = <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a>->Type(vehicle);</div>
|
|
<div class="line"><a id="l03556" name="l03556"></a><span class="lineno"> 3556</span> <span class="keywordflow">if</span> (type != route_type) {</div>
|
|
<div class="line"><a id="l03557" name="l03557"></a><span class="lineno"> 3557</span> <span class="comment">// The saving doesn't correspond to the type of the vehicle serving</span></div>
|
|
<div class="line"><a id="l03558" name="l03558"></a><span class="lineno"> 3558</span> <span class="comment">// after_node. We update the container with the correct type.</span></div>
|
|
<div class="line"><a id="l03559" name="l03559"></a><span class="lineno"> 3559</span> <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->UpdateWithType(route_type);</div>
|
|
<div class="line"><a id="l03560" name="l03560"></a><span class="lineno"> 3560</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l03561" name="l03561"></a><span class="lineno"> 3561</span> }</div>
|
|
<div class="line"><a id="l03562" name="l03562"></a><span class="lineno"> 3562</span> </div>
|
|
<div class="line"><a id="l03563" name="l03563"></a><span class="lineno"> 3563</span> <span class="comment">// Try adding before_node on route of after_node.</span></div>
|
|
<div class="line"><a id="l03564" name="l03564"></a><span class="lineno"> 3564</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(before_node, after_node);</div>
|
|
<div class="line"><a id="l03565" name="l03565"></a><span class="lineno"> 3565</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(<a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>, before_node);</div>
|
|
<div class="line"><a id="l03566" name="l03566"></a><span class="lineno"> 3566</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value()) {</div>
|
|
<div class="line"><a id="l03567" name="l03567"></a><span class="lineno"> 3567</span> <span class="keywordflow">if</span> (last_node_on_route_[vehicle] != after_node) {</div>
|
|
<div class="line"><a id="l03568" name="l03568"></a><span class="lineno"> 3568</span> <span class="comment">// after_node is no longer the start or end of its route</span></div>
|
|
<div class="line"><a id="l03569" name="l03569"></a><span class="lineno"> 3569</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_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(after_node), <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->End(vehicle));</div>
|
|
<div class="line"><a id="l03570" name="l03570"></a><span class="lineno"> 3570</span> vehicle_of_first_or_last_node_[after_node] = -1;</div>
|
|
<div class="line"><a id="l03571" name="l03571"></a><span class="lineno"> 3571</span> }</div>
|
|
<div class="line"><a id="l03572" name="l03572"></a><span class="lineno"> 3572</span> vehicle_of_first_or_last_node_[before_node] = vehicle;</div>
|
|
<div class="line"><a id="l03573" name="l03573"></a><span class="lineno"> 3573</span> first_node_on_route_[vehicle] = before_node;</div>
|
|
<div class="line"><a id="l03574" name="l03574"></a><span class="lineno"> 3574</span> <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->ReinjectSkippedSavingsEndingAt(before_node);</div>
|
|
<div class="line"><a id="l03575" name="l03575"></a><span class="lineno"> 3575</span> }</div>
|
|
<div class="line"><a id="l03576" name="l03576"></a><span class="lineno"> 3576</span> }</div>
|
|
<div class="line"><a id="l03577" name="l03577"></a><span class="lineno"> 3577</span> }</div>
|
|
<div class="line"><a id="l03578" name="l03578"></a><span class="lineno"> 3578</span> <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">savings_container_</a>->Update(<span class="comment">/*update_best_saving*/</span> <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l03579" name="l03579"></a><span class="lineno"> 3579</span> }</div>
|
|
<div class="line"><a id="l03580" name="l03580"></a><span class="lineno"> 3580</span>}</div>
|
|
<div class="line"><a id="l03581" name="l03581"></a><span class="lineno"> 3581</span> </div>
|
|
<div class="line"><a id="l03582" name="l03582"></a><span class="lineno"> 3582</span><span class="keywordtype">void</span> ParallelSavingsFilteredHeuristic::MergeRoutes(<span class="keywordtype">int</span> first_vehicle,</div>
|
|
<div class="line"><a id="l03583" name="l03583"></a><span class="lineno"> 3583</span> <span class="keywordtype">int</span> second_vehicle,</div>
|
|
<div class="line"><a id="l03584" name="l03584"></a><span class="lineno"> 3584</span> int64_t before_node,</div>
|
|
<div class="line"><a id="l03585" name="l03585"></a><span class="lineno"> 3585</span> int64_t after_node) {</div>
|
|
<div class="line"><a id="l03586" name="l03586"></a><span class="lineno"> 3586</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l03587" name="l03587"></a><span class="lineno"> 3587</span> <span class="keyword">const</span> int64_t new_first_node = first_node_on_route_[first_vehicle];</div>
|
|
<div class="line"><a id="l03588" name="l03588"></a><span class="lineno"> 3588</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(vehicle_of_first_or_last_node_[new_first_node], first_vehicle);</div>
|
|
<div class="line"><a id="l03589" name="l03589"></a><span class="lineno"> 3589</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->Start(first_vehicle)), new_first_node);</div>
|
|
<div class="line"><a id="l03590" name="l03590"></a><span class="lineno"> 3590</span> <span class="keyword">const</span> int64_t new_last_node = last_node_on_route_[second_vehicle];</div>
|
|
<div class="line"><a id="l03591" name="l03591"></a><span class="lineno"> 3591</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(vehicle_of_first_or_last_node_[new_last_node], second_vehicle);</div>
|
|
<div class="line"><a id="l03592" name="l03592"></a><span class="lineno"> 3592</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">Value</a>(new_last_node), <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->End(second_vehicle));</div>
|
|
<div class="line"><a id="l03593" name="l03593"></a><span class="lineno"> 3593</span> </div>
|
|
<div class="line"><a id="l03594" name="l03594"></a><span class="lineno"> 3594</span> <span class="comment">// Select the vehicle with lower fixed cost to merge the routes.</span></div>
|
|
<div class="line"><a id="l03595" name="l03595"></a><span class="lineno"> 3595</span> <span class="keywordtype">int</span> used_vehicle = first_vehicle;</div>
|
|
<div class="line"><a id="l03596" name="l03596"></a><span class="lineno"> 3596</span> <span class="keywordtype">int</span> unused_vehicle = second_vehicle;</div>
|
|
<div class="line"><a id="l03597" name="l03597"></a><span class="lineno"> 3597</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->GetFixedCostOfVehicle(first_vehicle) ></div>
|
|
<div class="line"><a id="l03598" name="l03598"></a><span class="lineno"> 3598</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->GetFixedCostOfVehicle(second_vehicle)) {</div>
|
|
<div class="line"><a id="l03599" name="l03599"></a><span class="lineno"> 3599</span> used_vehicle = second_vehicle;</div>
|
|
<div class="line"><a id="l03600" name="l03600"></a><span class="lineno"> 3600</span> unused_vehicle = first_vehicle;</div>
|
|
<div class="line"><a id="l03601" name="l03601"></a><span class="lineno"> 3601</span> }</div>
|
|
<div class="line"><a id="l03602" name="l03602"></a><span class="lineno"> 3602</span> </div>
|
|
<div class="line"><a id="l03603" name="l03603"></a><span class="lineno"> 3603</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(before_node, after_node);</div>
|
|
<div class="line"><a id="l03604" name="l03604"></a><span class="lineno"> 3604</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->Start(unused_vehicle), <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->End(unused_vehicle));</div>
|
|
<div class="line"><a id="l03605" name="l03605"></a><span class="lineno"> 3605</span> <span class="keywordflow">if</span> (used_vehicle == first_vehicle) {</div>
|
|
<div class="line"><a id="l03606" name="l03606"></a><span class="lineno"> 3606</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(new_last_node, <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->End(used_vehicle));</div>
|
|
<div class="line"><a id="l03607" name="l03607"></a><span class="lineno"> 3607</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l03608" name="l03608"></a><span class="lineno"> 3608</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->Start(used_vehicle), new_first_node);</div>
|
|
<div class="line"><a id="l03609" name="l03609"></a><span class="lineno"> 3609</span> }</div>
|
|
<div class="line"><a id="l03610" name="l03610"></a><span class="lineno"> 3610</span> <span class="keywordtype">bool</span> committed = <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value();</div>
|
|
<div class="line"><a id="l03611" name="l03611"></a><span class="lineno"> 3611</span> <span class="keywordflow">if</span> (!committed &&</div>
|
|
<div class="line"><a id="l03612" name="l03612"></a><span class="lineno"> 3612</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->GetVehicleClassIndexOfVehicle(first_vehicle).<a class="code hl_variable" href="routing__search_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>() !=</div>
|
|
<div class="line"><a id="l03613" name="l03613"></a><span class="lineno"> 3613</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->GetVehicleClassIndexOfVehicle(second_vehicle).<a class="code hl_variable" href="routing__search_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>()) {</div>
|
|
<div class="line"><a id="l03614" name="l03614"></a><span class="lineno"> 3614</span> <span class="comment">// Try committing on other vehicle instead.</span></div>
|
|
<div class="line"><a id="l03615" name="l03615"></a><span class="lineno"> 3615</span> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(used_vehicle, unused_vehicle);</div>
|
|
<div class="line"><a id="l03616" name="l03616"></a><span class="lineno"> 3616</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(before_node, after_node);</div>
|
|
<div class="line"><a id="l03617" name="l03617"></a><span class="lineno"> 3617</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->Start(unused_vehicle), <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->End(unused_vehicle));</div>
|
|
<div class="line"><a id="l03618" name="l03618"></a><span class="lineno"> 3618</span> <span class="keywordflow">if</span> (used_vehicle == first_vehicle) {</div>
|
|
<div class="line"><a id="l03619" name="l03619"></a><span class="lineno"> 3619</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(new_last_node, <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->End(used_vehicle));</div>
|
|
<div class="line"><a id="l03620" name="l03620"></a><span class="lineno"> 3620</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l03621" name="l03621"></a><span class="lineno"> 3621</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->Start(used_vehicle), new_first_node);</div>
|
|
<div class="line"><a id="l03622" name="l03622"></a><span class="lineno"> 3622</span> }</div>
|
|
<div class="line"><a id="l03623" name="l03623"></a><span class="lineno"> 3623</span> committed = <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value();</div>
|
|
<div class="line"><a id="l03624" name="l03624"></a><span class="lineno"> 3624</span> }</div>
|
|
<div class="line"><a id="l03625" name="l03625"></a><span class="lineno"> 3625</span> <span class="keywordflow">if</span> (committed) {</div>
|
|
<div class="line"><a id="l03626" name="l03626"></a><span class="lineno"> 3626</span> <span class="comment">// Make unused_vehicle available</span></div>
|
|
<div class="line"><a id="l03627" name="l03627"></a><span class="lineno"> 3627</span> <a class="code hl_variable" href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">vehicle_type_curator_</a>->ReinjectVehicleOfClass(</div>
|
|
<div class="line"><a id="l03628" name="l03628"></a><span class="lineno"> 3628</span> unused_vehicle,</div>
|
|
<div class="line"><a id="l03629" name="l03629"></a><span class="lineno"> 3629</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->GetVehicleClassIndexOfVehicle(unused_vehicle).<a class="code hl_variable" href="routing__search_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>(),</div>
|
|
<div class="line"><a id="l03630" name="l03630"></a><span class="lineno"> 3630</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->GetFixedCostOfVehicle(unused_vehicle));</div>
|
|
<div class="line"><a id="l03631" name="l03631"></a><span class="lineno"> 3631</span> </div>
|
|
<div class="line"><a id="l03632" name="l03632"></a><span class="lineno"> 3632</span> <span class="comment">// Update the first and last nodes on vehicles.</span></div>
|
|
<div class="line"><a id="l03633" name="l03633"></a><span class="lineno"> 3633</span> first_node_on_route_[unused_vehicle] = -1;</div>
|
|
<div class="line"><a id="l03634" name="l03634"></a><span class="lineno"> 3634</span> last_node_on_route_[unused_vehicle] = -1;</div>
|
|
<div class="line"><a id="l03635" name="l03635"></a><span class="lineno"> 3635</span> vehicle_of_first_or_last_node_[before_node] = -1;</div>
|
|
<div class="line"><a id="l03636" name="l03636"></a><span class="lineno"> 3636</span> vehicle_of_first_or_last_node_[after_node] = -1;</div>
|
|
<div class="line"><a id="l03637" name="l03637"></a><span class="lineno"> 3637</span> first_node_on_route_[used_vehicle] = new_first_node;</div>
|
|
<div class="line"><a id="l03638" name="l03638"></a><span class="lineno"> 3638</span> last_node_on_route_[used_vehicle] = new_last_node;</div>
|
|
<div class="line"><a id="l03639" name="l03639"></a><span class="lineno"> 3639</span> vehicle_of_first_or_last_node_[new_last_node] = used_vehicle;</div>
|
|
<div class="line"><a id="l03640" name="l03640"></a><span class="lineno"> 3640</span> vehicle_of_first_or_last_node_[new_first_node] = used_vehicle;</div>
|
|
<div class="line"><a id="l03641" name="l03641"></a><span class="lineno"> 3641</span> }</div>
|
|
<div class="line"><a id="l03642" name="l03642"></a><span class="lineno"> 3642</span>}</div>
|
|
<div class="line"><a id="l03643" name="l03643"></a><span class="lineno"> 3643</span> </div>
|
|
<div class="line"><a id="l03644" name="l03644"></a><span class="lineno"> 3644</span><span class="comment">// ChristofidesFilteredHeuristic</span></div>
|
|
<div class="line"><a id="l03645" name="l03645"></a><span class="lineno"> 3645</span> </div>
|
|
<div class="line"><a id="l03646" name="l03646"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_christofides_filtered_heuristic.html#af91a0a971d9bbdf32471d229a030a5fc"> 3646</a></span><a class="code hl_function" href="classoperations__research_1_1_christofides_filtered_heuristic.html#af91a0a971d9bbdf32471d229a030a5fc">ChristofidesFilteredHeuristic::ChristofidesFilteredHeuristic</a>(</div>
|
|
<div class="line"><a id="l03647" name="l03647"></a><span class="lineno"> 3647</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <a class="code hl_class" href="classoperations__research_1_1_local_search_filter_manager.html">LocalSearchFilterManager</a>* filter_manager,</div>
|
|
<div class="line"><a id="l03648" name="l03648"></a><span class="lineno"> 3648</span> <span class="keywordtype">bool</span> use_minimum_matching)</div>
|
|
<div class="line"><a id="l03649" name="l03649"></a><span class="lineno"> 3649</span> : <a class="code hl_class" href="classoperations__research_1_1_routing_filtered_heuristic.html">RoutingFilteredHeuristic</a>(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, filter_manager),</div>
|
|
<div class="line"><a id="l03650" name="l03650"></a><span class="lineno"> 3650</span> use_minimum_matching_(use_minimum_matching) {}</div>
|
|
<div class="line"><a id="l03651" name="l03651"></a><span class="lineno"> 3651</span> </div>
|
|
<div class="line"><a id="l03652" name="l03652"></a><span class="lineno"> 3652</span><span class="comment">// TODO(user): Support pickup & delivery.</span></div>
|
|
<div class="line"><a id="l03653" name="l03653"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_christofides_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289"> 3653</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_christofides_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">ChristofidesFilteredHeuristic::BuildSolutionInternal</a>() {</div>
|
|
<div class="line"><a id="l03654" name="l03654"></a><span class="lineno"> 3654</span> <span class="keyword">const</span> <span class="keywordtype">int</span> size = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">Size</a>() - <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>() + 1;</div>
|
|
<div class="line"><a id="l03655" name="l03655"></a><span class="lineno"> 3655</span> <span class="comment">// Node indices for Christofides solver.</span></div>
|
|
<div class="line"><a id="l03656" name="l03656"></a><span class="lineno"> 3656</span> <span class="comment">// 0: start/end node</span></div>
|
|
<div class="line"><a id="l03657" name="l03657"></a><span class="lineno"> 3657</span> <span class="comment">// >0: non start/end nodes</span></div>
|
|
<div class="line"><a id="l03658" name="l03658"></a><span class="lineno"> 3658</span> <span class="comment">// TODO(user): Add robustness to fixed arcs by collapsing them into meta-</span></div>
|
|
<div class="line"><a id="l03659" name="l03659"></a><span class="lineno"> 3659</span> <span class="comment">// nodes.</span></div>
|
|
<div class="line"><a id="l03660" name="l03660"></a><span class="lineno"> 3660</span> std::vector<int> indices(1, 0);</div>
|
|
<div class="line"><a id="l03661" name="l03661"></a><span class="lineno"> 3661</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < size; ++i) {</div>
|
|
<div class="line"><a id="l03662" name="l03662"></a><span class="lineno"> 3662</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->IsStart(i) && !<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->IsEnd(i)) {</div>
|
|
<div class="line"><a id="l03663" name="l03663"></a><span class="lineno"> 3663</span> indices.push_back(i);</div>
|
|
<div class="line"><a id="l03664" name="l03664"></a><span class="lineno"> 3664</span> }</div>
|
|
<div class="line"><a id="l03665" name="l03665"></a><span class="lineno"> 3665</span> }</div>
|
|
<div class="line"><a id="l03666" name="l03666"></a><span class="lineno"> 3666</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_cost_classes = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#ad3b144985c2b4b24cf39b839dbd9c16d">GetCostClassesCount</a>();</div>
|
|
<div class="line"><a id="l03667" name="l03667"></a><span class="lineno"> 3667</span> std::vector<std::vector<int>> path_per_cost_class(num_cost_classes);</div>
|
|
<div class="line"><a id="l03668" name="l03668"></a><span class="lineno"> 3668</span> std::vector<bool> class_covered(num_cost_classes, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l03669" name="l03669"></a><span class="lineno"> 3669</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">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="l03670" name="l03670"></a><span class="lineno"> 3670</span> <span class="keyword">const</span> int64_t cost_class =</div>
|
|
<div class="line"><a id="l03671" name="l03671"></a><span class="lineno"> 3671</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#ae378d23c967e818f321bd4498b5c74f2">GetCostClassIndexOfVehicle</a>(vehicle).value();</div>
|
|
<div class="line"><a id="l03672" name="l03672"></a><span class="lineno"> 3672</span> <span class="keywordflow">if</span> (!class_covered[cost_class]) {</div>
|
|
<div class="line"><a id="l03673" name="l03673"></a><span class="lineno"> 3673</span> class_covered[cost_class] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l03674" name="l03674"></a><span class="lineno"> 3674</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a> = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(vehicle);</div>
|
|
<div class="line"><a id="l03675" name="l03675"></a><span class="lineno"> 3675</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a> = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#afb80fd36c1fb57d2db049403483e2074">End</a>(vehicle);</div>
|
|
<div class="line"><a id="l03676" name="l03676"></a><span class="lineno"> 3676</span> <span class="keyword">auto</span> <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a> = [<span class="keyword">this</span>, &indices, <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>, <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>, cost_class](<span class="keywordtype">int</span> from, <span class="keywordtype">int</span> to) {</div>
|
|
<div class="line"><a id="l03677" name="l03677"></a><span class="lineno"> 3677</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(from, indices.size());</div>
|
|
<div class="line"><a id="l03678" name="l03678"></a><span class="lineno"> 3678</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(to, indices.size());</div>
|
|
<div class="line"><a id="l03679" name="l03679"></a><span class="lineno"> 3679</span> <span class="keyword">const</span> <span class="keywordtype">int</span> from_index = (from == 0) ? <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a> : indices[from];</div>
|
|
<div class="line"><a id="l03680" name="l03680"></a><span class="lineno"> 3680</span> <span class="keyword">const</span> <span class="keywordtype">int</span> to_index = (to == 0) ? <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a> : indices[to];</div>
|
|
<div class="line"><a id="l03681" name="l03681"></a><span class="lineno"> 3681</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a> =</div>
|
|
<div class="line"><a id="l03682" name="l03682"></a><span class="lineno"> 3682</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#abfa127093eb53ae531ccb1f4ada6cc8a">GetArcCostForClass</a>(from_index, to_index, cost_class);</div>
|
|
<div class="line"><a id="l03683" name="l03683"></a><span class="lineno"> 3683</span> <span class="comment">// To avoid overflow issues, capping costs at kint64max/2, the maximum</span></div>
|
|
<div class="line"><a id="l03684" name="l03684"></a><span class="lineno"> 3684</span> <span class="comment">// value supported by MinCostPerfectMatching.</span></div>
|
|
<div class="line"><a id="l03685" name="l03685"></a><span class="lineno"> 3685</span> <span class="comment">// TODO(user): Investigate if ChristofidesPathSolver should not</span></div>
|
|
<div class="line"><a id="l03686" name="l03686"></a><span class="lineno"> 3686</span> <span class="comment">// return a status to bail out fast in case of problem.</span></div>
|
|
<div class="line"><a id="l03687" name="l03687"></a><span class="lineno"> 3687</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(<a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>, <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>() / 2);</div>
|
|
<div class="line"><a id="l03688" name="l03688"></a><span class="lineno"> 3688</span> };</div>
|
|
<div class="line"><a id="l03689" name="l03689"></a><span class="lineno"> 3689</span> <span class="keyword">using</span> Cost = <span class="keyword">decltype</span>(<a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>);</div>
|
|
<div class="line"><a id="l03690" name="l03690"></a><span class="lineno"> 3690</span> <a class="code hl_class" href="classoperations__research_1_1_christofides_path_solver.html">ChristofidesPathSolver<int64_t, int64_t, int, Cost></a> christofides_solver(</div>
|
|
<div class="line"><a id="l03691" name="l03691"></a><span class="lineno"> 3691</span> indices.size(), <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>);</div>
|
|
<div class="line"><a id="l03692" name="l03692"></a><span class="lineno"> 3692</span> <span class="keywordflow">if</span> (use_minimum_matching_) {</div>
|
|
<div class="line"><a id="l03693" name="l03693"></a><span class="lineno"> 3693</span> christofides_solver.<a class="code hl_function" href="classoperations__research_1_1_christofides_path_solver.html#ae2b64dddd58baf1bc5e01cb14971e52e">SetMatchingAlgorithm</a>(</div>
|
|
<div class="line"><a id="l03694" name="l03694"></a><span class="lineno"> 3694</span> <a class="code hl_class" href="classoperations__research_1_1_christofides_path_solver.html">ChristofidesPathSolver<int64_t, int64_t, int, Cost></a>::</div>
|
|
<div class="line"><a id="l03695" name="l03695"></a><span class="lineno"> 3695</span> MatchingAlgorithm::MINIMUM_WEIGHT_MATCHING);</div>
|
|
<div class="line"><a id="l03696" name="l03696"></a><span class="lineno"> 3696</span> }</div>
|
|
<div class="line"><a id="l03697" name="l03697"></a><span class="lineno"> 3697</span> <span class="keywordflow">if</span> (christofides_solver.<a class="code hl_function" href="classoperations__research_1_1_christofides_path_solver.html#a942f29030f08426e7e318204e987e2f7">Solve</a>()) {</div>
|
|
<div class="line"><a id="l03698" name="l03698"></a><span class="lineno"> 3698</span> path_per_cost_class[cost_class] =</div>
|
|
<div class="line"><a id="l03699" name="l03699"></a><span class="lineno"> 3699</span> christofides_solver.<a class="code hl_function" href="classoperations__research_1_1_christofides_path_solver.html#a3076d9001536ea98d419faa81e7d8a47">TravelingSalesmanPath</a>();</div>
|
|
<div class="line"><a id="l03700" name="l03700"></a><span class="lineno"> 3700</span> }</div>
|
|
<div class="line"><a id="l03701" name="l03701"></a><span class="lineno"> 3701</span> }</div>
|
|
<div class="line"><a id="l03702" name="l03702"></a><span class="lineno"> 3702</span> }</div>
|
|
<div class="line"><a id="l03703" name="l03703"></a><span class="lineno"> 3703</span> <span class="comment">// TODO(user): Investigate if sorting paths per cost improves solutions.</span></div>
|
|
<div class="line"><a id="l03704" name="l03704"></a><span class="lineno"> 3704</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">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="l03705" name="l03705"></a><span class="lineno"> 3705</span> <span class="keyword">const</span> int64_t cost_class =</div>
|
|
<div class="line"><a id="l03706" name="l03706"></a><span class="lineno"> 3706</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#ae378d23c967e818f321bd4498b5c74f2">GetCostClassIndexOfVehicle</a>(vehicle).value();</div>
|
|
<div class="line"><a id="l03707" name="l03707"></a><span class="lineno"> 3707</span> <span class="keyword">const</span> std::vector<int>& path = path_per_cost_class[cost_class];</div>
|
|
<div class="line"><a id="l03708" name="l03708"></a><span class="lineno"> 3708</span> <span class="keywordflow">if</span> (path.empty()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l03709" name="l03709"></a><span class="lineno"> 3709</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(0, path[0]);</div>
|
|
<div class="line"><a id="l03710" name="l03710"></a><span class="lineno"> 3710</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(0, path.back());</div>
|
|
<div class="line"><a id="l03711" name="l03711"></a><span class="lineno"> 3711</span> <span class="comment">// Extend route from start.</span></div>
|
|
<div class="line"><a id="l03712" name="l03712"></a><span class="lineno"> 3712</span> <span class="keywordtype">int</span> prev = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a2ace3be57d4d81121e8ebbd3642052c0">GetStartChainEnd</a>(vehicle);</div>
|
|
<div class="line"><a id="l03713" name="l03713"></a><span class="lineno"> 3713</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a> = <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#afb80fd36c1fb57d2db049403483e2074">End</a>(vehicle);</div>
|
|
<div class="line"><a id="l03714" name="l03714"></a><span class="lineno"> 3714</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < path.size() - 1 && prev != <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>; ++i) {</div>
|
|
<div class="line"><a id="l03715" name="l03715"></a><span class="lineno"> 3715</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">StopSearch</a>()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l03716" name="l03716"></a><span class="lineno"> 3716</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = indices[path[i]];</div>
|
|
<div class="line"><a id="l03717" name="l03717"></a><span class="lineno"> 3717</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">Contains</a>(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)) {</div>
|
|
<div class="line"><a id="l03718" name="l03718"></a><span class="lineno"> 3718</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(prev, <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a id="l03719" name="l03719"></a><span class="lineno"> 3719</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">SetValue</a>(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>);</div>
|
|
<div class="line"><a id="l03720" name="l03720"></a><span class="lineno"> 3720</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value()) {</div>
|
|
<div class="line"><a id="l03721" name="l03721"></a><span class="lineno"> 3721</span> prev = <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a id="l03722" name="l03722"></a><span class="lineno"> 3722</span> }</div>
|
|
<div class="line"><a id="l03723" name="l03723"></a><span class="lineno"> 3723</span> }</div>
|
|
<div class="line"><a id="l03724" name="l03724"></a><span class="lineno"> 3724</span> }</div>
|
|
<div class="line"><a id="l03725" name="l03725"></a><span class="lineno"> 3725</span> }</div>
|
|
<div class="line"><a id="l03726" name="l03726"></a><span class="lineno"> 3726</span> <a class="code hl_function" href="classoperations__research_1_1_routing_filtered_heuristic.html#a97049801609b8cb68c0428970f916fd4">MakeUnassignedNodesUnperformed</a>();</div>
|
|
<div class="line"><a id="l03727" name="l03727"></a><span class="lineno"> 3727</span> <span class="keywordflow">return</span> <a class="code hl_function" href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">Evaluate</a>(<span class="comment">/*commit=*/</span><span class="keyword">true</span>).has_value();</div>
|
|
<div class="line"><a id="l03728" name="l03728"></a><span class="lineno"> 3728</span>}</div>
|
|
<div class="line"><a id="l03729" name="l03729"></a><span class="lineno"> 3729</span> </div>
|
|
<div class="line"><a id="l03730" name="l03730"></a><span class="lineno"> 3730</span><span class="comment">// Sweep heuristic</span></div>
|
|
<div class="line"><a id="l03731" name="l03731"></a><span class="lineno"> 3731</span><span class="comment">// TODO(user): Clean up to match other first solution strategies.</span></div>
|
|
<div class="line"><a id="l03732" name="l03732"></a><span class="lineno"> 3732</span> </div>
|
|
<div class="line"><a id="l03733" name="l03733"></a><span class="lineno"> 3733</span><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l03734" name="l03734"></a><span class="lineno"> 3734</span><span class="keyword">struct </span>SweepIndex {</div>
|
|
<div class="line"><a id="l03735" name="l03735"></a><span class="lineno"> 3735</span> SweepIndex(<span class="keyword">const</span> int64_t <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>, <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="routing__search_8cc.html#a79dea7ed146af26ff4a0ba4bf5c83eee">angle</a>, <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="routing__search_8cc.html#a79b8e036dca6911e3295a47d99f21f43">distance</a>)</div>
|
|
<div class="line"><a id="l03736" name="l03736"></a><span class="lineno"> 3736</span> : <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>(<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>), <a class="code hl_variable" href="routing__search_8cc.html#a79dea7ed146af26ff4a0ba4bf5c83eee">angle</a>(<a class="code hl_variable" href="routing__search_8cc.html#a79dea7ed146af26ff4a0ba4bf5c83eee">angle</a>), <a class="code hl_variable" href="routing__search_8cc.html#a79b8e036dca6911e3295a47d99f21f43">distance</a>(<a class="code hl_variable" href="routing__search_8cc.html#a79b8e036dca6911e3295a47d99f21f43">distance</a>) {}</div>
|
|
<div class="line"><a id="l03737" name="l03737"></a><span class="lineno"> 3737</span> ~SweepIndex() {}</div>
|
|
<div class="line"><a id="l03738" name="l03738"></a><span class="lineno"> 3738</span> </div>
|
|
<div class="line"><a id="l03739" name="l03739"></a><span class="lineno"><a class="line" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e"> 3739</a></span> int64_t <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>;</div>
|
|
<div class="line"><a id="l03740" name="l03740"></a><span class="lineno"><a class="line" href="routing__search_8cc.html#a79dea7ed146af26ff4a0ba4bf5c83eee"> 3740</a></span> <span class="keywordtype">double</span> <a class="code hl_variable" href="routing__search_8cc.html#a79dea7ed146af26ff4a0ba4bf5c83eee">angle</a>;</div>
|
|
<div class="line"><a id="l03741" name="l03741"></a><span class="lineno"><a class="line" href="routing__search_8cc.html#a79b8e036dca6911e3295a47d99f21f43"> 3741</a></span> <span class="keywordtype">double</span> <a class="code hl_variable" href="routing__search_8cc.html#a79b8e036dca6911e3295a47d99f21f43">distance</a>;</div>
|
|
<div class="line"><a id="l03742" name="l03742"></a><span class="lineno"> 3742</span>};</div>
|
|
<div class="line"><a id="l03743" name="l03743"></a><span class="lineno"> 3743</span> </div>
|
|
<div class="line"><a id="l03744" name="l03744"></a><span class="lineno"> 3744</span><span class="keyword">struct </span>SweepIndexSortAngle {</div>
|
|
<div class="line"><a id="l03745" name="l03745"></a><span class="lineno"> 3745</span> <span class="keywordtype">bool</span> operator()(<span class="keyword">const</span> SweepIndex& node1, <span class="keyword">const</span> SweepIndex& node2)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l03746" name="l03746"></a><span class="lineno"> 3746</span> <span class="keywordflow">return</span> (node1.angle < node2.angle);</div>
|
|
<div class="line"><a id="l03747" name="l03747"></a><span class="lineno"> 3747</span> }</div>
|
|
<div class="line"><a id="l03748" name="l03748"></a><span class="lineno"> 3748</span>} SweepIndexAngleComparator;</div>
|
|
<div class="line"><a id="l03749" name="l03749"></a><span class="lineno"> 3749</span> </div>
|
|
<div class="line"><a id="l03750" name="l03750"></a><span class="lineno"> 3750</span><span class="keyword">struct </span>SweepIndexSortDistance {</div>
|
|
<div class="line"><a id="l03751" name="l03751"></a><span class="lineno"> 3751</span> <span class="keywordtype">bool</span> operator()(<span class="keyword">const</span> SweepIndex& node1, <span class="keyword">const</span> SweepIndex& node2)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l03752" name="l03752"></a><span class="lineno"> 3752</span> <span class="keywordflow">return</span> (node1.distance < node2.distance);</div>
|
|
<div class="line"><a id="l03753" name="l03753"></a><span class="lineno"> 3753</span> }</div>
|
|
<div class="line"><a id="l03754" name="l03754"></a><span class="lineno"> 3754</span>} SweepIndexDistanceComparator;</div>
|
|
<div class="line"><a id="l03755" name="l03755"></a><span class="lineno"> 3755</span>} <span class="comment">// namespace</span></div>
|
|
<div class="line"><a id="l03756" name="l03756"></a><span class="lineno"> 3756</span> </div>
|
|
<div class="line"><a id="l03757" name="l03757"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sweep_arranger.html#a2197ac12bb9d1906c420aa46b09448ce"> 3757</a></span><a class="code hl_function" href="classoperations__research_1_1_sweep_arranger.html#a2197ac12bb9d1906c420aa46b09448ce">SweepArranger::SweepArranger</a>(</div>
|
|
<div class="line"><a id="l03758" name="l03758"></a><span class="lineno"> 3758</span> <span class="keyword">const</span> std::vector<std::pair<int64_t, int64_t>>& points)</div>
|
|
<div class="line"><a id="l03759" name="l03759"></a><span class="lineno"> 3759</span> : coordinates_(2 * points.size(), 0), sectors_(1) {</div>
|
|
<div class="line"><a id="l03760" name="l03760"></a><span class="lineno"> 3760</span> <span class="keywordflow">for</span> (int64_t i = 0; i < points.size(); ++i) {</div>
|
|
<div class="line"><a id="l03761" name="l03761"></a><span class="lineno"> 3761</span> coordinates_[2 * i] = points[i].first;</div>
|
|
<div class="line"><a id="l03762" name="l03762"></a><span class="lineno"> 3762</span> coordinates_[2 * i + 1] = points[i].second;</div>
|
|
<div class="line"><a id="l03763" name="l03763"></a><span class="lineno"> 3763</span> }</div>
|
|
<div class="line"><a id="l03764" name="l03764"></a><span class="lineno"> 3764</span>}</div>
|
|
<div class="line"><a id="l03765" name="l03765"></a><span class="lineno"> 3765</span> </div>
|
|
<div class="line"><a id="l03766" name="l03766"></a><span class="lineno"> 3766</span><span class="comment">// Splits the space of the indices into sectors and sorts the indices of each</span></div>
|
|
<div class="line"><a id="l03767" name="l03767"></a><span class="lineno"> 3767</span><span class="comment">// sector with ascending angle from the depot.</span></div>
|
|
<div class="line"><a id="l03768" name="l03768"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_sweep_arranger.html#a5fceff18e9961fb07c1c02231aef9985"> 3768</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_sweep_arranger.html#a5fceff18e9961fb07c1c02231aef9985">SweepArranger::ArrangeIndices</a>(std::vector<int64_t>* indices) {</div>
|
|
<div class="line"><a id="l03769" name="l03769"></a><span class="lineno"> 3769</span> <span class="keyword">const</span> <span class="keywordtype">double</span> pi_rad = 3.14159265;</div>
|
|
<div class="line"><a id="l03770" name="l03770"></a><span class="lineno"> 3770</span> <span class="comment">// Suppose that the center is at x0, y0.</span></div>
|
|
<div class="line"><a id="l03771" name="l03771"></a><span class="lineno"> 3771</span> <span class="keyword">const</span> <span class="keywordtype">int</span> x0 = coordinates_[0];</div>
|
|
<div class="line"><a id="l03772" name="l03772"></a><span class="lineno"> 3772</span> <span class="keyword">const</span> <span class="keywordtype">int</span> y0 = coordinates_[1];</div>
|
|
<div class="line"><a id="l03773" name="l03773"></a><span class="lineno"> 3773</span> </div>
|
|
<div class="line"><a id="l03774" name="l03774"></a><span class="lineno"> 3774</span> std::vector<SweepIndex> sweep_indices;</div>
|
|
<div class="line"><a id="l03775" name="l03775"></a><span class="lineno"> 3775</span> <span class="keywordflow">for</span> (int64_t <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a> = 0; index < static_cast<int>(coordinates_.size()) / 2;</div>
|
|
<div class="line"><a id="l03776" name="l03776"></a><span class="lineno"> 3776</span> ++<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>) {</div>
|
|
<div class="line"><a id="l03777" name="l03777"></a><span class="lineno"> 3777</span> <span class="keyword">const</span> <span class="keywordtype">int</span> x = coordinates_[2 * <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>];</div>
|
|
<div class="line"><a id="l03778" name="l03778"></a><span class="lineno"> 3778</span> <span class="keyword">const</span> <span class="keywordtype">int</span> y = coordinates_[2 * <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a> + 1];</div>
|
|
<div class="line"><a id="l03779" name="l03779"></a><span class="lineno"> 3779</span> <span class="keyword">const</span> <span class="keywordtype">double</span> x_delta = x - x0;</div>
|
|
<div class="line"><a id="l03780" name="l03780"></a><span class="lineno"> 3780</span> <span class="keyword">const</span> <span class="keywordtype">double</span> y_delta = y - y0;</div>
|
|
<div class="line"><a id="l03781" name="l03781"></a><span class="lineno"> 3781</span> <span class="keywordtype">double</span> square_distance = x_delta * x_delta + y_delta * y_delta;</div>
|
|
<div class="line"><a id="l03782" name="l03782"></a><span class="lineno"> 3782</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="routing__search_8cc.html#a79dea7ed146af26ff4a0ba4bf5c83eee">angle</a> = square_distance == 0 ? 0 : std::atan2(y_delta, x_delta);</div>
|
|
<div class="line"><a id="l03783" name="l03783"></a><span class="lineno"> 3783</span> <a class="code hl_variable" href="routing__search_8cc.html#a79dea7ed146af26ff4a0ba4bf5c83eee">angle</a> = <a class="code hl_variable" href="routing__search_8cc.html#a79dea7ed146af26ff4a0ba4bf5c83eee">angle</a> >= 0 ? <a class="code hl_variable" href="routing__search_8cc.html#a79dea7ed146af26ff4a0ba4bf5c83eee">angle</a> : 2 * pi_rad + <a class="code hl_variable" href="routing__search_8cc.html#a79dea7ed146af26ff4a0ba4bf5c83eee">angle</a>;</div>
|
|
<div class="line"><a id="l03784" name="l03784"></a><span class="lineno"> 3784</span> SweepIndex sweep_index(<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>, <a class="code hl_variable" href="routing__search_8cc.html#a79dea7ed146af26ff4a0ba4bf5c83eee">angle</a>, square_distance);</div>
|
|
<div class="line"><a id="l03785" name="l03785"></a><span class="lineno"> 3785</span> sweep_indices.push_back(sweep_index);</div>
|
|
<div class="line"><a id="l03786" name="l03786"></a><span class="lineno"> 3786</span> }</div>
|
|
<div class="line"><a id="l03787" name="l03787"></a><span class="lineno"> 3787</span> std::sort(sweep_indices.begin(), sweep_indices.end(),</div>
|
|
<div class="line"><a id="l03788" name="l03788"></a><span class="lineno"> 3788</span> SweepIndexDistanceComparator);</div>
|
|
<div class="line"><a id="l03789" name="l03789"></a><span class="lineno"> 3789</span> </div>
|
|
<div class="line"><a id="l03790" name="l03790"></a><span class="lineno"> 3790</span> <span class="keyword">const</span> <span class="keywordtype">int</span> size = <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(sweep_indices.size()) / sectors_;</div>
|
|
<div class="line"><a id="l03791" name="l03791"></a><span class="lineno"> 3791</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> sector = 0; sector < sectors_; ++sector) {</div>
|
|
<div class="line"><a id="l03792" name="l03792"></a><span class="lineno"> 3792</span> std::vector<SweepIndex> cluster;</div>
|
|
<div class="line"><a id="l03793" name="l03793"></a><span class="lineno"> 3793</span> std::vector<SweepIndex>::iterator begin =</div>
|
|
<div class="line"><a id="l03794" name="l03794"></a><span class="lineno"> 3794</span> sweep_indices.begin() + sector * size;</div>
|
|
<div class="line"><a id="l03795" name="l03795"></a><span class="lineno"> 3795</span> std::vector<SweepIndex>::iterator <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a> =</div>
|
|
<div class="line"><a id="l03796" name="l03796"></a><span class="lineno"> 3796</span> sector == sectors_ - 1 ? sweep_indices.end()</div>
|
|
<div class="line"><a id="l03797" name="l03797"></a><span class="lineno"> 3797</span> : sweep_indices.begin() + (sector + 1) * size;</div>
|
|
<div class="line"><a id="l03798" name="l03798"></a><span class="lineno"> 3798</span> std::sort(begin, <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>, SweepIndexAngleComparator);</div>
|
|
<div class="line"><a id="l03799" name="l03799"></a><span class="lineno"> 3799</span> }</div>
|
|
<div class="line"><a id="l03800" name="l03800"></a><span class="lineno"> 3800</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> SweepIndex& sweep_index : sweep_indices) {</div>
|
|
<div class="line"><a id="l03801" name="l03801"></a><span class="lineno"> 3801</span> indices->push_back(sweep_index.index);</div>
|
|
<div class="line"><a id="l03802" name="l03802"></a><span class="lineno"> 3802</span> }</div>
|
|
<div class="line"><a id="l03803" name="l03803"></a><span class="lineno"> 3803</span>}</div>
|
|
<div class="line"><a id="l03804" name="l03804"></a><span class="lineno"> 3804</span> </div>
|
|
<div class="line"><a id="l03805" name="l03805"></a><span class="lineno"> 3805</span><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l03806" name="l03806"></a><span class="lineno"> 3806</span> </div>
|
|
<div class="line"><a id="l03807" name="l03807"></a><span class="lineno"> 3807</span><span class="keyword">struct </span>Link {</div>
|
|
<div class="line"><a id="l03808" name="l03808"></a><span class="lineno"> 3808</span> Link(std::pair<int, int> <a class="code hl_variable" href="routing__search_8cc.html#a6824c3bafe148ed277f7c1f8013ab022">link</a>, <span class="keywordtype">double</span> <a class="code hl_variable" href="routing__search_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>, <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="l03809" name="l03809"></a><span class="lineno"> 3809</span> int64_t <a class="code hl_variable" href="routing__search_8cc.html#a9b1b0455b5848770f087b1a4bd5ae474">start_depot</a>, int64_t <a class="code hl_variable" href="routing__search_8cc.html#ad5c4ff858135d200263f4be8c3d7c4dd">end_depot</a>)</div>
|
|
<div class="line"><a id="l03810" name="l03810"></a><span class="lineno"> 3810</span> : <a class="code hl_variable" href="routing__search_8cc.html#a6824c3bafe148ed277f7c1f8013ab022">link</a>(<a class="code hl_variable" href="routing__search_8cc.html#a6824c3bafe148ed277f7c1f8013ab022">link</a>),</div>
|
|
<div class="line"><a id="l03811" name="l03811"></a><span class="lineno"> 3811</span> <a class="code hl_variable" href="routing__search_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>(<a class="code hl_variable" href="routing__search_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>),</div>
|
|
<div class="line"><a id="l03812" name="l03812"></a><span class="lineno"> 3812</span> <a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a>(<a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a>),</div>
|
|
<div class="line"><a id="l03813" name="l03813"></a><span class="lineno"> 3813</span> <a class="code hl_variable" href="routing__search_8cc.html#a9b1b0455b5848770f087b1a4bd5ae474">start_depot</a>(<a class="code hl_variable" href="routing__search_8cc.html#a9b1b0455b5848770f087b1a4bd5ae474">start_depot</a>),</div>
|
|
<div class="line"><a id="l03814" name="l03814"></a><span class="lineno"> 3814</span> <a class="code hl_variable" href="routing__search_8cc.html#ad5c4ff858135d200263f4be8c3d7c4dd">end_depot</a>(<a class="code hl_variable" href="routing__search_8cc.html#ad5c4ff858135d200263f4be8c3d7c4dd">end_depot</a>) {}</div>
|
|
<div class="line"><a id="l03815" name="l03815"></a><span class="lineno"> 3815</span> ~Link() {}</div>
|
|
<div class="line"><a id="l03816" name="l03816"></a><span class="lineno"> 3816</span> </div>
|
|
<div class="line"><a id="l03817" name="l03817"></a><span class="lineno"><a class="line" href="routing__search_8cc.html#a6824c3bafe148ed277f7c1f8013ab022"> 3817</a></span> std::pair<int, int> <a class="code hl_variable" href="routing__search_8cc.html#a6824c3bafe148ed277f7c1f8013ab022">link</a>;</div>
|
|
<div class="line"><a id="l03818" name="l03818"></a><span class="lineno"><a class="line" href="routing__search_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514"> 3818</a></span> int64_t <a class="code hl_variable" href="routing__search_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>;</div>
|
|
<div class="line"><a id="l03819" name="l03819"></a><span class="lineno"><a class="line" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df"> 3819</a></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="l03820" name="l03820"></a><span class="lineno"><a class="line" href="routing__search_8cc.html#a9b1b0455b5848770f087b1a4bd5ae474"> 3820</a></span> int64_t <a class="code hl_variable" href="routing__search_8cc.html#a9b1b0455b5848770f087b1a4bd5ae474">start_depot</a>;</div>
|
|
<div class="line"><a id="l03821" name="l03821"></a><span class="lineno"><a class="line" href="routing__search_8cc.html#ad5c4ff858135d200263f4be8c3d7c4dd"> 3821</a></span> int64_t <a class="code hl_variable" href="routing__search_8cc.html#ad5c4ff858135d200263f4be8c3d7c4dd">end_depot</a>;</div>
|
|
<div class="line"><a id="l03822" name="l03822"></a><span class="lineno"> 3822</span>};</div>
|
|
<div class="line"><a id="l03823" name="l03823"></a><span class="lineno"> 3823</span> </div>
|
|
<div class="line"><a id="l03824" name="l03824"></a><span class="lineno"> 3824</span><span class="comment">// The RouteConstructor creates the routes of a VRP instance subject to its</span></div>
|
|
<div class="line"><a id="l03825" name="l03825"></a><span class="lineno"> 3825</span><span class="comment">// constraints by iterating on a list of arcs appearing in descending order</span></div>
|
|
<div class="line"><a id="l03826" name="l03826"></a><span class="lineno"> 3826</span><span class="comment">// of priority.</span></div>
|
|
<div class="line"><a id="l03827" name="l03827"></a><span class="lineno"> 3827</span><span class="comment">// TODO(user): Use the dimension class in this class.</span></div>
|
|
<div class="line"><a id="l03828" name="l03828"></a><span class="lineno"> 3828</span><span class="comment">// TODO(user): Add support for vehicle-dependent dimension transits.</span></div>
|
|
<div class="line"><a id="l03829" name="l03829"></a><span class="lineno"> 3829</span><span class="keyword">class </span>RouteConstructor {</div>
|
|
<div class="line"><a id="l03830" name="l03830"></a><span class="lineno"> 3830</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l03831" name="l03831"></a><span class="lineno"> 3831</span> RouteConstructor(Assignment* <span class="keyword">const</span> assignment, RoutingModel* <span class="keyword">const</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div>
|
|
<div class="line"><a id="l03832" name="l03832"></a><span class="lineno"> 3832</span> <span class="keywordtype">bool</span> check_assignment, int64_t num_indices,</div>
|
|
<div class="line"><a id="l03833" name="l03833"></a><span class="lineno"> 3833</span> <span class="keyword">const</span> std::vector<Link>& links_list)</div>
|
|
<div class="line"><a id="l03834" name="l03834"></a><span class="lineno"> 3834</span> : assignment_(assignment),</div>
|
|
<div class="line"><a id="l03835" name="l03835"></a><span class="lineno"> 3835</span> model_(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>),</div>
|
|
<div class="line"><a id="l03836" name="l03836"></a><span class="lineno"> 3836</span> check_assignment_(check_assignment),</div>
|
|
<div class="line"><a id="l03837" name="l03837"></a><span class="lineno"> 3837</span> solver_(model_->solver()),</div>
|
|
<div class="line"><a id="l03838" name="l03838"></a><span class="lineno"> 3838</span> num_indices_(num_indices),</div>
|
|
<div class="line"><a id="l03839" name="l03839"></a><span class="lineno"> 3839</span> links_list_(links_list),</div>
|
|
<div class="line"><a id="l03840" name="l03840"></a><span class="lineno"> 3840</span> nexts_(model_->Nexts()),</div>
|
|
<div class="line"><a id="l03841" name="l03841"></a><span class="lineno"> 3841</span> in_route_(num_indices_, -1),</div>
|
|
<div class="line"><a id="l03842" name="l03842"></a><span class="lineno"> 3842</span> final_routes_(),</div>
|
|
<div class="line"><a id="l03843" name="l03843"></a><span class="lineno"> 3843</span> index_to_chain_index_(num_indices, -1),</div>
|
|
<div class="line"><a id="l03844" name="l03844"></a><span class="lineno"> 3844</span> index_to_vehicle_class_index_(num_indices, -1) {</div>
|
|
<div class="line"><a id="l03845" name="l03845"></a><span class="lineno"> 3845</span> {</div>
|
|
<div class="line"><a id="l03846" name="l03846"></a><span class="lineno"> 3846</span> <span class="keyword">const</span> std::vector<std::string> dimension_names =</div>
|
|
<div class="line"><a id="l03847" name="l03847"></a><span class="lineno"> 3847</span> model_->GetAllDimensionNames();</div>
|
|
<div class="line"><a id="l03848" name="l03848"></a><span class="lineno"> 3848</span> dimensions_.assign(dimension_names.size(), <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l03849" name="l03849"></a><span class="lineno"> 3849</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < dimension_names.size(); ++i) {</div>
|
|
<div class="line"><a id="l03850" name="l03850"></a><span class="lineno"> 3850</span> dimensions_[i] = &model_->GetDimensionOrDie(dimension_names[i]);</div>
|
|
<div class="line"><a id="l03851" name="l03851"></a><span class="lineno"> 3851</span> }</div>
|
|
<div class="line"><a id="l03852" name="l03852"></a><span class="lineno"> 3852</span> }</div>
|
|
<div class="line"><a id="l03853" name="l03853"></a><span class="lineno"> 3853</span> <a class="code hl_variable" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>.resize(dimensions_.size());</div>
|
|
<div class="line"><a id="l03854" name="l03854"></a><span class="lineno"> 3854</span> <span class="keywordflow">for</span> (std::vector<int64_t>& cumuls : <a class="code hl_variable" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>) {</div>
|
|
<div class="line"><a id="l03855" name="l03855"></a><span class="lineno"> 3855</span> cumuls.resize(num_indices_);</div>
|
|
<div class="line"><a id="l03856" name="l03856"></a><span class="lineno"> 3856</span> }</div>
|
|
<div class="line"><a id="l03857" name="l03857"></a><span class="lineno"> 3857</span> new_possible_cumuls_.resize(dimensions_.size());</div>
|
|
<div class="line"><a id="l03858" name="l03858"></a><span class="lineno"> 3858</span> }</div>
|
|
<div class="line"><a id="l03859" name="l03859"></a><span class="lineno"> 3859</span> </div>
|
|
<div class="line"><a id="l03860" name="l03860"></a><span class="lineno"> 3860</span> ~RouteConstructor() {}</div>
|
|
<div class="line"><a id="l03861" name="l03861"></a><span class="lineno"> 3861</span> </div>
|
|
<div class="line"><a id="l03862" name="l03862"></a><span class="lineno"> 3862</span> <span class="keywordtype">void</span> Construct() {</div>
|
|
<div class="line"><a id="l03863" name="l03863"></a><span class="lineno"> 3863</span> model_->solver()->TopPeriodicCheck();</div>
|
|
<div class="line"><a id="l03864" name="l03864"></a><span class="lineno"> 3864</span> <span class="comment">// Initial State: Each order is served by its own vehicle.</span></div>
|
|
<div class="line"><a id="l03865" name="l03865"></a><span class="lineno"> 3865</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a> = 0; <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a> < num_indices_; ++<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>) {</div>
|
|
<div class="line"><a id="l03866" name="l03866"></a><span class="lineno"> 3866</span> <span class="keywordflow">if</span> (!model_->IsStart(<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>) && !model_->IsEnd(<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>)) {</div>
|
|
<div class="line"><a id="l03867" name="l03867"></a><span class="lineno"> 3867</span> std::vector<int> route(1, <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>);</div>
|
|
<div class="line"><a id="l03868" name="l03868"></a><span class="lineno"> 3868</span> routes_.push_back(route);</div>
|
|
<div class="line"><a id="l03869" name="l03869"></a><span class="lineno"> 3869</span> in_route_[<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>] = routes_.size() - 1;</div>
|
|
<div class="line"><a id="l03870" name="l03870"></a><span class="lineno"> 3870</span> }</div>
|
|
<div class="line"><a id="l03871" name="l03871"></a><span class="lineno"> 3871</span> }</div>
|
|
<div class="line"><a id="l03872" name="l03872"></a><span class="lineno"> 3872</span> </div>
|
|
<div class="line"><a id="l03873" name="l03873"></a><span class="lineno"> 3873</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> Link& <a class="code hl_variable" href="routing__search_8cc.html#a6824c3bafe148ed277f7c1f8013ab022">link</a> : links_list_) {</div>
|
|
<div class="line"><a id="l03874" name="l03874"></a><span class="lineno"> 3874</span> model_->solver()->TopPeriodicCheck();</div>
|
|
<div class="line"><a id="l03875" name="l03875"></a><span class="lineno"> 3875</span> <span class="keyword">const</span> <span class="keywordtype">int</span> index1 = <a class="code hl_variable" href="routing__search_8cc.html#a6824c3bafe148ed277f7c1f8013ab022">link</a>.link.first;</div>
|
|
<div class="line"><a id="l03876" name="l03876"></a><span class="lineno"> 3876</span> <span class="keyword">const</span> <span class="keywordtype">int</span> index2 = <a class="code hl_variable" href="routing__search_8cc.html#a6824c3bafe148ed277f7c1f8013ab022">link</a>.link.second;</div>
|
|
<div class="line"><a id="l03877" name="l03877"></a><span class="lineno"> 3877</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> = <a class="code hl_variable" href="routing__search_8cc.html#a6824c3bafe148ed277f7c1f8013ab022">link</a>.vehicle_class;</div>
|
|
<div class="line"><a id="l03878" name="l03878"></a><span class="lineno"> 3878</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="routing__search_8cc.html#a9b1b0455b5848770f087b1a4bd5ae474">start_depot</a> = <a class="code hl_variable" href="routing__search_8cc.html#a6824c3bafe148ed277f7c1f8013ab022">link</a>.start_depot;</div>
|
|
<div class="line"><a id="l03879" name="l03879"></a><span class="lineno"> 3879</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="routing__search_8cc.html#ad5c4ff858135d200263f4be8c3d7c4dd">end_depot</a> = <a class="code hl_variable" href="routing__search_8cc.html#a6824c3bafe148ed277f7c1f8013ab022">link</a>.end_depot;</div>
|
|
<div class="line"><a id="l03880" name="l03880"></a><span class="lineno"> 3880</span> </div>
|
|
<div class="line"><a id="l03881" name="l03881"></a><span class="lineno"> 3881</span> <span class="comment">// Initialisation of cumuls_ if the indices are encountered for first time</span></div>
|
|
<div class="line"><a id="l03882" name="l03882"></a><span class="lineno"> 3882</span> <span class="keywordflow">if</span> (index_to_vehicle_class_index_[index1] < 0) {</div>
|
|
<div class="line"><a id="l03883" name="l03883"></a><span class="lineno"> 3883</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> dimension_index = 0; dimension_index < dimensions_.size();</div>
|
|
<div class="line"><a id="l03884" name="l03884"></a><span class="lineno"> 3884</span> ++dimension_index) {</div>
|
|
<div class="line"><a id="l03885" name="l03885"></a><span class="lineno"> 3885</span> <a class="code hl_variable" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[dimension_index][index1] =</div>
|
|
<div class="line"><a id="l03886" name="l03886"></a><span class="lineno"> 3886</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(dimensions_[dimension_index]->GetTransitValue(</div>
|
|
<div class="line"><a id="l03887" name="l03887"></a><span class="lineno"> 3887</span> <a class="code hl_variable" href="routing__search_8cc.html#a9b1b0455b5848770f087b1a4bd5ae474">start_depot</a>, index1, 0),</div>
|
|
<div class="line"><a id="l03888" name="l03888"></a><span class="lineno"> 3888</span> dimensions_[dimension_index]->CumulVar(index1)->Min());</div>
|
|
<div class="line"><a id="l03889" name="l03889"></a><span class="lineno"> 3889</span> }</div>
|
|
<div class="line"><a id="l03890" name="l03890"></a><span class="lineno"> 3890</span> }</div>
|
|
<div class="line"><a id="l03891" name="l03891"></a><span class="lineno"> 3891</span> <span class="keywordflow">if</span> (index_to_vehicle_class_index_[index2] < 0) {</div>
|
|
<div class="line"><a id="l03892" name="l03892"></a><span class="lineno"> 3892</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> dimension_index = 0; dimension_index < dimensions_.size();</div>
|
|
<div class="line"><a id="l03893" name="l03893"></a><span class="lineno"> 3893</span> ++dimension_index) {</div>
|
|
<div class="line"><a id="l03894" name="l03894"></a><span class="lineno"> 3894</span> <a class="code hl_variable" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[dimension_index][index2] =</div>
|
|
<div class="line"><a id="l03895" name="l03895"></a><span class="lineno"> 3895</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(dimensions_[dimension_index]->GetTransitValue(</div>
|
|
<div class="line"><a id="l03896" name="l03896"></a><span class="lineno"> 3896</span> <a class="code hl_variable" href="routing__search_8cc.html#a9b1b0455b5848770f087b1a4bd5ae474">start_depot</a>, index2, 0),</div>
|
|
<div class="line"><a id="l03897" name="l03897"></a><span class="lineno"> 3897</span> dimensions_[dimension_index]->CumulVar(index2)->Min());</div>
|
|
<div class="line"><a id="l03898" name="l03898"></a><span class="lineno"> 3898</span> }</div>
|
|
<div class="line"><a id="l03899" name="l03899"></a><span class="lineno"> 3899</span> }</div>
|
|
<div class="line"><a id="l03900" name="l03900"></a><span class="lineno"> 3900</span> </div>
|
|
<div class="line"><a id="l03901" name="l03901"></a><span class="lineno"> 3901</span> <span class="keyword">const</span> <span class="keywordtype">int</span> route_index1 = in_route_[index1];</div>
|
|
<div class="line"><a id="l03902" name="l03902"></a><span class="lineno"> 3902</span> <span class="keyword">const</span> <span class="keywordtype">int</span> route_index2 = in_route_[index2];</div>
|
|
<div class="line"><a id="l03903" name="l03903"></a><span class="lineno"> 3903</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> merge =</div>
|
|
<div class="line"><a id="l03904" name="l03904"></a><span class="lineno"> 3904</span> route_index1 >= 0 && route_index2 >= 0 &&</div>
|
|
<div class="line"><a id="l03905" name="l03905"></a><span class="lineno"> 3905</span> FeasibleMerge(routes_[route_index1], routes_[route_index2], index1,</div>
|
|
<div class="line"><a id="l03906" name="l03906"></a><span class="lineno"> 3906</span> index2, route_index1, route_index2, <a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a>,</div>
|
|
<div class="line"><a id="l03907" name="l03907"></a><span class="lineno"> 3907</span> <a class="code hl_variable" href="routing__search_8cc.html#a9b1b0455b5848770f087b1a4bd5ae474">start_depot</a>, <a class="code hl_variable" href="routing__search_8cc.html#ad5c4ff858135d200263f4be8c3d7c4dd">end_depot</a>);</div>
|
|
<div class="line"><a id="l03908" name="l03908"></a><span class="lineno"> 3908</span> <span class="keywordflow">if</span> (Merge(merge, route_index1, route_index2)) {</div>
|
|
<div class="line"><a id="l03909" name="l03909"></a><span class="lineno"> 3909</span> index_to_vehicle_class_index_[index1] = <a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a>;</div>
|
|
<div class="line"><a id="l03910" name="l03910"></a><span class="lineno"> 3910</span> index_to_vehicle_class_index_[index2] = <a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a>;</div>
|
|
<div class="line"><a id="l03911" name="l03911"></a><span class="lineno"> 3911</span> }</div>
|
|
<div class="line"><a id="l03912" name="l03912"></a><span class="lineno"> 3912</span> }</div>
|
|
<div class="line"><a id="l03913" name="l03913"></a><span class="lineno"> 3913</span> </div>
|
|
<div class="line"><a id="l03914" name="l03914"></a><span class="lineno"> 3914</span> model_->solver()->TopPeriodicCheck();</div>
|
|
<div class="line"><a id="l03915" name="l03915"></a><span class="lineno"> 3915</span> <span class="comment">// Beyond this point not checking limits anymore as the rest of the code is</span></div>
|
|
<div class="line"><a id="l03916" name="l03916"></a><span class="lineno"> 3916</span> <span class="comment">// linear and that given we managed to build a solution would be stupid to</span></div>
|
|
<div class="line"><a id="l03917" name="l03917"></a><span class="lineno"> 3917</span> <span class="comment">// drop it now.</span></div>
|
|
<div class="line"><a id="l03918" name="l03918"></a><span class="lineno"> 3918</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> chain_index = 0; chain_index < chains_.size(); ++chain_index) {</div>
|
|
<div class="line"><a id="l03919" name="l03919"></a><span class="lineno"> 3919</span> <span class="keywordflow">if</span> (!deleted_chains_.contains(chain_index)) {</div>
|
|
<div class="line"><a id="l03920" name="l03920"></a><span class="lineno"> 3920</span> final_chains_.push_back(chains_[chain_index]);</div>
|
|
<div class="line"><a id="l03921" name="l03921"></a><span class="lineno"> 3921</span> }</div>
|
|
<div class="line"><a id="l03922" name="l03922"></a><span class="lineno"> 3922</span> }</div>
|
|
<div class="line"><a id="l03923" name="l03923"></a><span class="lineno"> 3923</span> std::sort(final_chains_.begin(), final_chains_.end(), ChainComparator);</div>
|
|
<div class="line"><a id="l03924" name="l03924"></a><span class="lineno"> 3924</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> route_index = 0; route_index < routes_.size(); ++route_index) {</div>
|
|
<div class="line"><a id="l03925" name="l03925"></a><span class="lineno"> 3925</span> <span class="keywordflow">if</span> (!deleted_routes_.contains(route_index)) {</div>
|
|
<div class="line"><a id="l03926" name="l03926"></a><span class="lineno"> 3926</span> final_routes_.push_back(routes_[route_index]);</div>
|
|
<div class="line"><a id="l03927" name="l03927"></a><span class="lineno"> 3927</span> }</div>
|
|
<div class="line"><a id="l03928" name="l03928"></a><span class="lineno"> 3928</span> }</div>
|
|
<div class="line"><a id="l03929" name="l03929"></a><span class="lineno"> 3929</span> std::sort(final_routes_.begin(), final_routes_.end(), RouteComparator);</div>
|
|
<div class="line"><a id="l03930" name="l03930"></a><span class="lineno"> 3930</span> </div>
|
|
<div class="line"><a id="l03931" name="l03931"></a><span class="lineno"> 3931</span> <span class="keyword">const</span> <span class="keywordtype">int</span> extra_vehicles = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(</div>
|
|
<div class="line"><a id="l03932" name="l03932"></a><span class="lineno"> 3932</span> 0, <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(final_chains_.size()) - model_->vehicles());</div>
|
|
<div class="line"><a id="l03933" name="l03933"></a><span class="lineno"> 3933</span> <span class="comment">// Bind the Start and End of each chain</span></div>
|
|
<div class="line"><a id="l03934" name="l03934"></a><span class="lineno"> 3934</span> <span class="keywordtype">int</span> chain_index = 0;</div>
|
|
<div class="line"><a id="l03935" name="l03935"></a><span class="lineno"> 3935</span> <span class="keywordflow">for</span> (chain_index = extra_vehicles; chain_index < final_chains_.size();</div>
|
|
<div class="line"><a id="l03936" name="l03936"></a><span class="lineno"> 3936</span> ++chain_index) {</div>
|
|
<div class="line"><a id="l03937" name="l03937"></a><span class="lineno"> 3937</span> <span class="keywordflow">if</span> (chain_index - extra_vehicles >= model_->vehicles()) {</div>
|
|
<div class="line"><a id="l03938" name="l03938"></a><span class="lineno"> 3938</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l03939" name="l03939"></a><span class="lineno"> 3939</span> }</div>
|
|
<div class="line"><a id="l03940" name="l03940"></a><span class="lineno"> 3940</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a> = final_chains_[chain_index].head;</div>
|
|
<div class="line"><a id="l03941" name="l03941"></a><span class="lineno"> 3941</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a> = final_chains_[chain_index].tail;</div>
|
|
<div class="line"><a id="l03942" name="l03942"></a><span class="lineno"> 3942</span> assignment_->Add(</div>
|
|
<div class="line"><a id="l03943" name="l03943"></a><span class="lineno"> 3943</span> model_->NextVar(model_->Start(chain_index - extra_vehicles)));</div>
|
|
<div class="line"><a id="l03944" name="l03944"></a><span class="lineno"> 3944</span> assignment_->SetValue(</div>
|
|
<div class="line"><a id="l03945" name="l03945"></a><span class="lineno"> 3945</span> model_->NextVar(model_->Start(chain_index - extra_vehicles)), <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>);</div>
|
|
<div class="line"><a id="l03946" name="l03946"></a><span class="lineno"> 3946</span> assignment_->Add(nexts_[<a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>]);</div>
|
|
<div class="line"><a id="l03947" name="l03947"></a><span class="lineno"> 3947</span> assignment_->SetValue(nexts_[<a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>],</div>
|
|
<div class="line"><a id="l03948" name="l03948"></a><span class="lineno"> 3948</span> model_->End(chain_index - extra_vehicles));</div>
|
|
<div class="line"><a id="l03949" name="l03949"></a><span class="lineno"> 3949</span> }</div>
|
|
<div class="line"><a id="l03950" name="l03950"></a><span class="lineno"> 3950</span> </div>
|
|
<div class="line"><a id="l03951" name="l03951"></a><span class="lineno"> 3951</span> <span class="comment">// Create the single order routes</span></div>
|
|
<div class="line"><a id="l03952" name="l03952"></a><span class="lineno"> 3952</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> route_index = 0; route_index < final_routes_.size();</div>
|
|
<div class="line"><a id="l03953" name="l03953"></a><span class="lineno"> 3953</span> ++route_index) {</div>
|
|
<div class="line"><a id="l03954" name="l03954"></a><span class="lineno"> 3954</span> <span class="keywordflow">if</span> (chain_index - extra_vehicles >= model_->vehicles()) {</div>
|
|
<div class="line"><a id="l03955" name="l03955"></a><span class="lineno"> 3955</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l03956" name="l03956"></a><span class="lineno"> 3956</span> }</div>
|
|
<div class="line"><a id="l03957" name="l03957"></a><span class="lineno"> 3957</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(route_index, final_routes_.size());</div>
|
|
<div class="line"><a id="l03958" name="l03958"></a><span class="lineno"> 3958</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="routing__search_8cc.html#a20358970b1abaf992eb85e071e454653">head</a> = final_routes_[route_index].front();</div>
|
|
<div class="line"><a id="l03959" name="l03959"></a><span class="lineno"> 3959</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="routing__search_8cc.html#aff39d864a6594bc5f4a5e365282e00fe">tail</a> = final_routes_[route_index].back();</div>
|
|
<div class="line"><a id="l03960" name="l03960"></a><span class="lineno"> 3960</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="routing__search_8cc.html#a20358970b1abaf992eb85e071e454653">head</a> == <a class="code hl_variable" href="routing__search_8cc.html#aff39d864a6594bc5f4a5e365282e00fe">tail</a> && head < model_->Size()) {</div>
|
|
<div class="line"><a id="l03961" name="l03961"></a><span class="lineno"> 3961</span> assignment_->Add(</div>
|
|
<div class="line"><a id="l03962" name="l03962"></a><span class="lineno"> 3962</span> model_->NextVar(model_->Start(chain_index - extra_vehicles)));</div>
|
|
<div class="line"><a id="l03963" name="l03963"></a><span class="lineno"> 3963</span> assignment_->SetValue(</div>
|
|
<div class="line"><a id="l03964" name="l03964"></a><span class="lineno"> 3964</span> model_->NextVar(model_->Start(chain_index - extra_vehicles)), <a class="code hl_variable" href="routing__search_8cc.html#a20358970b1abaf992eb85e071e454653">head</a>);</div>
|
|
<div class="line"><a id="l03965" name="l03965"></a><span class="lineno"> 3965</span> assignment_->Add(nexts_[<a class="code hl_variable" href="routing__search_8cc.html#aff39d864a6594bc5f4a5e365282e00fe">tail</a>]);</div>
|
|
<div class="line"><a id="l03966" name="l03966"></a><span class="lineno"> 3966</span> assignment_->SetValue(nexts_[<a class="code hl_variable" href="routing__search_8cc.html#aff39d864a6594bc5f4a5e365282e00fe">tail</a>],</div>
|
|
<div class="line"><a id="l03967" name="l03967"></a><span class="lineno"> 3967</span> model_->End(chain_index - extra_vehicles));</div>
|
|
<div class="line"><a id="l03968" name="l03968"></a><span class="lineno"> 3968</span> ++chain_index;</div>
|
|
<div class="line"><a id="l03969" name="l03969"></a><span class="lineno"> 3969</span> }</div>
|
|
<div class="line"><a id="l03970" name="l03970"></a><span class="lineno"> 3970</span> }</div>
|
|
<div class="line"><a id="l03971" name="l03971"></a><span class="lineno"> 3971</span> </div>
|
|
<div class="line"><a id="l03972" name="l03972"></a><span class="lineno"> 3972</span> <span class="comment">// Unperformed</span></div>
|
|
<div class="line"><a id="l03973" name="l03973"></a><span class="lineno"> 3973</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a> = 0; <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a> < model_->Size(); ++<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>) {</div>
|
|
<div class="line"><a id="l03974" name="l03974"></a><span class="lineno"> 3974</span> IntVar* <span class="keyword">const</span> <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = nexts_[<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>];</div>
|
|
<div class="line"><a id="l03975" name="l03975"></a><span class="lineno"> 3975</span> <span class="keywordflow">if</span> (!assignment_->Contains(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)) {</div>
|
|
<div class="line"><a id="l03976" name="l03976"></a><span class="lineno"> 3976</span> assignment_->Add(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a id="l03977" name="l03977"></a><span class="lineno"> 3977</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>->Contains(<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>)) {</div>
|
|
<div class="line"><a id="l03978" name="l03978"></a><span class="lineno"> 3978</span> assignment_->SetValue(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>);</div>
|
|
<div class="line"><a id="l03979" name="l03979"></a><span class="lineno"> 3979</span> }</div>
|
|
<div class="line"><a id="l03980" name="l03980"></a><span class="lineno"> 3980</span> }</div>
|
|
<div class="line"><a id="l03981" name="l03981"></a><span class="lineno"> 3981</span> }</div>
|
|
<div class="line"><a id="l03982" name="l03982"></a><span class="lineno"> 3982</span> }</div>
|
|
<div class="line"><a id="l03983" name="l03983"></a><span class="lineno"> 3983</span> </div>
|
|
<div class="line"><a id="l03984" name="l03984"></a><span class="lineno"> 3984</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l03985" name="l03985"></a><span class="lineno"> 3985</span> <span class="keyword">enum</span> MergeStatus { FIRST_SECOND, SECOND_FIRST, NO_MERGE };</div>
|
|
<div class="line"><a id="l03986" name="l03986"></a><span class="lineno"> 3986</span> </div>
|
|
<div class="line"><a id="l03987" name="l03987"></a><span class="lineno"> 3987</span> <span class="keyword">struct </span>RouteSort {</div>
|
|
<div class="line"><a id="l03988" name="l03988"></a><span class="lineno"> 3988</span> <span class="keywordtype">bool</span> operator()(<span class="keyword">const</span> std::vector<int>& route1,</div>
|
|
<div class="line"><a id="l03989" name="l03989"></a><span class="lineno"> 3989</span> <span class="keyword">const</span> std::vector<int>& route2)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l03990" name="l03990"></a><span class="lineno"> 3990</span> <span class="keywordflow">return</span> (route1.size() < route2.size());</div>
|
|
<div class="line"><a id="l03991" name="l03991"></a><span class="lineno"> 3991</span> }</div>
|
|
<div class="line"><a id="l03992" name="l03992"></a><span class="lineno"> 3992</span> } RouteComparator;</div>
|
|
<div class="line"><a id="l03993" name="l03993"></a><span class="lineno"> 3993</span> </div>
|
|
<div class="line"><a id="l03994" name="l03994"></a><span class="lineno"> 3994</span> <span class="keyword">struct </span>Chain {</div>
|
|
<div class="line"><a id="l03995" name="l03995"></a><span class="lineno"><a class="line" href="routing__search_8cc.html#a20358970b1abaf992eb85e071e454653"> 3995</a></span> <span class="keywordtype">int</span> <a class="code hl_variable" href="routing__search_8cc.html#a20358970b1abaf992eb85e071e454653">head</a>;</div>
|
|
<div class="line"><a id="l03996" name="l03996"></a><span class="lineno"><a class="line" href="routing__search_8cc.html#aff39d864a6594bc5f4a5e365282e00fe"> 3996</a></span> <span class="keywordtype">int</span> <a class="code hl_variable" href="routing__search_8cc.html#aff39d864a6594bc5f4a5e365282e00fe">tail</a>;</div>
|
|
<div class="line"><a id="l03997" name="l03997"></a><span class="lineno"><a class="line" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17"> 3997</a></span> <span class="keywordtype">int</span> <a class="code hl_variable" href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a>;</div>
|
|
<div class="line"><a id="l03998" name="l03998"></a><span class="lineno"> 3998</span> };</div>
|
|
<div class="line"><a id="l03999" name="l03999"></a><span class="lineno"> 3999</span> </div>
|
|
<div class="line"><a id="l04000" name="l04000"></a><span class="lineno"> 4000</span> <span class="keyword">struct </span>ChainSort {</div>
|
|
<div class="line"><a id="l04001" name="l04001"></a><span class="lineno"> 4001</span> <span class="keywordtype">bool</span> operator()(<span class="keyword">const</span> Chain& chain1, <span class="keyword">const</span> Chain& chain2)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l04002" name="l04002"></a><span class="lineno"> 4002</span> <span class="keywordflow">return</span> (chain1.nodes < chain2.nodes);</div>
|
|
<div class="line"><a id="l04003" name="l04003"></a><span class="lineno"> 4003</span> }</div>
|
|
<div class="line"><a id="l04004" name="l04004"></a><span class="lineno"> 4004</span> } ChainComparator;</div>
|
|
<div class="line"><a id="l04005" name="l04005"></a><span class="lineno"> 4005</span> </div>
|
|
<div class="line"><a id="l04006" name="l04006"></a><span class="lineno"> 4006</span> <span class="keywordtype">bool</span> Head(<span class="keywordtype">int</span> node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l04007" name="l04007"></a><span class="lineno"> 4007</span> <span class="keywordflow">return</span> (node == routes_[in_route_[node]].front());</div>
|
|
<div class="line"><a id="l04008" name="l04008"></a><span class="lineno"> 4008</span> }</div>
|
|
<div class="line"><a id="l04009" name="l04009"></a><span class="lineno"> 4009</span> </div>
|
|
<div class="line"><a id="l04010" name="l04010"></a><span class="lineno"> 4010</span> <span class="keywordtype">bool</span> Tail(<span class="keywordtype">int</span> node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l04011" name="l04011"></a><span class="lineno"> 4011</span> <span class="keywordflow">return</span> (node == routes_[in_route_[node]].back());</div>
|
|
<div class="line"><a id="l04012" name="l04012"></a><span class="lineno"> 4012</span> }</div>
|
|
<div class="line"><a id="l04013" name="l04013"></a><span class="lineno"> 4013</span> </div>
|
|
<div class="line"><a id="l04014" name="l04014"></a><span class="lineno"> 4014</span> <span class="keywordtype">bool</span> FeasibleRoute(<span class="keyword">const</span> std::vector<int>& route, int64_t route_cumul,</div>
|
|
<div class="line"><a id="l04015" name="l04015"></a><span class="lineno"> 4015</span> <span class="keywordtype">int</span> dimension_index) {</div>
|
|
<div class="line"><a id="l04016" name="l04016"></a><span class="lineno"> 4016</span> <span class="keyword">const</span> RoutingDimension& dimension = *dimensions_[dimension_index];</div>
|
|
<div class="line"><a id="l04017" name="l04017"></a><span class="lineno"> 4017</span> std::vector<int>::const_iterator it = route.begin();</div>
|
|
<div class="line"><a id="l04018" name="l04018"></a><span class="lineno"> 4018</span> int64_t cumul = route_cumul;</div>
|
|
<div class="line"><a id="l04019" name="l04019"></a><span class="lineno"> 4019</span> <span class="keywordflow">while</span> (it != route.end()) {</div>
|
|
<div class="line"><a id="l04020" name="l04020"></a><span class="lineno"> 4020</span> <span class="keyword">const</span> <span class="keywordtype">int</span> previous = *it;</div>
|
|
<div class="line"><a id="l04021" name="l04021"></a><span class="lineno"> 4021</span> <span class="keyword">const</span> int64_t cumul_previous = cumul;</div>
|
|
<div class="line"><a id="l04022" name="l04022"></a><span class="lineno"> 4022</span> <a class="code hl_function" href="namespacegtl.html#a5c0d4dea208db4deaa285c06b78d8181">gtl::InsertOrDie</a>(&(new_possible_cumuls_[dimension_index]), previous,</div>
|
|
<div class="line"><a id="l04023" name="l04023"></a><span class="lineno"> 4023</span> cumul_previous);</div>
|
|
<div class="line"><a id="l04024" name="l04024"></a><span class="lineno"> 4024</span> ++it;</div>
|
|
<div class="line"><a id="l04025" name="l04025"></a><span class="lineno"> 4025</span> <span class="keywordflow">if</span> (it == route.end()) {</div>
|
|
<div class="line"><a id="l04026" name="l04026"></a><span class="lineno"> 4026</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l04027" name="l04027"></a><span class="lineno"> 4027</span> }</div>
|
|
<div class="line"><a id="l04028" name="l04028"></a><span class="lineno"> 4028</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = *it;</div>
|
|
<div class="line"><a id="l04029" name="l04029"></a><span class="lineno"> 4029</span> int64_t available_from_previous =</div>
|
|
<div class="line"><a id="l04030" name="l04030"></a><span class="lineno"> 4030</span> cumul_previous + dimension.GetTransitValue(previous, <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, 0);</div>
|
|
<div class="line"><a id="l04031" name="l04031"></a><span class="lineno"> 4031</span> int64_t available_cumul_next =</div>
|
|
<div class="line"><a id="l04032" name="l04032"></a><span class="lineno"> 4032</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(<a class="code hl_variable" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[dimension_index][<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>], available_from_previous);</div>
|
|
<div class="line"><a id="l04033" name="l04033"></a><span class="lineno"> 4033</span> </div>
|
|
<div class="line"><a id="l04034" name="l04034"></a><span class="lineno"> 4034</span> <span class="keyword">const</span> int64_t slack = available_cumul_next - available_from_previous;</div>
|
|
<div class="line"><a id="l04035" name="l04035"></a><span class="lineno"> 4035</span> <span class="keywordflow">if</span> (slack > dimension.SlackVar(previous)->Max()) {</div>
|
|
<div class="line"><a id="l04036" name="l04036"></a><span class="lineno"> 4036</span> available_cumul_next =</div>
|
|
<div class="line"><a id="l04037" name="l04037"></a><span class="lineno"> 4037</span> available_from_previous + dimension.SlackVar(previous)->Max();</div>
|
|
<div class="line"><a id="l04038" name="l04038"></a><span class="lineno"> 4038</span> }</div>
|
|
<div class="line"><a id="l04039" name="l04039"></a><span class="lineno"> 4039</span> </div>
|
|
<div class="line"><a id="l04040" name="l04040"></a><span class="lineno"> 4040</span> <span class="keywordflow">if</span> (available_cumul_next > dimension.CumulVar(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)->Max()) {</div>
|
|
<div class="line"><a id="l04041" name="l04041"></a><span class="lineno"> 4041</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l04042" name="l04042"></a><span class="lineno"> 4042</span> }</div>
|
|
<div class="line"><a id="l04043" name="l04043"></a><span class="lineno"> 4043</span> <span class="keywordflow">if</span> (available_cumul_next <= <a class="code hl_variable" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[dimension_index][<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>]) {</div>
|
|
<div class="line"><a id="l04044" name="l04044"></a><span class="lineno"> 4044</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l04045" name="l04045"></a><span class="lineno"> 4045</span> }</div>
|
|
<div class="line"><a id="l04046" name="l04046"></a><span class="lineno"> 4046</span> cumul = available_cumul_next;</div>
|
|
<div class="line"><a id="l04047" name="l04047"></a><span class="lineno"> 4047</span> }</div>
|
|
<div class="line"><a id="l04048" name="l04048"></a><span class="lineno"> 4048</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l04049" name="l04049"></a><span class="lineno"> 4049</span> }</div>
|
|
<div class="line"><a id="l04050" name="l04050"></a><span class="lineno"> 4050</span> </div>
|
|
<div class="line"><a id="l04051" name="l04051"></a><span class="lineno"> 4051</span> <span class="keywordtype">bool</span> CheckRouteConnection(<span class="keyword">const</span> std::vector<int>& route1,</div>
|
|
<div class="line"><a id="l04052" name="l04052"></a><span class="lineno"> 4052</span> <span class="keyword">const</span> std::vector<int>& route2, <span class="keywordtype">int</span> dimension_index,</div>
|
|
<div class="line"><a id="l04053" name="l04053"></a><span class="lineno"> 4053</span> int64_t <a class="code hl_variable" href="routing__search_8cc.html#a9b1b0455b5848770f087b1a4bd5ae474">start_depot</a>, int64_t <a class="code hl_variable" href="routing__search_8cc.html#ad5c4ff858135d200263f4be8c3d7c4dd">end_depot</a>) {</div>
|
|
<div class="line"><a id="l04054" name="l04054"></a><span class="lineno"> 4054</span> <span class="keyword">const</span> <span class="keywordtype">int</span> tail1 = route1.back();</div>
|
|
<div class="line"><a id="l04055" name="l04055"></a><span class="lineno"> 4055</span> <span class="keyword">const</span> <span class="keywordtype">int</span> head2 = route2.front();</div>
|
|
<div class="line"><a id="l04056" name="l04056"></a><span class="lineno"> 4056</span> <span class="keyword">const</span> <span class="keywordtype">int</span> tail2 = route2.back();</div>
|
|
<div class="line"><a id="l04057" name="l04057"></a><span class="lineno"> 4057</span> <span class="keyword">const</span> RoutingDimension& dimension = *dimensions_[dimension_index];</div>
|
|
<div class="line"><a id="l04058" name="l04058"></a><span class="lineno"> 4058</span> <span class="keywordtype">int</span> non_depot_node = -1;</div>
|
|
<div class="line"><a id="l04059" name="l04059"></a><span class="lineno"> 4059</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < num_indices_; ++node) {</div>
|
|
<div class="line"><a id="l04060" name="l04060"></a><span class="lineno"> 4060</span> <span class="keywordflow">if</span> (!model_->IsStart(node) && !model_->IsEnd(node)) {</div>
|
|
<div class="line"><a id="l04061" name="l04061"></a><span class="lineno"> 4061</span> non_depot_node = node;</div>
|
|
<div class="line"><a id="l04062" name="l04062"></a><span class="lineno"> 4062</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l04063" name="l04063"></a><span class="lineno"> 4063</span> }</div>
|
|
<div class="line"><a id="l04064" name="l04064"></a><span class="lineno"> 4064</span> }</div>
|
|
<div class="line"><a id="l04065" name="l04065"></a><span class="lineno"> 4065</span> <a class="code hl_define" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(non_depot_node, 0);</div>
|
|
<div class="line"><a id="l04066" name="l04066"></a><span class="lineno"> 4066</span> <span class="keyword">const</span> int64_t depot_threshold =</div>
|
|
<div class="line"><a id="l04067" name="l04067"></a><span class="lineno"> 4067</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(dimension.SlackVar(non_depot_node)->Max(),</div>
|
|
<div class="line"><a id="l04068" name="l04068"></a><span class="lineno"> 4068</span> dimension.CumulVar(non_depot_node)->Max());</div>
|
|
<div class="line"><a id="l04069" name="l04069"></a><span class="lineno"> 4069</span> </div>
|
|
<div class="line"><a id="l04070" name="l04070"></a><span class="lineno"> 4070</span> int64_t available_from_tail1 = <a class="code hl_variable" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[dimension_index][tail1] +</div>
|
|
<div class="line"><a id="l04071" name="l04071"></a><span class="lineno"> 4071</span> dimension.GetTransitValue(tail1, head2, 0);</div>
|
|
<div class="line"><a id="l04072" name="l04072"></a><span class="lineno"> 4072</span> int64_t new_available_cumul_head2 =</div>
|
|
<div class="line"><a id="l04073" name="l04073"></a><span class="lineno"> 4073</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(<a class="code hl_variable" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[dimension_index][head2], available_from_tail1);</div>
|
|
<div class="line"><a id="l04074" name="l04074"></a><span class="lineno"> 4074</span> </div>
|
|
<div class="line"><a id="l04075" name="l04075"></a><span class="lineno"> 4075</span> <span class="keyword">const</span> int64_t slack = new_available_cumul_head2 - available_from_tail1;</div>
|
|
<div class="line"><a id="l04076" name="l04076"></a><span class="lineno"> 4076</span> <span class="keywordflow">if</span> (slack > dimension.SlackVar(tail1)->Max()) {</div>
|
|
<div class="line"><a id="l04077" name="l04077"></a><span class="lineno"> 4077</span> new_available_cumul_head2 =</div>
|
|
<div class="line"><a id="l04078" name="l04078"></a><span class="lineno"> 4078</span> available_from_tail1 + dimension.SlackVar(tail1)->Max();</div>
|
|
<div class="line"><a id="l04079" name="l04079"></a><span class="lineno"> 4079</span> }</div>
|
|
<div class="line"><a id="l04080" name="l04080"></a><span class="lineno"> 4080</span> </div>
|
|
<div class="line"><a id="l04081" name="l04081"></a><span class="lineno"> 4081</span> <span class="keywordtype">bool</span> feasible_route = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l04082" name="l04082"></a><span class="lineno"> 4082</span> <span class="keywordflow">if</span> (new_available_cumul_head2 > dimension.CumulVar(head2)->Max()) {</div>
|
|
<div class="line"><a id="l04083" name="l04083"></a><span class="lineno"> 4083</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l04084" name="l04084"></a><span class="lineno"> 4084</span> }</div>
|
|
<div class="line"><a id="l04085" name="l04085"></a><span class="lineno"> 4085</span> <span class="keywordflow">if</span> (new_available_cumul_head2 <= <a class="code hl_variable" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[dimension_index][head2]) {</div>
|
|
<div class="line"><a id="l04086" name="l04086"></a><span class="lineno"> 4086</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l04087" name="l04087"></a><span class="lineno"> 4087</span> }</div>
|
|
<div class="line"><a id="l04088" name="l04088"></a><span class="lineno"> 4088</span> </div>
|
|
<div class="line"><a id="l04089" name="l04089"></a><span class="lineno"> 4089</span> feasible_route =</div>
|
|
<div class="line"><a id="l04090" name="l04090"></a><span class="lineno"> 4090</span> FeasibleRoute(route2, new_available_cumul_head2, dimension_index);</div>
|
|
<div class="line"><a id="l04091" name="l04091"></a><span class="lineno"> 4091</span> <span class="keyword">const</span> int64_t new_possible_cumul_tail2 =</div>
|
|
<div class="line"><a id="l04092" name="l04092"></a><span class="lineno"> 4092</span> new_possible_cumuls_[dimension_index].contains(tail2)</div>
|
|
<div class="line"><a id="l04093" name="l04093"></a><span class="lineno"> 4093</span> ? new_possible_cumuls_[dimension_index][tail2]</div>
|
|
<div class="line"><a id="l04094" name="l04094"></a><span class="lineno"> 4094</span> : <a class="code hl_variable" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[dimension_index][tail2];</div>
|
|
<div class="line"><a id="l04095" name="l04095"></a><span class="lineno"> 4095</span> </div>
|
|
<div class="line"><a id="l04096" name="l04096"></a><span class="lineno"> 4096</span> <span class="keywordflow">if</span> (!feasible_route || (new_possible_cumul_tail2 +</div>
|
|
<div class="line"><a id="l04097" name="l04097"></a><span class="lineno"> 4097</span> dimension.GetTransitValue(tail2, <a class="code hl_variable" href="routing__search_8cc.html#ad5c4ff858135d200263f4be8c3d7c4dd">end_depot</a>, 0) ></div>
|
|
<div class="line"><a id="l04098" name="l04098"></a><span class="lineno"> 4098</span> depot_threshold)) {</div>
|
|
<div class="line"><a id="l04099" name="l04099"></a><span class="lineno"> 4099</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l04100" name="l04100"></a><span class="lineno"> 4100</span> }</div>
|
|
<div class="line"><a id="l04101" name="l04101"></a><span class="lineno"> 4101</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l04102" name="l04102"></a><span class="lineno"> 4102</span> }</div>
|
|
<div class="line"><a id="l04103" name="l04103"></a><span class="lineno"> 4103</span> </div>
|
|
<div class="line"><a id="l04104" name="l04104"></a><span class="lineno"> 4104</span> <span class="keywordtype">bool</span> FeasibleMerge(<span class="keyword">const</span> std::vector<int>& route1,</div>
|
|
<div class="line"><a id="l04105" name="l04105"></a><span class="lineno"> 4105</span> <span class="keyword">const</span> std::vector<int>& route2, <span class="keywordtype">int</span> node1, <span class="keywordtype">int</span> node2,</div>
|
|
<div class="line"><a id="l04106" name="l04106"></a><span class="lineno"> 4106</span> <span class="keywordtype">int</span> route_index1, <span class="keywordtype">int</span> route_index2, <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="l04107" name="l04107"></a><span class="lineno"> 4107</span> int64_t <a class="code hl_variable" href="routing__search_8cc.html#a9b1b0455b5848770f087b1a4bd5ae474">start_depot</a>, int64_t <a class="code hl_variable" href="routing__search_8cc.html#ad5c4ff858135d200263f4be8c3d7c4dd">end_depot</a>) {</div>
|
|
<div class="line"><a id="l04108" name="l04108"></a><span class="lineno"> 4108</span> <span class="keywordflow">if</span> ((route_index1 == route_index2) || !(Tail(node1) && Head(node2))) {</div>
|
|
<div class="line"><a id="l04109" name="l04109"></a><span class="lineno"> 4109</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l04110" name="l04110"></a><span class="lineno"> 4110</span> }</div>
|
|
<div class="line"><a id="l04111" name="l04111"></a><span class="lineno"> 4111</span> </div>
|
|
<div class="line"><a id="l04112" name="l04112"></a><span class="lineno"> 4112</span> <span class="comment">// Vehicle Class Check</span></div>
|
|
<div class="line"><a id="l04113" name="l04113"></a><span class="lineno"> 4113</span> <span class="keywordflow">if</span> (!((index_to_vehicle_class_index_[node1] == -1 &&</div>
|
|
<div class="line"><a id="l04114" name="l04114"></a><span class="lineno"> 4114</span> index_to_vehicle_class_index_[node2] == -1) ||</div>
|
|
<div class="line"><a id="l04115" name="l04115"></a><span class="lineno"> 4115</span> (index_to_vehicle_class_index_[node1] == <a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a> &&</div>
|
|
<div class="line"><a id="l04116" name="l04116"></a><span class="lineno"> 4116</span> index_to_vehicle_class_index_[node2] == -1) ||</div>
|
|
<div class="line"><a id="l04117" name="l04117"></a><span class="lineno"> 4117</span> (index_to_vehicle_class_index_[node1] == -1 &&</div>
|
|
<div class="line"><a id="l04118" name="l04118"></a><span class="lineno"> 4118</span> index_to_vehicle_class_index_[node2] == <a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a>) ||</div>
|
|
<div class="line"><a id="l04119" name="l04119"></a><span class="lineno"> 4119</span> (index_to_vehicle_class_index_[node1] == <a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a> &&</div>
|
|
<div class="line"><a id="l04120" name="l04120"></a><span class="lineno"> 4120</span> index_to_vehicle_class_index_[node2] == <a class="code hl_variable" href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a>))) {</div>
|
|
<div class="line"><a id="l04121" name="l04121"></a><span class="lineno"> 4121</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l04122" name="l04122"></a><span class="lineno"> 4122</span> }</div>
|
|
<div class="line"><a id="l04123" name="l04123"></a><span class="lineno"> 4123</span> </div>
|
|
<div class="line"><a id="l04124" name="l04124"></a><span class="lineno"> 4124</span> <span class="comment">// Check Route1 -> Route2 connection for every dimension</span></div>
|
|
<div class="line"><a id="l04125" name="l04125"></a><span class="lineno"> 4125</span> <span class="keywordtype">bool</span> merge = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l04126" name="l04126"></a><span class="lineno"> 4126</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> dimension_index = 0; dimension_index < dimensions_.size();</div>
|
|
<div class="line"><a id="l04127" name="l04127"></a><span class="lineno"> 4127</span> ++dimension_index) {</div>
|
|
<div class="line"><a id="l04128" name="l04128"></a><span class="lineno"> 4128</span> new_possible_cumuls_[dimension_index].clear();</div>
|
|
<div class="line"><a id="l04129" name="l04129"></a><span class="lineno"> 4129</span> merge = merge && CheckRouteConnection(route1, route2, dimension_index,</div>
|
|
<div class="line"><a id="l04130" name="l04130"></a><span class="lineno"> 4130</span> <a class="code hl_variable" href="routing__search_8cc.html#a9b1b0455b5848770f087b1a4bd5ae474">start_depot</a>, <a class="code hl_variable" href="routing__search_8cc.html#ad5c4ff858135d200263f4be8c3d7c4dd">end_depot</a>);</div>
|
|
<div class="line"><a id="l04131" name="l04131"></a><span class="lineno"> 4131</span> <span class="keywordflow">if</span> (!merge) {</div>
|
|
<div class="line"><a id="l04132" name="l04132"></a><span class="lineno"> 4132</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l04133" name="l04133"></a><span class="lineno"> 4133</span> }</div>
|
|
<div class="line"><a id="l04134" name="l04134"></a><span class="lineno"> 4134</span> }</div>
|
|
<div class="line"><a id="l04135" name="l04135"></a><span class="lineno"> 4135</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l04136" name="l04136"></a><span class="lineno"> 4136</span> }</div>
|
|
<div class="line"><a id="l04137" name="l04137"></a><span class="lineno"> 4137</span> </div>
|
|
<div class="line"><a id="l04138" name="l04138"></a><span class="lineno"> 4138</span> <span class="keywordtype">bool</span> CheckTempAssignment(Assignment* <span class="keyword">const</span> temp_assignment,</div>
|
|
<div class="line"><a id="l04139" name="l04139"></a><span class="lineno"> 4139</span> <span class="keywordtype">int</span> new_chain_index, <span class="keywordtype">int</span> old_chain_index, <span class="keywordtype">int</span> head1,</div>
|
|
<div class="line"><a id="l04140" name="l04140"></a><span class="lineno"> 4140</span> <span class="keywordtype">int</span> tail1, <span class="keywordtype">int</span> head2, <span class="keywordtype">int</span> tail2) {</div>
|
|
<div class="line"><a id="l04141" name="l04141"></a><span class="lineno"> 4141</span> <span class="comment">// TODO(user): If the chain index is greater than the number of vehicles,</span></div>
|
|
<div class="line"><a id="l04142" name="l04142"></a><span class="lineno"> 4142</span> <span class="comment">// use another vehicle instead.</span></div>
|
|
<div class="line"><a id="l04143" name="l04143"></a><span class="lineno"> 4143</span> <span class="keywordflow">if</span> (new_chain_index >= model_->vehicles()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l04144" name="l04144"></a><span class="lineno"> 4144</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a> = head1;</div>
|
|
<div class="line"><a id="l04145" name="l04145"></a><span class="lineno"> 4145</span> temp_assignment->Add(model_->NextVar(model_->Start(new_chain_index)));</div>
|
|
<div class="line"><a id="l04146" name="l04146"></a><span class="lineno"> 4146</span> temp_assignment->SetValue(model_->NextVar(model_->Start(new_chain_index)),</div>
|
|
<div class="line"><a id="l04147" name="l04147"></a><span class="lineno"> 4147</span> <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>);</div>
|
|
<div class="line"><a id="l04148" name="l04148"></a><span class="lineno"> 4148</span> temp_assignment->Add(nexts_[tail1]);</div>
|
|
<div class="line"><a id="l04149" name="l04149"></a><span class="lineno"> 4149</span> temp_assignment->SetValue(nexts_[tail1], head2);</div>
|
|
<div class="line"><a id="l04150" name="l04150"></a><span class="lineno"> 4150</span> temp_assignment->Add(nexts_[tail2]);</div>
|
|
<div class="line"><a id="l04151" name="l04151"></a><span class="lineno"> 4151</span> temp_assignment->SetValue(nexts_[tail2], model_->End(new_chain_index));</div>
|
|
<div class="line"><a id="l04152" name="l04152"></a><span class="lineno"> 4152</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> chain_index = 0; chain_index < chains_.size(); ++chain_index) {</div>
|
|
<div class="line"><a id="l04153" name="l04153"></a><span class="lineno"> 4153</span> <span class="keywordflow">if</span> ((chain_index != new_chain_index) &&</div>
|
|
<div class="line"><a id="l04154" name="l04154"></a><span class="lineno"> 4154</span> (chain_index != old_chain_index) &&</div>
|
|
<div class="line"><a id="l04155" name="l04155"></a><span class="lineno"> 4155</span> (!deleted_chains_.contains(chain_index))) {</div>
|
|
<div class="line"><a id="l04156" name="l04156"></a><span class="lineno"> 4156</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a> = chains_[chain_index].head;</div>
|
|
<div class="line"><a id="l04157" name="l04157"></a><span class="lineno"> 4157</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a> = chains_[chain_index].tail;</div>
|
|
<div class="line"><a id="l04158" name="l04158"></a><span class="lineno"> 4158</span> temp_assignment->Add(model_->NextVar(model_->Start(chain_index)));</div>
|
|
<div class="line"><a id="l04159" name="l04159"></a><span class="lineno"> 4159</span> temp_assignment->SetValue(model_->NextVar(model_->Start(chain_index)),</div>
|
|
<div class="line"><a id="l04160" name="l04160"></a><span class="lineno"> 4160</span> <a class="code hl_variable" href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a>);</div>
|
|
<div class="line"><a id="l04161" name="l04161"></a><span class="lineno"> 4161</span> temp_assignment->Add(nexts_[<a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>]);</div>
|
|
<div class="line"><a id="l04162" name="l04162"></a><span class="lineno"> 4162</span> temp_assignment->SetValue(nexts_[<a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>], model_->End(chain_index));</div>
|
|
<div class="line"><a id="l04163" name="l04163"></a><span class="lineno"> 4163</span> }</div>
|
|
<div class="line"><a id="l04164" name="l04164"></a><span class="lineno"> 4164</span> }</div>
|
|
<div class="line"><a id="l04165" name="l04165"></a><span class="lineno"> 4165</span> <span class="keywordflow">return</span> solver_->Solve(solver_->MakeRestoreAssignment(temp_assignment));</div>
|
|
<div class="line"><a id="l04166" name="l04166"></a><span class="lineno"> 4166</span> }</div>
|
|
<div class="line"><a id="l04167" name="l04167"></a><span class="lineno"> 4167</span> </div>
|
|
<div class="line"><a id="l04168" name="l04168"></a><span class="lineno"> 4168</span> <span class="keywordtype">bool</span> UpdateAssignment(<span class="keyword">const</span> std::vector<int>& route1,</div>
|
|
<div class="line"><a id="l04169" name="l04169"></a><span class="lineno"> 4169</span> <span class="keyword">const</span> std::vector<int>& route2) {</div>
|
|
<div class="line"><a id="l04170" name="l04170"></a><span class="lineno"> 4170</span> <span class="keywordtype">bool</span> feasible = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l04171" name="l04171"></a><span class="lineno"> 4171</span> <span class="keyword">const</span> <span class="keywordtype">int</span> head1 = route1.front();</div>
|
|
<div class="line"><a id="l04172" name="l04172"></a><span class="lineno"> 4172</span> <span class="keyword">const</span> <span class="keywordtype">int</span> tail1 = route1.back();</div>
|
|
<div class="line"><a id="l04173" name="l04173"></a><span class="lineno"> 4173</span> <span class="keyword">const</span> <span class="keywordtype">int</span> head2 = route2.front();</div>
|
|
<div class="line"><a id="l04174" name="l04174"></a><span class="lineno"> 4174</span> <span class="keyword">const</span> <span class="keywordtype">int</span> tail2 = route2.back();</div>
|
|
<div class="line"><a id="l04175" name="l04175"></a><span class="lineno"> 4175</span> <span class="keyword">const</span> <span class="keywordtype">int</span> chain_index1 = index_to_chain_index_[head1];</div>
|
|
<div class="line"><a id="l04176" name="l04176"></a><span class="lineno"> 4176</span> <span class="keyword">const</span> <span class="keywordtype">int</span> chain_index2 = index_to_chain_index_[head2];</div>
|
|
<div class="line"><a id="l04177" name="l04177"></a><span class="lineno"> 4177</span> <span class="keywordflow">if</span> (chain_index1 < 0 && chain_index2 < 0) {</div>
|
|
<div class="line"><a id="l04178" name="l04178"></a><span class="lineno"> 4178</span> <span class="keyword">const</span> <span class="keywordtype">int</span> chain_index = chains_.size();</div>
|
|
<div class="line"><a id="l04179" name="l04179"></a><span class="lineno"> 4179</span> <span class="keywordflow">if</span> (check_assignment_) {</div>
|
|
<div class="line"><a id="l04180" name="l04180"></a><span class="lineno"> 4180</span> Assignment* <span class="keyword">const</span> temp_assignment =</div>
|
|
<div class="line"><a id="l04181" name="l04181"></a><span class="lineno"> 4181</span> solver_->MakeAssignment(assignment_);</div>
|
|
<div class="line"><a id="l04182" name="l04182"></a><span class="lineno"> 4182</span> feasible = CheckTempAssignment(temp_assignment, chain_index, -1, head1,</div>
|
|
<div class="line"><a id="l04183" name="l04183"></a><span class="lineno"> 4183</span> tail1, head2, tail2);</div>
|
|
<div class="line"><a id="l04184" name="l04184"></a><span class="lineno"> 4184</span> }</div>
|
|
<div class="line"><a id="l04185" name="l04185"></a><span class="lineno"> 4185</span> <span class="keywordflow">if</span> (feasible) {</div>
|
|
<div class="line"><a id="l04186" name="l04186"></a><span class="lineno"> 4186</span> Chain chain;</div>
|
|
<div class="line"><a id="l04187" name="l04187"></a><span class="lineno"> 4187</span> chain.head = head1;</div>
|
|
<div class="line"><a id="l04188" name="l04188"></a><span class="lineno"> 4188</span> chain.tail = tail2;</div>
|
|
<div class="line"><a id="l04189" name="l04189"></a><span class="lineno"> 4189</span> chain.nodes = 2;</div>
|
|
<div class="line"><a id="l04190" name="l04190"></a><span class="lineno"> 4190</span> index_to_chain_index_[head1] = chain_index;</div>
|
|
<div class="line"><a id="l04191" name="l04191"></a><span class="lineno"> 4191</span> index_to_chain_index_[tail2] = chain_index;</div>
|
|
<div class="line"><a id="l04192" name="l04192"></a><span class="lineno"> 4192</span> chains_.push_back(chain);</div>
|
|
<div class="line"><a id="l04193" name="l04193"></a><span class="lineno"> 4193</span> }</div>
|
|
<div class="line"><a id="l04194" name="l04194"></a><span class="lineno"> 4194</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (chain_index1 >= 0 && chain_index2 < 0) {</div>
|
|
<div class="line"><a id="l04195" name="l04195"></a><span class="lineno"> 4195</span> <span class="keywordflow">if</span> (check_assignment_) {</div>
|
|
<div class="line"><a id="l04196" name="l04196"></a><span class="lineno"> 4196</span> Assignment* <span class="keyword">const</span> temp_assignment =</div>
|
|
<div class="line"><a id="l04197" name="l04197"></a><span class="lineno"> 4197</span> solver_->MakeAssignment(assignment_);</div>
|
|
<div class="line"><a id="l04198" name="l04198"></a><span class="lineno"> 4198</span> feasible =</div>
|
|
<div class="line"><a id="l04199" name="l04199"></a><span class="lineno"> 4199</span> CheckTempAssignment(temp_assignment, chain_index1, chain_index2,</div>
|
|
<div class="line"><a id="l04200" name="l04200"></a><span class="lineno"> 4200</span> head1, tail1, head2, tail2);</div>
|
|
<div class="line"><a id="l04201" name="l04201"></a><span class="lineno"> 4201</span> }</div>
|
|
<div class="line"><a id="l04202" name="l04202"></a><span class="lineno"> 4202</span> <span class="keywordflow">if</span> (feasible) {</div>
|
|
<div class="line"><a id="l04203" name="l04203"></a><span class="lineno"> 4203</span> index_to_chain_index_[tail2] = chain_index1;</div>
|
|
<div class="line"><a id="l04204" name="l04204"></a><span class="lineno"> 4204</span> chains_[chain_index1].head = head1;</div>
|
|
<div class="line"><a id="l04205" name="l04205"></a><span class="lineno"> 4205</span> chains_[chain_index1].tail = tail2;</div>
|
|
<div class="line"><a id="l04206" name="l04206"></a><span class="lineno"> 4206</span> ++chains_[chain_index1].nodes;</div>
|
|
<div class="line"><a id="l04207" name="l04207"></a><span class="lineno"> 4207</span> }</div>
|
|
<div class="line"><a id="l04208" name="l04208"></a><span class="lineno"> 4208</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (chain_index1 < 0 && chain_index2 >= 0) {</div>
|
|
<div class="line"><a id="l04209" name="l04209"></a><span class="lineno"> 4209</span> <span class="keywordflow">if</span> (check_assignment_) {</div>
|
|
<div class="line"><a id="l04210" name="l04210"></a><span class="lineno"> 4210</span> Assignment* <span class="keyword">const</span> temp_assignment =</div>
|
|
<div class="line"><a id="l04211" name="l04211"></a><span class="lineno"> 4211</span> solver_->MakeAssignment(assignment_);</div>
|
|
<div class="line"><a id="l04212" name="l04212"></a><span class="lineno"> 4212</span> feasible =</div>
|
|
<div class="line"><a id="l04213" name="l04213"></a><span class="lineno"> 4213</span> CheckTempAssignment(temp_assignment, chain_index2, chain_index1,</div>
|
|
<div class="line"><a id="l04214" name="l04214"></a><span class="lineno"> 4214</span> head1, tail1, head2, tail2);</div>
|
|
<div class="line"><a id="l04215" name="l04215"></a><span class="lineno"> 4215</span> }</div>
|
|
<div class="line"><a id="l04216" name="l04216"></a><span class="lineno"> 4216</span> <span class="keywordflow">if</span> (feasible) {</div>
|
|
<div class="line"><a id="l04217" name="l04217"></a><span class="lineno"> 4217</span> index_to_chain_index_[head1] = chain_index2;</div>
|
|
<div class="line"><a id="l04218" name="l04218"></a><span class="lineno"> 4218</span> chains_[chain_index2].head = head1;</div>
|
|
<div class="line"><a id="l04219" name="l04219"></a><span class="lineno"> 4219</span> chains_[chain_index2].tail = tail2;</div>
|
|
<div class="line"><a id="l04220" name="l04220"></a><span class="lineno"> 4220</span> ++chains_[chain_index2].nodes;</div>
|
|
<div class="line"><a id="l04221" name="l04221"></a><span class="lineno"> 4221</span> }</div>
|
|
<div class="line"><a id="l04222" name="l04222"></a><span class="lineno"> 4222</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l04223" name="l04223"></a><span class="lineno"> 4223</span> <span class="keywordflow">if</span> (check_assignment_) {</div>
|
|
<div class="line"><a id="l04224" name="l04224"></a><span class="lineno"> 4224</span> Assignment* <span class="keyword">const</span> temp_assignment =</div>
|
|
<div class="line"><a id="l04225" name="l04225"></a><span class="lineno"> 4225</span> solver_->MakeAssignment(assignment_);</div>
|
|
<div class="line"><a id="l04226" name="l04226"></a><span class="lineno"> 4226</span> feasible =</div>
|
|
<div class="line"><a id="l04227" name="l04227"></a><span class="lineno"> 4227</span> CheckTempAssignment(temp_assignment, chain_index1, chain_index2,</div>
|
|
<div class="line"><a id="l04228" name="l04228"></a><span class="lineno"> 4228</span> head1, tail1, head2, tail2);</div>
|
|
<div class="line"><a id="l04229" name="l04229"></a><span class="lineno"> 4229</span> }</div>
|
|
<div class="line"><a id="l04230" name="l04230"></a><span class="lineno"> 4230</span> <span class="keywordflow">if</span> (feasible) {</div>
|
|
<div class="line"><a id="l04231" name="l04231"></a><span class="lineno"> 4231</span> index_to_chain_index_[tail2] = chain_index1;</div>
|
|
<div class="line"><a id="l04232" name="l04232"></a><span class="lineno"> 4232</span> chains_[chain_index1].head = head1;</div>
|
|
<div class="line"><a id="l04233" name="l04233"></a><span class="lineno"> 4233</span> chains_[chain_index1].tail = tail2;</div>
|
|
<div class="line"><a id="l04234" name="l04234"></a><span class="lineno"> 4234</span> chains_[chain_index1].nodes += chains_[chain_index2].nodes;</div>
|
|
<div class="line"><a id="l04235" name="l04235"></a><span class="lineno"> 4235</span> deleted_chains_.insert(chain_index2);</div>
|
|
<div class="line"><a id="l04236" name="l04236"></a><span class="lineno"> 4236</span> }</div>
|
|
<div class="line"><a id="l04237" name="l04237"></a><span class="lineno"> 4237</span> }</div>
|
|
<div class="line"><a id="l04238" name="l04238"></a><span class="lineno"> 4238</span> <span class="keywordflow">if</span> (feasible) {</div>
|
|
<div class="line"><a id="l04239" name="l04239"></a><span class="lineno"> 4239</span> assignment_->Add(nexts_[tail1]);</div>
|
|
<div class="line"><a id="l04240" name="l04240"></a><span class="lineno"> 4240</span> assignment_->SetValue(nexts_[tail1], head2);</div>
|
|
<div class="line"><a id="l04241" name="l04241"></a><span class="lineno"> 4241</span> }</div>
|
|
<div class="line"><a id="l04242" name="l04242"></a><span class="lineno"> 4242</span> <span class="keywordflow">return</span> feasible;</div>
|
|
<div class="line"><a id="l04243" name="l04243"></a><span class="lineno"> 4243</span> }</div>
|
|
<div class="line"><a id="l04244" name="l04244"></a><span class="lineno"> 4244</span> </div>
|
|
<div class="line"><a id="l04245" name="l04245"></a><span class="lineno"> 4245</span> <span class="keywordtype">bool</span> Merge(<span class="keywordtype">bool</span> merge, <span class="keywordtype">int</span> index1, <span class="keywordtype">int</span> index2) {</div>
|
|
<div class="line"><a id="l04246" name="l04246"></a><span class="lineno"> 4246</span> <span class="keywordflow">if</span> (merge) {</div>
|
|
<div class="line"><a id="l04247" name="l04247"></a><span class="lineno"> 4247</span> <span class="keywordflow">if</span> (UpdateAssignment(routes_[index1], routes_[index2])) {</div>
|
|
<div class="line"><a id="l04248" name="l04248"></a><span class="lineno"> 4248</span> <span class="comment">// Connection Route1 -> Route2</span></div>
|
|
<div class="line"><a id="l04249" name="l04249"></a><span class="lineno"> 4249</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> node : routes_[index2]) {</div>
|
|
<div class="line"><a id="l04250" name="l04250"></a><span class="lineno"> 4250</span> in_route_[node] = index1;</div>
|
|
<div class="line"><a id="l04251" name="l04251"></a><span class="lineno"> 4251</span> routes_[index1].push_back(node);</div>
|
|
<div class="line"><a id="l04252" name="l04252"></a><span class="lineno"> 4252</span> }</div>
|
|
<div class="line"><a id="l04253" name="l04253"></a><span class="lineno"> 4253</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> dimension_index = 0; dimension_index < dimensions_.size();</div>
|
|
<div class="line"><a id="l04254" name="l04254"></a><span class="lineno"> 4254</span> ++dimension_index) {</div>
|
|
<div class="line"><a id="l04255" name="l04255"></a><span class="lineno"> 4255</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> std::pair<int, int64_t> new_possible_cumul :</div>
|
|
<div class="line"><a id="l04256" name="l04256"></a><span class="lineno"> 4256</span> new_possible_cumuls_[dimension_index]) {</div>
|
|
<div class="line"><a id="l04257" name="l04257"></a><span class="lineno"> 4257</span> <a class="code hl_variable" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>[dimension_index][new_possible_cumul.first] =</div>
|
|
<div class="line"><a id="l04258" name="l04258"></a><span class="lineno"> 4258</span> new_possible_cumul.second;</div>
|
|
<div class="line"><a id="l04259" name="l04259"></a><span class="lineno"> 4259</span> }</div>
|
|
<div class="line"><a id="l04260" name="l04260"></a><span class="lineno"> 4260</span> }</div>
|
|
<div class="line"><a id="l04261" name="l04261"></a><span class="lineno"> 4261</span> deleted_routes_.insert(index2);</div>
|
|
<div class="line"><a id="l04262" name="l04262"></a><span class="lineno"> 4262</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l04263" name="l04263"></a><span class="lineno"> 4263</span> }</div>
|
|
<div class="line"><a id="l04264" name="l04264"></a><span class="lineno"> 4264</span> }</div>
|
|
<div class="line"><a id="l04265" name="l04265"></a><span class="lineno"> 4265</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l04266" name="l04266"></a><span class="lineno"> 4266</span> }</div>
|
|
<div class="line"><a id="l04267" name="l04267"></a><span class="lineno"> 4267</span> </div>
|
|
<div class="line"><a id="l04268" name="l04268"></a><span class="lineno"> 4268</span> Assignment* <span class="keyword">const</span> assignment_;</div>
|
|
<div class="line"><a id="l04269" name="l04269"></a><span class="lineno"> 4269</span> RoutingModel* <span class="keyword">const</span> model_;</div>
|
|
<div class="line"><a id="l04270" name="l04270"></a><span class="lineno"> 4270</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> check_assignment_;</div>
|
|
<div class="line"><a id="l04271" name="l04271"></a><span class="lineno"> 4271</span> Solver* <span class="keyword">const</span> solver_;</div>
|
|
<div class="line"><a id="l04272" name="l04272"></a><span class="lineno"> 4272</span> <span class="keyword">const</span> int64_t num_indices_;</div>
|
|
<div class="line"><a id="l04273" name="l04273"></a><span class="lineno"> 4273</span> <span class="keyword">const</span> std::vector<Link> links_list_;</div>
|
|
<div class="line"><a id="l04274" name="l04274"></a><span class="lineno"> 4274</span> std::vector<IntVar*> nexts_;</div>
|
|
<div class="line"><a id="l04275" name="l04275"></a><span class="lineno"> 4275</span> std::vector<const RoutingDimension*> dimensions_; <span class="comment">// Not owned.</span></div>
|
|
<div class="line"><a id="l04276" name="l04276"></a><span class="lineno"> 4276</span> std::vector<std::vector<int64_t>> <a class="code hl_variable" href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a>;</div>
|
|
<div class="line"><a id="l04277" name="l04277"></a><span class="lineno"> 4277</span> std::vector<absl::flat_hash_map<int, int64_t>> new_possible_cumuls_;</div>
|
|
<div class="line"><a id="l04278" name="l04278"></a><span class="lineno"> 4278</span> std::vector<std::vector<int>> routes_;</div>
|
|
<div class="line"><a id="l04279" name="l04279"></a><span class="lineno"> 4279</span> std::vector<int> in_route_;</div>
|
|
<div class="line"><a id="l04280" name="l04280"></a><span class="lineno"> 4280</span> absl::flat_hash_set<int> deleted_routes_;</div>
|
|
<div class="line"><a id="l04281" name="l04281"></a><span class="lineno"> 4281</span> std::vector<std::vector<int>> final_routes_;</div>
|
|
<div class="line"><a id="l04282" name="l04282"></a><span class="lineno"> 4282</span> std::vector<Chain> chains_;</div>
|
|
<div class="line"><a id="l04283" name="l04283"></a><span class="lineno"> 4283</span> absl::flat_hash_set<int> deleted_chains_;</div>
|
|
<div class="line"><a id="l04284" name="l04284"></a><span class="lineno"> 4284</span> std::vector<Chain> final_chains_;</div>
|
|
<div class="line"><a id="l04285" name="l04285"></a><span class="lineno"> 4285</span> std::vector<int> index_to_chain_index_;</div>
|
|
<div class="line"><a id="l04286" name="l04286"></a><span class="lineno"> 4286</span> std::vector<int> index_to_vehicle_class_index_;</div>
|
|
<div class="line"><a id="l04287" name="l04287"></a><span class="lineno"> 4287</span>};</div>
|
|
<div class="line"><a id="l04288" name="l04288"></a><span class="lineno"> 4288</span> </div>
|
|
<div class="line"><a id="l04289" name="l04289"></a><span class="lineno"> 4289</span><span class="comment">// Decision Builder building a first solution based on Sweep heuristic for</span></div>
|
|
<div class="line"><a id="l04290" name="l04290"></a><span class="lineno"> 4290</span><span class="comment">// Vehicle Routing Problem.</span></div>
|
|
<div class="line"><a id="l04291" name="l04291"></a><span class="lineno"> 4291</span><span class="comment">// Suitable only when distance is considered as the cost.</span></div>
|
|
<div class="line"><a id="l04292" name="l04292"></a><span class="lineno"> 4292</span><span class="keyword">class </span>SweepBuilder : <span class="keyword">public</span> DecisionBuilder {</div>
|
|
<div class="line"><a id="l04293" name="l04293"></a><span class="lineno"> 4293</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l04294" name="l04294"></a><span class="lineno"> 4294</span> SweepBuilder(RoutingModel* <span class="keyword">const</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, <span class="keywordtype">bool</span> check_assignment)</div>
|
|
<div class="line"><a id="l04295" name="l04295"></a><span class="lineno"> 4295</span> : model_(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>), check_assignment_(check_assignment) {}</div>
|
|
<div class="line"><a id="l04296" name="l04296"></a><span class="lineno"> 4296</span> ~SweepBuilder()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a id="l04297" name="l04297"></a><span class="lineno"> 4297</span> </div>
|
|
<div class="line"><a id="l04298" name="l04298"></a><span class="lineno"> 4298</span> Decision* Next(Solver* <span class="keyword">const</span> solver)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l04299" name="l04299"></a><span class="lineno"> 4299</span> <span class="comment">// Setup the model of the instance for the Sweep Algorithm</span></div>
|
|
<div class="line"><a id="l04300" name="l04300"></a><span class="lineno"> 4300</span> ModelSetup();</div>
|
|
<div class="line"><a id="l04301" name="l04301"></a><span class="lineno"> 4301</span> </div>
|
|
<div class="line"><a id="l04302" name="l04302"></a><span class="lineno"> 4302</span> <span class="comment">// Build the assignment routes for the model</span></div>
|
|
<div class="line"><a id="l04303" name="l04303"></a><span class="lineno"> 4303</span> Assignment* <span class="keyword">const</span> assignment = solver->MakeAssignment();</div>
|
|
<div class="line"><a id="l04304" name="l04304"></a><span class="lineno"> 4304</span> route_constructor_ = absl::make_unique<RouteConstructor>(</div>
|
|
<div class="line"><a id="l04305" name="l04305"></a><span class="lineno"> 4305</span> assignment, model_, check_assignment_, num_indices_, links_);</div>
|
|
<div class="line"><a id="l04306" name="l04306"></a><span class="lineno"> 4306</span> <span class="comment">// This call might cause backtracking if the search limit is reached.</span></div>
|
|
<div class="line"><a id="l04307" name="l04307"></a><span class="lineno"> 4307</span> route_constructor_->Construct();</div>
|
|
<div class="line"><a id="l04308" name="l04308"></a><span class="lineno"> 4308</span> route_constructor_.reset(<span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l04309" name="l04309"></a><span class="lineno"> 4309</span> <span class="comment">// This call might cause backtracking if the solution is not feasible.</span></div>
|
|
<div class="line"><a id="l04310" name="l04310"></a><span class="lineno"> 4310</span> assignment->Restore();</div>
|
|
<div class="line"><a id="l04311" name="l04311"></a><span class="lineno"> 4311</span> </div>
|
|
<div class="line"><a id="l04312" name="l04312"></a><span class="lineno"> 4312</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l04313" name="l04313"></a><span class="lineno"> 4313</span> }</div>
|
|
<div class="line"><a id="l04314" name="l04314"></a><span class="lineno"> 4314</span> </div>
|
|
<div class="line"><a id="l04315" name="l04315"></a><span class="lineno"> 4315</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l04316" name="l04316"></a><span class="lineno"> 4316</span> <span class="keywordtype">void</span> ModelSetup() {</div>
|
|
<div class="line"><a id="l04317" name="l04317"></a><span class="lineno"> 4317</span> <span class="keyword">const</span> <span class="keywordtype">int</span> depot = model_->GetDepot();</div>
|
|
<div class="line"><a id="l04318" name="l04318"></a><span class="lineno"> 4318</span> num_indices_ = model_->Size() + model_->vehicles();</div>
|
|
<div class="line"><a id="l04319" name="l04319"></a><span class="lineno"> 4319</span> <span class="keywordflow">if</span> (absl::GetFlag(FLAGS_sweep_sectors) > 0 &&</div>
|
|
<div class="line"><a id="l04320" name="l04320"></a><span class="lineno"> 4320</span> absl::GetFlag(FLAGS_sweep_sectors) < num_indices_) {</div>
|
|
<div class="line"><a id="l04321" name="l04321"></a><span class="lineno"> 4321</span> model_->sweep_arranger()->SetSectors(absl::GetFlag(FLAGS_sweep_sectors));</div>
|
|
<div class="line"><a id="l04322" name="l04322"></a><span class="lineno"> 4322</span> }</div>
|
|
<div class="line"><a id="l04323" name="l04323"></a><span class="lineno"> 4323</span> std::vector<int64_t> indices;</div>
|
|
<div class="line"><a id="l04324" name="l04324"></a><span class="lineno"> 4324</span> model_->sweep_arranger()->ArrangeIndices(&indices);</div>
|
|
<div class="line"><a id="l04325" name="l04325"></a><span class="lineno"> 4325</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < indices.size() - 1; ++i) {</div>
|
|
<div class="line"><a id="l04326" name="l04326"></a><span class="lineno"> 4326</span> <span class="keyword">const</span> int64_t first = indices[i];</div>
|
|
<div class="line"><a id="l04327" name="l04327"></a><span class="lineno"> 4327</span> <span class="keyword">const</span> int64_t second = indices[i + 1];</div>
|
|
<div class="line"><a id="l04328" name="l04328"></a><span class="lineno"> 4328</span> <span class="keywordflow">if</span> ((model_->IsStart(first) || !model_->IsEnd(first)) &&</div>
|
|
<div class="line"><a id="l04329" name="l04329"></a><span class="lineno"> 4329</span> (model_->IsStart(second) || !model_->IsEnd(second))) {</div>
|
|
<div class="line"><a id="l04330" name="l04330"></a><span class="lineno"> 4330</span> <span class="keywordflow">if</span> (first != depot && second != depot) {</div>
|
|
<div class="line"><a id="l04331" name="l04331"></a><span class="lineno"> 4331</span> Link <a class="code hl_variable" href="routing__search_8cc.html#a6824c3bafe148ed277f7c1f8013ab022">link</a>(std::make_pair(first, second), 0, 0, depot, depot);</div>
|
|
<div class="line"><a id="l04332" name="l04332"></a><span class="lineno"> 4332</span> links_.push_back(<a class="code hl_variable" href="routing__search_8cc.html#a6824c3bafe148ed277f7c1f8013ab022">link</a>);</div>
|
|
<div class="line"><a id="l04333" name="l04333"></a><span class="lineno"> 4333</span> }</div>
|
|
<div class="line"><a id="l04334" name="l04334"></a><span class="lineno"> 4334</span> }</div>
|
|
<div class="line"><a id="l04335" name="l04335"></a><span class="lineno"> 4335</span> }</div>
|
|
<div class="line"><a id="l04336" name="l04336"></a><span class="lineno"> 4336</span> }</div>
|
|
<div class="line"><a id="l04337" name="l04337"></a><span class="lineno"> 4337</span> </div>
|
|
<div class="line"><a id="l04338" name="l04338"></a><span class="lineno"> 4338</span> RoutingModel* <span class="keyword">const</span> model_;</div>
|
|
<div class="line"><a id="l04339" name="l04339"></a><span class="lineno"> 4339</span> std::unique_ptr<RouteConstructor> route_constructor_;</div>
|
|
<div class="line"><a id="l04340" name="l04340"></a><span class="lineno"> 4340</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> check_assignment_;</div>
|
|
<div class="line"><a id="l04341" name="l04341"></a><span class="lineno"> 4341</span> int64_t num_indices_;</div>
|
|
<div class="line"><a id="l04342" name="l04342"></a><span class="lineno"> 4342</span> std::vector<Link> links_;</div>
|
|
<div class="line"><a id="l04343" name="l04343"></a><span class="lineno"> 4343</span>};</div>
|
|
<div class="line"><a id="l04344" name="l04344"></a><span class="lineno"> 4344</span>} <span class="comment">// namespace</span></div>
|
|
<div class="line"><a id="l04345" name="l04345"></a><span class="lineno"> 4345</span> </div>
|
|
<div class="line"><a id="l04346" name="l04346"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ab5b064a7895b1fc8084546441a57b46a"> 4346</a></span><a class="code hl_class" href="classoperations__research_1_1_decision_builder.html">DecisionBuilder</a>* <a class="code hl_function" href="namespaceoperations__research.html#ab5b064a7895b1fc8084546441a57b46a">MakeSweepDecisionBuilder</a>(<a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div>
|
|
<div class="line"><a id="l04347" name="l04347"></a><span class="lineno"> 4347</span> <span class="keywordtype">bool</span> check_assignment) {</div>
|
|
<div class="line"><a id="l04348" name="l04348"></a><span class="lineno"> 4348</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->solver()->RevAlloc(<span class="keyword">new</span> SweepBuilder(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>, check_assignment));</div>
|
|
<div class="line"><a id="l04349" name="l04349"></a><span class="lineno"> 4349</span>}</div>
|
|
<div class="line"><a id="l04350" name="l04350"></a><span class="lineno"> 4350</span> </div>
|
|
<div class="line"><a id="l04351" name="l04351"></a><span class="lineno"> 4351</span><span class="comment">// AllUnperformed</span></div>
|
|
<div class="line"><a id="l04352" name="l04352"></a><span class="lineno"> 4352</span> </div>
|
|
<div class="line"><a id="l04353" name="l04353"></a><span class="lineno"> 4353</span><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l04354" name="l04354"></a><span class="lineno"> 4354</span><span class="comment">// Decision builder to build a solution with all nodes inactive. It does no</span></div>
|
|
<div class="line"><a id="l04355" name="l04355"></a><span class="lineno"> 4355</span><span class="comment">// branching and may fail if some nodes cannot be made inactive.</span></div>
|
|
<div class="line"><a id="l04356" name="l04356"></a><span class="lineno"> 4356</span> </div>
|
|
<div class="line"><a id="l04357" name="l04357"></a><span class="lineno"> 4357</span><span class="keyword">class </span>AllUnperformed : <span class="keyword">public</span> DecisionBuilder {</div>
|
|
<div class="line"><a id="l04358" name="l04358"></a><span class="lineno"> 4358</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l04359" name="l04359"></a><span class="lineno"> 4359</span> <span class="comment">// Does not take ownership of model.</span></div>
|
|
<div class="line"><a id="l04360" name="l04360"></a><span class="lineno"> 4360</span> <span class="keyword">explicit</span> AllUnperformed(RoutingModel* <span class="keyword">const</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) : model_(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {}</div>
|
|
<div class="line"><a id="l04361" name="l04361"></a><span class="lineno"> 4361</span> ~AllUnperformed()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a id="l04362" name="l04362"></a><span class="lineno"> 4362</span> Decision* Next(Solver* <span class="keyword">const</span> solver)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a id="l04363" name="l04363"></a><span class="lineno"> 4363</span> <span class="comment">// Solver::(Un)FreezeQueue is private, passing through the public API</span></div>
|
|
<div class="line"><a id="l04364" name="l04364"></a><span class="lineno"> 4364</span> <span class="comment">// on PropagationBaseObject.</span></div>
|
|
<div class="line"><a id="l04365" name="l04365"></a><span class="lineno"> 4365</span> model_->CostVar()->FreezeQueue();</div>
|
|
<div class="line"><a id="l04366" name="l04366"></a><span class="lineno"> 4366</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < model_->Size(); ++i) {</div>
|
|
<div class="line"><a id="l04367" name="l04367"></a><span class="lineno"> 4367</span> <span class="keywordflow">if</span> (!model_->IsStart(i)) {</div>
|
|
<div class="line"><a id="l04368" name="l04368"></a><span class="lineno"> 4368</span> model_->ActiveVar(i)->SetValue(0);</div>
|
|
<div class="line"><a id="l04369" name="l04369"></a><span class="lineno"> 4369</span> }</div>
|
|
<div class="line"><a id="l04370" name="l04370"></a><span class="lineno"> 4370</span> }</div>
|
|
<div class="line"><a id="l04371" name="l04371"></a><span class="lineno"> 4371</span> model_->CostVar()->UnfreezeQueue();</div>
|
|
<div class="line"><a id="l04372" name="l04372"></a><span class="lineno"> 4372</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l04373" name="l04373"></a><span class="lineno"> 4373</span> }</div>
|
|
<div class="line"><a id="l04374" name="l04374"></a><span class="lineno"> 4374</span> </div>
|
|
<div class="line"><a id="l04375" name="l04375"></a><span class="lineno"> 4375</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l04376" name="l04376"></a><span class="lineno"> 4376</span> RoutingModel* <span class="keyword">const</span> model_;</div>
|
|
<div class="line"><a id="l04377" name="l04377"></a><span class="lineno"> 4377</span>};</div>
|
|
<div class="line"><a id="l04378" name="l04378"></a><span class="lineno"> 4378</span>} <span class="comment">// namespace</span></div>
|
|
<div class="line"><a id="l04379" name="l04379"></a><span class="lineno"> 4379</span> </div>
|
|
<div class="line"><a id="l04380" name="l04380"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a26a2d5d3c5887e436bf4da4c20a99a26"> 4380</a></span><a class="code hl_class" href="classoperations__research_1_1_decision_builder.html">DecisionBuilder</a>* <a class="code hl_function" href="namespaceoperations__research.html#a26a2d5d3c5887e436bf4da4c20a99a26">MakeAllUnperformed</a>(<a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a id="l04381" name="l04381"></a><span class="lineno"> 4381</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->solver()->RevAlloc(<span class="keyword">new</span> AllUnperformed(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>));</div>
|
|
<div class="line"><a id="l04382" name="l04382"></a><span class="lineno"> 4382</span>}</div>
|
|
<div class="line"><a id="l04383" name="l04383"></a><span class="lineno"> 4383</span> </div>
|
|
<div class="line"><a id="l04384" name="l04384"></a><span class="lineno"> 4384</span><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l04385" name="l04385"></a><span class="lineno"> 4385</span><span class="comment">// The description is in routing.h:MakeGuidedSlackFinalizer</span></div>
|
|
<div class="line"><a id="l04386" name="l04386"></a><span class="lineno"> 4386</span><span class="keyword">class </span>GuidedSlackFinalizer : <span class="keyword">public</span> DecisionBuilder {</div>
|
|
<div class="line"><a id="l04387" name="l04387"></a><span class="lineno"> 4387</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l04388" name="l04388"></a><span class="lineno"> 4388</span> GuidedSlackFinalizer(<span class="keyword">const</span> RoutingDimension* dimension, RoutingModel* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div>
|
|
<div class="line"><a id="l04389" name="l04389"></a><span class="lineno"> 4389</span> std::function<int64_t(int64_t)> initializer);</div>
|
|
<div class="line"><a id="l04390" name="l04390"></a><span class="lineno"> 4390</span> Decision* Next(Solver* solver) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a id="l04391" name="l04391"></a><span class="lineno"> 4391</span> </div>
|
|
<div class="line"><a id="l04392" name="l04392"></a><span class="lineno"> 4392</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l04393" name="l04393"></a><span class="lineno"> 4393</span> int64_t SelectValue(int64_t <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>);</div>
|
|
<div class="line"><a id="l04394" name="l04394"></a><span class="lineno"> 4394</span> int64_t ChooseVariable();</div>
|
|
<div class="line"><a id="l04395" name="l04395"></a><span class="lineno"> 4395</span> </div>
|
|
<div class="line"><a id="l04396" name="l04396"></a><span class="lineno"> 4396</span> <span class="keyword">const</span> RoutingDimension* <span class="keyword">const</span> dimension_;</div>
|
|
<div class="line"><a id="l04397" name="l04397"></a><span class="lineno"> 4397</span> RoutingModel* <span class="keyword">const</span> model_;</div>
|
|
<div class="line"><a id="l04398" name="l04398"></a><span class="lineno"> 4398</span> <span class="keyword">const</span> std::function<int64_t(int64_t)> initializer_;</div>
|
|
<div class="line"><a id="l04399" name="l04399"></a><span class="lineno"> 4399</span> RevArray<bool> is_initialized_;</div>
|
|
<div class="line"><a id="l04400" name="l04400"></a><span class="lineno"> 4400</span> std::vector<int64_t> initial_values_;</div>
|
|
<div class="line"><a id="l04401" name="l04401"></a><span class="lineno"> 4401</span> Rev<int64_t> current_index_;</div>
|
|
<div class="line"><a id="l04402" name="l04402"></a><span class="lineno"> 4402</span> Rev<int64_t> current_route_;</div>
|
|
<div class="line"><a id="l04403" name="l04403"></a><span class="lineno"> 4403</span> RevArray<int64_t> last_delta_used_;</div>
|
|
<div class="line"><a id="l04404" name="l04404"></a><span class="lineno"> 4404</span> </div>
|
|
<div class="line"><a id="l04405" name="l04405"></a><span class="lineno"> 4405</span> <a class="code hl_define" href="macros_8h.html#af8df3547bfde53a5acb93e2607b0034a">DISALLOW_COPY_AND_ASSIGN</a>(GuidedSlackFinalizer);</div>
|
|
<div class="line"><a id="l04406" name="l04406"></a><span class="lineno"> 4406</span>};</div>
|
|
<div class="line"><a id="l04407" name="l04407"></a><span class="lineno"> 4407</span> </div>
|
|
<div class="line"><a id="l04408" name="l04408"></a><span class="lineno"> 4408</span>GuidedSlackFinalizer::GuidedSlackFinalizer(</div>
|
|
<div class="line"><a id="l04409" name="l04409"></a><span class="lineno"> 4409</span> <span class="keyword">const</span> RoutingDimension* dimension, RoutingModel* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>,</div>
|
|
<div class="line"><a id="l04410" name="l04410"></a><span class="lineno"> 4410</span> std::function<int64_t(int64_t)> initializer)</div>
|
|
<div class="line"><a id="l04411" name="l04411"></a><span class="lineno"> 4411</span> : dimension_(<a class="code hl_define" href="base_2logging_8h.html#aeef651f886eb5252c08835194213efe2">ABSL_DIE_IF_NULL</a>(dimension)),</div>
|
|
<div class="line"><a id="l04412" name="l04412"></a><span class="lineno"> 4412</span> model_(<a class="code hl_define" href="base_2logging_8h.html#aeef651f886eb5252c08835194213efe2">ABSL_DIE_IF_NULL</a>(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)),</div>
|
|
<div class="line"><a id="l04413" name="l04413"></a><span class="lineno"> 4413</span> initializer_(<a class="code hl_namespace" href="namespacestd.html">std</a>::move(initializer)),</div>
|
|
<div class="line"><a id="l04414" name="l04414"></a><span class="lineno"> 4414</span> is_initialized_(dimension->slacks().size(), false),</div>
|
|
<div class="line"><a id="l04415" name="l04415"></a><span class="lineno"> 4415</span> initial_values_(dimension->slacks().size(),</div>
|
|
<div class="line"><a id="l04416" name="l04416"></a><span class="lineno"> 4416</span> <a class="code hl_namespace" href="namespacestd.html">std</a>::numeric_limits<int64_t>::<a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a>()),</div>
|
|
<div class="line"><a id="l04417" name="l04417"></a><span class="lineno"> 4417</span> current_index_(model_->Start(0)),</div>
|
|
<div class="line"><a id="l04418" name="l04418"></a><span class="lineno"> 4418</span> current_route_(0),</div>
|
|
<div class="line"><a id="l04419" name="l04419"></a><span class="lineno"> 4419</span> last_delta_used_(dimension->slacks().size(), 0) {}</div>
|
|
<div class="line"><a id="l04420" name="l04420"></a><span class="lineno"> 4420</span> </div>
|
|
<div class="line"><a id="l04421" name="l04421"></a><span class="lineno"> 4421</span>Decision* GuidedSlackFinalizer::Next(Solver* solver) {</div>
|
|
<div class="line"><a id="l04422" name="l04422"></a><span class="lineno"> 4422</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(solver, model_->solver());</div>
|
|
<div class="line"><a id="l04423" name="l04423"></a><span class="lineno"> 4423</span> <span class="keyword">const</span> <span class="keywordtype">int</span> node_idx = ChooseVariable();</div>
|
|
<div class="line"><a id="l04424" name="l04424"></a><span class="lineno"> 4424</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(node_idx == -1 ||</div>
|
|
<div class="line"><a id="l04425" name="l04425"></a><span class="lineno"> 4425</span> (node_idx >= 0 && node_idx < dimension_->slacks().size()));</div>
|
|
<div class="line"><a id="l04426" name="l04426"></a><span class="lineno"> 4426</span> <span class="keywordflow">if</span> (node_idx != -1) {</div>
|
|
<div class="line"><a id="l04427" name="l04427"></a><span class="lineno"> 4427</span> <span class="keywordflow">if</span> (!is_initialized_[node_idx]) {</div>
|
|
<div class="line"><a id="l04428" name="l04428"></a><span class="lineno"> 4428</span> initial_values_[node_idx] = initializer_(node_idx);</div>
|
|
<div class="line"><a id="l04429" name="l04429"></a><span class="lineno"> 4429</span> is_initialized_.SetValue(solver, node_idx, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l04430" name="l04430"></a><span class="lineno"> 4430</span> }</div>
|
|
<div class="line"><a id="l04431" name="l04431"></a><span class="lineno"> 4431</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="routing__search_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = SelectValue(node_idx);</div>
|
|
<div class="line"><a id="l04432" name="l04432"></a><span class="lineno"> 4432</span> IntVar* <span class="keyword">const</span> slack_variable = dimension_->SlackVar(node_idx);</div>
|
|
<div class="line"><a id="l04433" name="l04433"></a><span class="lineno"> 4433</span> <span class="keywordflow">return</span> solver->MakeAssignVariableValue(slack_variable, <a class="code hl_variable" href="routing__search_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div>
|
|
<div class="line"><a id="l04434" name="l04434"></a><span class="lineno"> 4434</span> }</div>
|
|
<div class="line"><a id="l04435" name="l04435"></a><span class="lineno"> 4435</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l04436" name="l04436"></a><span class="lineno"> 4436</span>}</div>
|
|
<div class="line"><a id="l04437" name="l04437"></a><span class="lineno"> 4437</span> </div>
|
|
<div class="line"><a id="l04438" name="l04438"></a><span class="lineno"> 4438</span>int64_t GuidedSlackFinalizer::SelectValue(int64_t <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>) {</div>
|
|
<div class="line"><a id="l04439" name="l04439"></a><span class="lineno"> 4439</span> <span class="keyword">const</span> IntVar* <span class="keyword">const</span> slack_variable = dimension_->SlackVar(<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>);</div>
|
|
<div class="line"><a id="l04440" name="l04440"></a><span class="lineno"> 4440</span> <span class="keyword">const</span> int64_t center = initial_values_[<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>];</div>
|
|
<div class="line"><a id="l04441" name="l04441"></a><span class="lineno"> 4441</span> <span class="keyword">const</span> int64_t max_delta =</div>
|
|
<div class="line"><a id="l04442" name="l04442"></a><span class="lineno"> 4442</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(center - slack_variable->Min(), slack_variable->Max() - center) +</div>
|
|
<div class="line"><a id="l04443" name="l04443"></a><span class="lineno"> 4443</span> 1;</div>
|
|
<div class="line"><a id="l04444" name="l04444"></a><span class="lineno"> 4444</span> int64_t <a class="code hl_variable" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a> = last_delta_used_[<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>];</div>
|
|
<div class="line"><a id="l04445" name="l04445"></a><span class="lineno"> 4445</span> </div>
|
|
<div class="line"><a id="l04446" name="l04446"></a><span class="lineno"> 4446</span> <span class="comment">// The sequence of deltas is 0, 1, -1, 2, -2 ...</span></div>
|
|
<div class="line"><a id="l04447" name="l04447"></a><span class="lineno"> 4447</span> <span class="comment">// Only the values inside the domain of variable are returned.</span></div>
|
|
<div class="line"><a id="l04448" name="l04448"></a><span class="lineno"> 4448</span> <span class="keywordflow">while</span> (std::abs(<a class="code hl_variable" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a>) < max_delta &&</div>
|
|
<div class="line"><a id="l04449" name="l04449"></a><span class="lineno"> 4449</span> !slack_variable->Contains(center + <a class="code hl_variable" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a>)) {</div>
|
|
<div class="line"><a id="l04450" name="l04450"></a><span class="lineno"> 4450</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a> > 0) {</div>
|
|
<div class="line"><a id="l04451" name="l04451"></a><span class="lineno"> 4451</span> <a class="code hl_variable" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a> = -<a class="code hl_variable" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a>;</div>
|
|
<div class="line"><a id="l04452" name="l04452"></a><span class="lineno"> 4452</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l04453" name="l04453"></a><span class="lineno"> 4453</span> <a class="code hl_variable" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a> = -<a class="code hl_variable" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a> + 1;</div>
|
|
<div class="line"><a id="l04454" name="l04454"></a><span class="lineno"> 4454</span> }</div>
|
|
<div class="line"><a id="l04455" name="l04455"></a><span class="lineno"> 4455</span> }</div>
|
|
<div class="line"><a id="l04456" name="l04456"></a><span class="lineno"> 4456</span> last_delta_used_.SetValue(model_->solver(), <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>, <a class="code hl_variable" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a>);</div>
|
|
<div class="line"><a id="l04457" name="l04457"></a><span class="lineno"> 4457</span> <span class="keywordflow">return</span> center + <a class="code hl_variable" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a>;</div>
|
|
<div class="line"><a id="l04458" name="l04458"></a><span class="lineno"> 4458</span>}</div>
|
|
<div class="line"><a id="l04459" name="l04459"></a><span class="lineno"> 4459</span> </div>
|
|
<div class="line"><a id="l04460" name="l04460"></a><span class="lineno"> 4460</span>int64_t GuidedSlackFinalizer::ChooseVariable() {</div>
|
|
<div class="line"><a id="l04461" name="l04461"></a><span class="lineno"> 4461</span> int64_t int_current_node = current_index_.Value();</div>
|
|
<div class="line"><a id="l04462" name="l04462"></a><span class="lineno"> 4462</span> int64_t int_current_route = current_route_.Value();</div>
|
|
<div class="line"><a id="l04463" name="l04463"></a><span class="lineno"> 4463</span> </div>
|
|
<div class="line"><a id="l04464" name="l04464"></a><span class="lineno"> 4464</span> <span class="keywordflow">while</span> (int_current_route < model_->vehicles()) {</div>
|
|
<div class="line"><a id="l04465" name="l04465"></a><span class="lineno"> 4465</span> <span class="keywordflow">while</span> (!model_->IsEnd(int_current_node) &&</div>
|
|
<div class="line"><a id="l04466" name="l04466"></a><span class="lineno"> 4466</span> dimension_->SlackVar(int_current_node)->Bound()) {</div>
|
|
<div class="line"><a id="l04467" name="l04467"></a><span class="lineno"> 4467</span> int_current_node = model_->NextVar(int_current_node)->Value();</div>
|
|
<div class="line"><a id="l04468" name="l04468"></a><span class="lineno"> 4468</span> }</div>
|
|
<div class="line"><a id="l04469" name="l04469"></a><span class="lineno"> 4469</span> <span class="keywordflow">if</span> (!model_->IsEnd(int_current_node)) {</div>
|
|
<div class="line"><a id="l04470" name="l04470"></a><span class="lineno"> 4470</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l04471" name="l04471"></a><span class="lineno"> 4471</span> }</div>
|
|
<div class="line"><a id="l04472" name="l04472"></a><span class="lineno"> 4472</span> int_current_route += 1;</div>
|
|
<div class="line"><a id="l04473" name="l04473"></a><span class="lineno"> 4473</span> <span class="keywordflow">if</span> (int_current_route < model_->vehicles()) {</div>
|
|
<div class="line"><a id="l04474" name="l04474"></a><span class="lineno"> 4474</span> int_current_node = model_->Start(int_current_route);</div>
|
|
<div class="line"><a id="l04475" name="l04475"></a><span class="lineno"> 4475</span> }</div>
|
|
<div class="line"><a id="l04476" name="l04476"></a><span class="lineno"> 4476</span> }</div>
|
|
<div class="line"><a id="l04477" name="l04477"></a><span class="lineno"> 4477</span> </div>
|
|
<div class="line"><a id="l04478" name="l04478"></a><span class="lineno"> 4478</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(int_current_route == model_->vehicles() ||</div>
|
|
<div class="line"><a id="l04479" name="l04479"></a><span class="lineno"> 4479</span> !dimension_->SlackVar(int_current_node)->Bound());</div>
|
|
<div class="line"><a id="l04480" name="l04480"></a><span class="lineno"> 4480</span> current_index_.SetValue(model_->solver(), int_current_node);</div>
|
|
<div class="line"><a id="l04481" name="l04481"></a><span class="lineno"> 4481</span> current_route_.SetValue(model_->solver(), int_current_route);</div>
|
|
<div class="line"><a id="l04482" name="l04482"></a><span class="lineno"> 4482</span> <span class="keywordflow">if</span> (int_current_route < model_->vehicles()) {</div>
|
|
<div class="line"><a id="l04483" name="l04483"></a><span class="lineno"> 4483</span> <span class="keywordflow">return</span> int_current_node;</div>
|
|
<div class="line"><a id="l04484" name="l04484"></a><span class="lineno"> 4484</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l04485" name="l04485"></a><span class="lineno"> 4485</span> <span class="keywordflow">return</span> -1;</div>
|
|
<div class="line"><a id="l04486" name="l04486"></a><span class="lineno"> 4486</span> }</div>
|
|
<div class="line"><a id="l04487" name="l04487"></a><span class="lineno"> 4487</span>}</div>
|
|
<div class="line"><a id="l04488" name="l04488"></a><span class="lineno"> 4488</span>} <span class="comment">// namespace</span></div>
|
|
<div class="line"><a id="l04489" name="l04489"></a><span class="lineno"> 4489</span> </div>
|
|
<div class="line"><a id="l04490" name="l04490"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_model.html#aba3eb59d97b0beef7f153ada8fe862f7"> 4490</a></span><a class="code hl_class" href="classoperations__research_1_1_decision_builder.html">DecisionBuilder</a>* RoutingModel::MakeGuidedSlackFinalizer(</div>
|
|
<div class="line"><a id="l04491" name="l04491"></a><span class="lineno"> 4491</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* dimension,</div>
|
|
<div class="line"><a id="l04492" name="l04492"></a><span class="lineno"> 4492</span> std::function<int64_t(int64_t)> initializer) {</div>
|
|
<div class="line"><a id="l04493" name="l04493"></a><span class="lineno"> 4493</span> <span class="keywordflow">return</span> solver_->RevAlloc(</div>
|
|
<div class="line"><a id="l04494" name="l04494"></a><span class="lineno"> 4494</span> <span class="keyword">new</span> GuidedSlackFinalizer(dimension, <span class="keyword">this</span>, std::move(initializer)));</div>
|
|
<div class="line"><a id="l04495" name="l04495"></a><span class="lineno"> 4495</span>}</div>
|
|
<div class="line"><a id="l04496" name="l04496"></a><span class="lineno"> 4496</span> </div>
|
|
<div class="line"><a id="l04497" name="l04497"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_dimension.html#aa92333e706853d147814ecd3426a0c1d"> 4497</a></span>int64_t RoutingDimension::ShortestTransitionSlack(int64_t node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l04498" name="l04498"></a><span class="lineno"> 4498</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(base_dimension_, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a id="l04499" name="l04499"></a><span class="lineno"> 4499</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!model_->IsEnd(node));</div>
|
|
<div class="line"><a id="l04500" name="l04500"></a><span class="lineno"> 4500</span> <span class="comment">// Recall that the model is cumul[i+1] = cumul[i] + transit[i] + slack[i]. Our</span></div>
|
|
<div class="line"><a id="l04501" name="l04501"></a><span class="lineno"> 4501</span> <span class="comment">// aim is to find a value for slack[i] such that cumul[i+1] + transit[i+1] is</span></div>
|
|
<div class="line"><a id="l04502" name="l04502"></a><span class="lineno"> 4502</span> <span class="comment">// minimized.</span></div>
|
|
<div class="line"><a id="l04503" name="l04503"></a><span class="lineno"> 4503</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = model_->NextVar(node)->Value();</div>
|
|
<div class="line"><a id="l04504" name="l04504"></a><span class="lineno"> 4504</span> <span class="keywordflow">if</span> (model_->IsEnd(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)) {</div>
|
|
<div class="line"><a id="l04505" name="l04505"></a><span class="lineno"> 4505</span> <span class="keywordflow">return</span> SlackVar(node)->Min();</div>
|
|
<div class="line"><a id="l04506" name="l04506"></a><span class="lineno"> 4506</span> }</div>
|
|
<div class="line"><a id="l04507" name="l04507"></a><span class="lineno"> 4507</span> <span class="keyword">const</span> int64_t next_next = model_->NextVar(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)->Value();</div>
|
|
<div class="line"><a id="l04508" name="l04508"></a><span class="lineno"> 4508</span> <span class="keyword">const</span> int64_t serving_vehicle = model_->VehicleVar(node)->Value();</div>
|
|
<div class="line"><a id="l04509" name="l04509"></a><span class="lineno"> 4509</span> <a class="code hl_define" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(serving_vehicle, model_->VehicleVar(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)->Value());</div>
|
|
<div class="line"><a id="l04510" name="l04510"></a><span class="lineno"> 4510</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1_routing_model_1_1_state_dependent_transit.html">RoutingModel::StateDependentTransit</a> transit_from_next =</div>
|
|
<div class="line"><a id="l04511" name="l04511"></a><span class="lineno"> 4511</span> model_->StateDependentTransitCallback(</div>
|
|
<div class="line"><a id="l04512" name="l04512"></a><span class="lineno"> 4512</span> state_dependent_class_evaluators_</div>
|
|
<div class="line"><a id="l04513" name="l04513"></a><span class="lineno"> 4513</span> [state_dependent_vehicle_to_class_[serving_vehicle]])(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>,</div>
|
|
<div class="line"><a id="l04514" name="l04514"></a><span class="lineno"> 4514</span> next_next);</div>
|
|
<div class="line"><a id="l04515" name="l04515"></a><span class="lineno"> 4515</span> <span class="comment">// We have that transit[i+1] is a function of cumul[i+1].</span></div>
|
|
<div class="line"><a id="l04516" name="l04516"></a><span class="lineno"> 4516</span> <span class="keyword">const</span> int64_t next_cumul_min = CumulVar(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)->Min();</div>
|
|
<div class="line"><a id="l04517" name="l04517"></a><span class="lineno"> 4517</span> <span class="keyword">const</span> int64_t next_cumul_max = CumulVar(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)->Max();</div>
|
|
<div class="line"><a id="l04518" name="l04518"></a><span class="lineno"> 4518</span> <span class="keyword">const</span> int64_t optimal_next_cumul =</div>
|
|
<div class="line"><a id="l04519" name="l04519"></a><span class="lineno"> 4519</span> transit_from_next.<a class="code hl_variable" href="structoperations__research_1_1_routing_model_1_1_state_dependent_transit.html#ab71e287979b5c9040d1596d12ed3bb5f">transit_plus_identity</a>-><a class="code hl_function" href="classoperations__research_1_1_range_min_max_index_function.html#a9216044b741a3c1d663daab8ca0b18c6">RangeMinArgument</a>(</div>
|
|
<div class="line"><a id="l04520" name="l04520"></a><span class="lineno"> 4520</span> next_cumul_min, next_cumul_max + 1);</div>
|
|
<div class="line"><a id="l04521" name="l04521"></a><span class="lineno"> 4521</span> <span class="comment">// A few checks to make sure we're on the same page.</span></div>
|
|
<div class="line"><a id="l04522" name="l04522"></a><span class="lineno"> 4522</span> <a class="code hl_define" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(next_cumul_min, optimal_next_cumul);</div>
|
|
<div class="line"><a id="l04523" name="l04523"></a><span class="lineno"> 4523</span> <a class="code hl_define" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(optimal_next_cumul, next_cumul_max);</div>
|
|
<div class="line"><a id="l04524" name="l04524"></a><span class="lineno"> 4524</span> <span class="comment">// optimal_next_cumul = cumul + transit + optimal_slack, so</span></div>
|
|
<div class="line"><a id="l04525" name="l04525"></a><span class="lineno"> 4525</span> <span class="comment">// optimal_slack = optimal_next_cumul - cumul - transit.</span></div>
|
|
<div class="line"><a id="l04526" name="l04526"></a><span class="lineno"> 4526</span> <span class="comment">// In the current implementation TransitVar(i) = transit[i] + slack[i], so we</span></div>
|
|
<div class="line"><a id="l04527" name="l04527"></a><span class="lineno"> 4527</span> <span class="comment">// have to find the transit from the evaluators.</span></div>
|
|
<div class="line"><a id="l04528" name="l04528"></a><span class="lineno"> 4528</span> <span class="keyword">const</span> int64_t current_cumul = CumulVar(node)->Value();</div>
|
|
<div class="line"><a id="l04529" name="l04529"></a><span class="lineno"> 4529</span> <span class="keyword">const</span> int64_t current_state_independent_transit = model_->TransitCallback(</div>
|
|
<div class="line"><a id="l04530" name="l04530"></a><span class="lineno"> 4530</span> class_evaluators_[vehicle_to_class_[serving_vehicle]])(node, <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a id="l04531" name="l04531"></a><span class="lineno"> 4531</span> <span class="keyword">const</span> int64_t current_state_dependent_transit =</div>
|
|
<div class="line"><a id="l04532" name="l04532"></a><span class="lineno"> 4532</span> model_</div>
|
|
<div class="line"><a id="l04533" name="l04533"></a><span class="lineno"> 4533</span> ->StateDependentTransitCallback(</div>
|
|
<div class="line"><a id="l04534" name="l04534"></a><span class="lineno"> 4534</span> state_dependent_class_evaluators_</div>
|
|
<div class="line"><a id="l04535" name="l04535"></a><span class="lineno"> 4535</span> [state_dependent_vehicle_to_class_[serving_vehicle]])(node,</div>
|
|
<div class="line"><a id="l04536" name="l04536"></a><span class="lineno"> 4536</span> <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>)</div>
|
|
<div class="line"><a id="l04537" name="l04537"></a><span class="lineno"> 4537</span> .transit->Query(current_cumul);</div>
|
|
<div class="line"><a id="l04538" name="l04538"></a><span class="lineno"> 4538</span> <span class="keyword">const</span> int64_t optimal_slack = optimal_next_cumul - current_cumul -</div>
|
|
<div class="line"><a id="l04539" name="l04539"></a><span class="lineno"> 4539</span> current_state_independent_transit -</div>
|
|
<div class="line"><a id="l04540" name="l04540"></a><span class="lineno"> 4540</span> current_state_dependent_transit;</div>
|
|
<div class="line"><a id="l04541" name="l04541"></a><span class="lineno"> 4541</span> <a class="code hl_define" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(SlackVar(node)->Min(), optimal_slack);</div>
|
|
<div class="line"><a id="l04542" name="l04542"></a><span class="lineno"> 4542</span> <a class="code hl_define" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(optimal_slack, SlackVar(node)->Max());</div>
|
|
<div class="line"><a id="l04543" name="l04543"></a><span class="lineno"> 4543</span> <span class="keywordflow">return</span> optimal_slack;</div>
|
|
<div class="line"><a id="l04544" name="l04544"></a><span class="lineno"> 4544</span>}</div>
|
|
<div class="line"><a id="l04545" name="l04545"></a><span class="lineno"> 4545</span> </div>
|
|
<div class="line"><a id="l04546" name="l04546"></a><span class="lineno"> 4546</span><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l04547" name="l04547"></a><span class="lineno"> 4547</span><span class="keyword">class </span>GreedyDescentLSOperator : <span class="keyword">public</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_operator.html">LocalSearchOperator</a> {</div>
|
|
<div class="line"><a id="l04548" name="l04548"></a><span class="lineno"> 4548</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l04549" name="l04549"></a><span class="lineno"> 4549</span> <span class="keyword">explicit</span> GreedyDescentLSOperator(std::vector<IntVar*> variables);</div>
|
|
<div class="line"><a id="l04550" name="l04550"></a><span class="lineno"> 4550</span> </div>
|
|
<div class="line"><a id="l04551" name="l04551"></a><span class="lineno"> 4551</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_local_search_operator.html#a9bd1712271364632b22009ef10eb2172">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>, <a class="code hl_class" href="classoperations__research_1_1_assignment.html">Assignment</a>* deltadelta) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a id="l04552" name="l04552"></a><span class="lineno"> 4552</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_local_search_operator.html#ae8505ab0739cf0b585de5844f7a6703c">Start</a>(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_assignment.html">Assignment</a>* assignment) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a id="l04553" name="l04553"></a><span class="lineno"> 4553</span> </div>
|
|
<div class="line"><a id="l04554" name="l04554"></a><span class="lineno"> 4554</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l04555" name="l04555"></a><span class="lineno"> 4555</span> int64_t FindMaxDistanceToDomain(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_assignment.html">Assignment</a>* assignment);</div>
|
|
<div class="line"><a id="l04556" name="l04556"></a><span class="lineno"> 4556</span> </div>
|
|
<div class="line"><a id="l04557" name="l04557"></a><span class="lineno"> 4557</span> <span class="keyword">const</span> std::vector<IntVar*> variables_;</div>
|
|
<div class="line"><a id="l04558" name="l04558"></a><span class="lineno"> 4558</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_assignment.html">Assignment</a>* center_;</div>
|
|
<div class="line"><a id="l04559" name="l04559"></a><span class="lineno"> 4559</span> int64_t current_step_;</div>
|
|
<div class="line"><a id="l04560" name="l04560"></a><span class="lineno"> 4560</span> <span class="comment">// The deltas are returned in this order:</span></div>
|
|
<div class="line"><a id="l04561" name="l04561"></a><span class="lineno"> 4561</span> <span class="comment">// (current_step_, 0, ... 0), (-current_step_, 0, ... 0),</span></div>
|
|
<div class="line"><a id="l04562" name="l04562"></a><span class="lineno"> 4562</span> <span class="comment">// (0, current_step_, ... 0), (0, -current_step_, ... 0),</span></div>
|
|
<div class="line"><a id="l04563" name="l04563"></a><span class="lineno"> 4563</span> <span class="comment">// ...</span></div>
|
|
<div class="line"><a id="l04564" name="l04564"></a><span class="lineno"> 4564</span> <span class="comment">// (0, ... 0, current_step_), (0, ... 0, -current_step_).</span></div>
|
|
<div class="line"><a id="l04565" name="l04565"></a><span class="lineno"> 4565</span> <span class="comment">// current_direction_ keeps track what was the last returned delta.</span></div>
|
|
<div class="line"><a id="l04566" name="l04566"></a><span class="lineno"> 4566</span> int64_t current_direction_;</div>
|
|
<div class="line"><a id="l04567" name="l04567"></a><span class="lineno"> 4567</span> </div>
|
|
<div class="line"><a id="l04568" name="l04568"></a><span class="lineno"> 4568</span> <a class="code hl_define" href="macros_8h.html#af8df3547bfde53a5acb93e2607b0034a">DISALLOW_COPY_AND_ASSIGN</a>(GreedyDescentLSOperator);</div>
|
|
<div class="line"><a id="l04569" name="l04569"></a><span class="lineno"> 4569</span>};</div>
|
|
<div class="line"><a id="l04570" name="l04570"></a><span class="lineno"> 4570</span> </div>
|
|
<div class="line"><a id="l04571" name="l04571"></a><span class="lineno"> 4571</span>GreedyDescentLSOperator::GreedyDescentLSOperator(std::vector<IntVar*> variables)</div>
|
|
<div class="line"><a id="l04572" name="l04572"></a><span class="lineno"> 4572</span> : variables_(<a class="code hl_namespace" href="namespacestd.html">std</a>::move(variables)),</div>
|
|
<div class="line"><a id="l04573" name="l04573"></a><span class="lineno"> 4573</span> center_(nullptr),</div>
|
|
<div class="line"><a id="l04574" name="l04574"></a><span class="lineno"> 4574</span> current_step_(0),</div>
|
|
<div class="line"><a id="l04575" name="l04575"></a><span class="lineno"> 4575</span> current_direction_(0) {}</div>
|
|
<div class="line"><a id="l04576" name="l04576"></a><span class="lineno"> 4576</span> </div>
|
|
<div class="line"><a id="l04577" name="l04577"></a><span class="lineno"> 4577</span><span class="keywordtype">bool</span> GreedyDescentLSOperator::MakeNextNeighbor(Assignment* <a class="code hl_variable" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a>,</div>
|
|
<div class="line"><a id="l04578" name="l04578"></a><span class="lineno"> 4578</span> Assignment* <span class="comment">/*deltadelta*/</span>) {</div>
|
|
<div class="line"><a id="l04579" name="l04579"></a><span class="lineno"> 4579</span> <span class="keyword">static</span> <span class="keyword">const</span> int64_t sings[] = {1, -1};</div>
|
|
<div class="line"><a id="l04580" name="l04580"></a><span class="lineno"> 4580</span> <span class="keywordflow">for</span> (; 1 <= current_step_; current_step_ /= 2) {</div>
|
|
<div class="line"><a id="l04581" name="l04581"></a><span class="lineno"> 4581</span> <span class="keywordflow">for</span> (; current_direction_ < 2 * variables_.size();) {</div>
|
|
<div class="line"><a id="l04582" name="l04582"></a><span class="lineno"> 4582</span> <span class="keyword">const</span> int64_t variable_idx = current_direction_ / 2;</div>
|
|
<div class="line"><a id="l04583" name="l04583"></a><span class="lineno"> 4583</span> IntVar* <span class="keyword">const</span> variable = variables_[variable_idx];</div>
|
|
<div class="line"><a id="l04584" name="l04584"></a><span class="lineno"> 4584</span> <span class="keyword">const</span> int64_t sign_index = current_direction_ % 2;</div>
|
|
<div class="line"><a id="l04585" name="l04585"></a><span class="lineno"> 4585</span> <span class="keyword">const</span> int64_t sign = sings[sign_index];</div>
|
|
<div class="line"><a id="l04586" name="l04586"></a><span class="lineno"> 4586</span> <span class="keyword">const</span> int64_t offset = sign * current_step_;</div>
|
|
<div class="line"><a id="l04587" name="l04587"></a><span class="lineno"> 4587</span> <span class="keyword">const</span> int64_t new_value = center_-><a class="code hl_function" href="classoperations__research_1_1_assignment.html#a8e0cac088b44596d620963b8bc693770">Value</a>(variable) + offset;</div>
|
|
<div class="line"><a id="l04588" name="l04588"></a><span class="lineno"> 4588</span> ++current_direction_;</div>
|
|
<div class="line"><a id="l04589" name="l04589"></a><span class="lineno"> 4589</span> <span class="keywordflow">if</span> (variable->Contains(new_value)) {</div>
|
|
<div class="line"><a id="l04590" name="l04590"></a><span class="lineno"> 4590</span> <a class="code hl_variable" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a>->Add(variable);</div>
|
|
<div class="line"><a id="l04591" name="l04591"></a><span class="lineno"> 4591</span> <a class="code hl_variable" href="resource_8cc.html#af12056bc2a8e3ec563f0940d87abbd2e">delta</a>->SetValue(variable, new_value);</div>
|
|
<div class="line"><a id="l04592" name="l04592"></a><span class="lineno"> 4592</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l04593" name="l04593"></a><span class="lineno"> 4593</span> }</div>
|
|
<div class="line"><a id="l04594" name="l04594"></a><span class="lineno"> 4594</span> }</div>
|
|
<div class="line"><a id="l04595" name="l04595"></a><span class="lineno"> 4595</span> current_direction_ = 0;</div>
|
|
<div class="line"><a id="l04596" name="l04596"></a><span class="lineno"> 4596</span> }</div>
|
|
<div class="line"><a id="l04597" name="l04597"></a><span class="lineno"> 4597</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l04598" name="l04598"></a><span class="lineno"> 4598</span>}</div>
|
|
<div class="line"><a id="l04599" name="l04599"></a><span class="lineno"> 4599</span> </div>
|
|
<div class="line"><a id="l04600" name="l04600"></a><span class="lineno"> 4600</span><span class="keywordtype">void</span> GreedyDescentLSOperator::Start(<span class="keyword">const</span> Assignment* assignment) {</div>
|
|
<div class="line"><a id="l04601" name="l04601"></a><span class="lineno"> 4601</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(assignment != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l04602" name="l04602"></a><span class="lineno"> 4602</span> current_step_ = FindMaxDistanceToDomain(assignment);</div>
|
|
<div class="line"><a id="l04603" name="l04603"></a><span class="lineno"> 4603</span> center_ = assignment;</div>
|
|
<div class="line"><a id="l04604" name="l04604"></a><span class="lineno"> 4604</span>}</div>
|
|
<div class="line"><a id="l04605" name="l04605"></a><span class="lineno"> 4605</span> </div>
|
|
<div class="line"><a id="l04606" name="l04606"></a><span class="lineno"> 4606</span>int64_t GreedyDescentLSOperator::FindMaxDistanceToDomain(</div>
|
|
<div class="line"><a id="l04607" name="l04607"></a><span class="lineno"> 4607</span> <span class="keyword">const</span> Assignment* assignment) {</div>
|
|
<div class="line"><a id="l04608" name="l04608"></a><span class="lineno"> 4608</span> int64_t result = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>();</div>
|
|
<div class="line"><a id="l04609" name="l04609"></a><span class="lineno"> 4609</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> IntVar* <span class="keyword">const</span> <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : variables_) {</div>
|
|
<div class="line"><a id="l04610" name="l04610"></a><span class="lineno"> 4610</span> result = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(result, std::abs(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#ac84c250d67f30c89e845cd460eeaaad8">Max</a>() - assignment->Value(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)));</div>
|
|
<div class="line"><a id="l04611" name="l04611"></a><span class="lineno"> 4611</span> result = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(result, std::abs(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#a62b340f6d1dde6a36560bd88a382ada7">Min</a>() - assignment->Value(<a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)));</div>
|
|
<div class="line"><a id="l04612" name="l04612"></a><span class="lineno"> 4612</span> }</div>
|
|
<div class="line"><a id="l04613" name="l04613"></a><span class="lineno"> 4613</span> <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a id="l04614" name="l04614"></a><span class="lineno"> 4614</span>}</div>
|
|
<div class="line"><a id="l04615" name="l04615"></a><span class="lineno"> 4615</span>} <span class="comment">// namespace</span></div>
|
|
<div class="line"><a id="l04616" name="l04616"></a><span class="lineno"> 4616</span> </div>
|
|
<div class="line"><a id="l04617" name="l04617"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_model.html#a43b2c4a7a4f58c02ca36ed0a4d76a3b4"> 4617</a></span>std::unique_ptr<LocalSearchOperator> <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a43b2c4a7a4f58c02ca36ed0a4d76a3b4">RoutingModel::MakeGreedyDescentLSOperator</a>(</div>
|
|
<div class="line"><a id="l04618" name="l04618"></a><span class="lineno"> 4618</span> std::vector<IntVar*> variables) {</div>
|
|
<div class="line"><a id="l04619" name="l04619"></a><span class="lineno"> 4619</span> <span class="keywordflow">return</span> std::unique_ptr<LocalSearchOperator>(</div>
|
|
<div class="line"><a id="l04620" name="l04620"></a><span class="lineno"> 4620</span> <span class="keyword">new</span> GreedyDescentLSOperator(std::move(variables)));</div>
|
|
<div class="line"><a id="l04621" name="l04621"></a><span class="lineno"> 4621</span>}</div>
|
|
<div class="line"><a id="l04622" name="l04622"></a><span class="lineno"> 4622</span> </div>
|
|
<div class="line"><a id="l04623" name="l04623"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_model.html#acb94aaffe504b1b6873c3400a8edceaa"> 4623</a></span><a class="code hl_class" href="classoperations__research_1_1_decision_builder.html">DecisionBuilder</a>* <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#acb94aaffe504b1b6873c3400a8edceaa">RoutingModel::MakeSelfDependentDimensionFinalizer</a>(</div>
|
|
<div class="line"><a id="l04624" name="l04624"></a><span class="lineno"> 4624</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* dimension) {</div>
|
|
<div class="line"><a id="l04625" name="l04625"></a><span class="lineno"> 4625</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(dimension != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l04626" name="l04626"></a><span class="lineno"> 4626</span> <a class="code hl_define" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(dimension-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#acbd21042416aba96c504e1a9c15b0b60">base_dimension</a>() == dimension);</div>
|
|
<div class="line"><a id="l04627" name="l04627"></a><span class="lineno"> 4627</span> std::function<int64_t(int64_t)> slack_guide = [dimension](int64_t <a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>) {</div>
|
|
<div class="line"><a id="l04628" name="l04628"></a><span class="lineno"> 4628</span> <span class="keywordflow">return</span> dimension-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#aa92333e706853d147814ecd3426a0c1d">ShortestTransitionSlack</a>(<a class="code hl_variable" href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a>);</div>
|
|
<div class="line"><a id="l04629" name="l04629"></a><span class="lineno"> 4629</span> };</div>
|
|
<div class="line"><a id="l04630" name="l04630"></a><span class="lineno"> 4630</span> <a class="code hl_class" href="classoperations__research_1_1_decision_builder.html">DecisionBuilder</a>* <span class="keyword">const</span> guided_finalizer =</div>
|
|
<div class="line"><a id="l04631" name="l04631"></a><span class="lineno"> 4631</span> <a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aba3eb59d97b0beef7f153ada8fe862f7">MakeGuidedSlackFinalizer</a>(dimension, slack_guide);</div>
|
|
<div class="line"><a id="l04632" name="l04632"></a><span class="lineno"> 4632</span> <a class="code hl_class" href="classoperations__research_1_1_decision_builder.html">DecisionBuilder</a>* <span class="keyword">const</span> slacks_finalizer =</div>
|
|
<div class="line"><a id="l04633" name="l04633"></a><span class="lineno"> 4633</span> solver_->MakeSolveOnce(guided_finalizer);</div>
|
|
<div class="line"><a id="l04634" name="l04634"></a><span class="lineno"> 4634</span> std::vector<IntVar*> start_cumuls(vehicles_, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l04635" name="l04635"></a><span class="lineno"> 4635</span> <span class="keywordflow">for</span> (int64_t vehicle_idx = 0; vehicle_idx < vehicles_; ++vehicle_idx) {</div>
|
|
<div class="line"><a id="l04636" name="l04636"></a><span class="lineno"> 4636</span> start_cumuls[vehicle_idx] = dimension-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a3a71e48b4ed287752b9d9d9f7086ec7d">CumulVar</a>(starts_[vehicle_idx]);</div>
|
|
<div class="line"><a id="l04637" name="l04637"></a><span class="lineno"> 4637</span> }</div>
|
|
<div class="line"><a id="l04638" name="l04638"></a><span class="lineno"> 4638</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_operator.html">LocalSearchOperator</a>* <span class="keyword">const</span> hill_climber =</div>
|
|
<div class="line"><a id="l04639" name="l04639"></a><span class="lineno"> 4639</span> solver_->RevAlloc(<span class="keyword">new</span> GreedyDescentLSOperator(start_cumuls));</div>
|
|
<div class="line"><a id="l04640" name="l04640"></a><span class="lineno"> 4640</span> <a class="code hl_class" href="classoperations__research_1_1_local_search_phase_parameters.html">LocalSearchPhaseParameters</a>* <span class="keyword">const</span> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a> =</div>
|
|
<div class="line"><a id="l04641" name="l04641"></a><span class="lineno"> 4641</span> solver_->MakeLocalSearchPhaseParameters(<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#abb61fc6939fecebe93387f63319d2b7f">CostVar</a>(), hill_climber,</div>
|
|
<div class="line"><a id="l04642" name="l04642"></a><span class="lineno"> 4642</span> slacks_finalizer);</div>
|
|
<div class="line"><a id="l04643" name="l04643"></a><span class="lineno"> 4643</span> <a class="code hl_class" href="classoperations__research_1_1_assignment.html">Assignment</a>* <span class="keyword">const</span> first_solution = solver_->MakeAssignment();</div>
|
|
<div class="line"><a id="l04644" name="l04644"></a><span class="lineno"> 4644</span> first_solution-><a class="code hl_function" href="classoperations__research_1_1_assignment.html#ae8ff1d18d50b93a2499ccd7130addecb">Add</a>(start_cumuls);</div>
|
|
<div class="line"><a id="l04645" name="l04645"></a><span class="lineno"> 4645</span> <span class="keywordflow">for</span> (<a class="code hl_class" href="classoperations__research_1_1_int_var.html">IntVar</a>* <span class="keyword">const</span> cumul : start_cumuls) {</div>
|
|
<div class="line"><a id="l04646" name="l04646"></a><span class="lineno"> 4646</span> first_solution-><a class="code hl_function" href="classoperations__research_1_1_assignment.html#a88515905299f569432aaba577a912add">SetValue</a>(cumul, cumul->Min());</div>
|
|
<div class="line"><a id="l04647" name="l04647"></a><span class="lineno"> 4647</span> }</div>
|
|
<div class="line"><a id="l04648" name="l04648"></a><span class="lineno"> 4648</span> <a class="code hl_class" href="classoperations__research_1_1_decision_builder.html">DecisionBuilder</a>* <span class="keyword">const</span> finalizer =</div>
|
|
<div class="line"><a id="l04649" name="l04649"></a><span class="lineno"> 4649</span> solver_->MakeLocalSearchPhase(first_solution, <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>);</div>
|
|
<div class="line"><a id="l04650" name="l04650"></a><span class="lineno"> 4650</span> <span class="keywordflow">return</span> finalizer;</div>
|
|
<div class="line"><a id="l04651" name="l04651"></a><span class="lineno"> 4651</span>}</div>
|
|
<div class="line"><a id="l04652" name="l04652"></a><span class="lineno"> 4652</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="ttc" id="aadjustable__priority__queue-inl_8h_html"><div class="ttname"><a href="adjustable__priority__queue-inl_8h.html">adjustable_priority_queue-inl.h</a></div></div>
|
|
<div class="ttc" id="aadjustable__priority__queue_8h_html"><div class="ttname"><a href="adjustable__priority__queue_8h.html">adjustable_priority_queue.h</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a151248525a9e07eb3e6e60ea1c4995eb"><div class="ttname"><a href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a></div><div class="ttdeci">const std::vector< IntVar * > vars_</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00044">alldiff_cst.cc:44</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_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_a4bd2e815ca2f702a4b6aa744b1ff3b82"><div class="ttname"><a href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a></div><div class="ttdeci">#define CHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00706">base/logging.h:706</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00703">base/logging.h:703</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7cc25402ecd7591b4c39934dd656b1f9"><div class="ttname"><a href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a></div><div class="ttdeci">#define CHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00707">base/logging.h:707</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7e03ec13560fa94a8fea569960d7efc6"><div class="ttname"><a href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a></div><div class="ttdeci">#define CHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00708">base/logging.h:708</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_ab4f56aa24c4c9cddc47a6abd2d747f9a"><div class="ttname"><a href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a></div><div class="ttdeci">#define DCHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00896">base/logging.h:896</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_ae4db23f10f5d4aad6d735f5a74cd6f8c"><div class="ttname"><a href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a></div><div class="ttdeci">#define CHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00705">base/logging.h:705</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_aeef651f886eb5252c08835194213efe2"><div class="ttname"><a href="base_2logging_8h.html#aeef651f886eb5252c08835194213efe2">ABSL_DIE_IF_NULL</a></div><div class="ttdeci">#define ABSL_DIE_IF_NULL</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00043">base/logging.h:43</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="achristofides_8h_html"><div class="ttname"><a href="christofides_8h.html">christofides.h</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html"><div class="ttname"><a href="class_adjustable_priority_queue.html">AdjustablePriorityQueue</a></div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00038">adjustable_priority_queue.h:38</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html_a36647f60b5f27624275724445403ea1d"><div class="ttname"><a href="class_adjustable_priority_queue.html#a36647f60b5f27624275724445403ea1d">AdjustablePriorityQueue::Remove</a></div><div class="ttdeci">void Remove(T *val)</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00056">adjustable_priority_queue.h:56</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html_a503e1bfef34fc7acf03340ddd74b5872"><div class="ttname"><a href="class_adjustable_priority_queue.html#a503e1bfef34fc7acf03340ddd74b5872">AdjustablePriorityQueue::Top</a></div><div class="ttdeci">T * Top()</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00087">adjustable_priority_queue.h:87</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html_a506169056c5f470fabdf77aa1934a5a3"><div class="ttname"><a href="class_adjustable_priority_queue.html#a506169056c5f470fabdf77aa1934a5a3">AdjustablePriorityQueue::NoteChangedPriority</a></div><div class="ttdeci">void NoteChangedPriority(T *val)</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00074">adjustable_priority_queue.h:74</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html_a7d1005d75f40525f91a2acb84348bc3c"><div class="ttname"><a href="class_adjustable_priority_queue.html#a7d1005d75f40525f91a2acb84348bc3c">AdjustablePriorityQueue::Contains</a></div><div class="ttdeci">bool Contains(const T *val) const</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00069">adjustable_priority_queue.h:69</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html_a8e12342fc420701fbffd97025421575a"><div class="ttname"><a href="class_adjustable_priority_queue.html#a8e12342fc420701fbffd97025421575a">AdjustablePriorityQueue::IsEmpty</a></div><div class="ttdeci">bool IsEmpty() const</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00127">adjustable_priority_queue.h:127</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="class_adjustable_priority_queue.html#aa71d36872f416feaa853788a7a7a7ef8">AdjustablePriorityQueue::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00129">adjustable_priority_queue.h:129</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html_ac312fa979ea8afd5deabd6b581b3bb1f"><div class="ttname"><a href="class_adjustable_priority_queue.html#ac312fa979ea8afd5deabd6b581b3bb1f">AdjustablePriorityQueue::Add</a></div><div class="ttdeci">void Add(T *val)</div><div class="ttdef"><b>Definition:</b> <a href="adjustable__priority__queue_8h_source.html#l00049">adjustable_priority_queue.h:49</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_container_html"><div class="ttname"><a href="classoperations__research_1_1_assignment_container.html">operations_research::AssignmentContainer< IntVar, IntVarElement ></a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_container_html_a24926108b770033792d015cb86aeffb3"><div class="ttname"><a href="classoperations__research_1_1_assignment_container.html#a24926108b770033792d015cb86aeffb3">operations_research::AssignmentContainer::Size</a></div><div class="ttdeci">int Size() const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l05000">constraint_solver.h:5000</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_container_html_a574bbe757dd231a59843422be3145dee"><div class="ttname"><a href="classoperations__research_1_1_assignment_container.html#a574bbe757dd231a59843422be3145dee">operations_research::AssignmentContainer::Element</a></div><div class="ttdeci">const E & Element(const V *const var) const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04984">constraint_solver.h:4984</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_container_html_a662646ce0309b7580051cdeb4f8a4d5a"><div class="ttname"><a href="classoperations__research_1_1_assignment_container.html#a662646ce0309b7580051cdeb4f8a4d5a">operations_research::AssignmentContainer::AddAtPosition</a></div><div class="ttdeci">E * AddAtPosition(V *var, int position)</div><div class="ttdoc">Advanced usage: Adds element at a given position; position has to have been allocated with Assignment...</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04922">constraint_solver.h:4922</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_container_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="classoperations__research_1_1_assignment_container.html#aa71d36872f416feaa853788a7a7a7ef8">operations_research::AssignmentContainer::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04926">constraint_solver.h:4926</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_container_html_ad9cf0e91780366986c2f047bd796cdd5"><div class="ttname"><a href="classoperations__research_1_1_assignment_container.html#ad9cf0e91780366986c2f047bd796cdd5">operations_research::AssignmentContainer::Resize</a></div><div class="ttdeci">void Resize(size_t size)</div><div class="ttdoc">Advanced usage: Resizes the container, potentially adding elements with null variables.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04934">constraint_solver.h:4934</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_html"><div class="ttname"><a href="classoperations__research_1_1_assignment.html">operations_research::Assignment</a></div><div class="ttdoc">An Assignment is a variable -> domains mapping, used to report solutions to the user.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l05081">constraint_solver.h:5081</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_html_a1896fe755b612dbebd2c46638f8977a2"><div class="ttname"><a href="classoperations__research_1_1_assignment.html#a1896fe755b612dbebd2c46638f8977a2">operations_research::Assignment::Restore</a></div><div class="ttdeci">void Restore()</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2assignment_8cc_source.html#l00437">constraint_solver/assignment.cc:437</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_html_a88515905299f569432aaba577a912add"><div class="ttname"><a href="classoperations__research_1_1_assignment.html#a88515905299f569432aaba577a912add">operations_research::Assignment::SetValue</a></div><div class="ttdeci">void SetValue(const IntVar *const var, int64_t value)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2assignment_8cc_source.html#l00682">constraint_solver/assignment.cc:682</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_html_a8e0cac088b44596d620963b8bc693770"><div class="ttname"><a href="classoperations__research_1_1_assignment.html#a8e0cac088b44596d620963b8bc693770">operations_research::Assignment::Value</a></div><div class="ttdeci">int64_t Value(const IntVar *const var) const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2assignment_8cc_source.html#l00662">constraint_solver/assignment.cc:662</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="classoperations__research_1_1_assignment.html#aa71d36872f416feaa853788a7a7a7ef8">operations_research::Assignment::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2assignment_8cc_source.html#l00421">constraint_solver/assignment.cc:421</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_html_ac76f6d6854dc981871832c7714c4a4bb"><div class="ttname"><a href="classoperations__research_1_1_assignment.html#ac76f6d6854dc981871832c7714c4a4bb">operations_research::Assignment::MutableIntVarContainer</a></div><div class="ttdeci">IntContainer * MutableIntVarContainer()</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l05233">constraint_solver.h:5233</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_html_ae8ff1d18d50b93a2499ccd7130addecb"><div class="ttname"><a href="classoperations__research_1_1_assignment.html#ae8ff1d18d50b93a2499ccd7130addecb">operations_research::Assignment::Add</a></div><div class="ttdeci">IntVarElement * Add(IntVar *const var)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2assignment_8cc_source.html#l00640">constraint_solver/assignment.cc:640</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_assignment_html_aedb0ae1cf8c3e89218604e5c039d6c7b"><div class="ttname"><a href="classoperations__research_1_1_assignment.html#aedb0ae1cf8c3e89218604e5c039d6c7b">operations_research::Assignment::IntVarContainer</a></div><div class="ttdeci">const IntContainer & IntVarContainer() const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l05232">constraint_solver.h:5232</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_addition_filtered_heuristic_html"><div class="ttname"><a href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html">operations_research::CheapestAdditionFilteredHeuristic</a></div><div class="ttdoc">Filtered-base decision builder based on the addition heuristic, extending a path from its start node ...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00805">routing_search.h:805</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_addition_filtered_heuristic_html_a2bc82055bf34be9162ce82b5d87b0289"><div class="ttname"><a href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">operations_research::CheapestAdditionFilteredHeuristic::BuildSolutionInternal</a></div><div class="ttdeci">bool BuildSolutionInternal() override</div><div class="ttdoc">Virtual method to redefine how to build a solution.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02428">routing_search.cc:2428</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_addition_filtered_heuristic_html_afec155b0f80a58cf5d632413078cc4f2"><div class="ttname"><a href="classoperations__research_1_1_cheapest_addition_filtered_heuristic.html#afec155b0f80a58cf5d632413078cc4f2">operations_research::CheapestAdditionFilteredHeuristic::CheapestAdditionFilteredHeuristic</a></div><div class="ttdeci">CheapestAdditionFilteredHeuristic(RoutingModel *model, LocalSearchFilterManager *filter_manager)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02424">routing_search.cc:2424</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html">operations_research::CheapestInsertionFilteredHeuristic</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00299">routing_search.h:299</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_a356517cd51c4b6259d7f439718719eaa"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a356517cd51c4b6259d7f439718719eaa">operations_research::CheapestInsertionFilteredHeuristic::ComputeStartEndDistanceForVehicles</a></div><div class="ttdeci">std::vector< std::vector< StartEndValue > > ComputeStartEndDistanceForVehicles(const std::vector< int > &vehicles)</div><div class="ttdoc">Computes and returns the distance of each uninserted node to every vehicle in "vehicles" as a std::ve...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00535">routing_search.cc:535</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_a4c042f054da687c4a586dc5d3dfaef10"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a4c042f054da687c4a586dc5d3dfaef10">operations_research::CheapestInsertionFilteredHeuristic::evaluator_</a></div><div class="ttdeci">std::function< int64_t(int64_t, int64_t, int64_t)> evaluator_</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00380">routing_search.h:380</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_a69d38e86eb8fc2fa4df0d8839c8dd5a9"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a69d38e86eb8fc2fa4df0d8839c8dd5a9">operations_research::CheapestInsertionFilteredHeuristic::InitializePriorityQueue</a></div><div class="ttdeci">void InitializePriorityQueue(std::vector< std::vector< StartEndValue > > *start_end_distances_per_node, Queue *priority_queue)</div><div class="ttdoc">Initializes the priority_queue by inserting the best entry corresponding to each node,...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00586">routing_search.cc:586</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_a750200f78e5b4a8192dc7ad3b6b10eec"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#a750200f78e5b4a8192dc7ad3b6b10eec">operations_research::CheapestInsertionFilteredHeuristic::GetInsertionCostForNodeAtPosition</a></div><div class="ttdeci">int64_t GetInsertionCostForNodeAtPosition(int64_t node_to_insert, int64_t insert_after, int64_t insert_before, int vehicle) const</div><div class="ttdoc">Returns the cost of inserting 'node_to_insert' between 'insert_after' and 'insert_before' on the 'veh...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00644">routing_search.cc:644</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_aab2e87c6b0d1adc11fef2b9a9ea8d5a6"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#aab2e87c6b0d1adc11fef2b9a9ea8d5a6">operations_research::CheapestInsertionFilteredHeuristic::GetUnperformedValue</a></div><div class="ttdeci">int64_t GetUnperformedValue(int64_t node_to_insert) const</div><div class="ttdoc">Returns the cost of unperforming node 'node_to_insert'.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00653">routing_search.cc:653</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_ab757210526cd08167062c3bf8cf63982"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ab757210526cd08167062c3bf8cf63982">operations_research::CheapestInsertionFilteredHeuristic::penalty_evaluator_</a></div><div class="ttdeci">std::function< int64_t(int64_t)> penalty_evaluator_</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00381">routing_search.h:381</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_ac06fb0f5750600ea6fd0cba641f5e35f"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ac06fb0f5750600ea6fd0cba641f5e35f">operations_research::CheapestInsertionFilteredHeuristic::CheapestInsertionFilteredHeuristic</a></div><div class="ttdeci">CheapestInsertionFilteredHeuristic(RoutingModel *model, std::function< int64_t(int64_t, int64_t, int64_t)> evaluator, std::function< int64_t(int64_t)> penalty_evaluator, LocalSearchFilterManager *filter_manager)</div><div class="ttdoc">Takes ownership of evaluator.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00524">routing_search.cc:524</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_add2710777ca3960d37c6257cd95edfee"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#add2710777ca3960d37c6257cd95edfee">operations_research::CheapestInsertionFilteredHeuristic::InsertBetween</a></div><div class="ttdeci">void InsertBetween(int64_t node, int64_t predecessor, int64_t successor, int vehicle=-1)</div><div class="ttdoc">Inserts 'node' just after 'predecessor', and just before 'successor' on the route of 'vehicle',...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00606">routing_search.cc:606</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cheapest_insertion_filtered_heuristic_html_ade9dca16a1e0dc26a1a8797874413fad"><div class="ttname"><a href="classoperations__research_1_1_cheapest_insertion_filtered_heuristic.html#ade9dca16a1e0dc26a1a8797874413fad">operations_research::CheapestInsertionFilteredHeuristic::AppendInsertionPositionsAfter</a></div><div class="ttdeci">void AppendInsertionPositionsAfter(int64_t node_to_insert, int64_t start, int64_t next_after_start, int vehicle, std::vector< NodeInsertion > *node_insertions)</div><div class="ttdoc">Helper method to the ComputeEvaluatorSortedPositions* methods.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00620">routing_search.cc:620</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_christofides_filtered_heuristic_html_a2bc82055bf34be9162ce82b5d87b0289"><div class="ttname"><a href="classoperations__research_1_1_christofides_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">operations_research::ChristofidesFilteredHeuristic::BuildSolutionInternal</a></div><div class="ttdeci">bool BuildSolutionInternal() override</div><div class="ttdoc">Virtual method to redefine how to build a solution.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03653">routing_search.cc:3653</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_christofides_filtered_heuristic_html_af91a0a971d9bbdf32471d229a030a5fc"><div class="ttname"><a href="classoperations__research_1_1_christofides_filtered_heuristic.html#af91a0a971d9bbdf32471d229a030a5fc">operations_research::ChristofidesFilteredHeuristic::ChristofidesFilteredHeuristic</a></div><div class="ttdeci">ChristofidesFilteredHeuristic(RoutingModel *model, LocalSearchFilterManager *filter_manager, bool use_minimum_matching)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03646">routing_search.cc:3646</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_christofides_path_solver_html"><div class="ttname"><a href="classoperations__research_1_1_christofides_path_solver.html">operations_research::ChristofidesPathSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="christofides_8h_source.html#l00050">christofides.h:50</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_christofides_path_solver_html_a3076d9001536ea98d419faa81e7d8a47"><div class="ttname"><a href="classoperations__research_1_1_christofides_path_solver.html#a3076d9001536ea98d419faa81e7d8a47">operations_research::ChristofidesPathSolver::TravelingSalesmanPath</a></div><div class="ttdeci">std::vector< NodeIndex > TravelingSalesmanPath()</div><div class="ttdef"><b>Definition:</b> <a href="christofides_8h_source.html#l00241">christofides.h:241</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_christofides_path_solver_html_a942f29030f08426e7e318204e987e2f7"><div class="ttname"><a href="classoperations__research_1_1_christofides_path_solver.html#a942f29030f08426e7e318204e987e2f7">operations_research::ChristofidesPathSolver::Solve</a></div><div class="ttdeci">bool Solve()</div><div class="ttdef"><b>Definition:</b> <a href="christofides_8h_source.html#l00252">christofides.h:252</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_christofides_path_solver_html_ae2b64dddd58baf1bc5e01cb14971e52e"><div class="ttname"><a href="classoperations__research_1_1_christofides_path_solver.html#ae2b64dddd58baf1bc5e01cb14971e52e">operations_research::ChristofidesPathSolver::SetMatchingAlgorithm</a></div><div class="ttdeci">void SetMatchingAlgorithm(MatchingAlgorithm matching)</div><div class="ttdef"><b>Definition:</b> <a href="christofides_8h_source.html#l00069">christofides.h:69</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic_html_a760174569c84ca68a545381dad33b38c"><div class="ttname"><a href="classoperations__research_1_1_comparator_cheapest_addition_filtered_heuristic.html#a760174569c84ca68a545381dad33b38c">operations_research::ComparatorCheapestAdditionFilteredHeuristic::ComparatorCheapestAdditionFilteredHeuristic</a></div><div class="ttdeci">ComparatorCheapestAdditionFilteredHeuristic(RoutingModel *model, Solver::VariableValueComparator comparator, LocalSearchFilterManager *filter_manager)</div><div class="ttdoc">Takes ownership of evaluator.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02616">routing_search.cc:2617</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_decision_builder_html"><div class="ttname"><a href="classoperations__research_1_1_decision_builder.html">operations_research::DecisionBuilder</a></div><div class="ttdoc">A DecisionBuilder is responsible for creating the search tree.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03285">constraint_solver.h:3285</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_decision_html"><div class="ttname"><a href="classoperations__research_1_1_decision.html">operations_research::Decision</a></div><div class="ttdoc">A Decision represents a choice point in the search tree.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03245">constraint_solver.h:3245</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic_html_a3708f86f49ec8005ba0cd16a4bf9ab8f"><div class="ttname"><a href="classoperations__research_1_1_evaluator_cheapest_addition_filtered_heuristic.html#a3708f86f49ec8005ba0cd16a4bf9ab8f">operations_research::EvaluatorCheapestAdditionFilteredHeuristic::EvaluatorCheapestAdditionFilteredHeuristic</a></div><div class="ttdeci">EvaluatorCheapestAdditionFilteredHeuristic(RoutingModel *model, std::function< int64_t(int64_t, int64_t)> evaluator, LocalSearchFilterManager *filter_manager)</div><div class="ttdoc">Takes ownership of evaluator.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02574">routing_search.cc:2575</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00737">routing_search.cc:737</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html_a1288842502bf13a418539580ccdfa679"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a1288842502bf13a418539580ccdfa679">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry::operator<</a></div><div class="ttdeci">bool operator<(const NodeEntry &other) const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00746">routing_search.cc:746</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html_a22aa7b1daf1b464e9ec1b675390aca94"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry::vehicle</a></div><div class="ttdeci">int vehicle() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00766">routing_search.cc:766</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html_a307aa57dbe7730a98fc3c297c5924439"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a307aa57dbe7730a98fc3c297c5924439">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry::set_vehicle</a></div><div class="ttdeci">void set_vehicle(int vehicle)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00767">routing_search.cc:767</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html_a33395f038b6a134edbe336a9a65f97eb"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a33395f038b6a134edbe336a9a65f97eb">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry::insert_after</a></div><div class="ttdeci">int insert_after() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00764">routing_search.cc:764</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html_a356efb311b542164bd4667883d0973bb"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a356efb311b542164bd4667883d0973bb">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry::GetHeapIndex</a></div><div class="ttdeci">int GetHeapIndex() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00761">routing_search.cc:761</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html_a497aaa5a23f8532dfe19650423c0d977"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a497aaa5a23f8532dfe19650423c0d977">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry::NodeEntry</a></div><div class="ttdeci">NodeEntry(int node_to_insert, int insert_after, int vehicle, int64_t bucket)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00739">routing_search.cc:739</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html_a6fa49ad5682919b9982d9c7b55d21683"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#a6fa49ad5682919b9982d9c7b55d21683">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry::set_insert_after</a></div><div class="ttdeci">void set_insert_after(int insert_after)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00765">routing_search.cc:765</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html_ab87ca3233f48737b65fc2edb553575f9"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#ab87ca3233f48737b65fc2edb553575f9">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry::SetHeapIndex</a></div><div class="ttdeci">void SetHeapIndex(int h)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00760">routing_search.cc:760</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html_ae627561faf9239ac230cece97499aa62"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#ae627561faf9239ac230cece97499aa62">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry::set_value</a></div><div class="ttdeci">void set_value(int64_t value)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00762">routing_search.cc:762</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry_html_afab5e0005c90180f14fc2a92d965af11"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_node_entry.html#afab5e0005c90180f14fc2a92d965af11">operations_research::GlobalCheapestInsertionFilteredHeuristic::NodeEntry::node_to_insert</a></div><div class="ttdeci">int node_to_insert() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00763">routing_search.cc:763</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00678">routing_search.cc:678</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_a0c50cfb15d402d295b87b81310c486c5"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a0c50cfb15d402d295b87b81310c486c5">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::operator<</a></div><div class="ttdeci">bool operator<(const PairEntry &other) const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00693">routing_search.cc:693</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_a22aa7b1daf1b464e9ec1b675390aca94"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a22aa7b1daf1b464e9ec1b675390aca94">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::vehicle</a></div><div class="ttdeci">int vehicle() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00722">routing_search.cc:722</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_a307aa57dbe7730a98fc3c297c5924439"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a307aa57dbe7730a98fc3c297c5924439">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::set_vehicle</a></div><div class="ttdeci">void set_vehicle(int vehicle)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00723">routing_search.cc:723</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_a356efb311b542164bd4667883d0973bb"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a356efb311b542164bd4667883d0973bb">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::GetHeapIndex</a></div><div class="ttdeci">int GetHeapIndex() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00713">routing_search.cc:713</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_a7d3d92c5f0049a565a9683bf2d5883a6"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a7d3d92c5f0049a565a9683bf2d5883a6">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::PairEntry</a></div><div class="ttdeci">PairEntry(int pickup_to_insert, int pickup_insert_after, int delivery_to_insert, int delivery_insert_after, int vehicle, int64_t bucket)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00680">routing_search.cc:680</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_a8ce7a57de817af9900a5ce211fac39ec"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#a8ce7a57de817af9900a5ce211fac39ec">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::pickup_insert_after</a></div><div class="ttdeci">int pickup_insert_after() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00716">routing_search.cc:716</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_aa3ef697633fc4e2bfca732b37f4d6713"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#aa3ef697633fc4e2bfca732b37f4d6713">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::set_pickup_insert_after</a></div><div class="ttdeci">void set_pickup_insert_after(int pickup_insert_after)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00717">routing_search.cc:717</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_aab26acce6ace06adcdf9a2cb3a40b874"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#aab26acce6ace06adcdf9a2cb3a40b874">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::delivery_insert_after</a></div><div class="ttdeci">int delivery_insert_after() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00721">routing_search.cc:721</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_ab87ca3233f48737b65fc2edb553575f9"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#ab87ca3233f48737b65fc2edb553575f9">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::SetHeapIndex</a></div><div class="ttdeci">void SetHeapIndex(int h)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00712">routing_search.cc:712</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_ac555a592bc8f46d40e664dc2c663eae6"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#ac555a592bc8f46d40e664dc2c663eae6">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::delivery_to_insert</a></div><div class="ttdeci">int delivery_to_insert() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00720">routing_search.cc:720</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_ae627561faf9239ac230cece97499aa62"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#ae627561faf9239ac230cece97499aa62">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::set_value</a></div><div class="ttdeci">void set_value(int64_t value)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00714">routing_search.cc:714</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry_html_af73c9d66c39b338f5d4bf402664a6775"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_pair_entry.html#af73c9d66c39b338f5d4bf402664a6775">operations_research::GlobalCheapestInsertionFilteredHeuristic::PairEntry::pickup_to_insert</a></div><div class="ttdeci">int pickup_to_insert() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00715">routing_search.cc:715</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_html_a2bc82055bf34be9162ce82b5d87b0289"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">operations_research::GlobalCheapestInsertionFilteredHeuristic::BuildSolutionInternal</a></div><div class="ttdeci">bool BuildSolutionInternal() override</div><div class="ttdoc">Virtual method to redefine how to build a solution.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00916">routing_search.cc:916</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_html_a7aa80364c8c66a703b80f0bd883788ad"><div class="ttname"><a href="classoperations__research_1_1_global_cheapest_insertion_filtered_heuristic.html#a7aa80364c8c66a703b80f0bd883788ad">operations_research::GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionFilteredHeuristic</a></div><div class="ttdeci">GlobalCheapestInsertionFilteredHeuristic(RoutingModel *model, std::function< int64_t(int64_t, int64_t, int64_t)> evaluator, std::function< int64_t(int64_t)> penalty_evaluator, LocalSearchFilterManager *filter_manager, GlobalCheapestInsertionParameters parameters)</div><div class="ttdoc">Takes ownership of evaluators.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00780">routing_search.cc:781</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_init_and_get_values_html"><div class="ttname"><a href="classoperations__research_1_1_init_and_get_values.html">operations_research::InitAndGetValues</a></div><div class="ttdoc">Utility class to encapsulate an IntVarIterator and use it in a range-based loop.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03983">constraint_solver.h:3983</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_expr_html_a62b340f6d1dde6a36560bd88a382ada7"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#a62b340f6d1dde6a36560bd88a382ada7">operations_research::IntExpr::Min</a></div><div class="ttdeci">virtual int64_t Min() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_expr_html_ac84c250d67f30c89e845cd460eeaaad8"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#ac84c250d67f30c89e845cd460eeaaad8">operations_research::IntExpr::Max</a></div><div class="ttdeci">virtual int64_t Max() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_element_html"><div class="ttname"><a href="classoperations__research_1_1_int_var_element.html">operations_research::IntVarElement</a></div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04694">constraint_solver.h:4694</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_element_html_a15828fe5ecfdada586a63d916b7b7354"><div class="ttname"><a href="classoperations__research_1_1_int_var_element.html#a15828fe5ecfdada586a63d916b7b7354">operations_research::IntVarElement::Value</a></div><div class="ttdeci">int64_t Value() const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04718">constraint_solver.h:4718</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_element_html_ac1b2a58bfded95799de1fd7958bdb2a3"><div class="ttname"><a href="classoperations__research_1_1_int_var_element.html#ac1b2a58bfded95799de1fd7958bdb2a3">operations_research::IntVarElement::SetValue</a></div><div class="ttdeci">void SetValue(int64_t v)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04728">constraint_solver.h:4728</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_element_html_ad197164b669d8b5d35fc497754791e39"><div class="ttname"><a href="classoperations__research_1_1_int_var_element.html#ad197164b669d8b5d35fc497754791e39">operations_research::IntVarElement::Var</a></div><div class="ttdeci">IntVar * Var() const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04701">constraint_solver.h:4701</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_decision_builder_html_a8c71ca62b0ac538bf37374602e4259bb"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_decision_builder.html#a8c71ca62b0ac538bf37374602e4259bb">operations_research::IntVarFilteredDecisionBuilder::Next</a></div><div class="ttdeci">Decision * Next(Solver *solver) override</div><div class="ttdoc">This is the main method of the decision builder class.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00201">routing_search.cc:201</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_decision_builder_html_aac2118d22c4275990bdd1fec28a2a8d3"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_decision_builder.html#aac2118d22c4275990bdd1fec28a2a8d3">operations_research::IntVarFilteredDecisionBuilder::number_of_decisions</a></div><div class="ttdeci">int64_t number_of_decisions() const</div><div class="ttdoc">Returns statistics from its underlying heuristic.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00214">routing_search.cc:214</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_decision_builder_html_acf25bca8c52b674f343820aaf3d339b5"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_decision_builder.html#acf25bca8c52b674f343820aaf3d339b5">operations_research::IntVarFilteredDecisionBuilder::IntVarFilteredDecisionBuilder</a></div><div class="ttdeci">IntVarFilteredDecisionBuilder(std::unique_ptr< IntVarFilteredHeuristic > heuristic)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00197">routing_search.cc:197</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_decision_builder_html_aed804747c45a7e1caf81461f9e45dd91"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_decision_builder.html#aed804747c45a7e1caf81461f9e45dd91">operations_research::IntVarFilteredDecisionBuilder::DebugString</a></div><div class="ttdeci">std::string DebugString() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00222">routing_search.cc:222</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_decision_builder_html_afd4b70bcd23086d4968db3a1d822ee2c"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_decision_builder.html#afd4b70bcd23086d4968db3a1d822ee2c">operations_research::IntVarFilteredDecisionBuilder::number_of_rejects</a></div><div class="ttdeci">int64_t number_of_rejects() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00218">routing_search.cc:218</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html">operations_research::IntVarFilteredHeuristic</a></div><div class="ttdoc">Generic filter-based heuristic applied to IntVars.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00162">routing_search.h:162</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a0482d92187ca6a3a2b0b46a009ef24e8"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0482d92187ca6a3a2b0b46a009ef24e8">operations_research::IntVarFilteredHeuristic::SetValue</a></div><div class="ttdeci">void SetValue(int64_t index, int64_t value)</div><div class="ttdoc">Modifies the current solution by setting the variable of index 'index' to value 'value'.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00200">routing_search.h:200</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a0c46fa4dcc0fed2329041bbe90fc575a"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0c46fa4dcc0fed2329041bbe90fc575a">operations_research::IntVarFilteredHeuristic::BuildSolutionInternal</a></div><div class="ttdeci">virtual bool BuildSolutionInternal()=0</div><div class="ttdoc">Virtual method to redefine how to build a solution.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a0d549adeef4a45d3078daf3d7918b253"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a0d549adeef4a45d3078daf3d7918b253">operations_research::IntVarFilteredHeuristic::SecondaryVarIndex</a></div><div class="ttdeci">int64_t SecondaryVarIndex(int64_t index) const</div><div class="ttdoc">Returns the index of a secondary var.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00224">routing_search.h:224</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a24926108b770033792d015cb86aeffb3"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a24926108b770033792d015cb86aeffb3">operations_research::IntVarFilteredHeuristic::Size</a></div><div class="ttdeci">int Size() const</div><div class="ttdoc">Returns the number of variables the decision builder is trying to instantiate.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00220">routing_search.h:220</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a2f14293a2b4f700691aa788d202004e4"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a2f14293a2b4f700691aa788d202004e4">operations_research::IntVarFilteredHeuristic::Contains</a></div><div class="ttdeci">bool Contains(int64_t index) const</div><div class="ttdoc">Returns true if the variable of index 'index' is in the current solution.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00215">routing_search.h:215</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a6743122cc2fc4818b402ba3d484c6ea4"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a6743122cc2fc4818b402ba3d484c6ea4">operations_research::IntVarFilteredHeuristic::assignment_</a></div><div class="ttdeci">Assignment *const assignment_</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00235">routing_search.h:235</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a7ae7a2033e2a22ad1dedbf2f3ec8745f"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a7ae7a2033e2a22ad1dedbf2f3ec8745f">operations_research::IntVarFilteredHeuristic::ResetSolution</a></div><div class="ttdeci">void ResetSolution()</div><div class="ttdoc">Resets the data members for a new solution.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00253">routing_search.cc:253</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a8447b106d07db2466b60e534964730d3"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a8447b106d07db2466b60e534964730d3">operations_research::IntVarFilteredHeuristic::SynchronizeFilters</a></div><div class="ttdeci">void SynchronizeFilters()</div><div class="ttdoc">Synchronizes filters with an assignment (the current solution).</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00350">routing_search.cc:350</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_a9d72d8f26ae6d9340f48eb0340c264d1"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#a9d72d8f26ae6d9340f48eb0340c264d1">operations_research::IntVarFilteredHeuristic::HasSecondaryVars</a></div><div class="ttdeci">bool HasSecondaryVars() const</div><div class="ttdoc">Returns true if there are secondary variables.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00229">routing_search.h:229</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_aa1103b3a47f7bf316a81ed91ba3e4657"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#aa1103b3a47f7bf316a81ed91ba3e4657">operations_research::IntVarFilteredHeuristic::InitializeSolution</a></div><div class="ttdeci">virtual bool InitializeSolution()</div><div class="ttdoc">Virtual method to initialize the solution.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00185">routing_search.h:185</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_abd977c8d4bb6eae7fd1037091282050f"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#abd977c8d4bb6eae7fd1037091282050f">operations_research::IntVarFilteredHeuristic::Var</a></div><div class="ttdeci">IntVar * Var(int64_t index) const</div><div class="ttdoc">Returns the variable of index 'index'.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00222">routing_search.h:222</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_ac377ad448d6eefca4e56758e235ddd25"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#ac377ad448d6eefca4e56758e235ddd25">operations_research::IntVarFilteredHeuristic::Value</a></div><div class="ttdeci">int64_t Value(int64_t index) const</div><div class="ttdoc">Returns the value of the variable of index 'index' in the last committed solution.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00211">routing_search.h:211</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_addc62ce828c9c5ebdf398492bcd04495"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#addc62ce828c9c5ebdf398492bcd04495">operations_research::IntVarFilteredHeuristic::IsSecondaryVar</a></div><div class="ttdeci">bool IsSecondaryVar(int64_t index) const</div><div class="ttdoc">Returns true if 'index' is a secondary variable index.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00231">routing_search.h:231</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_ae0451a92b46be9a570dac925e10dec92"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#ae0451a92b46be9a570dac925e10dec92">operations_research::IntVarFilteredHeuristic::Evaluate</a></div><div class="ttdeci">std::optional< int64_t > Evaluate(bool commit)</div><div class="ttdoc">Evaluates the modifications to the current solution.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00307">routing_search.cc:307</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_af3787f4febdbe5033e9834b770476f5d"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#af3787f4febdbe5033e9834b770476f5d">operations_research::IntVarFilteredHeuristic::BuildSolution</a></div><div class="ttdeci">Assignment *const BuildSolution()</div><div class="ttdoc">Builds a solution.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00263">routing_search.cc:263</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_filtered_heuristic_html_af60e2423a0fdf248c6e5aed0f7368a07"><div class="ttname"><a href="classoperations__research_1_1_int_var_filtered_heuristic.html#af60e2423a0fdf248c6e5aed0f7368a07">operations_research::IntVarFilteredHeuristic::IntVarFilteredHeuristic</a></div><div class="ttdeci">IntVarFilteredHeuristic(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, LocalSearchFilterManager *filter_manager)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00231">routing_search.cc:231</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_html"><div class="ttname"><a href="classoperations__research_1_1_int_var.html">operations_research::IntVar</a></div><div class="ttdoc">The class IntVar is a subset of IntExpr.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04040">constraint_solver.h:4040</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_html_a0723abf37f7a5a8a604fd1bcd96a7be0"><div class="ttname"><a href="classoperations__research_1_1_int_var.html#a0723abf37f7a5a8a604fd1bcd96a7be0">operations_research::IntVar::Contains</a></div><div class="ttdeci">virtual bool Contains(int64_t v) const =0</div><div class="ttdoc">This method returns whether the value 'v' is in the domain of the variable.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_html_af8625719d57e4a61b5aa251d99762966"><div class="ttname"><a href="classoperations__research_1_1_int_var.html#af8625719d57e4a61b5aa251d99762966">operations_research::IntVar::Size</a></div><div class="ttdeci">virtual uint64_t Size() const =0</div><div class="ttdoc">This method returns the number of values in the domain of the variable.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_html_affdd564449bc36ce5db44cfc1c9e86d4"><div class="ttname"><a href="classoperations__research_1_1_int_var.html#affdd564449bc36ce5db44cfc1c9e86d4">operations_research::IntVar::MakeDomainIterator</a></div><div class="ttdeci">virtual IntVarIterator * MakeDomainIterator(bool reversible) const =0</div><div class="ttdoc">Creates a domain iterator.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_cheapest_insertion_filtered_heuristic_html_a2bc82055bf34be9162ce82b5d87b0289"><div class="ttname"><a href="classoperations__research_1_1_local_cheapest_insertion_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">operations_research::LocalCheapestInsertionFilteredHeuristic::BuildSolutionInternal</a></div><div class="ttdeci">bool BuildSolutionInternal() override</div><div class="ttdoc">Virtual method to redefine how to build a solution.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02228">routing_search.cc:2228</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_search_filter_manager_html"><div class="ttname"><a href="classoperations__research_1_1_local_search_filter_manager.html">operations_research::LocalSearchFilterManager</a></div><div class="ttdoc">Filter manager: when a move is made, filters are executed to decide whether the solution is feasible ...</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01774">constraint_solveri.h:1774</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_search_filter_manager_html_a16e0093badb54c2c26a272d6f245155e"><div class="ttname"><a href="classoperations__research_1_1_local_search_filter_manager.html#a16e0093badb54c2c26a272d6f245155e">operations_research::LocalSearchFilterManager::GetAcceptedObjectiveValue</a></div><div class="ttdeci">int64_t GetAcceptedObjectiveValue() const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01806">constraint_solveri.h:1806</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_search_filter_manager_html_a712060303eea0e26ca9a072b57bbf227"><div class="ttname"><a href="classoperations__research_1_1_local_search_filter_manager.html#a712060303eea0e26ca9a072b57bbf227">operations_research::LocalSearchFilterManager::Accept</a></div><div class="ttdeci">bool Accept(LocalSearchMonitor *const monitor, const Assignment *delta, const Assignment *deltadelta, int64_t objective_min, int64_t objective_max)</div><div class="ttdoc">Returns true iff all filters return true, and the sum of their accepted objectives is between objecti...</div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l03996">local_search.cc:3996</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_search_filter_manager_html_ae90693395653f673140e7bee51daf656"><div class="ttname"><a href="classoperations__research_1_1_local_search_filter_manager.html#ae90693395653f673140e7bee51daf656">operations_research::LocalSearchFilterManager::Synchronize</a></div><div class="ttdeci">void Synchronize(const Assignment *assignment, const Assignment *delta)</div><div class="ttdoc">Synchronizes all filters to assignment.</div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l04041">local_search.cc:4041</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_search_monitor_html"><div class="ttname"><a href="classoperations__research_1_1_local_search_monitor.html">operations_research::LocalSearchMonitor</a></div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01929">constraint_solveri.h:1929</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_search_operator_html"><div class="ttname"><a href="classoperations__research_1_1_local_search_operator.html">operations_research::LocalSearchOperator</a></div><div class="ttdoc">The base class for all local search operators.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00792">constraint_solveri.h:792</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_search_operator_html_a9bd1712271364632b22009ef10eb2172"><div class="ttname"><a href="classoperations__research_1_1_local_search_operator.html#a9bd1712271364632b22009ef10eb2172">operations_research::LocalSearchOperator::MakeNextNeighbor</a></div><div class="ttdeci">virtual bool MakeNextNeighbor(Assignment *delta, Assignment *deltadelta)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_search_operator_html_ae8505ab0739cf0b585de5844f7a6703c"><div class="ttname"><a href="classoperations__research_1_1_local_search_operator.html#ae8505ab0739cf0b585de5844f7a6703c">operations_research::LocalSearchOperator::Start</a></div><div class="ttdeci">virtual void Start(const Assignment *assignment)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_search_phase_parameters_html"><div class="ttname"><a href="classoperations__research_1_1_local_search_phase_parameters.html">operations_research::LocalSearchPhaseParameters</a></div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l04427">local_search.cc:4427</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_queue_html"><div class="ttname"><a href="classoperations__research_1_1_queue.html">operations_research::Queue</a></div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l00219">constraint_solver.cc:219</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_range_min_max_index_function_html_a9216044b741a3c1d663daab8ca0b18c6"><div class="ttname"><a href="classoperations__research_1_1_range_min_max_index_function.html#a9216044b741a3c1d663daab8ca0b18c6">operations_research::RangeMinMaxIndexFunction::RangeMinArgument</a></div><div class="ttdeci">virtual int64_t RangeMinArgument(int64_t from, int64_t to) const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html">operations_research::RoutingDimension</a></div><div class="ttdoc">Dimensions represent quantities accumulated at nodes along the routes.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02590">routing.h:2590</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a3a71e48b4ed287752b9d9d9f7086ec7d"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a3a71e48b4ed287752b9d9d9f7086ec7d">operations_research::RoutingDimension::CumulVar</a></div><div class="ttdeci">IntVar * CumulVar(int64_t index) const</div><div class="ttdoc">Get the cumul, transit and slack variables for the given node (given as int64_t var index).</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02609">routing.h:2609</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_aa92333e706853d147814ecd3426a0c1d"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#aa92333e706853d147814ecd3426a0c1d">operations_research::RoutingDimension::ShortestTransitionSlack</a></div><div class="ttdeci">int64_t ShortestTransitionSlack(int64_t node) const</div><div class="ttdoc">It makes sense to use the function only for self-dependent dimension.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l04497">routing_search.cc:4497</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_acbd21042416aba96c504e1a9c15b0b60"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#acbd21042416aba96c504e1a9c15b0b60">operations_research::RoutingDimension::base_dimension</a></div><div class="ttdeci">const RoutingDimension * base_dimension() const</div><div class="ttdoc">Returns the parent in the dependency tree if any or nullptr otherwise.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02843">routing.h:2843</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html">operations_research::RoutingFilteredHeuristic</a></div><div class="ttdoc">Filter-based heuristic dedicated to routing.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00257">routing_search.h:257</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_a2ace3be57d4d81121e8ebbd3642052c0"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#a2ace3be57d4d81121e8ebbd3642052c0">operations_research::RoutingFilteredHeuristic::GetStartChainEnd</a></div><div class="ttdeci">int GetStartChainEnd(int vehicle) const</div><div class="ttdoc">Returns the end of the start chain of vehicle,.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00268">routing_search.h:268</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_a7cccc6ea4b6f89355769bc0de4548f1d"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#a7cccc6ea4b6f89355769bc0de4548f1d">operations_research::RoutingFilteredHeuristic::SetVehicleIndex</a></div><div class="ttdeci">virtual void SetVehicleIndex(int64_t node, int vehicle)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00284">routing_search.h:284</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_a8a3ae6ba0baf1765da1a2f4a6cecc730"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#a8a3ae6ba0baf1765da1a2f4a6cecc730">operations_research::RoutingFilteredHeuristic::GetEndChainStart</a></div><div class="ttdeci">int GetEndChainStart(int vehicle) const</div><div class="ttdoc">Returns the start of the end chain of vehicle,.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00270">routing_search.h:270</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_a90dcdb4d66f8781421f5913150a85a06"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#a90dcdb4d66f8781421f5913150a85a06">operations_research::RoutingFilteredHeuristic::model</a></div><div class="ttdeci">RoutingModel * model() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00266">routing_search.h:266</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_a93aa105d700ad23091b6f3f55d48a2c1"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#a93aa105d700ad23091b6f3f55d48a2c1">operations_research::RoutingFilteredHeuristic::RoutingFilteredHeuristic</a></div><div class="ttdeci">RoutingFilteredHeuristic(RoutingModel *model, LocalSearchFilterManager *filter_manager, bool omit_secondary_vars=true)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00366">routing_search.cc:366</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_a954a436d9a6c975e9d88f2ec659bb090"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#a954a436d9a6c975e9d88f2ec659bb090">operations_research::RoutingFilteredHeuristic::MakeDisjunctionNodesUnperformed</a></div><div class="ttdeci">void MakeDisjunctionNodesUnperformed(int64_t node)</div><div class="ttdoc">Make nodes in the same disjunction as 'node' unperformed.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00462">routing_search.cc:462</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_a95f347f8419578337202450136ca78be"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#a95f347f8419578337202450136ca78be">operations_research::RoutingFilteredHeuristic::StopSearch</a></div><div class="ttdeci">bool StopSearch() override</div><div class="ttdoc">Returns true if the search must be stopped.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00283">routing_search.h:283</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_a97049801609b8cb68c0428970f916fd4"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#a97049801609b8cb68c0428970f916fd4">operations_research::RoutingFilteredHeuristic::MakeUnassignedNodesUnperformed</a></div><div class="ttdeci">void MakeUnassignedNodesUnperformed()</div><div class="ttdoc">Make all unassigned nodes unperformed.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00471">routing_search.cc:471</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_aafb639a547b12967feeefae66a3d3276"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#aafb639a547b12967feeefae66a3d3276">operations_research::RoutingFilteredHeuristic::ResetVehicleIndices</a></div><div class="ttdeci">virtual void ResetVehicleIndices()</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00285">routing_search.h:285</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_abaca104cf41b5a5e3554f8ad72cdc28c"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#abaca104cf41b5a5e3554f8ad72cdc28c">operations_research::RoutingFilteredHeuristic::MakePartiallyPerformedPairsUnperformed</a></div><div class="ttdeci">void MakePartiallyPerformedPairsUnperformed()</div><div class="ttdoc">Make all partially performed pickup and delivery pairs unperformed.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00483">routing_search.cc:483</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_aced1b7a7efd9a0ed004335f84b20cd58"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#aced1b7a7efd9a0ed004335f84b20cd58">operations_research::RoutingFilteredHeuristic::VehicleIsEmpty</a></div><div class="ttdeci">bool VehicleIsEmpty(int vehicle) const</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00286">routing_search.h:286</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_filtered_heuristic_html_ae645e8ef4a6929a1c1dbed695f2dd67d"><div class="ttname"><a href="classoperations__research_1_1_routing_filtered_heuristic.html#ae645e8ef4a6929a1c1dbed695f2dd67d">operations_research::RoutingFilteredHeuristic::BuildSolutionFromRoutes</a></div><div class="ttdeci">const Assignment * BuildSolutionFromRoutes(const std::function< int64_t(int64_t)> &next_accessor)</div><div class="ttdoc">Builds a solution starting from the routes formed by the next accessor.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00273">routing_search.cc:273</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html">operations_research::RoutingModel</a></div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00210">routing.h:210</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a14ddf0a3cc644cd510603b1cd84e08be"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a14ddf0a3cc644cd510603b1cd84e08be">operations_research::RoutingModel::ForEachNodeInDisjunctionWithMaxCardinalityFromIndex</a></div><div class="ttdeci">void ForEachNodeInDisjunctionWithMaxCardinalityFromIndex(int64_t index, int64_t max_cardinality, F f) const</div><div class="ttdoc">Calls f for each variable index of indices in the same disjunctions as the node corresponding to the ...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00770">routing.h:770</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a1636c49d2587c3d9df16918345b82378"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a1636c49d2587c3d9df16918345b82378">operations_research::RoutingModel::IndexPair</a></div><div class="ttdeci">RoutingIndexPair IndexPair</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00246">routing.h:246</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a251dfaa30251901d13cd2f33a92571ac"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a251dfaa30251901d13cd2f33a92571ac">operations_research::RoutingModel::GetPickupAndDeliveryPairs</a></div><div class="ttdeci">const IndexPairs & GetPickupAndDeliveryPairs() const</div><div class="ttdoc">Returns pickup and delivery pairs currently in the model.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00883">routing.h:883</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a34bd38fe78ef5896f2a623170f1be5d0"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a34bd38fe78ef5896f2a623170f1be5d0">operations_research::RoutingModel::GetFixedCostOfVehicle</a></div><div class="ttdeci">int64_t GetFixedCostOfVehicle(int vehicle) const</div><div class="ttdoc">Returns the route fixed cost taken into account if the route of the vehicle is not empty,...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l01541">routing.cc:1541</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_a43b2c4a7a4f58c02ca36ed0a4d76a3b4"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a43b2c4a7a4f58c02ca36ed0a4d76a3b4">operations_research::RoutingModel::MakeGreedyDescentLSOperator</a></div><div class="ttdeci">static std::unique_ptr< LocalSearchOperator > MakeGreedyDescentLSOperator(std::vector< IntVar * > variables)</div><div class="ttdoc">Perhaps move it to constraint_solver.h.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l04617">routing_search.cc:4617</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a43c00b1c44d7f5bec9287ce60fadef52"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a43c00b1c44d7f5bec9287ce60fadef52">operations_research::RoutingModel::VehicleVar</a></div><div class="ttdeci">IntVar * VehicleVar(int64_t index) const</div><div class="ttdoc">Returns the vehicle variable of the node corresponding to index.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01382">routing.h:1382</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a572bd92c25ebc67c72137fd59e53f6d6"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a572bd92c25ebc67c72137fd59e53f6d6">operations_research::RoutingModel::Size</a></div><div class="ttdeci">int64_t Size() const</div><div class="ttdoc">Returns the number of next variables in the model.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01531">routing.h:1531</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a76874cd778ea1b9220673e019f9e7abe"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a76874cd778ea1b9220673e019f9e7abe">operations_research::RoutingModel::IndexPairs</a></div><div class="ttdeci">RoutingIndexPairs IndexPairs</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00247">routing.h:247</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_aba3eb59d97b0beef7f153ada8fe862f7"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#aba3eb59d97b0beef7f153ada8fe862f7">operations_research::RoutingModel::MakeGuidedSlackFinalizer</a></div><div class="ttdeci">DecisionBuilder * MakeGuidedSlackFinalizer(const RoutingDimension *dimension, std::function< int64_t(int64_t)> initializer)</div><div class="ttdoc">The next few members are in the public section only for testing purposes.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l04490">routing_search.cc:4490</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_abb61fc6939fecebe93387f63319d2b7f"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#abb61fc6939fecebe93387f63319d2b7f">operations_research::RoutingModel::CostVar</a></div><div class="ttdeci">IntVar * CostVar() const</div><div class="ttdoc">Returns the global cost variable which is being minimized.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01392">routing.h:1392</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_acb94aaffe504b1b6873c3400a8edceaa"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#acb94aaffe504b1b6873c3400a8edceaa">operations_research::RoutingModel::MakeSelfDependentDimensionFinalizer</a></div><div class="ttdeci">DecisionBuilder * MakeSelfDependentDimensionFinalizer(const RoutingDimension *dimension)</div><div class="ttdoc">SWIG</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l04623">routing_search.cc:4623</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_ae378d23c967e818f321bd4498b5c74f2"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#ae378d23c967e818f321bd4498b5c74f2">operations_research::RoutingModel::GetCostClassIndexOfVehicle</a></div><div class="ttdeci">CostClassIndex GetCostClassIndexOfVehicle(int64_t vehicle) const</div><div class="ttdoc">Get the cost class index of the given vehicle.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01420">routing.h:1420</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_afb80fd36c1fb57d2db049403483e2074"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#afb80fd36c1fb57d2db049403483e2074">operations_research::RoutingModel::End</a></div><div class="ttdeci">int64_t End(int vehicle) const</div><div class="ttdoc">Returns the variable index of the ending node of a vehicle route.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01335">routing.h:1335</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html">operations_research::SavingsFilteredHeuristic::SavingsContainer</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02688">routing_search.cc:2688</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html_a31131f99ff37daf00617f798df4fc8f1"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a31131f99ff37daf00617f798df4fc8f1">operations_research::SavingsFilteredHeuristic::SavingsContainer::GetSortedSavingsForVehicleType</a></div><div class="ttdeci">const std::vector< Saving > & GetSortedSavingsForVehicleType(int type)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02860">routing_search.cc:2860</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html_a3ec322819bf67a83f0cc68eb55ae1bb2"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a3ec322819bf67a83f0cc68eb55ae1bb2">operations_research::SavingsFilteredHeuristic::SavingsContainer::ReinjectSkippedSavingsEndingAt</a></div><div class="ttdeci">void ReinjectSkippedSavingsEndingAt(int64_t node)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02871">routing_search.cc:2871</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html_a6e4036b54f3ff84ef42fa4acabf6158b"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#a6e4036b54f3ff84ef42fa4acabf6158b">operations_research::SavingsFilteredHeuristic::SavingsContainer::HasSaving</a></div><div class="ttdeci">bool HasSaving()</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02790">routing_search.cc:2790</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html_ab2c8a5a9d539f1fb49d767045f8c9297"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ab2c8a5a9d539f1fb49d767045f8c9297">operations_research::SavingsFilteredHeuristic::SavingsContainer::GetSaving</a></div><div class="ttdeci">Saving GetSaving()</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02795">routing_search.cc:2795</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html_ab4ff697245c706fa950702d316f073ba"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ab4ff697245c706fa950702d316f073ba">operations_research::SavingsFilteredHeuristic::SavingsContainer::SavingsContainer</a></div><div class="ttdeci">SavingsContainer(const SavingsFilteredHeuristic *savings_db, int vehicle_types)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02690">routing_search.cc:2690</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html_abf0869704ce65d912e6dcc71945ee737"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#abf0869704ce65d912e6dcc71945ee737">operations_research::SavingsFilteredHeuristic::SavingsContainer::UpdateWithType</a></div><div class="ttdeci">void UpdateWithType(int type)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02855">routing_search.cc:2855</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html_acdad3624ab0076a5609acc5722b6d379"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#acdad3624ab0076a5609acc5722b6d379">operations_research::SavingsFilteredHeuristic::SavingsContainer::ReinjectSkippedSavingsStartingAt</a></div><div class="ttdeci">void ReinjectSkippedSavingsStartingAt(int64_t node)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02866">routing_search.cc:2866</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html_ad0f88a06a9005604e199132660aa3609"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ad0f88a06a9005604e199132660aa3609">operations_research::SavingsFilteredHeuristic::SavingsContainer::InitializeContainer</a></div><div class="ttdeci">void InitializeContainer(int64_t size, int64_t saving_neighbors)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02700">routing_search.cc:2700</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html_ad7378ee53fe29a5ac2b72c1ae77a3d03"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ad7378ee53fe29a5ac2b72c1ae77a3d03">operations_research::SavingsFilteredHeuristic::SavingsContainer::Update</a></div><div class="ttdeci">void Update(bool update_best_saving, int type=-1)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02831">routing_search.cc:2831</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html_ae424c3360277f457eba79fd25b4eed3b"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#ae424c3360277f457eba79fd25b4eed3b">operations_research::SavingsFilteredHeuristic::SavingsContainer::Sort</a></div><div class="ttdeci">void Sort()</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02737">routing_search.cc:2737</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container_html_af86ec2894c059ac7bc63b492d5fb6fbd"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic_1_1_savings_container.html#af86ec2894c059ac7bc63b492d5fb6fbd">operations_research::SavingsFilteredHeuristic::SavingsContainer::AddNewSaving</a></div><div class="ttdeci">void AddNewSaving(const Saving &saving, int64_t total_cost, int64_t before_node, int64_t after_node, int vehicle_type)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l02728">routing_search.cc:2728</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html">operations_research::SavingsFilteredHeuristic</a></div><div class="ttdoc">Filter-based decision builder which builds a solution by using Clarke & Wright's Savings heuristic.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00899">routing_search.h:899</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a04f0558b5828ce46108dca7e5a3a8504"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a04f0558b5828ce46108dca7e5a3a8504">operations_research::SavingsFilteredHeuristic::SavingsFilteredHeuristic</a></div><div class="ttdeci">SavingsFilteredHeuristic(RoutingModel *model, SavingsParameters parameters, LocalSearchFilterManager *filter_manager)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03070">routing_search.cc:3070</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a059d074075b06daa69a371f96d5ad60c"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a059d074075b06daa69a371f96d5ad60c">operations_research::SavingsFilteredHeuristic::GetVehicleTypeFromSaving</a></div><div class="ttdeci">int64_t GetVehicleTypeFromSaving(const Saving &saving) const</div><div class="ttdoc">Returns the cost class from a saving.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00932">routing_search.h:932</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a1d636dfe2c494b3348053095bce46556"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a1d636dfe2c494b3348053095bce46556">operations_research::SavingsFilteredHeuristic::vehicle_type_curator_</a></div><div class="ttdeci">std::unique_ptr< VehicleTypeCurator > vehicle_type_curator_</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00961">routing_search.h:961</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a2bc82055bf34be9162ce82b5d87b0289"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a2bc82055bf34be9162ce82b5d87b0289">operations_research::SavingsFilteredHeuristic::BuildSolutionInternal</a></div><div class="ttdeci">bool BuildSolutionInternal() override</div><div class="ttdoc">Virtual method to redefine how to build a solution.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03086">routing_search.cc:3086</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a3f462bd92b7848baac82e1c526d0ed5a"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a3f462bd92b7848baac82e1c526d0ed5a">operations_research::SavingsFilteredHeuristic::GetAfterNodeFromSaving</a></div><div class="ttdeci">int64_t GetAfterNodeFromSaving(const Saving &saving) const</div><div class="ttdoc">Returns the "after node" from a saving.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00940">routing_search.h:940</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a507360c2a0a17cf293d6342c073750ae"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a507360c2a0a17cf293d6342c073750ae">operations_research::SavingsFilteredHeuristic::GetSavingValue</a></div><div class="ttdeci">int64_t GetSavingValue(const Saving &saving) const</div><div class="ttdoc">Returns the saving value from a saving.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00944">routing_search.h:944</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a508859e48f977fce11a64cd80d9d1c96"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a508859e48f977fce11a64cd80d9d1c96">operations_research::SavingsFilteredHeuristic::Saving</a></div><div class="ttdeci">std::pair< int64_t, int64_t > Saving</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00922">routing_search.h:922</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a689974dbdbc3a3247a2f9c1263dc85b4"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a689974dbdbc3a3247a2f9c1263dc85b4">operations_research::SavingsFilteredHeuristic::savings_container_</a></div><div class="ttdeci">std::unique_ptr< SavingsContainer< Saving > > savings_container_</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00959">routing_search.h:959</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a69f73ddf69522d81d6dd919c316cae8a"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a69f73ddf69522d81d6dd919c316cae8a">operations_research::SavingsFilteredHeuristic::~SavingsFilteredHeuristic</a></div><div class="ttdeci">~SavingsFilteredHeuristic() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03084">routing_search.cc:3084</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_a84b19d1c2e9a93a7e02dc12972c9c969"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#a84b19d1c2e9a93a7e02dc12972c9c969">operations_research::SavingsFilteredHeuristic::ExtraSavingsMemoryMultiplicativeFactor</a></div><div class="ttdeci">virtual double ExtraSavingsMemoryMultiplicativeFactor() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_ac059c9526b1114c16b250a4cc809a97b"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#ac059c9526b1114c16b250a4cc809a97b">operations_research::SavingsFilteredHeuristic::GetBeforeNodeFromSaving</a></div><div class="ttdeci">int64_t GetBeforeNodeFromSaving(const Saving &saving) const</div><div class="ttdoc">Returns the "before node" from a saving.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00936">routing_search.h:936</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_ad1f89eda8b1c2ad8fe6f5743e475fd5d"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#ad1f89eda8b1c2ad8fe6f5743e475fd5d">operations_research::SavingsFilteredHeuristic::StartNewRouteWithBestVehicleOfType</a></div><div class="ttdeci">int StartNewRouteWithBestVehicleOfType(int type, int64_t before_node, int64_t after_node)</div><div class="ttdoc">Finds the best available vehicle of type "type" to start a new route to serve the arc before_node-->a...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03104">routing_search.cc:3104</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_savings_filtered_heuristic_html_aeb4e0e0b0899af694678658062b4f037"><div class="ttname"><a href="classoperations__research_1_1_savings_filtered_heuristic.html#aeb4e0e0b0899af694678658062b4f037">operations_research::SavingsFilteredHeuristic::BuildRoutesFromSavings</a></div><div class="ttdeci">virtual void BuildRoutesFromSavings()=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html"><div class="ttname"><a href="classoperations__research_1_1_solver.html">operations_research::Solver</a></div><div class="ttdoc">Solver Class.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00245">constraint_solver.h:245</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_a869f7ed2cc6505c59ecf1eb8ecb2288a"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a869f7ed2cc6505c59ecf1eb8ecb2288a">operations_research::Solver::GetLocalSearchMonitor</a></div><div class="ttdeci">LocalSearchMonitor * GetLocalSearchMonitor() const</div><div class="ttdoc">Returns the local search monitor.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l03223">constraint_solver.cc:3223</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_aeb92d4addb41255c9732cacfcb54f795"><div class="ttname"><a href="classoperations__research_1_1_solver.html#aeb92d4addb41255c9732cacfcb54f795">operations_research::Solver::Fail</a></div><div class="ttdeci">void Fail()</div><div class="ttdoc">Abandon the current branch in the search tree. A backtrack will follow.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l02422">constraint_solver.cc:2422</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_af5502e2288132c081fc96fdbcee282e6"><div class="ttname"><a href="classoperations__research_1_1_solver.html#af5502e2288132c081fc96fdbcee282e6">operations_research::Solver::VariableValueComparator</a></div><div class="ttdeci">std::function< bool(int64_t, int64_t, int64_t)> VariableValueComparator</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00751">constraint_solver.h:751</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sweep_arranger_html_a2197ac12bb9d1906c420aa46b09448ce"><div class="ttname"><a href="classoperations__research_1_1_sweep_arranger.html#a2197ac12bb9d1906c420aa46b09448ce">operations_research::SweepArranger::SweepArranger</a></div><div class="ttdeci">SweepArranger(const std::vector< std::pair< int64_t, int64_t > > &points)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03757">routing_search.cc:3757</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sweep_arranger_html_a5fceff18e9961fb07c1c02231aef9985"><div class="ttname"><a href="classoperations__research_1_1_sweep_arranger.html#a5fceff18e9961fb07c1c02231aef9985">operations_research::SweepArranger::ArrangeIndices</a></div><div class="ttdeci">void ArrangeIndices(std::vector< int64_t > *indices)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03768">routing_search.cc:3768</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_vehicle_type_curator_html_a14dcf3d10159ae170c79ac9cac11cf5b"><div class="ttname"><a href="classoperations__research_1_1_vehicle_type_curator.html#a14dcf3d10159ae170c79ac9cac11cf5b">operations_research::VehicleTypeCurator::Update</a></div><div class="ttdeci">void Update(const std::function< bool(int)> &remove_vehicle)</div><div class="ttdoc">Goes through all the currently stored vehicles and removes vehicles for which remove_vehicle() return...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00106">routing_search.cc:106</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_vehicle_type_curator_html_a2f14bd5a823d4b8de9bf858ec54466cc"><div class="ttname"><a href="classoperations__research_1_1_vehicle_type_curator.html#a2f14bd5a823d4b8de9bf858ec54466cc">operations_research::VehicleTypeCurator::HasCompatibleVehicleOfType</a></div><div class="ttdeci">bool HasCompatibleVehicleOfType(int type, const std::function< bool(int)> &vehicle_is_compatible) const</div><div class="ttdoc">Searches a compatible vehicle of the given type; returns false if none was found.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00128">routing_search.cc:128</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_vehicle_type_curator_html_a3c728b8544bdbae03f52979a1fda6f90"><div class="ttname"><a href="classoperations__research_1_1_vehicle_type_curator.html#a3c728b8544bdbae03f52979a1fda6f90">operations_research::VehicleTypeCurator::GetCompatibleVehicleOfType</a></div><div class="ttdeci">std::pair< int, int > GetCompatibleVehicleOfType(int type, std::function< bool(int)> vehicle_is_compatible, std::function< bool(int)> stop_and_return_vehicle)</div><div class="ttdoc">Searches for the best compatible vehicle of the given type, i.e.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00140">routing_search.cc:140</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_vehicle_type_curator_html_a814500d3b9447208c46bd15c6f95f96d"><div class="ttname"><a href="classoperations__research_1_1_vehicle_type_curator.html#a814500d3b9447208c46bd15c6f95f96d">operations_research::VehicleTypeCurator::Reset</a></div><div class="ttdeci">void Reset(const std::function< bool(int)> &store_vehicle)</div><div class="ttdoc">Resets the vehicles stored, storing only vehicles from the vehicle_type_container_ for which store_ve...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00077">routing_search.cc:77</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_8cc_html_a395f613555f398dd389670bb4c2a4599"><div class="ttname"><a href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a></div><div class="ttdeci">Block * next</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l00678">constraint_solver.cc:678</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_8h_html"><div class="ttname"><a href="constraint__solver_8h.html">constraint_solver.h</a></div></div>
|
|
<div class="ttc" id="aconstraint__solveri_8h_html"><div class="ttname"><a href="constraint__solveri_8h.html">constraint_solveri.h</a></div></div>
|
|
<div class="ttc" id="acp__model__fz__solver_8cc_html_a10a1eab179b472c030bdc2a2efef7219"><div class="ttname"><a href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a></div><div class="ttdeci">SatParameters parameters</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__fz__solver_8cc_source.html#l00119">cp_model_fz_solver.cc:119</a></div></div>
|
|
<div class="ttc" id="aexpr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01874">expr_array.cc:1874</a></div></div>
|
|
<div class="ttc" id="agraph__constraints_8cc_html_ada20fc3a4c70c79d8b02df6b8c2413f5"><div class="ttname"><a href="graph__constraints_8cc.html#ada20fc3a4c70c79d8b02df6b8c2413f5">cumuls_</a></div><div class="ttdeci">const std::vector< IntVar * > cumuls_</div><div class="ttdef"><b>Definition:</b> <a href="graph__constraints_8cc_source.html#l00671">graph_constraints.cc:671</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="amacros_8h_html"><div class="ttname"><a href="macros_8h.html">macros.h</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html_af8df3547bfde53a5acb93e2607b0034a"><div class="ttname"><a href="macros_8h.html#af8df3547bfde53a5acb93e2607b0034a">DISALLOW_COPY_AND_ASSIGN</a></div><div class="ttdeci">#define DISALLOW_COPY_AND_ASSIGN(TypeName)</div><div class="ttdef"><b>Definition:</b> <a href="macros_8h_source.html#l00029">macros.h:29</a></div></div>
|
|
<div class="ttc" id="amap__util_8h_html"><div class="ttname"><a href="map__util_8h.html">map_util.h</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_a5c0d4dea208db4deaa285c06b78d8181"><div class="ttname"><a href="namespacegtl.html#a5c0d4dea208db4deaa285c06b78d8181">gtl::InsertOrDie</a></div><div class="ttdeci">void InsertOrDie(Collection *const collection, const typename Collection::value_type &value)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00154">map_util.h:154</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_a92a0e7b0e74024284adc849a4499940f"><div class="ttname"><a href="namespacegtl.html#a92a0e7b0e74024284adc849a4499940f">gtl::STLClearObject</a></div><div class="ttdeci">void STLClearObject(T *obj)</div><div class="ttdef"><b>Definition:</b> <a href="stl__util_8h_source.html#l00123">stl_util.h:123</a></div></div>
|
|
<div class="ttc" id="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_1_1sat_html_a96eab70b5ead3894afac4d4fff0fd984"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a96eab70b5ead3894afac4d4fff0fd984">operations_research::sat::Value</a></div><div class="ttdeci">std::function< int64_t(const Model &)> Value(IntegerVariable v)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01683">integer.h:1683</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a111f44b9b9cf67a8e8d83794ac9f5291"><div class="ttname"><a href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">operations_research::CapAdd</a></div><div class="ttdeci">int64_t CapAdd(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00126">saturated_arithmetic.h:126</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a26a2d5d3c5887e436bf4da4c20a99a26"><div class="ttname"><a href="namespaceoperations__research.html#a26a2d5d3c5887e436bf4da4c20a99a26">operations_research::MakeAllUnperformed</a></div><div class="ttdeci">DecisionBuilder * MakeAllUnperformed(RoutingModel *model)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l04380">routing_search.cc:4380</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a4a43d435871f16c321861fa5de32df82"><div class="ttname"><a href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">operations_research::CapSub</a></div><div class="ttdeci">int64_t CapSub(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00158">saturated_arithmetic.h:158</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a89152c6d7ca6a92ff106fe602c706816"><div class="ttname"><a href="namespaceoperations__research.html#a89152c6d7ca6a92ff106fe602c706816">operations_research::AutomaticFirstSolutionStrategy</a></div><div class="ttdeci">FirstSolutionStrategy::Value AutomaticFirstSolutionStrategy(bool has_pickup_deliveries, bool has_node_precedences, bool has_single_vehicle_node)</div><div class="ttdoc">Returns the best value for the automatic first solution strategy, based on the given model parameters...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00181">routing_search.cc:181</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ab5b064a7895b1fc8084546441a57b46a"><div class="ttname"><a href="namespaceoperations__research.html#ab5b064a7895b1fc8084546441a57b46a">operations_research::MakeSweepDecisionBuilder</a></div><div class="ttdeci">DecisionBuilder * MakeSweepDecisionBuilder(RoutingModel *model, bool check_assignment)</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l04346">routing_search.cc:4346</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_adf85b9c9e168660e5f36d735d88f3955"><div class="ttname"><a href="namespaceoperations__research.html#adf85b9c9e168660e5f36d735d88f3955">operations_research::kUnassigned</a></div><div class="ttdeci">static const int kUnassigned</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l00878">routing.cc:878</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="arange__query__function_8h_html"><div class="ttname"><a href="range__query__function_8h.html">range_query_function.h</a></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__flow_8cc_html_a75d7b5e4cab1e156cc7a2c5eba1e16f1"><div class="ttname"><a href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a></div><div class="ttdeci">int64_t cost</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00152">routing_flow.cc:152</a></div></div>
|
|
<div class="ttc" id="arouting__index__manager_8h_html"><div class="ttname"><a href="routing__index__manager_8h.html">routing_index_manager.h</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_a1a01a2753d74fedd87264d8bd34a12df"><div class="ttname"><a href="routing__search_8cc.html#a1a01a2753d74fedd87264d8bd34a12df">vehicle_class</a></div><div class="ttdeci">int vehicle_class</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03819">routing_search.cc:3819</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_a20358970b1abaf992eb85e071e454653"><div class="ttname"><a href="routing__search_8cc.html#a20358970b1abaf992eb85e071e454653">head</a></div><div class="ttdeci">int head</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03995">routing_search.cc:3995</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_a6824c3bafe148ed277f7c1f8013ab022"><div class="ttname"><a href="routing__search_8cc.html#a6824c3bafe148ed277f7c1f8013ab022">link</a></div><div class="ttdeci">std::pair< int, int > link</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03817">routing_search.cc:3817</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_8cc_html_a79b8e036dca6911e3295a47d99f21f43"><div class="ttname"><a href="routing__search_8cc.html#a79b8e036dca6911e3295a47d99f21f43">distance</a></div><div class="ttdeci">double distance</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03741">routing_search.cc:3741</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_a79dea7ed146af26ff4a0ba4bf5c83eee"><div class="ttname"><a href="routing__search_8cc.html#a79dea7ed146af26ff4a0ba4bf5c83eee">angle</a></div><div class="ttdeci">double angle</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03740">routing_search.cc:3740</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_a9b1b0455b5848770f087b1a4bd5ae474"><div class="ttname"><a href="routing__search_8cc.html#a9b1b0455b5848770f087b1a4bd5ae474">start_depot</a></div><div class="ttdeci">int64_t start_depot</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03820">routing_search.cc:3820</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_aa9d6bcc39dc199c2a2671a88ecf3630e"><div class="ttname"><a href="routing__search_8cc.html#aa9d6bcc39dc199c2a2671a88ecf3630e">index</a></div><div class="ttdeci">int64_t index</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03739">routing_search.cc:3739</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="routing__search_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03818">routing_search.cc:3818</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_acc95d14bc59afe35d789e11bbacfab6f"><div class="ttname"><a href="routing__search_8cc.html#acc95d14bc59afe35d789e11bbacfab6f">ABSL_FLAG</a></div><div class="ttdeci">ABSL_FLAG(bool, routing_shift_insertion_cost_by_penalty, true, "Shift insertion costs by the penalty of the inserted node(s).")</div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_ad5c4ff858135d200263f4be8c3d7c4dd"><div class="ttname"><a href="routing__search_8cc.html#ad5c4ff858135d200263f4be8c3d7c4dd">end_depot</a></div><div class="ttdeci">int64_t end_depot</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03821">routing_search.cc:3821</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_aff39d864a6594bc5f4a5e365282e00fe"><div class="ttname"><a href="routing__search_8cc.html#aff39d864a6594bc5f4a5e365282e00fe">tail</a></div><div class="ttdeci">int tail</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03996">routing_search.cc:3996</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="asaturated__arithmetic_8h_html"><div class="ttname"><a href="saturated__arithmetic_8h.html">saturated_arithmetic.h</a></div></div>
|
|
<div class="ttc" id="asearch_8cc_html_ab8e7cdbcc8db4792b2ca9b8d4f5b0772"><div class="ttname"><a href="search_8cc.html#ab8e7cdbcc8db4792b2ca9b8d4f5b0772">evaluator_</a></div><div class="ttdeci">std::function< int64_t(int64_t, int64_t)> evaluator_</div><div class="ttdef"><b>Definition:</b> <a href="search_8cc_source.html#l01368">search.cc:1368</a></div></div>
|
|
<div class="ttc" id="asparse__submatrix_8cc_html_a4d53eac2ef2732c28fa9fb663e0c19a7"><div class="ttname"><a href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a></div><div class="ttdeci">std::optional< int64_t > end</div><div class="ttdef"><b>Definition:</b> <a href="sparse__submatrix_8cc_source.html#l00036">sparse_submatrix.cc:36</a></div></div>
|
|
<div class="ttc" id="asparse__submatrix_8cc_html_a9b7656b922ea4ec96097d7380c0e61fe"><div class="ttname"><a href="sparse__submatrix_8cc.html#a9b7656b922ea4ec96097d7380c0e61fe">start</a></div><div class="ttdeci">int64_t start</div><div class="ttdef"><b>Definition:</b> <a href="sparse__submatrix_8cc_source.html#l00035">sparse_submatrix.cc:35</a></div></div>
|
|
<div class="ttc" id="astl__util_8h_html"><div class="ttname"><a href="stl__util_8h.html">stl_util.h</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value_html"><div class="ttname"><a href="structoperations__research_1_1_cheapest_insertion_filtered_heuristic_1_1_start_end_value.html">operations_research::CheapestInsertionFilteredHeuristic::StartEndValue</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00320">routing_search.h:320</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters_html"><div class="ttname"><a href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html">operations_research::GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionParameters</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00394">routing_search.h:394</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters_html_a0aa77787d0df1b489476bfc6714ef819"><div class="ttname"><a href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a0aa77787d0df1b489476bfc6714ef819">operations_research::GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionParameters::neighbors_ratio</a></div><div class="ttdeci">double neighbors_ratio</div><div class="ttdoc">If neighbors_ratio < 1 then for each node only this ratio of its neighbors leading to the smallest ar...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00405">routing_search.h:405</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters_html_a264a3f98da0f7c3a55447f0e77e7ec8c"><div class="ttname"><a href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a264a3f98da0f7c3a55447f0e77e7ec8c">operations_research::GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionParameters::min_neighbors</a></div><div class="ttdeci">int64_t min_neighbors</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00406">routing_search.h:406</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters_html_a28b4894c7c18183ac19b81d1b6d97e2f"><div class="ttname"><a href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a28b4894c7c18183ac19b81d1b6d97e2f">operations_research::GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionParameters::is_sequential</a></div><div class="ttdeci">bool is_sequential</div><div class="ttdoc">Whether the routes are constructed sequentially or in parallel.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00396">routing_search.h:396</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters_html_a7d91387b5081be8f22d053d93eb9edf4"><div class="ttname"><a href="structoperations__research_1_1_global_cheapest_insertion_filtered_heuristic_1_1_global_cheapest_insertion_parameters.html#a7d91387b5081be8f22d053d93eb9edf4">operations_research::GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionParameters::use_neighbors_ratio_for_initialization</a></div><div class="ttdeci">bool use_neighbors_ratio_for_initialization</div><div class="ttdoc">If true, only closest neighbors (see neighbors_ratio and min_neighbors) are considered as insertion p...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00410">routing_search.h:410</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_routing_model_1_1_state_dependent_transit_html"><div class="ttname"><a href="structoperations__research_1_1_routing_model_1_1_state_dependent_transit.html">operations_research::RoutingModel::StateDependentTransit</a></div><div class="ttdoc">What follows is relevant for models with time/state dependent transits.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00263">routing.h:263</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_routing_model_1_1_state_dependent_transit_html_ab71e287979b5c9040d1596d12ed3bb5f"><div class="ttname"><a href="structoperations__research_1_1_routing_model_1_1_state_dependent_transit.html#ab71e287979b5c9040d1596d12ed3bb5f">operations_research::RoutingModel::StateDependentTransit::transit_plus_identity</a></div><div class="ttdeci">RangeMinMaxIndexFunction * transit_plus_identity</div><div class="ttdoc">f(x)</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00265">routing.h:265</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_routing_model_1_1_vehicle_type_container_1_1_vehicle_class_entry_html"><div class="ttname"><a href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container_1_1_vehicle_class_entry.html">operations_research::RoutingModel::VehicleTypeContainer::VehicleClassEntry</a></div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00362">routing.h:362</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_routing_model_1_1_vehicle_type_container_html_ab04b34ed94012cf2d892d6e9347ee9f6"><div class="ttname"><a href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container.html#ab04b34ed94012cf2d892d6e9347ee9f6">operations_research::RoutingModel::VehicleTypeContainer::sorted_vehicle_classes_per_type</a></div><div class="ttdeci">std::vector< std::set< VehicleClassEntry > > sorted_vehicle_classes_per_type</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00381">routing.h:381</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_routing_model_1_1_vehicle_type_container_html_ad39f5508cc37e45b2d759832d343c177"><div class="ttname"><a href="structoperations__research_1_1_routing_model_1_1_vehicle_type_container.html#ad39f5508cc37e45b2d759832d343c177">operations_research::RoutingModel::VehicleTypeContainer::vehicles_per_vehicle_class</a></div><div class="ttdeci">std::vector< std::deque< int > > vehicles_per_vehicle_class</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00382">routing.h:382</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters_html"><div class="ttname"><a href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html">operations_research::SavingsFilteredHeuristic::SavingsParameters</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00901">routing_search.h:901</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters_html_a0aa77787d0df1b489476bfc6714ef819"><div class="ttname"><a href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a0aa77787d0df1b489476bfc6714ef819">operations_research::SavingsFilteredHeuristic::SavingsParameters::neighbors_ratio</a></div><div class="ttdeci">double neighbors_ratio</div><div class="ttdoc">If neighbors_ratio < 1 then for each node only this ratio of its neighbors leading to the smallest ar...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00904">routing_search.h:904</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters_html_a222a2814083966736ad9aefde1dde290"><div class="ttname"><a href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a222a2814083966736ad9aefde1dde290">operations_research::SavingsFilteredHeuristic::SavingsParameters::arc_coefficient</a></div><div class="ttdeci">double arc_coefficient</div><div class="ttdoc">arc_coefficient is a strictly positive parameter indicating the coefficient of the arc being consider...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00913">routing_search.h:913</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters_html_a33bd2c84a2be54d10959e5c0d81f86b5"><div class="ttname"><a href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a33bd2c84a2be54d10959e5c0d81f86b5">operations_research::SavingsFilteredHeuristic::SavingsParameters::max_memory_usage_bytes</a></div><div class="ttdeci">double max_memory_usage_bytes</div><div class="ttdoc">The number of neighbors considered for each node is also adapted so that the stored Savings don't use...</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00907">routing_search.h:907</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters_html_a8857f65b46da9e2012c7bd939a978442"><div class="ttname"><a href="structoperations__research_1_1_savings_filtered_heuristic_1_1_savings_parameters.html#a8857f65b46da9e2012c7bd939a978442">operations_research::SavingsFilteredHeuristic::SavingsParameters::add_reverse_arcs</a></div><div class="ttdeci">bool add_reverse_arcs</div><div class="ttdoc">If add_reverse_arcs is true, the neighborhood relationships are considered symmetrically.</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8h_source.html#l00910">routing_search.h:910</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_afbb39f66221aac28bbdefd1dca2b2b0.html">constraint_solver</a></li><li class="navelem"><a class="el" href="routing__search_8cc.html">routing_search.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.3 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|