950 lines
195 KiB
HTML
950 lines
195 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<title>OR-Tools</title>
|
|
<meta http-equiv="Content-Type" content="text/html;"/>
|
|
<meta charset="utf-8"/>
|
|
<!--<link rel='stylesheet' type='text/css' href="https://fonts.googleapis.com/css?family=Ubuntu:400,700,400italic"/>-->
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.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="banner-container">
|
|
<div id="banner">
|
|
<span id="sfml">Google OR-Tools 9.0</span>
|
|
</div>
|
|
</div>
|
|
<div id="content" style="width: 100%; overflow: hidden;">
|
|
<div style="margin-left: 15px; margin-top: 5px; float: left; color: #145A32;">
|
|
<h2>C++ Reference</h2>
|
|
<ul>
|
|
<li><a href="../cpp_algorithms/annotated.html">Algorithms</a></li>
|
|
<li><a href="../cpp_sat/annotated.html">CP-SAT</a></li>
|
|
<li><a href="../cpp_graph/annotated.html">Graph</a></li>
|
|
<li><a href="../cpp_routing/annotated.html">Routing</a></li>
|
|
<li><a href="../cpp_linear/annotated.html">Linear solver</a></li>
|
|
</ul>
|
|
</div>
|
|
<div id="content">
|
|
<div align="center">
|
|
<h1 style="color: #145A32;">C++ Reference: Routing</h1>
|
|
</div>
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('routing__lp__scheduling_8h_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">routing_lp_scheduling.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="routing__lp__scheduling_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#ifndef OR_TOOLS_CONSTRAINT_SOLVER_ROUTING_LP_SCHEDULING_H_</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#define OR_TOOLS_CONSTRAINT_SOLVER_ROUTING_LP_SCHEDULING_H_</span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>  </div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <deque></span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <functional></span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <limits></span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <map></span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <utility></span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  </div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "absl/container/flat_hash_map.h"</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "absl/memory/memory.h"</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "absl/time/time.h"</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "ortools/base/logging.h"</span></div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#include "ortools/base/mathutil.h"</span></div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include "<a class="code" href="routing_8h.html">ortools/constraint_solver/routing.h</a>"</span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include "<a class="code" href="routing__parameters_8pb_8h.html">ortools/constraint_solver/routing_parameters.pb.h</a>"</span></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include "ortools/glop/lp_solver.h"</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include "ortools/glop/parameters.pb.h"</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include "ortools/lp_data/lp_data.h"</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#include "ortools/lp_data/lp_types.h"</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#include "ortools/sat/cp_model.pb.h"</span></div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="preprocessor">#include "ortools/sat/cp_model_solver.h"</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor">#include "ortools/sat/model.h"</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#include "ortools/sat/sat_parameters.pb.h"</span></div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="preprocessor">#include "ortools/util/saturated_arithmetic.h"</span></div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="preprocessor">#include "ortools/util/sorted_interval_list.h"</span></div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  </div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  </div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// Classes to solve dimension cumul placement (aka scheduling) problems using</span></div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// linear programming.</span></div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  </div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment">// Utility class used in the core optimizer to tighten the cumul bounds as much</span></div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment">// as possible based on the model precedences.</span></div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cumul_bounds_propagator.html"> 53</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_cumul_bounds_propagator.html">CumulBoundsPropagator</a> {</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cumul_bounds_propagator.html#aff8f29b2fce9f6447474ee6077af1b72"> 55</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1_cumul_bounds_propagator.html#aff8f29b2fce9f6447474ee6077af1b72">CumulBoundsPropagator</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <a class="code" href="classoperations__research_1_1_cumul_bounds_propagator.html#a72be8a813404822957fbd808d0405226">dimension</a>);</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  </div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="comment">// Tightens the cumul bounds starting from the current cumul var min/max,</span></div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="comment">// and propagating the precedences resulting from the next_accessor, and the</span></div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="comment">// dimension's precedence rules.</span></div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">// Returns false iff the precedences are infeasible with the given routes.</span></div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="comment">// Otherwise, the user can call CumulMin() and CumulMax() to retrieve the new</span></div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">// bounds of an index.</span></div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cumul_bounds_propagator.html#aa83a7ff5ef57860290d9838959d6ecf1"> 63</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_cumul_bounds_propagator.html#aa83a7ff5ef57860290d9838959d6ecf1">PropagateCumulBounds</a>(</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  int64_t cumul_offset);</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  </div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cumul_bounds_propagator.html#af1f46eca007a484893dbde252abb8251"> 67</a></span>  int64_t <a class="code" href="classoperations__research_1_1_cumul_bounds_propagator.html#af1f46eca007a484893dbde252abb8251">CumulMin</a>(<span class="keywordtype">int</span> index)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordflow">return</span> propagated_bounds_[PositiveNode(index)];</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  }</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  </div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cumul_bounds_propagator.html#a9fd8e875c97504d8d8121125decee57a"> 71</a></span>  int64_t <a class="code" href="classoperations__research_1_1_cumul_bounds_propagator.html#a9fd8e875c97504d8d8121125decee57a">CumulMax</a>(<span class="keywordtype">int</span> index)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keyword">const</span> int64_t negated_upper_bound = propagated_bounds_[NegativeNode(index)];</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">return</span> negated_upper_bound == std::numeric_limits<int64_t>::min()</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  ? std::numeric_limits<int64_t>::max()</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  : -negated_upper_bound;</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  }</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  </div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cumul_bounds_propagator.html#a72be8a813404822957fbd808d0405226"> 78</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>& <a class="code" href="classoperations__research_1_1_cumul_bounds_propagator.html#a72be8a813404822957fbd808d0405226">dimension</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> dimension_; }</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  </div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="comment">// An arc "tail --offset--> head" represents the relation</span></div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="comment">// tail + offset <= head.</span></div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="comment">// As arcs are stored by tail, we don't store it in the struct.</span></div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keyword">struct </span>ArcInfo {</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordtype">int</span> head;</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  int64_t offset;</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  };</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> kNoParent;</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> kParentToBePropagated;</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  </div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">// Return the node corresponding to the lower bound of the cumul of index and</span></div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">// -index respectively.</span></div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordtype">int</span> PositiveNode(<span class="keywordtype">int</span> index)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> 2 * index; }</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordtype">int</span> NegativeNode(<span class="keywordtype">int</span> index)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> 2 * index + 1; }</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  </div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordtype">void</span> AddNodeToQueue(<span class="keywordtype">int</span> node) {</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">if</span> (!node_in_queue_[node]) {</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  bf_queue_.push_back(node);</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  node_in_queue_[node] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  }</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  }</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  </div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">// Adds the relation first_index + offset <= second_index, by adding arcs</span></div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">// first_index --offset--> second_index and</span></div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// -second_index --offset--> -first_index.</span></div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordtype">void</span> AddArcs(<span class="keywordtype">int</span> first_index, <span class="keywordtype">int</span> second_index, int64_t offset);</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  </div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordtype">bool</span> InitializeArcsAndBounds(</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  int64_t cumul_offset);</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  </div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordtype">bool</span> UpdateCurrentLowerBoundOfNode(<span class="keywordtype">int</span> node, int64_t new_lb, int64_t offset);</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  </div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordtype">bool</span> DisassembleSubtree(<span class="keywordtype">int</span> source, <span class="keywordtype">int</span> target);</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  </div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordtype">bool</span> CleanupAndReturnFalse() {</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">// We clean-up node_in_queue_ for future calls, and return false.</span></div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node_to_cleanup : bf_queue_) {</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  node_in_queue_[node_to_cleanup] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  }</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  bf_queue_.clear();</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  }</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  </div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keyword">const</span> RoutingDimension& dimension_;</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keyword">const</span> int64_t num_nodes_;</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  </div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="comment">// TODO(user): Investigate if all arcs for a given tail can be created</span></div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="comment">// at the same time, in which case outgoing_arcs_ could point to an absl::Span</span></div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="comment">// for each tail index.</span></div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  std::vector<std::vector<ArcInfo>> outgoing_arcs_;</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  </div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  std::deque<int> bf_queue_;</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  std::vector<bool> node_in_queue_;</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  std::vector<int> tree_parent_node_of_;</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="comment">// After calling PropagateCumulBounds(), for each node index n,</span></div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="comment">// propagated_bounds_[2*n] and -propagated_bounds_[2*n+1] respectively contain</span></div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="comment">// the propagated lower and upper bounds of n's cumul variable.</span></div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  std::vector<int64_t> propagated_bounds_;</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  </div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="comment">// Vector used in DisassembleSubtree() to avoid memory reallocation.</span></div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  std::vector<int> tmp_dfs_stack_;</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  </div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="comment">// Used to store the pickup/delivery pairs encountered on the routes.</span></div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  std::vector<std::pair<int64_t, int64_t>></div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  visited_pickup_delivery_indices_for_pair_;</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span> };</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  </div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8"> 149</a></span> <span class="keyword">enum class</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> {</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="comment">// An optimal solution was found respecting all constraints.</span></div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293">OPTIMAL</a>,</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="comment">// An optimal solution was found, however constraints which were relaxed were</span></div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="comment">// violated.</span></div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af8cfb2115ef7ab822bca8edd1edac285">RELAXED_OPTIMAL_ONLY</a>,</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="comment">// A solution could not be found.</span></div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">INFEASIBLE</a></div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span> };</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  </div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html"> 159</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a> {</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af3a7be118910d54c87da7d9ecf7949ac"> 161</a></span>  <span class="keyword">virtual</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af3a7be118910d54c87da7d9ecf7949ac">~RoutingLinearSolverWrapper</a>() {}</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa5b31c976cc6734003d9950e731dfed3"> 162</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa5b31c976cc6734003d9950e731dfed3">Clear</a>() = 0;</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a6bcbec446b5474e98e50ef78544c82b0"> 163</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a6bcbec446b5474e98e50ef78544c82b0">CreateNewPositiveVariable</a>() = 0;</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad1a3a80256c0caa8f7ebdacb42294c81"> 164</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad1a3a80256c0caa8f7ebdacb42294c81">SetVariableBounds</a>(<span class="keywordtype">int</span> index, int64_t lower_bound,</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  int64_t upper_bound) = 0;</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ace2a6846080948210abab0845d93e819"> 166</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ace2a6846080948210abab0845d93e819">SetVariableDisjointBounds</a>(<span class="keywordtype">int</span> index,</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keyword">const</span> std::vector<int64_t>& starts,</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keyword">const</span> std::vector<int64_t>& ends) = 0;</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#afaf5c7b0c88dbe8a11b8d9d66a7c2871"> 169</a></span>  <span class="keyword">virtual</span> int64_t <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#afaf5c7b0c88dbe8a11b8d9d66a7c2871">GetVariableLowerBound</a>(<span class="keywordtype">int</span> index) <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad56b5d5264e07b44be873dfdcd29cb8e"> 170</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad56b5d5264e07b44be873dfdcd29cb8e">SetObjectiveCoefficient</a>(<span class="keywordtype">int</span> index, <span class="keywordtype">double</span> coefficient) = 0;</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a4812d528a6d93d471be496e9ca79c820"> 171</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a4812d528a6d93d471be496e9ca79c820">GetObjectiveCoefficient</a>(<span class="keywordtype">int</span> index) <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ab8bd6c2ebc0fe292221efda5c39de361"> 172</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ab8bd6c2ebc0fe292221efda5c39de361">ClearObjective</a>() = 0;</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a155f6032f05d373d7375078c1be4a01b"> 173</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a155f6032f05d373d7375078c1be4a01b">NumVariables</a>() <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#abd20c644980c8ff8d122dad397f04f8e"> 174</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#abd20c644980c8ff8d122dad397f04f8e">CreateNewConstraint</a>(int64_t lower_bound, int64_t upper_bound) = 0;</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a01ce5bca7f91b37ff459b4d7b63e5190"> 175</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a01ce5bca7f91b37ff459b4d7b63e5190">SetCoefficient</a>(<span class="keywordtype">int</span> ct, <span class="keywordtype">int</span> index, <span class="keywordtype">double</span> coefficient) = 0;</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa2e5858c4b94c8f69486993bfe4ffea9"> 176</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa2e5858c4b94c8f69486993bfe4ffea9">IsCPSATSolver</a>() = 0;</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#afbe78c86a32370311f3ab5d5ac3770ca"> 177</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#afbe78c86a32370311f3ab5d5ac3770ca">AddMaximumConstraint</a>(<span class="keywordtype">int</span> max_var, std::vector<int> vars) = 0;</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a589402033ed732725c2053255cb3ffde"> 178</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a589402033ed732725c2053255cb3ffde">AddProductConstraint</a>(<span class="keywordtype">int</span> product_var, std::vector<int> vars) = 0;</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ada616cd8a8068937fd4a72ae741e05d9"> 179</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ada616cd8a8068937fd4a72ae741e05d9">SetEnforcementLiteral</a>(<span class="keywordtype">int</span> ct, <span class="keywordtype">int</span> condition) = 0;</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#acb5447abf2fd0ef52e46ce561ffef5cb"> 180</a></span>  <span class="keyword">virtual</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#acb5447abf2fd0ef52e46ce561ffef5cb">Solve</a>(absl::Duration duration_limit) = 0;</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa7ad30a5bcbd156380533cc7abb69172"> 181</a></span>  <span class="keyword">virtual</span> int64_t <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa7ad30a5bcbd156380533cc7abb69172">GetObjectiveValue</a>() <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ac154a773600edab5f5fbc597c5639cce"> 182</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ac154a773600edab5f5fbc597c5639cce">GetValue</a>(<span class="keywordtype">int</span> index) <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af1eb90688746692ec522c88d501bd598"> 183</a></span>  <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af1eb90688746692ec522c88d501bd598">SolutionIsInteger</a>() <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  </div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="comment">// Adds a variable with bounds [lower_bound, upper_bound].</span></div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a822c1b23168a59678bc36920d882d813"> 186</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a822c1b23168a59678bc36920d882d813">AddVariable</a>(int64_t lower_bound, int64_t upper_bound) {</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  CHECK_LE(lower_bound, upper_bound);</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> variable = <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a6bcbec446b5474e98e50ef78544c82b0">CreateNewPositiveVariable</a>();</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad1a3a80256c0caa8f7ebdacb42294c81">SetVariableBounds</a>(variable, lower_bound, upper_bound);</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">return</span> variable;</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  }</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="comment">// Adds a linear constraint, enforcing</span></div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="comment">// lower_bound <= sum variable * coeff <= upper_bound,</span></div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="comment">// and returns the identifier of that constraint.</span></div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a74d368c047df617ec5c7025f7be2e85c"> 195</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a74d368c047df617ec5c7025f7be2e85c">AddLinearConstraint</a>(</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  int64_t lower_bound, int64_t upper_bound,</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keyword">const</span> std::vector<std::pair<int, double>>& variable_coeffs) {</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  CHECK_LE(lower_bound, upper_bound);</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> ct = <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#abd20c644980c8ff8d122dad397f04f8e">CreateNewConstraint</a>(lower_bound, upper_bound);</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& variable_coeff : variable_coeffs) {</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a01ce5bca7f91b37ff459b4d7b63e5190">SetCoefficient</a>(ct, variable_coeff.first, variable_coeff.second);</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  }</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">return</span> ct;</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  }</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="comment">// Adds a linear constraint and a 0/1 variable that is true iff</span></div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="comment">// lower_bound <= sum variable * coeff <= upper_bound,</span></div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="comment">// and returns the identifier of that variable.</span></div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aad7aced2cbb0d0caae11432ff899fad4"> 208</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aad7aced2cbb0d0caae11432ff899fad4">AddReifiedLinearConstraint</a>(</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  int64_t lower_bound, int64_t upper_bound,</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keyword">const</span> std::vector<std::pair<int, double>>& weighted_variables) {</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> reification_ct = <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a74d368c047df617ec5c7025f7be2e85c">AddLinearConstraint</a>(1, 1, {});</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">if</span> (std::numeric_limits<int64_t>::min() < lower_bound) {</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> under_lower_bound = <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a822c1b23168a59678bc36920d882d813">AddVariable</a>(0, 1);</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a01ce5bca7f91b37ff459b4d7b63e5190">SetCoefficient</a>(reification_ct, under_lower_bound, 1);</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> under_lower_bound_ct =</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a74d368c047df617ec5c7025f7be2e85c">AddLinearConstraint</a>(std::numeric_limits<int64_t>::min(),</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  lower_bound - 1, weighted_variables);</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ada616cd8a8068937fd4a72ae741e05d9">SetEnforcementLiteral</a>(under_lower_bound_ct, under_lower_bound);</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  }</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordflow">if</span> (upper_bound < std::numeric_limits<int64_t>::max()) {</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> above_upper_bound = <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a822c1b23168a59678bc36920d882d813">AddVariable</a>(0, 1);</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a01ce5bca7f91b37ff459b4d7b63e5190">SetCoefficient</a>(reification_ct, above_upper_bound, 1);</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> above_upper_bound_ct = <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a74d368c047df617ec5c7025f7be2e85c">AddLinearConstraint</a>(</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  upper_bound + 1, std::numeric_limits<int64_t>::max(),</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  weighted_variables);</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ada616cd8a8068937fd4a72ae741e05d9">SetEnforcementLiteral</a>(above_upper_bound_ct, above_upper_bound);</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  }</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> within_bounds = <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a822c1b23168a59678bc36920d882d813">AddVariable</a>(0, 1);</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a01ce5bca7f91b37ff459b4d7b63e5190">SetCoefficient</a>(reification_ct, within_bounds, 1);</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> within_bounds_ct =</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a74d368c047df617ec5c7025f7be2e85c">AddLinearConstraint</a>(lower_bound, upper_bound, weighted_variables);</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ada616cd8a8068937fd4a72ae741e05d9">SetEnforcementLiteral</a>(within_bounds_ct, within_bounds);</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">return</span> within_bounds;</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  }</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span> };</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  </div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html"> 237</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html">RoutingGlopWrapper</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a> {</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a8f7b46f13332393a627d45a46cfff2a1"> 239</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a8f7b46f13332393a627d45a46cfff2a1">RoutingGlopWrapper</a>(<span class="keyword">const</span> glop::GlopParameters& parameters) {</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  lp_solver_.SetParameters(parameters);</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  linear_program_.SetMaximizationProblem(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  }</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#ac2fdf117e3886bbce4baa56a77d3e9cc"> 243</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#ac2fdf117e3886bbce4baa56a77d3e9cc">Clear</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  linear_program_.Clear();</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  linear_program_.SetMaximizationProblem(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  allowed_intervals_.clear();</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  }</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a314fad7efb918f0fe41673b65a44253c"> 248</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a314fad7efb918f0fe41673b65a44253c">CreateNewPositiveVariable</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordflow">return</span> linear_program_.CreateNewVariable().value();</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  }</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a377c018786f6eaa2272bf3d014a3226d"> 251</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a377c018786f6eaa2272bf3d014a3226d">SetVariableBounds</a>(<span class="keywordtype">int</span> index, int64_t lower_bound,</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  int64_t upper_bound)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  DCHECK_GE(lower_bound, 0);</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="comment">// When variable upper bounds are greater than this threshold, precision</span></div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="comment">// issues arise in GLOP. In this case we are just going to suppose that</span></div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="comment">// these high bound values are infinite and not set the upper bound.</span></div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keyword">const</span> int64_t kMaxValue = 1e10;</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lp_min = lower_bound;</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lp_max =</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  (upper_bound > kMaxValue) ? glop::kInfinity : upper_bound;</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keywordflow">if</span> (lp_min <= lp_max) {</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  linear_program_.SetVariableBounds(glop::ColIndex(index), lp_min, lp_max);</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  }</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="comment">// The linear_program would not be feasible, and it cannot handle the</span></div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="comment">// lp_min > lp_max case, so we must detect infeasibility here.</span></div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  }</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a9bed98c336ea6bfd483e6c59ff901e0a"> 269</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a9bed98c336ea6bfd483e6c59ff901e0a">SetVariableDisjointBounds</a>(<span class="keywordtype">int</span> index, <span class="keyword">const</span> std::vector<int64_t>& starts,</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keyword">const</span> std::vector<int64_t>& ends)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="comment">// TODO(user): Investigate if we can avoid rebuilding the interval list</span></div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="comment">// each time (we could keep a reference to the forbidden interval list in</span></div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="comment">// RoutingDimension but we would need to store cumul offsets and use them</span></div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="comment">// when checking intervals).</span></div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  allowed_intervals_[index] =</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  absl::make_unique<SortedDisjointIntervalList>(starts, ends);</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  }</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#af771c825609aad65a2ab27d69c94f42c"> 278</a></span>  int64_t <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#af771c825609aad65a2ab27d69c94f42c">GetVariableLowerBound</a>(<span class="keywordtype">int</span> index)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">return</span> linear_program_.variable_lower_bounds()[glop::ColIndex(index)];</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  }</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#af5469274c2e2ba025997a4677d13be80"> 281</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#af5469274c2e2ba025997a4677d13be80">SetObjectiveCoefficient</a>(<span class="keywordtype">int</span> index, <span class="keywordtype">double</span> coefficient)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  linear_program_.SetObjectiveCoefficient(glop::ColIndex(index), coefficient);</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  }</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a8b4d155c1cccad5c76188e25b49aad47"> 284</a></span>  <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a8b4d155c1cccad5c76188e25b49aad47">GetObjectiveCoefficient</a>(<span class="keywordtype">int</span> index)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keywordflow">return</span> linear_program_.objective_coefficients()[glop::ColIndex(index)];</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  }</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#af9cf3c86b3e07b1f6761f3d12f04b068"> 287</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#af9cf3c86b3e07b1f6761f3d12f04b068">ClearObjective</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keywordflow">for</span> (glop::ColIndex i(0); i < linear_program_.num_variables(); ++i) {</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  linear_program_.SetObjectiveCoefficient(i, 0);</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  }</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  }</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a0d53b135116dda43796783fc1c812f83"> 292</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a0d53b135116dda43796783fc1c812f83">NumVariables</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordflow">return</span> linear_program_.num_variables().value();</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  }</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#aad45008823f0ecdab2258f5603233a28"> 295</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#aad45008823f0ecdab2258f5603233a28">CreateNewConstraint</a>(int64_t lower_bound, int64_t upper_bound)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keyword">const</span> glop::RowIndex ct = linear_program_.CreateNewConstraint();</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  linear_program_.SetConstraintBounds(</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  ct,</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  (lower_bound == std::numeric_limits<int64_t>::min()) ? -glop::kInfinity</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  : lower_bound,</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  (upper_bound == std::numeric_limits<int64_t>::max()) ? glop::kInfinity</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  : upper_bound);</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordflow">return</span> ct.value();</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  }</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a691ac6745157fb62e18c3d8cf1c4538b"> 305</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a691ac6745157fb62e18c3d8cf1c4538b">SetCoefficient</a>(<span class="keywordtype">int</span> ct, <span class="keywordtype">int</span> index, <span class="keywordtype">double</span> coefficient)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  linear_program_.SetCoefficient(glop::RowIndex(ct), glop::ColIndex(index),</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  coefficient);</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  }</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a16adf99185c4a2351c3eb6c9ab44544d"> 309</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a16adf99185c4a2351c3eb6c9ab44544d">IsCPSATSolver</a>()<span class="keyword"> override </span>{ <span class="keywordflow">return</span> <span class="keyword">false</span>; }</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a6f7b90643fd4e207a1167fc9ee517c02"> 310</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a6f7b90643fd4e207a1167fc9ee517c02">AddMaximumConstraint</a>(<span class="keywordtype">int</span> max_var, std::vector<int> vars)<span class="keyword"> override</span>{};</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a73f41f82e421be82b07fe60a42438c3b"> 311</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a73f41f82e421be82b07fe60a42438c3b">AddProductConstraint</a>(<span class="keywordtype">int</span> product_var, std::vector<int> vars)<span class="keyword"> override</span>{};</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a819cbc555690ea6f6f2eadf989455c82"> 312</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a819cbc555690ea6f6f2eadf989455c82">SetEnforcementLiteral</a>(<span class="keywordtype">int</span> ct, <span class="keywordtype">int</span> condition)<span class="keyword"> override</span>{};</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a671fad375e30cdfe6c95447a43aed2aa"> 313</a></span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a671fad375e30cdfe6c95447a43aed2aa">Solve</a>(absl::Duration duration_limit)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  lp_solver_.GetMutableParameters()->set_max_time_in_seconds(</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  absl::ToDoubleSeconds(duration_limit));</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  </div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="comment">// Because we construct the lp one constraint at a time and we never call</span></div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="comment">// SetCoefficient() on the same variable twice for a constraint, we know</span></div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="comment">// that the columns do not contain duplicates and are already ordered by</span></div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="comment">// constraint so we do not need to call linear_program->CleanUp() which can</span></div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="comment">// be costly. Note that the assumptions are DCHECKed() in the call below.</span></div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  linear_program_.NotifyThatColumnsAreClean();</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  VLOG(2) << linear_program_.Dump();</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keyword">const</span> glop::ProblemStatus status = lp_solver_.Solve(linear_program_);</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keywordflow">if</span> (status != glop::ProblemStatus::OPTIMAL &&</div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  status != glop::ProblemStatus::IMPRECISE) {</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  linear_program_.Clear();</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>;</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  }</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& allowed_interval : allowed_intervals_) {</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> value_double = <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a51b3d2be66ee6c5461945af52e85a8e0">GetValue</a>(allowed_interval.first);</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keyword">const</span> int64_t value =</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  (value_double >= std::numeric_limits<int64_t>::max())</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  ? std::numeric_limits<int64_t>::max()</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  : MathUtil::FastInt64Round(value_double);</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keyword">const</span> SortedDisjointIntervalList* <span class="keyword">const</span> interval_list =</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  allowed_interval.second.get();</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keyword">const</span> <span class="keyword">auto</span> it = interval_list->FirstIntervalGreaterOrEqual(value);</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">if</span> (it == interval_list->end() || value < it->start) {</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af8cfb2115ef7ab822bca8edd1edac285">DimensionSchedulingStatus::RELAXED_OPTIMAL_ONLY</a>;</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  }</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  }</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293">DimensionSchedulingStatus::OPTIMAL</a>;</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  }</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a624e1c907319c025fd9187bdc441f12b"> 345</a></span>  int64_t <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a624e1c907319c025fd9187bdc441f12b">GetObjectiveValue</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordflow">return</span> MathUtil::FastInt64Round(lp_solver_.GetObjectiveValue());</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  }</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#a51b3d2be66ee6c5461945af52e85a8e0"> 348</a></span>  <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#a51b3d2be66ee6c5461945af52e85a8e0">GetValue</a>(<span class="keywordtype">int</span> index)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keywordflow">return</span> lp_solver_.variable_values()[glop::ColIndex(index)];</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  }</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_glop_wrapper.html#aa8f92595bdcd4aefc72ce6c0015d41cb"> 351</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_routing_glop_wrapper.html#aa8f92595bdcd4aefc72ce6c0015d41cb">SolutionIsInteger</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordflow">return</span> linear_program_.SolutionIsInteger(lp_solver_.variable_values(),</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="comment">/*absolute_tolerance*/</span> 1e-3);</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  }</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  </div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  glop::LinearProgram linear_program_;</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  glop::LPSolver lp_solver_;</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  absl::flat_hash_map<int, std::unique_ptr<SortedDisjointIntervalList>></div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  allowed_intervals_;</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span> };</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  </div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html"> 363</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html">RoutingCPSatWrapper</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a> {</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a28fd517263e8003e3e545d646b96d75f"> 365</a></span>  <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a28fd517263e8003e3e545d646b96d75f">RoutingCPSatWrapper</a>() : objective_offset_(0), first_constraint_to_offset_(0) {</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  parameters_.set_num_search_workers(1);</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="comment">// Keeping presolve but with 0 iterations; as of 11/2019 it is</span></div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="comment">// significantly faster than both full presolve and no presolve.</span></div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  parameters_.set_cp_model_presolve(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  parameters_.set_max_presolve_iterations(0);</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  parameters_.set_catch_sigint_signal(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  parameters_.set_mip_max_bound(1e8);</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  parameters_.set_search_branching(sat::SatParameters::LP_SEARCH);</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  }</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a68ad095b727149311d03f62a86c34080"> 375</a></span>  <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a68ad095b727149311d03f62a86c34080">~RoutingCPSatWrapper</a>()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#ac2fdf117e3886bbce4baa56a77d3e9cc"> 376</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#ac2fdf117e3886bbce4baa56a77d3e9cc">Clear</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  model_.Clear();</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  response_.Clear();</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  objective_coefficients_.clear();</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  objective_offset_ = 0;</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  variable_offset_.clear();</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  constraint_offset_.clear();</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  first_constraint_to_offset_ = 0;</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  }</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a314fad7efb918f0fe41673b65a44253c"> 385</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a314fad7efb918f0fe41673b65a44253c">CreateNewPositiveVariable</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> index = model_.variables_size();</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordflow">if</span> (index >= variable_offset_.size()) {</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  variable_offset_.resize(index + 1, 0);</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  }</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  sat::IntegerVariableProto* <span class="keyword">const</span> variable = model_.add_variables();</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  variable->add_domain(0);</div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  variable->add_domain(<span class="keyword">static_cast<</span>int64_t<span class="keyword">></span>(parameters_.mip_max_bound()));</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keywordflow">return</span> index;</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  }</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a377c018786f6eaa2272bf3d014a3226d"> 395</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a377c018786f6eaa2272bf3d014a3226d">SetVariableBounds</a>(<span class="keywordtype">int</span> index, int64_t lower_bound,</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  int64_t upper_bound)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  DCHECK_GE(lower_bound, 0);</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="comment">// TODO(user): Find whether there is a way to make the offsetting</span></div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="comment">// system work with other CP-SAT constraints than linear constraints.</span></div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="comment">// variable_offset_[index] = lower_bound;</span></div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  variable_offset_[index] = 0;</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keyword">const</span> int64_t offset_upper_bound =</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  std::min<int64_t>(CapSub(upper_bound, variable_offset_[index]),</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  parameters_.mip_max_bound());</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keyword">const</span> int64_t offset_lower_bound =</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  CapSub(lower_bound, variable_offset_[index]);</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordflow">if</span> (offset_lower_bound > offset_upper_bound) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  sat::IntegerVariableProto* <span class="keyword">const</span> variable = model_.mutable_variables(index);</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  variable->set_domain(0, offset_lower_bound);</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  variable->set_domain(1, offset_upper_bound);</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  }</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a9bed98c336ea6bfd483e6c59ff901e0a"> 413</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a9bed98c336ea6bfd483e6c59ff901e0a">SetVariableDisjointBounds</a>(<span class="keywordtype">int</span> index, <span class="keyword">const</span> std::vector<int64_t>& starts,</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keyword">const</span> std::vector<int64_t>& ends)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  DCHECK_EQ(starts.size(), ends.size());</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> ct = <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aad45008823f0ecdab2258f5603233a28">CreateNewConstraint</a>(1, 1);</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < starts.size(); ++i) {</div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> variable = <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a314fad7efb918f0fe41673b65a44253c">CreateNewPositiveVariable</a>();</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a377c018786f6eaa2272bf3d014a3226d">SetVariableBounds</a>(variable, 0, 1);</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a00bd8299ff5696ff8a0ef53928901955">SetCoefficient</a>(ct, variable, 1);</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> window_ct = <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aad45008823f0ecdab2258f5603233a28">CreateNewConstraint</a>(starts[i], ends[i]);</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a00bd8299ff5696ff8a0ef53928901955">SetCoefficient</a>(window_ct, index, 1);</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  model_.mutable_constraints(window_ct)->add_enforcement_literal(variable);</div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  }</div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  }</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#af771c825609aad65a2ab27d69c94f42c"> 426</a></span>  int64_t <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#af771c825609aad65a2ab27d69c94f42c">GetVariableLowerBound</a>(<span class="keywordtype">int</span> index)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keywordflow">return</span> CapAdd(model_.variables(index).domain(0), variable_offset_[index]);</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  }</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#af5469274c2e2ba025997a4677d13be80"> 429</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#af5469274c2e2ba025997a4677d13be80">SetObjectiveCoefficient</a>(<span class="keywordtype">int</span> index, <span class="keywordtype">double</span> coefficient)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="comment">// TODO(user): Check variable bounds are never set after setting the</span></div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="comment">// objective coefficient.</span></div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="keywordflow">if</span> (index >= objective_coefficients_.size()) {</div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  objective_coefficients_.resize(index + 1, 0);</div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  }</div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  objective_coefficients_[index] = coefficient;</div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  sat::CpObjectiveProto* <span class="keyword">const</span> objective = model_.mutable_objective();</div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  objective->add_vars(index);</div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  objective->add_coeffs(coefficient);</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  objective_offset_ += coefficient * variable_offset_[index];</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  }</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a8b4d155c1cccad5c76188e25b49aad47"> 441</a></span>  <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a8b4d155c1cccad5c76188e25b49aad47">GetObjectiveCoefficient</a>(<span class="keywordtype">int</span> index)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="keywordflow">return</span> (index < objective_coefficients_.size())</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  ? objective_coefficients_[index]</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  : 0;</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  }</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#af9cf3c86b3e07b1f6761f3d12f04b068"> 446</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#af9cf3c86b3e07b1f6761f3d12f04b068">ClearObjective</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  model_.mutable_objective()->Clear();</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  objective_offset_ = 0;</div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  }</div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a0d53b135116dda43796783fc1c812f83"> 450</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a0d53b135116dda43796783fc1c812f83">NumVariables</a>()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> model_.variables_size(); }</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aad45008823f0ecdab2258f5603233a28"> 451</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aad45008823f0ecdab2258f5603233a28">CreateNewConstraint</a>(int64_t lower_bound, int64_t upper_bound)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> ct_index = model_.constraints_size();</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="keywordflow">if</span> (ct_index >= constraint_offset_.size()) {</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  constraint_offset_.resize(ct_index + 1, 0);</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  }</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  sat::LinearConstraintProto* <span class="keyword">const</span> ct =</div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  model_.add_constraints()->mutable_linear();</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  ct->add_domain(lower_bound);</div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  ct->add_domain(upper_bound);</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keywordflow">return</span> ct_index;</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  }</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a00bd8299ff5696ff8a0ef53928901955"> 462</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a00bd8299ff5696ff8a0ef53928901955">SetCoefficient</a>(<span class="keywordtype">int</span> ct_index, <span class="keywordtype">int</span> index, <span class="keywordtype">double</span> coefficient)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="comment">// TODO(user): Check variable bounds are never set after setting the</span></div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="comment">// variable coefficient.</span></div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  sat::LinearConstraintProto* <span class="keyword">const</span> ct =</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  model_.mutable_constraints(ct_index)->mutable_linear();</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  ct->add_vars(index);</div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  ct->add_coeffs(coefficient);</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  constraint_offset_[ct_index] =</div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  CapAdd(constraint_offset_[ct_index],</div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  CapProd(variable_offset_[index], coefficient));</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  }</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a16adf99185c4a2351c3eb6c9ab44544d"> 473</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a16adf99185c4a2351c3eb6c9ab44544d">IsCPSATSolver</a>()<span class="keyword"> override </span>{ <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a6f7b90643fd4e207a1167fc9ee517c02"> 474</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a6f7b90643fd4e207a1167fc9ee517c02">AddMaximumConstraint</a>(<span class="keywordtype">int</span> max_var, std::vector<int> vars)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  sat::LinearArgumentProto* <span class="keyword">const</span> ct =</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  model_.add_constraints()->mutable_lin_max();</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  ct->mutable_target()->add_vars(max_var);</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  ct->mutable_target()->add_coeffs(1);</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> var : vars) {</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  sat::LinearExpressionProto* <span class="keyword">const</span> expr = ct->add_exprs();</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  expr->add_vars(var);</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  expr->add_coeffs(1);</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  }</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  }</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a73f41f82e421be82b07fe60a42438c3b"> 485</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a73f41f82e421be82b07fe60a42438c3b">AddProductConstraint</a>(<span class="keywordtype">int</span> product_var, std::vector<int> vars)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  sat::IntegerArgumentProto* <span class="keyword">const</span> ct =</div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  model_.add_constraints()->mutable_int_prod();</div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  ct->set_target(product_var);</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> var : vars) {</div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  ct->add_vars(var);</div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  }</div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  }</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a819cbc555690ea6f6f2eadf989455c82"> 493</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a819cbc555690ea6f6f2eadf989455c82">SetEnforcementLiteral</a>(<span class="keywordtype">int</span> ct, <span class="keywordtype">int</span> condition)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  DCHECK_LT(ct, constraint_offset_.size());</div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  model_.mutable_constraints(ct)->add_enforcement_literal(condition);</div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  }</div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a671fad375e30cdfe6c95447a43aed2aa"> 497</a></span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a671fad375e30cdfe6c95447a43aed2aa">Solve</a>(absl::Duration duration_limit)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="comment">// Set constraint offsets</span></div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ct_index = first_constraint_to_offset_;</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  ct_index < constraint_offset_.size(); ++ct_index) {</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="keywordflow">if</span> (!model_.mutable_constraints(ct_index)->has_linear()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  sat::LinearConstraintProto* <span class="keyword">const</span> ct =</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  model_.mutable_constraints(ct_index)->mutable_linear();</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  ct->set_domain(0, CapSub(ct->domain(0), constraint_offset_[ct_index]));</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  ct->set_domain(1, CapSub(ct->domain(1), constraint_offset_[ct_index]));</div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  }</div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  first_constraint_to_offset_ = constraint_offset_.size();</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  parameters_.set_max_time_in_seconds(absl::ToDoubleSeconds(duration_limit));</div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  VLOG(2) << model_.DebugString();</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keywordflow">if</span> (hint_.vars_size() == model_.variables_size()) {</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  *model_.mutable_solution_hint() = hint_;</div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  }</div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  sat::Model model;</div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  model.Add(sat::NewSatParameters(parameters_));</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  response_ = sat::SolveCpModel(model_, &model);</div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  VLOG(2) << response_.DebugString();</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordflow">if</span> (response_.status() == sat::CpSolverStatus::OPTIMAL ||</div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  (response_.status() == sat::CpSolverStatus::FEASIBLE &&</div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  !model_.has_objective())) {</div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  hint_.Clear();</div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < response_.solution_size(); ++i) {</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  hint_.add_vars(i);</div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  hint_.add_values(response_.solution(i));</div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  }</div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293">DimensionSchedulingStatus::OPTIMAL</a>;</div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  }</div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>;</div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  }</div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a624e1c907319c025fd9187bdc441f12b"> 529</a></span>  int64_t <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a624e1c907319c025fd9187bdc441f12b">GetObjectiveValue</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keywordflow">return</span> MathUtil::FastInt64Round(response_.objective_value() +</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  objective_offset_);</div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  }</div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a51b3d2be66ee6c5461945af52e85a8e0"> 533</a></span>  <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a51b3d2be66ee6c5461945af52e85a8e0">GetValue</a>(<span class="keywordtype">int</span> index)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keywordflow">return</span> response_.solution(index) + variable_offset_[index];</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  }</div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aa8f92595bdcd4aefc72ce6c0015d41cb"> 536</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aa8f92595bdcd4aefc72ce6c0015d41cb">SolutionIsInteger</a>()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  </div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  sat::CpModelProto model_;</div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  sat::CpSolverResponse response_;</div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  sat::SatParameters parameters_;</div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  std::vector<double> objective_coefficients_;</div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="keywordtype">double</span> objective_offset_;</div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  std::vector<int64_t> variable_offset_;</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  std::vector<int64_t> constraint_offset_;</div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keywordtype">int</span> first_constraint_to_offset_;</div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  sat::PartialVariableAssignment hint_;</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span> };</div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  </div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span> <span class="comment">// Utility class used in Local/GlobalDimensionCumulOptimizer to set the linear</span></div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span> <span class="comment">// solver constraints and solve the problem.</span></div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html"> 552</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html">DimensionCumulOptimizerCore</a> {</div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a5967f72ac911a2ed971a1ce103d1c47b"> 554</a></span>  <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a5967f72ac911a2ed971a1ce103d1c47b">DimensionCumulOptimizerCore</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>,</div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keywordtype">bool</span> use_precedence_propagator);</div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  </div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="comment">// In the OptimizeSingleRoute() and Optimize() methods, if both "cumul_values"</span></div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="comment">// and "cost" parameters are null, we don't optimize the cost and stop at the</span></div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="comment">// first feasible solution in the linear solver (since in this case only</span></div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="comment">// feasibility is of interest).</span></div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#ad8f55e0b1048c51c733207c60a2f87b0"> 561</a></span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#ad8f55e0b1048c51c733207c60a2f87b0">OptimizeSingleRoute</a>(</div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver, std::vector<int64_t>* cumul_values,</div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  std::vector<int64_t>* break_values, int64_t* cost, int64_t* transit_cost,</div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="keywordtype">bool</span> clear_lp = <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  </div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#ad12076a83089d6027d0f0626cf1cd6e8"> 567</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#ad12076a83089d6027d0f0626cf1cd6e8">Optimize</a>(<span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver,</div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  std::vector<int64_t>* cumul_values,</div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  std::vector<int64_t>* break_values, int64_t* cost,</div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  int64_t* transit_cost, <span class="keywordtype">bool</span> clear_lp = <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  </div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a791d2fea6b80ba6631daf538d156b2bc"> 573</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a791d2fea6b80ba6631daf538d156b2bc">OptimizeAndPack</a>(<span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver,</div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  std::vector<int64_t>* cumul_values,</div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  std::vector<int64_t>* break_values);</div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  </div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a876775ab31e400b8fd3d7a09db722135"> 578</a></span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a876775ab31e400b8fd3d7a09db722135">OptimizeAndPackSingleRoute</a>(</div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver, std::vector<int64_t>* cumul_values,</div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  std::vector<int64_t>* break_values);</div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  </div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a6769f38bbc3271d45b0512c12ef31f70"> 583</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> dimension_; }</div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  </div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="comment">// Initializes the containers and given solver. Must be called prior to</span></div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="comment">// setting any contraints and solving.</span></div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="keywordtype">void</span> InitOptimizer(<a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver);</div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  </div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="comment">// Computes the minimum/maximum of cumuls for nodes on "route", and sets them</span></div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="comment">// in current_route_[min|max]_cumuls_ respectively.</span></div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="comment">// If the propagator_ is not null, uses the bounds tightened by the</span></div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="comment">// propagator.</span></div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="comment">// Otherwise, the bounds are computed by going over the nodes on the route</span></div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="comment">// using the CP bounds, and the fixed transits are used to tighten them.</span></div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keywordtype">bool</span> ComputeRouteCumulBounds(<span class="keyword">const</span> std::vector<int64_t>& route,</div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keyword">const</span> std::vector<int64_t>& fixed_transits,</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  int64_t cumul_offset);</div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  </div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="comment">// Sets the constraints for all nodes on "vehicle"'s route according to</span></div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="comment">// "next_accessor". If optimize_costs is true, also sets the objective</span></div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="comment">// coefficients for the LP.</span></div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="comment">// Returns false if some infeasibility was detected, true otherwise.</span></div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  <span class="keywordtype">bool</span> SetRouteCumulConstraints(</div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  int64_t cumul_offset, <span class="keywordtype">bool</span> optimize_costs,</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver, int64_t* route_transit_cost,</div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  int64_t* route_cost_offset);</div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  </div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="comment">// Sets the global constraints on the dimension, and adds global objective</span></div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="comment">// cost coefficients if optimize_costs is true.</span></div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <span class="comment">// NOTE: When called, the call to this function MUST come after</span></div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="comment">// SetRouteCumulConstraints() has been called on all routes, so that</span></div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="comment">// index_to_cumul_variable_ and min_start/max_end_cumul_ are correctly</span></div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="comment">// initialized.</span></div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="keywordtype">void</span> SetGlobalConstraints(<span class="keywordtype">bool</span> optimize_costs,</div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver);</div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  </div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="keywordtype">void</span> SetValuesFromLP(<span class="keyword">const</span> std::vector<int>& lp_variables, int64_t offset,</div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver,</div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  std::vector<int64_t>* lp_values);</div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  </div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="comment">// This function packs the routes of the given vehicles while keeping the cost</span></div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="comment">// of the LP lower than its current (supposed optimal) objective value.</span></div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="comment">// It does so by setting the current objective variables' coefficient to 0 and</span></div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="comment">// setting the coefficient of the route ends to 1, to first minimize the route</span></div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="comment">// ends' cumuls, and then maximizes the starts' cumuls without increasing the</span></div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="comment">// ends.</span></div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> PackRoutes(std::vector<int> vehicles,</div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver);</div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  </div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  std::unique_ptr<CumulBoundsPropagator> propagator_;</div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  std::vector<int64_t> current_route_min_cumuls_;</div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  std::vector<int64_t> current_route_max_cumuls_;</div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <span class="keyword">const</span> dimension_;</div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="comment">// Scheduler variables for current route cumuls and for all nodes cumuls.</span></div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  std::vector<int> current_route_cumul_variables_;</div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  std::vector<int> index_to_cumul_variable_;</div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="comment">// Scheduler variables for current route breaks and all vehicle breaks.</span></div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="comment">// There are two variables for each break: start and end.</span></div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="comment">// current_route_break_variables_ has variables corresponding to</span></div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="comment">// break[0] start, break[0] end, break[1] start, break[1] end, etc.</span></div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  std::vector<int> current_route_break_variables_;</div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="comment">// Vector all_break_variables contains the break variables of all vehicles,</span></div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="comment">// in the same format as current_route_break_variables.</span></div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <span class="comment">// It is the concatenation of break variables of vehicles in [0, #vehicles).</span></div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  std::vector<int> all_break_variables_;</div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="comment">// Allows to retrieve break variables of a given vehicle: those go from</span></div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="comment">// all_break_variables_[vehicle_to_all_break_variables_offset_[vehicle]] to</span></div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="comment">// all_break_variables[vehicle_to_all_break_variables_offset_[vehicle+1]-1].</span></div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  std::vector<int> vehicle_to_all_break_variables_offset_;</div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  </div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <span class="keywordtype">int</span> max_end_cumul_;</div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="keywordtype">int</span> min_start_cumul_;</div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  std::vector<std::pair<int64_t, int64_t>></div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  visited_pickup_delivery_indices_for_pair_;</div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span> };</div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  </div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span> <span class="comment">// Class used to compute optimal values for dimension cumuls of routes,</span></div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span> <span class="comment">// minimizing cumul soft lower and upper bound costs, and vehicle span costs of</span></div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span> <span class="comment">// a route.</span></div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span> <span class="comment">// In its methods, next_accessor is a callback returning the next node of a</span></div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span> <span class="comment">// given node on a route.</span></div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html"> 664</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html">LocalDimensionCumulOptimizer</a> {</div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a5bcbf49ff1a9dd9f92c40750ec0267b4"> 666</a></span>  <a class="code" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a5bcbf49ff1a9dd9f92c40750ec0267b4">LocalDimensionCumulOptimizer</a>(</div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <a class="code" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>,</div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  RoutingSearchParameters::SchedulingSolver solver_type);</div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  </div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <span class="comment">// If feasible, computes the optimal cost of the route performed by a vehicle,</span></div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <span class="comment">// minimizing cumul soft lower and upper bound costs and vehicle span costs,</span></div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="comment">// and stores it in "optimal_cost" (if not null).</span></div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="comment">// Returns true iff the route respects all constraints.</span></div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a10cab4b73bfe12bef44924a47c5345b6"> 674</a></span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a10cab4b73bfe12bef44924a47c5345b6">ComputeRouteCumulCost</a>(</div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  int64_t* optimal_cost);</div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  </div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="comment">// Same as ComputeRouteCumulCost, but the cost computed does not contain</span></div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="comment">// the part of the vehicle span cost due to fixed transits.</span></div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a296e8d7e154740a84c59774f20a295ba"> 680</a></span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a296e8d7e154740a84c59774f20a295ba">ComputeRouteCumulCostWithoutFixedTransits</a>(</div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  int64_t* optimal_cost_without_transits);</div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  </div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="comment">// If feasible, computes the optimal values for cumul and break variables</span></div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="comment">// of the route performed by a vehicle, minimizing cumul soft lower, upper</span></div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <span class="comment">// bound costs and vehicle span costs, stores them in "optimal_cumuls"</span></div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="comment">// (if not null), and optimal_breaks, and returns true.</span></div>
|
|
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="comment">// Returns false if the route is not feasible.</span></div>
|
|
<div class="line"><a name="l00689"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a161ed371fd2e35ef76b4539540bfcfd6"> 689</a></span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a161ed371fd2e35ef76b4539540bfcfd6">ComputeRouteCumuls</a>(</div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  std::vector<int64_t>* optimal_cumuls,</div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  std::vector<int64_t>* optimal_breaks);</div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  </div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="comment">// Similar to ComputeRouteCumuls, but also tries to pack the cumul values on</span></div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="comment">// the route, such that the cost remains the same, the cumul of route end is</span></div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="comment">// minimized, and then the cumul of the start of the route is maximized.</span></div>
|
|
<div class="line"><a name="l00697"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#ac8d866b9daf1876e81859fc2077b0fe2"> 697</a></span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#ac8d866b9daf1876e81859fc2077b0fe2">ComputePackedRouteCumuls</a>(</div>
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  std::vector<int64_t>* packed_cumuls, std::vector<int64_t>* packed_breaks);</div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  </div>
|
|
<div class="line"><a name="l00701"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a6769f38bbc3271d45b0512c12ef31f70"> 701</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <a class="code" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="keywordflow">return</span> optimizer_core_.<a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>();</div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  }</div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  </div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  std::vector<std::unique_ptr<RoutingLinearSolverWrapper>> solver_;</div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html">DimensionCumulOptimizerCore</a> optimizer_core_;</div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span> };</div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  </div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html"> 710</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html">GlobalDimensionCumulOptimizer</a> {</div>
|
|
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00712"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a69c482660dedcd9e709e459c979790a2"> 712</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a69c482660dedcd9e709e459c979790a2">GlobalDimensionCumulOptimizer</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>);</div>
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <span class="comment">// If feasible, computes the optimal cost of the entire model with regards to</span></div>
|
|
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="comment">// the optimizer_core_'s dimension costs, minimizing cumul soft lower/upper</span></div>
|
|
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="comment">// bound costs and vehicle/global span costs, and stores it in "optimal_cost"</span></div>
|
|
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="comment">// (if not null).</span></div>
|
|
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="comment">// Returns true iff all the constraints can be respected.</span></div>
|
|
<div class="line"><a name="l00718"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a37e031693cddcfe82192d8f5b698c728"> 718</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a37e031693cddcfe82192d8f5b698c728">ComputeCumulCostWithoutFixedTransits</a>(</div>
|
|
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  int64_t* optimal_cost_without_transits);</div>
|
|
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <span class="comment">// If feasible, computes the optimal values for cumul and break variables,</span></div>
|
|
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <span class="comment">// minimizing cumul soft lower/upper bound costs and vehicle/global span</span></div>
|
|
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <span class="comment">// costs, stores them in "optimal_cumuls" (if not null) and optimal breaks,</span></div>
|
|
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <span class="comment">// and returns true.</span></div>
|
|
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="comment">// Returns false if the routes are not feasible.</span></div>
|
|
<div class="line"><a name="l00726"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#ad16ca01f8caa308ebdbacde31e032fc3"> 726</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#ad16ca01f8caa308ebdbacde31e032fc3">ComputeCumuls</a>(<span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  std::vector<int64_t>* optimal_cumuls,</div>
|
|
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  std::vector<int64_t>* optimal_breaks);</div>
|
|
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  </div>
|
|
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  <span class="comment">// Returns true iff the routes resulting from the next_accessor are feasible</span></div>
|
|
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="comment">// wrt the constraints on the optimizer_core_.dimension()'s cumuls.</span></div>
|
|
<div class="line"><a name="l00732"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a799b11cd3c941d4b38576d1a8cc00537"> 732</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a799b11cd3c941d4b38576d1a8cc00537">IsFeasible</a>(<span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor);</div>
|
|
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  </div>
|
|
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  <span class="comment">// Similar to ComputeCumuls, but also tries to pack the cumul values on all</span></div>
|
|
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <span class="comment">// routes, such that the cost remains the same, the cumuls of route ends are</span></div>
|
|
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="comment">// minimized, and then the cumuls of the starts of the routes are maximized.</span></div>
|
|
<div class="line"><a name="l00737"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#aeb84f1547923110d3acd564d4d673af4"> 737</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#aeb84f1547923110d3acd564d4d673af4">ComputePackedCumuls</a>(<span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  std::vector<int64_t>* packed_cumuls,</div>
|
|
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  std::vector<int64_t>* packed_breaks);</div>
|
|
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  </div>
|
|
<div class="line"><a name="l00741"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a6769f38bbc3271d45b0512c12ef31f70"> 741</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* <a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="keywordflow">return</span> optimizer_core_.<a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>();</div>
|
|
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  }</div>
|
|
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  </div>
|
|
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  std::unique_ptr<RoutingLinearSolverWrapper> solver_;</div>
|
|
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html">DimensionCumulOptimizerCore</a> optimizer_core_;</div>
|
|
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span> };</div>
|
|
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  </div>
|
|
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  </div>
|
|
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span> <span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_CONSTRAINT_SOLVER_ROUTING_LP_SCHEDULING_H_</span></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cumul_bounds_propagator_html"><div class="ttname"><a href="classoperations__research_1_1_cumul_bounds_propagator.html">operations_research::CumulBoundsPropagator</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00053">routing_lp_scheduling.h:53</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cumul_bounds_propagator_html_a72be8a813404822957fbd808d0405226"><div class="ttname"><a href="classoperations__research_1_1_cumul_bounds_propagator.html#a72be8a813404822957fbd808d0405226">operations_research::CumulBoundsPropagator::dimension</a></div><div class="ttdeci">const RoutingDimension & dimension() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00078">routing_lp_scheduling.h:78</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cumul_bounds_propagator_html_a9fd8e875c97504d8d8121125decee57a"><div class="ttname"><a href="classoperations__research_1_1_cumul_bounds_propagator.html#a9fd8e875c97504d8d8121125decee57a">operations_research::CumulBoundsPropagator::CumulMax</a></div><div class="ttdeci">int64_t CumulMax(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00071">routing_lp_scheduling.h:71</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cumul_bounds_propagator_html_aa83a7ff5ef57860290d9838959d6ecf1"><div class="ttname"><a href="classoperations__research_1_1_cumul_bounds_propagator.html#aa83a7ff5ef57860290d9838959d6ecf1">operations_research::CumulBoundsPropagator::PropagateCumulBounds</a></div><div class="ttdeci">bool PropagateCumulBounds(const std::function< int64_t(int64_t)> &next_accessor, int64_t cumul_offset)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cumul_bounds_propagator_html_af1f46eca007a484893dbde252abb8251"><div class="ttname"><a href="classoperations__research_1_1_cumul_bounds_propagator.html#af1f46eca007a484893dbde252abb8251">operations_research::CumulBoundsPropagator::CumulMin</a></div><div class="ttdeci">int64_t CumulMin(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00067">routing_lp_scheduling.h:67</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cumul_bounds_propagator_html_aff8f29b2fce9f6447474ee6077af1b72"><div class="ttname"><a href="classoperations__research_1_1_cumul_bounds_propagator.html#aff8f29b2fce9f6447474ee6077af1b72">operations_research::CumulBoundsPropagator::CumulBoundsPropagator</a></div><div class="ttdeci">CumulBoundsPropagator(const RoutingDimension *dimension)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html">operations_research::DimensionCumulOptimizerCore</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00552">routing_lp_scheduling.h:552</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_a5967f72ac911a2ed971a1ce103d1c47b"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a5967f72ac911a2ed971a1ce103d1c47b">operations_research::DimensionCumulOptimizerCore::DimensionCumulOptimizerCore</a></div><div class="ttdeci">DimensionCumulOptimizerCore(const RoutingDimension *dimension, bool use_precedence_propagator)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_a6769f38bbc3271d45b0512c12ef31f70"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a6769f38bbc3271d45b0512c12ef31f70">operations_research::DimensionCumulOptimizerCore::dimension</a></div><div class="ttdeci">const RoutingDimension * dimension() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00583">routing_lp_scheduling.h:583</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_a791d2fea6b80ba6631daf538d156b2bc"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a791d2fea6b80ba6631daf538d156b2bc">operations_research::DimensionCumulOptimizerCore::OptimizeAndPack</a></div><div class="ttdeci">bool OptimizeAndPack(const std::function< int64_t(int64_t)> &next_accessor, RoutingLinearSolverWrapper *solver, std::vector< int64_t > *cumul_values, std::vector< int64_t > *break_values)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_a876775ab31e400b8fd3d7a09db722135"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a876775ab31e400b8fd3d7a09db722135">operations_research::DimensionCumulOptimizerCore::OptimizeAndPackSingleRoute</a></div><div class="ttdeci">DimensionSchedulingStatus OptimizeAndPackSingleRoute(int vehicle, const std::function< int64_t(int64_t)> &next_accessor, RoutingLinearSolverWrapper *solver, std::vector< int64_t > *cumul_values, std::vector< int64_t > *break_values)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_ad12076a83089d6027d0f0626cf1cd6e8"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#ad12076a83089d6027d0f0626cf1cd6e8">operations_research::DimensionCumulOptimizerCore::Optimize</a></div><div class="ttdeci">bool Optimize(const std::function< int64_t(int64_t)> &next_accessor, RoutingLinearSolverWrapper *solver, std::vector< int64_t > *cumul_values, std::vector< int64_t > *break_values, int64_t *cost, int64_t *transit_cost, bool clear_lp=true)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_ad8f55e0b1048c51c733207c60a2f87b0"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#ad8f55e0b1048c51c733207c60a2f87b0">operations_research::DimensionCumulOptimizerCore::OptimizeSingleRoute</a></div><div class="ttdeci">DimensionSchedulingStatus OptimizeSingleRoute(int vehicle, const std::function< int64_t(int64_t)> &next_accessor, RoutingLinearSolverWrapper *solver, std::vector< int64_t > *cumul_values, std::vector< int64_t > *break_values, int64_t *cost, int64_t *transit_cost, bool clear_lp=true)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html">operations_research::GlobalDimensionCumulOptimizer</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00710">routing_lp_scheduling.h:710</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a37e031693cddcfe82192d8f5b698c728"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a37e031693cddcfe82192d8f5b698c728">operations_research::GlobalDimensionCumulOptimizer::ComputeCumulCostWithoutFixedTransits</a></div><div class="ttdeci">bool ComputeCumulCostWithoutFixedTransits(const std::function< int64_t(int64_t)> &next_accessor, int64_t *optimal_cost_without_transits)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a6769f38bbc3271d45b0512c12ef31f70"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a6769f38bbc3271d45b0512c12ef31f70">operations_research::GlobalDimensionCumulOptimizer::dimension</a></div><div class="ttdeci">const RoutingDimension * dimension() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00741">routing_lp_scheduling.h:741</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a69c482660dedcd9e709e459c979790a2"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a69c482660dedcd9e709e459c979790a2">operations_research::GlobalDimensionCumulOptimizer::GlobalDimensionCumulOptimizer</a></div><div class="ttdeci">GlobalDimensionCumulOptimizer(const RoutingDimension *dimension)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a799b11cd3c941d4b38576d1a8cc00537"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a799b11cd3c941d4b38576d1a8cc00537">operations_research::GlobalDimensionCumulOptimizer::IsFeasible</a></div><div class="ttdeci">bool IsFeasible(const std::function< int64_t(int64_t)> &next_accessor)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_ad16ca01f8caa308ebdbacde31e032fc3"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#ad16ca01f8caa308ebdbacde31e032fc3">operations_research::GlobalDimensionCumulOptimizer::ComputeCumuls</a></div><div class="ttdeci">bool ComputeCumuls(const std::function< int64_t(int64_t)> &next_accessor, std::vector< int64_t > *optimal_cumuls, std::vector< int64_t > *optimal_breaks)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_aeb84f1547923110d3acd564d4d673af4"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#aeb84f1547923110d3acd564d4d673af4">operations_research::GlobalDimensionCumulOptimizer::ComputePackedCumuls</a></div><div class="ttdeci">bool ComputePackedCumuls(const std::function< int64_t(int64_t)> &next_accessor, std::vector< int64_t > *packed_cumuls, std::vector< int64_t > *packed_breaks)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html">operations_research::LocalDimensionCumulOptimizer</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00664">routing_lp_scheduling.h:664</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a10cab4b73bfe12bef44924a47c5345b6"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a10cab4b73bfe12bef44924a47c5345b6">operations_research::LocalDimensionCumulOptimizer::ComputeRouteCumulCost</a></div><div class="ttdeci">DimensionSchedulingStatus ComputeRouteCumulCost(int vehicle, const std::function< int64_t(int64_t)> &next_accessor, int64_t *optimal_cost)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a161ed371fd2e35ef76b4539540bfcfd6"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a161ed371fd2e35ef76b4539540bfcfd6">operations_research::LocalDimensionCumulOptimizer::ComputeRouteCumuls</a></div><div class="ttdeci">DimensionSchedulingStatus ComputeRouteCumuls(int vehicle, const std::function< int64_t(int64_t)> &next_accessor, std::vector< int64_t > *optimal_cumuls, std::vector< int64_t > *optimal_breaks)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a296e8d7e154740a84c59774f20a295ba"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a296e8d7e154740a84c59774f20a295ba">operations_research::LocalDimensionCumulOptimizer::ComputeRouteCumulCostWithoutFixedTransits</a></div><div class="ttdeci">DimensionSchedulingStatus ComputeRouteCumulCostWithoutFixedTransits(int vehicle, const std::function< int64_t(int64_t)> &next_accessor, int64_t *optimal_cost_without_transits)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a5bcbf49ff1a9dd9f92c40750ec0267b4"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a5bcbf49ff1a9dd9f92c40750ec0267b4">operations_research::LocalDimensionCumulOptimizer::LocalDimensionCumulOptimizer</a></div><div class="ttdeci">LocalDimensionCumulOptimizer(const RoutingDimension *dimension, RoutingSearchParameters::SchedulingSolver solver_type)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a6769f38bbc3271d45b0512c12ef31f70"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a6769f38bbc3271d45b0512c12ef31f70">operations_research::LocalDimensionCumulOptimizer::dimension</a></div><div class="ttdeci">const RoutingDimension * dimension() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00701">routing_lp_scheduling.h:701</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_ac8d866b9daf1876e81859fc2077b0fe2"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#ac8d866b9daf1876e81859fc2077b0fe2">operations_research::LocalDimensionCumulOptimizer::ComputePackedRouteCumuls</a></div><div class="ttdeci">DimensionSchedulingStatus ComputePackedRouteCumuls(int vehicle, const std::function< int64_t(int64_t)> &next_accessor, std::vector< int64_t > *packed_cumuls, std::vector< int64_t > *packed_breaks)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html">operations_research::RoutingCPSatWrapper</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00363">routing_lp_scheduling.h:363</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a00bd8299ff5696ff8a0ef53928901955"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a00bd8299ff5696ff8a0ef53928901955">operations_research::RoutingCPSatWrapper::SetCoefficient</a></div><div class="ttdeci">void SetCoefficient(int ct_index, int index, double coefficient) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00462">routing_lp_scheduling.h:462</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a0d53b135116dda43796783fc1c812f83"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a0d53b135116dda43796783fc1c812f83">operations_research::RoutingCPSatWrapper::NumVariables</a></div><div class="ttdeci">int NumVariables() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00450">routing_lp_scheduling.h:450</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a16adf99185c4a2351c3eb6c9ab44544d"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a16adf99185c4a2351c3eb6c9ab44544d">operations_research::RoutingCPSatWrapper::IsCPSATSolver</a></div><div class="ttdeci">bool IsCPSATSolver() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00473">routing_lp_scheduling.h:473</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a28fd517263e8003e3e545d646b96d75f"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a28fd517263e8003e3e545d646b96d75f">operations_research::RoutingCPSatWrapper::RoutingCPSatWrapper</a></div><div class="ttdeci">RoutingCPSatWrapper()</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00365">routing_lp_scheduling.h:365</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a314fad7efb918f0fe41673b65a44253c"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a314fad7efb918f0fe41673b65a44253c">operations_research::RoutingCPSatWrapper::CreateNewPositiveVariable</a></div><div class="ttdeci">int CreateNewPositiveVariable() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00385">routing_lp_scheduling.h:385</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a377c018786f6eaa2272bf3d014a3226d"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a377c018786f6eaa2272bf3d014a3226d">operations_research::RoutingCPSatWrapper::SetVariableBounds</a></div><div class="ttdeci">bool SetVariableBounds(int index, int64_t lower_bound, int64_t upper_bound) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00395">routing_lp_scheduling.h:395</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a51b3d2be66ee6c5461945af52e85a8e0"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a51b3d2be66ee6c5461945af52e85a8e0">operations_research::RoutingCPSatWrapper::GetValue</a></div><div class="ttdeci">double GetValue(int index) const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00533">routing_lp_scheduling.h:533</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a624e1c907319c025fd9187bdc441f12b"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a624e1c907319c025fd9187bdc441f12b">operations_research::RoutingCPSatWrapper::GetObjectiveValue</a></div><div class="ttdeci">int64_t GetObjectiveValue() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00529">routing_lp_scheduling.h:529</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a671fad375e30cdfe6c95447a43aed2aa"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a671fad375e30cdfe6c95447a43aed2aa">operations_research::RoutingCPSatWrapper::Solve</a></div><div class="ttdeci">DimensionSchedulingStatus Solve(absl::Duration duration_limit) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00497">routing_lp_scheduling.h:497</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a68ad095b727149311d03f62a86c34080"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a68ad095b727149311d03f62a86c34080">operations_research::RoutingCPSatWrapper::~RoutingCPSatWrapper</a></div><div class="ttdeci">~RoutingCPSatWrapper() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00375">routing_lp_scheduling.h:375</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a6f7b90643fd4e207a1167fc9ee517c02"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a6f7b90643fd4e207a1167fc9ee517c02">operations_research::RoutingCPSatWrapper::AddMaximumConstraint</a></div><div class="ttdeci">void AddMaximumConstraint(int max_var, std::vector< int > vars) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00474">routing_lp_scheduling.h:474</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a73f41f82e421be82b07fe60a42438c3b"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a73f41f82e421be82b07fe60a42438c3b">operations_research::RoutingCPSatWrapper::AddProductConstraint</a></div><div class="ttdeci">void AddProductConstraint(int product_var, std::vector< int > vars) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00485">routing_lp_scheduling.h:485</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a819cbc555690ea6f6f2eadf989455c82"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a819cbc555690ea6f6f2eadf989455c82">operations_research::RoutingCPSatWrapper::SetEnforcementLiteral</a></div><div class="ttdeci">void SetEnforcementLiteral(int ct, int condition) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00493">routing_lp_scheduling.h:493</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a8b4d155c1cccad5c76188e25b49aad47"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a8b4d155c1cccad5c76188e25b49aad47">operations_research::RoutingCPSatWrapper::GetObjectiveCoefficient</a></div><div class="ttdeci">double GetObjectiveCoefficient(int index) const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00441">routing_lp_scheduling.h:441</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_a9bed98c336ea6bfd483e6c59ff901e0a"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#a9bed98c336ea6bfd483e6c59ff901e0a">operations_research::RoutingCPSatWrapper::SetVariableDisjointBounds</a></div><div class="ttdeci">void SetVariableDisjointBounds(int index, const std::vector< int64_t > &starts, const std::vector< int64_t > &ends) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00413">routing_lp_scheduling.h:413</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_aa8f92595bdcd4aefc72ce6c0015d41cb"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aa8f92595bdcd4aefc72ce6c0015d41cb">operations_research::RoutingCPSatWrapper::SolutionIsInteger</a></div><div class="ttdeci">bool SolutionIsInteger() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00536">routing_lp_scheduling.h:536</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_aad45008823f0ecdab2258f5603233a28"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#aad45008823f0ecdab2258f5603233a28">operations_research::RoutingCPSatWrapper::CreateNewConstraint</a></div><div class="ttdeci">int CreateNewConstraint(int64_t lower_bound, int64_t upper_bound) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00451">routing_lp_scheduling.h:451</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_ac2fdf117e3886bbce4baa56a77d3e9cc"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#ac2fdf117e3886bbce4baa56a77d3e9cc">operations_research::RoutingCPSatWrapper::Clear</a></div><div class="ttdeci">void Clear() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00376">routing_lp_scheduling.h:376</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_af5469274c2e2ba025997a4677d13be80"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#af5469274c2e2ba025997a4677d13be80">operations_research::RoutingCPSatWrapper::SetObjectiveCoefficient</a></div><div class="ttdeci">void SetObjectiveCoefficient(int index, double coefficient) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00429">routing_lp_scheduling.h:429</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_af771c825609aad65a2ab27d69c94f42c"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#af771c825609aad65a2ab27d69c94f42c">operations_research::RoutingCPSatWrapper::GetVariableLowerBound</a></div><div class="ttdeci">int64_t GetVariableLowerBound(int index) const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00426">routing_lp_scheduling.h:426</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_c_p_sat_wrapper_html_af9cf3c86b3e07b1f6761f3d12f04b068"><div class="ttname"><a href="classoperations__research_1_1_routing_c_p_sat_wrapper.html#af9cf3c86b3e07b1f6761f3d12f04b068">operations_research::RoutingCPSatWrapper::ClearObjective</a></div><div class="ttdeci">void ClearObjective() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00446">routing_lp_scheduling.h:446</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html">operations_research::RoutingDimension</a></div><div class="ttdoc">Dimensions represent quantities accumulated at nodes along the routes.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02374">routing.h:2374</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html">operations_research::RoutingGlopWrapper</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00237">routing_lp_scheduling.h:237</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a0d53b135116dda43796783fc1c812f83"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a0d53b135116dda43796783fc1c812f83">operations_research::RoutingGlopWrapper::NumVariables</a></div><div class="ttdeci">int NumVariables() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00292">routing_lp_scheduling.h:292</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a16adf99185c4a2351c3eb6c9ab44544d"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a16adf99185c4a2351c3eb6c9ab44544d">operations_research::RoutingGlopWrapper::IsCPSATSolver</a></div><div class="ttdeci">bool IsCPSATSolver() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00309">routing_lp_scheduling.h:309</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a314fad7efb918f0fe41673b65a44253c"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a314fad7efb918f0fe41673b65a44253c">operations_research::RoutingGlopWrapper::CreateNewPositiveVariable</a></div><div class="ttdeci">int CreateNewPositiveVariable() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00248">routing_lp_scheduling.h:248</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a377c018786f6eaa2272bf3d014a3226d"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a377c018786f6eaa2272bf3d014a3226d">operations_research::RoutingGlopWrapper::SetVariableBounds</a></div><div class="ttdeci">bool SetVariableBounds(int index, int64_t lower_bound, int64_t upper_bound) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00251">routing_lp_scheduling.h:251</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a51b3d2be66ee6c5461945af52e85a8e0"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a51b3d2be66ee6c5461945af52e85a8e0">operations_research::RoutingGlopWrapper::GetValue</a></div><div class="ttdeci">double GetValue(int index) const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00348">routing_lp_scheduling.h:348</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a624e1c907319c025fd9187bdc441f12b"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a624e1c907319c025fd9187bdc441f12b">operations_research::RoutingGlopWrapper::GetObjectiveValue</a></div><div class="ttdeci">int64_t GetObjectiveValue() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00345">routing_lp_scheduling.h:345</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a671fad375e30cdfe6c95447a43aed2aa"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a671fad375e30cdfe6c95447a43aed2aa">operations_research::RoutingGlopWrapper::Solve</a></div><div class="ttdeci">DimensionSchedulingStatus Solve(absl::Duration duration_limit) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00313">routing_lp_scheduling.h:313</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a691ac6745157fb62e18c3d8cf1c4538b"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a691ac6745157fb62e18c3d8cf1c4538b">operations_research::RoutingGlopWrapper::SetCoefficient</a></div><div class="ttdeci">void SetCoefficient(int ct, int index, double coefficient) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00305">routing_lp_scheduling.h:305</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a6f7b90643fd4e207a1167fc9ee517c02"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a6f7b90643fd4e207a1167fc9ee517c02">operations_research::RoutingGlopWrapper::AddMaximumConstraint</a></div><div class="ttdeci">void AddMaximumConstraint(int max_var, std::vector< int > vars) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00310">routing_lp_scheduling.h:310</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a73f41f82e421be82b07fe60a42438c3b"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a73f41f82e421be82b07fe60a42438c3b">operations_research::RoutingGlopWrapper::AddProductConstraint</a></div><div class="ttdeci">void AddProductConstraint(int product_var, std::vector< int > vars) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00311">routing_lp_scheduling.h:311</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a819cbc555690ea6f6f2eadf989455c82"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a819cbc555690ea6f6f2eadf989455c82">operations_research::RoutingGlopWrapper::SetEnforcementLiteral</a></div><div class="ttdeci">void SetEnforcementLiteral(int ct, int condition) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00312">routing_lp_scheduling.h:312</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a8b4d155c1cccad5c76188e25b49aad47"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a8b4d155c1cccad5c76188e25b49aad47">operations_research::RoutingGlopWrapper::GetObjectiveCoefficient</a></div><div class="ttdeci">double GetObjectiveCoefficient(int index) const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00284">routing_lp_scheduling.h:284</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a8f7b46f13332393a627d45a46cfff2a1"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a8f7b46f13332393a627d45a46cfff2a1">operations_research::RoutingGlopWrapper::RoutingGlopWrapper</a></div><div class="ttdeci">RoutingGlopWrapper(const glop::GlopParameters &parameters)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00239">routing_lp_scheduling.h:239</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_a9bed98c336ea6bfd483e6c59ff901e0a"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#a9bed98c336ea6bfd483e6c59ff901e0a">operations_research::RoutingGlopWrapper::SetVariableDisjointBounds</a></div><div class="ttdeci">void SetVariableDisjointBounds(int index, const std::vector< int64_t > &starts, const std::vector< int64_t > &ends) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00269">routing_lp_scheduling.h:269</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_aa8f92595bdcd4aefc72ce6c0015d41cb"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#aa8f92595bdcd4aefc72ce6c0015d41cb">operations_research::RoutingGlopWrapper::SolutionIsInteger</a></div><div class="ttdeci">bool SolutionIsInteger() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00351">routing_lp_scheduling.h:351</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_aad45008823f0ecdab2258f5603233a28"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#aad45008823f0ecdab2258f5603233a28">operations_research::RoutingGlopWrapper::CreateNewConstraint</a></div><div class="ttdeci">int CreateNewConstraint(int64_t lower_bound, int64_t upper_bound) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00295">routing_lp_scheduling.h:295</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_ac2fdf117e3886bbce4baa56a77d3e9cc"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#ac2fdf117e3886bbce4baa56a77d3e9cc">operations_research::RoutingGlopWrapper::Clear</a></div><div class="ttdeci">void Clear() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00243">routing_lp_scheduling.h:243</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_af5469274c2e2ba025997a4677d13be80"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#af5469274c2e2ba025997a4677d13be80">operations_research::RoutingGlopWrapper::SetObjectiveCoefficient</a></div><div class="ttdeci">void SetObjectiveCoefficient(int index, double coefficient) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00281">routing_lp_scheduling.h:281</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_af771c825609aad65a2ab27d69c94f42c"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#af771c825609aad65a2ab27d69c94f42c">operations_research::RoutingGlopWrapper::GetVariableLowerBound</a></div><div class="ttdeci">int64_t GetVariableLowerBound(int index) const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00278">routing_lp_scheduling.h:278</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_glop_wrapper_html_af9cf3c86b3e07b1f6761f3d12f04b068"><div class="ttname"><a href="classoperations__research_1_1_routing_glop_wrapper.html#af9cf3c86b3e07b1f6761f3d12f04b068">operations_research::RoutingGlopWrapper::ClearObjective</a></div><div class="ttdeci">void ClearObjective() override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00287">routing_lp_scheduling.h:287</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html">operations_research::RoutingLinearSolverWrapper</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00159">routing_lp_scheduling.h:159</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a01ce5bca7f91b37ff459b4d7b63e5190"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a01ce5bca7f91b37ff459b4d7b63e5190">operations_research::RoutingLinearSolverWrapper::SetCoefficient</a></div><div class="ttdeci">virtual void SetCoefficient(int ct, int index, double coefficient)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a155f6032f05d373d7375078c1be4a01b"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a155f6032f05d373d7375078c1be4a01b">operations_research::RoutingLinearSolverWrapper::NumVariables</a></div><div class="ttdeci">virtual int NumVariables() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a4812d528a6d93d471be496e9ca79c820"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a4812d528a6d93d471be496e9ca79c820">operations_research::RoutingLinearSolverWrapper::GetObjectiveCoefficient</a></div><div class="ttdeci">virtual double GetObjectiveCoefficient(int index) const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a589402033ed732725c2053255cb3ffde"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a589402033ed732725c2053255cb3ffde">operations_research::RoutingLinearSolverWrapper::AddProductConstraint</a></div><div class="ttdeci">virtual void AddProductConstraint(int product_var, std::vector< int > vars)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a6bcbec446b5474e98e50ef78544c82b0"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a6bcbec446b5474e98e50ef78544c82b0">operations_research::RoutingLinearSolverWrapper::CreateNewPositiveVariable</a></div><div class="ttdeci">virtual int CreateNewPositiveVariable()=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a74d368c047df617ec5c7025f7be2e85c"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a74d368c047df617ec5c7025f7be2e85c">operations_research::RoutingLinearSolverWrapper::AddLinearConstraint</a></div><div class="ttdeci">int AddLinearConstraint(int64_t lower_bound, int64_t upper_bound, const std::vector< std::pair< int, double >> &variable_coeffs)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00195">routing_lp_scheduling.h:195</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a822c1b23168a59678bc36920d882d813"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a822c1b23168a59678bc36920d882d813">operations_research::RoutingLinearSolverWrapper::AddVariable</a></div><div class="ttdeci">int AddVariable(int64_t lower_bound, int64_t upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00186">routing_lp_scheduling.h:186</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_aa2e5858c4b94c8f69486993bfe4ffea9"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa2e5858c4b94c8f69486993bfe4ffea9">operations_research::RoutingLinearSolverWrapper::IsCPSATSolver</a></div><div class="ttdeci">virtual bool IsCPSATSolver()=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_aa5b31c976cc6734003d9950e731dfed3"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa5b31c976cc6734003d9950e731dfed3">operations_research::RoutingLinearSolverWrapper::Clear</a></div><div class="ttdeci">virtual void Clear()=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_aa7ad30a5bcbd156380533cc7abb69172"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa7ad30a5bcbd156380533cc7abb69172">operations_research::RoutingLinearSolverWrapper::GetObjectiveValue</a></div><div class="ttdeci">virtual int64_t GetObjectiveValue() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_aad7aced2cbb0d0caae11432ff899fad4"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aad7aced2cbb0d0caae11432ff899fad4">operations_research::RoutingLinearSolverWrapper::AddReifiedLinearConstraint</a></div><div class="ttdeci">int AddReifiedLinearConstraint(int64_t lower_bound, int64_t upper_bound, const std::vector< std::pair< int, double >> &weighted_variables)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00208">routing_lp_scheduling.h:208</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_ab8bd6c2ebc0fe292221efda5c39de361"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ab8bd6c2ebc0fe292221efda5c39de361">operations_research::RoutingLinearSolverWrapper::ClearObjective</a></div><div class="ttdeci">virtual void ClearObjective()=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_abd20c644980c8ff8d122dad397f04f8e"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#abd20c644980c8ff8d122dad397f04f8e">operations_research::RoutingLinearSolverWrapper::CreateNewConstraint</a></div><div class="ttdeci">virtual int CreateNewConstraint(int64_t lower_bound, int64_t upper_bound)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_ac154a773600edab5f5fbc597c5639cce"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ac154a773600edab5f5fbc597c5639cce">operations_research::RoutingLinearSolverWrapper::GetValue</a></div><div class="ttdeci">virtual double GetValue(int index) const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_acb5447abf2fd0ef52e46ce561ffef5cb"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#acb5447abf2fd0ef52e46ce561ffef5cb">operations_research::RoutingLinearSolverWrapper::Solve</a></div><div class="ttdeci">virtual DimensionSchedulingStatus Solve(absl::Duration duration_limit)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_ace2a6846080948210abab0845d93e819"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ace2a6846080948210abab0845d93e819">operations_research::RoutingLinearSolverWrapper::SetVariableDisjointBounds</a></div><div class="ttdeci">virtual void SetVariableDisjointBounds(int index, const std::vector< int64_t > &starts, const std::vector< int64_t > &ends)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_ad1a3a80256c0caa8f7ebdacb42294c81"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad1a3a80256c0caa8f7ebdacb42294c81">operations_research::RoutingLinearSolverWrapper::SetVariableBounds</a></div><div class="ttdeci">virtual bool SetVariableBounds(int index, int64_t lower_bound, int64_t upper_bound)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_ad56b5d5264e07b44be873dfdcd29cb8e"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad56b5d5264e07b44be873dfdcd29cb8e">operations_research::RoutingLinearSolverWrapper::SetObjectiveCoefficient</a></div><div class="ttdeci">virtual void SetObjectiveCoefficient(int index, double coefficient)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_ada616cd8a8068937fd4a72ae741e05d9"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ada616cd8a8068937fd4a72ae741e05d9">operations_research::RoutingLinearSolverWrapper::SetEnforcementLiteral</a></div><div class="ttdeci">virtual void SetEnforcementLiteral(int ct, int condition)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_af1eb90688746692ec522c88d501bd598"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af1eb90688746692ec522c88d501bd598">operations_research::RoutingLinearSolverWrapper::SolutionIsInteger</a></div><div class="ttdeci">virtual bool SolutionIsInteger() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_af3a7be118910d54c87da7d9ecf7949ac"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af3a7be118910d54c87da7d9ecf7949ac">operations_research::RoutingLinearSolverWrapper::~RoutingLinearSolverWrapper</a></div><div class="ttdeci">virtual ~RoutingLinearSolverWrapper()</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00161">routing_lp_scheduling.h:161</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_afaf5c7b0c88dbe8a11b8d9d66a7c2871"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#afaf5c7b0c88dbe8a11b8d9d66a7c2871">operations_research::RoutingLinearSolverWrapper::GetVariableLowerBound</a></div><div class="ttdeci">virtual int64_t GetVariableLowerBound(int index) const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_afbe78c86a32370311f3ab5d5ac3770ca"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#afbe78c86a32370311f3ab5d5ac3770ca">operations_research::RoutingLinearSolverWrapper::AddMaximumConstraint</a></div><div class="ttdeci">virtual void AddMaximumConstraint(int max_var, std::vector< int > vars)=0</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="constraint__solver_8h_source.html#l00108">constraint_solver.h:108</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aa0787bf78fb09d1e30f2451b5a68d4b8"><div class="ttname"><a href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">operations_research::DimensionSchedulingStatus</a></div><div class="ttdeci">DimensionSchedulingStatus</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00149">routing_lp_scheduling.h:149</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93"><div class="ttname"><a href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">operations_research::DimensionSchedulingStatus::INFEASIBLE</a></div><div class="ttdeci">@ INFEASIBLE</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293"><div class="ttname"><a href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293">operations_research::DimensionSchedulingStatus::OPTIMAL</a></div><div class="ttdeci">@ OPTIMAL</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aa0787bf78fb09d1e30f2451b5a68d4b8af8cfb2115ef7ab822bca8edd1edac285"><div class="ttname"><a href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af8cfb2115ef7ab822bca8edd1edac285">operations_research::DimensionSchedulingStatus::RELAXED_OPTIMAL_ONLY</a></div><div class="ttdeci">@ RELAXED_OPTIMAL_ONLY</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__parameters_8pb_8h_html"><div class="ttname"><a href="routing__parameters_8pb_8h.html">routing_parameters.pb.h</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
</div>
|
|
</div>
|
|
<div id="footer-container">
|
|
<div id="footer">
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|