1561 lines
297 KiB
HTML
1561 lines
297 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.1"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: routing_lp_scheduling.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">8.2</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('routing__lp__scheduling_8cc_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">routing_lp_scheduling.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="routing__lp__scheduling_8cc.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">#include "<a class="code" href="routing__lp__scheduling_8h.html">ortools/constraint_solver/routing_lp_scheduling.h</a>"</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>  </div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <numeric></span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span>  </div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include "absl/container/flat_hash_set.h"</span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include "absl/time/time.h"</span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "<a class="code" href="map__util_8h.html">ortools/base/map_util.h</a>"</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</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="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="lp__solver_8h.html">ortools/glop/lp_solver.h</a>"</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="saturated__arithmetic_8h.html">ortools/util/saturated_arithmetic.h</a>"</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  </div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  </div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="keyword">namespace </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">// The following sets of parameters give the fastest response time without</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">// impacting solutions found negatively.</span></div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> glop::GlopParameters GetGlopParametersForLocalLP() {</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  glop::GlopParameters <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>;</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.set_use_dual_simplex(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.set_use_preprocessing(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordflow">return</span> <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>;</div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> }</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  </div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> glop::GlopParameters GetGlopParametersForGlobalLP() {</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  glop::GlopParameters <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>;</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.set_use_dual_simplex(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keywordflow">return</span> <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>;</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> }</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  </div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="keywordtype">bool</span> GetCumulBoundsWithOffset(<span class="keyword">const</span> RoutingDimension& dimension,</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node_index, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_offset,</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* lower_bound, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* upper_bound) {</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(lower_bound != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(upper_bound != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  </div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keyword">const</span> IntVar& cumul_var = *dimension.CumulVar(node_index);</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  *upper_bound = cumul_var.Max();</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">if</span> (*upper_bound < cumul_offset) {</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</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>  </div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> first_after_offset =</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(dimension.GetFirstPossibleGreaterOrEqualValueForNode(</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  node_index, cumul_offset),</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  cumul_var.Min());</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(first_after_offset, <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>);</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  *lower_bound = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(first_after_offset, cumul_offset);</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(*lower_bound, 0);</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  </div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordflow">if</span> (*upper_bound == <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>) {</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  }</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  *upper_bound = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(*upper_bound, cumul_offset);</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(*upper_bound, *lower_bound);</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</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>  </div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> GetFirstPossibleValueForCumulWithOffset(<span class="keyword">const</span> RoutingDimension& dimension,</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node_index,</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> lower_bound_without_offset,</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_offset) {</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  dimension.GetFirstPossibleGreaterOrEqualValueForNode(</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  node_index, <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(lower_bound_without_offset, cumul_offset)),</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  cumul_offset);</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> }</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  </div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> GetLastPossibleValueForCumulWithOffset(<span class="keyword">const</span> RoutingDimension& dimension,</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node_index,</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> upper_bound_without_offset,</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_offset) {</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  dimension.GetLastPossibleLessOrEqualValueForNode(</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  node_index, <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(upper_bound_without_offset, cumul_offset)),</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  cumul_offset);</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span> }</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  </div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment">// Finds the pickup/delivery pairs of nodes on a given vehicle's route.</span></div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment">// Returns the vector of visited pair indices, and stores the corresponding</span></div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment">// pickup/delivery indices in visited_pickup_delivery_indices_for_pair_.</span></div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment">// NOTE: Supposes that visited_pickup_delivery_indices_for_pair is correctly</span></div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// sized and initialized to {-1, -1} for all pairs.</span></div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="keywordtype">void</span> StoreVisitedPickupDeliveryPairsOnRoute(</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keyword">const</span> RoutingDimension& dimension, <span class="keywordtype">int</span> vehicle,</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  std::vector<int>* visited_pairs,</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  std::vector<std::pair<int64, int64>>*</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  visited_pickup_delivery_indices_for_pair) {</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">// visited_pickup_delivery_indices_for_pair must be all {-1, -1}.</span></div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(visited_pickup_delivery_indices_for_pair->size(),</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  dimension.model()->GetPickupAndDeliveryPairs().size());</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(std::all_of(visited_pickup_delivery_indices_for_pair->begin(),</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  visited_pickup_delivery_indices_for_pair->end(),</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  [](std::pair<int64, int64> p) {</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  return p.first == -1 && p.second == -1;</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  }));</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  visited_pairs->clear();</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keywordflow">if</span> (!dimension.HasPickupToDeliveryLimits()) {</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">return</span>;</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="keyword">const</span> RoutingModel& <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a> = *dimension.model();</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  </div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node_index = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.Start(vehicle);</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordflow">while</span> (!<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.IsEnd(node_index)) {</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keyword">const</span> std::vector<std::pair<int, int>>& pickup_index_pairs =</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.GetPickupIndexPairs(node_index);</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keyword">const</span> std::vector<std::pair<int, int>>& delivery_index_pairs =</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.GetDeliveryIndexPairs(node_index);</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keywordflow">if</span> (!pickup_index_pairs.empty()) {</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="comment">// The current node is a pickup. We verify that it belongs to a single</span></div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">// pickup index pair and that it's not a delivery, and store the index.</span></div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(delivery_index_pairs.empty());</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(pickup_index_pairs.size(), 1);</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  (*visited_pickup_delivery_indices_for_pair)[pickup_index_pairs[0].first]</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  .first = node_index;</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  visited_pairs->push_back(pickup_index_pairs[0].first);</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!delivery_index_pairs.empty()) {</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="comment">// The node is a delivery. We verify that it belongs to a single</span></div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="comment">// delivery pair, and set the limit with its pickup if one has been</span></div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="comment">// visited for this pair.</span></div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(delivery_index_pairs.size(), 1);</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> pair_index = delivery_index_pairs[0].first;</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  std::pair<int64, int64>& pickup_delivery_index =</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  (*visited_pickup_delivery_indices_for_pair)[pair_index];</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordflow">if</span> (pickup_delivery_index.first < 0) {</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="comment">// This case should not happen, as a delivery must have its pickup</span></div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="comment">// on the route, but we ignore it here.</span></div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  node_index = next_accessor(node_index);</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  }</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  pickup_delivery_index.second = node_index;</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  }</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  node_index = next_accessor(node_index);</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  }</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span> }</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  </div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  </div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a5bcbf49ff1a9dd9f92c40750ec0267b4"> 154</a></span> <a class="code" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a5bcbf49ff1a9dd9f92c40750ec0267b4">LocalDimensionCumulOptimizer::LocalDimensionCumulOptimizer</a>(</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* dimension,</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  RoutingSearchParameters::SchedulingSolver solver_type)</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  : optimizer_core_(dimension, <span class="comment">/*use_precedence_propagator=*/</span>false) {</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="comment">// Using one solver per vehicle in the hope that if routes don't change this</span></div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="comment">// will be faster.</span></div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> vehicles = <a class="code" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>();</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  solver_.resize(vehicles);</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordflow">switch</span> (solver_type) {</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keywordflow">case</span> RoutingSearchParameters::GLOP: {</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keyword">const</span> glop::GlopParameters <a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a> = GetGlopParametersForLocalLP();</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < vehicles; ++vehicle) {</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  solver_[vehicle] = absl::make_unique<RoutingGlopWrapper>(<a class="code" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>);</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  }</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  }</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">case</span> RoutingSearchParameters::CP_SAT: {</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < vehicles; ++vehicle) {</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  solver_[vehicle] = absl::make_unique<RoutingCPSatWrapper>();</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  }</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  }</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(DFATAL) << <span class="stringliteral">"Unrecognized solver type: "</span> << solver_type;</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  }</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span> }</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  </div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a6d0f5e1ec4506fe6aa43a19836c0b476"> 181</a></span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a6d0f5e1ec4506fe6aa43a19836c0b476">LocalDimensionCumulOptimizer::ComputeRouteCumulCost</a>(</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* optimal_cost) {</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordflow">return</span> optimizer_core_.<a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#aa24fe74f74450fedf90dce6611f45f17">OptimizeSingleRoute</a>(vehicle, next_accessor,</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  solver_[vehicle].get(), <span class="keyword">nullptr</span>,</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keyword">nullptr</span>, optimal_cost, <span class="keyword">nullptr</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"> 188</span>  </div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a></div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#ab165a7061f3391a4948ca7ae06307799"> 190</a></span> <a class="code" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#ab165a7061f3391a4948ca7ae06307799">LocalDimensionCumulOptimizer::ComputeRouteCumulCostWithoutFixedTransits</a>(</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* optimal_cost_without_transits) {</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a> = 0;</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> transit_cost = 0;</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> status = optimizer_core_.<a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#aa24fe74f74450fedf90dce6611f45f17">OptimizeSingleRoute</a>(</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  vehicle, next_accessor, solver_[vehicle].get(), <span class="keyword">nullptr</span>, <span class="keyword">nullptr</span>, &<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>,</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  &transit_cost);</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">if</span> (status != <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a> &&</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  optimal_cost_without_transits != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  *optimal_cost_without_transits = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>, transit_cost);</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  }</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keywordflow">return</span> status;</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span> }</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  </div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a67fc733931c9c43247ce262b1542d399"> 205</a></span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a67fc733931c9c43247ce262b1542d399">LocalDimensionCumulOptimizer::ComputeRouteCumuls</a>(</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  std::vector<int64>* optimal_cumuls, std::vector<int64>* optimal_breaks) {</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">return</span> optimizer_core_.<a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#aa24fe74f74450fedf90dce6611f45f17">OptimizeSingleRoute</a>(</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  vehicle, next_accessor, solver_[vehicle].get(), optimal_cumuls,</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  optimal_breaks, <span class="keyword">nullptr</span>, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span> }</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  </div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a></div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a40f8457f8f4bf714cb5224ce780c7a28"> 214</a></span> <a class="code" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a40f8457f8f4bf714cb5224ce780c7a28">LocalDimensionCumulOptimizer::ComputePackedRouteCumuls</a>(</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  std::vector<int64>* packed_cumuls, std::vector<int64>* packed_breaks) {</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keywordflow">return</span> optimizer_core_.<a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a74b47a791351de6312aefe2d0524688f">OptimizeAndPackSingleRoute</a>(</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  vehicle, next_accessor, solver_[vehicle].get(), packed_cumuls,</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  packed_breaks);</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span> }</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  </div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="keyword">const</span> <span class="keywordtype">int</span> CumulBoundsPropagator::kNoParent = -2;</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span> <span class="keyword">const</span> <span class="keywordtype">int</span> CumulBoundsPropagator::kParentToBePropagated = -1;</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_1_cumul_bounds_propagator.html#aff8f29b2fce9f6447474ee6077af1b72"> 225</a></span> <a class="code" href="classoperations__research_1_1_cumul_bounds_propagator.html#aff8f29b2fce9f6447474ee6077af1b72">CumulBoundsPropagator::CumulBoundsPropagator</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* dimension)</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  : dimension_(*dimension), num_nodes_(2 * dimension->cumuls().size()) {</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  outgoing_arcs_.resize(num_nodes_);</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  node_in_queue_.resize(num_nodes_, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  tree_parent_node_of_.resize(num_nodes_, kNoParent);</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  propagated_bounds_.resize(num_nodes_);</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  visited_pickup_delivery_indices_for_pair_.resize(</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <a class="code" href="classoperations__research_1_1_cumul_bounds_propagator.html#a72be8a813404822957fbd808d0405226">dimension</a>-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#a9e42e15bdb23d63ae78137b97a4882de">GetPickupAndDeliveryPairs</a>().size(), {-1, -1});</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span> }</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  </div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span> <span class="keywordtype">void</span> CumulBoundsPropagator::AddArcs(<span class="keywordtype">int</span> first_index, <span class="keywordtype">int</span> second_index,</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> offset) {</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="comment">// Add arc first_index + offset <= second_index</span></div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  outgoing_arcs_[PositiveNode(first_index)].push_back(</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  {PositiveNode(second_index), offset});</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  AddNodeToQueue(PositiveNode(first_index));</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="comment">// Add arc -second_index + transit <= -first_index</span></div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  outgoing_arcs_[NegativeNode(second_index)].push_back(</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  {NegativeNode(first_index), offset});</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  AddNodeToQueue(NegativeNode(second_index));</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span> }</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  </div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="keywordtype">bool</span> CumulBoundsPropagator::InitializeArcsAndBounds(</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_offset) {</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  propagated_bounds_.assign(num_nodes_, <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>);</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  </div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keywordflow">for</span> (std::vector<ArcInfo>& arcs : outgoing_arcs_) {</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  arcs.clear();</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>  </div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  RoutingModel* <span class="keyword">const</span> <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a> = dimension_.<a class="code" href="classoperations__research_1_1_routing_dimension.html#a35a576bb3ea6814f122593d44a3c391e">model</a>();</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  std::vector<int64>& <a class="code" href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a> = propagated_bounds_;</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  </div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->vehicles(); vehicle++) {</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& transit_accessor =</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  dimension_.<a class="code" href="classoperations__research_1_1_routing_dimension.html#aae1962408e06dbb45f6e5ee67e530880">transit_evaluator</a>(vehicle);</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>  <span class="keywordtype">int</span> node = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Start(vehicle);</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_lb, cumul_ub;</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordflow">if</span> (!GetCumulBoundsWithOffset(dimension_, node, cumul_offset, &cumul_lb,</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  &cumul_ub)) {</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  }</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <a class="code" href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a>[PositiveNode(node)] = cumul_lb;</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordflow">if</span> (cumul_ub < <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>) {</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <a class="code" href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a>[NegativeNode(node)] = -cumul_ub;</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  }</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  </div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordflow">if</span> (<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->IsEnd(node)) {</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  }</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  </div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = next_accessor(node);</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> transit = transit_accessor(node, <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keyword">const</span> IntVar& slack_var = *dimension_.<a class="code" href="classoperations__research_1_1_routing_dimension.html#ac300c6449a65333961d8abdd7ce40a7a">SlackVar</a>(node);</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="comment">// node + transit + slack_var == next</span></div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="comment">// Add arcs for node + transit + slack_min <= next</span></div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  AddArcs(node, <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(transit, slack_var.Min()));</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keywordflow">if</span> (slack_var.Max() < <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>) {</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="comment">// Add arcs for node + transit + slack_max >= next.</span></div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  AddArcs(<a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, node, <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(-slack_var.Max(), transit));</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  }</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  </div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  node = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  }</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  </div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="comment">// Add vehicle span upper bound: end - span_ub <= start.</span></div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> span_ub = dimension_.<a class="code" href="classoperations__research_1_1_routing_dimension.html#affe684b0df382fbf2b5eda869ec0c271">GetSpanUpperBoundForVehicle</a>(vehicle);</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">if</span> (span_ub < <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>) {</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  AddArcs(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->End(vehicle), <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Start(vehicle), -span_ub);</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  }</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  </div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="comment">// Set pickup/delivery limits on route.</span></div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  std::vector<int> visited_pairs;</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  StoreVisitedPickupDeliveryPairsOnRoute(</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  dimension_, vehicle, next_accessor, &visited_pairs,</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  &visited_pickup_delivery_indices_for_pair_);</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pair_index : visited_pairs) {</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup_index =</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  visited_pickup_delivery_indices_for_pair_[pair_index].first;</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery_index =</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  visited_pickup_delivery_indices_for_pair_[pair_index].second;</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  visited_pickup_delivery_indices_for_pair_[pair_index] = {-1, -1};</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  </div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(pickup_index, 0);</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordflow">if</span> (delivery_index < 0) {</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="comment">// We didn't encounter a delivery for this pickup.</span></div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keywordflow">continue</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"> 315</span>  </div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> limit = dimension_.<a class="code" href="classoperations__research_1_1_routing_dimension.html#aa70f385bdf5fc31eec8a848dea13b357">GetPickupToDeliveryLimitForPair</a>(</div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  pair_index, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetPickupIndexPairs(pickup_index)[0].second,</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetDeliveryIndexPairs(delivery_index)[0].second);</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keywordflow">if</span> (limit < <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>) {</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="comment">// delivery_cumul - limit <= pickup_cumul.</span></div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  AddArcs(delivery_index, pickup_index, -limit);</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  }</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  }</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  }</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  </div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> RoutingDimension::NodePrecedence& precedence :</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  dimension_.<a class="code" href="classoperations__research_1_1_routing_dimension.html#ae4b40d046de51f0ace9138a3692b0090">GetNodePrecedences</a>()) {</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> first_index = precedence.first_node;</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> second_index = precedence.second_node;</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keywordflow">if</span> (<a class="code" href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a>[PositiveNode(first_index)] == <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a> ||</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <a class="code" href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a>[PositiveNode(second_index)] == <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>) {</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="comment">// One of the nodes is unperformed, so the precedence rule doesn't apply.</span></div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  }</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  AddArcs(first_index, second_index, precedence.offset);</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>  </div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span> }</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  </div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span> <span class="keywordtype">bool</span> CumulBoundsPropagator::UpdateCurrentLowerBoundOfNode(<span class="keywordtype">int</span> node,</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> new_lb,</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> offset) {</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> cumul_var_index = node / 2;</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  </div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordflow">if</span> (node == PositiveNode(cumul_var_index)) {</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="comment">// new_lb is a lower bound of the cumul of variable 'cumul_var_index'.</span></div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  propagated_bounds_[node] = GetFirstPossibleValueForCumulWithOffset(</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  dimension_, cumul_var_index, new_lb, offset);</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="comment">// -new_lb is an upper bound of the cumul of variable 'cumul_var_index'.</span></div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> new_ub = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(0, new_lb);</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  propagated_bounds_[node] =</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(0, GetLastPossibleValueForCumulWithOffset(</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  dimension_, cumul_var_index, new_ub, offset));</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  }</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>  <span class="comment">// Test that the lower/upper bounds do not cross each other.</span></div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_lower_bound =</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  propagated_bounds_[PositiveNode(cumul_var_index)];</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  </div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> negated_cumul_upper_bound =</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  propagated_bounds_[NegativeNode(cumul_var_index)];</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  </div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(negated_cumul_upper_bound, cumul_lower_bound) <= 0;</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span> }</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  </div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span> <span class="keywordtype">bool</span> CumulBoundsPropagator::DisassembleSubtree(<span class="keywordtype">int</span> source, <span class="keywordtype">int</span> target) {</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  tmp_dfs_stack_.clear();</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  tmp_dfs_stack_.push_back(source);</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keywordflow">while</span> (!tmp_dfs_stack_.empty()) {</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a> = tmp_dfs_stack_.back();</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  tmp_dfs_stack_.pop_back();</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> ArcInfo& arc : outgoing_arcs_[<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>]) {</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> child_node = arc.head;</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keywordflow">if</span> (tree_parent_node_of_[child_node] != <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keywordflow">if</span> (child_node == target) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  tree_parent_node_of_[child_node] = kParentToBePropagated;</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  tmp_dfs_stack_.push_back(child_node);</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  }</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  }</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</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>  </div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cumul_bounds_propagator.html#a54688e4af975568b0bce87cdf9f26781"> 385</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_cumul_bounds_propagator.html#a54688e4af975568b0bce87cdf9f26781">CumulBoundsPropagator::PropagateCumulBounds</a>(</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_offset) {</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  tree_parent_node_of_.assign(num_nodes_, kNoParent);</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(std::none_of(node_in_queue_.begin(), node_in_queue_.end(),</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  [](<span class="keywordtype">bool</span> <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) { return b; }));</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(bf_queue_.empty());</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  </div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keywordflow">if</span> (!InitializeArcsAndBounds(next_accessor, cumul_offset)) {</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keywordflow">return</span> CleanupAndReturnFalse();</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  }</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  </div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  std::vector<int64>& current_lb = propagated_bounds_;</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  </div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="comment">// Bellman-Ford-Tarjan algorithm.</span></div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keywordflow">while</span> (!bf_queue_.empty()) {</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> node = bf_queue_.front();</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  bf_queue_.pop_front();</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  node_in_queue_[node] = <span class="keyword">false</span>;</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">if</span> (tree_parent_node_of_[node] == kParentToBePropagated) {</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="comment">// The parent of this node is still in the queue, so no need to process</span></div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="comment">// node now, since it will be re-enqued when its parent is processed.</span></div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  }</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  </div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> lower_bound = current_lb[node];</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> ArcInfo& arc : outgoing_arcs_[node]) {</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="comment">// NOTE: kint64min as a lower bound means no lower bound at all, so we</span></div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="comment">// don't use this value to propagate.</span></div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> induced_lb = (lower_bound == <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>)</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  ? <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a></div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  : <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(lower_bound, arc.offset);</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  </div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> head_node = arc.head;</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keywordflow">if</span> (induced_lb <= current_lb[head_node]) {</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="comment">// No update necessary for the head_node, continue to next children of</span></div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="comment">// node.</span></div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keywordflow">continue</span>;</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>  <span class="keywordflow">if</span> (!UpdateCurrentLowerBoundOfNode(head_node, induced_lb, cumul_offset) ||</div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  !DisassembleSubtree(head_node, node)) {</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="comment">// The new lower bound is infeasible, or a positive cycle was detected</span></div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="comment">// in the precedence graph by DisassembleSubtree().</span></div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keywordflow">return</span> CleanupAndReturnFalse();</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  }</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  </div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  tree_parent_node_of_[head_node] = node;</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  AddNodeToQueue(head_node);</div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  }</div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  }</div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</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"><a class="line" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a5967f72ac911a2ed971a1ce103d1c47b"> 438</a></span> <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a5967f72ac911a2ed971a1ce103d1c47b">DimensionCumulOptimizerCore::DimensionCumulOptimizerCore</a>(</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* dimension, <span class="keywordtype">bool</span> use_precedence_propagator)</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  : dimension_(dimension),</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  visited_pickup_delivery_indices_for_pair_(</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  dimension-><a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->GetPickupAndDeliveryPairs().size(), {-1, -1}) {</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="keywordflow">if</span> (use_precedence_propagator) {</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  propagator_ = absl::make_unique<CumulBoundsPropagator>(dimension);</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  }</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keywordflow">if</span> (dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a6debc638c02bfb2b4afe0afccdd98ca5">HasBreakConstraints</a>()) {</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="comment">// Initialize vehicle_to_first_index_ so the variables of the breaks of</span></div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="comment">// vehicle v are stored from vehicle_to_first_index_[v] to</span></div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="comment">// vehicle_to_first_index_[v+1] - 1.</span></div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vehicles = dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a35a576bb3ea6814f122593d44a3c391e">model</a>()-><a class="code" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>();</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  vehicle_to_all_break_variables_offset_.reserve(num_vehicles);</div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keywordtype">int</span> num_break_vars = 0;</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < num_vehicles; ++vehicle) {</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  vehicle_to_all_break_variables_offset_.push_back(num_break_vars);</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& intervals = dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle);</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  num_break_vars += 2 * intervals.size(); <span class="comment">// 2 variables per break.</span></div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  }</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  all_break_variables_.resize(num_break_vars, -1);</div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  }</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span> }</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  </div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#aa24fe74f74450fedf90dce6611f45f17"> 462</a></span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#aa24fe74f74450fedf90dce6611f45f17">DimensionCumulOptimizerCore::OptimizeSingleRoute</a>(</div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver, std::vector<int64>* cumul_values,</div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  std::vector<int64>* break_values, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* transit_cost,</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="keywordtype">bool</span> clear_lp) {</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  InitOptimizer(solver);</div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="comment">// Make sure SetRouteCumulConstraints will properly set the cumul bounds by</span></div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="comment">// looking at this route only.</span></div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(propagator_ == <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  </div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <span class="keyword">const</span> <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a> = <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>()-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a35a576bb3ea6814f122593d44a3c391e">model</a>();</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> optimize_vehicle_costs =</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  (cumul_values != <span class="keyword">nullptr</span> || <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a> != <span class="keyword">nullptr</span>) &&</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  (!<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->IsEnd(next_accessor(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Start(vehicle))) ||</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->AreEmptyRouteCostsConsideredForVehicle(vehicle));</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_offset =</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a82f14203d850d1ede49849c5020c6f51">GetLocalOptimizerOffsetForVehicle</a>(vehicle);</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cost_offset = 0;</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="keywordflow">if</span> (!SetRouteCumulConstraints(vehicle, next_accessor, cumul_offset,</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  optimize_vehicle_costs, solver, transit_cost,</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  &cost_offset)) {</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>;</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  }</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> status =</div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#acb5447abf2fd0ef52e46ce561ffef5cb">Solve</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->RemainingTime());</div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="keywordflow">if</span> (status == <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keywordflow">return</span> status;</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  }</div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  </div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  SetValuesFromLP(current_route_cumul_variables_, cumul_offset, solver,</div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  cumul_values);</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  SetValuesFromLP(current_route_break_variables_, cumul_offset, solver,</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  break_values);</div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="keywordflow">if</span> (<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a> != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  *<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a> = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(cost_offset, solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a4d08d6a3c275615e7127461d28090923">GetObjectiveValue</a>());</div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  }</div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  </div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keywordflow">if</span> (clear_lp) {</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa5b31c976cc6734003d9950e731dfed3">Clear</a>();</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  }</div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keywordflow">return</span> status;</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span> }</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  </div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a730ec73f0aaf770badb796973a909dd2"> 505</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a730ec73f0aaf770badb796973a909dd2">DimensionCumulOptimizerCore::Optimize</a>(</div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver, std::vector<int64>* cumul_values,</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  std::vector<int64>* break_values, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* transit_cost,</div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keywordtype">bool</span> clear_lp) {</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  InitOptimizer(solver);</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  </div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="comment">// If both "cumul_values" and "cost" parameters are null, we don't try to</span></div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="comment">// optimize the cost and stop at the first feasible solution.</span></div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> optimize_costs = (cumul_values != <span class="keyword">nullptr</span>) || (<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a> != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keywordtype">bool</span> has_vehicles_being_optimized = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  </div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_offset = dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a375d5aec667421cb92f6439464420062">GetGlobalOptimizerOffset</a>();</div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  </div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="keywordflow">if</span> (propagator_ != <span class="keyword">nullptr</span> &&</div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  !propagator_->PropagateCumulBounds(next_accessor, cumul_offset)) {</div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  }</div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  </div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> total_transit_cost = 0;</div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> total_cost_offset = 0;</div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a> = <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>()-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a35a576bb3ea6814f122593d44a3c391e">model</a>();</div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->vehicles(); vehicle++) {</div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> route_transit_cost = 0;</div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> route_cost_offset = 0;</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> optimize_vehicle_costs =</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  optimize_costs &&</div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  (!<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->IsEnd(next_accessor(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Start(vehicle))) ||</div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->AreEmptyRouteCostsConsideredForVehicle(vehicle));</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keywordflow">if</span> (!SetRouteCumulConstraints(vehicle, next_accessor, cumul_offset,</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  optimize_vehicle_costs, solver,</div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  &route_transit_cost, &route_cost_offset)) {</div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  }</div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  total_transit_cost = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(total_transit_cost, route_transit_cost);</div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  total_cost_offset = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(total_cost_offset, route_cost_offset);</div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  has_vehicles_being_optimized |= optimize_vehicle_costs;</div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  }</div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="keywordflow">if</span> (transit_cost != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  *transit_cost = total_transit_cost;</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  }</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>  SetGlobalConstraints(has_vehicles_being_optimized, solver);</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  </div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keywordflow">if</span> (solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#acb5447abf2fd0ef52e46ce561ffef5cb">Solve</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->RemainingTime()) ==</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  }</div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  </div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  SetValuesFromLP(index_to_cumul_variable_, cumul_offset, solver, cumul_values);</div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  SetValuesFromLP(all_break_variables_, cumul_offset, solver, break_values);</div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  </div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keywordflow">if</span> (<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a> != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  *<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a> = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a4d08d6a3c275615e7127461d28090923">GetObjectiveValue</a>(), total_cost_offset);</div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  }</div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  </div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="keywordflow">if</span> (clear_lp) {</div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa5b31c976cc6734003d9950e731dfed3">Clear</a>();</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  }</div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="keywordflow">return</span> <span class="keyword">true</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>  </div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a251eb2e91129b8df8fb7dade1e2a68c6"> 567</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a251eb2e91129b8df8fb7dade1e2a68c6">DimensionCumulOptimizerCore::OptimizeAndPack</a>(</div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver, std::vector<int64>* cumul_values,</div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  std::vector<int64>* break_values) {</div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="comment">// Note: We pass a non-nullptr cost to the Optimize() method so the costs are</span></div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="comment">// optimized by the LP.</span></div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a> = 0;</div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a730ec73f0aaf770badb796973a909dd2">Optimize</a>(next_accessor, solver,</div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="comment">/*cumul_values=*/</span><span class="keyword">nullptr</span>, <span class="comment">/*break_values=*/</span><span class="keyword">nullptr</span>, &<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>,</div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="comment">/*transit_cost=*/</span><span class="keyword">nullptr</span>, <span class="comment">/*clear_lp=*/</span><span class="keyword">false</span>)) {</div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  }</div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  </div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  std::vector<int> vehicles(<a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a6769f38bbc3271d45b0512c12ef31f70">dimension</a>()-><a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->vehicles());</div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  std::iota(vehicles.begin(), vehicles.end(), 0);</div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="keywordflow">if</span> (PackRoutes(std::move(vehicles), solver) ==</div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  }</div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> global_offset = dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a375d5aec667421cb92f6439464420062">GetGlobalOptimizerOffset</a>();</div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  SetValuesFromLP(index_to_cumul_variable_, global_offset, solver,</div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  cumul_values);</div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  SetValuesFromLP(all_break_variables_, global_offset, solver, break_values);</div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa5b31c976cc6734003d9950e731dfed3">Clear</a>();</div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</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>  </div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a></div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a74b47a791351de6312aefe2d0524688f"> 595</a></span> <a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a74b47a791351de6312aefe2d0524688f">DimensionCumulOptimizerCore::OptimizeAndPackSingleRoute</a>(</div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver, std::vector<int64>* cumul_values,</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  std::vector<int64>* break_values) {</div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="comment">// Note: We pass a non-nullptr cost to the OptimizeSingleRoute() method so the</span></div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="comment">// costs are optimized by the LP.</span></div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a> = 0;</div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#aa24fe74f74450fedf90dce6611f45f17">OptimizeSingleRoute</a>(vehicle, next_accessor, solver,</div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="comment">/*cumul_values=*/</span><span class="keyword">nullptr</span>, <span class="comment">/*break_values=*/</span><span class="keyword">nullptr</span>,</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  &<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>, <span class="comment">/*transit_cost=*/</span><span class="keyword">nullptr</span>,</div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <span class="comment">/*clear_lp=*/</span><span class="keyword">false</span>) ==</div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>;</div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  }</div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> status = PackRoutes({vehicle}, solver);</div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="keywordflow">if</span> (status == <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>;</div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  }</div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> local_offset =</div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a82f14203d850d1ede49849c5020c6f51">GetLocalOptimizerOffsetForVehicle</a>(vehicle);</div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  SetValuesFromLP(current_route_cumul_variables_, local_offset, solver,</div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  cumul_values);</div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  SetValuesFromLP(current_route_break_variables_, local_offset, solver,</div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  break_values);</div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa5b31c976cc6734003d9950e731dfed3">Clear</a>();</div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="keywordflow">return</span> status;</div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span> }</div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  </div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> DimensionCumulOptimizerCore::PackRoutes(</div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  std::vector<int> vehicles, <a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver) {</div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a> = dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a35a576bb3ea6814f122593d44a3c391e">model</a>();</div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  </div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="comment">// NOTE(user): Given our constraint matrix, our problem *should* always</span></div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="comment">// have an integer optimal solution, in which case we can round to the nearest</span></div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="comment">// integer both for the objective constraint bound (returned by</span></div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="comment">// GetObjectiveValue()) and the end cumul variable bound after minimizing</span></div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="comment">// (see b/154381899 showcasing an example where std::ceil leads to an</span></div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="comment">// "imperfect" packing due to rounding precision errors).</span></div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="comment">// If this DCHECK ever fails, it can be removed but the code below should be</span></div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  <span class="comment">// adapted to have a 2-phase approach, solving once with the rounded value as</span></div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="comment">// bound and if this fails, solve again using std::ceil.</span></div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af1eb90688746692ec522c88d501bd598">SolutionIsInteger</a>());</div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  </div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="comment">// Minimize the route end times without increasing the cost.</span></div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> objective_ct =</div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a1923407036f149ea2c31ac37c11e1337">CreateNewConstraint</a>(0, solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a4d08d6a3c275615e7127461d28090923">GetObjectiveValue</a>());</div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  </div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> variable = 0; variable < solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a155f6032f05d373d7375078c1be4a01b">NumVariables</a>(); variable++) {</div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a> = solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a4812d528a6d93d471be496e9ca79c820">GetObjectiveCoefficient</a>(variable);</div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="keywordflow">if</span> (<a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a> != 0) {</div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a01ce5bca7f91b37ff459b4d7b63e5190">SetCoefficient</a>(objective_ct, variable, <a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a>);</div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  }</div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  }</div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ab8bd6c2ebc0fe292221efda5c39de361">ClearObjective</a>();</div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle : vehicles) {</div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad56b5d5264e07b44be873dfdcd29cb8e">SetObjectiveCoefficient</a>(</div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  index_to_cumul_variable_[<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->End(vehicle)], 1);</div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  }</div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  </div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="keywordflow">if</span> (solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#acb5447abf2fd0ef52e46ce561ffef5cb">Solve</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->RemainingTime()) ==</div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>;</div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  }</div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  </div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <span class="comment">// Maximize the route start times without increasing the cost or the route end</span></div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="comment">// times.</span></div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ab8bd6c2ebc0fe292221efda5c39de361">ClearObjective</a>();</div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle : vehicles) {</div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> end_cumul_var = index_to_cumul_variable_[<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->End(vehicle)];</div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  <span class="comment">// end_cumul_var <= solver.GetValue(end_cumul_var)</span></div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a9e2ef65ea95577f9df6ba20c43813573">SetVariableBounds</a>(</div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  end_cumul_var, solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a7bdd4be7fd06d5c445403fdf3de0eeda">GetVariableLowerBound</a>(end_cumul_var),</div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <a class="code" href="classoperations__research_1_1_math_util.html#aec89d533eea50ada5268533f068f97ec">MathUtil::FastInt64Round</a>(solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ac154a773600edab5f5fbc597c5639cce">GetValue</a>(end_cumul_var)));</div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  </div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="comment">// Maximize the starts of the routes.</span></div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad56b5d5264e07b44be873dfdcd29cb8e">SetObjectiveCoefficient</a>(</div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  index_to_cumul_variable_[<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Start(vehicle)], -1);</div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  }</div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="keywordflow">return</span> solver-><a class="code" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#acb5447abf2fd0ef52e46ce561ffef5cb">Solve</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->RemainingTime());</div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span> }</div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  </div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span> <span class="keywordtype">void</span> DimensionCumulOptimizerCore::InitOptimizer(</div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  RoutingLinearSolverWrapper* solver) {</div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  solver->Clear();</div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  index_to_cumul_variable_.assign(dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a1b6f521fdc9dff38b7e065c838fa54a3">cumuls</a>().size(), -1);</div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  max_end_cumul_ = solver->CreateNewPositiveVariable();</div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  min_start_cumul_ = solver->CreateNewPositiveVariable();</div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span> }</div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  </div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span> <span class="keywordtype">bool</span> DimensionCumulOptimizerCore::ComputeRouteCumulBounds(</div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="keyword">const</span> std::vector<int64>& route, <span class="keyword">const</span> std::vector<int64>& fixed_transits,</div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_offset) {</div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> route_size = route.size();</div>
|
|
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  current_route_min_cumuls_.resize(route_size);</div>
|
|
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  current_route_max_cumuls_.resize(route_size);</div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="keywordflow">if</span> (propagator_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = 0; pos < route_size; pos++) {</div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> node = route[pos];</div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  current_route_min_cumuls_[pos] = propagator_->CumulMin(node);</div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(current_route_min_cumuls_[pos], 0);</div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  current_route_max_cumuls_[pos] = propagator_->CumulMax(node);</div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(current_route_max_cumuls_[pos], current_route_min_cumuls_[pos]);</div>
|
|
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  }</div>
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  }</div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  </div>
|
|
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  <span class="comment">// Extract cumul min/max and fixed transits from CP.</span></div>
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = 0; pos < route_size; ++pos) {</div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="keywordflow">if</span> (!GetCumulBoundsWithOffset(*dimension_, route[pos], cumul_offset,</div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  &current_route_min_cumuls_[pos],</div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  &current_route_max_cumuls_[pos])) {</div>
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  }</div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  }</div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  </div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <span class="comment">// Refine cumul bounds using</span></div>
|
|
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <span class="comment">// cumul[i+1] >= cumul[i] + fixed_transit[i] + slack[i].</span></div>
|
|
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = 1; pos < route_size; ++pos) {</div>
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> slack_min = dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#ac300c6449a65333961d8abdd7ce40a7a">SlackVar</a>(route[pos - 1])-><a class="code" href="classoperations__research_1_1_int_expr.html#ac4a4f30badcd311075302a4efcfaee0a">Min</a>();</div>
|
|
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  current_route_min_cumuls_[pos] = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(</div>
|
|
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  current_route_min_cumuls_[pos],</div>
|
|
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(</div>
|
|
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(current_route_min_cumuls_[pos - 1], fixed_transits[pos - 1]),</div>
|
|
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  slack_min));</div>
|
|
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  current_route_min_cumuls_[pos] = GetFirstPossibleValueForCumulWithOffset(</div>
|
|
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  *dimension_, route[pos], current_route_min_cumuls_[pos], cumul_offset);</div>
|
|
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <span class="keywordflow">if</span> (current_route_min_cumuls_[pos] > current_route_max_cumuls_[pos]) {</div>
|
|
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  }</div>
|
|
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  }</div>
|
|
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  </div>
|
|
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = route_size - 2; pos >= 0; --pos) {</div>
|
|
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <span class="comment">// If cumul_max[pos+1] is kint64max, it will be translated to</span></div>
|
|
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="comment">// double +infinity, so it must not constrain cumul_max[pos].</span></div>
|
|
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="keywordflow">if</span> (current_route_max_cumuls_[pos + 1] < <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>) {</div>
|
|
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> slack_min = dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#ac300c6449a65333961d8abdd7ce40a7a">SlackVar</a>(route[pos])-><a class="code" href="classoperations__research_1_1_int_expr.html#ac4a4f30badcd311075302a4efcfaee0a">Min</a>();</div>
|
|
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  current_route_max_cumuls_[pos] = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(</div>
|
|
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  current_route_max_cumuls_[pos],</div>
|
|
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(</div>
|
|
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(current_route_max_cumuls_[pos + 1], fixed_transits[pos]),</div>
|
|
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  slack_min));</div>
|
|
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  current_route_max_cumuls_[pos] = GetLastPossibleValueForCumulWithOffset(</div>
|
|
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  *dimension_, route[pos], current_route_max_cumuls_[pos],</div>
|
|
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  cumul_offset);</div>
|
|
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  <span class="keywordflow">if</span> (current_route_max_cumuls_[pos] < current_route_min_cumuls_[pos]) {</div>
|
|
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  }</div>
|
|
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  }</div>
|
|
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  }</div>
|
|
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span> }</div>
|
|
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  </div>
|
|
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span> <span class="keywordtype">bool</span> DimensionCumulOptimizerCore::SetRouteCumulConstraints(</div>
|
|
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> cumul_offset, <span class="keywordtype">bool</span> optimize_costs, RoutingLinearSolverWrapper* solver,</div>
|
|
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* route_transit_cost, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* route_cost_offset) {</div>
|
|
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  RoutingModel* <span class="keyword">const</span> <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a> = dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a35a576bb3ea6814f122593d44a3c391e">model</a>();</div>
|
|
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <span class="comment">// Extract the vehicle's path from next_accessor.</span></div>
|
|
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  std::vector<int64> path;</div>
|
|
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  {</div>
|
|
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="keywordtype">int</span> node = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Start(vehicle);</div>
|
|
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  path.push_back(node);</div>
|
|
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="keywordflow">while</span> (!<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->IsEnd(node)) {</div>
|
|
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  node = next_accessor(node);</div>
|
|
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  path.push_back(node);</div>
|
|
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  }</div>
|
|
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(path.size(), 2);</div>
|
|
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  }</div>
|
|
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> path_size = path.size();</div>
|
|
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  </div>
|
|
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  std::vector<int64> fixed_transit(path_size - 1);</div>
|
|
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  {</div>
|
|
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& transit_accessor =</div>
|
|
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#aae1962408e06dbb45f6e5ee67e530880">transit_evaluator</a>(vehicle);</div>
|
|
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = 1; pos < path_size; ++pos) {</div>
|
|
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  fixed_transit[pos - 1] = transit_accessor(path[pos - 1], path[pos]);</div>
|
|
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  }</div>
|
|
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  }</div>
|
|
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  </div>
|
|
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="keywordflow">if</span> (!ComputeRouteCumulBounds(path, fixed_transit, cumul_offset)) {</div>
|
|
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  }</div>
|
|
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  </div>
|
|
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <span class="comment">// LP Model variables, current_route_cumul_variables_ and lp_slacks.</span></div>
|
|
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  <span class="comment">// Create LP variables for cumuls.</span></div>
|
|
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  std::vector<int>& lp_cumuls = current_route_cumul_variables_;</div>
|
|
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  lp_cumuls.assign(path_size, -1);</div>
|
|
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = 0; pos < path_size; ++pos) {</div>
|
|
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> lp_cumul = solver->CreateNewPositiveVariable();</div>
|
|
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  index_to_cumul_variable_[path[pos]] = lp_cumul;</div>
|
|
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  lp_cumuls[pos] = lp_cumul;</div>
|
|
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <span class="keywordflow">if</span> (!solver->SetVariableBounds(lp_cumul, current_route_min_cumuls_[pos],</div>
|
|
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  current_route_max_cumuls_[pos])) {</div>
|
|
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  }</div>
|
|
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  <span class="keyword">const</span> SortedDisjointIntervalList& forbidden =</div>
|
|
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#aff15c149ac7cbb96d340d8c1370d5aea">forbidden_intervals</a>()[path[pos]];</div>
|
|
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="keywordflow">if</span> (forbidden.NumIntervals() > 0) {</div>
|
|
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  std::vector<int64> starts;</div>
|
|
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  std::vector<int64> ends;</div>
|
|
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> ClosedInterval <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> :</div>
|
|
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#acf39f330b220a62bbb8fac9c8c1256b5">GetAllowedIntervalsInRange</a>(</div>
|
|
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  path[pos], <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(current_route_min_cumuls_[pos], cumul_offset),</div>
|
|
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(current_route_max_cumuls_[pos], cumul_offset))) {</div>
|
|
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  starts.push_back(<a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.start, cumul_offset));</div>
|
|
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  ends.push_back(<a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.end, cumul_offset));</div>
|
|
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  }</div>
|
|
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  solver->SetVariableDisjointBounds(lp_cumul, starts, ends);</div>
|
|
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  }</div>
|
|
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  }</div>
|
|
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  <span class="comment">// Create LP variables for slacks.</span></div>
|
|
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  std::vector<int> lp_slacks(path_size - 1, -1);</div>
|
|
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = 0; pos < path_size - 1; ++pos) {</div>
|
|
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="keyword">const</span> IntVar* cp_slack = dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#ac300c6449a65333961d8abdd7ce40a7a">SlackVar</a>(path[pos]);</div>
|
|
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  lp_slacks[pos] = solver->CreateNewPositiveVariable();</div>
|
|
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="keywordflow">if</span> (!solver->SetVariableBounds(lp_slacks[pos], cp_slack->Min(),</div>
|
|
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  cp_slack->Max())) {</div>
|
|
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  }</div>
|
|
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  }</div>
|
|
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  </div>
|
|
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  <span class="comment">// LP Model constraints and costs.</span></div>
|
|
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  <span class="comment">// Add all path constraints to LP:</span></div>
|
|
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  <span class="comment">// cumul[i] + fixed_transit[i] + slack[i] == cumul[i+1]</span></div>
|
|
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <span class="comment">// <=> fixed_transit[i] == cumul[i+1] - cumul[i] - slack[i].</span></div>
|
|
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = 0; pos < path_size - 1; ++pos) {</div>
|
|
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> =</div>
|
|
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  solver->CreateNewConstraint(fixed_transit[pos], fixed_transit[pos]);</div>
|
|
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  solver->SetCoefficient(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, lp_cumuls[pos + 1], 1);</div>
|
|
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  solver->SetCoefficient(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, lp_cumuls[pos], -1);</div>
|
|
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  solver->SetCoefficient(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, lp_slacks[pos], -1);</div>
|
|
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  }</div>
|
|
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  <span class="keywordflow">if</span> (route_cost_offset != <span class="keyword">nullptr</span>) *route_cost_offset = 0;</div>
|
|
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  <span class="keywordflow">if</span> (optimize_costs) {</div>
|
|
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  <span class="comment">// Add soft upper bounds.</span></div>
|
|
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = 0; pos < path_size; ++pos) {</div>
|
|
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="keywordflow">if</span> (!dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#aea64f6b7cb80887be5478c35609cab1c">HasCumulVarSoftUpperBound</a>(path[pos])) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="expr__array_8cc.html#a9976b6c2a10f63541b5ebefe9455c137">coef</a> =</div>
|
|
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#af362b70cab1a5a90703808e9575c2f54">GetCumulVarSoftUpperBoundCoefficient</a>(path[pos]);</div>
|
|
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a9976b6c2a10f63541b5ebefe9455c137">coef</a> == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a> = dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#aacc17c3711ac030db624e72c5ae2394f">GetCumulVarSoftUpperBound</a>(path[pos]);</div>
|
|
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  <span class="keywordflow">if</span> (<a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a> < cumul_offset && route_cost_offset != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  <span class="comment">// Add coef * (cumul_offset - bound) to the cost offset.</span></div>
|
|
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  *route_cost_offset = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(*route_cost_offset,</div>
|
|
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(<a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(cumul_offset, <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a>), <a class="code" href="expr__array_8cc.html#a9976b6c2a10f63541b5ebefe9455c137">coef</a>));</div>
|
|
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  }</div>
|
|
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a> = std::max<int64>(0, <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(<a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a>, cumul_offset));</div>
|
|
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="keywordflow">if</span> (current_route_max_cumuls_[pos] <= <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a>) {</div>
|
|
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <span class="comment">// constraint is never violated.</span></div>
|
|
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  }</div>
|
|
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> soft_ub_diff = solver->CreateNewPositiveVariable();</div>
|
|
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  solver->SetObjectiveCoefficient(soft_ub_diff, <a class="code" href="expr__array_8cc.html#a9976b6c2a10f63541b5ebefe9455c137">coef</a>);</div>
|
|
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="comment">// cumul - soft_ub_diff <= bound.</span></div>
|
|
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver->CreateNewConstraint(<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>, <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a>);</div>
|
|
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  solver->SetCoefficient(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, lp_cumuls[pos], 1);</div>
|
|
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  solver->SetCoefficient(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, soft_ub_diff, -1);</div>
|
|
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  }</div>
|
|
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  <span class="comment">// Add soft lower bounds.</span></div>
|
|
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = 0; pos < path_size; ++pos) {</div>
|
|
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  <span class="keywordflow">if</span> (!dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a54e75670bdbf7abca93c9e02cfee83fe">HasCumulVarSoftLowerBound</a>(path[pos])) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="expr__array_8cc.html#a9976b6c2a10f63541b5ebefe9455c137">coef</a> =</div>
|
|
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a51eadbd617f6658396e5ba790f6b0c19">GetCumulVarSoftLowerBoundCoefficient</a>(path[pos]);</div>
|
|
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a9976b6c2a10f63541b5ebefe9455c137">coef</a> == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a> = std::max<int64>(</div>
|
|
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  0, <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a607df50e6bc0dc54fbe811e96155ee95">GetCumulVarSoftLowerBound</a>(path[pos]),</div>
|
|
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  cumul_offset));</div>
|
|
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  <span class="keywordflow">if</span> (current_route_min_cumuls_[pos] >= <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a>) {</div>
|
|
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  <span class="comment">// constraint is never violated.</span></div>
|
|
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  }</div>
|
|
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> soft_lb_diff = solver->CreateNewPositiveVariable();</div>
|
|
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  solver->SetObjectiveCoefficient(soft_lb_diff, <a class="code" href="expr__array_8cc.html#a9976b6c2a10f63541b5ebefe9455c137">coef</a>);</div>
|
|
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  <span class="comment">// bound - cumul <= soft_lb_diff</span></div>
|
|
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver->CreateNewConstraint(<a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a>, <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>);</div>
|
|
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  solver->SetCoefficient(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, lp_cumuls[pos], 1);</div>
|
|
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  solver->SetCoefficient(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, soft_lb_diff, 1);</div>
|
|
<div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  }</div>
|
|
<div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  }</div>
|
|
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  <span class="comment">// Add pickup and delivery limits.</span></div>
|
|
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  std::vector<int> visited_pairs;</div>
|
|
<div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  StoreVisitedPickupDeliveryPairsOnRoute(</div>
|
|
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  *dimension_, vehicle, next_accessor, &visited_pairs,</div>
|
|
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  &visited_pickup_delivery_indices_for_pair_);</div>
|
|
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pair_index : visited_pairs) {</div>
|
|
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pickup_index =</div>
|
|
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  visited_pickup_delivery_indices_for_pair_[pair_index].first;</div>
|
|
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> delivery_index =</div>
|
|
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  visited_pickup_delivery_indices_for_pair_[pair_index].second;</div>
|
|
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  visited_pickup_delivery_indices_for_pair_[pair_index] = {-1, -1};</div>
|
|
<div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  </div>
|
|
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(pickup_index, 0);</div>
|
|
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  <span class="keywordflow">if</span> (delivery_index < 0) {</div>
|
|
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="comment">// We didn't encounter a delivery for this pickup.</span></div>
|
|
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  }</div>
|
|
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  </div>
|
|
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> limit = dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#aa70f385bdf5fc31eec8a848dea13b357">GetPickupToDeliveryLimitForPair</a>(</div>
|
|
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  pair_index, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetPickupIndexPairs(pickup_index)[0].second,</div>
|
|
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetDeliveryIndexPairs(delivery_index)[0].second);</div>
|
|
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  <span class="keywordflow">if</span> (limit < <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>) {</div>
|
|
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="comment">// delivery_cumul - pickup_cumul <= limit.</span></div>
|
|
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver->CreateNewConstraint(<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>, limit);</div>
|
|
<div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  solver->SetCoefficient(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, index_to_cumul_variable_[delivery_index], 1);</div>
|
|
<div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  solver->SetCoefficient(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, index_to_cumul_variable_[pickup_index], -1);</div>
|
|
<div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  }</div>
|
|
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  }</div>
|
|
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  </div>
|
|
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  <span class="comment">// Add span bound constraint.</span></div>
|
|
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> span_bound = dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#affe684b0df382fbf2b5eda869ec0c271">GetSpanUpperBoundForVehicle</a>(vehicle);</div>
|
|
<div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="keywordflow">if</span> (span_bound < <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>) {</div>
|
|
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="comment">// end_cumul - start_cumul <= bound</span></div>
|
|
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver->CreateNewConstraint(<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>, span_bound);</div>
|
|
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  solver->SetCoefficient(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, lp_cumuls.back(), 1);</div>
|
|
<div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  solver->SetCoefficient(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, lp_cumuls.front(), -1);</div>
|
|
<div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  }</div>
|
|
<div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  <span class="comment">// Add span cost.</span></div>
|
|
<div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> span_cost_coef =</div>
|
|
<div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a26d28dacdef6a70d512df1a175429558">GetSpanCostCoefficientForVehicle</a>(vehicle);</div>
|
|
<div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="keywordflow">if</span> (optimize_costs && span_cost_coef > 0) {</div>
|
|
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  solver->SetObjectiveCoefficient(lp_cumuls.back(), span_cost_coef);</div>
|
|
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  solver->SetObjectiveCoefficient(lp_cumuls.front(), -span_cost_coef);</div>
|
|
<div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  }</div>
|
|
<div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  <span class="comment">// Add soft span cost.</span></div>
|
|
<div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  <span class="keywordflow">if</span> (optimize_costs && dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#af0185f7c0ea3abf45191db23514604f3">HasSoftSpanUpperBounds</a>()) {</div>
|
|
<div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  SimpleBoundCosts::BoundCost bound_cost =</div>
|
|
<div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a06257e0b9422e5de00bd4eef03777355">GetSoftSpanUpperBoundForVehicle</a>(vehicle);</div>
|
|
<div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  <span class="keywordflow">if</span> (bound_cost.bound < <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a> && bound_cost.cost > 0) {</div>
|
|
<div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> span_violation = solver->CreateNewPositiveVariable();</div>
|
|
<div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  <span class="comment">// end - start <= bound + span_violation</span></div>
|
|
<div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> violation =</div>
|
|
<div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  solver->CreateNewConstraint(<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>, bound_cost.bound);</div>
|
|
<div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  solver->SetCoefficient(violation, lp_cumuls.back(), 1.0);</div>
|
|
<div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  solver->SetCoefficient(violation, lp_cumuls.front(), -1.0);</div>
|
|
<div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  solver->SetCoefficient(violation, span_violation, -1.0);</div>
|
|
<div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  <span class="comment">// Add span_violation * cost to objective.</span></div>
|
|
<div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  solver->SetObjectiveCoefficient(span_violation, bound_cost.cost);</div>
|
|
<div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  }</div>
|
|
<div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  }</div>
|
|
<div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  <span class="comment">// Add global span constraint.</span></div>
|
|
<div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="keywordflow">if</span> (optimize_costs && dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a1faf1ea53b992b47f60d0622e42f7a50">global_span_cost_coefficient</a>() > 0) {</div>
|
|
<div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  <span class="comment">// min_start_cumul_ <= cumuls[start]</span></div>
|
|
<div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  <span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver->CreateNewConstraint(<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>, 0);</div>
|
|
<div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  solver->SetCoefficient(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, min_start_cumul_, 1);</div>
|
|
<div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  solver->SetCoefficient(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, lp_cumuls.front(), -1);</div>
|
|
<div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  <span class="comment">// max_end_cumul_ >= cumuls[end]</span></div>
|
|
<div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver->CreateNewConstraint(0, <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>);</div>
|
|
<div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  solver->SetCoefficient(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, max_end_cumul_, 1);</div>
|
|
<div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  solver->SetCoefficient(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, lp_cumuls.back(), -1);</div>
|
|
<div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  }</div>
|
|
<div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <span class="comment">// Fill transit cost if specified.</span></div>
|
|
<div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  <span class="keywordflow">if</span> (route_transit_cost != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  <span class="keywordflow">if</span> (optimize_costs && span_cost_coef > 0) {</div>
|
|
<div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> total_fixed_transit = std::accumulate(</div>
|
|
<div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  fixed_transit.begin(), fixed_transit.end(), 0, <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>);</div>
|
|
<div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  *route_transit_cost = <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(total_fixed_transit, span_cost_coef);</div>
|
|
<div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  *route_transit_cost = 0;</div>
|
|
<div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  }</div>
|
|
<div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  }</div>
|
|
<div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  <span class="comment">// For every break that must be inside the route, the duration of that break</span></div>
|
|
<div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  <span class="comment">// must be flowed in the slacks of arcs that can intersect the break.</span></div>
|
|
<div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  <span class="comment">// This LP modelization is correct but not complete:</span></div>
|
|
<div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  <span class="comment">// can miss some cases where the breaks cannot fit.</span></div>
|
|
<div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  <span class="comment">// TODO(user): remove the need for returns in the code below.</span></div>
|
|
<div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  current_route_break_variables_.clear();</div>
|
|
<div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  <span class="keywordflow">if</span> (!dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a6debc638c02bfb2b4afe0afccdd98ca5">HasBreakConstraints</a>()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  <span class="keyword">const</span> std::vector<IntervalVar*>& breaks =</div>
|
|
<div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle);</div>
|
|
<div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_breaks = breaks.size();</div>
|
|
<div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  <span class="comment">// When there are no breaks, only break distance needs to be modeled,</span></div>
|
|
<div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  <span class="comment">// and it reduces to a span maximum.</span></div>
|
|
<div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  <span class="comment">// TODO(user): Also add the case where no breaks can intersect the route.</span></div>
|
|
<div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  <span class="keywordflow">if</span> (num_breaks == 0) {</div>
|
|
<div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> maximum_route_span = <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>;</div>
|
|
<div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& distance_duration :</div>
|
|
<div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a20cb44a14b6119a99fdcef3b594629e8">GetBreakDistanceDurationOfVehicle</a>(vehicle)) {</div>
|
|
<div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  maximum_route_span =</div>
|
|
<div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(maximum_route_span, distance_duration.first);</div>
|
|
<div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  }</div>
|
|
<div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  <span class="keywordflow">if</span> (maximum_route_span < <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>) {</div>
|
|
<div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver->CreateNewConstraint(<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>, maximum_route_span);</div>
|
|
<div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  solver->SetCoefficient(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, lp_cumuls.back(), 1);</div>
|
|
<div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  solver->SetCoefficient(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, lp_cumuls.front(), -1);</div>
|
|
<div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  }</div>
|
|
<div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  }</div>
|
|
<div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  <span class="comment">// Gather visit information: the visit of node i has [start, end) =</span></div>
|
|
<div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  <span class="comment">// [cumul[i] - post_travel[i-1], cumul[i] + pre_travel[i]).</span></div>
|
|
<div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  <span class="comment">// Breaks cannot overlap those visit intervals.</span></div>
|
|
<div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  std::vector<int64> pre_travel(path_size - 1, 0);</div>
|
|
<div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  std::vector<int64> post_travel(path_size - 1, 0);</div>
|
|
<div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  {</div>
|
|
<div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> pre_travel_index =</div>
|
|
<div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a8e93e99ce491f2779c0d2e5e7de5a98a">GetPreTravelEvaluatorOfVehicle</a>(vehicle);</div>
|
|
<div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  <span class="keywordflow">if</span> (pre_travel_index != -1) {</div>
|
|
<div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  <a class="code" href="namespaceoperations__research.html#ad13d20d0a1737677a4757bd6ef8a95b3">FillPathEvaluation</a>(path, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TransitCallback(pre_travel_index),</div>
|
|
<div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  &pre_travel);</div>
|
|
<div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  }</div>
|
|
<div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> post_travel_index =</div>
|
|
<div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#afb4c32e76561cad95bd8be2777d8f1ac">GetPostTravelEvaluatorOfVehicle</a>(vehicle);</div>
|
|
<div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  <span class="keywordflow">if</span> (post_travel_index != -1) {</div>
|
|
<div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  <a class="code" href="namespaceoperations__research.html#ad13d20d0a1737677a4757bd6ef8a95b3">FillPathEvaluation</a>(path, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TransitCallback(post_travel_index),</div>
|
|
<div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  &post_travel);</div>
|
|
<div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  }</div>
|
|
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  }</div>
|
|
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  <span class="comment">// If the solver is CPSAT, it will need to represent the times at which</span></div>
|
|
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  <span class="comment">// breaks are scheduled, those variables are used both in the pure breaks</span></div>
|
|
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  <span class="comment">// part and in the break distance part of the model.</span></div>
|
|
<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  <span class="comment">// Otherwise, it doesn't need the variables and they are not created.</span></div>
|
|
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  std::vector<int> lp_break_start;</div>
|
|
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  std::vector<int> lp_break_duration;</div>
|
|
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  std::vector<int> lp_break_end;</div>
|
|
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  <span class="keywordflow">if</span> (solver->IsCPSATSolver()) {</div>
|
|
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  lp_break_start.resize(num_breaks, -1);</div>
|
|
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  lp_break_duration.resize(num_breaks, -1);</div>
|
|
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  lp_break_end.resize(num_breaks, -1);</div>
|
|
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  }</div>
|
|
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  </div>
|
|
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  std::vector<int> slack_exact_lower_bound_ct(path_size - 1, -1);</div>
|
|
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  std::vector<int> slack_linear_lower_bound_ct(path_size - 1, -1);</div>
|
|
<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  </div>
|
|
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> vehicle_start_min = current_route_min_cumuls_.front();</div>
|
|
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> vehicle_start_max = current_route_max_cumuls_.front();</div>
|
|
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> vehicle_end_min = current_route_min_cumuls_.back();</div>
|
|
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> vehicle_end_max = current_route_max_cumuls_.back();</div>
|
|
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> all_break_variables_offset =</div>
|
|
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  vehicle_to_all_break_variables_offset_[vehicle];</div>
|
|
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> br = 0; br < num_breaks; ++br) {</div>
|
|
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  <span class="keyword">const</span> IntervalVar& break_var = *breaks[br];</div>
|
|
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  <span class="keywordflow">if</span> (!break_var.MustBePerformed()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> break_start_min = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(break_var.StartMin(), cumul_offset);</div>
|
|
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> break_start_max = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(break_var.StartMax(), cumul_offset);</div>
|
|
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> break_end_min = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(break_var.EndMin(), cumul_offset);</div>
|
|
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> break_end_max = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(break_var.EndMax(), cumul_offset);</div>
|
|
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> break_duration_min = break_var.DurationMin();</div>
|
|
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> break_duration_max = break_var.DurationMax();</div>
|
|
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  <span class="comment">// The CPSAT solver encodes all breaks that can intersect the route,</span></div>
|
|
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  <span class="comment">// the LP solver only encodes the breaks that must intersect the route.</span></div>
|
|
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  <span class="keywordflow">if</span> (solver->IsCPSATSolver()) {</div>
|
|
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  <span class="keywordflow">if</span> (break_end_max <= vehicle_start_min ||</div>
|
|
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  vehicle_end_max <= break_start_min) {</div>
|
|
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  all_break_variables_[all_break_variables_offset + 2 * br] = -1;</div>
|
|
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  all_break_variables_[all_break_variables_offset + 2 * br + 1] = -1;</div>
|
|
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  current_route_break_variables_.push_back(-1);</div>
|
|
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  current_route_break_variables_.push_back(-1);</div>
|
|
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  }</div>
|
|
<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  lp_break_start[br] =</div>
|
|
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  solver->AddVariable(break_start_min, break_start_max);</div>
|
|
<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  lp_break_end[br] = solver->AddVariable(break_end_min, break_end_max);</div>
|
|
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  lp_break_duration[br] =</div>
|
|
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  solver->AddVariable(break_duration_min, break_duration_max);</div>
|
|
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  <span class="comment">// start + duration = end.</span></div>
|
|
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  solver->AddLinearConstraint(0, 0,</div>
|
|
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  {{lp_break_end[br], 1},</div>
|
|
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  {lp_break_start[br], -1},</div>
|
|
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  {lp_break_duration[br], -1}});</div>
|
|
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  <span class="comment">// Record index of variables</span></div>
|
|
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  all_break_variables_[all_break_variables_offset + 2 * br] =</div>
|
|
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  lp_break_start[br];</div>
|
|
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  all_break_variables_[all_break_variables_offset + 2 * br + 1] =</div>
|
|
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  lp_break_end[br];</div>
|
|
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  current_route_break_variables_.push_back(lp_break_start[br]);</div>
|
|
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  current_route_break_variables_.push_back(lp_break_end[br]);</div>
|
|
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  <span class="keywordflow">if</span> (break_end_min <= vehicle_start_max ||</div>
|
|
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  vehicle_end_min <= break_start_max) {</div>
|
|
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  }</div>
|
|
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  }</div>
|
|
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  </div>
|
|
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  <span class="comment">// Create a constraint for every break, that forces it to be scheduled</span></div>
|
|
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  <span class="comment">// in exactly one place, i.e. one slack or before/after the route.</span></div>
|
|
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  <span class="comment">// sum_i break_in_slack_i == 1.</span></div>
|
|
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> break_in_one_slack_ct = solver->CreateNewConstraint(1, 1);</div>
|
|
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  </div>
|
|
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  <span class="keywordflow">if</span> (solver->IsCPSATSolver()) {</div>
|
|
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  <span class="comment">// Break can be before route.</span></div>
|
|
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  <span class="keywordflow">if</span> (break_end_min <= vehicle_start_max) {</div>
|
|
<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver->AddLinearConstraint(</div>
|
|
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  0, <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>, {{lp_cumuls.front(), 1}, {lp_break_end[br], -1}});</div>
|
|
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> break_is_before_route = solver->AddVariable(0, 1);</div>
|
|
<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  solver->SetEnforcementLiteral(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, break_is_before_route);</div>
|
|
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  solver->SetCoefficient(break_in_one_slack_ct, break_is_before_route, 1);</div>
|
|
<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  }</div>
|
|
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  <span class="comment">// Break can be after route.</span></div>
|
|
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  <span class="keywordflow">if</span> (vehicle_end_min <= break_start_max) {</div>
|
|
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver->AddLinearConstraint(</div>
|
|
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  0, <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>, {{lp_break_start[br], 1}, {lp_cumuls.back(), -1}});</div>
|
|
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> break_is_after_route = solver->AddVariable(0, 1);</div>
|
|
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  solver->SetEnforcementLiteral(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, break_is_after_route);</div>
|
|
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  solver->SetCoefficient(break_in_one_slack_ct, break_is_after_route, 1);</div>
|
|
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  }</div>
|
|
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  }</div>
|
|
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  </div>
|
|
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  <span class="comment">// Add the possibility of fitting the break during each slack where it can.</span></div>
|
|
<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = 0; pos < path_size - 1; ++pos) {</div>
|
|
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  <span class="comment">// Pass on slacks that cannot start before, cannot end after,</span></div>
|
|
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  <span class="comment">// or are not long enough to contain the break.</span></div>
|
|
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> slack_start_min =</div>
|
|
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(current_route_min_cumuls_[pos], pre_travel[pos]);</div>
|
|
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  <span class="keywordflow">if</span> (slack_start_min > break_start_max) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> slack_end_max =</div>
|
|
<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(current_route_max_cumuls_[pos + 1], post_travel[pos]);</div>
|
|
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  <span class="keywordflow">if</span> (break_end_min > slack_end_max) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> slack_duration_max =</div>
|
|
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(<a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(<a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(current_route_max_cumuls_[pos + 1],</div>
|
|
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  current_route_min_cumuls_[pos]),</div>
|
|
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  fixed_transit[pos]),</div>
|
|
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#ac300c6449a65333961d8abdd7ce40a7a">SlackVar</a>(path[pos])-><a class="code" href="classoperations__research_1_1_int_expr.html#a6dc4d5cdc2ed0da18452a65c5bf69e0d">Max</a>());</div>
|
|
<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  <span class="keywordflow">if</span> (slack_duration_max < break_duration_min) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  </div>
|
|
<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  <span class="comment">// Break can fit into slack: make LP variable, add to break and slack</span></div>
|
|
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  <span class="comment">// constraints.</span></div>
|
|
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  <span class="comment">// Make a linearized slack lower bound (lazily), that represents</span></div>
|
|
<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  <span class="comment">// sum_br break_duration_min(br) * break_in_slack(br, pos) <=</span></div>
|
|
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  <span class="comment">// lp_slacks(pos).</span></div>
|
|
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> break_in_slack = solver->AddVariable(0, 1);</div>
|
|
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  solver->SetCoefficient(break_in_one_slack_ct, break_in_slack, 1);</div>
|
|
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  <span class="keywordflow">if</span> (slack_linear_lower_bound_ct[pos] == -1) {</div>
|
|
<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  slack_linear_lower_bound_ct[pos] =</div>
|
|
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  solver->AddLinearConstraint(<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>, 0, {{lp_slacks[pos], -1}});</div>
|
|
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  }</div>
|
|
<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  solver->SetCoefficient(slack_linear_lower_bound_ct[pos], break_in_slack,</div>
|
|
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  break_duration_min);</div>
|
|
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  <span class="keywordflow">if</span> (solver->IsCPSATSolver()) {</div>
|
|
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  <span class="comment">// Exact relation between breaks, slacks and cumul variables.</span></div>
|
|
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  <span class="comment">// Make an exact slack lower bound (lazily), that represents</span></div>
|
|
<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  <span class="comment">// sum_br break_duration(br) * break_in_slack(br, pos) <=</span></div>
|
|
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  <span class="comment">// lp_slacks(pos).</span></div>
|
|
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> break_duration_in_slack =</div>
|
|
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  solver->AddVariable(0, slack_duration_max);</div>
|
|
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  solver->AddProductConstraint(break_duration_in_slack,</div>
|
|
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  {break_in_slack, lp_break_duration[br]});</div>
|
|
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  <span class="keywordflow">if</span> (slack_exact_lower_bound_ct[pos] == -1) {</div>
|
|
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  slack_exact_lower_bound_ct[pos] =</div>
|
|
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  solver->AddLinearConstraint(<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>, 0, {{lp_slacks[pos], -1}});</div>
|
|
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  }</div>
|
|
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  solver->SetCoefficient(slack_exact_lower_bound_ct[pos],</div>
|
|
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  break_duration_in_slack, 1);</div>
|
|
<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  <span class="comment">// If break_in_slack_i == 1, then</span></div>
|
|
<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  <span class="comment">// 1) break_start >= cumul[pos] + pre_travel[pos]</span></div>
|
|
<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> break_start_after_current_ct = solver->AddLinearConstraint(</div>
|
|
<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  pre_travel[pos], <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>,</div>
|
|
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  {{lp_break_start[br], 1}, {lp_cumuls[pos], -1}});</div>
|
|
<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  solver->SetEnforcementLiteral(break_start_after_current_ct,</div>
|
|
<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  break_in_slack);</div>
|
|
<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  <span class="comment">// 2) break_end <= cumul[pos+1] - post_travel[pos]</span></div>
|
|
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> break_ends_before_next_ct = solver->AddLinearConstraint(</div>
|
|
<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  post_travel[pos], <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>,</div>
|
|
<div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  {{lp_cumuls[pos + 1], 1}, {lp_break_end[br], -1}});</div>
|
|
<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  solver->SetEnforcementLiteral(break_ends_before_next_ct,</div>
|
|
<div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  break_in_slack);</div>
|
|
<div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  }</div>
|
|
<div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  }</div>
|
|
<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  }</div>
|
|
<div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  </div>
|
|
<div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  <span class="keywordflow">if</span> (!solver->IsCPSATSolver()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  <span class="keywordflow">if</span> (!dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a20cb44a14b6119a99fdcef3b594629e8">GetBreakDistanceDurationOfVehicle</a>(vehicle).empty()) {</div>
|
|
<div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  <span class="comment">// If there is an optional interval, the following model would be wrong.</span></div>
|
|
<div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  <span class="comment">// TODO(user): support optional intervals.</span></div>
|
|
<div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntervalVar* <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> :</div>
|
|
<div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle)) {</div>
|
|
<div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  <span class="keywordflow">if</span> (!<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MustBePerformed()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  }</div>
|
|
<div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  <span class="comment">// When this feature is used, breaks are in sorted order.</span></div>
|
|
<div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> br = 1; br < num_breaks; ++br) {</div>
|
|
<div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  solver->AddLinearConstraint(</div>
|
|
<div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  0, <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>, {{lp_break_end[br - 1], -1}, {lp_break_start[br], 1}});</div>
|
|
<div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  }</div>
|
|
<div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  }</div>
|
|
<div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& distance_duration :</div>
|
|
<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a20cb44a14b6119a99fdcef3b594629e8">GetBreakDistanceDurationOfVehicle</a>(vehicle)) {</div>
|
|
<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> limit = distance_duration.first;</div>
|
|
<div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> min_break_duration = distance_duration.second;</div>
|
|
<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  <span class="comment">// Interbreak limit constraint: breaks are interpreted as being in sorted</span></div>
|
|
<div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  <span class="comment">// order, and the maximum duration between two consecutive</span></div>
|
|
<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  <span class="comment">// breaks of duration more than 'min_break_duration' is 'limit'. This</span></div>
|
|
<div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  <span class="comment">// considers the time until start of route and after end of route to be</span></div>
|
|
<div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  <span class="comment">// infinite breaks.</span></div>
|
|
<div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  <span class="comment">// The model for this constraint adds some 'cover_i' variables, such that</span></div>
|
|
<div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  <span class="comment">// the breaks up to i and the start of route allows to go without a break.</span></div>
|
|
<div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  <span class="comment">// With s_i the start of break i and e_i its end:</span></div>
|
|
<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  <span class="comment">// - the route start covers time from start to start + limit:</span></div>
|
|
<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  <span class="comment">// cover_0 = route_start + limit</span></div>
|
|
<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  <span class="comment">// - the coverage up to a given break is the largest of the coverage of the</span></div>
|
|
<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  <span class="comment">// previous break and if the break is long enough, break end + limit:</span></div>
|
|
<div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  <span class="comment">// cover_{i+1} = max(cover_i,</span></div>
|
|
<div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  <span class="comment">// e_i - s_i >= min_break_duration ? e_i + limit : -inf)</span></div>
|
|
<div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  <span class="comment">// - the coverage of the last break must be at least the route end,</span></div>
|
|
<div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  <span class="comment">// to ensure the time point route_end-1 is covered:</span></div>
|
|
<div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  <span class="comment">// cover_{num_breaks} >= route_end</span></div>
|
|
<div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  <span class="comment">// - similarly, time point s_i-1 must be covered by breaks up to i-1,</span></div>
|
|
<div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  <span class="comment">// but only if the cover has not reached the route end.</span></div>
|
|
<div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  <span class="comment">// For instance, a vehicle could have a choice between two days,</span></div>
|
|
<div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  <span class="comment">// with a potential break on day 1 and a potential break on day 2,</span></div>
|
|
<div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  <span class="comment">// but the break of day 1 does not have to cover that of day 2!</span></div>
|
|
<div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  <span class="comment">// cover_{i-1} < route_end => s_i <= cover_{i-1}</span></div>
|
|
<div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  <span class="comment">// This is sufficient to ensure that the union of the intervals</span></div>
|
|
<div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  <span class="comment">// (-infinity, route_start], [route_end, +infinity) and all</span></div>
|
|
<div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  <span class="comment">// [s_i, e_i+limit) where e_i - s_i >= min_break_duration is</span></div>
|
|
<div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  <span class="comment">// the whole timeline (-infinity, +infinity).</span></div>
|
|
<div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  <span class="keywordtype">int</span> previous_cover = solver->AddVariable(<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(vehicle_start_min, limit),</div>
|
|
<div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(vehicle_start_max, limit));</div>
|
|
<div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  solver->AddLinearConstraint(limit, limit,</div>
|
|
<div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  {{previous_cover, 1}, {lp_cumuls.front(), -1}});</div>
|
|
<div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> br = 0; br < num_breaks; ++br) {</div>
|
|
<div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  <span class="keywordflow">if</span> (lp_break_start[br] == -1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> break_end_min = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(breaks[br]->EndMin(), cumul_offset);</div>
|
|
<div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> break_end_max = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(breaks[br]->EndMax(), cumul_offset);</div>
|
|
<div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  <span class="comment">// break_is_eligible <=></span></div>
|
|
<div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  <span class="comment">// break_end - break_start >= break_minimum_duration.</span></div>
|
|
<div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> break_is_eligible = solver->AddVariable(0, 1);</div>
|
|
<div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> break_is_not_eligible = solver->AddVariable(0, 1);</div>
|
|
<div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  {</div>
|
|
<div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  solver->AddLinearConstraint(</div>
|
|
<div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  1, 1, {{break_is_eligible, 1}, {break_is_not_eligible, 1}});</div>
|
|
<div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> positive_ct = solver->AddLinearConstraint(</div>
|
|
<div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  min_break_duration, <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>,</div>
|
|
<div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  {{lp_break_end[br], 1}, {lp_break_start[br], -1}});</div>
|
|
<div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  solver->SetEnforcementLiteral(positive_ct, break_is_eligible);</div>
|
|
<div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> negative_ct = solver->AddLinearConstraint(</div>
|
|
<div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>, min_break_duration - 1,</div>
|
|
<div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  {{lp_break_end[br], 1}, {lp_break_start[br], -1}});</div>
|
|
<div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  solver->SetEnforcementLiteral(negative_ct, break_is_not_eligible);</div>
|
|
<div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  }</div>
|
|
<div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  <span class="comment">// break_is_eligible => break_cover == break_end + limit.</span></div>
|
|
<div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  <span class="comment">// break_is_not_eligible => break_cover == vehicle_start_min + limit.</span></div>
|
|
<div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  <span class="comment">// break_cover's initial domain is the smallest interval that contains the</span></div>
|
|
<div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  <span class="comment">// union of sets {vehicle_start_min+limit} and</span></div>
|
|
<div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>  <span class="comment">// [break_end_min+limit, break_end_max+limit).</span></div>
|
|
<div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> break_cover = solver->AddVariable(</div>
|
|
<div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(vehicle_start_min, break_end_min), limit),</div>
|
|
<div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(vehicle_start_min, break_end_max), limit));</div>
|
|
<div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> limit_cover_ct = solver->AddLinearConstraint(</div>
|
|
<div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  limit, limit, {{break_cover, 1}, {lp_break_end[br], -1}});</div>
|
|
<div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  solver->SetEnforcementLiteral(limit_cover_ct, break_is_eligible);</div>
|
|
<div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> empty_cover_ct = solver->AddLinearConstraint(</div>
|
|
<div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(vehicle_start_min, limit), <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(vehicle_start_min, limit),</div>
|
|
<div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  {{break_cover, 1}});</div>
|
|
<div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  solver->SetEnforcementLiteral(empty_cover_ct, break_is_not_eligible);</div>
|
|
<div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  </div>
|
|
<div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> cover =</div>
|
|
<div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  solver->AddVariable(<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(vehicle_start_min, limit), <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>);</div>
|
|
<div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  solver->AddMaximumConstraint(cover, {previous_cover, break_cover});</div>
|
|
<div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  <span class="comment">// Cover chaining. If route end is not covered, break start must be:</span></div>
|
|
<div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  <span class="comment">// cover_{i-1} < route_end => s_i <= cover_{i-1}</span></div>
|
|
<div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> route_end_is_not_covered = solver->AddReifiedLinearConstraint(</div>
|
|
<div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  1, <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>, {{lp_cumuls.back(), 1}, {previous_cover, -1}});</div>
|
|
<div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> break_start_cover_ct = solver->AddLinearConstraint(</div>
|
|
<div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  0, <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>, {{previous_cover, 1}, {lp_break_start[br], -1}});</div>
|
|
<div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  solver->SetEnforcementLiteral(break_start_cover_ct,</div>
|
|
<div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  route_end_is_not_covered);</div>
|
|
<div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  </div>
|
|
<div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  previous_cover = cover;</div>
|
|
<div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>  }</div>
|
|
<div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  solver->AddLinearConstraint(0, <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>,</div>
|
|
<div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  {{previous_cover, 1}, {lp_cumuls.back(), -1}});</div>
|
|
<div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  }</div>
|
|
<div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  </div>
|
|
<div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01257"></a><span class="lineno"> 1257</span> }</div>
|
|
<div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  </div>
|
|
<div class="line"><a name="l01259"></a><span class="lineno"> 1259</span> <span class="keywordtype">void</span> DimensionCumulOptimizerCore::SetGlobalConstraints(</div>
|
|
<div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  <span class="keywordtype">bool</span> optimize_costs, RoutingLinearSolverWrapper* solver) {</div>
|
|
<div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  <span class="comment">// Global span cost =</span></div>
|
|
<div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  <span class="comment">// global_span_cost_coefficient * (max_end_cumul - min_start_cumul).</span></div>
|
|
<div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> global_span_coeff = dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#a1faf1ea53b992b47f60d0622e42f7a50">global_span_cost_coefficient</a>();</div>
|
|
<div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  <span class="keywordflow">if</span> (optimize_costs && global_span_coeff > 0) {</div>
|
|
<div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  solver->SetObjectiveCoefficient(max_end_cumul_, global_span_coeff);</div>
|
|
<div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  solver->SetObjectiveCoefficient(min_start_cumul_, -global_span_coeff);</div>
|
|
<div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  }</div>
|
|
<div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  </div>
|
|
<div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  <span class="comment">// Node precedence constraints, set when both nodes are visited.</span></div>
|
|
<div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> RoutingDimension::NodePrecedence& precedence :</div>
|
|
<div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#ae4b40d046de51f0ace9138a3692b0090">GetNodePrecedences</a>()) {</div>
|
|
<div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> first_cumul_var = index_to_cumul_variable_[precedence.first_node];</div>
|
|
<div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> second_cumul_var =</div>
|
|
<div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  index_to_cumul_variable_[precedence.second_node];</div>
|
|
<div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  <span class="keywordflow">if</span> (first_cumul_var < 0 || second_cumul_var < 0) {</div>
|
|
<div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>  <span class="comment">// At least one of the nodes is not on any route, skip this precedence</span></div>
|
|
<div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>  <span class="comment">// constraint.</span></div>
|
|
<div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  }</div>
|
|
<div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(first_cumul_var, second_cumul_var)</div>
|
|
<div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  << <span class="stringliteral">"Dimension "</span> << dimension_-><a class="code" href="classoperations__research_1_1_routing_dimension.html#ad8227ba86a01f26e4f173cd5e219d5d1">name</a>()</div>
|
|
<div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  << <span class="stringliteral">" has a self-precedence on node "</span> << precedence.first_node << <span class="stringliteral">"."</span>;</div>
|
|
<div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  </div>
|
|
<div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  <span class="comment">// cumul[second_node] - cumul[first_node] >= offset.</span></div>
|
|
<div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver->CreateNewConstraint(precedence.offset, <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>);</div>
|
|
<div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  solver->SetCoefficient(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, second_cumul_var, 1);</div>
|
|
<div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  solver->SetCoefficient(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, first_cumul_var, -1);</div>
|
|
<div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  }</div>
|
|
<div class="line"><a name="l01289"></a><span class="lineno"> 1289</span> }</div>
|
|
<div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  </div>
|
|
<div class="line"><a name="l01291"></a><span class="lineno"> 1291</span> <span class="keywordtype">void</span> DimensionCumulOptimizerCore::SetValuesFromLP(</div>
|
|
<div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  <span class="keyword">const</span> std::vector<int>& lp_variables, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> offset,</div>
|
|
<div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  RoutingLinearSolverWrapper* solver, std::vector<int64>* lp_values) {</div>
|
|
<div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  <span class="keywordflow">if</span> (lp_values == <span class="keyword">nullptr</span>) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  lp_values->assign(lp_variables.size(), <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>);</div>
|
|
<div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < lp_variables.size(); i++) {</div>
|
|
<div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> cumul_var = lp_variables[i];</div>
|
|
<div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  <span class="keywordflow">if</span> (cumul_var < 0) <span class="keywordflow">continue</span>; <span class="comment">// Keep default value, kint64min.</span></div>
|
|
<div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> lp_value_double = solver->GetValue(cumul_var);</div>
|
|
<div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> lp_value_int64 =</div>
|
|
<div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  (lp_value_double >= <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>)</div>
|
|
<div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  ? <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a></div>
|
|
<div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  : <a class="code" href="classoperations__research_1_1_math_util.html#aec89d533eea50ada5268533f068f97ec">MathUtil::FastInt64Round</a>(lp_value_double);</div>
|
|
<div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>  (*lp_values)[i] = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(lp_value_int64, offset);</div>
|
|
<div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  }</div>
|
|
<div class="line"><a name="l01306"></a><span class="lineno"> 1306</span> }</div>
|
|
<div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>  </div>
|
|
<div class="line"><a name="l01308"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a69c482660dedcd9e709e459c979790a2"> 1308</a></span> <a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a69c482660dedcd9e709e459c979790a2">GlobalDimensionCumulOptimizer::GlobalDimensionCumulOptimizer</a>(</div>
|
|
<div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* dimension)</div>
|
|
<div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  : optimizer_core_(dimension,</div>
|
|
<div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  <span class="comment">/*use_precedence_propagator=*/</span></div>
|
|
<div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  !dimension->GetNodePrecedences().empty()) {</div>
|
|
<div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  solver_ =</div>
|
|
<div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>  absl::make_unique<RoutingGlopWrapper>(GetGlopParametersForGlobalLP());</div>
|
|
<div class="line"><a name="l01315"></a><span class="lineno"> 1315</span> }</div>
|
|
<div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  </div>
|
|
<div class="line"><a name="l01317"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a90da6b10d66522633bfeefc1289cf05c"> 1317</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a90da6b10d66522633bfeefc1289cf05c">GlobalDimensionCumulOptimizer::ComputeCumulCostWithoutFixedTransits</a>(</div>
|
|
<div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>  <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>* optimal_cost_without_transits) {</div>
|
|
<div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a> = 0;</div>
|
|
<div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> transit_cost = 0;</div>
|
|
<div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  <span class="keywordflow">if</span> (optimizer_core_.<a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a730ec73f0aaf770badb796973a909dd2">Optimize</a>(next_accessor, solver_.get(), <span class="keyword">nullptr</span>, <span class="keyword">nullptr</span>,</div>
|
|
<div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  &<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>, &transit_cost)) {</div>
|
|
<div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  <span class="keywordflow">if</span> (optimal_cost_without_transits != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  *optimal_cost_without_transits = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(<a class="code" href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a>, transit_cost);</div>
|
|
<div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>  }</div>
|
|
<div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  }</div>
|
|
<div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01330"></a><span class="lineno"> 1330</span> }</div>
|
|
<div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  </div>
|
|
<div class="line"><a name="l01332"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a199f142227c12a632986167f1e8339cf"> 1332</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a199f142227c12a632986167f1e8339cf">GlobalDimensionCumulOptimizer::ComputeCumuls</a>(</div>
|
|
<div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>  <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  std::vector<int64>* optimal_cumuls, std::vector<int64>* optimal_breaks) {</div>
|
|
<div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  <span class="keywordflow">return</span> optimizer_core_.<a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a730ec73f0aaf770badb796973a909dd2">Optimize</a>(next_accessor, solver_.get(), optimal_cumuls,</div>
|
|
<div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  optimal_breaks, <span class="keyword">nullptr</span>, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l01337"></a><span class="lineno"> 1337</span> }</div>
|
|
<div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  </div>
|
|
<div class="line"><a name="l01339"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a501d5aa6957f63484392048ba566b0a3"> 1339</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a501d5aa6957f63484392048ba566b0a3">GlobalDimensionCumulOptimizer::IsFeasible</a>(</div>
|
|
<div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor) {</div>
|
|
<div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  <span class="keywordflow">return</span> optimizer_core_.<a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a730ec73f0aaf770badb796973a909dd2">Optimize</a>(next_accessor, solver_.get(), <span class="keyword">nullptr</span>,</div>
|
|
<div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  <span class="keyword">nullptr</span>, <span class="keyword">nullptr</span>, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l01343"></a><span class="lineno"> 1343</span> }</div>
|
|
<div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  </div>
|
|
<div class="line"><a name="l01345"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#ab6947109d87c68e3d51e285cc7477070"> 1345</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#ab6947109d87c68e3d51e285cc7477070">GlobalDimensionCumulOptimizer::ComputePackedCumuls</a>(</div>
|
|
<div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  <span class="keyword">const</span> std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)>& next_accessor,</div>
|
|
<div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  std::vector<int64>* packed_cumuls, std::vector<int64>* packed_breaks) {</div>
|
|
<div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  <span class="keywordflow">return</span> optimizer_core_.<a class="code" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a251eb2e91129b8df8fb7dade1e2a68c6">OptimizeAndPack</a>(next_accessor, solver_.get(),</div>
|
|
<div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  packed_cumuls, packed_breaks);</div>
|
|
<div class="line"><a name="l01350"></a><span class="lineno"> 1350</span> }</div>
|
|
<div class="line"><a name="l01351"></a><span class="lineno"> 1351</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a021e695f54a13bd809c34b2f4ca87c37"><div class="ttname"><a href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">min</a></div><div class="ttdeci">int64 min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00138">alldiff_cst.cc:138</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a9d0c202d5fdd62f4fa2c613339ff168a"><div class="ttname"><a href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">max</a></div><div class="ttdeci">int64 max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a46e69120fbd3b36e6960e096d23b66f0"><div class="ttname"><a href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a></div><div class="ttdeci">#define DCHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00886">base/logging.h:886</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_aae2dc65d9ea248d54bf39daa986dd295"><div class="ttname"><a href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a></div><div class="ttdeci">#define DCHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00889">base/logging.h:889</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ab62f5ed8f2d48e29802be0cbbcd1359a"><div class="ttname"><a href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a></div><div class="ttdeci">#define DCHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00888">base/logging.h:888</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_accad43a85d781d53381cd53a9894b6ae"><div class="ttname"><a href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a></div><div class="ttdeci">#define LOG(severity)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00420">base/logging.h:420</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00884">base/logging.h:884</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae89df3243bbb8341130c7b3f44145ea0"><div class="ttname"><a href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a></div><div class="ttdeci">#define DCHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00885">base/logging.h:885</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cumul_bounds_propagator_html_a54688e4af975568b0bce87cdf9f26781"><div class="ttname"><a href="classoperations__research_1_1_cumul_bounds_propagator.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 class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00385">routing_lp_scheduling.cc:385</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cumul_bounds_propagator_html_a72be8a813404822957fbd808d0405226"><div class="ttname"><a href="classoperations__research_1_1_cumul_bounds_propagator.html#a72be8a813404822957fbd808d0405226">operations_research::CumulBoundsPropagator::dimension</a></div><div class="ttdeci">const RoutingDimension & dimension() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00056">routing_lp_scheduling.h:56</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cumul_bounds_propagator_html_aff8f29b2fce9f6447474ee6077af1b72"><div class="ttname"><a href="classoperations__research_1_1_cumul_bounds_propagator.html#aff8f29b2fce9f6447474ee6077af1b72">operations_research::CumulBoundsPropagator::CumulBoundsPropagator</a></div><div class="ttdeci">CumulBoundsPropagator(const RoutingDimension *dimension)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00225">routing_lp_scheduling.cc:225</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_a251eb2e91129b8df8fb7dade1e2a68c6"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a251eb2e91129b8df8fb7dade1e2a68c6">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, std::vector< int64 > *break_values)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00567">routing_lp_scheduling.cc:567</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_a5967f72ac911a2ed971a1ce103d1c47b"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a5967f72ac911a2ed971a1ce103d1c47b">operations_research::DimensionCumulOptimizerCore::DimensionCumulOptimizerCore</a></div><div class="ttdeci">DimensionCumulOptimizerCore(const RoutingDimension *dimension, bool use_precedence_propagator)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00438">routing_lp_scheduling.cc:438</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_a6769f38bbc3271d45b0512c12ef31f70"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a6769f38bbc3271d45b0512c12ef31f70">operations_research::DimensionCumulOptimizerCore::dimension</a></div><div class="ttdeci">const RoutingDimension * dimension() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00554">routing_lp_scheduling.h:554</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_a730ec73f0aaf770badb796973a909dd2"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a730ec73f0aaf770badb796973a909dd2">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, std::vector< int64 > *break_values, int64 *cost, int64 *transit_cost, bool clear_lp=true)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00505">routing_lp_scheduling.cc:505</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_a74b47a791351de6312aefe2d0524688f"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a74b47a791351de6312aefe2d0524688f">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, std::vector< int64 > *break_values)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00595">routing_lp_scheduling.cc:595</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_aa24fe74f74450fedf90dce6611f45f17"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#aa24fe74f74450fedf90dce6611f45f17">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, std::vector< int64 > *break_values, int64 *cost, int64 *transit_cost, bool clear_lp=true)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00462">routing_lp_scheduling.cc:462</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a199f142227c12a632986167f1e8339cf"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a199f142227c12a632986167f1e8339cf">operations_research::GlobalDimensionCumulOptimizer::ComputeCumuls</a></div><div class="ttdeci">bool ComputeCumuls(const std::function< int64(int64)> &next_accessor, std::vector< int64 > *optimal_cumuls, std::vector< int64 > *optimal_breaks)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l01332">routing_lp_scheduling.cc:1332</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a501d5aa6957f63484392048ba566b0a3"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a501d5aa6957f63484392048ba566b0a3">operations_research::GlobalDimensionCumulOptimizer::IsFeasible</a></div><div class="ttdeci">bool IsFeasible(const std::function< int64(int64)> &next_accessor)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l01339">routing_lp_scheduling.cc:1339</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a69c482660dedcd9e709e459c979790a2"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a69c482660dedcd9e709e459c979790a2">operations_research::GlobalDimensionCumulOptimizer::GlobalDimensionCumulOptimizer</a></div><div class="ttdeci">GlobalDimensionCumulOptimizer(const RoutingDimension *dimension)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l01308">routing_lp_scheduling.cc:1308</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a90da6b10d66522633bfeefc1289cf05c"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.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 class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l01317">routing_lp_scheduling.cc:1317</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_ab6947109d87c68e3d51e285cc7477070"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#ab6947109d87c68e3d51e285cc7477070">operations_research::GlobalDimensionCumulOptimizer::ComputePackedCumuls</a></div><div class="ttdeci">bool ComputePackedCumuls(const std::function< int64(int64)> &next_accessor, std::vector< int64 > *packed_cumuls, std::vector< int64 > *packed_breaks)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l01345">routing_lp_scheduling.cc:1345</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_expr_html_a6dc4d5cdc2ed0da18452a65c5bf69e0d"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#a6dc4d5cdc2ed0da18452a65c5bf69e0d">operations_research::IntExpr::Max</a></div><div class="ttdeci">virtual int64 Max() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_expr_html_ac4a4f30badcd311075302a4efcfaee0a"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#ac4a4f30badcd311075302a4efcfaee0a">operations_research::IntExpr::Min</a></div><div class="ttdeci">virtual int64 Min() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a40f8457f8f4bf714cb5224ce780c7a28"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a40f8457f8f4bf714cb5224ce780c7a28">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, std::vector< int64 > *packed_breaks)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00214">routing_lp_scheduling.cc:214</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a5bcbf49ff1a9dd9f92c40750ec0267b4"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a5bcbf49ff1a9dd9f92c40750ec0267b4">operations_research::LocalDimensionCumulOptimizer::LocalDimensionCumulOptimizer</a></div><div class="ttdeci">LocalDimensionCumulOptimizer(const RoutingDimension *dimension, RoutingSearchParameters::SchedulingSolver solver_type)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00154">routing_lp_scheduling.cc:154</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a6769f38bbc3271d45b0512c12ef31f70"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a6769f38bbc3271d45b0512c12ef31f70">operations_research::LocalDimensionCumulOptimizer::dimension</a></div><div class="ttdeci">const RoutingDimension * dimension() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00671">routing_lp_scheduling.h:671</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a67fc733931c9c43247ce262b1542d399"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a67fc733931c9c43247ce262b1542d399">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, std::vector< int64 > *optimal_breaks)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00205">routing_lp_scheduling.cc:205</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a6d0f5e1ec4506fe6aa43a19836c0b476"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.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 class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00181">routing_lp_scheduling.cc:181</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_ab165a7061f3391a4948ca7ae06307799"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.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 class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00190">routing_lp_scheduling.cc:190</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_math_util_html_aec89d533eea50ada5268533f068f97ec"><div class="ttname"><a href="classoperations__research_1_1_math_util.html#aec89d533eea50ada5268533f068f97ec">operations_research::MathUtil::FastInt64Round</a></div><div class="ttdeci">static int64 FastInt64Round(double x)</div><div class="ttdef"><b>Definition:</b> <a href="mathutil_8h_source.html#l00138">mathutil.h:138</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html">operations_research::RoutingDimension</a></div><div class="ttdoc">Dimensions represent quantities accumulated at nodes along the routes.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02357">routing.h:2357</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a06257e0b9422e5de00bd4eef03777355"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a06257e0b9422e5de00bd4eef03777355">operations_research::RoutingDimension::GetSoftSpanUpperBoundForVehicle</a></div><div class="ttdeci">SimpleBoundCosts::BoundCost GetSoftSpanUpperBoundForVehicle(int vehicle) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02700">routing.h:2700</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a1b6f521fdc9dff38b7e065c838fa54a3"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a1b6f521fdc9dff38b7e065c838fa54a3">operations_research::RoutingDimension::cumuls</a></div><div class="ttdeci">const std::vector< IntVar * > & cumuls() const</div><div class="ttdoc">Like CumulVar(), TransitVar(), SlackVar() but return the whole variable vectors instead (indexed by i...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02383">routing.h:2383</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a1faf1ea53b992b47f60d0622e42f7a50"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a1faf1ea53b992b47f60d0622e42f7a50">operations_research::RoutingDimension::global_span_cost_coefficient</a></div><div class="ttdeci">int64 global_span_cost_coefficient() const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02671">routing.h:2671</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a20cb44a14b6119a99fdcef3b594629e8"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a20cb44a14b6119a99fdcef3b594629e8">operations_research::RoutingDimension::GetBreakDistanceDurationOfVehicle</a></div><div class="ttdeci">const std::vector< std::pair< int64, int64 > > & GetBreakDistanceDurationOfVehicle(int vehicle) const</div><div class="ttdoc">Returns the pairs (distance, duration) specified by break distance constraints.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l06925">routing.cc:6925</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a26d28dacdef6a70d512df1a175429558"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a26d28dacdef6a70d512df1a175429558">operations_research::RoutingDimension::GetSpanCostCoefficientForVehicle</a></div><div class="ttdeci">int64 GetSpanCostCoefficientForVehicle(int vehicle) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02663">routing.h:2663</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a35a576bb3ea6814f122593d44a3c391e"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a35a576bb3ea6814f122593d44a3c391e">operations_research::RoutingDimension::model</a></div><div class="ttdeci">RoutingModel * model() const</div><div class="ttdoc">Returns the model on which the dimension was created.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02361">routing.h:2361</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a375d5aec667421cb92f6439464420062"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a375d5aec667421cb92f6439464420062">operations_research::RoutingDimension::GetGlobalOptimizerOffset</a></div><div class="ttdeci">int64 GetGlobalOptimizerOffset() const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02675">routing.h:2675</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a51eadbd617f6658396e5ba790f6b0c19"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a51eadbd617f6658396e5ba790f6b0c19">operations_research::RoutingDimension::GetCumulVarSoftLowerBoundCoefficient</a></div><div class="ttdeci">int64 GetCumulVarSoftLowerBoundCoefficient(int64 index) const</div><div class="ttdoc">Returns the cost coefficient of the soft lower bound of a cumul variable for a given variable index.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l06738">routing.cc:6738</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a54e75670bdbf7abca93c9e02cfee83fe"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a54e75670bdbf7abca93c9e02cfee83fe">operations_research::RoutingDimension::HasCumulVarSoftLowerBound</a></div><div class="ttdeci">bool HasCumulVarSoftLowerBound(int64 index) const</div><div class="ttdoc">Returns true if a soft lower bound has been set for a given variable index.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l06725">routing.cc:6725</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a607df50e6bc0dc54fbe811e96155ee95"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a607df50e6bc0dc54fbe811e96155ee95">operations_research::RoutingDimension::GetCumulVarSoftLowerBound</a></div><div class="ttdeci">int64 GetCumulVarSoftLowerBound(int64 index) const</div><div class="ttdoc">Returns the soft lower bound of a cumul variable for a given variable index.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l06730">routing.cc:6730</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a6debc638c02bfb2b4afe0afccdd98ca5"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a6debc638c02bfb2b4afe0afccdd98ca5">operations_research::RoutingDimension::HasBreakConstraints</a></div><div class="ttdeci">bool HasBreakConstraints() const</div><div class="ttdoc">Returns true if any break interval or break distance was defined.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l06886">routing.cc:6886</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a82f14203d850d1ede49849c5020c6f51"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a82f14203d850d1ede49849c5020c6f51">operations_research::RoutingDimension::GetLocalOptimizerOffsetForVehicle</a></div><div class="ttdeci">int64 GetLocalOptimizerOffsetForVehicle(int vehicle) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02679">routing.h:2679</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a8e93e99ce491f2779c0d2e5e7de5a98a"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a8e93e99ce491f2779c0d2e5e7de5a98a">operations_research::RoutingDimension::GetPreTravelEvaluatorOfVehicle</a></div><div class="ttdeci">int GetPreTravelEvaluatorOfVehicle(int vehicle) const</div><div class="ttdoc">!defined(SWIGPYTHON)</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l06897">routing.cc:6897</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a91b8a6eb7cf5ab0ebc74ddced140d700"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">operations_research::RoutingDimension::GetBreakIntervalsOfVehicle</a></div><div class="ttdeci">const std::vector< IntervalVar * > & GetBreakIntervalsOfVehicle(int vehicle) const</div><div class="ttdoc">Returns the break intervals set by SetBreakIntervalsOfVehicle().</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l06890">routing.cc:6890</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_aa70f385bdf5fc31eec8a848dea13b357"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#aa70f385bdf5fc31eec8a848dea13b357">operations_research::RoutingDimension::GetPickupToDeliveryLimitForPair</a></div><div class="ttdeci">int64 GetPickupToDeliveryLimitForPair(int pair_index, int pickup, int delivery) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l06945">routing.cc:6945</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_aacc17c3711ac030db624e72c5ae2394f"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#aacc17c3711ac030db624e72c5ae2394f">operations_research::RoutingDimension::GetCumulVarSoftUpperBound</a></div><div class="ttdeci">int64 GetCumulVarSoftUpperBound(int64 index) const</div><div class="ttdoc">Returns the soft upper bound of a cumul variable for a given variable index.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l06679">routing.cc:6679</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_aae1962408e06dbb45f6e5ee67e530880"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#aae1962408e06dbb45f6e5ee67e530880">operations_research::RoutingDimension::transit_evaluator</a></div><div class="ttdeci">const RoutingModel::TransitCallback2 & transit_evaluator(int vehicle) const</div><div class="ttdoc">Returns the callback evaluating the transit value between two node indices for a given vehicle.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02438">routing.h:2438</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_ac300c6449a65333961d8abdd7ce40a7a"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#ac300c6449a65333961d8abdd7ce40a7a">operations_research::RoutingDimension::SlackVar</a></div><div class="ttdeci">IntVar * SlackVar(int64 index) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02378">routing.h:2378</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_acf39f330b220a62bbb8fac9c8c1256b5"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#acf39f330b220a62bbb8fac9c8c1256b5">operations_research::RoutingDimension::GetAllowedIntervalsInRange</a></div><div class="ttdeci">SortedDisjointIntervalList GetAllowedIntervalsInRange(int64 index, int64 min_value, int64 max_value) const</div><div class="ttdoc">Returns allowed intervals for a given node in a given interval.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l06550">routing.cc:6550</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_ad8227ba86a01f26e4f173cd5e219d5d1"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#ad8227ba86a01f26e4f173cd5e219d5d1">operations_research::RoutingDimension::name</a></div><div class="ttdeci">const std::string & name() const</div><div class="ttdoc">Returns the name of the dimension.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02609">routing.h:2609</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_ae4b40d046de51f0ace9138a3692b0090"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#ae4b40d046de51f0ace9138a3692b0090">operations_research::RoutingDimension::GetNodePrecedences</a></div><div class="ttdeci">const std::vector< NodePrecedence > & GetNodePrecedences() const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02646">routing.h:2646</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_aea64f6b7cb80887be5478c35609cab1c"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#aea64f6b7cb80887be5478c35609cab1c">operations_research::RoutingDimension::HasCumulVarSoftUpperBound</a></div><div class="ttdeci">bool HasCumulVarSoftUpperBound(int64 index) const</div><div class="ttdoc">Returns true if a soft upper bound has been set for a given variable index.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l06674">routing.cc:6674</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_af0185f7c0ea3abf45191db23514604f3"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#af0185f7c0ea3abf45191db23514604f3">operations_research::RoutingDimension::HasSoftSpanUpperBounds</a></div><div class="ttdeci">bool HasSoftSpanUpperBounds() const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02697">routing.h:2697</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_af362b70cab1a5a90703808e9575c2f54"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#af362b70cab1a5a90703808e9575c2f54">operations_research::RoutingDimension::GetCumulVarSoftUpperBoundCoefficient</a></div><div class="ttdeci">int64 GetCumulVarSoftUpperBoundCoefficient(int64 index) const</div><div class="ttdoc">Returns the cost coefficient of the soft upper bound of a cumul variable for a given variable index.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l06687">routing.cc:6687</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_afb4c32e76561cad95bd8be2777d8f1ac"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#afb4c32e76561cad95bd8be2777d8f1ac">operations_research::RoutingDimension::GetPostTravelEvaluatorOfVehicle</a></div><div class="ttdeci">int GetPostTravelEvaluatorOfVehicle(int vehicle) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l06903">routing.cc:6903</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_aff15c149ac7cbb96d340d8c1370d5aea"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#aff15c149ac7cbb96d340d8c1370d5aea">operations_research::RoutingDimension::forbidden_intervals</a></div><div class="ttdeci">const std::vector< SortedDisjointIntervalList > & forbidden_intervals() const</div><div class="ttdoc">Returns forbidden intervals for each node.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02389">routing.h:2389</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_affe684b0df382fbf2b5eda869ec0c271"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#affe684b0df382fbf2b5eda869ec0c271">operations_research::RoutingDimension::GetSpanUpperBoundForVehicle</a></div><div class="ttdeci">int64 GetSpanUpperBoundForVehicle(int vehicle) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02655">routing.h:2655</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html">operations_research::RoutingLinearSolverWrapper</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00136">routing_lp_scheduling.h:136</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a01ce5bca7f91b37ff459b4d7b63e5190"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a01ce5bca7f91b37ff459b4d7b63e5190">operations_research::RoutingLinearSolverWrapper::SetCoefficient</a></div><div class="ttdeci">virtual void SetCoefficient(int ct, int index, double coefficient)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a155f6032f05d373d7375078c1be4a01b"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a155f6032f05d373d7375078c1be4a01b">operations_research::RoutingLinearSolverWrapper::NumVariables</a></div><div class="ttdeci">virtual int NumVariables() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a1923407036f149ea2c31ac37c11e1337"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.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_1_routing_linear_solver_wrapper_html_a4812d528a6d93d471be496e9ca79c820"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a4812d528a6d93d471be496e9ca79c820">operations_research::RoutingLinearSolverWrapper::GetObjectiveCoefficient</a></div><div class="ttdeci">virtual double GetObjectiveCoefficient(int index) const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a4d08d6a3c275615e7127461d28090923"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#a4d08d6a3c275615e7127461d28090923">operations_research::RoutingLinearSolverWrapper::GetObjectiveValue</a></div><div class="ttdeci">virtual int64 GetObjectiveValue() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_a7bdd4be7fd06d5c445403fdf3de0eeda"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.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_1_routing_linear_solver_wrapper_html_a9e2ef65ea95577f9df6ba20c43813573"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.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_1_routing_linear_solver_wrapper_html_aa5b31c976cc6734003d9950e731dfed3"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa5b31c976cc6734003d9950e731dfed3">operations_research::RoutingLinearSolverWrapper::Clear</a></div><div class="ttdeci">virtual void Clear()=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_ab8bd6c2ebc0fe292221efda5c39de361"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ab8bd6c2ebc0fe292221efda5c39de361">operations_research::RoutingLinearSolverWrapper::ClearObjective</a></div><div class="ttdeci">virtual void ClearObjective()=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_ac154a773600edab5f5fbc597c5639cce"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ac154a773600edab5f5fbc597c5639cce">operations_research::RoutingLinearSolverWrapper::GetValue</a></div><div class="ttdeci">virtual double GetValue(int index) const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_acb5447abf2fd0ef52e46ce561ffef5cb"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#acb5447abf2fd0ef52e46ce561ffef5cb">operations_research::RoutingLinearSolverWrapper::Solve</a></div><div class="ttdeci">virtual DimensionSchedulingStatus Solve(absl::Duration duration_limit)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_ad56b5d5264e07b44be873dfdcd29cb8e"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad56b5d5264e07b44be873dfdcd29cb8e">operations_research::RoutingLinearSolverWrapper::SetObjectiveCoefficient</a></div><div class="ttdeci">virtual void SetObjectiveCoefficient(int index, double coefficient)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_af1eb90688746692ec522c88d501bd598"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af1eb90688746692ec522c88d501bd598">operations_research::RoutingLinearSolverWrapper::SolutionIsInteger</a></div><div class="ttdeci">virtual bool SolutionIsInteger() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html">operations_research::RoutingModel</a></div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00213">routing.h:213</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a9e42e15bdb23d63ae78137b97a4882de"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a9e42e15bdb23d63ae78137b97a4882de">operations_research::RoutingModel::GetPickupAndDeliveryPairs</a></div><div class="ttdeci">const IndexPairs & GetPickupAndDeliveryPairs() const</div><div class="ttdoc">Returns pickup and delivery pairs currently in the model.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00735">routing.h:735</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_aa9e7ba89833775f29889744fe9480d29"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">operations_research::RoutingModel::vehicles</a></div><div class="ttdeci">int vehicles() const</div><div class="ttdoc">Returns the number of vehicle routes in the model.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01334">routing.h:1334</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a344010e26426d6a13411648d988bc9b6"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a></div><div class="ttdeci">int64 b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00043">constraint_solver/table.cc:43</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_8cc_html_a395f613555f398dd389670bb4c2a4599"><div class="ttname"><a href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a></div><div class="ttdeci">Block * next</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l00674">constraint_solver.cc:674</a></div></div>
|
|
<div class="ttc" id="acp__model__fz__solver_8cc_html_a10a1eab179b472c030bdc2a2efef7219"><div class="ttname"><a href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a></div><div class="ttdeci">SatParameters parameters</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__fz__solver_8cc_source.html#l00108">cp_model_fz_solver.cc:108</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_a05da18ca9c7b657a4a6ea24e07c9b695"><div class="ttname"><a href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a></div><div class="ttdeci">const Constraint * ct</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00042">demon_profiler.cc:42</a></div></div>
|
|
<div class="ttc" id="aexpr__array_8cc_html_a9976b6c2a10f63541b5ebefe9455c137"><div class="ttname"><a href="expr__array_8cc.html#a9976b6c2a10f63541b5ebefe9455c137">coef</a></div><div class="ttdeci">int64 coef</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01859">expr_array.cc:1859</a></div></div>
|
|
<div class="ttc" id="agurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00272">gurobi_interface.cc:272</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a74ea76ea27f48fb1b6e148e1577b3719"><div class="ttname"><a href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a></div><div class="ttdeci">static const int64 kint64max</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00062">integral_types.h:62</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a7cde0074dfd288f2d70c0e035dacb28a"><div class="ttname"><a href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a></div><div class="ttdeci">int64_t int64</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00034">integral_types.h:34</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_af458164b470cbba416d5ed579e00ff60"><div class="ttname"><a href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a></div><div class="ttdeci">static const int64 kint64min</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00060">integral_types.h:60</a></div></div>
|
|
<div class="ttc" id="alp__solver_8h_html"><div class="ttname"><a href="lp__solver_8h.html">lp_solver.h</a></div></div>
|
|
<div class="ttc" id="amap__util_8h_html"><div class="ttname"><a href="map__util_8h.html">map_util.h</a></div></div>
|
|
<div class="ttc" id="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="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a228fe84d99348c2b62bb4f70a6371d9b"><div class="ttname"><a href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">operations_research::CapSub</a></div><div class="ttdeci">int64 CapSub(int64 x, int64 y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00154">saturated_arithmetic.h:154</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a99264812cf177270e521f226a5c012c3"><div class="ttname"><a href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">operations_research::CapAdd</a></div><div class="ttdeci">int64 CapAdd(int64 x, int64 y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00124">saturated_arithmetic.h:124</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#l00126">routing_lp_scheduling.h:126</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93"><div class="ttname"><a href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">operations_research::DimensionSchedulingStatus::INFEASIBLE</a></div><div class="ttdeci">@ INFEASIBLE</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ab216763dccd16f5060d2fbcfb08173fb"><div class="ttname"><a href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">operations_research::CapProd</a></div><div class="ttdeci">int64 CapProd(int64 x, int64 y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00231">saturated_arithmetic.h:231</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ad13d20d0a1737677a4757bd6ef8a95b3"><div class="ttname"><a href="namespaceoperations__research.html#ad13d20d0a1737677a4757bd6ef8a95b3">operations_research::FillPathEvaluation</a></div><div class="ttdeci">void FillPathEvaluation(const std::vector< int64 > &path, const RoutingModel::TransitCallback2 &evaluator, std::vector< int64 > *values)</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l06202">routing.cc:6202</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_af92a8383a05fdf586a52263d358f5ada"><div class="ttname"><a href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a></div><div class="ttdeci">IntervalVar * interval</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l00098">resource.cc:98</a></div></div>
|
|
<div class="ttc" id="arouting_8h_html"><div class="ttname"><a href="routing_8h.html">routing.h</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_a10b672faee4b99c6a02feb0e343f3b0f"><div class="ttname"><a href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a></div><div class="ttdeci">int64 tail</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00127">routing_flow.cc:127</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_a26a8cbbc7bcf4117c2bf65104b4a54b4"><div class="ttname"><a href="routing__flow_8cc.html#a26a8cbbc7bcf4117c2bf65104b4a54b4">cost</a></div><div class="ttdeci">int64 cost</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00130">routing_flow.cc:130</a></div></div>
|
|
<div class="ttc" id="arouting__lp__scheduling_8h_html"><div class="ttname"><a href="routing__lp__scheduling_8h.html">routing_lp_scheduling.h</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_a204f9b990226e8288e1aaecbb496cbf8"><div class="ttname"><a href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a></div><div class="ttdeci">int64 bound</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00972">routing_search.cc:972</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_ab66ad179c8a6fcf1adb958cb51f4c7cb"><div class="ttname"><a href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a></div><div class="ttdeci">int64 coefficient</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00973">routing_search.cc:973</a></div></div>
|
|
<div class="ttc" id="asat_2lp__utils_8cc_html_a561d7bf12fc7674b3fe0ad2ba2e175a0"><div class="ttname"><a href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a></div><div class="ttdeci">std::vector< double > lower_bounds</div><div class="ttdef"><b>Definition:</b> <a href="sat_2lp__utils_8cc_source.html#l00497">sat/lp_utils.cc:497</a></div></div>
|
|
<div class="ttc" id="asaturated__arithmetic_8h_html"><div class="ttname"><a href="saturated__arithmetic_8h.html">saturated_arithmetic.h</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_afbb39f66221aac28bbdefd1dca2b2b0.html">constraint_solver</a></li><li class="navelem"><a class="el" href="routing__lp__scheduling_8cc.html">routing_lp_scheduling.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.1 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|