1710 lines
330 KiB
HTML
1710 lines
330 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.2"/>
|
|
<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">9.1</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.2 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('routing__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 id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#include "<a class="code" href="routing__lp__scheduling_8h.html">ortools/constraint_solver/routing_lp_scheduling.h</a>"</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span> </div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <deque></span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <functional></span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include <limits></span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include <numeric></span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include <utility></span></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span> </div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include "absl/memory/memory.h"</span></div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include "<a class="code" href="mathutil_8h.html">ortools/base/mathutil.h</a>"</span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include "<a class="code" href="constraint__solver_8h.html">ortools/constraint_solver/constraint_solver.h</a>"</span></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="preprocessor">#include "<a class="code" href="routing_8h.html">ortools/constraint_solver/routing.h</a>"</span></div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="preprocessor">#include "<a class="code" href="routing__parameters_8pb_8h.html">ortools/constraint_solver/routing_parameters.pb.h</a>"</span></div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="preprocessor">#include "<a class="code" href="parameters_8pb_8h.html">ortools/glop/parameters.pb.h</a>"</span></div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="preprocessor">#include "<a class="code" href="saturated__arithmetic_8h.html">ortools/util/saturated_arithmetic.h</a>"</span></div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="preprocessor">#include "<a class="code" href="sorted__interval__list_8h.html">ortools/util/sorted_interval_list.h</a>"</span></div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> </div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> </div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> </div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span><span class="comment">// The following sets of parameters give the fastest response time without</span></div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span><span class="comment">// impacting solutions found negatively.</span></div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span>glop::GlopParameters GetGlopParametersForLocalLP() {</div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> glop::GlopParameters <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>;</div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.set_use_dual_simplex(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.set_use_preprocessing(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>;</div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span>}</div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> </div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span>glop::GlopParameters GetGlopParametersForGlobalLP() {</div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> glop::GlopParameters <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>;</div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>.set_use_dual_simplex(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>;</div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span>}</div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> </div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span><span class="keywordtype">bool</span> GetCumulBoundsWithOffset(<span class="keyword">const</span> RoutingDimension& dimension,</div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> int64_t node_index, int64_t cumul_offset,</div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> int64_t* <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>, int64_t* <a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>) {</div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a> != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> </div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keyword">const</span> IntVar& cumul_var = *dimension.CumulVar(node_index);</div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> *<a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> = cumul_var.Max();</div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordflow">if</span> (*<a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> < cumul_offset) {</div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> }</div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> </div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="keyword">const</span> int64_t first_after_offset =</div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(dimension.GetFirstPossibleGreaterOrEqualValueForNode(</div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> node_index, cumul_offset),</div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> cumul_var.Min());</div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(first_after_offset, <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>());</div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> *<a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a> = <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(first_after_offset, cumul_offset);</div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(*<a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>, 0);</div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> </div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="keywordflow">if</span> (*<a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> == <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> }</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> *<a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> = <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(*<a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>, cumul_offset);</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(*<a class="code hl_variable" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>, *<a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>);</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span>}</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> </div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span>int64_t GetFirstPossibleValueForCumulWithOffset(</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="keyword">const</span> RoutingDimension& dimension, int64_t node_index,</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> int64_t lower_bound_without_offset, int64_t cumul_offset) {</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="keywordflow">return</span> <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> dimension.GetFirstPossibleGreaterOrEqualValueForNode(</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> node_index, <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(lower_bound_without_offset, cumul_offset)),</div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> cumul_offset);</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span>}</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> </div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span>int64_t GetLastPossibleValueForCumulWithOffset(</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="keyword">const</span> RoutingDimension& dimension, int64_t node_index,</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> int64_t upper_bound_without_offset, int64_t cumul_offset) {</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="keywordflow">return</span> <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(</div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> dimension.GetLastPossibleLessOrEqualValueForNode(</div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> node_index, <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(upper_bound_without_offset, cumul_offset)),</div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> cumul_offset);</div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span>}</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> </div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span><span class="comment">// Finds the pickup/delivery pairs of nodes on a given vehicle's route.</span></div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span><span class="comment">// Returns the vector of visited pair indices, and stores the corresponding</span></div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span><span class="comment">// pickup/delivery indices in visited_pickup_delivery_indices_for_pair_.</span></div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span><span class="comment">// NOTE: Supposes that visited_pickup_delivery_indices_for_pair is correctly</span></div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span><span class="comment">// sized and initialized to {-1, -1} for all pairs.</span></div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span><span class="keywordtype">void</span> StoreVisitedPickupDeliveryPairsOnRoute(</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="keyword">const</span> RoutingDimension& dimension, <span class="keywordtype">int</span> vehicle,</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> std::vector<int>* visited_pairs,</div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> std::vector<std::pair<int64_t, int64_t>>*</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> visited_pickup_delivery_indices_for_pair) {</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <span class="comment">// visited_pickup_delivery_indices_for_pair must be all {-1, -1}.</span></div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(visited_pickup_delivery_indices_for_pair->size(),</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> dimension.model()->GetPickupAndDeliveryPairs().size());</div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(std::all_of(visited_pickup_delivery_indices_for_pair->begin(),</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> visited_pickup_delivery_indices_for_pair->end(),</div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> [](std::pair<int64_t, int64_t> p) {</div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> return p.first == -1 && p.second == -1;</div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> }));</div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> visited_pairs->clear();</div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="keywordflow">if</span> (!dimension.HasPickupToDeliveryLimits()) {</div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> }</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="keyword">const</span> RoutingModel& <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a> = *dimension.model();</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> </div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> int64_t node_index = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.Start(vehicle);</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="keywordflow">while</span> (!<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.IsEnd(node_index)) {</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <span class="keyword">const</span> std::vector<std::pair<int, int>>& pickup_index_pairs =</div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.GetPickupIndexPairs(node_index);</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <span class="keyword">const</span> std::vector<std::pair<int, int>>& delivery_index_pairs =</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.GetDeliveryIndexPairs(node_index);</div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <span class="keywordflow">if</span> (!pickup_index_pairs.empty()) {</div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> <span class="comment">// The current node is a pickup. We verify that it belongs to a single</span></div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <span class="comment">// pickup index pair and that it's not a delivery, and store the index.</span></div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(delivery_index_pairs.empty());</div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(pickup_index_pairs.size(), 1);</div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> (*visited_pickup_delivery_indices_for_pair)[pickup_index_pairs[0].first]</div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> .first = node_index;</div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> visited_pairs->push_back(pickup_index_pairs[0].first);</div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!delivery_index_pairs.empty()) {</div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <span class="comment">// The node is a delivery. We verify that it belongs to a single</span></div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="comment">// delivery pair, and set the limit with its pickup if one has been</span></div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <span class="comment">// visited for this pair.</span></div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(delivery_index_pairs.size(), 1);</div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="keyword">const</span> <span class="keywordtype">int</span> pair_index = delivery_index_pairs[0].first;</div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> std::pair<int64_t, int64_t>& pickup_delivery_index =</div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> (*visited_pickup_delivery_indices_for_pair)[pair_index];</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <span class="keywordflow">if</span> (pickup_delivery_index.first < 0) {</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <span class="comment">// This case should not happen, as a delivery must have its pickup</span></div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="comment">// on the route, but we ignore it here.</span></div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> node_index = next_accessor(node_index);</div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> }</div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> pickup_delivery_index.second = node_index;</div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> }</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> node_index = next_accessor(node_index);</div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> }</div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span>}</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> </div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span>} <span class="comment">// namespace</span></div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> </div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a5bcbf49ff1a9dd9f92c40750ec0267b4"> 162</a></span><a class="code hl_function" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a5bcbf49ff1a9dd9f92c40750ec0267b4">LocalDimensionCumulOptimizer::LocalDimensionCumulOptimizer</a>(</div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* dimension,</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <a class="code hl_enumeration" href="namespaceoperations__research.html#a761463065b9e80673178ba0dda3634ba">RoutingSearchParameters::SchedulingSolver</a> solver_type)</div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> : optimizer_core_(dimension, <span class="comment">/*use_precedence_propagator=*/</span>false) {</div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</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 id="l00167" name="l00167"></a><span class="lineno"> 167</span> <span class="comment">// will be faster.</span></div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> <span class="keyword">const</span> <span class="keywordtype">int</span> vehicles = <a class="code hl_function" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a771ef9d454a03f02a8c884aacaf61765">dimension</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>();</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> solver_.resize(vehicles);</div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <span class="keywordflow">switch</span> (solver_type) {</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="keywordflow">case</span> <a class="code hl_variable" href="classoperations__research_1_1_routing_search_parameters.html#a4febdbfa765ae134a9a4e9b2c423006d">RoutingSearchParameters::GLOP</a>: {</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1glop_1_1_glop_parameters.html">glop::GlopParameters</a> <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a> = GetGlopParametersForLocalLP();</div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < vehicles; ++vehicle) {</div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="comment">// TODO(user): Instead of passing false, detect if the relaxation</span></div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="comment">// will always violate the MIPL constraints.</span></div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> solver_[vehicle] =</div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> absl::make_unique<RoutingGlopWrapper>(<span class="keyword">false</span>, <a class="code hl_variable" href="cp__model__fz__solver_8cc.html#a10a1eab179b472c030bdc2a2efef7219">parameters</a>);</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> }</div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> }</div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="keywordflow">case</span> <a class="code hl_variable" href="classoperations__research_1_1_routing_search_parameters.html#ace91ebd1fc3ed01aef3a25db50fbdda5">RoutingSearchParameters::CP_SAT</a>: {</div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < vehicles; ++vehicle) {</div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> solver_[vehicle] = absl::make_unique<RoutingCPSatWrapper>();</div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> }</div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> }</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <a class="code hl_define" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(DFATAL) << <span class="stringliteral">"Unrecognized solver type: "</span> << solver_type;</div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> }</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span>}</div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> </div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a10cab4b73bfe12bef44924a47c5345b6"> 192</a></span><a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code hl_function" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a10cab4b73bfe12bef44924a47c5345b6">LocalDimensionCumulOptimizer::ComputeRouteCumulCost</a>(</div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> int64_t* optimal_cost) {</div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <span class="keywordflow">return</span> optimizer_core_.<a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#ad8f55e0b1048c51c733207c60a2f87b0">OptimizeSingleRoute</a>(vehicle, next_accessor,</div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> solver_[vehicle].get(), <span class="keyword">nullptr</span>,</div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> <span class="keyword">nullptr</span>, optimal_cost, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span>}</div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> </div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span><a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a></div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a296e8d7e154740a84c59774f20a295ba"> 201</a></span><a class="code hl_function" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a296e8d7e154740a84c59774f20a295ba">LocalDimensionCumulOptimizer::ComputeRouteCumulCostWithoutFixedTransits</a>(</div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> int64_t* optimal_cost_without_transits) {</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> int64_t <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a> = 0;</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> int64_t transit_cost = 0;</div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="keyword">const</span> <a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> status = optimizer_core_.<a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#ad8f55e0b1048c51c733207c60a2f87b0">OptimizeSingleRoute</a>(</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> vehicle, next_accessor, solver_[vehicle].get(), <span class="keyword">nullptr</span>, <span class="keyword">nullptr</span>, &<a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>,</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> &transit_cost);</div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> <span class="keywordflow">if</span> (status != <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a> &&</div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> optimal_cost_without_transits != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> *optimal_cost_without_transits = <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(<a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>, transit_cost);</div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> }</div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> <span class="keywordflow">return</span> status;</div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span>}</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> </div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a161ed371fd2e35ef76b4539540bfcfd6"> 216</a></span><a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code hl_function" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a161ed371fd2e35ef76b4539540bfcfd6">LocalDimensionCumulOptimizer::ComputeRouteCumuls</a>(</div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> std::vector<int64_t>* optimal_cumuls,</div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> std::vector<int64_t>* optimal_breaks) {</div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> <span class="keywordflow">return</span> optimizer_core_.<a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#ad8f55e0b1048c51c733207c60a2f87b0">OptimizeSingleRoute</a>(</div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> vehicle, next_accessor, solver_[vehicle].get(), optimal_cumuls,</div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> optimal_breaks, <span class="keyword">nullptr</span>, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span>}</div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> </div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span><a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a></div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#ac8d866b9daf1876e81859fc2077b0fe2"> 226</a></span><a class="code hl_function" href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#ac8d866b9daf1876e81859fc2077b0fe2">LocalDimensionCumulOptimizer::ComputePackedRouteCumuls</a>(</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> std::vector<int64_t>* packed_cumuls, std::vector<int64_t>* packed_breaks) {</div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> <span class="keywordflow">return</span> optimizer_core_.<a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a876775ab31e400b8fd3d7a09db722135">OptimizeAndPackSingleRoute</a>(</div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> vehicle, next_accessor, solver_[vehicle].get(), packed_cumuls,</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> packed_breaks);</div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span>}</div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> </div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span><span class="keyword">const</span> <span class="keywordtype">int</span> CumulBoundsPropagator::kNoParent = -2;</div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span><span class="keyword">const</span> <span class="keywordtype">int</span> CumulBoundsPropagator::kParentToBePropagated = -1;</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> </div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cumul_bounds_propagator.html#aff8f29b2fce9f6447474ee6077af1b72"> 237</a></span><a class="code hl_function" href="classoperations__research_1_1_cumul_bounds_propagator.html#aff8f29b2fce9f6447474ee6077af1b72">CumulBoundsPropagator::CumulBoundsPropagator</a>(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* dimension)</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> : dimension_(*dimension), num_nodes_(2 * dimension->cumuls().size()) {</div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> outgoing_arcs_.resize(num_nodes_);</div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> node_in_queue_.resize(num_nodes_, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> tree_parent_node_of_.resize(num_nodes_, kNoParent);</div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> propagated_bounds_.resize(num_nodes_);</div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> visited_pickup_delivery_indices_for_pair_.resize(</div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> <a class="code hl_function" href="classoperations__research_1_1_cumul_bounds_propagator.html#a03e0559549552ae0d25421ab310f73e1">dimension</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a251dfaa30251901d13cd2f33a92571ac">GetPickupAndDeliveryPairs</a>().size(), {-1, -1});</div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span>}</div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> </div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</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 id="l00248" name="l00248"></a><span class="lineno"> 248</span> int64_t offset) {</div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> <span class="comment">// Add arc first_index + offset <= second_index</span></div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> outgoing_arcs_[PositiveNode(first_index)].push_back(</div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> {PositiveNode(second_index), offset});</div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> AddNodeToQueue(PositiveNode(first_index));</div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <span class="comment">// Add arc -second_index + transit <= -first_index</span></div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> outgoing_arcs_[NegativeNode(second_index)].push_back(</div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> {NegativeNode(first_index), offset});</div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> AddNodeToQueue(NegativeNode(second_index));</div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span>}</div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> </div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span><span class="keywordtype">bool</span> CumulBoundsPropagator::InitializeArcsAndBounds(</div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> int64_t cumul_offset) {</div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> propagated_bounds_.assign(num_nodes_, <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>());</div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> </div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> <span class="keywordflow">for</span> (std::vector<ArcInfo>& arcs : outgoing_arcs_) {</div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> arcs.clear();</div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> }</div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> </div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> RoutingModel* <span class="keyword">const</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a> = dimension_.<a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a90dcdb4d66f8781421f5913150a85a06">model</a>();</div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> std::vector<int64_t>& <a class="code hl_variable" href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a> = propagated_bounds_;</div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> </div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->vehicles(); vehicle++) {</div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> <span class="keyword">const</span> std::function<int64_t(int64_t, int64_t)>& transit_accessor =</div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> dimension_.<a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a5c170c586b06b6435f4e85cfc9db27e5">transit_evaluator</a>(vehicle);</div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> </div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> <span class="keywordtype">int</span> node = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Start(vehicle);</div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> int64_t cumul_lb, cumul_ub;</div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <span class="keywordflow">if</span> (!GetCumulBoundsWithOffset(dimension_, node, cumul_offset, &cumul_lb,</div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> &cumul_ub)) {</div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> }</div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> <a class="code hl_variable" href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a>[PositiveNode(node)] = cumul_lb;</div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> <span class="keywordflow">if</span> (cumul_ub < <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> <a class="code hl_variable" href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a>[NegativeNode(node)] = -cumul_ub;</div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> }</div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> </div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->IsEnd(node)) {</div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> }</div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> </div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = next_accessor(node);</div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> <span class="keyword">const</span> int64_t transit = transit_accessor(node, <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>);</div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> <span class="keyword">const</span> IntVar& slack_var = *dimension_.<a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a4232c22ddc9e65e726ee87cf27778072">SlackVar</a>(node);</div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> <span class="comment">// node + transit + slack_var == next</span></div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> <span class="comment">// Add arcs for node + transit + slack_min <= next</span></div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> AddArcs(node, <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(transit, slack_var.Min()));</div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> <span class="keywordflow">if</span> (slack_var.Max() < <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> <span class="comment">// Add arcs for node + transit + slack_max >= next.</span></div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> AddArcs(<a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>, node, <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(-slack_var.Max(), transit));</div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> }</div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> </div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> node = <a class="code hl_variable" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> }</div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> </div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> <span class="comment">// Add vehicle span upper bound: end - span_ub <= start.</span></div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> <span class="keyword">const</span> int64_t span_ub = dimension_.<a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a5ffb5c0e60db5d3939873fe92462bae9">GetSpanUpperBoundForVehicle</a>(vehicle);</div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> <span class="keywordflow">if</span> (span_ub < <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> AddArcs(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->End(vehicle), <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Start(vehicle), -span_ub);</div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> }</div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> </div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> <span class="comment">// Set pickup/delivery limits on route.</span></div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> std::vector<int> visited_pairs;</div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> StoreVisitedPickupDeliveryPairsOnRoute(</div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> dimension_, vehicle, next_accessor, &visited_pairs,</div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> &visited_pickup_delivery_indices_for_pair_);</div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pair_index : visited_pairs) {</div>
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> <span class="keyword">const</span> int64_t pickup_index =</div>
|
|
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> visited_pickup_delivery_indices_for_pair_[pair_index].first;</div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> <span class="keyword">const</span> int64_t delivery_index =</div>
|
|
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> visited_pickup_delivery_indices_for_pair_[pair_index].second;</div>
|
|
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> visited_pickup_delivery_indices_for_pair_[pair_index] = {-1, -1};</div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> </div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(pickup_index, 0);</div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> <span class="keywordflow">if</span> (delivery_index < 0) {</div>
|
|
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> <span class="comment">// We didn't encounter a delivery for this pickup.</span></div>
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> }</div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> </div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> <span class="keyword">const</span> int64_t limit = dimension_.<a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a3efd441f3accdd91d91ffbd1d4e1b255">GetPickupToDeliveryLimitForPair</a>(</div>
|
|
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span> pair_index, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetPickupIndexPairs(pickup_index)[0].second,</div>
|
|
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetDeliveryIndexPairs(delivery_index)[0].second);</div>
|
|
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span> <span class="keywordflow">if</span> (limit < <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div>
|
|
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span> <span class="comment">// delivery_cumul - limit <= pickup_cumul.</span></div>
|
|
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> AddArcs(delivery_index, pickup_index, -limit);</div>
|
|
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> }</div>
|
|
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> }</div>
|
|
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> }</div>
|
|
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> </div>
|
|
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> RoutingDimension::NodePrecedence& precedence :</div>
|
|
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> dimension_.<a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a96a6b6ac14b3f18c40e2e00b9e186842">GetNodePrecedences</a>()) {</div>
|
|
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> <span class="keyword">const</span> <span class="keywordtype">int</span> first_index = precedence.first_node;</div>
|
|
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> <span class="keyword">const</span> <span class="keywordtype">int</span> second_index = precedence.second_node;</div>
|
|
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a>[PositiveNode(first_index)] ==</div>
|
|
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>() ||</div>
|
|
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> <a class="code hl_variable" href="sat_2lp__utils_8cc.html#a561d7bf12fc7674b3fe0ad2ba2e175a0">lower_bounds</a>[PositiveNode(second_index)] ==</div>
|
|
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>()) {</div>
|
|
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> <span class="comment">// One of the nodes is unperformed, so the precedence rule doesn't apply.</span></div>
|
|
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> }</div>
|
|
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> AddArcs(first_index, second_index, precedence.offset);</div>
|
|
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> }</div>
|
|
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> </div>
|
|
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span>}</div>
|
|
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> </div>
|
|
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span><span class="keywordtype">bool</span> CumulBoundsPropagator::UpdateCurrentLowerBoundOfNode(<span class="keywordtype">int</span> node,</div>
|
|
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> int64_t new_lb,</div>
|
|
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> int64_t offset) {</div>
|
|
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> <span class="keyword">const</span> <span class="keywordtype">int</span> cumul_var_index = node / 2;</div>
|
|
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> </div>
|
|
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> <span class="keywordflow">if</span> (node == PositiveNode(cumul_var_index)) {</div>
|
|
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> <span class="comment">// new_lb is a lower bound of the cumul of variable 'cumul_var_index'.</span></div>
|
|
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> propagated_bounds_[node] = GetFirstPossibleValueForCumulWithOffset(</div>
|
|
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> dimension_, cumul_var_index, new_lb, offset);</div>
|
|
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> <span class="comment">// -new_lb is an upper bound of the cumul of variable 'cumul_var_index'.</span></div>
|
|
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> <span class="keyword">const</span> int64_t new_ub = <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(0, new_lb);</div>
|
|
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> propagated_bounds_[node] =</div>
|
|
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(0, GetLastPossibleValueForCumulWithOffset(</div>
|
|
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> dimension_, cumul_var_index, new_ub, offset));</div>
|
|
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> }</div>
|
|
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> </div>
|
|
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> <span class="comment">// Test that the lower/upper bounds do not cross each other.</span></div>
|
|
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> <span class="keyword">const</span> int64_t cumul_lower_bound =</div>
|
|
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> propagated_bounds_[PositiveNode(cumul_var_index)];</div>
|
|
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> </div>
|
|
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> <span class="keyword">const</span> int64_t negated_cumul_upper_bound =</div>
|
|
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> propagated_bounds_[NegativeNode(cumul_var_index)];</div>
|
|
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> </div>
|
|
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span> <span class="keywordflow">return</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(negated_cumul_upper_bound, cumul_lower_bound) <= 0;</div>
|
|
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span>}</div>
|
|
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> </div>
|
|
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</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 id="l00384" name="l00384"></a><span class="lineno"> 384</span> tmp_dfs_stack_.clear();</div>
|
|
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span> tmp_dfs_stack_.push_back(source);</div>
|
|
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span> <span class="keywordflow">while</span> (!tmp_dfs_stack_.empty()) {</div>
|
|
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="routing__flow_8cc.html#a64e7efc5529154ba56903e75f5300990">tail</a> = tmp_dfs_stack_.back();</div>
|
|
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> tmp_dfs_stack_.pop_back();</div>
|
|
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> ArcInfo& arc : outgoing_arcs_[<a class="code hl_variable" href="routing__flow_8cc.html#a64e7efc5529154ba56903e75f5300990">tail</a>]) {</div>
|
|
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> <span class="keyword">const</span> <span class="keywordtype">int</span> child_node = arc.head;</div>
|
|
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> <span class="keywordflow">if</span> (tree_parent_node_of_[child_node] != <a class="code hl_variable" href="routing__flow_8cc.html#a64e7efc5529154ba56903e75f5300990">tail</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> <span class="keywordflow">if</span> (child_node == target) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> tree_parent_node_of_[child_node] = kParentToBePropagated;</div>
|
|
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> tmp_dfs_stack_.push_back(child_node);</div>
|
|
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> }</div>
|
|
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</span> }</div>
|
|
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span>}</div>
|
|
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span> </div>
|
|
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_cumul_bounds_propagator.html#aa83a7ff5ef57860290d9838959d6ecf1"> 400</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_cumul_bounds_propagator.html#aa83a7ff5ef57860290d9838959d6ecf1">CumulBoundsPropagator::PropagateCumulBounds</a>(</div>
|
|
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span> <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span> int64_t cumul_offset) {</div>
|
|
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span> tree_parent_node_of_.assign(num_nodes_, kNoParent);</div>
|
|
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(std::none_of(node_in_queue_.begin(), node_in_queue_.end(),</div>
|
|
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> [](<span class="keywordtype">bool</span> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) { return b; }));</div>
|
|
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(bf_queue_.empty());</div>
|
|
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span> </div>
|
|
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span> <span class="keywordflow">if</span> (!InitializeArcsAndBounds(next_accessor, cumul_offset)) {</div>
|
|
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> <span class="keywordflow">return</span> CleanupAndReturnFalse();</div>
|
|
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span> }</div>
|
|
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span> </div>
|
|
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> std::vector<int64_t>& current_lb = propagated_bounds_;</div>
|
|
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span> </div>
|
|
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"> 414</span> <span class="comment">// Bellman-Ford-Tarjan algorithm.</span></div>
|
|
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"> 415</span> <span class="keywordflow">while</span> (!bf_queue_.empty()) {</div>
|
|
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span> <span class="keyword">const</span> <span class="keywordtype">int</span> node = bf_queue_.front();</div>
|
|
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span> bf_queue_.pop_front();</div>
|
|
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno"> 418</span> node_in_queue_[node] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"> 419</span> </div>
|
|
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span> <span class="keywordflow">if</span> (tree_parent_node_of_[node] == kParentToBePropagated) {</div>
|
|
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</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 id="l00422" name="l00422"></a><span class="lineno"> 422</span> <span class="comment">// node now, since it will be re-enqued when its parent is processed.</span></div>
|
|
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno"> 423</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno"> 424</span> }</div>
|
|
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno"> 425</span> </div>
|
|
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno"> 426</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a> = current_lb[node];</div>
|
|
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno"> 427</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> ArcInfo& arc : outgoing_arcs_[node]) {</div>
|
|
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno"> 428</span> <span class="comment">// NOTE: kint64min as a lower bound means no lower bound at all, so we</span></div>
|
|
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> <span class="comment">// don't use this value to propagate.</span></div>
|
|
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> <span class="keyword">const</span> int64_t induced_lb =</div>
|
|
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> (<a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a> == <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>())</div>
|
|
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> ? <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>()</div>
|
|
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> : <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code hl_variable" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>, arc.offset);</div>
|
|
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> </div>
|
|
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> <span class="keyword">const</span> <span class="keywordtype">int</span> head_node = arc.head;</div>
|
|
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno"> 436</span> <span class="keywordflow">if</span> (induced_lb <= current_lb[head_node]) {</div>
|
|
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno"> 437</span> <span class="comment">// No update necessary for the head_node, continue to next children of</span></div>
|
|
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno"> 438</span> <span class="comment">// node.</span></div>
|
|
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno"> 439</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno"> 440</span> }</div>
|
|
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno"> 441</span> <span class="keywordflow">if</span> (!UpdateCurrentLowerBoundOfNode(head_node, induced_lb, cumul_offset) ||</div>
|
|
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno"> 442</span> !DisassembleSubtree(head_node, node)) {</div>
|
|
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno"> 443</span> <span class="comment">// The new lower bound is infeasible, or a positive cycle was detected</span></div>
|
|
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"> 444</span> <span class="comment">// in the precedence graph by DisassembleSubtree().</span></div>
|
|
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"> 445</span> <span class="keywordflow">return</span> CleanupAndReturnFalse();</div>
|
|
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"> 446</span> }</div>
|
|
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno"> 447</span> </div>
|
|
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno"> 448</span> tree_parent_node_of_[head_node] = node;</div>
|
|
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno"> 449</span> AddNodeToQueue(head_node);</div>
|
|
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno"> 450</span> }</div>
|
|
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno"> 451</span> }</div>
|
|
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno"> 452</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno"> 453</span>}</div>
|
|
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno"> 454</span> </div>
|
|
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a5967f72ac911a2ed971a1ce103d1c47b"> 455</a></span><a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a5967f72ac911a2ed971a1ce103d1c47b">DimensionCumulOptimizerCore::DimensionCumulOptimizerCore</a>(</div>
|
|
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno"> 456</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* dimension, <span class="keywordtype">bool</span> use_precedence_propagator)</div>
|
|
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"> 457</span> : dimension_(dimension),</div>
|
|
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"> 458</span> visited_pickup_delivery_indices_for_pair_(</div>
|
|
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno"> 459</span> dimension-><a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->GetPickupAndDeliveryPairs().size(), {-1, -1}) {</div>
|
|
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"> 460</span> <span class="keywordflow">if</span> (use_precedence_propagator) {</div>
|
|
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno"> 461</span> propagator_ = absl::make_unique<CumulBoundsPropagator>(dimension);</div>
|
|
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> }</div>
|
|
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span> <span class="keywordflow">if</span> (dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a6debc638c02bfb2b4afe0afccdd98ca5">HasBreakConstraints</a>()) {</div>
|
|
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno"> 464</span> <span class="comment">// Initialize vehicle_to_first_index_ so the variables of the breaks of</span></div>
|
|
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span> <span class="comment">// vehicle v are stored from vehicle_to_first_index_[v] to</span></div>
|
|
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> <span class="comment">// vehicle_to_first_index_[v+1] - 1.</span></div>
|
|
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_vehicles = dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>();</div>
|
|
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span> vehicle_to_all_break_variables_offset_.reserve(num_vehicles);</div>
|
|
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno"> 469</span> <span class="keywordtype">int</span> num_break_vars = 0;</div>
|
|
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno"> 470</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < num_vehicles; ++vehicle) {</div>
|
|
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno"> 471</span> vehicle_to_all_break_variables_offset_.push_back(num_break_vars);</div>
|
|
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno"> 472</span> <span class="keyword">const</span> <span class="keyword">auto</span>& intervals = dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle);</div>
|
|
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno"> 473</span> num_break_vars += 2 * intervals.size(); <span class="comment">// 2 variables per break.</span></div>
|
|
<div class="line"><a id="l00474" name="l00474"></a><span class="lineno"> 474</span> }</div>
|
|
<div class="line"><a id="l00475" name="l00475"></a><span class="lineno"> 475</span> all_break_variables_.resize(num_break_vars, -1);</div>
|
|
<div class="line"><a id="l00476" name="l00476"></a><span class="lineno"> 476</span> }</div>
|
|
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno"> 477</span>}</div>
|
|
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno"> 478</span> </div>
|
|
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#ad8f55e0b1048c51c733207c60a2f87b0"> 479</a></span><a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#ad8f55e0b1048c51c733207c60a2f87b0">DimensionCumulOptimizerCore::OptimizeSingleRoute</a>(</div>
|
|
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno"> 480</span> <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno"> 481</span> <a class="code hl_class" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver, std::vector<int64_t>* cumul_values,</div>
|
|
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno"> 482</span> std::vector<int64_t>* break_values, int64_t* <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>, int64_t* transit_cost,</div>
|
|
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno"> 483</span> <span class="keywordtype">bool</span> clear_lp) {</div>
|
|
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno"> 484</span> InitOptimizer(solver);</div>
|
|
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno"> 485</span> <span class="comment">// Make sure SetRouteCumulConstraints will properly set the cumul bounds by</span></div>
|
|
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno"> 486</span> <span class="comment">// looking at this route only.</span></div>
|
|
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno"> 487</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(propagator_ == <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno"> 488</span> </div>
|
|
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno"> 489</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <span class="keyword">const</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a> = <a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a771ef9d454a03f02a8c884aacaf61765">dimension</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a90dcdb4d66f8781421f5913150a85a06">model</a>();</div>
|
|
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno"> 490</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> optimize_vehicle_costs =</div>
|
|
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno"> 491</span> (cumul_values != <span class="keyword">nullptr</span> || <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a> != <span class="keyword">nullptr</span>) &&</div>
|
|
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno"> 492</span> (!<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->IsEnd(next_accessor(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Start(vehicle))) ||</div>
|
|
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno"> 493</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->AreEmptyRouteCostsConsideredForVehicle(vehicle));</div>
|
|
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno"> 494</span> <span class="keyword">const</span> int64_t cumul_offset =</div>
|
|
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno"> 495</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#ac49d19c473861fd725540574c9779f7f">GetLocalOptimizerOffsetForVehicle</a>(vehicle);</div>
|
|
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno"> 496</span> int64_t cost_offset = 0;</div>
|
|
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno"> 497</span> <span class="keywordflow">if</span> (!SetRouteCumulConstraints(vehicle, next_accessor, cumul_offset,</div>
|
|
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"> 498</span> optimize_vehicle_costs, solver, transit_cost,</div>
|
|
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno"> 499</span> &cost_offset)) {</div>
|
|
<div class="line"><a id="l00500" name="l00500"></a><span class="lineno"> 500</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00501" name="l00501"></a><span class="lineno"> 501</span> }</div>
|
|
<div class="line"><a id="l00502" name="l00502"></a><span class="lineno"> 502</span> <span class="keyword">const</span> <a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> status =</div>
|
|
<div class="line"><a id="l00503" name="l00503"></a><span class="lineno"> 503</span> solver-><a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#acb5447abf2fd0ef52e46ce561ffef5cb">Solve</a>(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->RemainingTime());</div>
|
|
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno"> 504</span> <span class="keywordflow">if</span> (status == <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno"> 505</span> <span class="keywordflow">return</span> status;</div>
|
|
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno"> 506</span> }</div>
|
|
<div class="line"><a id="l00507" name="l00507"></a><span class="lineno"> 507</span> </div>
|
|
<div class="line"><a id="l00508" name="l00508"></a><span class="lineno"> 508</span> SetValuesFromLP(current_route_cumul_variables_, cumul_offset, solver,</div>
|
|
<div class="line"><a id="l00509" name="l00509"></a><span class="lineno"> 509</span> cumul_values);</div>
|
|
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno"> 510</span> SetValuesFromLP(current_route_break_variables_, cumul_offset, solver,</div>
|
|
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno"> 511</span> break_values);</div>
|
|
<div class="line"><a id="l00512" name="l00512"></a><span class="lineno"> 512</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a> != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno"> 513</span> *<a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a> = <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(cost_offset, solver-><a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa7ad30a5bcbd156380533cc7abb69172">GetObjectiveValue</a>());</div>
|
|
<div class="line"><a id="l00514" name="l00514"></a><span class="lineno"> 514</span> }</div>
|
|
<div class="line"><a id="l00515" name="l00515"></a><span class="lineno"> 515</span> </div>
|
|
<div class="line"><a id="l00516" name="l00516"></a><span class="lineno"> 516</span> <span class="keywordflow">if</span> (clear_lp) {</div>
|
|
<div class="line"><a id="l00517" name="l00517"></a><span class="lineno"> 517</span> solver-><a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa5b31c976cc6734003d9950e731dfed3">Clear</a>();</div>
|
|
<div class="line"><a id="l00518" name="l00518"></a><span class="lineno"> 518</span> }</div>
|
|
<div class="line"><a id="l00519" name="l00519"></a><span class="lineno"> 519</span> <span class="keywordflow">return</span> status;</div>
|
|
<div class="line"><a id="l00520" name="l00520"></a><span class="lineno"> 520</span>}</div>
|
|
<div class="line"><a id="l00521" name="l00521"></a><span class="lineno"> 521</span> </div>
|
|
<div class="line"><a id="l00522" name="l00522"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#ac4a567218a28367c808aecf882d39a60"> 522</a></span><a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#ac4a567218a28367c808aecf882d39a60">DimensionCumulOptimizerCore::Optimize</a>(</div>
|
|
<div class="line"><a id="l00523" name="l00523"></a><span class="lineno"> 523</span> <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00524" name="l00524"></a><span class="lineno"> 524</span> <a class="code hl_class" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver, std::vector<int64_t>* cumul_values,</div>
|
|
<div class="line"><a id="l00525" name="l00525"></a><span class="lineno"> 525</span> std::vector<int64_t>* break_values, int64_t* <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>, int64_t* transit_cost,</div>
|
|
<div class="line"><a id="l00526" name="l00526"></a><span class="lineno"> 526</span> <span class="keywordtype">bool</span> clear_lp) {</div>
|
|
<div class="line"><a id="l00527" name="l00527"></a><span class="lineno"> 527</span> InitOptimizer(solver);</div>
|
|
<div class="line"><a id="l00528" name="l00528"></a><span class="lineno"> 528</span> </div>
|
|
<div class="line"><a id="l00529" name="l00529"></a><span class="lineno"> 529</span> <span class="comment">// If both "cumul_values" and "cost" parameters are null, we don't try to</span></div>
|
|
<div class="line"><a id="l00530" name="l00530"></a><span class="lineno"> 530</span> <span class="comment">// optimize the cost and stop at the first feasible solution.</span></div>
|
|
<div class="line"><a id="l00531" name="l00531"></a><span class="lineno"> 531</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> optimize_costs = (cumul_values != <span class="keyword">nullptr</span>) || (<a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a> != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00532" name="l00532"></a><span class="lineno"> 532</span> <span class="keywordtype">bool</span> has_vehicles_being_optimized = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00533" name="l00533"></a><span class="lineno"> 533</span> </div>
|
|
<div class="line"><a id="l00534" name="l00534"></a><span class="lineno"> 534</span> <span class="keyword">const</span> int64_t cumul_offset = dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a38a1205e1e6fec4a632d523a64856c4b">GetGlobalOptimizerOffset</a>();</div>
|
|
<div class="line"><a id="l00535" name="l00535"></a><span class="lineno"> 535</span> </div>
|
|
<div class="line"><a id="l00536" name="l00536"></a><span class="lineno"> 536</span> <span class="keywordflow">if</span> (propagator_ != <span class="keyword">nullptr</span> &&</div>
|
|
<div class="line"><a id="l00537" name="l00537"></a><span class="lineno"> 537</span> !propagator_->PropagateCumulBounds(next_accessor, cumul_offset)) {</div>
|
|
<div class="line"><a id="l00538" name="l00538"></a><span class="lineno"> 538</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00539" name="l00539"></a><span class="lineno"> 539</span> }</div>
|
|
<div class="line"><a id="l00540" name="l00540"></a><span class="lineno"> 540</span> </div>
|
|
<div class="line"><a id="l00541" name="l00541"></a><span class="lineno"> 541</span> int64_t total_transit_cost = 0;</div>
|
|
<div class="line"><a id="l00542" name="l00542"></a><span class="lineno"> 542</span> int64_t total_cost_offset = 0;</div>
|
|
<div class="line"><a id="l00543" name="l00543"></a><span class="lineno"> 543</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a> = <a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a771ef9d454a03f02a8c884aacaf61765">dimension</a>()-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a90dcdb4d66f8781421f5913150a85a06">model</a>();</div>
|
|
<div class="line"><a id="l00544" name="l00544"></a><span class="lineno"> 544</span> <span class="keywordtype">int</span> num_needed_resources = 0;</div>
|
|
<div class="line"><a id="l00545" name="l00545"></a><span class="lineno"> 545</span> <span class="keywordtype">int</span> num_available_resources = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->vehicles();</div>
|
|
<div class="line"><a id="l00546" name="l00546"></a><span class="lineno"> 546</span> <span class="keyword">const</span> <span class="keyword">auto</span>& resource_groups = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetResourceGroups();</div>
|
|
<div class="line"><a id="l00547" name="l00547"></a><span class="lineno"> 547</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> rg_index : <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetDimensionResourceGroupIndices(dimension_)) {</div>
|
|
<div class="line"><a id="l00548" name="l00548"></a><span class="lineno"> 548</span> num_available_resources =</div>
|
|
<div class="line"><a id="l00549" name="l00549"></a><span class="lineno"> 549</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(num_available_resources, resource_groups[rg_index]->Size());</div>
|
|
<div class="line"><a id="l00550" name="l00550"></a><span class="lineno"> 550</span> }</div>
|
|
<div class="line"><a id="l00551" name="l00551"></a><span class="lineno"> 551</span> <a class="code hl_define" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(num_available_resources, 0);</div>
|
|
<div class="line"><a id="l00552" name="l00552"></a><span class="lineno"> 552</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->vehicles(); vehicle++) {</div>
|
|
<div class="line"><a id="l00553" name="l00553"></a><span class="lineno"> 553</span> int64_t route_transit_cost = 0;</div>
|
|
<div class="line"><a id="l00554" name="l00554"></a><span class="lineno"> 554</span> int64_t route_cost_offset = 0;</div>
|
|
<div class="line"><a id="l00555" name="l00555"></a><span class="lineno"> 555</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> vehicle_is_used =</div>
|
|
<div class="line"><a id="l00556" name="l00556"></a><span class="lineno"> 556</span> !<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->IsEnd(next_accessor(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Start(vehicle))) ||</div>
|
|
<div class="line"><a id="l00557" name="l00557"></a><span class="lineno"> 557</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->AreEmptyRouteCostsConsideredForVehicle(vehicle);</div>
|
|
<div class="line"><a id="l00558" name="l00558"></a><span class="lineno"> 558</span> <span class="keywordflow">if</span> (vehicle_is_used && ++num_needed_resources > num_available_resources) {</div>
|
|
<div class="line"><a id="l00559" name="l00559"></a><span class="lineno"> 559</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00560" name="l00560"></a><span class="lineno"> 560</span> }</div>
|
|
<div class="line"><a id="l00561" name="l00561"></a><span class="lineno"> 561</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> optimize_vehicle_costs = optimize_costs && vehicle_is_used;</div>
|
|
<div class="line"><a id="l00562" name="l00562"></a><span class="lineno"> 562</span> <span class="keywordflow">if</span> (!SetRouteCumulConstraints(vehicle, next_accessor, cumul_offset,</div>
|
|
<div class="line"><a id="l00563" name="l00563"></a><span class="lineno"> 563</span> optimize_vehicle_costs, solver,</div>
|
|
<div class="line"><a id="l00564" name="l00564"></a><span class="lineno"> 564</span> &route_transit_cost, &route_cost_offset)) {</div>
|
|
<div class="line"><a id="l00565" name="l00565"></a><span class="lineno"> 565</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00566" name="l00566"></a><span class="lineno"> 566</span> }</div>
|
|
<div class="line"><a id="l00567" name="l00567"></a><span class="lineno"> 567</span> total_transit_cost = <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(total_transit_cost, route_transit_cost);</div>
|
|
<div class="line"><a id="l00568" name="l00568"></a><span class="lineno"> 568</span> total_cost_offset = <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(total_cost_offset, route_cost_offset);</div>
|
|
<div class="line"><a id="l00569" name="l00569"></a><span class="lineno"> 569</span> has_vehicles_being_optimized |= optimize_vehicle_costs;</div>
|
|
<div class="line"><a id="l00570" name="l00570"></a><span class="lineno"> 570</span> }</div>
|
|
<div class="line"><a id="l00571" name="l00571"></a><span class="lineno"> 571</span> <span class="keywordflow">if</span> (transit_cost != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l00572" name="l00572"></a><span class="lineno"> 572</span> *transit_cost = total_transit_cost;</div>
|
|
<div class="line"><a id="l00573" name="l00573"></a><span class="lineno"> 573</span> }</div>
|
|
<div class="line"><a id="l00574" name="l00574"></a><span class="lineno"> 574</span> </div>
|
|
<div class="line"><a id="l00575" name="l00575"></a><span class="lineno"> 575</span> SetGlobalConstraints(next_accessor, cumul_offset,</div>
|
|
<div class="line"><a id="l00576" name="l00576"></a><span class="lineno"> 576</span> has_vehicles_being_optimized, solver);</div>
|
|
<div class="line"><a id="l00577" name="l00577"></a><span class="lineno"> 577</span> </div>
|
|
<div class="line"><a id="l00578" name="l00578"></a><span class="lineno"> 578</span> <span class="keyword">const</span> <a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> status =</div>
|
|
<div class="line"><a id="l00579" name="l00579"></a><span class="lineno"> 579</span> solver-><a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#acb5447abf2fd0ef52e46ce561ffef5cb">Solve</a>(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->RemainingTime());</div>
|
|
<div class="line"><a id="l00580" name="l00580"></a><span class="lineno"> 580</span> <span class="keywordflow">if</span> (status == <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a id="l00581" name="l00581"></a><span class="lineno"> 581</span> <span class="keywordflow">return</span> status;</div>
|
|
<div class="line"><a id="l00582" name="l00582"></a><span class="lineno"> 582</span> }</div>
|
|
<div class="line"><a id="l00583" name="l00583"></a><span class="lineno"> 583</span> </div>
|
|
<div class="line"><a id="l00584" name="l00584"></a><span class="lineno"> 584</span> <span class="comment">// TODO(user): In case the status is RELAXED_OPTIMAL_ONLY, check we can</span></div>
|
|
<div class="line"><a id="l00585" name="l00585"></a><span class="lineno"> 585</span> <span class="comment">// safely avoid filling variable and cost values.</span></div>
|
|
<div class="line"><a id="l00586" name="l00586"></a><span class="lineno"> 586</span> SetValuesFromLP(index_to_cumul_variable_, cumul_offset, solver, cumul_values);</div>
|
|
<div class="line"><a id="l00587" name="l00587"></a><span class="lineno"> 587</span> SetValuesFromLP(all_break_variables_, cumul_offset, solver, break_values);</div>
|
|
<div class="line"><a id="l00588" name="l00588"></a><span class="lineno"> 588</span> </div>
|
|
<div class="line"><a id="l00589" name="l00589"></a><span class="lineno"> 589</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a> != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l00590" name="l00590"></a><span class="lineno"> 590</span> *<a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a> = <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(solver-><a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa7ad30a5bcbd156380533cc7abb69172">GetObjectiveValue</a>(), total_cost_offset);</div>
|
|
<div class="line"><a id="l00591" name="l00591"></a><span class="lineno"> 591</span> }</div>
|
|
<div class="line"><a id="l00592" name="l00592"></a><span class="lineno"> 592</span> </div>
|
|
<div class="line"><a id="l00593" name="l00593"></a><span class="lineno"> 593</span> <span class="keywordflow">if</span> (clear_lp) {</div>
|
|
<div class="line"><a id="l00594" name="l00594"></a><span class="lineno"> 594</span> solver-><a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa5b31c976cc6734003d9950e731dfed3">Clear</a>();</div>
|
|
<div class="line"><a id="l00595" name="l00595"></a><span class="lineno"> 595</span> }</div>
|
|
<div class="line"><a id="l00596" name="l00596"></a><span class="lineno"> 596</span> <span class="keywordflow">return</span> status;</div>
|
|
<div class="line"><a id="l00597" name="l00597"></a><span class="lineno"> 597</span>}</div>
|
|
<div class="line"><a id="l00598" name="l00598"></a><span class="lineno"> 598</span> </div>
|
|
<div class="line"><a id="l00599" name="l00599"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#aa30424ff76b8cc3d20f238657df1f798"> 599</a></span><a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#aa30424ff76b8cc3d20f238657df1f798">DimensionCumulOptimizerCore::OptimizeAndPack</a>(</div>
|
|
<div class="line"><a id="l00600" name="l00600"></a><span class="lineno"> 600</span> <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00601" name="l00601"></a><span class="lineno"> 601</span> <a class="code hl_class" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver, std::vector<int64_t>* cumul_values,</div>
|
|
<div class="line"><a id="l00602" name="l00602"></a><span class="lineno"> 602</span> std::vector<int64_t>* break_values) {</div>
|
|
<div class="line"><a id="l00603" name="l00603"></a><span class="lineno"> 603</span> <span class="comment">// Note: We pass a non-nullptr cost to the Optimize() method so the costs</span></div>
|
|
<div class="line"><a id="l00604" name="l00604"></a><span class="lineno"> 604</span> <span class="comment">// are optimized by the solver.</span></div>
|
|
<div class="line"><a id="l00605" name="l00605"></a><span class="lineno"> 605</span> int64_t <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a> = 0;</div>
|
|
<div class="line"><a id="l00606" name="l00606"></a><span class="lineno"> 606</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#ac4a567218a28367c808aecf882d39a60">Optimize</a>(next_accessor, solver,</div>
|
|
<div class="line"><a id="l00607" name="l00607"></a><span class="lineno"> 607</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 hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>,</div>
|
|
<div class="line"><a id="l00608" name="l00608"></a><span class="lineno"> 608</span> <span class="comment">/*transit_cost=*/</span><span class="keyword">nullptr</span>,</div>
|
|
<div class="line"><a id="l00609" name="l00609"></a><span class="lineno"> 609</span> <span class="comment">/*clear_lp=*/</span><span class="keyword">false</span>) == <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a id="l00610" name="l00610"></a><span class="lineno"> 610</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00611" name="l00611"></a><span class="lineno"> 611</span> }</div>
|
|
<div class="line"><a id="l00612" name="l00612"></a><span class="lineno"> 612</span> std::vector<int> vehicles(<a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a771ef9d454a03f02a8c884aacaf61765">dimension</a>()-><a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->vehicles());</div>
|
|
<div class="line"><a id="l00613" name="l00613"></a><span class="lineno"> 613</span> std::iota(vehicles.begin(), vehicles.end(), 0);</div>
|
|
<div class="line"><a id="l00614" name="l00614"></a><span class="lineno"> 614</span> <span class="comment">// Subtle: Even if the status was RELAXED_OPTIMAL_ONLY we try to pack just in</span></div>
|
|
<div class="line"><a id="l00615" name="l00615"></a><span class="lineno"> 615</span> <span class="comment">// case packing manages to make the solution completely feasible.</span></div>
|
|
<div class="line"><a id="l00616" name="l00616"></a><span class="lineno"> 616</span> <a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> status = PackRoutes(vehicles, solver);</div>
|
|
<div class="line"><a id="l00617" name="l00617"></a><span class="lineno"> 617</span> <span class="keywordflow">if</span> (status == <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a id="l00618" name="l00618"></a><span class="lineno"> 618</span> <span class="keywordflow">return</span> status;</div>
|
|
<div class="line"><a id="l00619" name="l00619"></a><span class="lineno"> 619</span> }</div>
|
|
<div class="line"><a id="l00620" name="l00620"></a><span class="lineno"> 620</span> <span class="comment">// TODO(user): In case the status is RELAXED_OPTIMAL_ONLY, check we can</span></div>
|
|
<div class="line"><a id="l00621" name="l00621"></a><span class="lineno"> 621</span> <span class="comment">// safely avoid filling variable values.</span></div>
|
|
<div class="line"><a id="l00622" name="l00622"></a><span class="lineno"> 622</span> <span class="keyword">const</span> int64_t global_offset = dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a38a1205e1e6fec4a632d523a64856c4b">GetGlobalOptimizerOffset</a>();</div>
|
|
<div class="line"><a id="l00623" name="l00623"></a><span class="lineno"> 623</span> SetValuesFromLP(index_to_cumul_variable_, global_offset, solver,</div>
|
|
<div class="line"><a id="l00624" name="l00624"></a><span class="lineno"> 624</span> cumul_values);</div>
|
|
<div class="line"><a id="l00625" name="l00625"></a><span class="lineno"> 625</span> SetValuesFromLP(all_break_variables_, global_offset, solver, break_values);</div>
|
|
<div class="line"><a id="l00626" name="l00626"></a><span class="lineno"> 626</span> solver-><a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa5b31c976cc6734003d9950e731dfed3">Clear</a>();</div>
|
|
<div class="line"><a id="l00627" name="l00627"></a><span class="lineno"> 627</span> <span class="keywordflow">return</span> status;</div>
|
|
<div class="line"><a id="l00628" name="l00628"></a><span class="lineno"> 628</span>}</div>
|
|
<div class="line"><a id="l00629" name="l00629"></a><span class="lineno"> 629</span> </div>
|
|
<div class="line"><a id="l00630" name="l00630"></a><span class="lineno"> 630</span><a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a></div>
|
|
<div class="line"><a id="l00631" name="l00631"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a876775ab31e400b8fd3d7a09db722135"> 631</a></span><a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a876775ab31e400b8fd3d7a09db722135">DimensionCumulOptimizerCore::OptimizeAndPackSingleRoute</a>(</div>
|
|
<div class="line"><a id="l00632" name="l00632"></a><span class="lineno"> 632</span> <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00633" name="l00633"></a><span class="lineno"> 633</span> <a class="code hl_class" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver, std::vector<int64_t>* cumul_values,</div>
|
|
<div class="line"><a id="l00634" name="l00634"></a><span class="lineno"> 634</span> std::vector<int64_t>* break_values) {</div>
|
|
<div class="line"><a id="l00635" name="l00635"></a><span class="lineno"> 635</span> <span class="comment">// Note: We pass a non-nullptr cost to the OptimizeSingleRoute() method so the</span></div>
|
|
<div class="line"><a id="l00636" name="l00636"></a><span class="lineno"> 636</span> <span class="comment">// costs are optimized by the LP.</span></div>
|
|
<div class="line"><a id="l00637" name="l00637"></a><span class="lineno"> 637</span> int64_t <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a> = 0;</div>
|
|
<div class="line"><a id="l00638" name="l00638"></a><span class="lineno"> 638</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#ad8f55e0b1048c51c733207c60a2f87b0">OptimizeSingleRoute</a>(vehicle, next_accessor, solver,</div>
|
|
<div class="line"><a id="l00639" name="l00639"></a><span class="lineno"> 639</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 id="l00640" name="l00640"></a><span class="lineno"> 640</span> &<a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>, <span class="comment">/*transit_cost=*/</span><span class="keyword">nullptr</span>,</div>
|
|
<div class="line"><a id="l00641" name="l00641"></a><span class="lineno"> 641</span> <span class="comment">/*clear_lp=*/</span><span class="keyword">false</span>) ==</div>
|
|
<div class="line"><a id="l00642" name="l00642"></a><span class="lineno"> 642</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a id="l00643" name="l00643"></a><span class="lineno"> 643</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00644" name="l00644"></a><span class="lineno"> 644</span> }</div>
|
|
<div class="line"><a id="l00645" name="l00645"></a><span class="lineno"> 645</span> <span class="keyword">const</span> <a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> status = PackRoutes({vehicle}, solver);</div>
|
|
<div class="line"><a id="l00646" name="l00646"></a><span class="lineno"> 646</span> <span class="keywordflow">if</span> (status == <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a id="l00647" name="l00647"></a><span class="lineno"> 647</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00648" name="l00648"></a><span class="lineno"> 648</span> }</div>
|
|
<div class="line"><a id="l00649" name="l00649"></a><span class="lineno"> 649</span> <span class="keyword">const</span> int64_t local_offset =</div>
|
|
<div class="line"><a id="l00650" name="l00650"></a><span class="lineno"> 650</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#ac49d19c473861fd725540574c9779f7f">GetLocalOptimizerOffsetForVehicle</a>(vehicle);</div>
|
|
<div class="line"><a id="l00651" name="l00651"></a><span class="lineno"> 651</span> SetValuesFromLP(current_route_cumul_variables_, local_offset, solver,</div>
|
|
<div class="line"><a id="l00652" name="l00652"></a><span class="lineno"> 652</span> cumul_values);</div>
|
|
<div class="line"><a id="l00653" name="l00653"></a><span class="lineno"> 653</span> SetValuesFromLP(current_route_break_variables_, local_offset, solver,</div>
|
|
<div class="line"><a id="l00654" name="l00654"></a><span class="lineno"> 654</span> break_values);</div>
|
|
<div class="line"><a id="l00655" name="l00655"></a><span class="lineno"> 655</span> solver-><a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa5b31c976cc6734003d9950e731dfed3">Clear</a>();</div>
|
|
<div class="line"><a id="l00656" name="l00656"></a><span class="lineno"> 656</span> <span class="keywordflow">return</span> status;</div>
|
|
<div class="line"><a id="l00657" name="l00657"></a><span class="lineno"> 657</span>}</div>
|
|
<div class="line"><a id="l00658" name="l00658"></a><span class="lineno"> 658</span> </div>
|
|
<div class="line"><a id="l00659" name="l00659"></a><span class="lineno"> 659</span><a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> DimensionCumulOptimizerCore::PackRoutes(</div>
|
|
<div class="line"><a id="l00660" name="l00660"></a><span class="lineno"> 660</span> std::vector<int> vehicles, <a class="code hl_class" href="classoperations__research_1_1_routing_linear_solver_wrapper.html">RoutingLinearSolverWrapper</a>* solver) {</div>
|
|
<div class="line"><a id="l00661" name="l00661"></a><span class="lineno"> 661</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>* <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a> = dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a90dcdb4d66f8781421f5913150a85a06">model</a>();</div>
|
|
<div class="line"><a id="l00662" name="l00662"></a><span class="lineno"> 662</span> </div>
|
|
<div class="line"><a id="l00663" name="l00663"></a><span class="lineno"> 663</span> <span class="comment">// NOTE(user): Given our constraint matrix, our problem *should* always</span></div>
|
|
<div class="line"><a id="l00664" name="l00664"></a><span class="lineno"> 664</span> <span class="comment">// have an integer optimal solution, in which case we can round to the nearest</span></div>
|
|
<div class="line"><a id="l00665" name="l00665"></a><span class="lineno"> 665</span> <span class="comment">// integer both for the objective constraint bound (returned by</span></div>
|
|
<div class="line"><a id="l00666" name="l00666"></a><span class="lineno"> 666</span> <span class="comment">// GetObjectiveValue()) and the end cumul variable bound after minimizing</span></div>
|
|
<div class="line"><a id="l00667" name="l00667"></a><span class="lineno"> 667</span> <span class="comment">// (see b/154381899 showcasing an example where std::ceil leads to an</span></div>
|
|
<div class="line"><a id="l00668" name="l00668"></a><span class="lineno"> 668</span> <span class="comment">// "imperfect" packing due to rounding precision errors).</span></div>
|
|
<div class="line"><a id="l00669" name="l00669"></a><span class="lineno"> 669</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 id="l00670" name="l00670"></a><span class="lineno"> 670</span> <span class="comment">// adapted to have a 2-phase approach, solving once with the rounded value as</span></div>
|
|
<div class="line"><a id="l00671" name="l00671"></a><span class="lineno"> 671</span> <span class="comment">// bound and if this fails, solve again using std::ceil.</span></div>
|
|
<div class="line"><a id="l00672" name="l00672"></a><span class="lineno"> 672</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(solver-><a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af1eb90688746692ec522c88d501bd598">SolutionIsInteger</a>());</div>
|
|
<div class="line"><a id="l00673" name="l00673"></a><span class="lineno"> 673</span> </div>
|
|
<div class="line"><a id="l00674" name="l00674"></a><span class="lineno"> 674</span> <span class="comment">// Minimize the route end times without increasing the cost.</span></div>
|
|
<div class="line"><a id="l00675" name="l00675"></a><span class="lineno"> 675</span> solver-><a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ab570a51d5ff506f435fa428d3f145f0a">AddObjectiveConstraint</a>();</div>
|
|
<div class="line"><a id="l00676" name="l00676"></a><span class="lineno"> 676</span> solver-><a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ab8bd6c2ebc0fe292221efda5c39de361">ClearObjective</a>();</div>
|
|
<div class="line"><a id="l00677" name="l00677"></a><span class="lineno"> 677</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle : vehicles) {</div>
|
|
<div class="line"><a id="l00678" name="l00678"></a><span class="lineno"> 678</span> solver-><a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad56b5d5264e07b44be873dfdcd29cb8e">SetObjectiveCoefficient</a>(</div>
|
|
<div class="line"><a id="l00679" name="l00679"></a><span class="lineno"> 679</span> index_to_cumul_variable_[<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->End(vehicle)], 1);</div>
|
|
<div class="line"><a id="l00680" name="l00680"></a><span class="lineno"> 680</span> }</div>
|
|
<div class="line"><a id="l00681" name="l00681"></a><span class="lineno"> 681</span> </div>
|
|
<div class="line"><a id="l00682" name="l00682"></a><span class="lineno"> 682</span> <span class="keywordflow">if</span> (solver-><a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#acb5447abf2fd0ef52e46ce561ffef5cb">Solve</a>(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->RemainingTime()) ==</div>
|
|
<div class="line"><a id="l00683" name="l00683"></a><span class="lineno"> 683</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a id="l00684" name="l00684"></a><span class="lineno"> 684</span> <span class="keywordflow">return</span> <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a>;</div>
|
|
<div class="line"><a id="l00685" name="l00685"></a><span class="lineno"> 685</span> }</div>
|
|
<div class="line"><a id="l00686" name="l00686"></a><span class="lineno"> 686</span> </div>
|
|
<div class="line"><a id="l00687" name="l00687"></a><span class="lineno"> 687</span> <span class="comment">// Maximize the route start times without increasing the cost or the route end</span></div>
|
|
<div class="line"><a id="l00688" name="l00688"></a><span class="lineno"> 688</span> <span class="comment">// times.</span></div>
|
|
<div class="line"><a id="l00689" name="l00689"></a><span class="lineno"> 689</span> solver-><a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ab8bd6c2ebc0fe292221efda5c39de361">ClearObjective</a>();</div>
|
|
<div class="line"><a id="l00690" name="l00690"></a><span class="lineno"> 690</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle : vehicles) {</div>
|
|
<div class="line"><a id="l00691" name="l00691"></a><span class="lineno"> 691</span> <span class="keyword">const</span> <span class="keywordtype">int</span> end_cumul_var = index_to_cumul_variable_[<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->End(vehicle)];</div>
|
|
<div class="line"><a id="l00692" name="l00692"></a><span class="lineno"> 692</span> <span class="comment">// end_cumul_var <= solver.GetValue(end_cumul_var)</span></div>
|
|
<div class="line"><a id="l00693" name="l00693"></a><span class="lineno"> 693</span> solver-><a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad1a3a80256c0caa8f7ebdacb42294c81">SetVariableBounds</a>(</div>
|
|
<div class="line"><a id="l00694" name="l00694"></a><span class="lineno"> 694</span> end_cumul_var, solver-><a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#afaf5c7b0c88dbe8a11b8d9d66a7c2871">GetVariableLowerBound</a>(end_cumul_var),</div>
|
|
<div class="line"><a id="l00695" name="l00695"></a><span class="lineno"> 695</span> <a class="code hl_function" href="classoperations__research_1_1_math_util.html#a55fc8a3af7c2526c83e83586cd578d89">MathUtil::FastInt64Round</a>(solver-><a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ac154a773600edab5f5fbc597c5639cce">GetValue</a>(end_cumul_var)));</div>
|
|
<div class="line"><a id="l00696" name="l00696"></a><span class="lineno"> 696</span> </div>
|
|
<div class="line"><a id="l00697" name="l00697"></a><span class="lineno"> 697</span> <span class="comment">// Maximize the starts of the routes.</span></div>
|
|
<div class="line"><a id="l00698" name="l00698"></a><span class="lineno"> 698</span> solver-><a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad56b5d5264e07b44be873dfdcd29cb8e">SetObjectiveCoefficient</a>(</div>
|
|
<div class="line"><a id="l00699" name="l00699"></a><span class="lineno"> 699</span> index_to_cumul_variable_[<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Start(vehicle)], -1);</div>
|
|
<div class="line"><a id="l00700" name="l00700"></a><span class="lineno"> 700</span> }</div>
|
|
<div class="line"><a id="l00701" name="l00701"></a><span class="lineno"> 701</span> <span class="keywordflow">return</span> solver-><a class="code hl_function" href="classoperations__research_1_1_routing_linear_solver_wrapper.html#acb5447abf2fd0ef52e46ce561ffef5cb">Solve</a>(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->RemainingTime());</div>
|
|
<div class="line"><a id="l00702" name="l00702"></a><span class="lineno"> 702</span>}</div>
|
|
<div class="line"><a id="l00703" name="l00703"></a><span class="lineno"> 703</span> </div>
|
|
<div class="line"><a id="l00704" name="l00704"></a><span class="lineno"> 704</span><span class="keywordtype">void</span> DimensionCumulOptimizerCore::InitOptimizer(</div>
|
|
<div class="line"><a id="l00705" name="l00705"></a><span class="lineno"> 705</span> RoutingLinearSolverWrapper* solver) {</div>
|
|
<div class="line"><a id="l00706" name="l00706"></a><span class="lineno"> 706</span> solver->Clear();</div>
|
|
<div class="line"><a id="l00707" name="l00707"></a><span class="lineno"> 707</span> index_to_cumul_variable_.assign(dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a2658bab0f635e3b399b100ecd6bc12cb">cumuls</a>().size(), -1);</div>
|
|
<div class="line"><a id="l00708" name="l00708"></a><span class="lineno"> 708</span> max_end_cumul_ = solver->CreateNewPositiveVariable();</div>
|
|
<div class="line"><a id="l00709" name="l00709"></a><span class="lineno"> 709</span> min_start_cumul_ = solver->CreateNewPositiveVariable();</div>
|
|
<div class="line"><a id="l00710" name="l00710"></a><span class="lineno"> 710</span>}</div>
|
|
<div class="line"><a id="l00711" name="l00711"></a><span class="lineno"> 711</span> </div>
|
|
<div class="line"><a id="l00712" name="l00712"></a><span class="lineno"> 712</span><span class="keywordtype">bool</span> DimensionCumulOptimizerCore::ComputeRouteCumulBounds(</div>
|
|
<div class="line"><a id="l00713" name="l00713"></a><span class="lineno"> 713</span> <span class="keyword">const</span> std::vector<int64_t>& route,</div>
|
|
<div class="line"><a id="l00714" name="l00714"></a><span class="lineno"> 714</span> <span class="keyword">const</span> std::vector<int64_t>& fixed_transits, int64_t cumul_offset) {</div>
|
|
<div class="line"><a id="l00715" name="l00715"></a><span class="lineno"> 715</span> <span class="keyword">const</span> <span class="keywordtype">int</span> route_size = route.size();</div>
|
|
<div class="line"><a id="l00716" name="l00716"></a><span class="lineno"> 716</span> current_route_min_cumuls_.resize(route_size);</div>
|
|
<div class="line"><a id="l00717" name="l00717"></a><span class="lineno"> 717</span> current_route_max_cumuls_.resize(route_size);</div>
|
|
<div class="line"><a id="l00718" name="l00718"></a><span class="lineno"> 718</span> <span class="keywordflow">if</span> (propagator_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l00719" name="l00719"></a><span class="lineno"> 719</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = 0; pos < route_size; pos++) {</div>
|
|
<div class="line"><a id="l00720" name="l00720"></a><span class="lineno"> 720</span> <span class="keyword">const</span> int64_t node = route[pos];</div>
|
|
<div class="line"><a id="l00721" name="l00721"></a><span class="lineno"> 721</span> current_route_min_cumuls_[pos] = propagator_->CumulMin(node);</div>
|
|
<div class="line"><a id="l00722" name="l00722"></a><span class="lineno"> 722</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(current_route_min_cumuls_[pos], 0);</div>
|
|
<div class="line"><a id="l00723" name="l00723"></a><span class="lineno"> 723</span> current_route_max_cumuls_[pos] = propagator_->CumulMax(node);</div>
|
|
<div class="line"><a id="l00724" name="l00724"></a><span class="lineno"> 724</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(current_route_max_cumuls_[pos], current_route_min_cumuls_[pos]);</div>
|
|
<div class="line"><a id="l00725" name="l00725"></a><span class="lineno"> 725</span> }</div>
|
|
<div class="line"><a id="l00726" name="l00726"></a><span class="lineno"> 726</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00727" name="l00727"></a><span class="lineno"> 727</span> }</div>
|
|
<div class="line"><a id="l00728" name="l00728"></a><span class="lineno"> 728</span> </div>
|
|
<div class="line"><a id="l00729" name="l00729"></a><span class="lineno"> 729</span> <span class="comment">// Extract cumul min/max and fixed transits from CP.</span></div>
|
|
<div class="line"><a id="l00730" name="l00730"></a><span class="lineno"> 730</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = 0; pos < route_size; ++pos) {</div>
|
|
<div class="line"><a id="l00731" name="l00731"></a><span class="lineno"> 731</span> <span class="keywordflow">if</span> (!GetCumulBoundsWithOffset(*dimension_, route[pos], cumul_offset,</div>
|
|
<div class="line"><a id="l00732" name="l00732"></a><span class="lineno"> 732</span> &current_route_min_cumuls_[pos],</div>
|
|
<div class="line"><a id="l00733" name="l00733"></a><span class="lineno"> 733</span> &current_route_max_cumuls_[pos])) {</div>
|
|
<div class="line"><a id="l00734" name="l00734"></a><span class="lineno"> 734</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00735" name="l00735"></a><span class="lineno"> 735</span> }</div>
|
|
<div class="line"><a id="l00736" name="l00736"></a><span class="lineno"> 736</span> }</div>
|
|
<div class="line"><a id="l00737" name="l00737"></a><span class="lineno"> 737</span> </div>
|
|
<div class="line"><a id="l00738" name="l00738"></a><span class="lineno"> 738</span> <span class="comment">// Refine cumul bounds using</span></div>
|
|
<div class="line"><a id="l00739" name="l00739"></a><span class="lineno"> 739</span> <span class="comment">// cumul[i+1] >= cumul[i] + fixed_transit[i] + slack[i].</span></div>
|
|
<div class="line"><a id="l00740" name="l00740"></a><span class="lineno"> 740</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = 1; pos < route_size; ++pos) {</div>
|
|
<div class="line"><a id="l00741" name="l00741"></a><span class="lineno"> 741</span> <span class="keyword">const</span> int64_t slack_min = dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a4232c22ddc9e65e726ee87cf27778072">SlackVar</a>(route[pos - 1])-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#a62b340f6d1dde6a36560bd88a382ada7">Min</a>();</div>
|
|
<div class="line"><a id="l00742" name="l00742"></a><span class="lineno"> 742</span> current_route_min_cumuls_[pos] = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(</div>
|
|
<div class="line"><a id="l00743" name="l00743"></a><span class="lineno"> 743</span> current_route_min_cumuls_[pos],</div>
|
|
<div class="line"><a id="l00744" name="l00744"></a><span class="lineno"> 744</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(</div>
|
|
<div class="line"><a id="l00745" name="l00745"></a><span class="lineno"> 745</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(current_route_min_cumuls_[pos - 1], fixed_transits[pos - 1]),</div>
|
|
<div class="line"><a id="l00746" name="l00746"></a><span class="lineno"> 746</span> slack_min));</div>
|
|
<div class="line"><a id="l00747" name="l00747"></a><span class="lineno"> 747</span> current_route_min_cumuls_[pos] = GetFirstPossibleValueForCumulWithOffset(</div>
|
|
<div class="line"><a id="l00748" name="l00748"></a><span class="lineno"> 748</span> *dimension_, route[pos], current_route_min_cumuls_[pos], cumul_offset);</div>
|
|
<div class="line"><a id="l00749" name="l00749"></a><span class="lineno"> 749</span> <span class="keywordflow">if</span> (current_route_min_cumuls_[pos] > current_route_max_cumuls_[pos]) {</div>
|
|
<div class="line"><a id="l00750" name="l00750"></a><span class="lineno"> 750</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00751" name="l00751"></a><span class="lineno"> 751</span> }</div>
|
|
<div class="line"><a id="l00752" name="l00752"></a><span class="lineno"> 752</span> }</div>
|
|
<div class="line"><a id="l00753" name="l00753"></a><span class="lineno"> 753</span> </div>
|
|
<div class="line"><a id="l00754" name="l00754"></a><span class="lineno"> 754</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = route_size - 2; pos >= 0; --pos) {</div>
|
|
<div class="line"><a id="l00755" name="l00755"></a><span class="lineno"> 755</span> <span class="comment">// If cumul_max[pos+1] is kint64max, it will be translated to</span></div>
|
|
<div class="line"><a id="l00756" name="l00756"></a><span class="lineno"> 756</span> <span class="comment">// double +infinity, so it must not constrain cumul_max[pos].</span></div>
|
|
<div class="line"><a id="l00757" name="l00757"></a><span class="lineno"> 757</span> <span class="keywordflow">if</span> (current_route_max_cumuls_[pos + 1] <</div>
|
|
<div class="line"><a id="l00758" name="l00758"></a><span class="lineno"> 758</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div>
|
|
<div class="line"><a id="l00759" name="l00759"></a><span class="lineno"> 759</span> <span class="keyword">const</span> int64_t slack_min = dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a4232c22ddc9e65e726ee87cf27778072">SlackVar</a>(route[pos])-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#a62b340f6d1dde6a36560bd88a382ada7">Min</a>();</div>
|
|
<div class="line"><a id="l00760" name="l00760"></a><span class="lineno"> 760</span> current_route_max_cumuls_[pos] = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(</div>
|
|
<div class="line"><a id="l00761" name="l00761"></a><span class="lineno"> 761</span> current_route_max_cumuls_[pos],</div>
|
|
<div class="line"><a id="l00762" name="l00762"></a><span class="lineno"> 762</span> <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(</div>
|
|
<div class="line"><a id="l00763" name="l00763"></a><span class="lineno"> 763</span> <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(current_route_max_cumuls_[pos + 1], fixed_transits[pos]),</div>
|
|
<div class="line"><a id="l00764" name="l00764"></a><span class="lineno"> 764</span> slack_min));</div>
|
|
<div class="line"><a id="l00765" name="l00765"></a><span class="lineno"> 765</span> current_route_max_cumuls_[pos] = GetLastPossibleValueForCumulWithOffset(</div>
|
|
<div class="line"><a id="l00766" name="l00766"></a><span class="lineno"> 766</span> *dimension_, route[pos], current_route_max_cumuls_[pos],</div>
|
|
<div class="line"><a id="l00767" name="l00767"></a><span class="lineno"> 767</span> cumul_offset);</div>
|
|
<div class="line"><a id="l00768" name="l00768"></a><span class="lineno"> 768</span> <span class="keywordflow">if</span> (current_route_max_cumuls_[pos] < current_route_min_cumuls_[pos]) {</div>
|
|
<div class="line"><a id="l00769" name="l00769"></a><span class="lineno"> 769</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00770" name="l00770"></a><span class="lineno"> 770</span> }</div>
|
|
<div class="line"><a id="l00771" name="l00771"></a><span class="lineno"> 771</span> }</div>
|
|
<div class="line"><a id="l00772" name="l00772"></a><span class="lineno"> 772</span> }</div>
|
|
<div class="line"><a id="l00773" name="l00773"></a><span class="lineno"> 773</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00774" name="l00774"></a><span class="lineno"> 774</span>}</div>
|
|
<div class="line"><a id="l00775" name="l00775"></a><span class="lineno"> 775</span> </div>
|
|
<div class="line"><a id="l00776" name="l00776"></a><span class="lineno"> 776</span><span class="keywordtype">bool</span> DimensionCumulOptimizerCore::SetRouteCumulConstraints(</div>
|
|
<div class="line"><a id="l00777" name="l00777"></a><span class="lineno"> 777</span> <span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l00778" name="l00778"></a><span class="lineno"> 778</span> int64_t cumul_offset, <span class="keywordtype">bool</span> optimize_costs,</div>
|
|
<div class="line"><a id="l00779" name="l00779"></a><span class="lineno"> 779</span> RoutingLinearSolverWrapper* solver, int64_t* route_transit_cost,</div>
|
|
<div class="line"><a id="l00780" name="l00780"></a><span class="lineno"> 780</span> int64_t* route_cost_offset) {</div>
|
|
<div class="line"><a id="l00781" name="l00781"></a><span class="lineno"> 781</span> RoutingModel* <span class="keyword">const</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a> = dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a90dcdb4d66f8781421f5913150a85a06">model</a>();</div>
|
|
<div class="line"><a id="l00782" name="l00782"></a><span class="lineno"> 782</span> <span class="comment">// Extract the vehicle's path from next_accessor.</span></div>
|
|
<div class="line"><a id="l00783" name="l00783"></a><span class="lineno"> 783</span> std::vector<int64_t> path;</div>
|
|
<div class="line"><a id="l00784" name="l00784"></a><span class="lineno"> 784</span> {</div>
|
|
<div class="line"><a id="l00785" name="l00785"></a><span class="lineno"> 785</span> <span class="keywordtype">int</span> node = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Start(vehicle);</div>
|
|
<div class="line"><a id="l00786" name="l00786"></a><span class="lineno"> 786</span> path.push_back(node);</div>
|
|
<div class="line"><a id="l00787" name="l00787"></a><span class="lineno"> 787</span> <span class="keywordflow">while</span> (!<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->IsEnd(node)) {</div>
|
|
<div class="line"><a id="l00788" name="l00788"></a><span class="lineno"> 788</span> node = next_accessor(node);</div>
|
|
<div class="line"><a id="l00789" name="l00789"></a><span class="lineno"> 789</span> path.push_back(node);</div>
|
|
<div class="line"><a id="l00790" name="l00790"></a><span class="lineno"> 790</span> }</div>
|
|
<div class="line"><a id="l00791" name="l00791"></a><span class="lineno"> 791</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(path.size(), 2);</div>
|
|
<div class="line"><a id="l00792" name="l00792"></a><span class="lineno"> 792</span> }</div>
|
|
<div class="line"><a id="l00793" name="l00793"></a><span class="lineno"> 793</span> <span class="keyword">const</span> <span class="keywordtype">int</span> path_size = path.size();</div>
|
|
<div class="line"><a id="l00794" name="l00794"></a><span class="lineno"> 794</span> </div>
|
|
<div class="line"><a id="l00795" name="l00795"></a><span class="lineno"> 795</span> std::vector<int64_t> fixed_transit(path_size - 1);</div>
|
|
<div class="line"><a id="l00796" name="l00796"></a><span class="lineno"> 796</span> {</div>
|
|
<div class="line"><a id="l00797" name="l00797"></a><span class="lineno"> 797</span> <span class="keyword">const</span> std::function<int64_t(int64_t, int64_t)>& transit_accessor =</div>
|
|
<div class="line"><a id="l00798" name="l00798"></a><span class="lineno"> 798</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a5c170c586b06b6435f4e85cfc9db27e5">transit_evaluator</a>(vehicle);</div>
|
|
<div class="line"><a id="l00799" name="l00799"></a><span class="lineno"> 799</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = 1; pos < path_size; ++pos) {</div>
|
|
<div class="line"><a id="l00800" name="l00800"></a><span class="lineno"> 800</span> fixed_transit[pos - 1] = transit_accessor(path[pos - 1], path[pos]);</div>
|
|
<div class="line"><a id="l00801" name="l00801"></a><span class="lineno"> 801</span> }</div>
|
|
<div class="line"><a id="l00802" name="l00802"></a><span class="lineno"> 802</span> }</div>
|
|
<div class="line"><a id="l00803" name="l00803"></a><span class="lineno"> 803</span> </div>
|
|
<div class="line"><a id="l00804" name="l00804"></a><span class="lineno"> 804</span> <span class="keywordflow">if</span> (!ComputeRouteCumulBounds(path, fixed_transit, cumul_offset)) {</div>
|
|
<div class="line"><a id="l00805" name="l00805"></a><span class="lineno"> 805</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00806" name="l00806"></a><span class="lineno"> 806</span> }</div>
|
|
<div class="line"><a id="l00807" name="l00807"></a><span class="lineno"> 807</span> </div>
|
|
<div class="line"><a id="l00808" name="l00808"></a><span class="lineno"> 808</span> <span class="comment">// LP Model variables, current_route_cumul_variables_ and lp_slacks.</span></div>
|
|
<div class="line"><a id="l00809" name="l00809"></a><span class="lineno"> 809</span> <span class="comment">// Create LP variables for cumuls.</span></div>
|
|
<div class="line"><a id="l00810" name="l00810"></a><span class="lineno"> 810</span> std::vector<int>& lp_cumuls = current_route_cumul_variables_;</div>
|
|
<div class="line"><a id="l00811" name="l00811"></a><span class="lineno"> 811</span> lp_cumuls.assign(path_size, -1);</div>
|
|
<div class="line"><a id="l00812" name="l00812"></a><span class="lineno"> 812</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = 0; pos < path_size; ++pos) {</div>
|
|
<div class="line"><a id="l00813" name="l00813"></a><span class="lineno"> 813</span> <span class="keyword">const</span> <span class="keywordtype">int</span> lp_cumul = solver->CreateNewPositiveVariable();</div>
|
|
<div class="line"><a id="l00814" name="l00814"></a><span class="lineno"> 814</span> index_to_cumul_variable_[path[pos]] = lp_cumul;</div>
|
|
<div class="line"><a id="l00815" name="l00815"></a><span class="lineno"> 815</span> lp_cumuls[pos] = lp_cumul;</div>
|
|
<div class="line"><a id="l00816" name="l00816"></a><span class="lineno"> 816</span> <span class="keywordflow">if</span> (!solver->SetVariableBounds(lp_cumul, current_route_min_cumuls_[pos],</div>
|
|
<div class="line"><a id="l00817" name="l00817"></a><span class="lineno"> 817</span> current_route_max_cumuls_[pos])) {</div>
|
|
<div class="line"><a id="l00818" name="l00818"></a><span class="lineno"> 818</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00819" name="l00819"></a><span class="lineno"> 819</span> }</div>
|
|
<div class="line"><a id="l00820" name="l00820"></a><span class="lineno"> 820</span> <span class="keyword">const</span> SortedDisjointIntervalList& forbidden =</div>
|
|
<div class="line"><a id="l00821" name="l00821"></a><span class="lineno"> 821</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a9958465c1ff256b5cbcdc684ada03e60">forbidden_intervals</a>()[path[pos]];</div>
|
|
<div class="line"><a id="l00822" name="l00822"></a><span class="lineno"> 822</span> <span class="keywordflow">if</span> (forbidden.NumIntervals() > 0) {</div>
|
|
<div class="line"><a id="l00823" name="l00823"></a><span class="lineno"> 823</span> std::vector<int64_t> starts;</div>
|
|
<div class="line"><a id="l00824" name="l00824"></a><span class="lineno"> 824</span> std::vector<int64_t> ends;</div>
|
|
<div class="line"><a id="l00825" name="l00825"></a><span class="lineno"> 825</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> ClosedInterval <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> :</div>
|
|
<div class="line"><a id="l00826" name="l00826"></a><span class="lineno"> 826</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a70dcc75273b8ffe7bf1df455e227d939">GetAllowedIntervalsInRange</a>(</div>
|
|
<div class="line"><a id="l00827" name="l00827"></a><span class="lineno"> 827</span> path[pos], <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(current_route_min_cumuls_[pos], cumul_offset),</div>
|
|
<div class="line"><a id="l00828" name="l00828"></a><span class="lineno"> 828</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(current_route_max_cumuls_[pos], cumul_offset))) {</div>
|
|
<div class="line"><a id="l00829" name="l00829"></a><span class="lineno"> 829</span> starts.push_back(<a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.start, cumul_offset));</div>
|
|
<div class="line"><a id="l00830" name="l00830"></a><span class="lineno"> 830</span> ends.push_back(<a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>.end, cumul_offset));</div>
|
|
<div class="line"><a id="l00831" name="l00831"></a><span class="lineno"> 831</span> }</div>
|
|
<div class="line"><a id="l00832" name="l00832"></a><span class="lineno"> 832</span> solver->SetVariableDisjointBounds(lp_cumul, starts, ends);</div>
|
|
<div class="line"><a id="l00833" name="l00833"></a><span class="lineno"> 833</span> }</div>
|
|
<div class="line"><a id="l00834" name="l00834"></a><span class="lineno"> 834</span> }</div>
|
|
<div class="line"><a id="l00835" name="l00835"></a><span class="lineno"> 835</span> <span class="comment">// Create LP variables for slacks.</span></div>
|
|
<div class="line"><a id="l00836" name="l00836"></a><span class="lineno"> 836</span> std::vector<int> lp_slacks(path_size - 1, -1);</div>
|
|
<div class="line"><a id="l00837" name="l00837"></a><span class="lineno"> 837</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = 0; pos < path_size - 1; ++pos) {</div>
|
|
<div class="line"><a id="l00838" name="l00838"></a><span class="lineno"> 838</span> <span class="keyword">const</span> IntVar* cp_slack = dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a4232c22ddc9e65e726ee87cf27778072">SlackVar</a>(path[pos]);</div>
|
|
<div class="line"><a id="l00839" name="l00839"></a><span class="lineno"> 839</span> lp_slacks[pos] = solver->CreateNewPositiveVariable();</div>
|
|
<div class="line"><a id="l00840" name="l00840"></a><span class="lineno"> 840</span> <span class="keywordflow">if</span> (!solver->SetVariableBounds(lp_slacks[pos], cp_slack->Min(),</div>
|
|
<div class="line"><a id="l00841" name="l00841"></a><span class="lineno"> 841</span> cp_slack->Max())) {</div>
|
|
<div class="line"><a id="l00842" name="l00842"></a><span class="lineno"> 842</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00843" name="l00843"></a><span class="lineno"> 843</span> }</div>
|
|
<div class="line"><a id="l00844" name="l00844"></a><span class="lineno"> 844</span> }</div>
|
|
<div class="line"><a id="l00845" name="l00845"></a><span class="lineno"> 845</span> </div>
|
|
<div class="line"><a id="l00846" name="l00846"></a><span class="lineno"> 846</span> <span class="comment">// LP Model constraints and costs.</span></div>
|
|
<div class="line"><a id="l00847" name="l00847"></a><span class="lineno"> 847</span> <span class="comment">// Add all path constraints to LP:</span></div>
|
|
<div class="line"><a id="l00848" name="l00848"></a><span class="lineno"> 848</span> <span class="comment">// cumul[i] + fixed_transit[i] + slack[i] == cumul[i+1]</span></div>
|
|
<div class="line"><a id="l00849" name="l00849"></a><span class="lineno"> 849</span> <span class="comment">// <=> fixed_transit[i] == cumul[i+1] - cumul[i] - slack[i].</span></div>
|
|
<div class="line"><a id="l00850" name="l00850"></a><span class="lineno"> 850</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = 0; pos < path_size - 1; ++pos) {</div>
|
|
<div class="line"><a id="l00851" name="l00851"></a><span class="lineno"> 851</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> =</div>
|
|
<div class="line"><a id="l00852" name="l00852"></a><span class="lineno"> 852</span> solver->CreateNewConstraint(fixed_transit[pos], fixed_transit[pos]);</div>
|
|
<div class="line"><a id="l00853" name="l00853"></a><span class="lineno"> 853</span> solver->SetCoefficient(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, lp_cumuls[pos + 1], 1);</div>
|
|
<div class="line"><a id="l00854" name="l00854"></a><span class="lineno"> 854</span> solver->SetCoefficient(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, lp_cumuls[pos], -1);</div>
|
|
<div class="line"><a id="l00855" name="l00855"></a><span class="lineno"> 855</span> solver->SetCoefficient(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, lp_slacks[pos], -1);</div>
|
|
<div class="line"><a id="l00856" name="l00856"></a><span class="lineno"> 856</span> }</div>
|
|
<div class="line"><a id="l00857" name="l00857"></a><span class="lineno"> 857</span> <span class="keywordflow">if</span> (route_cost_offset != <span class="keyword">nullptr</span>) *route_cost_offset = 0;</div>
|
|
<div class="line"><a id="l00858" name="l00858"></a><span class="lineno"> 858</span> <span class="keywordflow">if</span> (optimize_costs) {</div>
|
|
<div class="line"><a id="l00859" name="l00859"></a><span class="lineno"> 859</span> <span class="comment">// Add soft upper bounds.</span></div>
|
|
<div class="line"><a id="l00860" name="l00860"></a><span class="lineno"> 860</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = 0; pos < path_size; ++pos) {</div>
|
|
<div class="line"><a id="l00861" name="l00861"></a><span class="lineno"> 861</span> <span class="keywordflow">if</span> (!dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a8eafd6802aace5a8b509d920de5e37c5">HasCumulVarSoftUpperBound</a>(path[pos])) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00862" name="l00862"></a><span class="lineno"> 862</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="expr__array_8cc.html#abda708e4a6f0de72a842382f919a7c31">coef</a> =</div>
|
|
<div class="line"><a id="l00863" name="l00863"></a><span class="lineno"> 863</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a32c310c90b2870f76dfe58ef41127d83">GetCumulVarSoftUpperBoundCoefficient</a>(path[pos]);</div>
|
|
<div class="line"><a id="l00864" name="l00864"></a><span class="lineno"> 864</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="expr__array_8cc.html#abda708e4a6f0de72a842382f919a7c31">coef</a> == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00865" name="l00865"></a><span class="lineno"> 865</span> int64_t <a class="code hl_variable" href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a> = dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#ae80c65007e8e9be55995bb2aa4493898">GetCumulVarSoftUpperBound</a>(path[pos]);</div>
|
|
<div class="line"><a id="l00866" name="l00866"></a><span class="lineno"> 866</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a> < cumul_offset && route_cost_offset != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l00867" name="l00867"></a><span class="lineno"> 867</span> <span class="comment">// Add coef * (cumul_offset - bound) to the cost offset.</span></div>
|
|
<div class="line"><a id="l00868" name="l00868"></a><span class="lineno"> 868</span> *route_cost_offset = <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(*route_cost_offset,</div>
|
|
<div class="line"><a id="l00869" name="l00869"></a><span class="lineno"> 869</span> <a class="code hl_function" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(<a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cumul_offset, <a class="code hl_variable" href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a>), <a class="code hl_variable" href="expr__array_8cc.html#abda708e4a6f0de72a842382f919a7c31">coef</a>));</div>
|
|
<div class="line"><a id="l00870" name="l00870"></a><span class="lineno"> 870</span> }</div>
|
|
<div class="line"><a id="l00871" name="l00871"></a><span class="lineno"> 871</span> <a class="code hl_variable" href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a> = std::max<int64_t>(0, <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(<a class="code hl_variable" href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a>, cumul_offset));</div>
|
|
<div class="line"><a id="l00872" name="l00872"></a><span class="lineno"> 872</span> <span class="keywordflow">if</span> (current_route_max_cumuls_[pos] <= <a class="code hl_variable" href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a>) {</div>
|
|
<div class="line"><a id="l00873" name="l00873"></a><span class="lineno"> 873</span> <span class="comment">// constraint is never violated.</span></div>
|
|
<div class="line"><a id="l00874" name="l00874"></a><span class="lineno"> 874</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00875" name="l00875"></a><span class="lineno"> 875</span> }</div>
|
|
<div class="line"><a id="l00876" name="l00876"></a><span class="lineno"> 876</span> <span class="keyword">const</span> <span class="keywordtype">int</span> soft_ub_diff = solver->CreateNewPositiveVariable();</div>
|
|
<div class="line"><a id="l00877" name="l00877"></a><span class="lineno"> 877</span> solver->SetObjectiveCoefficient(soft_ub_diff, <a class="code hl_variable" href="expr__array_8cc.html#abda708e4a6f0de72a842382f919a7c31">coef</a>);</div>
|
|
<div class="line"><a id="l00878" name="l00878"></a><span class="lineno"> 878</span> <span class="comment">// cumul - soft_ub_diff <= bound.</span></div>
|
|
<div class="line"><a id="l00879" name="l00879"></a><span class="lineno"> 879</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver->CreateNewConstraint(</div>
|
|
<div class="line"><a id="l00880" name="l00880"></a><span class="lineno"> 880</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>(), <a class="code hl_variable" href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a>);</div>
|
|
<div class="line"><a id="l00881" name="l00881"></a><span class="lineno"> 881</span> solver->SetCoefficient(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, lp_cumuls[pos], 1);</div>
|
|
<div class="line"><a id="l00882" name="l00882"></a><span class="lineno"> 882</span> solver->SetCoefficient(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, soft_ub_diff, -1);</div>
|
|
<div class="line"><a id="l00883" name="l00883"></a><span class="lineno"> 883</span> }</div>
|
|
<div class="line"><a id="l00884" name="l00884"></a><span class="lineno"> 884</span> <span class="comment">// Add soft lower bounds.</span></div>
|
|
<div class="line"><a id="l00885" name="l00885"></a><span class="lineno"> 885</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = 0; pos < path_size; ++pos) {</div>
|
|
<div class="line"><a id="l00886" name="l00886"></a><span class="lineno"> 886</span> <span class="keywordflow">if</span> (!dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a3ffb5532e1a2da908b35ce947f30a0a3">HasCumulVarSoftLowerBound</a>(path[pos])) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00887" name="l00887"></a><span class="lineno"> 887</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="expr__array_8cc.html#abda708e4a6f0de72a842382f919a7c31">coef</a> =</div>
|
|
<div class="line"><a id="l00888" name="l00888"></a><span class="lineno"> 888</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#af63828b2874b76ba4af52bfbbed5f156">GetCumulVarSoftLowerBoundCoefficient</a>(path[pos]);</div>
|
|
<div class="line"><a id="l00889" name="l00889"></a><span class="lineno"> 889</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="expr__array_8cc.html#abda708e4a6f0de72a842382f919a7c31">coef</a> == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00890" name="l00890"></a><span class="lineno"> 890</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a> = std::max<int64_t>(</div>
|
|
<div class="line"><a id="l00891" name="l00891"></a><span class="lineno"> 891</span> 0, <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#afe26c6f9f4c70620ce91fbff37f4834d">GetCumulVarSoftLowerBound</a>(path[pos]),</div>
|
|
<div class="line"><a id="l00892" name="l00892"></a><span class="lineno"> 892</span> cumul_offset));</div>
|
|
<div class="line"><a id="l00893" name="l00893"></a><span class="lineno"> 893</span> <span class="keywordflow">if</span> (current_route_min_cumuls_[pos] >= <a class="code hl_variable" href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a>) {</div>
|
|
<div class="line"><a id="l00894" name="l00894"></a><span class="lineno"> 894</span> <span class="comment">// constraint is never violated.</span></div>
|
|
<div class="line"><a id="l00895" name="l00895"></a><span class="lineno"> 895</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00896" name="l00896"></a><span class="lineno"> 896</span> }</div>
|
|
<div class="line"><a id="l00897" name="l00897"></a><span class="lineno"> 897</span> <span class="keyword">const</span> <span class="keywordtype">int</span> soft_lb_diff = solver->CreateNewPositiveVariable();</div>
|
|
<div class="line"><a id="l00898" name="l00898"></a><span class="lineno"> 898</span> solver->SetObjectiveCoefficient(soft_lb_diff, <a class="code hl_variable" href="expr__array_8cc.html#abda708e4a6f0de72a842382f919a7c31">coef</a>);</div>
|
|
<div class="line"><a id="l00899" name="l00899"></a><span class="lineno"> 899</span> <span class="comment">// bound - cumul <= soft_lb_diff</span></div>
|
|
<div class="line"><a id="l00900" name="l00900"></a><span class="lineno"> 900</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver->CreateNewConstraint(</div>
|
|
<div class="line"><a id="l00901" name="l00901"></a><span class="lineno"> 901</span> <a class="code hl_variable" href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a>, <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>());</div>
|
|
<div class="line"><a id="l00902" name="l00902"></a><span class="lineno"> 902</span> solver->SetCoefficient(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, lp_cumuls[pos], 1);</div>
|
|
<div class="line"><a id="l00903" name="l00903"></a><span class="lineno"> 903</span> solver->SetCoefficient(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, soft_lb_diff, 1);</div>
|
|
<div class="line"><a id="l00904" name="l00904"></a><span class="lineno"> 904</span> }</div>
|
|
<div class="line"><a id="l00905" name="l00905"></a><span class="lineno"> 905</span> }</div>
|
|
<div class="line"><a id="l00906" name="l00906"></a><span class="lineno"> 906</span> <span class="comment">// Add pickup and delivery limits.</span></div>
|
|
<div class="line"><a id="l00907" name="l00907"></a><span class="lineno"> 907</span> std::vector<int> visited_pairs;</div>
|
|
<div class="line"><a id="l00908" name="l00908"></a><span class="lineno"> 908</span> StoreVisitedPickupDeliveryPairsOnRoute(</div>
|
|
<div class="line"><a id="l00909" name="l00909"></a><span class="lineno"> 909</span> *dimension_, vehicle, next_accessor, &visited_pairs,</div>
|
|
<div class="line"><a id="l00910" name="l00910"></a><span class="lineno"> 910</span> &visited_pickup_delivery_indices_for_pair_);</div>
|
|
<div class="line"><a id="l00911" name="l00911"></a><span class="lineno"> 911</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pair_index : visited_pairs) {</div>
|
|
<div class="line"><a id="l00912" name="l00912"></a><span class="lineno"> 912</span> <span class="keyword">const</span> int64_t pickup_index =</div>
|
|
<div class="line"><a id="l00913" name="l00913"></a><span class="lineno"> 913</span> visited_pickup_delivery_indices_for_pair_[pair_index].first;</div>
|
|
<div class="line"><a id="l00914" name="l00914"></a><span class="lineno"> 914</span> <span class="keyword">const</span> int64_t delivery_index =</div>
|
|
<div class="line"><a id="l00915" name="l00915"></a><span class="lineno"> 915</span> visited_pickup_delivery_indices_for_pair_[pair_index].second;</div>
|
|
<div class="line"><a id="l00916" name="l00916"></a><span class="lineno"> 916</span> visited_pickup_delivery_indices_for_pair_[pair_index] = {-1, -1};</div>
|
|
<div class="line"><a id="l00917" name="l00917"></a><span class="lineno"> 917</span> </div>
|
|
<div class="line"><a id="l00918" name="l00918"></a><span class="lineno"> 918</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(pickup_index, 0);</div>
|
|
<div class="line"><a id="l00919" name="l00919"></a><span class="lineno"> 919</span> <span class="keywordflow">if</span> (delivery_index < 0) {</div>
|
|
<div class="line"><a id="l00920" name="l00920"></a><span class="lineno"> 920</span> <span class="comment">// We didn't encounter a delivery for this pickup.</span></div>
|
|
<div class="line"><a id="l00921" name="l00921"></a><span class="lineno"> 921</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00922" name="l00922"></a><span class="lineno"> 922</span> }</div>
|
|
<div class="line"><a id="l00923" name="l00923"></a><span class="lineno"> 923</span> </div>
|
|
<div class="line"><a id="l00924" name="l00924"></a><span class="lineno"> 924</span> <span class="keyword">const</span> int64_t limit = dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a3efd441f3accdd91d91ffbd1d4e1b255">GetPickupToDeliveryLimitForPair</a>(</div>
|
|
<div class="line"><a id="l00925" name="l00925"></a><span class="lineno"> 925</span> pair_index, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetPickupIndexPairs(pickup_index)[0].second,</div>
|
|
<div class="line"><a id="l00926" name="l00926"></a><span class="lineno"> 926</span> <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetDeliveryIndexPairs(delivery_index)[0].second);</div>
|
|
<div class="line"><a id="l00927" name="l00927"></a><span class="lineno"> 927</span> <span class="keywordflow">if</span> (limit < <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div>
|
|
<div class="line"><a id="l00928" name="l00928"></a><span class="lineno"> 928</span> <span class="comment">// delivery_cumul - pickup_cumul <= limit.</span></div>
|
|
<div class="line"><a id="l00929" name="l00929"></a><span class="lineno"> 929</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver->CreateNewConstraint(</div>
|
|
<div class="line"><a id="l00930" name="l00930"></a><span class="lineno"> 930</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>(), limit);</div>
|
|
<div class="line"><a id="l00931" name="l00931"></a><span class="lineno"> 931</span> solver->SetCoefficient(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, index_to_cumul_variable_[delivery_index], 1);</div>
|
|
<div class="line"><a id="l00932" name="l00932"></a><span class="lineno"> 932</span> solver->SetCoefficient(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, index_to_cumul_variable_[pickup_index], -1);</div>
|
|
<div class="line"><a id="l00933" name="l00933"></a><span class="lineno"> 933</span> }</div>
|
|
<div class="line"><a id="l00934" name="l00934"></a><span class="lineno"> 934</span> }</div>
|
|
<div class="line"><a id="l00935" name="l00935"></a><span class="lineno"> 935</span> </div>
|
|
<div class="line"><a id="l00936" name="l00936"></a><span class="lineno"> 936</span> <span class="comment">// Add span bound constraint.</span></div>
|
|
<div class="line"><a id="l00937" name="l00937"></a><span class="lineno"> 937</span> <span class="keyword">const</span> int64_t span_bound = dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a5ffb5c0e60db5d3939873fe92462bae9">GetSpanUpperBoundForVehicle</a>(vehicle);</div>
|
|
<div class="line"><a id="l00938" name="l00938"></a><span class="lineno"> 938</span> <span class="keywordflow">if</span> (span_bound < <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div>
|
|
<div class="line"><a id="l00939" name="l00939"></a><span class="lineno"> 939</span> <span class="comment">// end_cumul - start_cumul <= bound</span></div>
|
|
<div class="line"><a id="l00940" name="l00940"></a><span class="lineno"> 940</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver->CreateNewConstraint(</div>
|
|
<div class="line"><a id="l00941" name="l00941"></a><span class="lineno"> 941</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>(), span_bound);</div>
|
|
<div class="line"><a id="l00942" name="l00942"></a><span class="lineno"> 942</span> solver->SetCoefficient(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, lp_cumuls.back(), 1);</div>
|
|
<div class="line"><a id="l00943" name="l00943"></a><span class="lineno"> 943</span> solver->SetCoefficient(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, lp_cumuls.front(), -1);</div>
|
|
<div class="line"><a id="l00944" name="l00944"></a><span class="lineno"> 944</span> }</div>
|
|
<div class="line"><a id="l00945" name="l00945"></a><span class="lineno"> 945</span> <span class="comment">// Add span cost.</span></div>
|
|
<div class="line"><a id="l00946" name="l00946"></a><span class="lineno"> 946</span> <span class="keyword">const</span> int64_t span_cost_coef =</div>
|
|
<div class="line"><a id="l00947" name="l00947"></a><span class="lineno"> 947</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a506e1394eff1694085e3cfeb4a1997f1">GetSpanCostCoefficientForVehicle</a>(vehicle);</div>
|
|
<div class="line"><a id="l00948" name="l00948"></a><span class="lineno"> 948</span> <span class="keywordflow">if</span> (optimize_costs && span_cost_coef > 0) {</div>
|
|
<div class="line"><a id="l00949" name="l00949"></a><span class="lineno"> 949</span> solver->SetObjectiveCoefficient(lp_cumuls.back(), span_cost_coef);</div>
|
|
<div class="line"><a id="l00950" name="l00950"></a><span class="lineno"> 950</span> solver->SetObjectiveCoefficient(lp_cumuls.front(), -span_cost_coef);</div>
|
|
<div class="line"><a id="l00951" name="l00951"></a><span class="lineno"> 951</span> }</div>
|
|
<div class="line"><a id="l00952" name="l00952"></a><span class="lineno"> 952</span> <span class="comment">// Add soft span cost.</span></div>
|
|
<div class="line"><a id="l00953" name="l00953"></a><span class="lineno"> 953</span> <span class="keywordflow">if</span> (optimize_costs && dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#af0185f7c0ea3abf45191db23514604f3">HasSoftSpanUpperBounds</a>()) {</div>
|
|
<div class="line"><a id="l00954" name="l00954"></a><span class="lineno"> 954</span> SimpleBoundCosts::BoundCost bound_cost =</div>
|
|
<div class="line"><a id="l00955" name="l00955"></a><span class="lineno"> 955</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a06257e0b9422e5de00bd4eef03777355">GetSoftSpanUpperBoundForVehicle</a>(vehicle);</div>
|
|
<div class="line"><a id="l00956" name="l00956"></a><span class="lineno"> 956</span> <span class="keywordflow">if</span> (bound_cost.bound < <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>() &&</div>
|
|
<div class="line"><a id="l00957" name="l00957"></a><span class="lineno"> 957</span> bound_cost.cost > 0) {</div>
|
|
<div class="line"><a id="l00958" name="l00958"></a><span class="lineno"> 958</span> <span class="keyword">const</span> <span class="keywordtype">int</span> span_violation = solver->CreateNewPositiveVariable();</div>
|
|
<div class="line"><a id="l00959" name="l00959"></a><span class="lineno"> 959</span> <span class="comment">// end - start <= bound + span_violation</span></div>
|
|
<div class="line"><a id="l00960" name="l00960"></a><span class="lineno"> 960</span> <span class="keyword">const</span> <span class="keywordtype">int</span> violation = solver->CreateNewConstraint(</div>
|
|
<div class="line"><a id="l00961" name="l00961"></a><span class="lineno"> 961</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>(), bound_cost.bound);</div>
|
|
<div class="line"><a id="l00962" name="l00962"></a><span class="lineno"> 962</span> solver->SetCoefficient(violation, lp_cumuls.back(), 1.0);</div>
|
|
<div class="line"><a id="l00963" name="l00963"></a><span class="lineno"> 963</span> solver->SetCoefficient(violation, lp_cumuls.front(), -1.0);</div>
|
|
<div class="line"><a id="l00964" name="l00964"></a><span class="lineno"> 964</span> solver->SetCoefficient(violation, span_violation, -1.0);</div>
|
|
<div class="line"><a id="l00965" name="l00965"></a><span class="lineno"> 965</span> <span class="comment">// Add span_violation * cost to objective.</span></div>
|
|
<div class="line"><a id="l00966" name="l00966"></a><span class="lineno"> 966</span> solver->SetObjectiveCoefficient(span_violation, bound_cost.cost);</div>
|
|
<div class="line"><a id="l00967" name="l00967"></a><span class="lineno"> 967</span> }</div>
|
|
<div class="line"><a id="l00968" name="l00968"></a><span class="lineno"> 968</span> }</div>
|
|
<div class="line"><a id="l00969" name="l00969"></a><span class="lineno"> 969</span> <span class="comment">// Add global span constraint.</span></div>
|
|
<div class="line"><a id="l00970" name="l00970"></a><span class="lineno"> 970</span> <span class="keywordflow">if</span> (optimize_costs && dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a539915a226ec8626161d0310b22e8881">global_span_cost_coefficient</a>() > 0) {</div>
|
|
<div class="line"><a id="l00971" name="l00971"></a><span class="lineno"> 971</span> <span class="comment">// min_start_cumul_ <= cumuls[start]</span></div>
|
|
<div class="line"><a id="l00972" name="l00972"></a><span class="lineno"> 972</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> =</div>
|
|
<div class="line"><a id="l00973" name="l00973"></a><span class="lineno"> 973</span> solver->CreateNewConstraint(<a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>(), 0);</div>
|
|
<div class="line"><a id="l00974" name="l00974"></a><span class="lineno"> 974</span> solver->SetCoefficient(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, min_start_cumul_, 1);</div>
|
|
<div class="line"><a id="l00975" name="l00975"></a><span class="lineno"> 975</span> solver->SetCoefficient(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, lp_cumuls.front(), -1);</div>
|
|
<div class="line"><a id="l00976" name="l00976"></a><span class="lineno"> 976</span> <span class="comment">// max_end_cumul_ >= cumuls[end]</span></div>
|
|
<div class="line"><a id="l00977" name="l00977"></a><span class="lineno"> 977</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver->CreateNewConstraint(0, <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>());</div>
|
|
<div class="line"><a id="l00978" name="l00978"></a><span class="lineno"> 978</span> solver->SetCoefficient(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, max_end_cumul_, 1);</div>
|
|
<div class="line"><a id="l00979" name="l00979"></a><span class="lineno"> 979</span> solver->SetCoefficient(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, lp_cumuls.back(), -1);</div>
|
|
<div class="line"><a id="l00980" name="l00980"></a><span class="lineno"> 980</span> }</div>
|
|
<div class="line"><a id="l00981" name="l00981"></a><span class="lineno"> 981</span> <span class="comment">// Fill transit cost if specified.</span></div>
|
|
<div class="line"><a id="l00982" name="l00982"></a><span class="lineno"> 982</span> <span class="keywordflow">if</span> (route_transit_cost != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l00983" name="l00983"></a><span class="lineno"> 983</span> <span class="keywordflow">if</span> (optimize_costs && span_cost_coef > 0) {</div>
|
|
<div class="line"><a id="l00984" name="l00984"></a><span class="lineno"> 984</span> <span class="keyword">const</span> int64_t total_fixed_transit = std::accumulate(</div>
|
|
<div class="line"><a id="l00985" name="l00985"></a><span class="lineno"> 985</span> fixed_transit.begin(), fixed_transit.end(), 0, <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>);</div>
|
|
<div class="line"><a id="l00986" name="l00986"></a><span class="lineno"> 986</span> *route_transit_cost = <a class="code hl_function" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(total_fixed_transit, span_cost_coef);</div>
|
|
<div class="line"><a id="l00987" name="l00987"></a><span class="lineno"> 987</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00988" name="l00988"></a><span class="lineno"> 988</span> *route_transit_cost = 0;</div>
|
|
<div class="line"><a id="l00989" name="l00989"></a><span class="lineno"> 989</span> }</div>
|
|
<div class="line"><a id="l00990" name="l00990"></a><span class="lineno"> 990</span> }</div>
|
|
<div class="line"><a id="l00991" name="l00991"></a><span class="lineno"> 991</span> <span class="comment">// For every break that must be inside the route, the duration of that break</span></div>
|
|
<div class="line"><a id="l00992" name="l00992"></a><span class="lineno"> 992</span> <span class="comment">// must be flowed in the slacks of arcs that can intersect the break.</span></div>
|
|
<div class="line"><a id="l00993" name="l00993"></a><span class="lineno"> 993</span> <span class="comment">// This LP modelization is correct but not complete:</span></div>
|
|
<div class="line"><a id="l00994" name="l00994"></a><span class="lineno"> 994</span> <span class="comment">// can miss some cases where the breaks cannot fit.</span></div>
|
|
<div class="line"><a id="l00995" name="l00995"></a><span class="lineno"> 995</span> <span class="comment">// TODO(user): remove the need for returns in the code below.</span></div>
|
|
<div class="line"><a id="l00996" name="l00996"></a><span class="lineno"> 996</span> current_route_break_variables_.clear();</div>
|
|
<div class="line"><a id="l00997" name="l00997"></a><span class="lineno"> 997</span> <span class="keywordflow">if</span> (!dimension_-><a class="code hl_function" 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 id="l00998" name="l00998"></a><span class="lineno"> 998</span> <span class="keyword">const</span> std::vector<IntervalVar*>& breaks =</div>
|
|
<div class="line"><a id="l00999" name="l00999"></a><span class="lineno"> 999</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle);</div>
|
|
<div class="line"><a id="l01000" name="l01000"></a><span class="lineno"> 1000</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_breaks = breaks.size();</div>
|
|
<div class="line"><a id="l01001" name="l01001"></a><span class="lineno"> 1001</span> <span class="comment">// When there are no breaks, only break distance needs to be modeled,</span></div>
|
|
<div class="line"><a id="l01002" name="l01002"></a><span class="lineno"> 1002</span> <span class="comment">// and it reduces to a span maximum.</span></div>
|
|
<div class="line"><a id="l01003" name="l01003"></a><span class="lineno"> 1003</span> <span class="comment">// TODO(user): Also add the case where no breaks can intersect the route.</span></div>
|
|
<div class="line"><a id="l01004" name="l01004"></a><span class="lineno"> 1004</span> <span class="keywordflow">if</span> (num_breaks == 0) {</div>
|
|
<div class="line"><a id="l01005" name="l01005"></a><span class="lineno"> 1005</span> int64_t maximum_route_span = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a id="l01006" name="l01006"></a><span class="lineno"> 1006</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& distance_duration :</div>
|
|
<div class="line"><a id="l01007" name="l01007"></a><span class="lineno"> 1007</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#aeb48e0a259af538f591d9f843c113d00">GetBreakDistanceDurationOfVehicle</a>(vehicle)) {</div>
|
|
<div class="line"><a id="l01008" name="l01008"></a><span class="lineno"> 1008</span> maximum_route_span =</div>
|
|
<div class="line"><a id="l01009" name="l01009"></a><span class="lineno"> 1009</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(maximum_route_span, distance_duration.first);</div>
|
|
<div class="line"><a id="l01010" name="l01010"></a><span class="lineno"> 1010</span> }</div>
|
|
<div class="line"><a id="l01011" name="l01011"></a><span class="lineno"> 1011</span> <span class="keywordflow">if</span> (maximum_route_span < <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()) {</div>
|
|
<div class="line"><a id="l01012" name="l01012"></a><span class="lineno"> 1012</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver->CreateNewConstraint(</div>
|
|
<div class="line"><a id="l01013" name="l01013"></a><span class="lineno"> 1013</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>(), maximum_route_span);</div>
|
|
<div class="line"><a id="l01014" name="l01014"></a><span class="lineno"> 1014</span> solver->SetCoefficient(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, lp_cumuls.back(), 1);</div>
|
|
<div class="line"><a id="l01015" name="l01015"></a><span class="lineno"> 1015</span> solver->SetCoefficient(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, lp_cumuls.front(), -1);</div>
|
|
<div class="line"><a id="l01016" name="l01016"></a><span class="lineno"> 1016</span> }</div>
|
|
<div class="line"><a id="l01017" name="l01017"></a><span class="lineno"> 1017</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01018" name="l01018"></a><span class="lineno"> 1018</span> }</div>
|
|
<div class="line"><a id="l01019" name="l01019"></a><span class="lineno"> 1019</span> <span class="comment">// Gather visit information: the visit of node i has [start, end) =</span></div>
|
|
<div class="line"><a id="l01020" name="l01020"></a><span class="lineno"> 1020</span> <span class="comment">// [cumul[i] - post_travel[i-1], cumul[i] + pre_travel[i]).</span></div>
|
|
<div class="line"><a id="l01021" name="l01021"></a><span class="lineno"> 1021</span> <span class="comment">// Breaks cannot overlap those visit intervals.</span></div>
|
|
<div class="line"><a id="l01022" name="l01022"></a><span class="lineno"> 1022</span> std::vector<int64_t> pre_travel(path_size - 1, 0);</div>
|
|
<div class="line"><a id="l01023" name="l01023"></a><span class="lineno"> 1023</span> std::vector<int64_t> post_travel(path_size - 1, 0);</div>
|
|
<div class="line"><a id="l01024" name="l01024"></a><span class="lineno"> 1024</span> {</div>
|
|
<div class="line"><a id="l01025" name="l01025"></a><span class="lineno"> 1025</span> <span class="keyword">const</span> <span class="keywordtype">int</span> pre_travel_index =</div>
|
|
<div class="line"><a id="l01026" name="l01026"></a><span class="lineno"> 1026</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a8e93e99ce491f2779c0d2e5e7de5a98a">GetPreTravelEvaluatorOfVehicle</a>(vehicle);</div>
|
|
<div class="line"><a id="l01027" name="l01027"></a><span class="lineno"> 1027</span> <span class="keywordflow">if</span> (pre_travel_index != -1) {</div>
|
|
<div class="line"><a id="l01028" name="l01028"></a><span class="lineno"> 1028</span> <a class="code hl_function" href="namespaceoperations__research.html#aae315ffb47820060e3fa070260434118">FillPathEvaluation</a>(path, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TransitCallback(pre_travel_index),</div>
|
|
<div class="line"><a id="l01029" name="l01029"></a><span class="lineno"> 1029</span> &pre_travel);</div>
|
|
<div class="line"><a id="l01030" name="l01030"></a><span class="lineno"> 1030</span> }</div>
|
|
<div class="line"><a id="l01031" name="l01031"></a><span class="lineno"> 1031</span> <span class="keyword">const</span> <span class="keywordtype">int</span> post_travel_index =</div>
|
|
<div class="line"><a id="l01032" name="l01032"></a><span class="lineno"> 1032</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#afb4c32e76561cad95bd8be2777d8f1ac">GetPostTravelEvaluatorOfVehicle</a>(vehicle);</div>
|
|
<div class="line"><a id="l01033" name="l01033"></a><span class="lineno"> 1033</span> <span class="keywordflow">if</span> (post_travel_index != -1) {</div>
|
|
<div class="line"><a id="l01034" name="l01034"></a><span class="lineno"> 1034</span> <a class="code hl_function" href="namespaceoperations__research.html#aae315ffb47820060e3fa070260434118">FillPathEvaluation</a>(path, <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TransitCallback(post_travel_index),</div>
|
|
<div class="line"><a id="l01035" name="l01035"></a><span class="lineno"> 1035</span> &post_travel);</div>
|
|
<div class="line"><a id="l01036" name="l01036"></a><span class="lineno"> 1036</span> }</div>
|
|
<div class="line"><a id="l01037" name="l01037"></a><span class="lineno"> 1037</span> }</div>
|
|
<div class="line"><a id="l01038" name="l01038"></a><span class="lineno"> 1038</span> <span class="comment">// If the solver is CPSAT, it will need to represent the times at which</span></div>
|
|
<div class="line"><a id="l01039" name="l01039"></a><span class="lineno"> 1039</span> <span class="comment">// breaks are scheduled, those variables are used both in the pure breaks</span></div>
|
|
<div class="line"><a id="l01040" name="l01040"></a><span class="lineno"> 1040</span> <span class="comment">// part and in the break distance part of the model.</span></div>
|
|
<div class="line"><a id="l01041" name="l01041"></a><span class="lineno"> 1041</span> <span class="comment">// Otherwise, it doesn't need the variables and they are not created.</span></div>
|
|
<div class="line"><a id="l01042" name="l01042"></a><span class="lineno"> 1042</span> std::vector<int> lp_break_start;</div>
|
|
<div class="line"><a id="l01043" name="l01043"></a><span class="lineno"> 1043</span> std::vector<int> lp_break_duration;</div>
|
|
<div class="line"><a id="l01044" name="l01044"></a><span class="lineno"> 1044</span> std::vector<int> lp_break_end;</div>
|
|
<div class="line"><a id="l01045" name="l01045"></a><span class="lineno"> 1045</span> <span class="keywordflow">if</span> (solver->IsCPSATSolver()) {</div>
|
|
<div class="line"><a id="l01046" name="l01046"></a><span class="lineno"> 1046</span> lp_break_start.resize(num_breaks, -1);</div>
|
|
<div class="line"><a id="l01047" name="l01047"></a><span class="lineno"> 1047</span> lp_break_duration.resize(num_breaks, -1);</div>
|
|
<div class="line"><a id="l01048" name="l01048"></a><span class="lineno"> 1048</span> lp_break_end.resize(num_breaks, -1);</div>
|
|
<div class="line"><a id="l01049" name="l01049"></a><span class="lineno"> 1049</span> }</div>
|
|
<div class="line"><a id="l01050" name="l01050"></a><span class="lineno"> 1050</span> </div>
|
|
<div class="line"><a id="l01051" name="l01051"></a><span class="lineno"> 1051</span> std::vector<int> slack_exact_lower_bound_ct(path_size - 1, -1);</div>
|
|
<div class="line"><a id="l01052" name="l01052"></a><span class="lineno"> 1052</span> std::vector<int> slack_linear_lower_bound_ct(path_size - 1, -1);</div>
|
|
<div class="line"><a id="l01053" name="l01053"></a><span class="lineno"> 1053</span> </div>
|
|
<div class="line"><a id="l01054" name="l01054"></a><span class="lineno"> 1054</span> <span class="keyword">const</span> int64_t vehicle_start_min = current_route_min_cumuls_.front();</div>
|
|
<div class="line"><a id="l01055" name="l01055"></a><span class="lineno"> 1055</span> <span class="keyword">const</span> int64_t vehicle_start_max = current_route_max_cumuls_.front();</div>
|
|
<div class="line"><a id="l01056" name="l01056"></a><span class="lineno"> 1056</span> <span class="keyword">const</span> int64_t vehicle_end_min = current_route_min_cumuls_.back();</div>
|
|
<div class="line"><a id="l01057" name="l01057"></a><span class="lineno"> 1057</span> <span class="keyword">const</span> int64_t vehicle_end_max = current_route_max_cumuls_.back();</div>
|
|
<div class="line"><a id="l01058" name="l01058"></a><span class="lineno"> 1058</span> <span class="keyword">const</span> <span class="keywordtype">int</span> all_break_variables_offset =</div>
|
|
<div class="line"><a id="l01059" name="l01059"></a><span class="lineno"> 1059</span> vehicle_to_all_break_variables_offset_[vehicle];</div>
|
|
<div class="line"><a id="l01060" name="l01060"></a><span class="lineno"> 1060</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> br = 0; br < num_breaks; ++br) {</div>
|
|
<div class="line"><a id="l01061" name="l01061"></a><span class="lineno"> 1061</span> <span class="keyword">const</span> IntervalVar& break_var = *breaks[br];</div>
|
|
<div class="line"><a id="l01062" name="l01062"></a><span class="lineno"> 1062</span> <span class="keywordflow">if</span> (!break_var.MustBePerformed()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01063" name="l01063"></a><span class="lineno"> 1063</span> <span class="keyword">const</span> int64_t break_start_min = <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(break_var.StartMin(), cumul_offset);</div>
|
|
<div class="line"><a id="l01064" name="l01064"></a><span class="lineno"> 1064</span> <span class="keyword">const</span> int64_t break_start_max = <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(break_var.StartMax(), cumul_offset);</div>
|
|
<div class="line"><a id="l01065" name="l01065"></a><span class="lineno"> 1065</span> <span class="keyword">const</span> int64_t break_end_min = <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(break_var.EndMin(), cumul_offset);</div>
|
|
<div class="line"><a id="l01066" name="l01066"></a><span class="lineno"> 1066</span> <span class="keyword">const</span> int64_t break_end_max = <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(break_var.EndMax(), cumul_offset);</div>
|
|
<div class="line"><a id="l01067" name="l01067"></a><span class="lineno"> 1067</span> <span class="keyword">const</span> int64_t break_duration_min = break_var.DurationMin();</div>
|
|
<div class="line"><a id="l01068" name="l01068"></a><span class="lineno"> 1068</span> <span class="keyword">const</span> int64_t break_duration_max = break_var.DurationMax();</div>
|
|
<div class="line"><a id="l01069" name="l01069"></a><span class="lineno"> 1069</span> <span class="comment">// The CPSAT solver encodes all breaks that can intersect the route,</span></div>
|
|
<div class="line"><a id="l01070" name="l01070"></a><span class="lineno"> 1070</span> <span class="comment">// the LP solver only encodes the breaks that must intersect the route.</span></div>
|
|
<div class="line"><a id="l01071" name="l01071"></a><span class="lineno"> 1071</span> <span class="keywordflow">if</span> (solver->IsCPSATSolver()) {</div>
|
|
<div class="line"><a id="l01072" name="l01072"></a><span class="lineno"> 1072</span> <span class="keywordflow">if</span> (break_end_max <= vehicle_start_min ||</div>
|
|
<div class="line"><a id="l01073" name="l01073"></a><span class="lineno"> 1073</span> vehicle_end_max <= break_start_min) {</div>
|
|
<div class="line"><a id="l01074" name="l01074"></a><span class="lineno"> 1074</span> all_break_variables_[all_break_variables_offset + 2 * br] = -1;</div>
|
|
<div class="line"><a id="l01075" name="l01075"></a><span class="lineno"> 1075</span> all_break_variables_[all_break_variables_offset + 2 * br + 1] = -1;</div>
|
|
<div class="line"><a id="l01076" name="l01076"></a><span class="lineno"> 1076</span> current_route_break_variables_.push_back(-1);</div>
|
|
<div class="line"><a id="l01077" name="l01077"></a><span class="lineno"> 1077</span> current_route_break_variables_.push_back(-1);</div>
|
|
<div class="line"><a id="l01078" name="l01078"></a><span class="lineno"> 1078</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01079" name="l01079"></a><span class="lineno"> 1079</span> }</div>
|
|
<div class="line"><a id="l01080" name="l01080"></a><span class="lineno"> 1080</span> lp_break_start[br] =</div>
|
|
<div class="line"><a id="l01081" name="l01081"></a><span class="lineno"> 1081</span> solver->AddVariable(break_start_min, break_start_max);</div>
|
|
<div class="line"><a id="l01082" name="l01082"></a><span class="lineno"> 1082</span> lp_break_end[br] = solver->AddVariable(break_end_min, break_end_max);</div>
|
|
<div class="line"><a id="l01083" name="l01083"></a><span class="lineno"> 1083</span> lp_break_duration[br] =</div>
|
|
<div class="line"><a id="l01084" name="l01084"></a><span class="lineno"> 1084</span> solver->AddVariable(break_duration_min, break_duration_max);</div>
|
|
<div class="line"><a id="l01085" name="l01085"></a><span class="lineno"> 1085</span> <span class="comment">// start + duration = end.</span></div>
|
|
<div class="line"><a id="l01086" name="l01086"></a><span class="lineno"> 1086</span> solver->AddLinearConstraint(0, 0,</div>
|
|
<div class="line"><a id="l01087" name="l01087"></a><span class="lineno"> 1087</span> {{lp_break_end[br], 1},</div>
|
|
<div class="line"><a id="l01088" name="l01088"></a><span class="lineno"> 1088</span> {lp_break_start[br], -1},</div>
|
|
<div class="line"><a id="l01089" name="l01089"></a><span class="lineno"> 1089</span> {lp_break_duration[br], -1}});</div>
|
|
<div class="line"><a id="l01090" name="l01090"></a><span class="lineno"> 1090</span> <span class="comment">// Record index of variables</span></div>
|
|
<div class="line"><a id="l01091" name="l01091"></a><span class="lineno"> 1091</span> all_break_variables_[all_break_variables_offset + 2 * br] =</div>
|
|
<div class="line"><a id="l01092" name="l01092"></a><span class="lineno"> 1092</span> lp_break_start[br];</div>
|
|
<div class="line"><a id="l01093" name="l01093"></a><span class="lineno"> 1093</span> all_break_variables_[all_break_variables_offset + 2 * br + 1] =</div>
|
|
<div class="line"><a id="l01094" name="l01094"></a><span class="lineno"> 1094</span> lp_break_end[br];</div>
|
|
<div class="line"><a id="l01095" name="l01095"></a><span class="lineno"> 1095</span> current_route_break_variables_.push_back(lp_break_start[br]);</div>
|
|
<div class="line"><a id="l01096" name="l01096"></a><span class="lineno"> 1096</span> current_route_break_variables_.push_back(lp_break_end[br]);</div>
|
|
<div class="line"><a id="l01097" name="l01097"></a><span class="lineno"> 1097</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l01098" name="l01098"></a><span class="lineno"> 1098</span> <span class="keywordflow">if</span> (break_end_min <= vehicle_start_max ||</div>
|
|
<div class="line"><a id="l01099" name="l01099"></a><span class="lineno"> 1099</span> vehicle_end_min <= break_start_max) {</div>
|
|
<div class="line"><a id="l01100" name="l01100"></a><span class="lineno"> 1100</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01101" name="l01101"></a><span class="lineno"> 1101</span> }</div>
|
|
<div class="line"><a id="l01102" name="l01102"></a><span class="lineno"> 1102</span> }</div>
|
|
<div class="line"><a id="l01103" name="l01103"></a><span class="lineno"> 1103</span> </div>
|
|
<div class="line"><a id="l01104" name="l01104"></a><span class="lineno"> 1104</span> <span class="comment">// Create a constraint for every break, that forces it to be scheduled</span></div>
|
|
<div class="line"><a id="l01105" name="l01105"></a><span class="lineno"> 1105</span> <span class="comment">// in exactly one place, i.e. one slack or before/after the route.</span></div>
|
|
<div class="line"><a id="l01106" name="l01106"></a><span class="lineno"> 1106</span> <span class="comment">// sum_i break_in_slack_i == 1.</span></div>
|
|
<div class="line"><a id="l01107" name="l01107"></a><span class="lineno"> 1107</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 id="l01108" name="l01108"></a><span class="lineno"> 1108</span> </div>
|
|
<div class="line"><a id="l01109" name="l01109"></a><span class="lineno"> 1109</span> <span class="keywordflow">if</span> (solver->IsCPSATSolver()) {</div>
|
|
<div class="line"><a id="l01110" name="l01110"></a><span class="lineno"> 1110</span> <span class="comment">// Break can be before route.</span></div>
|
|
<div class="line"><a id="l01111" name="l01111"></a><span class="lineno"> 1111</span> <span class="keywordflow">if</span> (break_end_min <= vehicle_start_max) {</div>
|
|
<div class="line"><a id="l01112" name="l01112"></a><span class="lineno"> 1112</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver->AddLinearConstraint(</div>
|
|
<div class="line"><a id="l01113" name="l01113"></a><span class="lineno"> 1113</span> 0, <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>(),</div>
|
|
<div class="line"><a id="l01114" name="l01114"></a><span class="lineno"> 1114</span> {{lp_cumuls.front(), 1}, {lp_break_end[br], -1}});</div>
|
|
<div class="line"><a id="l01115" name="l01115"></a><span class="lineno"> 1115</span> <span class="keyword">const</span> <span class="keywordtype">int</span> break_is_before_route = solver->AddVariable(0, 1);</div>
|
|
<div class="line"><a id="l01116" name="l01116"></a><span class="lineno"> 1116</span> solver->SetEnforcementLiteral(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, break_is_before_route);</div>
|
|
<div class="line"><a id="l01117" name="l01117"></a><span class="lineno"> 1117</span> solver->SetCoefficient(break_in_one_slack_ct, break_is_before_route, 1);</div>
|
|
<div class="line"><a id="l01118" name="l01118"></a><span class="lineno"> 1118</span> }</div>
|
|
<div class="line"><a id="l01119" name="l01119"></a><span class="lineno"> 1119</span> <span class="comment">// Break can be after route.</span></div>
|
|
<div class="line"><a id="l01120" name="l01120"></a><span class="lineno"> 1120</span> <span class="keywordflow">if</span> (vehicle_end_min <= break_start_max) {</div>
|
|
<div class="line"><a id="l01121" name="l01121"></a><span class="lineno"> 1121</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver->AddLinearConstraint(</div>
|
|
<div class="line"><a id="l01122" name="l01122"></a><span class="lineno"> 1122</span> 0, <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>(),</div>
|
|
<div class="line"><a id="l01123" name="l01123"></a><span class="lineno"> 1123</span> {{lp_break_start[br], 1}, {lp_cumuls.back(), -1}});</div>
|
|
<div class="line"><a id="l01124" name="l01124"></a><span class="lineno"> 1124</span> <span class="keyword">const</span> <span class="keywordtype">int</span> break_is_after_route = solver->AddVariable(0, 1);</div>
|
|
<div class="line"><a id="l01125" name="l01125"></a><span class="lineno"> 1125</span> solver->SetEnforcementLiteral(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, break_is_after_route);</div>
|
|
<div class="line"><a id="l01126" name="l01126"></a><span class="lineno"> 1126</span> solver->SetCoefficient(break_in_one_slack_ct, break_is_after_route, 1);</div>
|
|
<div class="line"><a id="l01127" name="l01127"></a><span class="lineno"> 1127</span> }</div>
|
|
<div class="line"><a id="l01128" name="l01128"></a><span class="lineno"> 1128</span> }</div>
|
|
<div class="line"><a id="l01129" name="l01129"></a><span class="lineno"> 1129</span> </div>
|
|
<div class="line"><a id="l01130" name="l01130"></a><span class="lineno"> 1130</span> <span class="comment">// Add the possibility of fitting the break during each slack where it can.</span></div>
|
|
<div class="line"><a id="l01131" name="l01131"></a><span class="lineno"> 1131</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = 0; pos < path_size - 1; ++pos) {</div>
|
|
<div class="line"><a id="l01132" name="l01132"></a><span class="lineno"> 1132</span> <span class="comment">// Pass on slacks that cannot start before, cannot end after,</span></div>
|
|
<div class="line"><a id="l01133" name="l01133"></a><span class="lineno"> 1133</span> <span class="comment">// or are not long enough to contain the break.</span></div>
|
|
<div class="line"><a id="l01134" name="l01134"></a><span class="lineno"> 1134</span> <span class="keyword">const</span> int64_t slack_start_min =</div>
|
|
<div class="line"><a id="l01135" name="l01135"></a><span class="lineno"> 1135</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(current_route_min_cumuls_[pos], pre_travel[pos]);</div>
|
|
<div class="line"><a id="l01136" name="l01136"></a><span class="lineno"> 1136</span> <span class="keywordflow">if</span> (slack_start_min > break_start_max) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l01137" name="l01137"></a><span class="lineno"> 1137</span> <span class="keyword">const</span> int64_t slack_end_max =</div>
|
|
<div class="line"><a id="l01138" name="l01138"></a><span class="lineno"> 1138</span> <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(current_route_max_cumuls_[pos + 1], post_travel[pos]);</div>
|
|
<div class="line"><a id="l01139" name="l01139"></a><span class="lineno"> 1139</span> <span class="keywordflow">if</span> (break_end_min > slack_end_max) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01140" name="l01140"></a><span class="lineno"> 1140</span> <span class="keyword">const</span> int64_t slack_duration_max =</div>
|
|
<div class="line"><a id="l01141" name="l01141"></a><span class="lineno"> 1141</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(<a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(<a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(current_route_max_cumuls_[pos + 1],</div>
|
|
<div class="line"><a id="l01142" name="l01142"></a><span class="lineno"> 1142</span> current_route_min_cumuls_[pos]),</div>
|
|
<div class="line"><a id="l01143" name="l01143"></a><span class="lineno"> 1143</span> fixed_transit[pos]),</div>
|
|
<div class="line"><a id="l01144" name="l01144"></a><span class="lineno"> 1144</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a4232c22ddc9e65e726ee87cf27778072">SlackVar</a>(path[pos])-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#ac84c250d67f30c89e845cd460eeaaad8">Max</a>());</div>
|
|
<div class="line"><a id="l01145" name="l01145"></a><span class="lineno"> 1145</span> <span class="keywordflow">if</span> (slack_duration_max < break_duration_min) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01146" name="l01146"></a><span class="lineno"> 1146</span> </div>
|
|
<div class="line"><a id="l01147" name="l01147"></a><span class="lineno"> 1147</span> <span class="comment">// Break can fit into slack: make LP variable, add to break and slack</span></div>
|
|
<div class="line"><a id="l01148" name="l01148"></a><span class="lineno"> 1148</span> <span class="comment">// constraints.</span></div>
|
|
<div class="line"><a id="l01149" name="l01149"></a><span class="lineno"> 1149</span> <span class="comment">// Make a linearized slack lower bound (lazily), that represents</span></div>
|
|
<div class="line"><a id="l01150" name="l01150"></a><span class="lineno"> 1150</span> <span class="comment">// sum_br break_duration_min(br) * break_in_slack(br, pos) <=</span></div>
|
|
<div class="line"><a id="l01151" name="l01151"></a><span class="lineno"> 1151</span> <span class="comment">// lp_slacks(pos).</span></div>
|
|
<div class="line"><a id="l01152" name="l01152"></a><span class="lineno"> 1152</span> <span class="keyword">const</span> <span class="keywordtype">int</span> break_in_slack = solver->AddVariable(0, 1);</div>
|
|
<div class="line"><a id="l01153" name="l01153"></a><span class="lineno"> 1153</span> solver->SetCoefficient(break_in_one_slack_ct, break_in_slack, 1);</div>
|
|
<div class="line"><a id="l01154" name="l01154"></a><span class="lineno"> 1154</span> <span class="keywordflow">if</span> (slack_linear_lower_bound_ct[pos] == -1) {</div>
|
|
<div class="line"><a id="l01155" name="l01155"></a><span class="lineno"> 1155</span> slack_linear_lower_bound_ct[pos] = solver->AddLinearConstraint(</div>
|
|
<div class="line"><a id="l01156" name="l01156"></a><span class="lineno"> 1156</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>(), 0, {{lp_slacks[pos], -1}});</div>
|
|
<div class="line"><a id="l01157" name="l01157"></a><span class="lineno"> 1157</span> }</div>
|
|
<div class="line"><a id="l01158" name="l01158"></a><span class="lineno"> 1158</span> solver->SetCoefficient(slack_linear_lower_bound_ct[pos], break_in_slack,</div>
|
|
<div class="line"><a id="l01159" name="l01159"></a><span class="lineno"> 1159</span> break_duration_min);</div>
|
|
<div class="line"><a id="l01160" name="l01160"></a><span class="lineno"> 1160</span> <span class="keywordflow">if</span> (solver->IsCPSATSolver()) {</div>
|
|
<div class="line"><a id="l01161" name="l01161"></a><span class="lineno"> 1161</span> <span class="comment">// Exact relation between breaks, slacks and cumul variables.</span></div>
|
|
<div class="line"><a id="l01162" name="l01162"></a><span class="lineno"> 1162</span> <span class="comment">// Make an exact slack lower bound (lazily), that represents</span></div>
|
|
<div class="line"><a id="l01163" name="l01163"></a><span class="lineno"> 1163</span> <span class="comment">// sum_br break_duration(br) * break_in_slack(br, pos) <=</span></div>
|
|
<div class="line"><a id="l01164" name="l01164"></a><span class="lineno"> 1164</span> <span class="comment">// lp_slacks(pos).</span></div>
|
|
<div class="line"><a id="l01165" name="l01165"></a><span class="lineno"> 1165</span> <span class="keyword">const</span> <span class="keywordtype">int</span> break_duration_in_slack =</div>
|
|
<div class="line"><a id="l01166" name="l01166"></a><span class="lineno"> 1166</span> solver->AddVariable(0, slack_duration_max);</div>
|
|
<div class="line"><a id="l01167" name="l01167"></a><span class="lineno"> 1167</span> solver->AddProductConstraint(break_duration_in_slack,</div>
|
|
<div class="line"><a id="l01168" name="l01168"></a><span class="lineno"> 1168</span> {break_in_slack, lp_break_duration[br]});</div>
|
|
<div class="line"><a id="l01169" name="l01169"></a><span class="lineno"> 1169</span> <span class="keywordflow">if</span> (slack_exact_lower_bound_ct[pos] == -1) {</div>
|
|
<div class="line"><a id="l01170" name="l01170"></a><span class="lineno"> 1170</span> slack_exact_lower_bound_ct[pos] = solver->AddLinearConstraint(</div>
|
|
<div class="line"><a id="l01171" name="l01171"></a><span class="lineno"> 1171</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>(), 0, {{lp_slacks[pos], -1}});</div>
|
|
<div class="line"><a id="l01172" name="l01172"></a><span class="lineno"> 1172</span> }</div>
|
|
<div class="line"><a id="l01173" name="l01173"></a><span class="lineno"> 1173</span> solver->SetCoefficient(slack_exact_lower_bound_ct[pos],</div>
|
|
<div class="line"><a id="l01174" name="l01174"></a><span class="lineno"> 1174</span> break_duration_in_slack, 1);</div>
|
|
<div class="line"><a id="l01175" name="l01175"></a><span class="lineno"> 1175</span> <span class="comment">// If break_in_slack_i == 1, then</span></div>
|
|
<div class="line"><a id="l01176" name="l01176"></a><span class="lineno"> 1176</span> <span class="comment">// 1) break_start >= cumul[pos] + pre_travel[pos]</span></div>
|
|
<div class="line"><a id="l01177" name="l01177"></a><span class="lineno"> 1177</span> <span class="keyword">const</span> <span class="keywordtype">int</span> break_start_after_current_ct = solver->AddLinearConstraint(</div>
|
|
<div class="line"><a id="l01178" name="l01178"></a><span class="lineno"> 1178</span> pre_travel[pos], <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>(),</div>
|
|
<div class="line"><a id="l01179" name="l01179"></a><span class="lineno"> 1179</span> {{lp_break_start[br], 1}, {lp_cumuls[pos], -1}});</div>
|
|
<div class="line"><a id="l01180" name="l01180"></a><span class="lineno"> 1180</span> solver->SetEnforcementLiteral(break_start_after_current_ct,</div>
|
|
<div class="line"><a id="l01181" name="l01181"></a><span class="lineno"> 1181</span> break_in_slack);</div>
|
|
<div class="line"><a id="l01182" name="l01182"></a><span class="lineno"> 1182</span> <span class="comment">// 2) break_end <= cumul[pos+1] - post_travel[pos]</span></div>
|
|
<div class="line"><a id="l01183" name="l01183"></a><span class="lineno"> 1183</span> <span class="keyword">const</span> <span class="keywordtype">int</span> break_ends_before_next_ct = solver->AddLinearConstraint(</div>
|
|
<div class="line"><a id="l01184" name="l01184"></a><span class="lineno"> 1184</span> post_travel[pos], <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>(),</div>
|
|
<div class="line"><a id="l01185" name="l01185"></a><span class="lineno"> 1185</span> {{lp_cumuls[pos + 1], 1}, {lp_break_end[br], -1}});</div>
|
|
<div class="line"><a id="l01186" name="l01186"></a><span class="lineno"> 1186</span> solver->SetEnforcementLiteral(break_ends_before_next_ct,</div>
|
|
<div class="line"><a id="l01187" name="l01187"></a><span class="lineno"> 1187</span> break_in_slack);</div>
|
|
<div class="line"><a id="l01188" name="l01188"></a><span class="lineno"> 1188</span> }</div>
|
|
<div class="line"><a id="l01189" name="l01189"></a><span class="lineno"> 1189</span> }</div>
|
|
<div class="line"><a id="l01190" name="l01190"></a><span class="lineno"> 1190</span> }</div>
|
|
<div class="line"><a id="l01191" name="l01191"></a><span class="lineno"> 1191</span> </div>
|
|
<div class="line"><a id="l01192" name="l01192"></a><span class="lineno"> 1192</span> <span class="keywordflow">if</span> (!solver->IsCPSATSolver()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01193" name="l01193"></a><span class="lineno"> 1193</span> <span class="keywordflow">if</span> (!dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#aeb48e0a259af538f591d9f843c113d00">GetBreakDistanceDurationOfVehicle</a>(vehicle).empty()) {</div>
|
|
<div class="line"><a id="l01194" name="l01194"></a><span class="lineno"> 1194</span> <span class="comment">// If there is an optional interval, the following model would be wrong.</span></div>
|
|
<div class="line"><a id="l01195" name="l01195"></a><span class="lineno"> 1195</span> <span class="comment">// TODO(user): support optional intervals.</span></div>
|
|
<div class="line"><a id="l01196" name="l01196"></a><span class="lineno"> 1196</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> IntervalVar* <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> :</div>
|
|
<div class="line"><a id="l01197" name="l01197"></a><span class="lineno"> 1197</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle)) {</div>
|
|
<div class="line"><a id="l01198" name="l01198"></a><span class="lineno"> 1198</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MustBePerformed()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01199" name="l01199"></a><span class="lineno"> 1199</span> }</div>
|
|
<div class="line"><a id="l01200" name="l01200"></a><span class="lineno"> 1200</span> <span class="comment">// When this feature is used, breaks are in sorted order.</span></div>
|
|
<div class="line"><a id="l01201" name="l01201"></a><span class="lineno"> 1201</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> br = 1; br < num_breaks; ++br) {</div>
|
|
<div class="line"><a id="l01202" name="l01202"></a><span class="lineno"> 1202</span> solver->AddLinearConstraint(</div>
|
|
<div class="line"><a id="l01203" name="l01203"></a><span class="lineno"> 1203</span> 0, <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>(),</div>
|
|
<div class="line"><a id="l01204" name="l01204"></a><span class="lineno"> 1204</span> {{lp_break_end[br - 1], -1}, {lp_break_start[br], 1}});</div>
|
|
<div class="line"><a id="l01205" name="l01205"></a><span class="lineno"> 1205</span> }</div>
|
|
<div class="line"><a id="l01206" name="l01206"></a><span class="lineno"> 1206</span> }</div>
|
|
<div class="line"><a id="l01207" name="l01207"></a><span class="lineno"> 1207</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& distance_duration :</div>
|
|
<div class="line"><a id="l01208" name="l01208"></a><span class="lineno"> 1208</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#aeb48e0a259af538f591d9f843c113d00">GetBreakDistanceDurationOfVehicle</a>(vehicle)) {</div>
|
|
<div class="line"><a id="l01209" name="l01209"></a><span class="lineno"> 1209</span> <span class="keyword">const</span> int64_t limit = distance_duration.first;</div>
|
|
<div class="line"><a id="l01210" name="l01210"></a><span class="lineno"> 1210</span> <span class="keyword">const</span> int64_t min_break_duration = distance_duration.second;</div>
|
|
<div class="line"><a id="l01211" name="l01211"></a><span class="lineno"> 1211</span> <span class="comment">// Interbreak limit constraint: breaks are interpreted as being in sorted</span></div>
|
|
<div class="line"><a id="l01212" name="l01212"></a><span class="lineno"> 1212</span> <span class="comment">// order, and the maximum duration between two consecutive</span></div>
|
|
<div class="line"><a id="l01213" name="l01213"></a><span class="lineno"> 1213</span> <span class="comment">// breaks of duration more than 'min_break_duration' is 'limit'. This</span></div>
|
|
<div class="line"><a id="l01214" name="l01214"></a><span class="lineno"> 1214</span> <span class="comment">// considers the time until start of route and after end of route to be</span></div>
|
|
<div class="line"><a id="l01215" name="l01215"></a><span class="lineno"> 1215</span> <span class="comment">// infinite breaks.</span></div>
|
|
<div class="line"><a id="l01216" name="l01216"></a><span class="lineno"> 1216</span> <span class="comment">// The model for this constraint adds some 'cover_i' variables, such that</span></div>
|
|
<div class="line"><a id="l01217" name="l01217"></a><span class="lineno"> 1217</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 id="l01218" name="l01218"></a><span class="lineno"> 1218</span> <span class="comment">// With s_i the start of break i and e_i its end:</span></div>
|
|
<div class="line"><a id="l01219" name="l01219"></a><span class="lineno"> 1219</span> <span class="comment">// - the route start covers time from start to start + limit:</span></div>
|
|
<div class="line"><a id="l01220" name="l01220"></a><span class="lineno"> 1220</span> <span class="comment">// cover_0 = route_start + limit</span></div>
|
|
<div class="line"><a id="l01221" name="l01221"></a><span class="lineno"> 1221</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 id="l01222" name="l01222"></a><span class="lineno"> 1222</span> <span class="comment">// previous break and if the break is long enough, break end + limit:</span></div>
|
|
<div class="line"><a id="l01223" name="l01223"></a><span class="lineno"> 1223</span> <span class="comment">// cover_{i+1} = max(cover_i,</span></div>
|
|
<div class="line"><a id="l01224" name="l01224"></a><span class="lineno"> 1224</span> <span class="comment">// e_i - s_i >= min_break_duration ? e_i + limit : -inf)</span></div>
|
|
<div class="line"><a id="l01225" name="l01225"></a><span class="lineno"> 1225</span> <span class="comment">// - the coverage of the last break must be at least the route end,</span></div>
|
|
<div class="line"><a id="l01226" name="l01226"></a><span class="lineno"> 1226</span> <span class="comment">// to ensure the time point route_end-1 is covered:</span></div>
|
|
<div class="line"><a id="l01227" name="l01227"></a><span class="lineno"> 1227</span> <span class="comment">// cover_{num_breaks} >= route_end</span></div>
|
|
<div class="line"><a id="l01228" name="l01228"></a><span class="lineno"> 1228</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 id="l01229" name="l01229"></a><span class="lineno"> 1229</span> <span class="comment">// but only if the cover has not reached the route end.</span></div>
|
|
<div class="line"><a id="l01230" name="l01230"></a><span class="lineno"> 1230</span> <span class="comment">// For instance, a vehicle could have a choice between two days,</span></div>
|
|
<div class="line"><a id="l01231" name="l01231"></a><span class="lineno"> 1231</span> <span class="comment">// with a potential break on day 1 and a potential break on day 2,</span></div>
|
|
<div class="line"><a id="l01232" name="l01232"></a><span class="lineno"> 1232</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 id="l01233" name="l01233"></a><span class="lineno"> 1233</span> <span class="comment">// cover_{i-1} < route_end => s_i <= cover_{i-1}</span></div>
|
|
<div class="line"><a id="l01234" name="l01234"></a><span class="lineno"> 1234</span> <span class="comment">// This is sufficient to ensure that the union of the intervals</span></div>
|
|
<div class="line"><a id="l01235" name="l01235"></a><span class="lineno"> 1235</span> <span class="comment">// (-infinity, route_start], [route_end, +infinity) and all</span></div>
|
|
<div class="line"><a id="l01236" name="l01236"></a><span class="lineno"> 1236</span> <span class="comment">// [s_i, e_i+limit) where e_i - s_i >= min_break_duration is</span></div>
|
|
<div class="line"><a id="l01237" name="l01237"></a><span class="lineno"> 1237</span> <span class="comment">// the whole timeline (-infinity, +infinity).</span></div>
|
|
<div class="line"><a id="l01238" name="l01238"></a><span class="lineno"> 1238</span> <span class="keywordtype">int</span> previous_cover = solver->AddVariable(<a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(vehicle_start_min, limit),</div>
|
|
<div class="line"><a id="l01239" name="l01239"></a><span class="lineno"> 1239</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(vehicle_start_max, limit));</div>
|
|
<div class="line"><a id="l01240" name="l01240"></a><span class="lineno"> 1240</span> solver->AddLinearConstraint(limit, limit,</div>
|
|
<div class="line"><a id="l01241" name="l01241"></a><span class="lineno"> 1241</span> {{previous_cover, 1}, {lp_cumuls.front(), -1}});</div>
|
|
<div class="line"><a id="l01242" name="l01242"></a><span class="lineno"> 1242</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> br = 0; br < num_breaks; ++br) {</div>
|
|
<div class="line"><a id="l01243" name="l01243"></a><span class="lineno"> 1243</span> <span class="keywordflow">if</span> (lp_break_start[br] == -1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01244" name="l01244"></a><span class="lineno"> 1244</span> <span class="keyword">const</span> int64_t break_end_min = <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(breaks[br]->EndMin(), cumul_offset);</div>
|
|
<div class="line"><a id="l01245" name="l01245"></a><span class="lineno"> 1245</span> <span class="keyword">const</span> int64_t break_end_max = <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(breaks[br]->EndMax(), cumul_offset);</div>
|
|
<div class="line"><a id="l01246" name="l01246"></a><span class="lineno"> 1246</span> <span class="comment">// break_is_eligible <=></span></div>
|
|
<div class="line"><a id="l01247" name="l01247"></a><span class="lineno"> 1247</span> <span class="comment">// break_end - break_start >= break_minimum_duration.</span></div>
|
|
<div class="line"><a id="l01248" name="l01248"></a><span class="lineno"> 1248</span> <span class="keyword">const</span> <span class="keywordtype">int</span> break_is_eligible = solver->AddVariable(0, 1);</div>
|
|
<div class="line"><a id="l01249" name="l01249"></a><span class="lineno"> 1249</span> <span class="keyword">const</span> <span class="keywordtype">int</span> break_is_not_eligible = solver->AddVariable(0, 1);</div>
|
|
<div class="line"><a id="l01250" name="l01250"></a><span class="lineno"> 1250</span> {</div>
|
|
<div class="line"><a id="l01251" name="l01251"></a><span class="lineno"> 1251</span> solver->AddLinearConstraint(</div>
|
|
<div class="line"><a id="l01252" name="l01252"></a><span class="lineno"> 1252</span> 1, 1, {{break_is_eligible, 1}, {break_is_not_eligible, 1}});</div>
|
|
<div class="line"><a id="l01253" name="l01253"></a><span class="lineno"> 1253</span> <span class="keyword">const</span> <span class="keywordtype">int</span> positive_ct = solver->AddLinearConstraint(</div>
|
|
<div class="line"><a id="l01254" name="l01254"></a><span class="lineno"> 1254</span> min_break_duration, <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>(),</div>
|
|
<div class="line"><a id="l01255" name="l01255"></a><span class="lineno"> 1255</span> {{lp_break_end[br], 1}, {lp_break_start[br], -1}});</div>
|
|
<div class="line"><a id="l01256" name="l01256"></a><span class="lineno"> 1256</span> solver->SetEnforcementLiteral(positive_ct, break_is_eligible);</div>
|
|
<div class="line"><a id="l01257" name="l01257"></a><span class="lineno"> 1257</span> <span class="keyword">const</span> <span class="keywordtype">int</span> negative_ct = solver->AddLinearConstraint(</div>
|
|
<div class="line"><a id="l01258" name="l01258"></a><span class="lineno"> 1258</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>(), min_break_duration - 1,</div>
|
|
<div class="line"><a id="l01259" name="l01259"></a><span class="lineno"> 1259</span> {{lp_break_end[br], 1}, {lp_break_start[br], -1}});</div>
|
|
<div class="line"><a id="l01260" name="l01260"></a><span class="lineno"> 1260</span> solver->SetEnforcementLiteral(negative_ct, break_is_not_eligible);</div>
|
|
<div class="line"><a id="l01261" name="l01261"></a><span class="lineno"> 1261</span> }</div>
|
|
<div class="line"><a id="l01262" name="l01262"></a><span class="lineno"> 1262</span> <span class="comment">// break_is_eligible => break_cover == break_end + limit.</span></div>
|
|
<div class="line"><a id="l01263" name="l01263"></a><span class="lineno"> 1263</span> <span class="comment">// break_is_not_eligible => break_cover == vehicle_start_min + limit.</span></div>
|
|
<div class="line"><a id="l01264" name="l01264"></a><span class="lineno"> 1264</span> <span class="comment">// break_cover's initial domain is the smallest interval that contains the</span></div>
|
|
<div class="line"><a id="l01265" name="l01265"></a><span class="lineno"> 1265</span> <span class="comment">// union of sets {vehicle_start_min+limit} and</span></div>
|
|
<div class="line"><a id="l01266" name="l01266"></a><span class="lineno"> 1266</span> <span class="comment">// [break_end_min+limit, break_end_max+limit).</span></div>
|
|
<div class="line"><a id="l01267" name="l01267"></a><span class="lineno"> 1267</span> <span class="keyword">const</span> <span class="keywordtype">int</span> break_cover = solver->AddVariable(</div>
|
|
<div class="line"><a id="l01268" name="l01268"></a><span class="lineno"> 1268</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(vehicle_start_min, break_end_min), limit),</div>
|
|
<div class="line"><a id="l01269" name="l01269"></a><span class="lineno"> 1269</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(vehicle_start_min, break_end_max), limit));</div>
|
|
<div class="line"><a id="l01270" name="l01270"></a><span class="lineno"> 1270</span> <span class="keyword">const</span> <span class="keywordtype">int</span> limit_cover_ct = solver->AddLinearConstraint(</div>
|
|
<div class="line"><a id="l01271" name="l01271"></a><span class="lineno"> 1271</span> limit, limit, {{break_cover, 1}, {lp_break_end[br], -1}});</div>
|
|
<div class="line"><a id="l01272" name="l01272"></a><span class="lineno"> 1272</span> solver->SetEnforcementLiteral(limit_cover_ct, break_is_eligible);</div>
|
|
<div class="line"><a id="l01273" name="l01273"></a><span class="lineno"> 1273</span> <span class="keyword">const</span> <span class="keywordtype">int</span> empty_cover_ct = solver->AddLinearConstraint(</div>
|
|
<div class="line"><a id="l01274" name="l01274"></a><span class="lineno"> 1274</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(vehicle_start_min, limit), <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(vehicle_start_min, limit),</div>
|
|
<div class="line"><a id="l01275" name="l01275"></a><span class="lineno"> 1275</span> {{break_cover, 1}});</div>
|
|
<div class="line"><a id="l01276" name="l01276"></a><span class="lineno"> 1276</span> solver->SetEnforcementLiteral(empty_cover_ct, break_is_not_eligible);</div>
|
|
<div class="line"><a id="l01277" name="l01277"></a><span class="lineno"> 1277</span> </div>
|
|
<div class="line"><a id="l01278" name="l01278"></a><span class="lineno"> 1278</span> <span class="keyword">const</span> <span class="keywordtype">int</span> cover =</div>
|
|
<div class="line"><a id="l01279" name="l01279"></a><span class="lineno"> 1279</span> solver->AddVariable(<a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(vehicle_start_min, limit),</div>
|
|
<div class="line"><a id="l01280" name="l01280"></a><span class="lineno"> 1280</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>());</div>
|
|
<div class="line"><a id="l01281" name="l01281"></a><span class="lineno"> 1281</span> solver->AddMaximumConstraint(cover, {previous_cover, break_cover});</div>
|
|
<div class="line"><a id="l01282" name="l01282"></a><span class="lineno"> 1282</span> <span class="comment">// Cover chaining. If route end is not covered, break start must be:</span></div>
|
|
<div class="line"><a id="l01283" name="l01283"></a><span class="lineno"> 1283</span> <span class="comment">// cover_{i-1} < route_end => s_i <= cover_{i-1}</span></div>
|
|
<div class="line"><a id="l01284" name="l01284"></a><span class="lineno"> 1284</span> <span class="keyword">const</span> <span class="keywordtype">int</span> route_end_is_not_covered = solver->AddReifiedLinearConstraint(</div>
|
|
<div class="line"><a id="l01285" name="l01285"></a><span class="lineno"> 1285</span> 1, <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>(),</div>
|
|
<div class="line"><a id="l01286" name="l01286"></a><span class="lineno"> 1286</span> {{lp_cumuls.back(), 1}, {previous_cover, -1}});</div>
|
|
<div class="line"><a id="l01287" name="l01287"></a><span class="lineno"> 1287</span> <span class="keyword">const</span> <span class="keywordtype">int</span> break_start_cover_ct = solver->AddLinearConstraint(</div>
|
|
<div class="line"><a id="l01288" name="l01288"></a><span class="lineno"> 1288</span> 0, <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>(),</div>
|
|
<div class="line"><a id="l01289" name="l01289"></a><span class="lineno"> 1289</span> {{previous_cover, 1}, {lp_break_start[br], -1}});</div>
|
|
<div class="line"><a id="l01290" name="l01290"></a><span class="lineno"> 1290</span> solver->SetEnforcementLiteral(break_start_cover_ct,</div>
|
|
<div class="line"><a id="l01291" name="l01291"></a><span class="lineno"> 1291</span> route_end_is_not_covered);</div>
|
|
<div class="line"><a id="l01292" name="l01292"></a><span class="lineno"> 1292</span> </div>
|
|
<div class="line"><a id="l01293" name="l01293"></a><span class="lineno"> 1293</span> previous_cover = cover;</div>
|
|
<div class="line"><a id="l01294" name="l01294"></a><span class="lineno"> 1294</span> }</div>
|
|
<div class="line"><a id="l01295" name="l01295"></a><span class="lineno"> 1295</span> solver->AddLinearConstraint(0, <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>(),</div>
|
|
<div class="line"><a id="l01296" name="l01296"></a><span class="lineno"> 1296</span> {{previous_cover, 1}, {lp_cumuls.back(), -1}});</div>
|
|
<div class="line"><a id="l01297" name="l01297"></a><span class="lineno"> 1297</span> }</div>
|
|
<div class="line"><a id="l01298" name="l01298"></a><span class="lineno"> 1298</span> </div>
|
|
<div class="line"><a id="l01299" name="l01299"></a><span class="lineno"> 1299</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01300" name="l01300"></a><span class="lineno"> 1300</span>}</div>
|
|
<div class="line"><a id="l01301" name="l01301"></a><span class="lineno"> 1301</span> </div>
|
|
<div class="line"><a id="l01302" name="l01302"></a><span class="lineno"> 1302</span><span class="keywordtype">void</span> DimensionCumulOptimizerCore::SetGlobalConstraints(</div>
|
|
<div class="line"><a id="l01303" name="l01303"></a><span class="lineno"> 1303</span> <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor, int64_t cumul_offset,</div>
|
|
<div class="line"><a id="l01304" name="l01304"></a><span class="lineno"> 1304</span> <span class="keywordtype">bool</span> optimize_costs, RoutingLinearSolverWrapper* solver) {</div>
|
|
<div class="line"><a id="l01305" name="l01305"></a><span class="lineno"> 1305</span> <span class="comment">// Global span cost =</span></div>
|
|
<div class="line"><a id="l01306" name="l01306"></a><span class="lineno"> 1306</span> <span class="comment">// global_span_cost_coefficient * (max_end_cumul - min_start_cumul).</span></div>
|
|
<div class="line"><a id="l01307" name="l01307"></a><span class="lineno"> 1307</span> <span class="keyword">const</span> int64_t global_span_coeff = dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a539915a226ec8626161d0310b22e8881">global_span_cost_coefficient</a>();</div>
|
|
<div class="line"><a id="l01308" name="l01308"></a><span class="lineno"> 1308</span> <span class="keywordflow">if</span> (optimize_costs && global_span_coeff > 0) {</div>
|
|
<div class="line"><a id="l01309" name="l01309"></a><span class="lineno"> 1309</span> solver->SetObjectiveCoefficient(max_end_cumul_, global_span_coeff);</div>
|
|
<div class="line"><a id="l01310" name="l01310"></a><span class="lineno"> 1310</span> solver->SetObjectiveCoefficient(min_start_cumul_, -global_span_coeff);</div>
|
|
<div class="line"><a id="l01311" name="l01311"></a><span class="lineno"> 1311</span> }</div>
|
|
<div class="line"><a id="l01312" name="l01312"></a><span class="lineno"> 1312</span> </div>
|
|
<div class="line"><a id="l01313" name="l01313"></a><span class="lineno"> 1313</span> <span class="comment">// Node precedence constraints, set when both nodes are visited.</span></div>
|
|
<div class="line"><a id="l01314" name="l01314"></a><span class="lineno"> 1314</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> RoutingDimension::NodePrecedence& precedence :</div>
|
|
<div class="line"><a id="l01315" name="l01315"></a><span class="lineno"> 1315</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a96a6b6ac14b3f18c40e2e00b9e186842">GetNodePrecedences</a>()) {</div>
|
|
<div class="line"><a id="l01316" name="l01316"></a><span class="lineno"> 1316</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 id="l01317" name="l01317"></a><span class="lineno"> 1317</span> <span class="keyword">const</span> <span class="keywordtype">int</span> second_cumul_var =</div>
|
|
<div class="line"><a id="l01318" name="l01318"></a><span class="lineno"> 1318</span> index_to_cumul_variable_[precedence.second_node];</div>
|
|
<div class="line"><a id="l01319" name="l01319"></a><span class="lineno"> 1319</span> <span class="keywordflow">if</span> (first_cumul_var < 0 || second_cumul_var < 0) {</div>
|
|
<div class="line"><a id="l01320" name="l01320"></a><span class="lineno"> 1320</span> <span class="comment">// At least one of the nodes is not on any route, skip this precedence</span></div>
|
|
<div class="line"><a id="l01321" name="l01321"></a><span class="lineno"> 1321</span> <span class="comment">// constraint.</span></div>
|
|
<div class="line"><a id="l01322" name="l01322"></a><span class="lineno"> 1322</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01323" name="l01323"></a><span class="lineno"> 1323</span> }</div>
|
|
<div class="line"><a id="l01324" name="l01324"></a><span class="lineno"> 1324</span> <a class="code hl_define" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(first_cumul_var, second_cumul_var)</div>
|
|
<div class="line"><a id="l01325" name="l01325"></a><span class="lineno"> 1325</span> << <span class="stringliteral">"Dimension "</span> << dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a24dcbf29c0d6cd766009a182a6484e3b">name</a>()</div>
|
|
<div class="line"><a id="l01326" name="l01326"></a><span class="lineno"> 1326</span> << <span class="stringliteral">" has a self-precedence on node "</span> << precedence.first_node << <span class="stringliteral">"."</span>;</div>
|
|
<div class="line"><a id="l01327" name="l01327"></a><span class="lineno"> 1327</span> </div>
|
|
<div class="line"><a id="l01328" name="l01328"></a><span class="lineno"> 1328</span> <span class="comment">// cumul[second_node] - cumul[first_node] >= offset.</span></div>
|
|
<div class="line"><a id="l01329" name="l01329"></a><span class="lineno"> 1329</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = solver->CreateNewConstraint(</div>
|
|
<div class="line"><a id="l01330" name="l01330"></a><span class="lineno"> 1330</span> precedence.offset, <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>());</div>
|
|
<div class="line"><a id="l01331" name="l01331"></a><span class="lineno"> 1331</span> solver->SetCoefficient(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, second_cumul_var, 1);</div>
|
|
<div class="line"><a id="l01332" name="l01332"></a><span class="lineno"> 1332</span> solver->SetCoefficient(<a class="code hl_variable" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, first_cumul_var, -1);</div>
|
|
<div class="line"><a id="l01333" name="l01333"></a><span class="lineno"> 1333</span> }</div>
|
|
<div class="line"><a id="l01334" name="l01334"></a><span class="lineno"> 1334</span> </div>
|
|
<div class="line"><a id="l01335" name="l01335"></a><span class="lineno"> 1335</span> <span class="keyword">const</span> RoutingModel& <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a> = *dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a90dcdb4d66f8781421f5913150a85a06">model</a>();</div>
|
|
<div class="line"><a id="l01336" name="l01336"></a><span class="lineno"> 1336</span> <span class="keywordflow">if</span> (!solver->IsCPSATSolver()) {</div>
|
|
<div class="line"><a id="l01337" name="l01337"></a><span class="lineno"> 1337</span> <span class="comment">// The resource attributes conditional constraints can only be added with</span></div>
|
|
<div class="line"><a id="l01338" name="l01338"></a><span class="lineno"> 1338</span> <span class="comment">// the CP-SAT MIP solver.</span></div>
|
|
<div class="line"><a id="l01339" name="l01339"></a><span class="lineno"> 1339</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l01340" name="l01340"></a><span class="lineno"> 1340</span> }</div>
|
|
<div class="line"><a id="l01341" name="l01341"></a><span class="lineno"> 1341</span> </div>
|
|
<div class="line"><a id="l01342" name="l01342"></a><span class="lineno"> 1342</span> <span class="keyword">using</span> ResourceGroup = RoutingModel::ResourceGroup;</div>
|
|
<div class="line"><a id="l01343" name="l01343"></a><span class="lineno"> 1343</span> <span class="keyword">const</span> <span class="keyword">auto</span>& resource_groups = <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.GetResourceGroups();</div>
|
|
<div class="line"><a id="l01344" name="l01344"></a><span class="lineno"> 1344</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> rg_index : <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.GetDimensionResourceGroupIndices(dimension_)) {</div>
|
|
<div class="line"><a id="l01345" name="l01345"></a><span class="lineno"> 1345</span> <span class="comment">// Resource domain constraints:</span></div>
|
|
<div class="line"><a id="l01346" name="l01346"></a><span class="lineno"> 1346</span> <span class="comment">// Every (used) vehicle must be assigned to exactly one resource in this</span></div>
|
|
<div class="line"><a id="l01347" name="l01347"></a><span class="lineno"> 1347</span> <span class="comment">// group, and each resource must be assigned to at most 1 vehicle.</span></div>
|
|
<div class="line"><a id="l01348" name="l01348"></a><span class="lineno"> 1348</span> <span class="comment">// For every resource r with Attributes A = resources[r].attributes(dim)</span></div>
|
|
<div class="line"><a id="l01349" name="l01349"></a><span class="lineno"> 1349</span> <span class="comment">// and every vehicle v, assign(r, v) == 1 --></span></div>
|
|
<div class="line"><a id="l01350" name="l01350"></a><span class="lineno"> 1350</span> <span class="comment">// A.start_domain.Min() <= cumul[Start(v)] <= A.start_domain.Max(),</span></div>
|
|
<div class="line"><a id="l01351" name="l01351"></a><span class="lineno"> 1351</span> <span class="comment">// and</span></div>
|
|
<div class="line"><a id="l01352" name="l01352"></a><span class="lineno"> 1352</span> <span class="comment">// A.end_domain.Min() <= cumul[End(v)] <= A.end_domain.Max().</span></div>
|
|
<div class="line"><a id="l01353" name="l01353"></a><span class="lineno"> 1353</span> <span class="keyword">const</span> std::vector<ResourceGroup::Resource>& resources =</div>
|
|
<div class="line"><a id="l01354" name="l01354"></a><span class="lineno"> 1354</span> resource_groups[rg_index]->GetResources();</div>
|
|
<div class="line"><a id="l01355" name="l01355"></a><span class="lineno"> 1355</span> </div>
|
|
<div class="line"><a id="l01356" name="l01356"></a><span class="lineno"> 1356</span> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> kNoConstraint = -1;</div>
|
|
<div class="line"><a id="l01357" name="l01357"></a><span class="lineno"> 1357</span> <span class="comment">// Assignment constraints for vehicles: each (used) vehicle must have</span></div>
|
|
<div class="line"><a id="l01358" name="l01358"></a><span class="lineno"> 1358</span> <span class="comment">// exactly one resource assigned to it.</span></div>
|
|
<div class="line"><a id="l01359" name="l01359"></a><span class="lineno"> 1359</span> std::vector<int> vehicle_constraints(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.vehicles(), kNoConstraint);</div>
|
|
<div class="line"><a id="l01360" name="l01360"></a><span class="lineno"> 1360</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> v = 0; v < <a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.vehicles(); v++) {</div>
|
|
<div class="line"><a id="l01361" name="l01361"></a><span class="lineno"> 1361</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.IsEnd(next_accessor(<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.Start(v))) &&</div>
|
|
<div class="line"><a id="l01362" name="l01362"></a><span class="lineno"> 1362</span> !<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.AreEmptyRouteCostsConsideredForVehicle(v)) {</div>
|
|
<div class="line"><a id="l01363" name="l01363"></a><span class="lineno"> 1363</span> <span class="comment">// We don't assign a driver to unused vehicles.</span></div>
|
|
<div class="line"><a id="l01364" name="l01364"></a><span class="lineno"> 1364</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01365" name="l01365"></a><span class="lineno"> 1365</span> }</div>
|
|
<div class="line"><a id="l01366" name="l01366"></a><span class="lineno"> 1366</span> vehicle_constraints[v] = solver->CreateNewConstraint(1, 1);</div>
|
|
<div class="line"><a id="l01367" name="l01367"></a><span class="lineno"> 1367</span> }</div>
|
|
<div class="line"><a id="l01368" name="l01368"></a><span class="lineno"> 1368</span> <span class="comment">// Assignment constraints for resources: each resource must be assigned to</span></div>
|
|
<div class="line"><a id="l01369" name="l01369"></a><span class="lineno"> 1369</span> <span class="comment">// at most one (used) vehicle.</span></div>
|
|
<div class="line"><a id="l01370" name="l01370"></a><span class="lineno"> 1370</span> std::vector<int> resource_constraints(resources.size(), kNoConstraint);</div>
|
|
<div class="line"><a id="l01371" name="l01371"></a><span class="lineno"> 1371</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> r = 0; r < resources.size(); r++) {</div>
|
|
<div class="line"><a id="l01372" name="l01372"></a><span class="lineno"> 1372</span> <span class="keyword">const</span> ResourceGroup::Attributes& attributes =</div>
|
|
<div class="line"><a id="l01373" name="l01373"></a><span class="lineno"> 1373</span> resources[r].GetDimensionAttributes(dimension_);</div>
|
|
<div class="line"><a id="l01374" name="l01374"></a><span class="lineno"> 1374</span> <span class="keywordflow">if</span> (attributes.start_domain().Max() < cumul_offset ||</div>
|
|
<div class="line"><a id="l01375" name="l01375"></a><span class="lineno"> 1375</span> attributes.end_domain().Max() < cumul_offset) {</div>
|
|
<div class="line"><a id="l01376" name="l01376"></a><span class="lineno"> 1376</span> <span class="comment">// This resource's domain has a cumul max lower than the offset, so it's</span></div>
|
|
<div class="line"><a id="l01377" name="l01377"></a><span class="lineno"> 1377</span> <span class="comment">// not possible to restrict any vehicle start/end to this domain; skip</span></div>
|
|
<div class="line"><a id="l01378" name="l01378"></a><span class="lineno"> 1378</span> <span class="comment">// it.</span></div>
|
|
<div class="line"><a id="l01379" name="l01379"></a><span class="lineno"> 1379</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01380" name="l01380"></a><span class="lineno"> 1380</span> }</div>
|
|
<div class="line"><a id="l01381" name="l01381"></a><span class="lineno"> 1381</span> resource_constraints[r] = solver->CreateNewConstraint(0, 1);</div>
|
|
<div class="line"><a id="l01382" name="l01382"></a><span class="lineno"> 1382</span> }</div>
|
|
<div class="line"><a id="l01383" name="l01383"></a><span class="lineno"> 1383</span> <span class="comment">// Create assignment variables, add them to the corresponding constraints,</span></div>
|
|
<div class="line"><a id="l01384" name="l01384"></a><span class="lineno"> 1384</span> <span class="comment">// and create the reified constraints assign(r, v) == 1 --></span></div>
|
|
<div class="line"><a id="l01385" name="l01385"></a><span class="lineno"> 1385</span> <span class="comment">// A(r).start_domain.Min() <= cumul[Start(v)] <= A(r).start_domain.Max(),</span></div>
|
|
<div class="line"><a id="l01386" name="l01386"></a><span class="lineno"> 1386</span> <span class="comment">// and</span></div>
|
|
<div class="line"><a id="l01387" name="l01387"></a><span class="lineno"> 1387</span> <span class="comment">// A(r).end_domain.Min() <= cumul[End(v)] <= A(r).end_domain.Max().</span></div>
|
|
<div class="line"><a id="l01388" name="l01388"></a><span class="lineno"> 1388</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> r = 0; r < resources.size(); r++) {</div>
|
|
<div class="line"><a id="l01389" name="l01389"></a><span class="lineno"> 1389</span> <span class="keywordflow">if</span> (resource_constraints[r] == kNoConstraint) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01390" name="l01390"></a><span class="lineno"> 1390</span> <span class="keyword">const</span> ResourceGroup::Attributes& attributes =</div>
|
|
<div class="line"><a id="l01391" name="l01391"></a><span class="lineno"> 1391</span> resources[r].GetDimensionAttributes(dimension_);</div>
|
|
<div class="line"><a id="l01392" name="l01392"></a><span class="lineno"> 1392</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> v = 0; v < dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()->vehicles(); v++) {</div>
|
|
<div class="line"><a id="l01393" name="l01393"></a><span class="lineno"> 1393</span> <span class="keywordflow">if</span> (vehicle_constraints[v] == kNoConstraint) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l01394" name="l01394"></a><span class="lineno"> 1394</span> </div>
|
|
<div class="line"><a id="l01395" name="l01395"></a><span class="lineno"> 1395</span> <span class="keyword">const</span> <span class="keywordtype">int</span> assign_r_to_v = solver->AddVariable(0, 1);</div>
|
|
<div class="line"><a id="l01396" name="l01396"></a><span class="lineno"> 1396</span> solver->SetCoefficient(vehicle_constraints[v], assign_r_to_v, 1);</div>
|
|
<div class="line"><a id="l01397" name="l01397"></a><span class="lineno"> 1397</span> solver->SetCoefficient(resource_constraints[r], assign_r_to_v, 1);</div>
|
|
<div class="line"><a id="l01398" name="l01398"></a><span class="lineno"> 1398</span> </div>
|
|
<div class="line"><a id="l01399" name="l01399"></a><span class="lineno"> 1399</span> <span class="keyword">const</span> <span class="keyword">auto</span>& add_domain_constraint =</div>
|
|
<div class="line"><a id="l01400" name="l01400"></a><span class="lineno"> 1400</span> [&solver, cumul_offset, assign_r_to_v](<span class="keyword">const</span> Domain& domain,</div>
|
|
<div class="line"><a id="l01401" name="l01401"></a><span class="lineno"> 1401</span> <span class="keywordtype">int</span> cumul_variable) {</div>
|
|
<div class="line"><a id="l01402" name="l01402"></a><span class="lineno"> 1402</span> <span class="keywordflow">if</span> (domain == <a class="code hl_function" href="classoperations__research_1_1_domain.html#a03a595b90f43d02186eb660424c6ca1b">Domain::AllValues</a>()) {</div>
|
|
<div class="line"><a id="l01403" name="l01403"></a><span class="lineno"> 1403</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l01404" name="l01404"></a><span class="lineno"> 1404</span> }</div>
|
|
<div class="line"><a id="l01405" name="l01405"></a><span class="lineno"> 1405</span> <span class="keyword">const</span> int64_t cumul_min =</div>
|
|
<div class="line"><a id="l01406" name="l01406"></a><span class="lineno"> 1406</span> std::max<int64_t>(<a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(domain.Min(), cumul_offset), 0);</div>
|
|
<div class="line"><a id="l01407" name="l01407"></a><span class="lineno"> 1407</span> <span class="keyword">const</span> int64_t cumul_max =</div>
|
|
<div class="line"><a id="l01408" name="l01408"></a><span class="lineno"> 1408</span> domain.Max() == <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()</div>
|
|
<div class="line"><a id="l01409" name="l01409"></a><span class="lineno"> 1409</span> ? <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()</div>
|
|
<div class="line"><a id="l01410" name="l01410"></a><span class="lineno"> 1410</span> : <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(domain.Max(), cumul_offset);</div>
|
|
<div class="line"><a id="l01411" name="l01411"></a><span class="lineno"> 1411</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(cumul_max, 0);</div>
|
|
<div class="line"><a id="l01412" name="l01412"></a><span class="lineno"> 1412</span> <span class="keyword">const</span> <span class="keywordtype">int</span> cumul_constraint = solver->AddLinearConstraint(</div>
|
|
<div class="line"><a id="l01413" name="l01413"></a><span class="lineno"> 1413</span> cumul_min, cumul_max, {{cumul_variable, 1}});</div>
|
|
<div class="line"><a id="l01414" name="l01414"></a><span class="lineno"> 1414</span> solver->SetEnforcementLiteral(cumul_constraint, assign_r_to_v);</div>
|
|
<div class="line"><a id="l01415" name="l01415"></a><span class="lineno"> 1415</span> };</div>
|
|
<div class="line"><a id="l01416" name="l01416"></a><span class="lineno"> 1416</span> add_domain_constraint(attributes.start_domain(),</div>
|
|
<div class="line"><a id="l01417" name="l01417"></a><span class="lineno"> 1417</span> index_to_cumul_variable_[<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.Start(v)]);</div>
|
|
<div class="line"><a id="l01418" name="l01418"></a><span class="lineno"> 1418</span> add_domain_constraint(attributes.end_domain(),</div>
|
|
<div class="line"><a id="l01419" name="l01419"></a><span class="lineno"> 1419</span> index_to_cumul_variable_[<a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.End(v)]);</div>
|
|
<div class="line"><a id="l01420" name="l01420"></a><span class="lineno"> 1420</span> }</div>
|
|
<div class="line"><a id="l01421" name="l01421"></a><span class="lineno"> 1421</span> }</div>
|
|
<div class="line"><a id="l01422" name="l01422"></a><span class="lineno"> 1422</span> }</div>
|
|
<div class="line"><a id="l01423" name="l01423"></a><span class="lineno"> 1423</span>}</div>
|
|
<div class="line"><a id="l01424" name="l01424"></a><span class="lineno"> 1424</span> </div>
|
|
<div class="line"><a id="l01425" name="l01425"></a><span class="lineno"> 1425</span><span class="keywordtype">void</span> DimensionCumulOptimizerCore::SetValuesFromLP(</div>
|
|
<div class="line"><a id="l01426" name="l01426"></a><span class="lineno"> 1426</span> <span class="keyword">const</span> std::vector<int>& lp_variables, int64_t offset,</div>
|
|
<div class="line"><a id="l01427" name="l01427"></a><span class="lineno"> 1427</span> RoutingLinearSolverWrapper* solver, std::vector<int64_t>* lp_values) {</div>
|
|
<div class="line"><a id="l01428" name="l01428"></a><span class="lineno"> 1428</span> <span class="keywordflow">if</span> (lp_values == <span class="keyword">nullptr</span>) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l01429" name="l01429"></a><span class="lineno"> 1429</span> lp_values->assign(lp_variables.size(), <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>());</div>
|
|
<div class="line"><a id="l01430" name="l01430"></a><span class="lineno"> 1430</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < lp_variables.size(); i++) {</div>
|
|
<div class="line"><a id="l01431" name="l01431"></a><span class="lineno"> 1431</span> <span class="keyword">const</span> <span class="keywordtype">int</span> cumul_var = lp_variables[i];</div>
|
|
<div class="line"><a id="l01432" name="l01432"></a><span class="lineno"> 1432</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 id="l01433" name="l01433"></a><span class="lineno"> 1433</span> <span class="keyword">const</span> <span class="keywordtype">double</span> lp_value_double = solver->GetValue(cumul_var);</div>
|
|
<div class="line"><a id="l01434" name="l01434"></a><span class="lineno"> 1434</span> <span class="keyword">const</span> int64_t lp_value_int64 =</div>
|
|
<div class="line"><a id="l01435" name="l01435"></a><span class="lineno"> 1435</span> (lp_value_double >= <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>())</div>
|
|
<div class="line"><a id="l01436" name="l01436"></a><span class="lineno"> 1436</span> ? <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()</div>
|
|
<div class="line"><a id="l01437" name="l01437"></a><span class="lineno"> 1437</span> : <a class="code hl_function" href="classoperations__research_1_1_math_util.html#a55fc8a3af7c2526c83e83586cd578d89">MathUtil::FastInt64Round</a>(lp_value_double);</div>
|
|
<div class="line"><a id="l01438" name="l01438"></a><span class="lineno"> 1438</span> (*lp_values)[i] = <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(lp_value_int64, offset);</div>
|
|
<div class="line"><a id="l01439" name="l01439"></a><span class="lineno"> 1439</span> }</div>
|
|
<div class="line"><a id="l01440" name="l01440"></a><span class="lineno"> 1440</span>}</div>
|
|
<div class="line"><a id="l01441" name="l01441"></a><span class="lineno"> 1441</span> </div>
|
|
<div class="line"><a id="l01442" name="l01442"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a06f837315ff17857e7a2dcd6524784f4"> 1442</a></span><a class="code hl_function" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a06f837315ff17857e7a2dcd6524784f4">GlobalDimensionCumulOptimizer::GlobalDimensionCumulOptimizer</a>(</div>
|
|
<div class="line"><a id="l01443" name="l01443"></a><span class="lineno"> 1443</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_dimension.html">RoutingDimension</a>* dimension,</div>
|
|
<div class="line"><a id="l01444" name="l01444"></a><span class="lineno"> 1444</span> <a class="code hl_enumeration" href="namespaceoperations__research.html#a761463065b9e80673178ba0dda3634ba">RoutingSearchParameters::SchedulingSolver</a> solver_type)</div>
|
|
<div class="line"><a id="l01445" name="l01445"></a><span class="lineno"> 1445</span> : optimizer_core_(dimension,</div>
|
|
<div class="line"><a id="l01446" name="l01446"></a><span class="lineno"> 1446</span> <span class="comment">/*use_precedence_propagator=*/</span></div>
|
|
<div class="line"><a id="l01447" name="l01447"></a><span class="lineno"> 1447</span> !dimension->GetNodePrecedences().empty()) {</div>
|
|
<div class="line"><a id="l01448" name="l01448"></a><span class="lineno"> 1448</span> <span class="keywordflow">switch</span> (solver_type) {</div>
|
|
<div class="line"><a id="l01449" name="l01449"></a><span class="lineno"> 1449</span> <span class="keywordflow">case</span> <a class="code hl_variable" href="classoperations__research_1_1_routing_search_parameters.html#a4febdbfa765ae134a9a4e9b2c423006d">RoutingSearchParameters::GLOP</a>: {</div>
|
|
<div class="line"><a id="l01450" name="l01450"></a><span class="lineno"> 1450</span> solver_ = absl::make_unique<RoutingGlopWrapper>(</div>
|
|
<div class="line"><a id="l01451" name="l01451"></a><span class="lineno"> 1451</span> <span class="comment">/*is_relaxation=*/</span>!<a class="code hl_function" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a771ef9d454a03f02a8c884aacaf61765">dimension</a>-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a90dcdb4d66f8781421f5913150a85a06">model</a>()</div>
|
|
<div class="line"><a id="l01452" name="l01452"></a><span class="lineno"> 1452</span> -><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a219dfa10a2c3c26cff85c5adde3d47a3">GetDimensionResourceGroupIndices</a>(<a class="code hl_function" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a771ef9d454a03f02a8c884aacaf61765">dimension</a>)</div>
|
|
<div class="line"><a id="l01453" name="l01453"></a><span class="lineno"> 1453</span> .empty(),</div>
|
|
<div class="line"><a id="l01454" name="l01454"></a><span class="lineno"> 1454</span> GetGlopParametersForGlobalLP());</div>
|
|
<div class="line"><a id="l01455" name="l01455"></a><span class="lineno"> 1455</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l01456" name="l01456"></a><span class="lineno"> 1456</span> }</div>
|
|
<div class="line"><a id="l01457" name="l01457"></a><span class="lineno"> 1457</span> <span class="keywordflow">case</span> <a class="code hl_variable" href="classoperations__research_1_1_routing_search_parameters.html#ace91ebd1fc3ed01aef3a25db50fbdda5">RoutingSearchParameters::CP_SAT</a>: {</div>
|
|
<div class="line"><a id="l01458" name="l01458"></a><span class="lineno"> 1458</span> solver_ = absl::make_unique<RoutingCPSatWrapper>();</div>
|
|
<div class="line"><a id="l01459" name="l01459"></a><span class="lineno"> 1459</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l01460" name="l01460"></a><span class="lineno"> 1460</span> }</div>
|
|
<div class="line"><a id="l01461" name="l01461"></a><span class="lineno"> 1461</span> <span class="keywordflow">default</span>:</div>
|
|
<div class="line"><a id="l01462" name="l01462"></a><span class="lineno"> 1462</span> <a class="code hl_define" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(DFATAL) << <span class="stringliteral">"Unrecognized solver type: "</span> << solver_type;</div>
|
|
<div class="line"><a id="l01463" name="l01463"></a><span class="lineno"> 1463</span> }</div>
|
|
<div class="line"><a id="l01464" name="l01464"></a><span class="lineno"> 1464</span>}</div>
|
|
<div class="line"><a id="l01465" name="l01465"></a><span class="lineno"> 1465</span> </div>
|
|
<div class="line"><a id="l01466" name="l01466"></a><span class="lineno"> 1466</span><a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a></div>
|
|
<div class="line"><a id="l01467" name="l01467"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a3ad9e218b0cfe6e27394f39c7117c065"> 1467</a></span><a class="code hl_function" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a3ad9e218b0cfe6e27394f39c7117c065">GlobalDimensionCumulOptimizer::ComputeCumulCostWithoutFixedTransits</a>(</div>
|
|
<div class="line"><a id="l01468" name="l01468"></a><span class="lineno"> 1468</span> <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l01469" name="l01469"></a><span class="lineno"> 1469</span> int64_t* optimal_cost_without_transits) {</div>
|
|
<div class="line"><a id="l01470" name="l01470"></a><span class="lineno"> 1470</span> int64_t <a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a> = 0;</div>
|
|
<div class="line"><a id="l01471" name="l01471"></a><span class="lineno"> 1471</span> int64_t transit_cost = 0;</div>
|
|
<div class="line"><a id="l01472" name="l01472"></a><span class="lineno"> 1472</span> <a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> status = optimizer_core_.<a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#ac4a567218a28367c808aecf882d39a60">Optimize</a>(</div>
|
|
<div class="line"><a id="l01473" name="l01473"></a><span class="lineno"> 1473</span> next_accessor, solver_.get(), <span class="keyword">nullptr</span>, <span class="keyword">nullptr</span>, &<a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>, &transit_cost);</div>
|
|
<div class="line"><a id="l01474" name="l01474"></a><span class="lineno"> 1474</span> <span class="keywordflow">if</span> (status != <a class="code hl_enumvalue" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">DimensionSchedulingStatus::INFEASIBLE</a> &&</div>
|
|
<div class="line"><a id="l01475" name="l01475"></a><span class="lineno"> 1475</span> optimal_cost_without_transits != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a id="l01476" name="l01476"></a><span class="lineno"> 1476</span> *optimal_cost_without_transits = <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(<a class="code hl_variable" href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a>, transit_cost);</div>
|
|
<div class="line"><a id="l01477" name="l01477"></a><span class="lineno"> 1477</span> }</div>
|
|
<div class="line"><a id="l01478" name="l01478"></a><span class="lineno"> 1478</span> <span class="keywordflow">return</span> status;</div>
|
|
<div class="line"><a id="l01479" name="l01479"></a><span class="lineno"> 1479</span>}</div>
|
|
<div class="line"><a id="l01480" name="l01480"></a><span class="lineno"> 1480</span> </div>
|
|
<div class="line"><a id="l01481" name="l01481"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a9a1e3a84f4e90883cd7e55f28c4d84b8"> 1481</a></span><a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code hl_function" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a9a1e3a84f4e90883cd7e55f28c4d84b8">GlobalDimensionCumulOptimizer::ComputeCumuls</a>(</div>
|
|
<div class="line"><a id="l01482" name="l01482"></a><span class="lineno"> 1482</span> <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l01483" name="l01483"></a><span class="lineno"> 1483</span> std::vector<int64_t>* optimal_cumuls,</div>
|
|
<div class="line"><a id="l01484" name="l01484"></a><span class="lineno"> 1484</span> std::vector<int64_t>* optimal_breaks) {</div>
|
|
<div class="line"><a id="l01485" name="l01485"></a><span class="lineno"> 1485</span> <span class="keywordflow">return</span> optimizer_core_.<a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#ac4a567218a28367c808aecf882d39a60">Optimize</a>(next_accessor, solver_.get(), optimal_cumuls,</div>
|
|
<div class="line"><a id="l01486" name="l01486"></a><span class="lineno"> 1486</span> optimal_breaks, <span class="keyword">nullptr</span>, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l01487" name="l01487"></a><span class="lineno"> 1487</span>}</div>
|
|
<div class="line"><a id="l01488" name="l01488"></a><span class="lineno"> 1488</span> </div>
|
|
<div class="line"><a id="l01489" name="l01489"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#af9488668a487d011b5e24a0a54a4ec58"> 1489</a></span><a class="code hl_enumeration" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">DimensionSchedulingStatus</a> <a class="code hl_function" href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#af9488668a487d011b5e24a0a54a4ec58">GlobalDimensionCumulOptimizer::ComputePackedCumuls</a>(</div>
|
|
<div class="line"><a id="l01490" name="l01490"></a><span class="lineno"> 1490</span> <span class="keyword">const</span> std::function<int64_t(int64_t)>& next_accessor,</div>
|
|
<div class="line"><a id="l01491" name="l01491"></a><span class="lineno"> 1491</span> std::vector<int64_t>* packed_cumuls, std::vector<int64_t>* packed_breaks) {</div>
|
|
<div class="line"><a id="l01492" name="l01492"></a><span class="lineno"> 1492</span> <span class="keywordflow">return</span> optimizer_core_.<a class="code hl_function" href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#aa30424ff76b8cc3d20f238657df1f798">OptimizeAndPack</a>(next_accessor, solver_.get(),</div>
|
|
<div class="line"><a id="l01493" name="l01493"></a><span class="lineno"> 1493</span> packed_cumuls, packed_breaks);</div>
|
|
<div class="line"><a id="l01494" name="l01494"></a><span class="lineno"> 1494</span>}</div>
|
|
<div class="line"><a id="l01495" name="l01495"></a><span class="lineno"> 1495</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_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#l00887">base/logging.h:887</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#l00890">base/logging.h:890</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ab4f56aa24c4c9cddc47a6abd2d747f9a"><div class="ttname"><a href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a></div><div class="ttdeci">#define DCHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00891">base/logging.h:891</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#l00889">base/logging.h:889</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#l00416">base/logging.h:416</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#l00885">base/logging.h:885</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#l00886">base/logging.h:886</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cumul_bounds_propagator_html_a03e0559549552ae0d25421ab310f73e1"><div class="ttname"><a href="classoperations__research_1_1_cumul_bounds_propagator.html#a03e0559549552ae0d25421ab310f73e1">operations_research::CumulBoundsPropagator::dimension</a></div><div class="ttdeci">const RoutingDimension & dimension() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00078">routing_lp_scheduling.h:78</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_cumul_bounds_propagator_html_aa83a7ff5ef57860290d9838959d6ecf1"><div class="ttname"><a href="classoperations__research_1_1_cumul_bounds_propagator.html#aa83a7ff5ef57860290d9838959d6ecf1">operations_research::CumulBoundsPropagator::PropagateCumulBounds</a></div><div class="ttdeci">bool PropagateCumulBounds(const std::function< int64_t(int64_t)> &next_accessor, int64_t cumul_offset)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00400">routing_lp_scheduling.cc:400</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#l00237">routing_lp_scheduling.cc:237</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#l00455">routing_lp_scheduling.cc:455</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_a771ef9d454a03f02a8c884aacaf61765"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a771ef9d454a03f02a8c884aacaf61765">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#l00621">routing_lp_scheduling.h:621</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_a876775ab31e400b8fd3d7a09db722135"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#a876775ab31e400b8fd3d7a09db722135">operations_research::DimensionCumulOptimizerCore::OptimizeAndPackSingleRoute</a></div><div class="ttdeci">DimensionSchedulingStatus OptimizeAndPackSingleRoute(int vehicle, const std::function< int64_t(int64_t)> &next_accessor, RoutingLinearSolverWrapper *solver, std::vector< int64_t > *cumul_values, std::vector< int64_t > *break_values)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00631">routing_lp_scheduling.cc:631</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_aa30424ff76b8cc3d20f238657df1f798"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#aa30424ff76b8cc3d20f238657df1f798">operations_research::DimensionCumulOptimizerCore::OptimizeAndPack</a></div><div class="ttdeci">DimensionSchedulingStatus OptimizeAndPack(const std::function< int64_t(int64_t)> &next_accessor, RoutingLinearSolverWrapper *solver, std::vector< int64_t > *cumul_values, std::vector< int64_t > *break_values)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00599">routing_lp_scheduling.cc:599</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_ac4a567218a28367c808aecf882d39a60"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#ac4a567218a28367c808aecf882d39a60">operations_research::DimensionCumulOptimizerCore::Optimize</a></div><div class="ttdeci">DimensionSchedulingStatus Optimize(const std::function< int64_t(int64_t)> &next_accessor, RoutingLinearSolverWrapper *solver, std::vector< int64_t > *cumul_values, std::vector< int64_t > *break_values, int64_t *cost, int64_t *transit_cost, bool clear_lp=true)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00522">routing_lp_scheduling.cc:522</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_dimension_cumul_optimizer_core_html_ad8f55e0b1048c51c733207c60a2f87b0"><div class="ttname"><a href="classoperations__research_1_1_dimension_cumul_optimizer_core.html#ad8f55e0b1048c51c733207c60a2f87b0">operations_research::DimensionCumulOptimizerCore::OptimizeSingleRoute</a></div><div class="ttdeci">DimensionSchedulingStatus OptimizeSingleRoute(int vehicle, const std::function< int64_t(int64_t)> &next_accessor, RoutingLinearSolverWrapper *solver, std::vector< int64_t > *cumul_values, std::vector< int64_t > *break_values, int64_t *cost, int64_t *transit_cost, bool clear_lp=true)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00479">routing_lp_scheduling.cc:479</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_domain_html_a03a595b90f43d02186eb660424c6ca1b"><div class="ttname"><a href="classoperations__research_1_1_domain.html#a03a595b90f43d02186eb660424c6ca1b">operations_research::Domain::AllValues</a></div><div class="ttdeci">static Domain AllValues()</div><div class="ttdoc">Returns the full domain Int64.</div><div class="ttdef"><b>Definition:</b> <a href="sorted__interval__list_8cc_source.html#l00136">sorted_interval_list.cc:136</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a06f837315ff17857e7a2dcd6524784f4"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a06f837315ff17857e7a2dcd6524784f4">operations_research::GlobalDimensionCumulOptimizer::GlobalDimensionCumulOptimizer</a></div><div class="ttdeci">GlobalDimensionCumulOptimizer(const RoutingDimension *dimension, RoutingSearchParameters::SchedulingSolver solver_type)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l01442">routing_lp_scheduling.cc:1442</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a3ad9e218b0cfe6e27394f39c7117c065"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a3ad9e218b0cfe6e27394f39c7117c065">operations_research::GlobalDimensionCumulOptimizer::ComputeCumulCostWithoutFixedTransits</a></div><div class="ttdeci">DimensionSchedulingStatus ComputeCumulCostWithoutFixedTransits(const std::function< int64_t(int64_t)> &next_accessor, int64_t *optimal_cost_without_transits)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l01467">routing_lp_scheduling.cc:1467</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a771ef9d454a03f02a8c884aacaf61765"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a771ef9d454a03f02a8c884aacaf61765">operations_research::GlobalDimensionCumulOptimizer::dimension</a></div><div class="ttdeci">const RoutingDimension * dimension() const</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00780">routing_lp_scheduling.h:780</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_a9a1e3a84f4e90883cd7e55f28c4d84b8"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#a9a1e3a84f4e90883cd7e55f28c4d84b8">operations_research::GlobalDimensionCumulOptimizer::ComputeCumuls</a></div><div class="ttdeci">DimensionSchedulingStatus ComputeCumuls(const std::function< int64_t(int64_t)> &next_accessor, std::vector< int64_t > *optimal_cumuls, std::vector< int64_t > *optimal_breaks)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l01481">routing_lp_scheduling.cc:1481</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_dimension_cumul_optimizer_html_af9488668a487d011b5e24a0a54a4ec58"><div class="ttname"><a href="classoperations__research_1_1_global_dimension_cumul_optimizer.html#af9488668a487d011b5e24a0a54a4ec58">operations_research::GlobalDimensionCumulOptimizer::ComputePackedCumuls</a></div><div class="ttdeci">DimensionSchedulingStatus ComputePackedCumuls(const std::function< int64_t(int64_t)> &next_accessor, std::vector< int64_t > *packed_cumuls, std::vector< int64_t > *packed_breaks)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l01489">routing_lp_scheduling.cc:1489</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_expr_html_a62b340f6d1dde6a36560bd88a382ada7"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#a62b340f6d1dde6a36560bd88a382ada7">operations_research::IntExpr::Min</a></div><div class="ttdeci">virtual int64_t Min() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_expr_html_ac84c250d67f30c89e845cd460eeaaad8"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#ac84c250d67f30c89e845cd460eeaaad8">operations_research::IntExpr::Max</a></div><div class="ttdeci">virtual int64_t Max() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a10cab4b73bfe12bef44924a47c5345b6"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a10cab4b73bfe12bef44924a47c5345b6">operations_research::LocalDimensionCumulOptimizer::ComputeRouteCumulCost</a></div><div class="ttdeci">DimensionSchedulingStatus ComputeRouteCumulCost(int vehicle, const std::function< int64_t(int64_t)> &next_accessor, int64_t *optimal_cost)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00192">routing_lp_scheduling.cc:192</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a161ed371fd2e35ef76b4539540bfcfd6"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a161ed371fd2e35ef76b4539540bfcfd6">operations_research::LocalDimensionCumulOptimizer::ComputeRouteCumuls</a></div><div class="ttdeci">DimensionSchedulingStatus ComputeRouteCumuls(int vehicle, const std::function< int64_t(int64_t)> &next_accessor, std::vector< int64_t > *optimal_cumuls, std::vector< int64_t > *optimal_breaks)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00216">routing_lp_scheduling.cc:216</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a296e8d7e154740a84c59774f20a295ba"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a296e8d7e154740a84c59774f20a295ba">operations_research::LocalDimensionCumulOptimizer::ComputeRouteCumulCostWithoutFixedTransits</a></div><div class="ttdeci">DimensionSchedulingStatus ComputeRouteCumulCostWithoutFixedTransits(int vehicle, const std::function< int64_t(int64_t)> &next_accessor, int64_t *optimal_cost_without_transits)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00201">routing_lp_scheduling.cc:201</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#l00162">routing_lp_scheduling.cc:162</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_a771ef9d454a03f02a8c884aacaf61765"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#a771ef9d454a03f02a8c884aacaf61765">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#l00741">routing_lp_scheduling.h:741</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_local_dimension_cumul_optimizer_html_ac8d866b9daf1876e81859fc2077b0fe2"><div class="ttname"><a href="classoperations__research_1_1_local_dimension_cumul_optimizer.html#ac8d866b9daf1876e81859fc2077b0fe2">operations_research::LocalDimensionCumulOptimizer::ComputePackedRouteCumuls</a></div><div class="ttdeci">DimensionSchedulingStatus ComputePackedRouteCumuls(int vehicle, const std::function< int64_t(int64_t)> &next_accessor, std::vector< int64_t > *packed_cumuls, std::vector< int64_t > *packed_breaks)</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8cc_source.html#l00226">routing_lp_scheduling.cc:226</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_math_util_html_a55fc8a3af7c2526c83e83586cd578d89"><div class="ttname"><a href="classoperations__research_1_1_math_util.html#a55fc8a3af7c2526c83e83586cd578d89">operations_research::MathUtil::FastInt64Round</a></div><div class="ttdeci">static int64_t 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#l02494">routing.h:2494</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#l02858">routing.h:2858</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a24dcbf29c0d6cd766009a182a6484e3b"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a24dcbf29c0d6cd766009a182a6484e3b">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#l02758">routing.h:2758</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a2658bab0f635e3b399b100ecd6bc12cb"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a2658bab0f635e3b399b100ecd6bc12cb">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#l02523">routing.h:2523</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a32c310c90b2870f76dfe58ef41127d83"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a32c310c90b2870f76dfe58ef41127d83">operations_research::RoutingDimension::GetCumulVarSoftUpperBoundCoefficient</a></div><div class="ttdeci">int64_t GetCumulVarSoftUpperBoundCoefficient(int64_t 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#l06292">routing.cc:6292</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a38a1205e1e6fec4a632d523a64856c4b"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a38a1205e1e6fec4a632d523a64856c4b">operations_research::RoutingDimension::GetGlobalOptimizerOffset</a></div><div class="ttdeci">int64_t GetGlobalOptimizerOffset() const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02833">routing.h:2833</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a3efd441f3accdd91d91ffbd1d4e1b255"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a3efd441f3accdd91d91ffbd1d4e1b255">operations_research::RoutingDimension::GetPickupToDeliveryLimitForPair</a></div><div class="ttdeci">int64_t GetPickupToDeliveryLimitForPair(int pair_index, int pickup, int delivery) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l06553">routing.cc:6553</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a3ffb5532e1a2da908b35ce947f30a0a3"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a3ffb5532e1a2da908b35ce947f30a0a3">operations_research::RoutingDimension::HasCumulVarSoftLowerBound</a></div><div class="ttdeci">bool HasCumulVarSoftLowerBound(int64_t 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#l06331">routing.cc:6331</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a4232c22ddc9e65e726ee87cf27778072"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a4232c22ddc9e65e726ee87cf27778072">operations_research::RoutingDimension::SlackVar</a></div><div class="ttdeci">IntVar * SlackVar(int64_t index) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02518">routing.h:2518</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a506e1394eff1694085e3cfeb4a1997f1"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a506e1394eff1694085e3cfeb4a1997f1">operations_research::RoutingDimension::GetSpanCostCoefficientForVehicle</a></div><div class="ttdeci">int64_t GetSpanCostCoefficientForVehicle(int vehicle) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02813">routing.h:2813</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a539915a226ec8626161d0310b22e8881"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a539915a226ec8626161d0310b22e8881">operations_research::RoutingDimension::global_span_cost_coefficient</a></div><div class="ttdeci">int64_t global_span_cost_coefficient() const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02829">routing.h:2829</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a5c170c586b06b6435f4e85cfc9db27e5"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a5c170c586b06b6435f4e85cfc9db27e5">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#l02577">routing.h:2577</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a5ffb5c0e60db5d3939873fe92462bae9"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a5ffb5c0e60db5d3939873fe92462bae9">operations_research::RoutingDimension::GetSpanUpperBoundForVehicle</a></div><div class="ttdeci">int64_t GetSpanUpperBoundForVehicle(int vehicle) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02805">routing.h:2805</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#l06494">routing.cc:6494</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a70dcc75273b8ffe7bf1df455e227d939"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a70dcc75273b8ffe7bf1df455e227d939">operations_research::RoutingDimension::GetAllowedIntervalsInRange</a></div><div class="ttdeci">SortedDisjointIntervalList GetAllowedIntervalsInRange(int64_t index, int64_t min_value, int64_t 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#l06153">routing.cc:6153</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#l06505">routing.cc:6505</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a8eafd6802aace5a8b509d920de5e37c5"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a8eafd6802aace5a8b509d920de5e37c5">operations_research::RoutingDimension::HasCumulVarSoftUpperBound</a></div><div class="ttdeci">bool HasCumulVarSoftUpperBound(int64_t 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#l06279">routing.cc:6279</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a90dcdb4d66f8781421f5913150a85a06"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a90dcdb4d66f8781421f5913150a85a06">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#l02498">routing.h:2498</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#l06498">routing.cc:6498</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a96a6b6ac14b3f18c40e2e00b9e186842"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a96a6b6ac14b3f18c40e2e00b9e186842">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#l02795">routing.h:2795</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a9958465c1ff256b5cbcdc684ada03e60"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a9958465c1ff256b5cbcdc684ada03e60">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#l02529">routing.h:2529</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_ac49d19c473861fd725540574c9779f7f"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#ac49d19c473861fd725540574c9779f7f">operations_research::RoutingDimension::GetLocalOptimizerOffsetForVehicle</a></div><div class="ttdeci">int64_t GetLocalOptimizerOffsetForVehicle(int vehicle) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02837">routing.h:2837</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_ae80c65007e8e9be55995bb2aa4493898"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#ae80c65007e8e9be55995bb2aa4493898">operations_research::RoutingDimension::GetCumulVarSoftUpperBound</a></div><div class="ttdeci">int64_t GetCumulVarSoftUpperBound(int64_t 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#l06284">routing.cc:6284</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_aeb48e0a259af538f591d9f843c113d00"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#aeb48e0a259af538f591d9f843c113d00">operations_research::RoutingDimension::GetBreakDistanceDurationOfVehicle</a></div><div class="ttdeci">const std::vector< std::pair< int64_t, int64_t > > & 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#l06533">routing.cc:6533</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#l02855">routing.h:2855</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_af63828b2874b76ba4af52bfbbed5f156"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#af63828b2874b76ba4af52bfbbed5f156">operations_research::RoutingDimension::GetCumulVarSoftLowerBoundCoefficient</a></div><div class="ttdeci">int64_t GetCumulVarSoftLowerBoundCoefficient(int64_t 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#l06344">routing.cc:6344</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#l06511">routing.cc:6511</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_afe26c6f9f4c70620ce91fbff37f4834d"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#afe26c6f9f4c70620ce91fbff37f4834d">operations_research::RoutingDimension::GetCumulVarSoftLowerBound</a></div><div class="ttdeci">int64_t GetCumulVarSoftLowerBound(int64_t 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#l06336">routing.cc:6336</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html">operations_research::RoutingLinearSolverWrapper</a></div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00159">routing_lp_scheduling.h:159</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_aa5b31c976cc6734003d9950e731dfed3"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa5b31c976cc6734003d9950e731dfed3">operations_research::RoutingLinearSolverWrapper::Clear</a></div><div class="ttdeci">virtual void Clear()=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_aa7ad30a5bcbd156380533cc7abb69172"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#aa7ad30a5bcbd156380533cc7abb69172">operations_research::RoutingLinearSolverWrapper::GetObjectiveValue</a></div><div class="ttdeci">virtual int64_t GetObjectiveValue() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_ab570a51d5ff506f435fa428d3f145f0a"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ab570a51d5ff506f435fa428d3f145f0a">operations_research::RoutingLinearSolverWrapper::AddObjectiveConstraint</a></div><div class="ttdeci">virtual void AddObjectiveConstraint()=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_ad1a3a80256c0caa8f7ebdacb42294c81"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad1a3a80256c0caa8f7ebdacb42294c81">operations_research::RoutingLinearSolverWrapper::SetVariableBounds</a></div><div class="ttdeci">virtual bool SetVariableBounds(int index, int64_t lower_bound, int64_t upper_bound)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_ad56b5d5264e07b44be873dfdcd29cb8e"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#ad56b5d5264e07b44be873dfdcd29cb8e">operations_research::RoutingLinearSolverWrapper::SetObjectiveCoefficient</a></div><div class="ttdeci">virtual void SetObjectiveCoefficient(int index, double coefficient)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_af1eb90688746692ec522c88d501bd598"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#af1eb90688746692ec522c88d501bd598">operations_research::RoutingLinearSolverWrapper::SolutionIsInteger</a></div><div class="ttdeci">virtual bool SolutionIsInteger() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_linear_solver_wrapper_html_afaf5c7b0c88dbe8a11b8d9d66a7c2871"><div class="ttname"><a href="classoperations__research_1_1_routing_linear_solver_wrapper.html#afaf5c7b0c88dbe8a11b8d9d66a7c2871">operations_research::RoutingLinearSolverWrapper::GetVariableLowerBound</a></div><div class="ttdeci">virtual int64_t GetVariableLowerBound(int index) const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_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#l00209">routing.h:209</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a219dfa10a2c3c26cff85c5adde3d47a3"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a219dfa10a2c3c26cff85c5adde3d47a3">operations_research::RoutingModel::GetDimensionResourceGroupIndices</a></div><div class="ttdeci">const std::vector< int > & GetDimensionResourceGroupIndices(const RoutingDimension *dimension) const</div><div class="ttdoc">Returns the indices of resource groups for this dimension.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l01328">routing.cc:1328</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a251dfaa30251901d13cd2f33a92571ac"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a251dfaa30251901d13cd2f33a92571ac">operations_research::RoutingModel::GetPickupAndDeliveryPairs</a></div><div class="ttdeci">const IndexPairs & GetPickupAndDeliveryPairs() const</div><div class="ttdoc">Returns pickup and delivery pairs currently in the model.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00834">routing.h:834</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#l01458">routing.h:1458</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_search_parameters_html_a4febdbfa765ae134a9a4e9b2c423006d"><div class="ttname"><a href="classoperations__research_1_1_routing_search_parameters.html#a4febdbfa765ae134a9a4e9b2c423006d">operations_research::RoutingSearchParameters::GLOP</a></div><div class="ttdeci">static constexpr SchedulingSolver GLOP</div><div class="ttdef"><b>Definition:</b> <a href="routing__parameters_8pb_8h_source.html#l00883">routing_parameters.pb.h:883</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_search_parameters_html_ace91ebd1fc3ed01aef3a25db50fbdda5"><div class="ttname"><a href="classoperations__research_1_1_routing_search_parameters.html#ace91ebd1fc3ed01aef3a25db50fbdda5">operations_research::RoutingSearchParameters::CP_SAT</a></div><div class="ttdeci">static constexpr SchedulingSolver CP_SAT</div><div class="ttdef"><b>Definition:</b> <a href="routing__parameters_8pb_8h_source.html#l00885">routing_parameters.pb.h:885</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1glop_1_1_glop_parameters_html"><div class="ttname"><a href="classoperations__research_1_1glop_1_1_glop_parameters.html">operations_research::glop::GlopParameters</a></div><div class="ttdef"><b>Definition:</b> <a href="parameters_8pb_8h_source.html#l00194">parameters.pb.h:195</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a9293e4d29cac928301645070dd307683"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a></div><div class="ttdeci">int64_t b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00047">constraint_solver/table.cc:47</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#l00677">constraint_solver.cc:677</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_8h_html"><div class="ttname"><a href="constraint__solver_8h.html">constraint_solver.h</a></div></div>
|
|
<div class="ttc" id="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#l00116">cp_model_fz_solver.cc:116</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#l00043">demon_profiler.cc:43</a></div></div>
|
|
<div class="ttc" id="aexpr__array_8cc_html_abda708e4a6f0de72a842382f919a7c31"><div class="ttname"><a href="expr__array_8cc.html#abda708e4a6f0de72a842382f919a7c31">coef</a></div><div class="ttdeci">int64_t coef</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01875">expr_array.cc:1875</a></div></div>
|
|
<div class="ttc" id="agscip__solver_8cc_html_a1ba5ca0f61f2fa13bd23bf0f89004f35"><div class="ttname"><a href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a></div><div class="ttdeci">double upper_bound</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00126">gscip_solver.cc:126</a></div></div>
|
|
<div class="ttc" id="agscip__solver_8cc_html_a1e2f9a2352c1d9a6cada9544898fceec"><div class="ttname"><a href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a></div><div class="ttdeci">double lower_bound</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00125">gscip_solver.cc:125</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#l00273">gurobi_interface.cc:273</a></div></div>
|
|
<div class="ttc" id="amathutil_8h_html"><div class="ttname"><a href="mathutil_8h.html">mathutil.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">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a111f44b9b9cf67a8e8d83794ac9f5291"><div class="ttname"><a href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">operations_research::CapAdd</a></div><div class="ttdeci">int64_t CapAdd(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00126">saturated_arithmetic.h:126</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a4a43d435871f16c321861fa5de32df82"><div class="ttname"><a href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">operations_research::CapSub</a></div><div class="ttdeci">int64_t CapSub(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00156">saturated_arithmetic.h:156</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a761463065b9e80673178ba0dda3634ba"><div class="ttname"><a href="namespaceoperations__research.html#a761463065b9e80673178ba0dda3634ba">operations_research::RoutingSearchParameters_SchedulingSolver</a></div><div class="ttdeci">RoutingSearchParameters_SchedulingSolver</div><div class="ttdef"><b>Definition:</b> <a href="routing__parameters_8pb_8h_source.html#l00084">routing_parameters.pb.h:84</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aa0787bf78fb09d1e30f2451b5a68d4b8"><div class="ttname"><a href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8">operations_research::DimensionSchedulingStatus</a></div><div class="ttdeci">DimensionSchedulingStatus</div><div class="ttdef"><b>Definition:</b> <a href="routing__lp__scheduling_8h_source.html#l00149">routing_lp_scheduling.h:149</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93"><div class="ttname"><a href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8a6faaca695f728b47f47dd389f31e4a93">operations_research::DimensionSchedulingStatus::INFEASIBLE</a></div><div class="ttdeci">@ INFEASIBLE</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aa64bf49d041052c7cb3f40f7496d7534"><div class="ttname"><a href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">operations_research::CapProd</a></div><div class="ttdeci">int64_t CapProd(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00233">saturated_arithmetic.h:233</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aae315ffb47820060e3fa070260434118"><div class="ttname"><a href="namespaceoperations__research.html#aae315ffb47820060e3fa070260434118">operations_research::FillPathEvaluation</a></div><div class="ttdeci">void FillPathEvaluation(const std::vector< int64_t > &path, const RoutingModel::TransitCallback2 &evaluator, std::vector< int64_t > *values)</div><div class="ttdef"><b>Definition:</b> <a href="routing_8cc_source.html#l05810">routing.cc:5810</a></div></div>
|
|
<div class="ttc" id="aparameters_8pb_8h_html"><div class="ttname"><a href="parameters_8pb_8h.html">parameters.pb.h</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#l00100">resource.cc:100</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__filters_8cc_html_a4f1e8002734902ae1c65ccc3fc30c98e"><div class="ttname"><a href="routing__filters_8cc.html#a4f1e8002734902ae1c65ccc3fc30c98e">bound</a></div><div class="ttdeci">int64_t bound</div><div class="ttdef"><b>Definition:</b> <a href="routing__filters_8cc_source.html#l00984">routing_filters.cc:984</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_a64e7efc5529154ba56903e75f5300990"><div class="ttname"><a href="routing__flow_8cc.html#a64e7efc5529154ba56903e75f5300990">tail</a></div><div class="ttdeci">int64_t tail</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00149">routing_flow.cc:149</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_a75d7b5e4cab1e156cc7a2c5eba1e16f1"><div class="ttname"><a href="routing__flow_8cc.html#a75d7b5e4cab1e156cc7a2c5eba1e16f1">cost</a></div><div class="ttdeci">int64_t cost</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00152">routing_flow.cc:152</a></div></div>
|
|
<div class="ttc" id="arouting__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__parameters_8pb_8h_html"><div class="ttname"><a href="routing__parameters_8pb_8h.html">routing_parameters.pb.h</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 class="ttc" id="asorted__interval__list_8h_html"><div class="ttname"><a href="sorted__interval__list_8h.html">sorted_interval_list.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.2 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|