754 lines
151 KiB
HTML
754 lines
151 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"/>-->
|
|
<link rel="stylesheet" type="text/css" href="ortools.css" title="default" media="screen,print" />
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
</head>
|
|
<body>
|
|
<div id="banner-container">
|
|
<div id="banner">
|
|
<span id="sfml">Google OR-Tools 7.5</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.8.16 -->
|
|
<div id="navrow1" class="tabs">
|
|
<ul class="tablist">
|
|
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
|
|
<li><a href="annotated.html"><span>Classes</span></a></li>
|
|
<li class="current"><a href="files.html"><span>Files</span></a></li>
|
|
</ul>
|
|
</div>
|
|
<div id="nav-path" class="navpath">
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_afbb39f66221aac28bbdefd1dca2b2b0.html">constraint_solver</a></li> </ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<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-2018 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="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 "absl/container/flat_hash_map.h"</span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include "absl/memory/memory.h"</span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</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="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "ortools/glop/lp_solver.h"</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "ortools/lp_data/lp_types.h"</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "ortools/sat/cp_model.h"</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "ortools/util/saturated_arithmetic.h"</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  </div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  </div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">// Classes to solve dimension cumul placement (aka scheduling) problems using</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// linear programming.</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  </div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</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="l00031"></a><span class="lineno"> 31</span> <span class="comment">// as possible based on the model precedences.</span></div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="classoperations__research_1_1CumulBoundsPropagator.html"> 32</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1CumulBoundsPropagator.html">CumulBoundsPropagator</a> {</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1CumulBoundsPropagator.html#aff8f29b2fce9f6447474ee6077af1b72">CumulBoundsPropagator</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1RoutingDimension.html">RoutingDimension</a>* <a class="code" href="classoperations__research_1_1CumulBoundsPropagator.html#a72be8a813404822957fbd808d0405226">dimension</a>);</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  </div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="comment">// Tightens the cumul bounds starting from the current cumul var min/max,</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="comment">// and propagating the precedences resulting from the next_accessor, and the</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="comment">// dimension's precedence rules.</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="comment">// Returns false iff the precedences are infeasible with the given routes.</span></div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="comment">// Otherwise, the user can call CumulMin() and CumulMax() to retrieve the new</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="comment">// bounds of an index.</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1CumulBoundsPropagator.html#a54688e4af975568b0bce87cdf9f26781">PropagateCumulBounds</a>(<span class="keyword">const</span> std::function<int64(int64)>& next_accessor,</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  int64 cumul_offset);</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  </div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"><a class="line" href="classoperations__research_1_1CumulBoundsPropagator.html#a921806c74f3dd622afc937929b69d627"> 45</a></span>  int64 <a class="code" href="classoperations__research_1_1CumulBoundsPropagator.html#a921806c74f3dd622afc937929b69d627">CumulMin</a>(<span class="keywordtype">int</span> index)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keywordflow">return</span> propagated_bounds_[PositiveNode(index)];</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>  </div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"><a class="line" href="classoperations__research_1_1CumulBoundsPropagator.html#a3b5250c6480d24af0c95d1f68a7556b7"> 49</a></span>  int64 <a class="code" href="classoperations__research_1_1CumulBoundsPropagator.html#a3b5250c6480d24af0c95d1f68a7556b7">CumulMax</a>(<span class="keywordtype">int</span> index)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keyword">const</span> int64 negated_upper_bound = propagated_bounds_[NegativeNode(index)];</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">return</span> negated_upper_bound == kint64min ? kint64max : -negated_upper_bound;</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  }</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  </div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"><a class="line" href="classoperations__research_1_1CumulBoundsPropagator.html#a72be8a813404822957fbd808d0405226"> 54</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1RoutingDimension.html">RoutingDimension</a>& <a class="code" href="classoperations__research_1_1CumulBoundsPropagator.html#a72be8a813404822957fbd808d0405226">dimension</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> dimension_; }</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  </div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="comment">// An arc "tail --offset--> head" represents the relation</span></div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="comment">// tail + offset <= head.</span></div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</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="l00060"></a><span class="lineno"> 60</span>  <span class="keyword">struct </span>ArcInfo {</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keywordtype">int</span> head;</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  int64 offset;</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  };</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> kNoParent;</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> kParentToBePropagated;</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  </div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</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="l00068"></a><span class="lineno"> 68</span>  <span class="comment">// -index respectively.</span></div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</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="l00070"></a><span class="lineno"> 70</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="l00071"></a><span class="lineno"> 71</span>  </div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordtype">void</span> AddNodeToQueue(<span class="keywordtype">int</span> node) {</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">if</span> (!node_in_queue_[node]) {</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  bf_queue_.push_back(node);</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  node_in_queue_[node] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  }</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  }</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  </div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="comment">// Adds the relation first_index + offset <= second_index, by adding arcs</span></div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="comment">// first_index --offset--> second_index and</span></div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="comment">// -second_index --offset--> -first_index.</span></div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordtype">void</span> AddArcs(<span class="keywordtype">int</span> first_index, <span class="keywordtype">int</span> second_index, int64 offset);</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  </div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordtype">bool</span> InitializeArcsAndBounds(<span class="keyword">const</span> std::function<int64(int64)>& next_accessor,</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  int64 cumul_offset);</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  </div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordtype">bool</span> UpdateCurrentLowerBoundOfNode(<span class="keywordtype">int</span> node, int64 new_lb, int64 offset);</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  </div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</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="l00090"></a><span class="lineno"> 90</span>  </div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordtype">bool</span> CleanupAndReturnFalse() {</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">// We clean-up node_in_queue_ for future calls, and return false.</span></div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node_to_cleanup : bf_queue_) {</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  node_in_queue_[node_to_cleanup] = <span class="keyword">false</span>;</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>  bf_queue_.clear();</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  }</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  </div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keyword">const</span> RoutingDimension& dimension_;</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">const</span> int64 num_nodes_;</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">// TODO(user): Investigate if all arcs for a given tail can be created</span></div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</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="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// for each tail index.</span></div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  std::vector<std::vector<ArcInfo>> outgoing_arcs_;</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>  std::deque<int> bf_queue_;</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  std::vector<bool> node_in_queue_;</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  std::vector<int> tree_parent_node_of_;</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="comment">// After calling PropagateCumulBounds(), for each node index n,</span></div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="comment">// propagated_bounds_[2*n] and -propagated_bounds_[2*n+1] respectively contain</span></div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="comment">// the propagated lower and upper bounds of n's cumul variable.</span></div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  std::vector<int64> propagated_bounds_;</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="comment">// Vector used in DisassembleSubtree() to avoid memory reallocation.</span></div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  std::vector<int> tmp_dfs_stack_;</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  </div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="comment">// Used to store the pickup/delivery pairs encountered on the routes.</span></div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  std::vector<std::pair<int64, int64>></div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  visited_pickup_delivery_indices_for_pair_;</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</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"><a class="line" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8"> 124</a></span> <span class="keyword">enum class</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> {</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="comment">// An optimal solution was found respecting all constraints.</span></div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293">OPTIMAL</a>,</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="comment">// An optimal solution was found, however constraints which were relaxed were</span></div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="comment">// violated.</span></div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af8cfb2115ef7ab822bca8edd1edac285">RELAXED_OPTIMAL_ONLY</a>,</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="comment">// A solution could not be found.</span></div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">INFEASIBLE</a></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>  </div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingLinearSolverWrapper.html"> 134</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.html">RoutingLinearSolverWrapper</a> {</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingLinearSolverWrapper.html#af3a7be118910d54c87da7d9ecf7949ac"> 136</a></span>  <span class="keyword">virtual</span> <a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.html#af3a7be118910d54c87da7d9ecf7949ac">~RoutingLinearSolverWrapper</a>() {}</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.html#aa5b31c976cc6734003d9950e731dfed3">Clear</a>() = 0;</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keyword">virtual</span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.html#a6bcbec446b5474e98e50ef78544c82b0">CreateNewPositiveVariable</a>() = 0;</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.html#a9e2ef65ea95577f9df6ba20c43813573">SetVariableBounds</a>(<span class="keywordtype">int</span> index, int64 lower_bound,</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  int64 upper_bound) = 0;</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.html#a2ba069bdfbc07dd513d5d140b19fe70d">SetVariableDisjointBounds</a>(<span class="keywordtype">int</span> index,</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keyword">const</span> std::vector<int64>& starts,</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keyword">const</span> std::vector<int64>& ends) = 0;</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keyword">virtual</span> int64 <a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.html#a7bdd4be7fd06d5c445403fdf3de0eeda">GetVariableLowerBound</a>(<span class="keywordtype">int</span> index) <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.html#ad56b5d5264e07b44be873dfdcd29cb8e">SetObjectiveCoefficient</a>(<span class="keywordtype">int</span> index, <span class="keywordtype">double</span> coefficient) = 0;</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keyword">virtual</span> <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.html#a4812d528a6d93d471be496e9ca79c820">GetObjectiveCoefficient</a>(<span class="keywordtype">int</span> index) <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.html#ab8bd6c2ebc0fe292221efda5c39de361">ClearObjective</a>() = 0;</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keyword">virtual</span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.html#a155f6032f05d373d7375078c1be4a01b">NumVariables</a>() <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keyword">virtual</span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.html#a1923407036f149ea2c31ac37c11e1337">CreateNewConstraint</a>(int64 lower_bound, int64 upper_bound) = 0;</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.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="l00151"></a><span class="lineno"> 151</span>  <span class="keyword">virtual</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.html#acb5447abf2fd0ef52e46ce561ffef5cb">Solve</a>(absl::Duration duration_limit) = 0;</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keyword">virtual</span> <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.html#aa7443a97965215ca0cc8b502f93a774d">GetObjectiveValue</a>() <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keyword">virtual</span> <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.html#ac154a773600edab5f5fbc597c5639cce">GetValue</a>(<span class="keywordtype">int</span> index) <span class="keyword">const</span> = 0;</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span> };</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  </div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingGlopWrapper.html"> 156</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1RoutingGlopWrapper.html">RoutingGlopWrapper</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.html">RoutingLinearSolverWrapper</a> {</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingGlopWrapper.html#a8f7b46f13332393a627d45a46cfff2a1"> 158</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1RoutingGlopWrapper.html#a8f7b46f13332393a627d45a46cfff2a1">RoutingGlopWrapper</a>(<span class="keyword">const</span> glop::GlopParameters& parameters) {</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  lp_solver_.SetParameters(parameters);</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  linear_program_.SetMaximizationProblem(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  }</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingGlopWrapper.html#ac2fdf117e3886bbce4baa56a77d3e9cc"> 162</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1RoutingGlopWrapper.html#ac2fdf117e3886bbce4baa56a77d3e9cc">Clear</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  linear_program_.Clear();</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  linear_program_.SetMaximizationProblem(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  allowed_intervals_.clear();</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  }</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingGlopWrapper.html#a314fad7efb918f0fe41673b65a44253c"> 167</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1RoutingGlopWrapper.html#a314fad7efb918f0fe41673b65a44253c">CreateNewPositiveVariable</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordflow">return</span> linear_program_.CreateNewVariable().value();</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  }</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingGlopWrapper.html#a7c45556ef2ecb1a436d8e6f453af2420"> 170</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1RoutingGlopWrapper.html#a7c45556ef2ecb1a436d8e6f453af2420">SetVariableBounds</a>(<span class="keywordtype">int</span> index, int64 lower_bound,</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  int64 upper_bound)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  DCHECK_GE(lower_bound, 0);</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="comment">// When variable upper bounds are greater than this threshold, precision</span></div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</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="l00175"></a><span class="lineno"> 175</span>  <span class="comment">// these high bound values are infinite and not set the upper bound.</span></div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keyword">const</span> int64 kMaxValue = 1e10;</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lp_min = lower_bound;</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lp_max =</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  (upper_bound > kMaxValue) ? glop::kInfinity : upper_bound;</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">if</span> (lp_min <= lp_max) {</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  linear_program_.SetVariableBounds(glop::ColIndex(index), lp_min, lp_max);</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  }</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="comment">// The linear_program would not be feasible, and it cannot handle the</span></div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="comment">// lp_min > lp_max case, so we must detect infeasibility here.</span></div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  }</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingGlopWrapper.html#a1fac1e151a2a309b171a0fee80e9ea8a"> 188</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1RoutingGlopWrapper.html#a1fac1e151a2a309b171a0fee80e9ea8a">SetVariableDisjointBounds</a>(<span class="keywordtype">int</span> index, <span class="keyword">const</span> std::vector<int64>& starts,</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keyword">const</span> std::vector<int64>& ends)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">// TODO(user): Investigate if we can avoid rebuilding the interval list</span></div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="comment">// each time (we could keep a reference to the forbidden interval list in</span></div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="comment">// RoutingDimension but we would need to store cumul offsets and use them</span></div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="comment">// when checking intervals).</span></div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  allowed_intervals_[index] =</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  absl::make_unique<SortedDisjointIntervalList>(starts, ends);</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  }</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingGlopWrapper.html#aaca77a68804fde0a877dc805eb34ba51"> 197</a></span>  int64 <a class="code" href="classoperations__research_1_1RoutingGlopWrapper.html#aaca77a68804fde0a877dc805eb34ba51">GetVariableLowerBound</a>(<span class="keywordtype">int</span> index)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">return</span> linear_program_.variable_lower_bounds()[glop::ColIndex(index)];</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  }</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingGlopWrapper.html#af5469274c2e2ba025997a4677d13be80"> 200</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1RoutingGlopWrapper.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="l00201"></a><span class="lineno"> 201</span>  linear_program_.SetObjectiveCoefficient(glop::ColIndex(index), coefficient);</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  }</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingGlopWrapper.html#a8b4d155c1cccad5c76188e25b49aad47"> 203</a></span>  <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1RoutingGlopWrapper.html#a8b4d155c1cccad5c76188e25b49aad47">GetObjectiveCoefficient</a>(<span class="keywordtype">int</span> index)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordflow">return</span> linear_program_.objective_coefficients()[glop::ColIndex(index)];</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  }</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingGlopWrapper.html#af9cf3c86b3e07b1f6761f3d12f04b068"> 206</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1RoutingGlopWrapper.html#af9cf3c86b3e07b1f6761f3d12f04b068">ClearObjective</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keywordflow">for</span> (glop::ColIndex i(0); i < linear_program_.num_variables(); ++i) {</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  linear_program_.SetObjectiveCoefficient(i, 0);</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  }</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  }</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingGlopWrapper.html#a0d53b135116dda43796783fc1c812f83"> 211</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1RoutingGlopWrapper.html#a0d53b135116dda43796783fc1c812f83">NumVariables</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">return</span> linear_program_.num_variables().value();</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  }</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingGlopWrapper.html#aabef85ece915faf927eeb6899690a45a"> 214</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1RoutingGlopWrapper.html#aabef85ece915faf927eeb6899690a45a">CreateNewConstraint</a>(int64 lower_bound, int64 upper_bound)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keyword">const</span> glop::RowIndex ct = linear_program_.CreateNewConstraint();</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  linear_program_.SetConstraintBounds(</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  ct, (lower_bound == kint64min) ? -glop::kInfinity : lower_bound,</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  (upper_bound == kint64max) ? glop::kInfinity : upper_bound);</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">return</span> ct.value();</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  }</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingGlopWrapper.html#a691ac6745157fb62e18c3d8cf1c4538b"> 221</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1RoutingGlopWrapper.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="l00222"></a><span class="lineno"> 222</span>  linear_program_.SetCoefficient(glop::RowIndex(ct), glop::ColIndex(index),</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  coefficient);</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  }</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingGlopWrapper.html#a671fad375e30cdfe6c95447a43aed2aa"> 225</a></span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1RoutingGlopWrapper.html#a671fad375e30cdfe6c95447a43aed2aa">Solve</a>(absl::Duration duration_limit)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  lp_solver_.GetMutableParameters()->set_max_time_in_seconds(</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  absl::ToDoubleSeconds(duration_limit));</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  </div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</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="l00230"></a><span class="lineno"> 230</span>  <span class="comment">// SetCoefficient() on the same variable twice for a constraint, we know</span></div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="comment">// that the columns do not contain duplicates and are already ordered by</span></div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="comment">// constraint so we do not need to call linear_program->CleanUp() which can</span></div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="comment">// be costly. Note that the assumptions are DCHECKed() in the call below.</span></div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  linear_program_.NotifyThatColumnsAreClean();</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  VLOG(2) << linear_program_.Dump();</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keyword">const</span> glop::ProblemStatus status = lp_solver_.Solve(linear_program_);</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">if</span> (status != glop::ProblemStatus::OPTIMAL &&</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  status != glop::ProblemStatus::IMPRECISE) {</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  linear_program_.Clear();</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>;</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  }</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& allowed_interval : allowed_intervals_) {</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> value_double = <a class="code" href="classoperations__research_1_1RoutingGlopWrapper.html#a51b3d2be66ee6c5461945af52e85a8e0">GetValue</a>(allowed_interval.first);</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keyword">const</span> int64 value = (value_double >= kint64max)</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  ? kint64max</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  : static_cast<int64>(std::round(value_double));</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keyword">const</span> SortedDisjointIntervalList* <span class="keyword">const</span> interval_list =</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  allowed_interval.second.get();</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keyword">const</span> <span class="keyword">auto</span> it = interval_list->FirstIntervalGreaterOrEqual(value);</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">if</span> (it == interval_list->end() || value < it->start) {</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</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="l00252"></a><span class="lineno"> 252</span>  }</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  }</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293">DimensionSchedulingStatus::OPTIMAL</a>;</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  }</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingGlopWrapper.html#a5670767b54ca9cb51886a8961c69c778"> 256</a></span>  <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1RoutingGlopWrapper.html#a5670767b54ca9cb51886a8961c69c778">GetObjectiveValue</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">return</span> lp_solver_.GetObjectiveValue();</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  }</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingGlopWrapper.html#a51b3d2be66ee6c5461945af52e85a8e0"> 259</a></span>  <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1RoutingGlopWrapper.html#a51b3d2be66ee6c5461945af52e85a8e0">GetValue</a>(<span class="keywordtype">int</span> index)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordflow">return</span> lp_solver_.variable_values()[glop::ColIndex(index)];</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  }</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  </div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  glop::LinearProgram linear_program_;</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  glop::LPSolver lp_solver_;</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  absl::flat_hash_map<int, std::unique_ptr<SortedDisjointIntervalList>></div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  allowed_intervals_;</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span> };</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  </div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingCPSatWrapper.html"> 270</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.html">RoutingCPSatWrapper</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.html">RoutingLinearSolverWrapper</a> {</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingCPSatWrapper.html#a28fd517263e8003e3e545d646b96d75f"> 272</a></span>  <a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.html#a28fd517263e8003e3e545d646b96d75f">RoutingCPSatWrapper</a>() : objective_offset_(0), first_constraint_to_offset_(0) {</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  parameters_.set_num_search_workers(1);</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="comment">// Keeping presolve but with 0 iterations; as of 11/2019 it is</span></div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="comment">// significantly faster than both full presolve and no presolve.</span></div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  parameters_.set_cp_model_presolve(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  parameters_.set_max_presolve_iterations(0);</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  parameters_.set_catch_sigint_signal(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  }</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingCPSatWrapper.html#a68ad095b727149311d03f62a86c34080"> 280</a></span>  <a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.html#a68ad095b727149311d03f62a86c34080">~RoutingCPSatWrapper</a>()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingCPSatWrapper.html#ac2fdf117e3886bbce4baa56a77d3e9cc"> 281</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.html#ac2fdf117e3886bbce4baa56a77d3e9cc">Clear</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  model_.Clear();</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  response_.Clear();</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  objective_coefficients_.clear();</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  objective_offset_ = 0;</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  variable_offset_.clear();</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  constraint_offset_.clear();</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  first_constraint_to_offset_ = 0;</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  }</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingCPSatWrapper.html#a314fad7efb918f0fe41673b65a44253c"> 290</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.html#a314fad7efb918f0fe41673b65a44253c">CreateNewPositiveVariable</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> index = model_.variables_size();</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keywordflow">if</span> (index >= variable_offset_.size()) {</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  variable_offset_.resize(index + 1, 0);</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  }</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  sat::IntegerVariableProto* <span class="keyword">const</span> variable = model_.add_variables();</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  variable->add_domain(0);</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  variable->add_domain(static_cast<int64>(parameters_.mip_max_bound()));</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">return</span> index;</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  }</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingCPSatWrapper.html#a7c45556ef2ecb1a436d8e6f453af2420"> 300</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.html#a7c45556ef2ecb1a436d8e6f453af2420">SetVariableBounds</a>(<span class="keywordtype">int</span> index, int64 lower_bound,</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  int64 upper_bound)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  DCHECK_GE(lower_bound, 0);</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  variable_offset_[index] = lower_bound;</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  sat::IntegerVariableProto* <span class="keyword">const</span> variable = model_.mutable_variables(index);</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  variable->set_domain(0, 0);</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keyword">const</span> int64 offset_upper_bound = CapSub(upper_bound, lower_bound);</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">if</span> (offset_upper_bound < 0) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keywordflow">if</span> (offset_upper_bound <= parameters_.mip_max_bound()) {</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  variable->set_domain(1, offset_upper_bound);</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  variable->set_domain(1, parameters_.mip_max_bound());</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  }</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  }</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingCPSatWrapper.html#a1fac1e151a2a309b171a0fee80e9ea8a"> 315</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.html#a1fac1e151a2a309b171a0fee80e9ea8a">SetVariableDisjointBounds</a>(<span class="keywordtype">int</span> index, <span class="keyword">const</span> std::vector<int64>& starts,</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keyword">const</span> std::vector<int64>& ends)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  DCHECK_EQ(starts.size(), ends.size());</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> ct = <a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.html#aabef85ece915faf927eeb6899690a45a">CreateNewConstraint</a>(1, 1);</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < starts.size(); ++i) {</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> variable = <a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.html#a314fad7efb918f0fe41673b65a44253c">CreateNewPositiveVariable</a>();</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.html#a7c45556ef2ecb1a436d8e6f453af2420">SetVariableBounds</a>(variable, 0, 1);</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.html#a00bd8299ff5696ff8a0ef53928901955">SetCoefficient</a>(ct, variable, 1);</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> window_ct = <a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.html#aabef85ece915faf927eeb6899690a45a">CreateNewConstraint</a>(starts[i], ends[i]);</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.html#a00bd8299ff5696ff8a0ef53928901955">SetCoefficient</a>(window_ct, index, 1);</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  model_.mutable_constraints(window_ct)->add_enforcement_literal(variable);</div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  }</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  }</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingCPSatWrapper.html#aaca77a68804fde0a877dc805eb34ba51"> 328</a></span>  int64 <a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.html#aaca77a68804fde0a877dc805eb34ba51">GetVariableLowerBound</a>(<span class="keywordtype">int</span> index)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keywordflow">return</span> CapAdd(model_.variables(index).domain(0), variable_offset_[index]);</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  }</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingCPSatWrapper.html#af5469274c2e2ba025997a4677d13be80"> 331</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.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="l00332"></a><span class="lineno"> 332</span>  <span class="comment">// TODO(user): Check variable bounds are never set after setting the</span></div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="comment">// objective coefficient.</span></div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keywordflow">if</span> (index >= objective_coefficients_.size()) {</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  objective_coefficients_.resize(index + 1, 0);</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  }</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  objective_coefficients_[index] = coefficient;</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  sat::CpObjectiveProto* <span class="keyword">const</span> objective = model_.mutable_objective();</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  objective->add_vars(index);</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  objective->add_coeffs(coefficient);</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  objective_offset_ += coefficient * variable_offset_[index];</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  }</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingCPSatWrapper.html#a8b4d155c1cccad5c76188e25b49aad47"> 343</a></span>  <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.html#a8b4d155c1cccad5c76188e25b49aad47">GetObjectiveCoefficient</a>(<span class="keywordtype">int</span> index)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keywordflow">return</span> (index < objective_coefficients_.size())</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  ? objective_coefficients_[index]</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  : 0;</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_1RoutingCPSatWrapper.html#af9cf3c86b3e07b1f6761f3d12f04b068"> 348</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.html#af9cf3c86b3e07b1f6761f3d12f04b068">ClearObjective</a>()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  model_.mutable_objective()->Clear();</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  objective_offset_ = 0;</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  }</div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingCPSatWrapper.html#a0d53b135116dda43796783fc1c812f83"> 352</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.html#a0d53b135116dda43796783fc1c812f83">NumVariables</a>()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> model_.variables_size(); }</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingCPSatWrapper.html#aabef85ece915faf927eeb6899690a45a"> 353</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.html#aabef85ece915faf927eeb6899690a45a">CreateNewConstraint</a>(int64 lower_bound, int64 upper_bound)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> ct_index = model_.constraints_size();</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordflow">if</span> (ct_index >= constraint_offset_.size()) {</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  constraint_offset_.resize(ct_index + 1, 0);</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  }</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  sat::LinearConstraintProto* <span class="keyword">const</span> ct =</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  model_.add_constraints()->mutable_linear();</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  ct->add_domain(lower_bound);</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  ct->add_domain(upper_bound);</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keywordflow">return</span> ct_index;</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  }</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingCPSatWrapper.html#a00bd8299ff5696ff8a0ef53928901955"> 364</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.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="l00365"></a><span class="lineno"> 365</span>  <span class="comment">// TODO(user): Check variable bounds are never set after setting the</span></div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="comment">// variable coefficient.</span></div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  sat::LinearConstraintProto* <span class="keyword">const</span> ct =</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  model_.mutable_constraints(ct_index)->mutable_linear();</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  ct->add_vars(index);</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  ct->add_coeffs(coefficient);</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  constraint_offset_[ct_index] =</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  CapAdd(constraint_offset_[ct_index],</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  CapProd(variable_offset_[index], coefficient));</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_1RoutingCPSatWrapper.html#a671fad375e30cdfe6c95447a43aed2aa"> 375</a></span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.html#a671fad375e30cdfe6c95447a43aed2aa">Solve</a>(absl::Duration duration_limit)<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="comment">// Set constraint offsets</span></div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> ct_index = first_constraint_to_offset_;</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  ct_index < constraint_offset_.size(); ++ct_index) {</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  sat::LinearConstraintProto* <span class="keyword">const</span> ct =</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  model_.mutable_constraints(ct_index)->mutable_linear();</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  ct->set_domain(0, CapSub(ct->domain(0), constraint_offset_[ct_index]));</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  ct->set_domain(1, CapSub(ct->domain(1), constraint_offset_[ct_index]));</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  }</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  first_constraint_to_offset_ = constraint_offset_.size();</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  parameters_.set_max_time_in_seconds(absl::ToDoubleSeconds(duration_limit));</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  VLOG(2) << model_.DebugString();</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordflow">if</span> (hint_.vars_size() == model_.variables_size()) {</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  *model_.mutable_solution_hint() = hint_;</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::Model model;</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  model.Add(sat::NewSatParameters(parameters_));</div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  response_ = sat::SolveCpModel(model_, &model);</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  VLOG(2) << response_.DebugString();</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keywordflow">if</span> (response_.status() == sat::CpSolverStatus::OPTIMAL ||</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  (response_.status() == sat::CpSolverStatus::FEASIBLE &&</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  !model_.has_objective())) {</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  hint_.Clear();</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < response_.solution_size(); ++i) {</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  hint_.add_vars(i);</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  hint_.add_values(response_.solution(i));</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  }</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293">DimensionSchedulingStatus::OPTIMAL</a>;</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  }</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>;</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  }</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingCPSatWrapper.html#a5670767b54ca9cb51886a8961c69c778"> 406</a></span>  <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.html#a5670767b54ca9cb51886a8961c69c778">GetObjectiveValue</a>()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordflow">return</span> response_.objective_value() + objective_offset_;</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  }</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"><a class="line" href="classoperations__research_1_1RoutingCPSatWrapper.html#a51b3d2be66ee6c5461945af52e85a8e0"> 409</a></span>  <span class="keywordtype">double</span> <a class="code" href="classoperations__research_1_1RoutingCPSatWrapper.html#a51b3d2be66ee6c5461945af52e85a8e0">GetValue</a>(<span class="keywordtype">int</span> index)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keywordflow">return</span> response_.solution(index) + variable_offset_[index];</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  }</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  </div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  sat::CpModelProto model_;</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  sat::CpSolverResponse response_;</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  sat::SatParameters parameters_;</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  std::vector<double> objective_coefficients_;</div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keywordtype">double</span> objective_offset_;</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  std::vector<int64> variable_offset_;</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  std::vector<int64> constraint_offset_;</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keywordtype">int</span> first_constraint_to_offset_;</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  sat::PartialVariableAssignment hint_;</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span> };</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> <span class="comment">// Utility class used in Local/GlobalDimensionCumulOptimizer to set the linear</span></div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span> <span class="comment">// solver constraints and solve the problem.</span></div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"><a class="line" href="classoperations__research_1_1DimensionCumulOptimizerCore.html"> 427</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1DimensionCumulOptimizerCore.html">DimensionCumulOptimizerCore</a> {</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"><a class="line" href="classoperations__research_1_1DimensionCumulOptimizerCore.html#a5967f72ac911a2ed971a1ce103d1c47b"> 429</a></span>  <a class="code" href="classoperations__research_1_1DimensionCumulOptimizerCore.html#a5967f72ac911a2ed971a1ce103d1c47b">DimensionCumulOptimizerCore</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1RoutingDimension.html">RoutingDimension</a>* <a class="code" href="classoperations__research_1_1DimensionCumulOptimizerCore.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>,</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keywordtype">bool</span> use_precedence_propagator)</div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  : dimension_(<a class="code" href="classoperations__research_1_1DimensionCumulOptimizerCore.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>),</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  visited_pickup_delivery_indices_for_pair_(</div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <a class="code" href="classoperations__research_1_1DimensionCumulOptimizerCore.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>->model()->GetPickupAndDeliveryPairs().size(), {-1, -1}) {</div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="keywordflow">if</span> (use_precedence_propagator) {</div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  propagator_ = absl::make_unique<CumulBoundsPropagator>(<a class="code" href="classoperations__research_1_1DimensionCumulOptimizerCore.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>);</div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  }</div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  }</div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  </div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="comment">// In the OptimizeSingleRoute() and Optimize() methods, if both "cumul_values"</span></div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</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="l00441"></a><span class="lineno"> 441</span>  <span class="comment">// first feasible solution in the linear solver (since in this case only</span></div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="comment">// feasibility is of interest).</span></div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1DimensionCumulOptimizerCore.html#ad6bb29cd9b91bb50645b363e8b82b586">OptimizeSingleRoute</a>(</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64(int64)>& next_accessor,</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  RoutingLinearSolverWrapper* solver, std::vector<int64>* cumul_values,</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  int64* cost, int64* transit_cost, <span class="keywordtype">bool</span> clear_lp = <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  </div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1DimensionCumulOptimizerCore.html#aa7a6e2adf6a90af2779e0122657db17a">Optimize</a>(<span class="keyword">const</span> std::function<int64(int64)>& next_accessor,</div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  RoutingLinearSolverWrapper* solver,</div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  std::vector<int64>* cumul_values, int64* cost,</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  int64* transit_cost, <span class="keywordtype">bool</span> clear_lp = <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  </div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1DimensionCumulOptimizerCore.html#a8298659d6ec909b996b3f0b5eb819bdb">OptimizeAndPack</a>(<span class="keyword">const</span> std::function<int64(int64)>& next_accessor,</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  RoutingLinearSolverWrapper* solver,</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  std::vector<int64>* cumul_values);</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  </div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1DimensionCumulOptimizerCore.html#acce92ee5bd5bbea02980450a9a6b9378">OptimizeAndPackSingleRoute</a>(</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64(int64)>& next_accessor,</div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  RoutingLinearSolverWrapper* solver, std::vector<int64>* cumul_values);</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  </div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"><a class="line" href="classoperations__research_1_1DimensionCumulOptimizerCore.html#a6769f38bbc3271d45b0512c12ef31f70"> 461</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1RoutingDimension.html">RoutingDimension</a>* <a class="code" href="classoperations__research_1_1DimensionCumulOptimizerCore.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> dimension_; }</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  </div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="comment">// Initializes the containers and given solver. Must be called prior to</span></div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="comment">// setting any contraints and solving.</span></div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="keywordtype">void</span> InitOptimizer(<a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.html">RoutingLinearSolverWrapper</a>* solver);</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  </div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="comment">// Computes the minimum/maximum of cumuls for nodes on "route", and sets them</span></div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="comment">// in current_route_[min|max]_cumuls_ respectively.</span></div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="comment">// If the propagator_ is not null, uses the bounds tightened by the</span></div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="comment">// propagator.</span></div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="comment">// Otherwise, the bounds are computed by going over the nodes on the route</span></div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="comment">// using the CP bounds, and the fixed transits are used to tighten them.</span></div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="keywordtype">bool</span> ComputeRouteCumulBounds(<span class="keyword">const</span> std::vector<int64>& route,</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keyword">const</span> std::vector<int64>& fixed_transits,</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  int64 cumul_offset);</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  </div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="comment">// Sets the constraints for all nodes on "vehicle"'s route according to</span></div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="comment">// "next_accessor". If optimize_costs is true, also sets the objective</span></div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="comment">// coefficients for the LP.</span></div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="comment">// Returns false if some infeasibility was detected, true otherwise.</span></div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keywordtype">bool</span> SetRouteCumulConstraints(</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64(int64)>& next_accessor,</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  int64 cumul_offset, <span class="keywordtype">bool</span> optimize_costs,</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.html">RoutingLinearSolverWrapper</a>* solver, int64* route_transit_cost,</div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  int64* route_cost_offset);</div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  </div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="comment">// Sets the global constraints on the dimension, and adds global objective</span></div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="comment">// cost coefficients if optimize_costs is true.</span></div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="comment">// NOTE: When called, the call to this function MUST come after</span></div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="comment">// SetRouteCumulConstraints() has been called on all routes, so that</span></div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <span class="comment">// index_to_cumul_variable_ and min_start/max_end_cumul_ are correctly</span></div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="comment">// initialized.</span></div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="keywordtype">void</span> SetGlobalConstraints(<span class="keywordtype">bool</span> optimize_costs,</div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.html">RoutingLinearSolverWrapper</a>* solver);</div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  </div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keywordtype">void</span> SetCumulValuesFromLP(<span class="keyword">const</span> std::vector<int>& cumul_variables,</div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  int64 offset, <a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.html">RoutingLinearSolverWrapper</a>* solver,</div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  std::vector<int64>* cumul_values);</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  </div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="comment">// This function packs the routes of the given vehicles while keeping the cost</span></div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="comment">// of the LP lower than its current (supposed optimal) objective value.</span></div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="comment">// It does so by setting the current objective variables' coefficient to 0 and</span></div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</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="l00505"></a><span class="lineno"> 505</span>  <span class="comment">// ends' cumuls, and then maximizes the starts' cumuls without increasing the</span></div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="comment">// ends.</span></div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> PackRoutes(std::vector<int> vehicles,</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <a class="code" href="classoperations__research_1_1RoutingLinearSolverWrapper.html">RoutingLinearSolverWrapper</a>* solver);</div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  </div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  std::unique_ptr<CumulBoundsPropagator> propagator_;</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  std::vector<int64> current_route_min_cumuls_;</div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  std::vector<int64> current_route_max_cumuls_;</div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1RoutingDimension.html">RoutingDimension</a>* <span class="keyword">const</span> dimension_;</div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  std::vector<int> current_route_cumul_variables_;</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  std::vector<int> index_to_cumul_variable_;</div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="keywordtype">int</span> max_end_cumul_;</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordtype">int</span> min_start_cumul_;</div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  std::vector<std::pair<int64, int64>></div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  visited_pickup_delivery_indices_for_pair_;</div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span> };</div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  </div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span> <span class="comment">// Class used to compute optimal values for dimension cumuls of routes,</span></div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span> <span class="comment">// minimizing cumul soft lower and upper bound costs, and vehicle span costs of</span></div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span> <span class="comment">// a route.</span></div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</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="l00526"></a><span class="lineno"> 526</span> <span class="comment">// given node on a route.</span></div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"><a class="line" href="classoperations__research_1_1LocalDimensionCumulOptimizer.html"> 527</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1LocalDimensionCumulOptimizer.html">LocalDimensionCumulOptimizer</a> {</div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <a class="code" href="classoperations__research_1_1LocalDimensionCumulOptimizer.html#a5bcbf49ff1a9dd9f92c40750ec0267b4">LocalDimensionCumulOptimizer</a>(</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1RoutingDimension.html">RoutingDimension</a>* <a class="code" href="classoperations__research_1_1LocalDimensionCumulOptimizer.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>,</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <a class="code" href="namespaceoperations__research.html#a761463065b9e80673178ba0dda3634ba">RoutingSearchParameters::SchedulingSolver</a> solver_type);</div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  </div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="comment">// If feasible, computes the optimal cost of the route performed by a vehicle,</span></div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="comment">// minimizing cumul soft lower and upper bound costs and vehicle span costs,</span></div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <span class="comment">// and stores it in "optimal_cost" (if not null).</span></div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="comment">// Returns true iff the route respects all constraints.</span></div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1LocalDimensionCumulOptimizer.html#a6d0f5e1ec4506fe6aa43a19836c0b476">ComputeRouteCumulCost</a>(</div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64(int64)>& next_accessor,</div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  int64* optimal_cost);</div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  </div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <span class="comment">// Same as ComputeRouteCumulCost, but the cost computed does not contain</span></div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="comment">// the part of the vehicle span cost due to fixed transits.</span></div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1LocalDimensionCumulOptimizer.html#ab165a7061f3391a4948ca7ae06307799">ComputeRouteCumulCostWithoutFixedTransits</a>(</div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64(int64)>& next_accessor,</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  int64* optimal_cost_without_transits);</div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  </div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="comment">// If feasible, computes the optimal cumul values of the route performed by a</span></div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="comment">// vehicle, minimizing cumul soft lower and upper bound costs and vehicle span</span></div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="comment">// costs, stores them in "optimal_cumuls" (if not null), and returns true.</span></div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="comment">// Returns false if the route is not feasible.</span></div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1LocalDimensionCumulOptimizer.html#aa33ea5ede8beef79771389cf045e7d0e">ComputeRouteCumuls</a>(</div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64(int64)>& next_accessor,</div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  std::vector<int64>* optimal_cumuls);</div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  </div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="comment">// Similar to ComputeRouteCumuls, but also tries to pack the cumul values on</span></div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</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="l00557"></a><span class="lineno"> 557</span>  <span class="comment">// minimized, and then the cumul of the start of the route is maximized.</span></div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1LocalDimensionCumulOptimizer.html#a9492cf82b5d110ad0a3de0bc2251e8a3">ComputePackedRouteCumuls</a>(</div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64(int64)>& next_accessor,</div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  std::vector<int64>* packed_cumuls);</div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  </div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"><a class="line" href="classoperations__research_1_1LocalDimensionCumulOptimizer.html#a6769f38bbc3271d45b0512c12ef31f70"> 562</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1RoutingDimension.html">RoutingDimension</a>* <a class="code" href="classoperations__research_1_1LocalDimensionCumulOptimizer.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="keywordflow">return</span> optimizer_core_.<a class="code" href="classoperations__research_1_1DimensionCumulOptimizerCore.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>();</div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  }</div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  </div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  std::vector<std::unique_ptr<RoutingLinearSolverWrapper>> solver_;</div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <a class="code" href="classoperations__research_1_1DimensionCumulOptimizerCore.html">DimensionCumulOptimizerCore</a> optimizer_core_;</div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span> };</div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  </div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GlobalDimensionCumulOptimizer.html"> 571</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1GlobalDimensionCumulOptimizer.html">GlobalDimensionCumulOptimizer</a> {</div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1GlobalDimensionCumulOptimizer.html#a69c482660dedcd9e709e459c979790a2">GlobalDimensionCumulOptimizer</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1RoutingDimension.html">RoutingDimension</a>* <a class="code" href="classoperations__research_1_1GlobalDimensionCumulOptimizer.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>);</div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="comment">// If feasible, computes the optimal cost of the entire model with regards to</span></div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="comment">// the optimizer_core_'s dimension costs, minimizing cumul soft lower/upper</span></div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="comment">// bound costs and vehicle/global span costs, and stores it in "optimal_cost"</span></div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="comment">// (if not null).</span></div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="comment">// Returns true iff all the constraints can be respected.</span></div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1GlobalDimensionCumulOptimizer.html#a90da6b10d66522633bfeefc1289cf05c">ComputeCumulCostWithoutFixedTransits</a>(</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="keyword">const</span> std::function<int64(int64)>& next_accessor,</div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  int64* optimal_cost_without_transits);</div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="comment">// If feasible, computes the optimal cumul values, minimizing cumul soft</span></div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="comment">// lower/upper bound costs and vehicle/global span costs, stores them in</span></div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="comment">// "optimal_cumuls" (if not null), and returns true.</span></div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="comment">// Returns false if the routes are not feasible.</span></div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1GlobalDimensionCumulOptimizer.html#ad38d4817624f537041e9bb1d306768e2">ComputeCumuls</a>(<span class="keyword">const</span> std::function<int64(int64)>& next_accessor,</div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  std::vector<int64>* optimal_cumuls);</div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  </div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="comment">// Returns true iff the routes resulting from the next_accessor are feasible</span></div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="comment">// wrt the constraints on the optimizer_core_.dimension()'s cumuls.</span></div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1GlobalDimensionCumulOptimizer.html#a501d5aa6957f63484392048ba566b0a3">IsFeasible</a>(<span class="keyword">const</span> std::function<int64(int64)>& next_accessor);</div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  </div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="comment">// Similar to ComputeCumuls, but also tries to pack the cumul values on all</span></div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</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="l00595"></a><span class="lineno"> 595</span>  <span class="comment">// minimized, and then the cumuls of the starts of the routes are maximized.</span></div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1GlobalDimensionCumulOptimizer.html#ad61ae74484849042d200dbb1dc0d0116">ComputePackedCumuls</a>(<span class="keyword">const</span> std::function<int64(int64)>& next_accessor,</div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  std::vector<int64>* packed_cumuls);</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  </div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GlobalDimensionCumulOptimizer.html#a6769f38bbc3271d45b0512c12ef31f70"> 599</a></span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1RoutingDimension.html">RoutingDimension</a>* <a class="code" href="classoperations__research_1_1GlobalDimensionCumulOptimizer.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="keywordflow">return</span> optimizer_core_.<a class="code" href="classoperations__research_1_1DimensionCumulOptimizerCore.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>();</div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  }</div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  </div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  std::unique_ptr<RoutingLinearSolverWrapper> solver_;</div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <a class="code" href="classoperations__research_1_1DimensionCumulOptimizerCore.html">DimensionCumulOptimizerCore</a> optimizer_core_;</div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span> };</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  </div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span> } <span class="comment">// namespace operations_research</span></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="preprocessor">#endif // OR_TOOLS_CONSTRAINT_SOLVER_ROUTING_LP_SCHEDULING_H_</span></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingLinearSolverWrapper_html_a6bcbec446b5474e98e50ef78544c82b0"><div class="ttname"><a href="classoperations__research_1_1RoutingLinearSolverWrapper.html#a6bcbec446b5474e98e50ef78544c82b0">operations_research::RoutingLinearSolverWrapper::CreateNewPositiveVariable</a></div><div class="ttdeci">virtual int CreateNewPositiveVariable()=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingCPSatWrapper_html_a5670767b54ca9cb51886a8961c69c778"><div class="ttname"><a href="classoperations__research_1_1RoutingCPSatWrapper.html#a5670767b54ca9cb51886a8961c69c778">operations_research::RoutingCPSatWrapper::GetObjectiveValue</a></div><div class="ttdeci">double GetObjectiveValue() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00406">routing_lp_scheduling.h:406</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingCPSatWrapper_html_a1fac1e151a2a309b171a0fee80e9ea8a"><div class="ttname"><a href="classoperations__research_1_1RoutingCPSatWrapper.html#a1fac1e151a2a309b171a0fee80e9ea8a">operations_research::RoutingCPSatWrapper::SetVariableDisjointBounds</a></div><div class="ttdeci">void SetVariableDisjointBounds(int index, const std::vector< int64 > &starts, const std::vector< int64 > &ends) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00315">routing_lp_scheduling.h:315</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingLinearSolverWrapper_html_acb5447abf2fd0ef52e46ce561ffef5cb"><div class="ttname"><a href="classoperations__research_1_1RoutingLinearSolverWrapper.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_1RoutingLinearSolverWrapper_html_aa7443a97965215ca0cc8b502f93a774d"><div class="ttname"><a href="classoperations__research_1_1RoutingLinearSolverWrapper.html#aa7443a97965215ca0cc8b502f93a774d">operations_research::RoutingLinearSolverWrapper::GetObjectiveValue</a></div><div class="ttdeci">virtual double GetObjectiveValue() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingGlopWrapper_html_a8b4d155c1cccad5c76188e25b49aad47"><div class="ttname"><a href="classoperations__research_1_1RoutingGlopWrapper.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#l00203">routing_lp_scheduling.h:203</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingLinearSolverWrapper_html_ac154a773600edab5f5fbc597c5639cce"><div class="ttname"><a href="classoperations__research_1_1RoutingLinearSolverWrapper.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_1RoutingCPSatWrapper_html_a68ad095b727149311d03f62a86c34080"><div class="ttname"><a href="classoperations__research_1_1RoutingCPSatWrapper.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#l00280">routing_lp_scheduling.h:280</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingCPSatWrapper_html_a7c45556ef2ecb1a436d8e6f453af2420"><div class="ttname"><a href="classoperations__research_1_1RoutingCPSatWrapper.html#a7c45556ef2ecb1a436d8e6f453af2420">operations_research::RoutingCPSatWrapper::SetVariableBounds</a></div><div class="ttdeci">bool SetVariableBounds(int index, int64 lower_bound, int64 upper_bound) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00300">routing_lp_scheduling.h:300</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingCPSatWrapper_html_aaca77a68804fde0a877dc805eb34ba51"><div class="ttname"><a href="classoperations__research_1_1RoutingCPSatWrapper.html#aaca77a68804fde0a877dc805eb34ba51">operations_research::RoutingCPSatWrapper::GetVariableLowerBound</a></div><div class="ttdeci">int64 GetVariableLowerBound(int index) const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00328">routing_lp_scheduling.h:328</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1LocalDimensionCumulOptimizer_html_a6769f38bbc3271d45b0512c12ef31f70"><div class="ttname"><a href="classoperations__research_1_1LocalDimensionCumulOptimizer.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#l00562">routing_lp_scheduling.h:562</a></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>
|
|
<div class="ttc" id="aclassoperations__research_1_1GlobalDimensionCumulOptimizer_html"><div class="ttname"><a href="classoperations__research_1_1GlobalDimensionCumulOptimizer.html">operations_research::GlobalDimensionCumulOptimizer</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00571">routing_lp_scheduling.h:571</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingGlopWrapper_html"><div class="ttname"><a href="classoperations__research_1_1RoutingGlopWrapper.html">operations_research::RoutingGlopWrapper</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00156">routing_lp_scheduling.h:156</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingGlopWrapper_html_ac2fdf117e3886bbce4baa56a77d3e9cc"><div class="ttname"><a href="classoperations__research_1_1RoutingGlopWrapper.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#l00162">routing_lp_scheduling.h:162</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1CumulBoundsPropagator_html_a72be8a813404822957fbd808d0405226"><div class="ttname"><a href="classoperations__research_1_1CumulBoundsPropagator.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#l00054">routing_lp_scheduling.h:54</a></div></div>
|
|
<div class="ttc" id="arouting_8h_html"><div class="ttname"><a href="routing_8h.html">routing.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingLinearSolverWrapper_html_a1923407036f149ea2c31ac37c11e1337"><div class="ttname"><a href="classoperations__research_1_1RoutingLinearSolverWrapper.html#a1923407036f149ea2c31ac37c11e1337">operations_research::RoutingLinearSolverWrapper::CreateNewConstraint</a></div><div class="ttdeci">virtual int CreateNewConstraint(int64 lower_bound, int64 upper_bound)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingCPSatWrapper_html_a00bd8299ff5696ff8a0ef53928901955"><div class="ttname"><a href="classoperations__research_1_1RoutingCPSatWrapper.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#l00364">routing_lp_scheduling.h:364</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1DimensionCumulOptimizerCore_html_a5967f72ac911a2ed971a1ce103d1c47b"><div class="ttname"><a href="classoperations__research_1_1DimensionCumulOptimizerCore.html#a5967f72ac911a2ed971a1ce103d1c47b">operations_research::DimensionCumulOptimizerCore::DimensionCumulOptimizerCore</a></div><div class="ttdeci">DimensionCumulOptimizerCore(const RoutingDimension *dimension, bool use_precedence_propagator)</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="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00098">constraint_solver.h:98</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GlobalDimensionCumulOptimizer_html_a6769f38bbc3271d45b0512c12ef31f70"><div class="ttname"><a href="classoperations__research_1_1GlobalDimensionCumulOptimizer.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#l00599">routing_lp_scheduling.h:599</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingGlopWrapper_html_a671fad375e30cdfe6c95447a43aed2aa"><div class="ttname"><a href="classoperations__research_1_1RoutingGlopWrapper.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#l00225">routing_lp_scheduling.h:225</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingCPSatWrapper_html_a671fad375e30cdfe6c95447a43aed2aa"><div class="ttname"><a href="classoperations__research_1_1RoutingCPSatWrapper.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#l00375">routing_lp_scheduling.h:375</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#l00124">routing_lp_scheduling.h:124</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GlobalDimensionCumulOptimizer_html_a90da6b10d66522633bfeefc1289cf05c"><div class="ttname"><a href="classoperations__research_1_1GlobalDimensionCumulOptimizer.html#a90da6b10d66522633bfeefc1289cf05c">operations_research::GlobalDimensionCumulOptimizer::ComputeCumulCostWithoutFixedTransits</a></div><div class="ttdeci">bool ComputeCumulCostWithoutFixedTransits(const std::function< int64(int64)> &next_accessor, int64 *optimal_cost_without_transits)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1DimensionCumulOptimizerCore_html_a8298659d6ec909b996b3f0b5eb819bdb"><div class="ttname"><a href="classoperations__research_1_1DimensionCumulOptimizerCore.html#a8298659d6ec909b996b3f0b5eb819bdb">operations_research::DimensionCumulOptimizerCore::OptimizeAndPack</a></div><div class="ttdeci">bool OptimizeAndPack(const std::function< int64(int64)> &next_accessor, RoutingLinearSolverWrapper *solver, std::vector< int64 > *cumul_values)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingCPSatWrapper_html_a0d53b135116dda43796783fc1c812f83"><div class="ttname"><a href="classoperations__research_1_1RoutingCPSatWrapper.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#l00352">routing_lp_scheduling.h:352</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingLinearSolverWrapper_html_a7bdd4be7fd06d5c445403fdf3de0eeda"><div class="ttname"><a href="classoperations__research_1_1RoutingLinearSolverWrapper.html#a7bdd4be7fd06d5c445403fdf3de0eeda">operations_research::RoutingLinearSolverWrapper::GetVariableLowerBound</a></div><div class="ttdeci">virtual int64 GetVariableLowerBound(int index) const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingCPSatWrapper_html_a51b3d2be66ee6c5461945af52e85a8e0"><div class="ttname"><a href="classoperations__research_1_1RoutingCPSatWrapper.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#l00409">routing_lp_scheduling.h:409</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1LocalDimensionCumulOptimizer_html_a9492cf82b5d110ad0a3de0bc2251e8a3"><div class="ttname"><a href="classoperations__research_1_1LocalDimensionCumulOptimizer.html#a9492cf82b5d110ad0a3de0bc2251e8a3">operations_research::LocalDimensionCumulOptimizer::ComputePackedRouteCumuls</a></div><div class="ttdeci">DimensionSchedulingStatus ComputePackedRouteCumuls(int vehicle, const std::function< int64(int64)> &next_accessor, std::vector< int64 > *packed_cumuls)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingGlopWrapper_html_a8f7b46f13332393a627d45a46cfff2a1"><div class="ttname"><a href="classoperations__research_1_1RoutingGlopWrapper.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#l00158">routing_lp_scheduling.h:158</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GlobalDimensionCumulOptimizer_html_a501d5aa6957f63484392048ba566b0a3"><div class="ttname"><a href="classoperations__research_1_1GlobalDimensionCumulOptimizer.html#a501d5aa6957f63484392048ba566b0a3">operations_research::GlobalDimensionCumulOptimizer::IsFeasible</a></div><div class="ttdeci">bool IsFeasible(const std::function< int64(int64)> &next_accessor)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1CumulBoundsPropagator_html_a921806c74f3dd622afc937929b69d627"><div class="ttname"><a href="classoperations__research_1_1CumulBoundsPropagator.html#a921806c74f3dd622afc937929b69d627">operations_research::CumulBoundsPropagator::CumulMin</a></div><div class="ttdeci">int64 CumulMin(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00045">routing_lp_scheduling.h:45</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingLinearSolverWrapper_html_ad56b5d5264e07b44be873dfdcd29cb8e"><div class="ttname"><a href="classoperations__research_1_1RoutingLinearSolverWrapper.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_1RoutingGlopWrapper_html_a314fad7efb918f0fe41673b65a44253c"><div class="ttname"><a href="classoperations__research_1_1RoutingGlopWrapper.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#l00167">routing_lp_scheduling.h:167</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingGlopWrapper_html_aabef85ece915faf927eeb6899690a45a"><div class="ttname"><a href="classoperations__research_1_1RoutingGlopWrapper.html#aabef85ece915faf927eeb6899690a45a">operations_research::RoutingGlopWrapper::CreateNewConstraint</a></div><div class="ttdeci">int CreateNewConstraint(int64 lower_bound, int64 upper_bound) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00214">routing_lp_scheduling.h:214</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingGlopWrapper_html_af5469274c2e2ba025997a4677d13be80"><div class="ttname"><a href="classoperations__research_1_1RoutingGlopWrapper.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#l00200">routing_lp_scheduling.h:200</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1LocalDimensionCumulOptimizer_html"><div class="ttname"><a href="classoperations__research_1_1LocalDimensionCumulOptimizer.html">operations_research::LocalDimensionCumulOptimizer</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00527">routing_lp_scheduling.h:527</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingCPSatWrapper_html_a28fd517263e8003e3e545d646b96d75f"><div class="ttname"><a href="classoperations__research_1_1RoutingCPSatWrapper.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#l00272">routing_lp_scheduling.h:272</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingCPSatWrapper_html_aabef85ece915faf927eeb6899690a45a"><div class="ttname"><a href="classoperations__research_1_1RoutingCPSatWrapper.html#aabef85ece915faf927eeb6899690a45a">operations_research::RoutingCPSatWrapper::CreateNewConstraint</a></div><div class="ttdeci">int CreateNewConstraint(int64 lower_bound, int64 upper_bound) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00353">routing_lp_scheduling.h:353</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingGlopWrapper_html_a7c45556ef2ecb1a436d8e6f453af2420"><div class="ttname"><a href="classoperations__research_1_1RoutingGlopWrapper.html#a7c45556ef2ecb1a436d8e6f453af2420">operations_research::RoutingGlopWrapper::SetVariableBounds</a></div><div class="ttdeci">bool SetVariableBounds(int index, int64 lower_bound, int64 upper_bound) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00170">routing_lp_scheduling.h:170</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>
|
|
<div class="ttc" id="aclassoperations__research_1_1DimensionCumulOptimizerCore_html"><div class="ttname"><a href="classoperations__research_1_1DimensionCumulOptimizerCore.html">operations_research::DimensionCumulOptimizerCore</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00427">routing_lp_scheduling.h:427</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingLinearSolverWrapper_html"><div class="ttname"><a href="classoperations__research_1_1RoutingLinearSolverWrapper.html">operations_research::RoutingLinearSolverWrapper</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00134">routing_lp_scheduling.h:134</a></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>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingGlopWrapper_html_a0d53b135116dda43796783fc1c812f83"><div class="ttname"><a href="classoperations__research_1_1RoutingGlopWrapper.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#l00211">routing_lp_scheduling.h:211</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingGlopWrapper_html_a1fac1e151a2a309b171a0fee80e9ea8a"><div class="ttname"><a href="classoperations__research_1_1RoutingGlopWrapper.html#a1fac1e151a2a309b171a0fee80e9ea8a">operations_research::RoutingGlopWrapper::SetVariableDisjointBounds</a></div><div class="ttdeci">void SetVariableDisjointBounds(int index, const std::vector< int64 > &starts, const std::vector< int64 > &ends) override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00188">routing_lp_scheduling.h:188</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingGlopWrapper_html_a51b3d2be66ee6c5461945af52e85a8e0"><div class="ttname"><a href="classoperations__research_1_1RoutingGlopWrapper.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#l00259">routing_lp_scheduling.h:259</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingDimension_html"><div class="ttname"><a href="classoperations__research_1_1RoutingDimension.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#l02160">routing.h:2160</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1CumulBoundsPropagator_html_a54688e4af975568b0bce87cdf9f26781"><div class="ttname"><a href="classoperations__research_1_1CumulBoundsPropagator.html#a54688e4af975568b0bce87cdf9f26781">operations_research::CumulBoundsPropagator::PropagateCumulBounds</a></div><div class="ttdeci">bool PropagateCumulBounds(const std::function< int64(int64)> &next_accessor, int64 cumul_offset)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GlobalDimensionCumulOptimizer_html_ad38d4817624f537041e9bb1d306768e2"><div class="ttname"><a href="classoperations__research_1_1GlobalDimensionCumulOptimizer.html#ad38d4817624f537041e9bb1d306768e2">operations_research::GlobalDimensionCumulOptimizer::ComputeCumuls</a></div><div class="ttdeci">bool ComputeCumuls(const std::function< int64(int64)> &next_accessor, std::vector< int64 > *optimal_cumuls)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingLinearSolverWrapper_html_aa5b31c976cc6734003d9950e731dfed3"><div class="ttname"><a href="classoperations__research_1_1RoutingLinearSolverWrapper.html#aa5b31c976cc6734003d9950e731dfed3">operations_research::RoutingLinearSolverWrapper::Clear</a></div><div class="ttdeci">virtual void Clear()=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingGlopWrapper_html_a691ac6745157fb62e18c3d8cf1c4538b"><div class="ttname"><a href="classoperations__research_1_1RoutingGlopWrapper.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#l00221">routing_lp_scheduling.h:221</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingGlopWrapper_html_a5670767b54ca9cb51886a8961c69c778"><div class="ttname"><a href="classoperations__research_1_1RoutingGlopWrapper.html#a5670767b54ca9cb51886a8961c69c778">operations_research::RoutingGlopWrapper::GetObjectiveValue</a></div><div class="ttdeci">double GetObjectiveValue() const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00256">routing_lp_scheduling.h:256</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1CumulBoundsPropagator_html_aff8f29b2fce9f6447474ee6077af1b72"><div class="ttname"><a href="classoperations__research_1_1CumulBoundsPropagator.html#aff8f29b2fce9f6447474ee6077af1b72">operations_research::CumulBoundsPropagator::CumulBoundsPropagator</a></div><div class="ttdeci">CumulBoundsPropagator(const RoutingDimension *dimension)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingCPSatWrapper_html_a8b4d155c1cccad5c76188e25b49aad47"><div class="ttname"><a href="classoperations__research_1_1RoutingCPSatWrapper.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#l00343">routing_lp_scheduling.h:343</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingCPSatWrapper_html"><div class="ttname"><a href="classoperations__research_1_1RoutingCPSatWrapper.html">operations_research::RoutingCPSatWrapper</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00270">routing_lp_scheduling.h:270</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingCPSatWrapper_html_a314fad7efb918f0fe41673b65a44253c"><div class="ttname"><a href="classoperations__research_1_1RoutingCPSatWrapper.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#l00290">routing_lp_scheduling.h:290</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingCPSatWrapper_html_af5469274c2e2ba025997a4677d13be80"><div class="ttname"><a href="classoperations__research_1_1RoutingCPSatWrapper.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#l00331">routing_lp_scheduling.h:331</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingLinearSolverWrapper_html_a01ce5bca7f91b37ff459b4d7b63e5190"><div class="ttname"><a href="classoperations__research_1_1RoutingLinearSolverWrapper.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_1LocalDimensionCumulOptimizer_html_ab165a7061f3391a4948ca7ae06307799"><div class="ttname"><a href="classoperations__research_1_1LocalDimensionCumulOptimizer.html#ab165a7061f3391a4948ca7ae06307799">operations_research::LocalDimensionCumulOptimizer::ComputeRouteCumulCostWithoutFixedTransits</a></div><div class="ttdeci">DimensionSchedulingStatus ComputeRouteCumulCostWithoutFixedTransits(int vehicle, const std::function< int64(int64)> &next_accessor, int64 *optimal_cost_without_transits)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingLinearSolverWrapper_html_a2ba069bdfbc07dd513d5d140b19fe70d"><div class="ttname"><a href="classoperations__research_1_1RoutingLinearSolverWrapper.html#a2ba069bdfbc07dd513d5d140b19fe70d">operations_research::RoutingLinearSolverWrapper::SetVariableDisjointBounds</a></div><div class="ttdeci">virtual void SetVariableDisjointBounds(int index, const std::vector< int64 > &starts, const std::vector< int64 > &ends)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1CumulBoundsPropagator_html"><div class="ttname"><a href="classoperations__research_1_1CumulBoundsPropagator.html">operations_research::CumulBoundsPropagator</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00032">routing_lp_scheduling.h:32</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingCPSatWrapper_html_af9cf3c86b3e07b1f6761f3d12f04b068"><div class="ttname"><a href="classoperations__research_1_1RoutingCPSatWrapper.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#l00348">routing_lp_scheduling.h:348</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1LocalDimensionCumulOptimizer_html_aa33ea5ede8beef79771389cf045e7d0e"><div class="ttname"><a href="classoperations__research_1_1LocalDimensionCumulOptimizer.html#aa33ea5ede8beef79771389cf045e7d0e">operations_research::LocalDimensionCumulOptimizer::ComputeRouteCumuls</a></div><div class="ttdeci">DimensionSchedulingStatus ComputeRouteCumuls(int vehicle, const std::function< int64(int64)> &next_accessor, std::vector< int64 > *optimal_cumuls)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingGlopWrapper_html_aaca77a68804fde0a877dc805eb34ba51"><div class="ttname"><a href="classoperations__research_1_1RoutingGlopWrapper.html#aaca77a68804fde0a877dc805eb34ba51">operations_research::RoutingGlopWrapper::GetVariableLowerBound</a></div><div class="ttdeci">int64 GetVariableLowerBound(int index) const override</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00197">routing_lp_scheduling.h:197</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a761463065b9e80673178ba0dda3634ba"><div class="ttname"><a href="namespaceoperations__research.html#a761463065b9e80673178ba0dda3634ba">operations_research::RoutingSearchParameters_SchedulingSolver</a></div><div class="ttdeci">RoutingSearchParameters_SchedulingSolver</div><div class="ttdef"><b>Definition:</b> <a href="routing__parameters_8pb_8h_source.html#l00080">routing_parameters.pb.h:80</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1DimensionCumulOptimizerCore_html_ad6bb29cd9b91bb50645b363e8b82b586"><div class="ttname"><a href="classoperations__research_1_1DimensionCumulOptimizerCore.html#ad6bb29cd9b91bb50645b363e8b82b586">operations_research::DimensionCumulOptimizerCore::OptimizeSingleRoute</a></div><div class="ttdeci">DimensionSchedulingStatus OptimizeSingleRoute(int vehicle, const std::function< int64(int64)> &next_accessor, RoutingLinearSolverWrapper *solver, std::vector< int64 > *cumul_values, int64 *cost, int64 *transit_cost, bool clear_lp=true)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1CumulBoundsPropagator_html_a3b5250c6480d24af0c95d1f68a7556b7"><div class="ttname"><a href="classoperations__research_1_1CumulBoundsPropagator.html#a3b5250c6480d24af0c95d1f68a7556b7">operations_research::CumulBoundsPropagator::CumulMax</a></div><div class="ttdeci">int64 CumulMax(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00049">routing_lp_scheduling.h:49</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingLinearSolverWrapper_html_a9e2ef65ea95577f9df6ba20c43813573"><div class="ttname"><a href="classoperations__research_1_1RoutingLinearSolverWrapper.html#a9e2ef65ea95577f9df6ba20c43813573">operations_research::RoutingLinearSolverWrapper::SetVariableBounds</a></div><div class="ttdeci">virtual bool SetVariableBounds(int index, int64 lower_bound, int64 upper_bound)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1DimensionCumulOptimizerCore_html_aa7a6e2adf6a90af2779e0122657db17a"><div class="ttname"><a href="classoperations__research_1_1DimensionCumulOptimizerCore.html#aa7a6e2adf6a90af2779e0122657db17a">operations_research::DimensionCumulOptimizerCore::Optimize</a></div><div class="ttdeci">bool Optimize(const std::function< int64(int64)> &next_accessor, RoutingLinearSolverWrapper *solver, std::vector< int64 > *cumul_values, int64 *cost, int64 *transit_cost, bool clear_lp=true)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1LocalDimensionCumulOptimizer_html_a6d0f5e1ec4506fe6aa43a19836c0b476"><div class="ttname"><a href="classoperations__research_1_1LocalDimensionCumulOptimizer.html#a6d0f5e1ec4506fe6aa43a19836c0b476">operations_research::LocalDimensionCumulOptimizer::ComputeRouteCumulCost</a></div><div class="ttdeci">DimensionSchedulingStatus ComputeRouteCumulCost(int vehicle, const std::function< int64(int64)> &next_accessor, int64 *optimal_cost)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingLinearSolverWrapper_html_a155f6032f05d373d7375078c1be4a01b"><div class="ttname"><a href="classoperations__research_1_1RoutingLinearSolverWrapper.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_1DimensionCumulOptimizerCore_html_acce92ee5bd5bbea02980450a9a6b9378"><div class="ttname"><a href="classoperations__research_1_1DimensionCumulOptimizerCore.html#acce92ee5bd5bbea02980450a9a6b9378">operations_research::DimensionCumulOptimizerCore::OptimizeAndPackSingleRoute</a></div><div class="ttdeci">DimensionSchedulingStatus OptimizeAndPackSingleRoute(int vehicle, const std::function< int64(int64)> &next_accessor, RoutingLinearSolverWrapper *solver, std::vector< int64 > *cumul_values)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1LocalDimensionCumulOptimizer_html_a5bcbf49ff1a9dd9f92c40750ec0267b4"><div class="ttname"><a href="classoperations__research_1_1LocalDimensionCumulOptimizer.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_1RoutingLinearSolverWrapper_html_a4812d528a6d93d471be496e9ca79c820"><div class="ttname"><a href="classoperations__research_1_1RoutingLinearSolverWrapper.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_1RoutingLinearSolverWrapper_html_af3a7be118910d54c87da7d9ecf7949ac"><div class="ttname"><a href="classoperations__research_1_1RoutingLinearSolverWrapper.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#l00136">routing_lp_scheduling.h:136</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1DimensionCumulOptimizerCore_html_a6769f38bbc3271d45b0512c12ef31f70"><div class="ttname"><a href="classoperations__research_1_1DimensionCumulOptimizerCore.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#l00461">routing_lp_scheduling.h:461</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingGlopWrapper_html_af9cf3c86b3e07b1f6761f3d12f04b068"><div class="ttname"><a href="classoperations__research_1_1RoutingGlopWrapper.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#l00206">routing_lp_scheduling.h:206</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GlobalDimensionCumulOptimizer_html_ad61ae74484849042d200dbb1dc0d0116"><div class="ttname"><a href="classoperations__research_1_1GlobalDimensionCumulOptimizer.html#ad61ae74484849042d200dbb1dc0d0116">operations_research::GlobalDimensionCumulOptimizer::ComputePackedCumuls</a></div><div class="ttdeci">bool ComputePackedCumuls(const std::function< int64(int64)> &next_accessor, std::vector< int64 > *packed_cumuls)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingLinearSolverWrapper_html_ab8bd6c2ebc0fe292221efda5c39de361"><div class="ttname"><a href="classoperations__research_1_1RoutingLinearSolverWrapper.html#ab8bd6c2ebc0fe292221efda5c39de361">operations_research::RoutingLinearSolverWrapper::ClearObjective</a></div><div class="ttdeci">virtual void ClearObjective()=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1RoutingCPSatWrapper_html_ac2fdf117e3886bbce4baa56a77d3e9cc"><div class="ttname"><a href="classoperations__research_1_1RoutingCPSatWrapper.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#l00281">routing_lp_scheduling.h:281</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GlobalDimensionCumulOptimizer_html_a69c482660dedcd9e709e459c979790a2"><div class="ttname"><a href="classoperations__research_1_1GlobalDimensionCumulOptimizer.html#a69c482660dedcd9e709e459c979790a2">operations_research::GlobalDimensionCumulOptimizer::GlobalDimensionCumulOptimizer</a></div><div class="ttdeci">GlobalDimensionCumulOptimizer(const RoutingDimension *dimension)</div></div>
|
|
</div>
|
|
</div>
|
|
<div id="footer-container">
|
|
<div id="footer">
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|