1305 lines
297 KiB
HTML
1305 lines
297 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.3"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: routing_breaks.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.3</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.3 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('routing__breaks_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_breaks.cc</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="routing__breaks_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 <algorithm></span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include <iterator></span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <limits></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <map></span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <numeric></span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include <utility></span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span> </div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</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="l00026" name="l00026"></a><span class="lineno"> 26</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="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include "<a class="code" href="constraint__solveri_8h.html">ortools/constraint_solver/constraint_solveri.h</a>"</span></div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</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="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include "<a class="code" href="routing__filters_8h.html">ortools/constraint_solver/routing_filters.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="theta__tree_8h.html">ortools/sat/theta_tree.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="saturated__arithmetic_8h.html">ortools/util/saturated_arithmetic.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="sorted__interval__list_8h.html">ortools/util/sorted_interval_list.h</a>"</span></div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> </div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</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"><a class="line" href="classoperations__research_1_1_disjunctive_propagator.html#a8a31c563d28e1ebe7c9e140f15fea586"> 36</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#a8a31c563d28e1ebe7c9e140f15fea586">DisjunctivePropagator::Propagate</a>(<a class="code hl_struct" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">Tasks</a>* tasks) {</div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> <a class="code hl_define" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a>, tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>.size());</div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>.size(), tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>.size());</div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>.size(), tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>.size());</div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>.size(), tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#abd7699021e5652feb514e0d68c973df2">duration_max</a>.size());</div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>.size(), tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>.size());</div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>.size(), tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>.size());</div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>.size(), tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>.size());</div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// Do forward deductions, then backward deductions.</span></div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="comment">// All propagators are followed by Precedences(),</span></div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// except MirrorTasks() after which Precedences() would make no deductions,</span></div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <span class="comment">// and DetectablePrecedencesWithChain() which is stronger than Precedences().</span></div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// Precedences() is a propagator that does obvious deductions quickly (O(n)),</span></div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// so interleaving Precedences() speeds up the propagation fixed point.</span></div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#a0d1ed47f6804807e925b489b24fb8d04">Precedences</a>(tasks) || !<a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#a08f43a826695abdbdad1c608cb90b25a">EdgeFinding</a>(tasks) || !<a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#a0d1ed47f6804807e925b489b24fb8d04">Precedences</a>(tasks) ||</div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> !<a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#aa9b624e65cb55b3d74ad35a3a675f9ea">DetectablePrecedencesWithChain</a>(tasks)) {</div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</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> <span class="keywordflow">if</span> (!tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a425fd06d315549fdc6e6c482e3cdf774">forbidden_intervals</a>.empty()) {</div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#a7b0f3a8550bd73014e2b61899524a2ad">ForbiddenIntervals</a>(tasks) || !<a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#a0d1ed47f6804807e925b489b24fb8d04">Precedences</a>(tasks)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> }</div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="keywordflow">if</span> (!tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a10679034cef02c42959f43b6d3db9aba">distance_duration</a>.empty()) {</div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#a13e93a8cd8587377e1b8f88096e0efd0">DistanceDuration</a>(tasks) || !<a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#a0d1ed47f6804807e925b489b24fb8d04">Precedences</a>(tasks)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> }</div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#a29620476a22fde70929c77dc6342be0e">MirrorTasks</a>(tasks) || !<a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#a08f43a826695abdbdad1c608cb90b25a">EdgeFinding</a>(tasks) || !<a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#a0d1ed47f6804807e925b489b24fb8d04">Precedences</a>(tasks) ||</div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> !<a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#aa9b624e65cb55b3d74ad35a3a675f9ea">DetectablePrecedencesWithChain</a>(tasks) || !<a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#a29620476a22fde70929c77dc6342be0e">MirrorTasks</a>(tasks)) {</div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> }</div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordflow">return</span> <span class="keyword">true</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"><a class="line" href="classoperations__research_1_1_disjunctive_propagator.html#a0d1ed47f6804807e925b489b24fb8d04"> 67</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#a0d1ed47f6804807e925b489b24fb8d04">DisjunctivePropagator::Precedences</a>(<a class="code hl_struct" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">Tasks</a>* tasks) {</div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_chain_tasks = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a>;</div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keywordflow">if</span> (num_chain_tasks > 0) {</div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="comment">// Propagate forwards.</span></div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> int64_t <a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[0];</div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> task = 0; task < num_chain_tasks; ++task) {</div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[task], <a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>);</div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[task] = <a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>;</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> = <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>, tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[task]);</div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="keywordflow">if</span> (tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[task] < <a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(<a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>, tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>[task]);</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>[task] = <a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>;</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> }</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="comment">// Propagate backwards.</span></div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[num_chain_tasks - 1];</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> task = num_chain_tasks - 1; task >= 0; --task) {</div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[task], <a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>);</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[task] = <a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>;</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> = <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(<a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>, tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[task]);</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="keywordflow">if</span> (time < tasks-><a class="code hl_variable" href="sched__constraints_8cc.html#a826c744af066625acb241b17ae3e2be9">start_min</a>[task]) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(<a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>, tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[task]);</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[task] = <a class="code hl_variable" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>;</div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> }</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> <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>.size();</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> task = 0; task < num_tasks; ++task) {</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="comment">// Enforce start + duration <= end.</span></div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>[task] =</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>[task],</div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[task], tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[task]));</div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[task] =</div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[task],</div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[task], tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[task]));</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#abd7699021e5652feb514e0d68c973df2">duration_max</a>[task] =</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#abd7699021e5652feb514e0d68c973df2">duration_max</a>[task],</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[task], tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[task]));</div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="keywordflow">if</span> (!tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>[task]) {</div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="comment">// Enforce start + duration == end for nonpreemptibles.</span></div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[task] =</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[task],</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[task], tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#abd7699021e5652feb514e0d68c973df2">duration_max</a>[task]));</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[task] =</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[task],</div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>[task], tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#abd7699021e5652feb514e0d68c973df2">duration_max</a>[task]));</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[task] =</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[task],</div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>[task], tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[task]));</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> }</div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="keywordflow">if</span> (tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[task] > tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#abd7699021e5652feb514e0d68c973df2">duration_max</a>[task]) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> <span class="keywordflow">if</span> (tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>[task] > tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[task]) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="keywordflow">if</span> (tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[task] > tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[task]) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> }</div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span>}</div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> </div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_disjunctive_propagator.html#a29620476a22fde70929c77dc6342be0e"> 122</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#a29620476a22fde70929c77dc6342be0e">DisjunctivePropagator::MirrorTasks</a>(<a class="code hl_struct" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">Tasks</a>* tasks) {</div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>.size();</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="comment">// For all tasks, start_min := -end_max and end_max := -start_min.</span></div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> task = 0; task < num_tasks; ++task) {</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="keyword">const</span> int64_t t = -tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[task];</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[task] = -tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[task];</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[task] = t;</div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> }</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <span class="comment">// For all tasks, start_max := -end_min and end_min := -start_max.</span></div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> task = 0; task < num_tasks; ++task) {</div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <span class="keyword">const</span> int64_t t = -tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[task];</div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[task] = -tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>[task];</div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>[task] = t;</div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> }</div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="comment">// In the mirror problem, tasks linked by precedences are in reversed order.</span></div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_chain_tasks = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a>;</div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> it :</div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> {tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>.begin(), tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>.begin(),</div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>.begin(), tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#abd7699021e5652feb514e0d68c973df2">duration_max</a>.begin(),</div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>.begin(), tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>.begin()}) {</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> std::reverse(it, it + num_chain_tasks);</div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> std::reverse(it + num_chain_tasks, it + num_tasks);</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> }</div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> std::reverse(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>.begin(),</div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>.begin() + num_chain_tasks);</div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> std::reverse(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>.begin() + num_chain_tasks,</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>.begin() + num_tasks);</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span>}</div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> </div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_disjunctive_propagator.html#a08f43a826695abdbdad1c608cb90b25a"> 152</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#a08f43a826695abdbdad1c608cb90b25a">DisjunctivePropagator::EdgeFinding</a>(<a class="code hl_struct" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">Tasks</a>* tasks) {</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>.size();</div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="comment">// Prepare start_min events for tree.</span></div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> tasks_by_start_min_.resize(num_tasks);</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> std::iota(tasks_by_start_min_.begin(), tasks_by_start_min_.end(), 0);</div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> std::sort(</div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> tasks_by_start_min_.begin(), tasks_by_start_min_.end(),</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> [&](<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j) { return tasks->start_min[i] < tasks->start_min[j]; });</div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> event_of_task_.resize(num_tasks);</div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> event = 0; <span class="keyword">event</span> < num_tasks; ++event) {</div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> event_of_task_[tasks_by_start_min_[event]] = event;</div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> }</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <span class="comment">// Tasks will be browsed according to end_max order.</span></div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> tasks_by_end_max_.resize(num_tasks);</div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> std::iota(tasks_by_end_max_.begin(), tasks_by_end_max_.end(), 0);</div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> std::sort(</div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> tasks_by_end_max_.begin(), tasks_by_end_max_.end(),</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> [&](<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j) { return tasks->end_max[i] < tasks->end_max[j]; });</div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> </div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="comment">// Generic overload checking: insert tasks by end_max,</span></div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="comment">// fail if envelope > end_max.</span></div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> theta_lambda_tree_.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a7b4553842be2a65d82b3f40eed71744d">Reset</a>(num_tasks);</div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> task : tasks_by_end_max_) {</div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> theta_lambda_tree_.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ad812cddd43d03a817341c9875f4f6f4f">AddOrUpdateEvent</a>(</div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> event_of_task_[task], tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[task], tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[task],</div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[task]);</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <span class="keywordflow">if</span> (theta_lambda_tree_.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#add1a42315d03f68191df32a019d82093">GetEnvelope</a>() > tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[task]) {</div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="keywordflow">return</span> <span class="keyword">false</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> }</div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> </div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <span class="comment">// Generic edge finding: from full set of tasks, at each end_max event in</span></div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> <span class="comment">// decreasing order, check lambda feasibility, then move end_max task from</span></div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <span class="comment">// theta to lambda.</span></div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = num_tasks - 1; i >= 0; --i) {</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="keyword">const</span> <span class="keywordtype">int</span> task = tasks_by_end_max_[i];</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <span class="keyword">const</span> int64_t envelope = theta_lambda_tree_.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#add1a42315d03f68191df32a019d82093">GetEnvelope</a>();</div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <span class="comment">// If a nonpreemptible optional would overload end_max, push to envelope.</span></div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="keywordflow">while</span> (theta_lambda_tree_.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1c2fe501274ef60430486bba0842cd35">GetOptionalEnvelope</a>() > tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[task]) {</div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <span class="keywordtype">int</span> critical_event; <span class="comment">// Dummy value.</span></div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> <span class="keywordtype">int</span> optional_event;</div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> int64_t available_energy; <span class="comment">// Dummy value.</span></div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> theta_lambda_tree_.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a0cd86cea355b2b1f70e5494fdce82979">GetEventsWithOptionalEnvelopeGreaterThan</a>(</div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[task], &critical_event, &optional_event,</div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> &available_energy);</div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> <span class="keyword">const</span> <span class="keywordtype">int</span> optional_task = tasks_by_start_min_[optional_event];</div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[optional_task] =</div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[optional_task], envelope);</div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> theta_lambda_tree_.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1d04b14711a8d3bba829f1b0eb4dd4a8">RemoveEvent</a>(optional_event);</div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> }</div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="keywordflow">if</span> (!tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>[task]) {</div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> theta_lambda_tree_.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a9045183839ce6286d80eb699209c1557">AddOrUpdateOptionalEvent</a>(event_of_task_[task],</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[task],</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[task]);</div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> theta_lambda_tree_.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1d04b14711a8d3bba829f1b0eb4dd4a8">RemoveEvent</a>(event_of_task_[task]);</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> }</div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> }</div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span>}</div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> </div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_disjunctive_propagator.html#aa9b624e65cb55b3d74ad35a3a675f9ea"> 213</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#aa9b624e65cb55b3d74ad35a3a675f9ea">DisjunctivePropagator::DetectablePrecedencesWithChain</a>(<a class="code hl_struct" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">Tasks</a>* tasks) {</div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>.size();</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="comment">// Prepare start_min events for tree.</span></div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> tasks_by_start_min_.resize(num_tasks);</div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> std::iota(tasks_by_start_min_.begin(), tasks_by_start_min_.end(), 0);</div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> std::sort(</div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> tasks_by_start_min_.begin(), tasks_by_start_min_.end(),</div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> [&](<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j) { return tasks->start_min[i] < tasks->start_min[j]; });</div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> event_of_task_.resize(num_tasks);</div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> event = 0; <span class="keyword">event</span> < num_tasks; ++event) {</div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> event_of_task_[tasks_by_start_min_[event]] = event;</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> theta_lambda_tree_.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a7b4553842be2a65d82b3f40eed71744d">Reset</a>(num_tasks);</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> </div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> <span class="comment">// Sort nonchain tasks by start max = end_max - duration_min.</span></div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_chain_tasks = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a>;</div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> nonchain_tasks_by_start_max_.resize(num_tasks - num_chain_tasks);</div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> std::iota(nonchain_tasks_by_start_max_.begin(),</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> nonchain_tasks_by_start_max_.end(), num_chain_tasks);</div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> std::sort(nonchain_tasks_by_start_max_.begin(),</div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> nonchain_tasks_by_start_max_.end(), [&tasks](<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j) {</div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> return tasks->end_max[i] - tasks->duration_min[i] <</div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> tasks->end_max[j] - tasks->duration_min[j];</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"> 237</span> </div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> <span class="comment">// Detectable precedences, specialized for routes: for every task on route,</span></div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> <span class="comment">// put all tasks before it in the tree, then push with envelope.</span></div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> <span class="keywordtype">int</span> index_nonchain = 0;</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_chain_tasks; ++i) {</div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> <span class="keywordflow">if</span> (!tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>[i]) {</div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> <span class="comment">// Add all nonchain tasks detected before i.</span></div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> <span class="keywordflow">while</span> (index_nonchain < nonchain_tasks_by_start_max_.size()) {</div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> <span class="keyword">const</span> <span class="keywordtype">int</span> task = nonchain_tasks_by_start_max_[index_nonchain];</div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> <span class="keywordflow">if</span> (tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[task] - tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[task] >=</div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[i] + tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[i])</div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> theta_lambda_tree_.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ad812cddd43d03a817341c9875f4f6f4f">AddOrUpdateEvent</a>(</div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> event_of_task_[task], tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[task],</div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[task], tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[task]);</div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> index_nonchain++;</div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> }</div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> }</div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> <span class="comment">// All chain and nonchain tasks before i are now in the tree, push i.</span></div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> <span class="keyword">const</span> int64_t new_start_min = theta_lambda_tree_.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#add1a42315d03f68191df32a019d82093">GetEnvelope</a>();</div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> <span class="comment">// Add i to the tree before updating it.</span></div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> theta_lambda_tree_.<a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ad812cddd43d03a817341c9875f4f6f4f">AddOrUpdateEvent</a>(event_of_task_[i], tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[i],</div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[i],</div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[i]);</div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[i] = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[i], new_start_min);</div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> }</div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span>}</div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> </div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_disjunctive_propagator.html#a7b0f3a8550bd73014e2b61899524a2ad"> 266</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#a7b0f3a8550bd73014e2b61899524a2ad">DisjunctivePropagator::ForbiddenIntervals</a>(<a class="code hl_struct" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">Tasks</a>* tasks) {</div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> <span class="keywordflow">if</span> (tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a425fd06d315549fdc6e6c482e3cdf774">forbidden_intervals</a>.empty()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>.size();</div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> task = 0; task < num_tasks; ++task) {</div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> <span class="keywordflow">if</span> (tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[task] == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> <span class="keywordflow">if</span> (tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a425fd06d315549fdc6e6c482e3cdf774">forbidden_intervals</a>[task] == <span class="keyword">nullptr</span>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> <span class="comment">// If start_min forbidden, push to next feasible value.</span></div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> {</div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> <span class="keyword">const</span> <span class="keyword">auto</span>& <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> =</div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a425fd06d315549fdc6e6c482e3cdf774">forbidden_intervals</a>[task]->FirstIntervalGreaterOrEqual(</div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[task]);</div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> == tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a425fd06d315549fdc6e6c482e3cdf774">forbidden_intervals</a>[task]->end()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->start <= tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[task]) {</div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[task] = <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->end, 1);</div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> }</div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> }</div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> <span class="comment">// If end_max forbidden, push to next feasible value.</span></div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> {</div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> <span class="keyword">const</span> int64_t <a class="code hl_variable" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a> =</div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[task], tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[task]);</div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> <span class="keyword">const</span> <span class="keyword">auto</span>& <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> =</div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a425fd06d315549fdc6e6c482e3cdf774">forbidden_intervals</a>[task]->LastIntervalLessOrEqual(<a class="code hl_variable" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a>);</div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> == tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a425fd06d315549fdc6e6c482e3cdf774">forbidden_intervals</a>[task]->end()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->end >= <a class="code hl_variable" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a>) {</div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[task] =</div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->start, tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[task] - 1);</div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> }</div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> }</div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[task], tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[task]) ></div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[task]) {</div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> }</div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> }</div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span>}</div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> </div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_disjunctive_propagator.html#a13e93a8cd8587377e1b8f88096e0efd0"> 302</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#a13e93a8cd8587377e1b8f88096e0efd0">DisjunctivePropagator::DistanceDuration</a>(<a class="code hl_struct" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">Tasks</a>* tasks) {</div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> <span class="keywordflow">if</span> (tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a10679034cef02c42959f43b6d3db9aba">distance_duration</a>.empty()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> <span class="keywordflow">if</span> (tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a> == 0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> <span class="keyword">const</span> <span class="keywordtype">int</span> route_start = 0;</div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> <span class="keyword">const</span> <span class="keywordtype">int</span> route_end = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a> - 1;</div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>.size();</div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a10679034cef02c42959f43b6d3db9aba">distance_duration</a>.size(); ++i) {</div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> <span class="keyword">const</span> int64_t max_distance = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a10679034cef02c42959f43b6d3db9aba">distance_duration</a>[i].first;</div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> <span class="keyword">const</span> int64_t minimum_break_duration = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a10679034cef02c42959f43b6d3db9aba">distance_duration</a>[i].second;</div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> </div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> <span class="comment">// This is a sweeping algorithm that looks whether the union of intervals</span></div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> <span class="comment">// defined by breaks and route start/end is (-infty, +infty).</span></div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> <span class="comment">// Those intervals are:</span></div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> <span class="comment">// - route start: (-infty, start_max + distance]</span></div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> <span class="comment">// - route end: [end_min, +infty)</span></div>
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> <span class="comment">// - breaks: [start_min, end_max + distance) if their duration_max</span></div>
|
|
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> <span class="comment">// is >= min_duration, empty set otherwise.</span></div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> <span class="comment">// If sweeping finds that a time point can be covered by only one interval,</span></div>
|
|
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> <span class="comment">// it will force the corresponding break or route start/end to cover this</span></div>
|
|
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> <span class="comment">// point, which can force a break to be above minimum_break_duration.</span></div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> </div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> <span class="comment">// We suppose break tasks are ordered, so the algorithm supposes that</span></div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> <span class="comment">// start_min(task_n) <= start_min(task_{n+1}) and</span></div>
|
|
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> <span class="comment">// end_max(task_n) <= end_max(task_{n+1}).</span></div>
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> task = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a> + 1; task < num_tasks; ++task) {</div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[task] =</div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[task], tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[task - 1]);</div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> }</div>
|
|
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> task = num_tasks - 2; task >= tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a>; --task) {</div>
|
|
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[task] =</div>
|
|
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[task], tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[task + 1]);</div>
|
|
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span> }</div>
|
|
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> <span class="comment">// Skip breaks that cannot be performed after start.</span></div>
|
|
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> <span class="keywordtype">int</span> index_break_by_emax = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a>;</div>
|
|
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> <span class="keywordflow">while</span> (index_break_by_emax < num_tasks &&</div>
|
|
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[index_break_by_emax] <= tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>[route_start]) {</div>
|
|
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> ++index_break_by_emax;</div>
|
|
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> }</div>
|
|
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> <span class="comment">// Special case: no breaks after start.</span></div>
|
|
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> <span class="keywordflow">if</span> (index_break_by_emax == num_tasks) {</div>
|
|
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>[route_start] =</div>
|
|
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>[route_start],</div>
|
|
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[route_end], max_distance));</div>
|
|
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[route_end] =</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::min</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[route_end],</div>
|
|
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[route_start], max_distance));</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> <span class="comment">// There will be a break after start, so route_start coverage is tested.</span></div>
|
|
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> <span class="comment">// Initial state: start at -inf with route_start in task_set.</span></div>
|
|
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> <span class="comment">// Sweep over profile, looking for time points where the number of</span></div>
|
|
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> <span class="comment">// covering breaks is <= 1. If it is 0, fail, otherwise force the</span></div>
|
|
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span> <span class="comment">// unique break to cover it.</span></div>
|
|
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> <span class="comment">// Route start and end get a special treatment, not sure generalizing</span></div>
|
|
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> <span class="comment">// would be better.</span></div>
|
|
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> int64_t xor_active_tasks = route_start;</div>
|
|
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> <span class="keywordtype">int</span> num_active_tasks = 1;</div>
|
|
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> int64_t previous_time = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>();</div>
|
|
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> <span class="keyword">const</span> int64_t route_start_time =</div>
|
|
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[route_start], max_distance);</div>
|
|
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> <span class="keyword">const</span> int64_t route_end_time = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[route_end];</div>
|
|
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> <span class="comment">// NOTE: all smin events must be closed by a corresponding emax event,</span></div>
|
|
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> <span class="comment">// otherwise num_active_tasks is wrong (too high) and the reasoning misses</span></div>
|
|
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> <span class="comment">// some filtering.</span></div>
|
|
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> <span class="keywordtype">int</span> index_break_by_smin = index_break_by_emax;</div>
|
|
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> <span class="keywordflow">while</span> (index_break_by_emax < num_tasks) {</div>
|
|
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> <span class="comment">// Find next time point among start/end of covering intervals.</span></div>
|
|
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> int64_t current_time =</div>
|
|
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[index_break_by_emax], max_distance);</div>
|
|
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> <span class="keywordflow">if</span> (index_break_by_smin < num_tasks) {</div>
|
|
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> current_time =</div>
|
|
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(current_time, tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[index_break_by_smin]);</div>
|
|
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> }</div>
|
|
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> <span class="keywordflow">if</span> (previous_time < route_start_time && route_start_time < current_time) {</div>
|
|
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> current_time = route_start_time;</div>
|
|
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> }</div>
|
|
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> <span class="keywordflow">if</span> (previous_time < route_end_time && route_end_time < current_time) {</div>
|
|
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> current_time = route_end_time;</div>
|
|
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span> }</div>
|
|
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span> <span class="comment">// If num_active_tasks was 1, the unique active task must cover from</span></div>
|
|
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> <span class="comment">// previous_time to current_time.</span></div>
|
|
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span> <span class="keywordflow">if</span> (num_active_tasks == 1) {</div>
|
|
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span> <span class="comment">// xor_active_tasks is the unique task that can cover [previous_time,</span></div>
|
|
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span> <span class="comment">// current_time).</span></div>
|
|
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span> <span class="keywordflow">if</span> (xor_active_tasks != route_end) {</div>
|
|
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>[xor_active_tasks] =</div>
|
|
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>[xor_active_tasks],</div>
|
|
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span> <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(current_time, max_distance));</div>
|
|
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> <span class="keywordflow">if</span> (xor_active_tasks != route_start) {</div>
|
|
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[xor_active_tasks] = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(</div>
|
|
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[xor_active_tasks],</div>
|
|
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(</div>
|
|
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> minimum_break_duration,</div>
|
|
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> <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_time, max_distance), previous_time)));</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> }</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> <span class="comment">// Process covering intervals that start or end at current_time.</span></div>
|
|
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span> <span class="keywordflow">while</span> (index_break_by_smin < num_tasks &&</div>
|
|
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span> current_time == tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[index_break_by_smin]) {</div>
|
|
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span> <span class="keywordflow">if</span> (tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#abd7699021e5652feb514e0d68c973df2">duration_max</a>[index_break_by_smin] >=</div>
|
|
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span> minimum_break_duration) {</div>
|
|
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span> xor_active_tasks ^= index_break_by_smin;</div>
|
|
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> ++num_active_tasks;</div>
|
|
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span> }</div>
|
|
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span> ++index_break_by_smin;</div>
|
|
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span> }</div>
|
|
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> <span class="keywordflow">while</span> (index_break_by_emax < num_tasks &&</div>
|
|
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span> current_time ==</div>
|
|
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[index_break_by_emax], max_distance)) {</div>
|
|
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> <span class="keywordflow">if</span> (tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#abd7699021e5652feb514e0d68c973df2">duration_max</a>[index_break_by_emax] >=</div>
|
|
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span> minimum_break_duration) {</div>
|
|
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"> 414</span> xor_active_tasks ^= index_break_by_emax;</div>
|
|
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"> 415</span> --num_active_tasks;</div>
|
|
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span> }</div>
|
|
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span> ++index_break_by_emax;</div>
|
|
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno"> 418</span> }</div>
|
|
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"> 419</span> <span class="keywordflow">if</span> (current_time == route_start_time) {</div>
|
|
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span> xor_active_tasks ^= route_start;</div>
|
|
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</span> --num_active_tasks;</div>
|
|
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno"> 422</span> }</div>
|
|
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno"> 423</span> <span class="keywordflow">if</span> (current_time == route_end_time) {</div>
|
|
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno"> 424</span> xor_active_tasks ^= route_end;</div>
|
|
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno"> 425</span> ++num_active_tasks;</div>
|
|
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno"> 426</span> }</div>
|
|
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno"> 427</span> <span class="comment">// If num_active_tasks becomes 1, the unique active task must cover from</span></div>
|
|
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno"> 428</span> <span class="comment">// current_time.</span></div>
|
|
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> <span class="keywordflow">if</span> (num_active_tasks <= 0) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> <span class="keywordflow">if</span> (num_active_tasks == 1) {</div>
|
|
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> <span class="keywordflow">if</span> (xor_active_tasks != route_start) {</div>
|
|
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> <span class="comment">// xor_active_tasks is the unique task that can cover from</span></div>
|
|
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> <span class="comment">// current_time to the next time point.</span></div>
|
|
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[xor_active_tasks] =</div>
|
|
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[xor_active_tasks], current_time);</div>
|
|
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno"> 436</span> <span class="keywordflow">if</span> (xor_active_tasks != route_end) {</div>
|
|
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno"> 437</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[xor_active_tasks] = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(</div>
|
|
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno"> 438</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[xor_active_tasks], minimum_break_duration);</div>
|
|
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno"> 439</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> }</div>
|
|
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno"> 442</span> previous_time = current_time;</div>
|
|
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno"> 443</span> }</div>
|
|
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"> 444</span> }</div>
|
|
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"> 445</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</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"><a class="line" href="classoperations__research_1_1_disjunctive_propagator.html#ad84e0e4ee59eab8a1004906628692ccb"> 448</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#ad84e0e4ee59eab8a1004906628692ccb">DisjunctivePropagator::ChainSpanMin</a>(<a class="code hl_struct" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">Tasks</a>* tasks) {</div>
|
|
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno"> 449</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_chain_tasks = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a>;</div>
|
|
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno"> 450</span> <span class="keywordflow">if</span> (num_chain_tasks < 1) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00451" name="l00451"></a><span class="lineno"> 451</span> <span class="comment">// TODO(user): add stronger bounds.</span></div>
|
|
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno"> 452</span> <span class="comment">// The duration of the chain plus that of nonchain tasks that must be</span></div>
|
|
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno"> 453</span> <span class="comment">// performed during the chain is a lower bound of the chain span.</span></div>
|
|
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno"> 454</span> {</div>
|
|
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno"> 455</span> int64_t sum_chain_durations = 0;</div>
|
|
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno"> 456</span> <span class="keyword">const</span> <span class="keyword">auto</span> duration_start = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>.begin();</div>
|
|
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"> 457</span> <span class="keyword">const</span> <span class="keyword">auto</span> duration_end = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>.begin() + num_chain_tasks;</div>
|
|
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"> 458</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = duration_start; it != duration_end; ++it) {</div>
|
|
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno"> 459</span> sum_chain_durations = <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(sum_chain_durations, *it);</div>
|
|
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"> 460</span> }</div>
|
|
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno"> 461</span> int64_t sum_forced_nonchain_durations = 0;</div>
|
|
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = num_chain_tasks; i < tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>.size(); ++i) {</div>
|
|
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span> <span class="comment">// Tasks that can be executed before or after are skipped.</span></div>
|
|
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno"> 464</span> <span class="keywordflow">if</span> (tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>[i] <= tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[0] ||</div>
|
|
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>[num_chain_tasks - 1] <= tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[i]) {</div>
|
|
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span> }</div>
|
|
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span> sum_forced_nonchain_durations =</div>
|
|
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno"> 469</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(sum_forced_nonchain_durations, tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[i]);</div>
|
|
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno"> 470</span> }</div>
|
|
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno"> 471</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a403871ce706f58918d0fe7f580f2b174">span_min</a> =</div>
|
|
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno"> 472</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a403871ce706f58918d0fe7f580f2b174">span_min</a>,</div>
|
|
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno"> 473</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(sum_chain_durations, sum_forced_nonchain_durations));</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> <span class="comment">// The difference end of the chain - start of the chain is a lower bound.</span></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> <span class="keyword">const</span> int64_t end_minus_start =</div>
|
|
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno"> 478</span> <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>[num_chain_tasks - 1], tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[0]);</div>
|
|
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno"> 479</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a403871ce706f58918d0fe7f580f2b174">span_min</a> = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a403871ce706f58918d0fe7f580f2b174">span_min</a>, end_minus_start);</div>
|
|
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno"> 480</span> }</div>
|
|
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno"> 481</span> </div>
|
|
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno"> 482</span> <span class="keywordflow">return</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a403871ce706f58918d0fe7f580f2b174">span_min</a> <= tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a252dd9da028d9c85c4b16db92770b623">span_max</a>;</div>
|
|
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno"> 483</span>}</div>
|
|
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno"> 484</span> </div>
|
|
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno"> 485</span><span class="comment">// Computes a lower bound of the span of the chain, taking into account only</span></div>
|
|
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno"> 486</span><span class="comment">// the first nonchain task.</span></div>
|
|
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno"> 487</span><span class="comment">// TODO(user): extend to arbitrary number of nonchain tasks.</span></div>
|
|
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_disjunctive_propagator.html#acf2f8cdb2a89ceee2b652aee8fa86b21"> 488</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#acf2f8cdb2a89ceee2b652aee8fa86b21">DisjunctivePropagator::ChainSpanMinDynamic</a>(<a class="code hl_struct" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">Tasks</a>* tasks) {</div>
|
|
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno"> 489</span> <span class="comment">// Do nothing if there are no chain tasks or no nonchain tasks.</span></div>
|
|
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno"> 490</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_chain_tasks = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a>;</div>
|
|
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno"> 491</span> <span class="keywordflow">if</span> (num_chain_tasks < 1) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno"> 492</span> <span class="keywordflow">if</span> (num_chain_tasks == tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>.size()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno"> 493</span> <span class="keyword">const</span> <span class="keywordtype">int</span> task_index = num_chain_tasks;</div>
|
|
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno"> 494</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#a0d1ed47f6804807e925b489b24fb8d04">Precedences</a>(tasks)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno"> 495</span> <span class="keyword">const</span> int64_t min_possible_chain_end = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>[num_chain_tasks - 1];</div>
|
|
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno"> 496</span> <span class="keyword">const</span> int64_t max_possible_chain_start = tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[0];</div>
|
|
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno"> 497</span> <span class="comment">// For each chain task i, compute cumulated duration of chain tasks before it.</span></div>
|
|
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"> 498</span> int64_t total_duration = 0;</div>
|
|
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno"> 499</span> {</div>
|
|
<div class="line"><a id="l00500" name="l00500"></a><span class="lineno"> 500</span> total_duration_before_.resize(num_chain_tasks);</div>
|
|
<div class="line"><a id="l00501" name="l00501"></a><span class="lineno"> 501</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_chain_tasks; ++i) {</div>
|
|
<div class="line"><a id="l00502" name="l00502"></a><span class="lineno"> 502</span> total_duration_before_[i] = total_duration;</div>
|
|
<div class="line"><a id="l00503" name="l00503"></a><span class="lineno"> 503</span> total_duration = <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(total_duration, tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[i]);</div>
|
|
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno"> 504</span> }</div>
|
|
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno"> 505</span> }</div>
|
|
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno"> 506</span> <span class="comment">// Estimate span min of chain tasks. Use the schedule that ends at</span></div>
|
|
<div class="line"><a id="l00507" name="l00507"></a><span class="lineno"> 507</span> <span class="comment">// min_possible_chain_end and starts at smallest of start_max[0] or the</span></div>
|
|
<div class="line"><a id="l00508" name="l00508"></a><span class="lineno"> 508</span> <span class="comment">// threshold where pushing start[0] later does not make a difference to the</span></div>
|
|
<div class="line"><a id="l00509" name="l00509"></a><span class="lineno"> 509</span> <span class="comment">// chain span because of chain precedence constraints,</span></div>
|
|
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno"> 510</span> <span class="comment">// i.e. min_possible_chain_end - total_duration.</span></div>
|
|
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno"> 511</span> {</div>
|
|
<div class="line"><a id="l00512" name="l00512"></a><span class="lineno"> 512</span> <span class="keyword">const</span> int64_t chain_span_min =</div>
|
|
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno"> 513</span> min_possible_chain_end -</div>
|
|
<div class="line"><a id="l00514" name="l00514"></a><span class="lineno"> 514</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[0], min_possible_chain_end - total_duration);</div>
|
|
<div class="line"><a id="l00515" name="l00515"></a><span class="lineno"> 515</span> <span class="keywordflow">if</span> (chain_span_min > tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a252dd9da028d9c85c4b16db92770b623">span_max</a>) {</div>
|
|
<div class="line"><a id="l00516" name="l00516"></a><span class="lineno"> 516</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00517" name="l00517"></a><span class="lineno"> 517</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00518" name="l00518"></a><span class="lineno"> 518</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a403871ce706f58918d0fe7f580f2b174">span_min</a> = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a403871ce706f58918d0fe7f580f2b174">span_min</a>, chain_span_min);</div>
|
|
<div class="line"><a id="l00519" name="l00519"></a><span class="lineno"> 519</span> }</div>
|
|
<div class="line"><a id="l00520" name="l00520"></a><span class="lineno"> 520</span> <span class="comment">// If task can be performed before or after the chain,</span></div>
|
|
<div class="line"><a id="l00521" name="l00521"></a><span class="lineno"> 521</span> <span class="comment">// span_min is chain_span_min.</span></div>
|
|
<div class="line"><a id="l00522" name="l00522"></a><span class="lineno"> 522</span> <span class="keywordflow">if</span> (tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>[task_index] <= tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[0] ||</div>
|
|
<div class="line"><a id="l00523" name="l00523"></a><span class="lineno"> 523</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>[num_chain_tasks - 1] <= tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[task_index]) {</div>
|
|
<div class="line"><a id="l00524" name="l00524"></a><span class="lineno"> 524</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00525" name="l00525"></a><span class="lineno"> 525</span> }</div>
|
|
<div class="line"><a id="l00526" name="l00526"></a><span class="lineno"> 526</span> }</div>
|
|
<div class="line"><a id="l00527" name="l00527"></a><span class="lineno"> 527</span> <span class="comment">// Scan all possible preemption positions of the nontask chain,</span></div>
|
|
<div class="line"><a id="l00528" name="l00528"></a><span class="lineno"> 528</span> <span class="comment">// keep the one that yields the minimum span.</span></div>
|
|
<div class="line"><a id="l00529" name="l00529"></a><span class="lineno"> 529</span> int64_t span_min = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a id="l00530" name="l00530"></a><span class="lineno"> 530</span> <span class="keywordtype">bool</span> schedule_is_feasible = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00531" name="l00531"></a><span class="lineno"> 531</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_chain_tasks; ++i) {</div>
|
|
<div class="line"><a id="l00532" name="l00532"></a><span class="lineno"> 532</span> <span class="keywordflow">if</span> (!tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>[i]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00533" name="l00533"></a><span class="lineno"> 533</span> <span class="comment">// Estimate span min if tasks is performed during i.</span></div>
|
|
<div class="line"><a id="l00534" name="l00534"></a><span class="lineno"> 534</span> <span class="comment">// For all possible minimal-span schedules, there is a schedule where task i</span></div>
|
|
<div class="line"><a id="l00535" name="l00535"></a><span class="lineno"> 535</span> <span class="comment">// and nonchain task form a single block. Thus, we only consider those.</span></div>
|
|
<div class="line"><a id="l00536" name="l00536"></a><span class="lineno"> 536</span> <span class="keyword">const</span> int64_t block_start_min =</div>
|
|
<div class="line"><a id="l00537" name="l00537"></a><span class="lineno"> 537</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[i],</div>
|
|
<div class="line"><a id="l00538" name="l00538"></a><span class="lineno"> 538</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[task_index] - tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[i]);</div>
|
|
<div class="line"><a id="l00539" name="l00539"></a><span class="lineno"> 539</span> <span class="keyword">const</span> int64_t block_start_max =</div>
|
|
<div class="line"><a id="l00540" name="l00540"></a><span class="lineno"> 540</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[task_index],</div>
|
|
<div class="line"><a id="l00541" name="l00541"></a><span class="lineno"> 541</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[i] - tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[task_index]);</div>
|
|
<div class="line"><a id="l00542" name="l00542"></a><span class="lineno"> 542</span> <span class="keywordflow">if</span> (block_start_min > block_start_max) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00543" name="l00543"></a><span class="lineno"> 543</span> </div>
|
|
<div class="line"><a id="l00544" name="l00544"></a><span class="lineno"> 544</span> <span class="comment">// Compute the block start that yields the minimal span.</span></div>
|
|
<div class="line"><a id="l00545" name="l00545"></a><span class="lineno"> 545</span> <span class="comment">// Given a feasible block start, a chain of minimum span constrained to</span></div>
|
|
<div class="line"><a id="l00546" name="l00546"></a><span class="lineno"> 546</span> <span class="comment">// this particular block start can be obtained by scheduling all tasks after</span></div>
|
|
<div class="line"><a id="l00547" name="l00547"></a><span class="lineno"> 547</span> <span class="comment">// the block at their earliest, and all tasks before it at their latest.</span></div>
|
|
<div class="line"><a id="l00548" name="l00548"></a><span class="lineno"> 548</span> <span class="comment">// The span can be decomposed into two parts: the head, which are the</span></div>
|
|
<div class="line"><a id="l00549" name="l00549"></a><span class="lineno"> 549</span> <span class="comment">// tasks that are before the block, and the tail, which are the block and</span></div>
|
|
<div class="line"><a id="l00550" name="l00550"></a><span class="lineno"> 550</span> <span class="comment">// the tasks after it.</span></div>
|
|
<div class="line"><a id="l00551" name="l00551"></a><span class="lineno"> 551</span> <span class="comment">// When the block start varies, the head length of the optimal schedule</span></div>
|
|
<div class="line"><a id="l00552" name="l00552"></a><span class="lineno"> 552</span> <span class="comment">// described above decreases as much as the block start decreases, until</span></div>
|
|
<div class="line"><a id="l00553" name="l00553"></a><span class="lineno"> 553</span> <span class="comment">// an inflection point at which it stays constant. That inflection value</span></div>
|
|
<div class="line"><a id="l00554" name="l00554"></a><span class="lineno"> 554</span> <span class="comment">// is the one where the precedence constraints force the chain start to</span></div>
|
|
<div class="line"><a id="l00555" name="l00555"></a><span class="lineno"> 555</span> <span class="comment">// decrease because of durations.</span></div>
|
|
<div class="line"><a id="l00556" name="l00556"></a><span class="lineno"> 556</span> <span class="keyword">const</span> int64_t head_inflection =</div>
|
|
<div class="line"><a id="l00557" name="l00557"></a><span class="lineno"> 557</span> max_possible_chain_start + total_duration_before_[i];</div>
|
|
<div class="line"><a id="l00558" name="l00558"></a><span class="lineno"> 558</span> <span class="comment">// The map from block start to minimal tail length also has an inflection</span></div>
|
|
<div class="line"><a id="l00559" name="l00559"></a><span class="lineno"> 559</span> <span class="comment">// point, that additionally depends on the nonchain task's duration.</span></div>
|
|
<div class="line"><a id="l00560" name="l00560"></a><span class="lineno"> 560</span> <span class="keyword">const</span> int64_t tail_inflection =</div>
|
|
<div class="line"><a id="l00561" name="l00561"></a><span class="lineno"> 561</span> min_possible_chain_end - (total_duration - total_duration_before_[i]) -</div>
|
|
<div class="line"><a id="l00562" name="l00562"></a><span class="lineno"> 562</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[task_index];</div>
|
|
<div class="line"><a id="l00563" name="l00563"></a><span class="lineno"> 563</span> <span class="comment">// All block start values between these two yield the same minimal span.</span></div>
|
|
<div class="line"><a id="l00564" name="l00564"></a><span class="lineno"> 564</span> <span class="comment">// Indeed, first, mind that the inflection points might be in any order.</span></div>
|
|
<div class="line"><a id="l00565" name="l00565"></a><span class="lineno"> 565</span> <span class="comment">// - if head_inflection < tail_inflection, then inside the interval</span></div>
|
|
<div class="line"><a id="l00566" name="l00566"></a><span class="lineno"> 566</span> <span class="comment">// [head_inflection, tail_inflection], increasing the block start by delta</span></div>
|
|
<div class="line"><a id="l00567" name="l00567"></a><span class="lineno"> 567</span> <span class="comment">// decreases the tail length by delta and increases the head length by</span></div>
|
|
<div class="line"><a id="l00568" name="l00568"></a><span class="lineno"> 568</span> <span class="comment">// delta too.</span></div>
|
|
<div class="line"><a id="l00569" name="l00569"></a><span class="lineno"> 569</span> <span class="comment">// - if tail_inflection < head_inflection, then inside the interval</span></div>
|
|
<div class="line"><a id="l00570" name="l00570"></a><span class="lineno"> 570</span> <span class="comment">// [tail_inflection, head_inflection], head length is constantly at</span></div>
|
|
<div class="line"><a id="l00571" name="l00571"></a><span class="lineno"> 571</span> <span class="comment">// total_duration_before_[i], and tail length is also constant.</span></div>
|
|
<div class="line"><a id="l00572" name="l00572"></a><span class="lineno"> 572</span> <span class="comment">// In both cases, outside of the interval, one part is constant and the</span></div>
|
|
<div class="line"><a id="l00573" name="l00573"></a><span class="lineno"> 573</span> <span class="comment">// other increases as much as the distance to the interval.</span></div>
|
|
<div class="line"><a id="l00574" name="l00574"></a><span class="lineno"> 574</span> <span class="comment">// We can abstract inflection point to the interval they form.</span></div>
|
|
<div class="line"><a id="l00575" name="l00575"></a><span class="lineno"> 575</span> <span class="keyword">const</span> int64_t optimal_interval_min_start =</div>
|
|
<div class="line"><a id="l00576" name="l00576"></a><span class="lineno"> 576</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(head_inflection, tail_inflection);</div>
|
|
<div class="line"><a id="l00577" name="l00577"></a><span class="lineno"> 577</span> <span class="keyword">const</span> int64_t optimal_interval_max_start =</div>
|
|
<div class="line"><a id="l00578" name="l00578"></a><span class="lineno"> 578</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(head_inflection, tail_inflection);</div>
|
|
<div class="line"><a id="l00579" name="l00579"></a><span class="lineno"> 579</span> <span class="comment">// If the optimal interval for block start intersects the feasible interval,</span></div>
|
|
<div class="line"><a id="l00580" name="l00580"></a><span class="lineno"> 580</span> <span class="comment">// we can select any point within it, for instance the earliest one.</span></div>
|
|
<div class="line"><a id="l00581" name="l00581"></a><span class="lineno"> 581</span> int64_t block_start = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(optimal_interval_min_start, block_start_min);</div>
|
|
<div class="line"><a id="l00582" name="l00582"></a><span class="lineno"> 582</span> <span class="comment">// If the intervals do not intersect, the feasible value closest to the</span></div>
|
|
<div class="line"><a id="l00583" name="l00583"></a><span class="lineno"> 583</span> <span class="comment">// optimal interval has the minimal span, because the span increases as</span></div>
|
|
<div class="line"><a id="l00584" name="l00584"></a><span class="lineno"> 584</span> <span class="comment">// much as the distance to the optimal interval.</span></div>
|
|
<div class="line"><a id="l00585" name="l00585"></a><span class="lineno"> 585</span> <span class="keywordflow">if</span> (optimal_interval_max_start < block_start_min) {</div>
|
|
<div class="line"><a id="l00586" name="l00586"></a><span class="lineno"> 586</span> <span class="comment">// Optimal interval is before feasible interval, closest is feasible min.</span></div>
|
|
<div class="line"><a id="l00587" name="l00587"></a><span class="lineno"> 587</span> block_start = block_start_min;</div>
|
|
<div class="line"><a id="l00588" name="l00588"></a><span class="lineno"> 588</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (block_start_max < optimal_interval_min_start) {</div>
|
|
<div class="line"><a id="l00589" name="l00589"></a><span class="lineno"> 589</span> <span class="comment">// Optimal interval is after feasible interval, closest is feasible max.</span></div>
|
|
<div class="line"><a id="l00590" name="l00590"></a><span class="lineno"> 590</span> block_start = block_start_max;</div>
|
|
<div class="line"><a id="l00591" name="l00591"></a><span class="lineno"> 591</span> }</div>
|
|
<div class="line"><a id="l00592" name="l00592"></a><span class="lineno"> 592</span> <span class="comment">// Compute span for the chosen block start.</span></div>
|
|
<div class="line"><a id="l00593" name="l00593"></a><span class="lineno"> 593</span> <span class="keyword">const</span> int64_t head_duration =</div>
|
|
<div class="line"><a id="l00594" name="l00594"></a><span class="lineno"> 594</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(block_start, head_inflection) - max_possible_chain_start;</div>
|
|
<div class="line"><a id="l00595" name="l00595"></a><span class="lineno"> 595</span> <span class="keyword">const</span> int64_t tail_duration =</div>
|
|
<div class="line"><a id="l00596" name="l00596"></a><span class="lineno"> 596</span> min_possible_chain_end - <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(block_start, tail_inflection);</div>
|
|
<div class="line"><a id="l00597" name="l00597"></a><span class="lineno"> 597</span> <span class="keyword">const</span> int64_t optimal_span_at_i = head_duration + tail_duration;</div>
|
|
<div class="line"><a id="l00598" name="l00598"></a><span class="lineno"> 598</span> span_min = <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(span_min, optimal_span_at_i);</div>
|
|
<div class="line"><a id="l00599" name="l00599"></a><span class="lineno"> 599</span> schedule_is_feasible = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00600" name="l00600"></a><span class="lineno"> 600</span> }</div>
|
|
<div class="line"><a id="l00601" name="l00601"></a><span class="lineno"> 601</span> <span class="keywordflow">if</span> (!schedule_is_feasible || span_min > tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a252dd9da028d9c85c4b16db92770b623">span_max</a>) {</div>
|
|
<div class="line"><a id="l00602" name="l00602"></a><span class="lineno"> 602</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00603" name="l00603"></a><span class="lineno"> 603</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00604" name="l00604"></a><span class="lineno"> 604</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a403871ce706f58918d0fe7f580f2b174">span_min</a> = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a403871ce706f58918d0fe7f580f2b174">span_min</a>, span_min);</div>
|
|
<div class="line"><a id="l00605" name="l00605"></a><span class="lineno"> 605</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00606" name="l00606"></a><span class="lineno"> 606</span> }</div>
|
|
<div class="line"><a id="l00607" name="l00607"></a><span class="lineno"> 607</span>}</div>
|
|
<div class="line"><a id="l00608" name="l00608"></a><span class="lineno"> 608</span> </div>
|
|
<div class="line"><a id="l00609" name="l00609"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#aa3db12120fcb6529cf2860fac7ef37bd"> 609</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research.html#aa3db12120fcb6529cf2860fac7ef37bd">AppendTasksFromPath</a>(<span class="keyword">const</span> std::vector<int64_t>& path,</div>
|
|
<div class="line"><a id="l00610" name="l00610"></a><span class="lineno"> 610</span> <span class="keyword">const</span> <a class="code hl_struct" href="structoperations__research_1_1_travel_bounds.html">TravelBounds</a>& travel_bounds,</div>
|
|
<div class="line"><a id="l00611" name="l00611"></a><span class="lineno"> 611</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="l00612" name="l00612"></a><span class="lineno"> 612</span> <a class="code hl_struct" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">DisjunctivePropagator::Tasks</a>* tasks) {</div>
|
|
<div class="line"><a id="l00613" name="l00613"></a><span class="lineno"> 613</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_nodes = path.size();</div>
|
|
<div class="line"><a id="l00614" name="l00614"></a><span class="lineno"> 614</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(travel_bounds.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a9f757b787c617299a0beb531625a734f">pre_travels</a>.size(), num_nodes - 1);</div>
|
|
<div class="line"><a id="l00615" name="l00615"></a><span class="lineno"> 615</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(travel_bounds.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a19ace84f03aa7a436d6e91c16caf6618">post_travels</a>.size(), num_nodes - 1);</div>
|
|
<div class="line"><a id="l00616" name="l00616"></a><span class="lineno"> 616</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_nodes; ++i) {</div>
|
|
<div class="line"><a id="l00617" name="l00617"></a><span class="lineno"> 617</span> <span class="keyword">const</span> int64_t cumul_min = dimension.<a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a3a71e48b4ed287752b9d9d9f7086ec7d">CumulVar</a>(path[i])-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#a62b340f6d1dde6a36560bd88a382ada7">Min</a>();</div>
|
|
<div class="line"><a id="l00618" name="l00618"></a><span class="lineno"> 618</span> <span class="keyword">const</span> int64_t cumul_max = dimension.<a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a3a71e48b4ed287752b9d9d9f7086ec7d">CumulVar</a>(path[i])-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#ac84c250d67f30c89e845cd460eeaaad8">Max</a>();</div>
|
|
<div class="line"><a id="l00619" name="l00619"></a><span class="lineno"> 619</span> <span class="comment">// Add task associated to visit i.</span></div>
|
|
<div class="line"><a id="l00620" name="l00620"></a><span class="lineno"> 620</span> <span class="comment">// Visits start at Cumul(path[i]) - before_visit</span></div>
|
|
<div class="line"><a id="l00621" name="l00621"></a><span class="lineno"> 621</span> <span class="comment">// and end at Cumul(path[i]) + after_visit</span></div>
|
|
<div class="line"><a id="l00622" name="l00622"></a><span class="lineno"> 622</span> {</div>
|
|
<div class="line"><a id="l00623" name="l00623"></a><span class="lineno"> 623</span> <span class="keyword">const</span> int64_t before_visit =</div>
|
|
<div class="line"><a id="l00624" name="l00624"></a><span class="lineno"> 624</span> (i == 0) ? 0 : travel_bounds.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a19ace84f03aa7a436d6e91c16caf6618">post_travels</a>[i - 1];</div>
|
|
<div class="line"><a id="l00625" name="l00625"></a><span class="lineno"> 625</span> <span class="keyword">const</span> int64_t after_visit =</div>
|
|
<div class="line"><a id="l00626" name="l00626"></a><span class="lineno"> 626</span> (i == num_nodes - 1) ? 0 : travel_bounds.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a9f757b787c617299a0beb531625a734f">pre_travels</a>[i];</div>
|
|
<div class="line"><a id="l00627" name="l00627"></a><span class="lineno"> 627</span> </div>
|
|
<div class="line"><a id="l00628" name="l00628"></a><span class="lineno"> 628</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>.push_back(<a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cumul_min, before_visit));</div>
|
|
<div class="line"><a id="l00629" name="l00629"></a><span class="lineno"> 629</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>.push_back(<a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(cumul_max, before_visit));</div>
|
|
<div class="line"><a id="l00630" name="l00630"></a><span class="lineno"> 630</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>.push_back(<a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(before_visit, after_visit));</div>
|
|
<div class="line"><a id="l00631" name="l00631"></a><span class="lineno"> 631</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#abd7699021e5652feb514e0d68c973df2">duration_max</a>.push_back(<a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(before_visit, after_visit));</div>
|
|
<div class="line"><a id="l00632" name="l00632"></a><span class="lineno"> 632</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>.push_back(<a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(cumul_min, after_visit));</div>
|
|
<div class="line"><a id="l00633" name="l00633"></a><span class="lineno"> 633</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>.push_back(<a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(cumul_max, after_visit));</div>
|
|
<div class="line"><a id="l00634" name="l00634"></a><span class="lineno"> 634</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>.push_back(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00635" name="l00635"></a><span class="lineno"> 635</span> }</div>
|
|
<div class="line"><a id="l00636" name="l00636"></a><span class="lineno"> 636</span> <span class="keywordflow">if</span> (i == num_nodes - 1) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00637" name="l00637"></a><span class="lineno"> 637</span> </div>
|
|
<div class="line"><a id="l00638" name="l00638"></a><span class="lineno"> 638</span> <span class="comment">// Tasks from travels.</span></div>
|
|
<div class="line"><a id="l00639" name="l00639"></a><span class="lineno"> 639</span> <span class="comment">// A travel task starts at Cumul(path[i]) + pre_travel,</span></div>
|
|
<div class="line"><a id="l00640" name="l00640"></a><span class="lineno"> 640</span> <span class="comment">// last for FixedTransitVar(path[i]) - pre_travel - post_travel,</span></div>
|
|
<div class="line"><a id="l00641" name="l00641"></a><span class="lineno"> 641</span> <span class="comment">// and must end at the latest at Cumul(path[i+1]) - post_travel.</span></div>
|
|
<div class="line"><a id="l00642" name="l00642"></a><span class="lineno"> 642</span> {</div>
|
|
<div class="line"><a id="l00643" name="l00643"></a><span class="lineno"> 643</span> <span class="keyword">const</span> int64_t pre_travel = travel_bounds.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a9f757b787c617299a0beb531625a734f">pre_travels</a>[i];</div>
|
|
<div class="line"><a id="l00644" name="l00644"></a><span class="lineno"> 644</span> <span class="keyword">const</span> int64_t post_travel = travel_bounds.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a19ace84f03aa7a436d6e91c16caf6618">post_travels</a>[i];</div>
|
|
<div class="line"><a id="l00645" name="l00645"></a><span class="lineno"> 645</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>.push_back(<a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(cumul_min, pre_travel));</div>
|
|
<div class="line"><a id="l00646" name="l00646"></a><span class="lineno"> 646</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>.push_back(<a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(cumul_max, pre_travel));</div>
|
|
<div class="line"><a id="l00647" name="l00647"></a><span class="lineno"> 647</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>.push_back(</div>
|
|
<div class="line"><a id="l00648" name="l00648"></a><span class="lineno"> 648</span> std::max<int64_t>(0, <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(travel_bounds.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#aca8610bd0ccad69ab8284f40a468c7f0">min_travels</a>[i],</div>
|
|
<div class="line"><a id="l00649" name="l00649"></a><span class="lineno"> 649</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(pre_travel, post_travel))));</div>
|
|
<div class="line"><a id="l00650" name="l00650"></a><span class="lineno"> 650</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#abd7699021e5652feb514e0d68c973df2">duration_max</a>.push_back(</div>
|
|
<div class="line"><a id="l00651" name="l00651"></a><span class="lineno"> 651</span> travel_bounds.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a6fcbfd1ef4117ac735024d0835b48468">max_travels</a>[i] == <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>()</div>
|
|
<div class="line"><a id="l00652" name="l00652"></a><span class="lineno"> 652</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="l00653" name="l00653"></a><span class="lineno"> 653</span> : std::max<int64_t>(0, <a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(travel_bounds.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a6fcbfd1ef4117ac735024d0835b48468">max_travels</a>[i],</div>
|
|
<div class="line"><a id="l00654" name="l00654"></a><span class="lineno"> 654</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(pre_travel, post_travel))));</div>
|
|
<div class="line"><a id="l00655" name="l00655"></a><span class="lineno"> 655</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>.push_back(</div>
|
|
<div class="line"><a id="l00656" name="l00656"></a><span class="lineno"> 656</span> <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#a3a71e48b4ed287752b9d9d9f7086ec7d">CumulVar</a>(path[i + 1])-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#a62b340f6d1dde6a36560bd88a382ada7">Min</a>(), post_travel));</div>
|
|
<div class="line"><a id="l00657" name="l00657"></a><span class="lineno"> 657</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>.push_back(</div>
|
|
<div class="line"><a id="l00658" name="l00658"></a><span class="lineno"> 658</span> <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#a3a71e48b4ed287752b9d9d9f7086ec7d">CumulVar</a>(path[i + 1])-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#ac84c250d67f30c89e845cd460eeaaad8">Max</a>(), post_travel));</div>
|
|
<div class="line"><a id="l00659" name="l00659"></a><span class="lineno"> 659</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>.push_back(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a id="l00660" name="l00660"></a><span class="lineno"> 660</span> }</div>
|
|
<div class="line"><a id="l00661" name="l00661"></a><span class="lineno"> 661</span> }</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> </div>
|
|
<div class="line"><a id="l00664" name="l00664"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#ac694e4749fb4e5c7739d20b84de6c5ec"> 664</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research.html#ac694e4749fb4e5c7739d20b84de6c5ec">FillTravelBoundsOfVehicle</a>(<span class="keywordtype">int</span> vehicle, <span class="keyword">const</span> std::vector<int64_t>& path,</div>
|
|
<div class="line"><a id="l00665" name="l00665"></a><span class="lineno"> 665</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="l00666" name="l00666"></a><span class="lineno"> 666</span> <a class="code hl_struct" href="structoperations__research_1_1_travel_bounds.html">TravelBounds</a>* travel_bounds) {</div>
|
|
<div class="line"><a id="l00667" name="l00667"></a><span class="lineno"> 667</span> <span class="comment">// Fill path and min/max/pre/post travel bounds.</span></div>
|
|
<div class="line"><a id="l00668" name="l00668"></a><span class="lineno"> 668</span> <a class="code hl_function" href="namespaceoperations__research.html#aae315ffb47820060e3fa070260434118">FillPathEvaluation</a>(path, 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="l00669" name="l00669"></a><span class="lineno"> 669</span> &travel_bounds-><a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#aca8610bd0ccad69ab8284f40a468c7f0">min_travels</a>);</div>
|
|
<div class="line"><a id="l00670" name="l00670"></a><span class="lineno"> 670</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_travels = travel_bounds-><a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#aca8610bd0ccad69ab8284f40a468c7f0">min_travels</a>.size();</div>
|
|
<div class="line"><a id="l00671" name="l00671"></a><span class="lineno"> 671</span> travel_bounds-><a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a6fcbfd1ef4117ac735024d0835b48468">max_travels</a>.assign(num_travels,</div>
|
|
<div class="line"><a id="l00672" name="l00672"></a><span class="lineno"> 672</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="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="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = dimension.<a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a8e93e99ce491f2779c0d2e5e7de5a98a">GetPreTravelEvaluatorOfVehicle</a>(vehicle);</div>
|
|
<div class="line"><a id="l00675" name="l00675"></a><span class="lineno"> 675</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> == -1) {</div>
|
|
<div class="line"><a id="l00676" name="l00676"></a><span class="lineno"> 676</span> travel_bounds-><a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a9f757b787c617299a0beb531625a734f">pre_travels</a>.assign(num_travels, 0);</div>
|
|
<div class="line"><a id="l00677" name="l00677"></a><span class="lineno"> 677</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00678" name="l00678"></a><span class="lineno"> 678</span> <a class="code hl_function" href="namespaceoperations__research.html#aae315ffb47820060e3fa070260434118">FillPathEvaluation</a>(path, 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#a0ceffe3b4741e0075a7be69d5d539ec4">TransitCallback</a>(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>),</div>
|
|
<div class="line"><a id="l00679" name="l00679"></a><span class="lineno"> 679</span> &travel_bounds-><a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a9f757b787c617299a0beb531625a734f">pre_travels</a>);</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> {</div>
|
|
<div class="line"><a id="l00683" name="l00683"></a><span class="lineno"> 683</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = dimension.<a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#afb4c32e76561cad95bd8be2777d8f1ac">GetPostTravelEvaluatorOfVehicle</a>(vehicle);</div>
|
|
<div class="line"><a id="l00684" name="l00684"></a><span class="lineno"> 684</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> == -1) {</div>
|
|
<div class="line"><a id="l00685" name="l00685"></a><span class="lineno"> 685</span> travel_bounds-><a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a19ace84f03aa7a436d6e91c16caf6618">post_travels</a>.assign(num_travels, 0);</div>
|
|
<div class="line"><a id="l00686" name="l00686"></a><span class="lineno"> 686</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00687" name="l00687"></a><span class="lineno"> 687</span> <a class="code hl_function" href="namespaceoperations__research.html#aae315ffb47820060e3fa070260434118">FillPathEvaluation</a>(path, 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#a0ceffe3b4741e0075a7be69d5d539ec4">TransitCallback</a>(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>),</div>
|
|
<div class="line"><a id="l00688" name="l00688"></a><span class="lineno"> 688</span> &travel_bounds-><a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a19ace84f03aa7a436d6e91c16caf6618">post_travels</a>);</div>
|
|
<div class="line"><a id="l00689" name="l00689"></a><span class="lineno"> 689</span> }</div>
|
|
<div class="line"><a id="l00690" name="l00690"></a><span class="lineno"> 690</span> }</div>
|
|
<div class="line"><a id="l00691" name="l00691"></a><span class="lineno"> 691</span>}</div>
|
|
<div class="line"><a id="l00692" name="l00692"></a><span class="lineno"> 692</span> </div>
|
|
<div class="line"><a id="l00693" name="l00693"></a><span class="lineno"><a class="line" href="namespaceoperations__research.html#a6a8bc2370087a30d5a122524bafa867b"> 693</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research.html#a6a8bc2370087a30d5a122524bafa867b">AppendTasksFromIntervals</a>(<span class="keyword">const</span> std::vector<IntervalVar*>& intervals,</div>
|
|
<div class="line"><a id="l00694" name="l00694"></a><span class="lineno"> 694</span> <a class="code hl_struct" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">DisjunctivePropagator::Tasks</a>* tasks) {</div>
|
|
<div class="line"><a id="l00695" name="l00695"></a><span class="lineno"> 695</span> <span class="keywordflow">for</span> (<a class="code hl_class" href="classoperations__research_1_1_interval_var.html">IntervalVar</a>* <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> : intervals) {</div>
|
|
<div class="line"><a id="l00696" name="l00696"></a><span class="lineno"> 696</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>-><a class="code hl_function" href="classoperations__research_1_1_interval_var.html#a7f7f661e9b94f25f706732924e0f01e9">MustBePerformed</a>()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00697" name="l00697"></a><span class="lineno"> 697</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>.push_back(<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>-><a class="code hl_function" href="classoperations__research_1_1_interval_var.html#aa93a06dc97f33ccaefc7df90fb9b89d1">StartMin</a>());</div>
|
|
<div class="line"><a id="l00698" name="l00698"></a><span class="lineno"> 698</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>.push_back(<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>-><a class="code hl_function" href="classoperations__research_1_1_interval_var.html#af9f22c28d624c6efb78156365d35a690">StartMax</a>());</div>
|
|
<div class="line"><a id="l00699" name="l00699"></a><span class="lineno"> 699</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>.push_back(<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>-><a class="code hl_function" href="classoperations__research_1_1_interval_var.html#a4488d66b163b204a15eadeafcf4872f8">DurationMin</a>());</div>
|
|
<div class="line"><a id="l00700" name="l00700"></a><span class="lineno"> 700</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#abd7699021e5652feb514e0d68c973df2">duration_max</a>.push_back(<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>-><a class="code hl_function" href="classoperations__research_1_1_interval_var.html#a2e69397c7c1e71a796afa6a632ee8296">DurationMax</a>());</div>
|
|
<div class="line"><a id="l00701" name="l00701"></a><span class="lineno"> 701</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>.push_back(<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>-><a class="code hl_function" href="classoperations__research_1_1_interval_var.html#a9ae4b46f1aa6c51c0a5833d3531cd82c">EndMin</a>());</div>
|
|
<div class="line"><a id="l00702" name="l00702"></a><span class="lineno"> 702</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>.push_back(<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>-><a class="code hl_function" href="classoperations__research_1_1_interval_var.html#ae05142dd885524b06032bed1cbc63af0">EndMax</a>());</div>
|
|
<div class="line"><a id="l00703" name="l00703"></a><span class="lineno"> 703</span> tasks-><a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">is_preemptible</a>.push_back(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00704" name="l00704"></a><span class="lineno"> 704</span> }</div>
|
|
<div class="line"><a id="l00705" name="l00705"></a><span class="lineno"> 705</span>}</div>
|
|
<div class="line"><a id="l00706" name="l00706"></a><span class="lineno"> 706</span> </div>
|
|
<div class="line"><a id="l00707" name="l00707"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_vehicle_breaks_constraint.html#acb1ca5666c8795f29fc71c28d7bb0386"> 707</a></span><a class="code hl_function" href="classoperations__research_1_1_global_vehicle_breaks_constraint.html#acb1ca5666c8795f29fc71c28d7bb0386">GlobalVehicleBreaksConstraint::GlobalVehicleBreaksConstraint</a>(</div>
|
|
<div class="line"><a id="l00708" name="l00708"></a><span class="lineno"> 708</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="l00709" name="l00709"></a><span class="lineno"> 709</span> : <a class="code hl_class" href="classoperations__research_1_1_constraint.html">Constraint</a>(dimension-><a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()->solver()),</div>
|
|
<div class="line"><a id="l00710" name="l00710"></a><span class="lineno"> 710</span> model_(dimension-><a class="code hl_variable" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>()),</div>
|
|
<div class="line"><a id="l00711" name="l00711"></a><span class="lineno"> 711</span> dimension_(dimension) {</div>
|
|
<div class="line"><a id="l00712" name="l00712"></a><span class="lineno"> 712</span> vehicle_demons_.resize(model_-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>());</div>
|
|
<div class="line"><a id="l00713" name="l00713"></a><span class="lineno"> 713</span>}</div>
|
|
<div class="line"><a id="l00714" name="l00714"></a><span class="lineno"> 714</span> </div>
|
|
<div class="line"><a id="l00715" name="l00715"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_vehicle_breaks_constraint.html#a19d94d32f3bde30deeebb883c6f71f84"> 715</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_global_vehicle_breaks_constraint.html#a19d94d32f3bde30deeebb883c6f71f84">GlobalVehicleBreaksConstraint::Post</a>() {</div>
|
|
<div class="line"><a id="l00716" name="l00716"></a><span class="lineno"> 716</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < model_-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); vehicle++) {</div>
|
|
<div class="line"><a id="l00717" name="l00717"></a><span class="lineno"> 717</span> <span class="keywordflow">if</span> (dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle).empty() &&</div>
|
|
<div class="line"><a id="l00718" name="l00718"></a><span class="lineno"> 718</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="l00719" name="l00719"></a><span class="lineno"> 719</span> <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00720" name="l00720"></a><span class="lineno"> 720</span> }</div>
|
|
<div class="line"><a id="l00721" name="l00721"></a><span class="lineno"> 721</span> vehicle_demons_[vehicle] = <a class="code hl_function" href="namespaceoperations__research.html#ac316c82f31293db18e25c809592908dd">MakeDelayedConstraintDemon1</a>(</div>
|
|
<div class="line"><a id="l00722" name="l00722"></a><span class="lineno"> 722</span> <a class="code hl_function" href="classoperations__research_1_1_propagation_base_object.html#a0b526d33739114e9255ffbe8343efe1a">solver</a>(), <span class="keyword">this</span>, &GlobalVehicleBreaksConstraint::PropagateVehicle,</div>
|
|
<div class="line"><a id="l00723" name="l00723"></a><span class="lineno"> 723</span> <span class="stringliteral">"PropagateVehicle"</span>, vehicle);</div>
|
|
<div class="line"><a id="l00724" name="l00724"></a><span class="lineno"> 724</span> <span class="keywordflow">for</span> (<a class="code hl_class" href="classoperations__research_1_1_interval_var.html">IntervalVar</a>* <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> :</div>
|
|
<div class="line"><a id="l00725" name="l00725"></a><span class="lineno"> 725</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="l00726" name="l00726"></a><span class="lineno"> 726</span> <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->WhenAnything(vehicle_demons_[vehicle]);</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="keyword">const</span> <span class="keywordtype">int</span> num_cumuls = dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a2658bab0f635e3b399b100ecd6bc12cb">cumuls</a>().size();</div>
|
|
<div class="line"><a id="l00730" name="l00730"></a><span class="lineno"> 730</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_nexts = model_-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a911482cb7495f22638a02066adf13c8b">Nexts</a>().size();</div>
|
|
<div class="line"><a id="l00731" name="l00731"></a><span class="lineno"> 731</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = 0; node < num_cumuls; node++) {</div>
|
|
<div class="line"><a id="l00732" name="l00732"></a><span class="lineno"> 732</span> <a class="code hl_class" href="classoperations__research_1_1_demon.html">Demon</a>* dimension_demon = <a class="code hl_function" href="namespaceoperations__research.html#ae0190f4a9c848c207d0bff97f625fcd1">MakeConstraintDemon1</a>(</div>
|
|
<div class="line"><a id="l00733" name="l00733"></a><span class="lineno"> 733</span> <a class="code hl_function" href="classoperations__research_1_1_propagation_base_object.html#a0b526d33739114e9255ffbe8343efe1a">solver</a>(), <span class="keyword">this</span>, &GlobalVehicleBreaksConstraint::PropagateNode,</div>
|
|
<div class="line"><a id="l00734" name="l00734"></a><span class="lineno"> 734</span> <span class="stringliteral">"PropagateNode"</span>, node);</div>
|
|
<div class="line"><a id="l00735" name="l00735"></a><span class="lineno"> 735</span> <span class="keywordflow">if</span> (node < num_nexts) {</div>
|
|
<div class="line"><a id="l00736" name="l00736"></a><span class="lineno"> 736</span> model_-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a5e7fe0d056275b47eccc1b6bfce0b482">NextVar</a>(node)-><a class="code hl_function" href="classoperations__research_1_1_int_var.html#a6e33a313eaf507bae0eb7068455a5bdc">WhenBound</a>(dimension_demon);</div>
|
|
<div class="line"><a id="l00737" name="l00737"></a><span class="lineno"> 737</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a4232c22ddc9e65e726ee87cf27778072">SlackVar</a>(node)-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#af13b2ea301c6800bb6d43bd70716bf6d">WhenRange</a>(dimension_demon);</div>
|
|
<div class="line"><a id="l00738" name="l00738"></a><span class="lineno"> 738</span> }</div>
|
|
<div class="line"><a id="l00739" name="l00739"></a><span class="lineno"> 739</span> model_-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a43c00b1c44d7f5bec9287ce60fadef52">VehicleVar</a>(node)-><a class="code hl_function" href="classoperations__research_1_1_int_var.html#a6e33a313eaf507bae0eb7068455a5bdc">WhenBound</a>(dimension_demon);</div>
|
|
<div class="line"><a id="l00740" name="l00740"></a><span class="lineno"> 740</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a3a71e48b4ed287752b9d9d9f7086ec7d">CumulVar</a>(node)-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#af13b2ea301c6800bb6d43bd70716bf6d">WhenRange</a>(dimension_demon);</div>
|
|
<div class="line"><a id="l00741" name="l00741"></a><span class="lineno"> 741</span> }</div>
|
|
<div class="line"><a id="l00742" name="l00742"></a><span class="lineno"> 742</span>}</div>
|
|
<div class="line"><a id="l00743" name="l00743"></a><span class="lineno"> 743</span> </div>
|
|
<div class="line"><a id="l00744" name="l00744"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_global_vehicle_breaks_constraint.html#a36d844f2722273b190ed9a069dd25938"> 744</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1_global_vehicle_breaks_constraint.html#a36d844f2722273b190ed9a069dd25938">GlobalVehicleBreaksConstraint::InitialPropagate</a>() {</div>
|
|
<div class="line"><a id="l00745" name="l00745"></a><span class="lineno"> 745</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vehicle = 0; vehicle < model_-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">vehicles</a>(); vehicle++) {</div>
|
|
<div class="line"><a id="l00746" name="l00746"></a><span class="lineno"> 746</span> <span class="keywordflow">if</span> (!dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle).empty() ||</div>
|
|
<div class="line"><a id="l00747" name="l00747"></a><span class="lineno"> 747</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="l00748" name="l00748"></a><span class="lineno"> 748</span> PropagateVehicle(vehicle);</div>
|
|
<div class="line"><a id="l00749" name="l00749"></a><span class="lineno"> 749</span> }</div>
|
|
<div class="line"><a id="l00750" name="l00750"></a><span class="lineno"> 750</span> }</div>
|
|
<div class="line"><a id="l00751" name="l00751"></a><span class="lineno"> 751</span>}</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><span class="comment">// This dispatches node events to the right vehicle propagator.</span></div>
|
|
<div class="line"><a id="l00754" name="l00754"></a><span class="lineno"> 754</span><span class="comment">// It also filters out a part of uninteresting events, on which the vehicle</span></div>
|
|
<div class="line"><a id="l00755" name="l00755"></a><span class="lineno"> 755</span><span class="comment">// propagator will not find anything new.</span></div>
|
|
<div class="line"><a id="l00756" name="l00756"></a><span class="lineno"> 756</span><span class="keywordtype">void</span> GlobalVehicleBreaksConstraint::PropagateNode(<span class="keywordtype">int</span> node) {</div>
|
|
<div class="line"><a id="l00757" name="l00757"></a><span class="lineno"> 757</span> <span class="keywordflow">if</span> (!model_-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a43c00b1c44d7f5bec9287ce60fadef52">VehicleVar</a>(node)-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#a1d04569b37cb7fe6ed0956ab71e08bc9">Bound</a>()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00758" name="l00758"></a><span class="lineno"> 758</span> <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = model_-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a43c00b1c44d7f5bec9287ce60fadef52">VehicleVar</a>(node)-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#a62b340f6d1dde6a36560bd88a382ada7">Min</a>();</div>
|
|
<div class="line"><a id="l00759" name="l00759"></a><span class="lineno"> 759</span> <span class="keywordflow">if</span> (vehicle < 0 || vehicle_demons_[vehicle] == <span class="keyword">nullptr</span>) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00760" name="l00760"></a><span class="lineno"> 760</span> <a class="code hl_function" href="classoperations__research_1_1_propagation_base_object.html#a173cbf153462b14f9b57362d2c45638a">EnqueueDelayedDemon</a>(vehicle_demons_[vehicle]);</div>
|
|
<div class="line"><a id="l00761" name="l00761"></a><span class="lineno"> 761</span>}</div>
|
|
<div class="line"><a id="l00762" name="l00762"></a><span class="lineno"> 762</span> </div>
|
|
<div class="line"><a id="l00763" name="l00763"></a><span class="lineno"> 763</span><span class="keywordtype">void</span> GlobalVehicleBreaksConstraint::FillPartialPathOfVehicle(<span class="keywordtype">int</span> vehicle) {</div>
|
|
<div class="line"><a id="l00764" name="l00764"></a><span class="lineno"> 764</span> path_.clear();</div>
|
|
<div class="line"><a id="l00765" name="l00765"></a><span class="lineno"> 765</span> <span class="keywordtype">int</span> current = model_-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(vehicle);</div>
|
|
<div class="line"><a id="l00766" name="l00766"></a><span class="lineno"> 766</span> <span class="keywordflow">while</span> (!model_-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#acf67dc202e247ce193038850f71306d3">IsEnd</a>(current)) {</div>
|
|
<div class="line"><a id="l00767" name="l00767"></a><span class="lineno"> 767</span> path_.push_back(current);</div>
|
|
<div class="line"><a id="l00768" name="l00768"></a><span class="lineno"> 768</span> current = model_-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a5e7fe0d056275b47eccc1b6bfce0b482">NextVar</a>(current)-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#a1d04569b37cb7fe6ed0956ab71e08bc9">Bound</a>()</div>
|
|
<div class="line"><a id="l00769" name="l00769"></a><span class="lineno"> 769</span> ? model_-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a5e7fe0d056275b47eccc1b6bfce0b482">NextVar</a>(current)-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#a62b340f6d1dde6a36560bd88a382ada7">Min</a>()</div>
|
|
<div class="line"><a id="l00770" name="l00770"></a><span class="lineno"> 770</span> : model_-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#afb80fd36c1fb57d2db049403483e2074">End</a>(vehicle);</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> path_.push_back(current);</div>
|
|
<div class="line"><a id="l00773" name="l00773"></a><span class="lineno"> 773</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><span class="keywordtype">void</span> GlobalVehicleBreaksConstraint::FillPathTravels(</div>
|
|
<div class="line"><a id="l00776" name="l00776"></a><span class="lineno"> 776</span> <span class="keyword">const</span> std::vector<int64_t>& path) {</div>
|
|
<div class="line"><a id="l00777" name="l00777"></a><span class="lineno"> 777</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_travels = path.size() - 1;</div>
|
|
<div class="line"><a id="l00778" name="l00778"></a><span class="lineno"> 778</span> travel_bounds_.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#aca8610bd0ccad69ab8284f40a468c7f0">min_travels</a>.resize(num_travels);</div>
|
|
<div class="line"><a id="l00779" name="l00779"></a><span class="lineno"> 779</span> travel_bounds_.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a6fcbfd1ef4117ac735024d0835b48468">max_travels</a>.resize(num_travels);</div>
|
|
<div class="line"><a id="l00780" name="l00780"></a><span class="lineno"> 780</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_travels; ++i) {</div>
|
|
<div class="line"><a id="l00781" name="l00781"></a><span class="lineno"> 781</span> travel_bounds_.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#aca8610bd0ccad69ab8284f40a468c7f0">min_travels</a>[i] = dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a6b1c8b4920c3a49c761c652343d66501">FixedTransitVar</a>(path[i])-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#a62b340f6d1dde6a36560bd88a382ada7">Min</a>();</div>
|
|
<div class="line"><a id="l00782" name="l00782"></a><span class="lineno"> 782</span> travel_bounds_.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a6fcbfd1ef4117ac735024d0835b48468">max_travels</a>[i] = dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a6b1c8b4920c3a49c761c652343d66501">FixedTransitVar</a>(path[i])-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#ac84c250d67f30c89e845cd460eeaaad8">Max</a>();</div>
|
|
<div class="line"><a id="l00783" name="l00783"></a><span class="lineno"> 783</span> }</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> </div>
|
|
<div class="line"><a id="l00786" name="l00786"></a><span class="lineno"> 786</span><span class="comment">// First, perform energy-based reasoning on intervals and cumul variables.</span></div>
|
|
<div class="line"><a id="l00787" name="l00787"></a><span class="lineno"> 787</span><span class="comment">// Then, perform reasoning on slack variables.</span></div>
|
|
<div class="line"><a id="l00788" name="l00788"></a><span class="lineno"> 788</span><span class="keywordtype">void</span> GlobalVehicleBreaksConstraint::PropagateVehicle(<span class="keywordtype">int</span> vehicle) {</div>
|
|
<div class="line"><a id="l00789" name="l00789"></a><span class="lineno"> 789</span> <span class="comment">// Fill path and pre/post travel information.</span></div>
|
|
<div class="line"><a id="l00790" name="l00790"></a><span class="lineno"> 790</span> FillPartialPathOfVehicle(vehicle);</div>
|
|
<div class="line"><a id="l00791" name="l00791"></a><span class="lineno"> 791</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_nodes = path_.size();</div>
|
|
<div class="line"><a id="l00792" name="l00792"></a><span class="lineno"> 792</span> FillPathTravels(path_);</div>
|
|
<div class="line"><a id="l00793" name="l00793"></a><span class="lineno"> 793</span> {</div>
|
|
<div class="line"><a id="l00794" name="l00794"></a><span class="lineno"> 794</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a8e93e99ce491f2779c0d2e5e7de5a98a">GetPreTravelEvaluatorOfVehicle</a>(vehicle);</div>
|
|
<div class="line"><a id="l00795" name="l00795"></a><span class="lineno"> 795</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> == -1) {</div>
|
|
<div class="line"><a id="l00796" name="l00796"></a><span class="lineno"> 796</span> travel_bounds_.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a9f757b787c617299a0beb531625a734f">pre_travels</a>.assign(num_nodes - 1, 0);</div>
|
|
<div class="line"><a id="l00797" name="l00797"></a><span class="lineno"> 797</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00798" name="l00798"></a><span class="lineno"> 798</span> <a class="code hl_function" href="namespaceoperations__research.html#aae315ffb47820060e3fa070260434118">FillPathEvaluation</a>(path_, model_-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a0ceffe3b4741e0075a7be69d5d539ec4">TransitCallback</a>(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>),</div>
|
|
<div class="line"><a id="l00799" name="l00799"></a><span class="lineno"> 799</span> &travel_bounds_.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a9f757b787c617299a0beb531625a734f">pre_travels</a>);</div>
|
|
<div class="line"><a id="l00800" name="l00800"></a><span class="lineno"> 800</span> }</div>
|
|
<div class="line"><a id="l00801" name="l00801"></a><span class="lineno"> 801</span> }</div>
|
|
<div class="line"><a id="l00802" name="l00802"></a><span class="lineno"> 802</span> {</div>
|
|
<div class="line"><a id="l00803" name="l00803"></a><span class="lineno"> 803</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#afb4c32e76561cad95bd8be2777d8f1ac">GetPostTravelEvaluatorOfVehicle</a>(vehicle);</div>
|
|
<div class="line"><a id="l00804" name="l00804"></a><span class="lineno"> 804</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> == -1) {</div>
|
|
<div class="line"><a id="l00805" name="l00805"></a><span class="lineno"> 805</span> travel_bounds_.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a19ace84f03aa7a436d6e91c16caf6618">post_travels</a>.assign(num_nodes - 1, 0);</div>
|
|
<div class="line"><a id="l00806" name="l00806"></a><span class="lineno"> 806</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00807" name="l00807"></a><span class="lineno"> 807</span> <a class="code hl_function" href="namespaceoperations__research.html#aae315ffb47820060e3fa070260434118">FillPathEvaluation</a>(path_, model_-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a0ceffe3b4741e0075a7be69d5d539ec4">TransitCallback</a>(<a class="code hl_variable" href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>),</div>
|
|
<div class="line"><a id="l00808" name="l00808"></a><span class="lineno"> 808</span> &travel_bounds_.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a19ace84f03aa7a436d6e91c16caf6618">post_travels</a>);</div>
|
|
<div class="line"><a id="l00809" name="l00809"></a><span class="lineno"> 809</span> }</div>
|
|
<div class="line"><a id="l00810" name="l00810"></a><span class="lineno"> 810</span> }</div>
|
|
<div class="line"><a id="l00811" name="l00811"></a><span class="lineno"> 811</span> <span class="comment">// The last travel might not be fixed: in that case, relax its information.</span></div>
|
|
<div class="line"><a id="l00812" name="l00812"></a><span class="lineno"> 812</span> <span class="keywordflow">if</span> (!model_-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a5e7fe0d056275b47eccc1b6bfce0b482">NextVar</a>(path_[num_nodes - 2])-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#a1d04569b37cb7fe6ed0956ab71e08bc9">Bound</a>()) {</div>
|
|
<div class="line"><a id="l00813" name="l00813"></a><span class="lineno"> 813</span> travel_bounds_.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#aca8610bd0ccad69ab8284f40a468c7f0">min_travels</a>.back() = 0;</div>
|
|
<div class="line"><a id="l00814" name="l00814"></a><span class="lineno"> 814</span> travel_bounds_.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a6fcbfd1ef4117ac735024d0835b48468">max_travels</a>.back() = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div>
|
|
<div class="line"><a id="l00815" name="l00815"></a><span class="lineno"> 815</span> travel_bounds_.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a9f757b787c617299a0beb531625a734f">pre_travels</a>.back() = 0;</div>
|
|
<div class="line"><a id="l00816" name="l00816"></a><span class="lineno"> 816</span> travel_bounds_.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a19ace84f03aa7a436d6e91c16caf6618">post_travels</a>.back() = 0;</div>
|
|
<div class="line"><a id="l00817" name="l00817"></a><span class="lineno"> 817</span> }</div>
|
|
<div class="line"><a id="l00818" name="l00818"></a><span class="lineno"> 818</span> </div>
|
|
<div class="line"><a id="l00819" name="l00819"></a><span class="lineno"> 819</span> <span class="comment">// Fill tasks from path, break intervals, and break constraints.</span></div>
|
|
<div class="line"><a id="l00820" name="l00820"></a><span class="lineno"> 820</span> tasks_.<a class="code hl_function" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
|
|
<div class="line"><a id="l00821" name="l00821"></a><span class="lineno"> 821</span> <a class="code hl_function" href="namespaceoperations__research.html#aa3db12120fcb6529cf2860fac7ef37bd">AppendTasksFromPath</a>(path_, travel_bounds_, *dimension_, &tasks_);</div>
|
|
<div class="line"><a id="l00822" name="l00822"></a><span class="lineno"> 822</span> tasks_.<a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">num_chain_tasks</a> = tasks_.<a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>.size();</div>
|
|
<div class="line"><a id="l00823" name="l00823"></a><span class="lineno"> 823</span> <a class="code hl_function" href="namespaceoperations__research.html#a6a8bc2370087a30d5a122524bafa867b">AppendTasksFromIntervals</a>(dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle),</div>
|
|
<div class="line"><a id="l00824" name="l00824"></a><span class="lineno"> 824</span> &tasks_);</div>
|
|
<div class="line"><a id="l00825" name="l00825"></a><span class="lineno"> 825</span> tasks_.<a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a10679034cef02c42959f43b6d3db9aba">distance_duration</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#aeb48e0a259af538f591d9f843c113d00">GetBreakDistanceDurationOfVehicle</a>(vehicle);</div>
|
|
<div class="line"><a id="l00827" name="l00827"></a><span class="lineno"> 827</span> </div>
|
|
<div class="line"><a id="l00828" name="l00828"></a><span class="lineno"> 828</span> <span class="comment">// Do the actual reasoning, no need to continue if infeasible.</span></div>
|
|
<div class="line"><a id="l00829" name="l00829"></a><span class="lineno"> 829</span> <span class="keywordflow">if</span> (!disjunctive_propagator_.<a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#a8a31c563d28e1ebe7c9e140f15fea586">Propagate</a>(&tasks_)) <a class="code hl_function" href="classoperations__research_1_1_propagation_base_object.html#a0b526d33739114e9255ffbe8343efe1a">solver</a>()-><a class="code hl_function" href="classoperations__research_1_1_solver.html#aeb92d4addb41255c9732cacfcb54f795">Fail</a>();</div>
|
|
<div class="line"><a id="l00830" name="l00830"></a><span class="lineno"> 830</span> </div>
|
|
<div class="line"><a id="l00831" name="l00831"></a><span class="lineno"> 831</span> <span class="comment">// Make task translators to help set new bounds of CP variables.</span></div>
|
|
<div class="line"><a id="l00832" name="l00832"></a><span class="lineno"> 832</span> task_translators_.clear();</div>
|
|
<div class="line"><a id="l00833" name="l00833"></a><span class="lineno"> 833</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_nodes; ++i) {</div>
|
|
<div class="line"><a id="l00834" name="l00834"></a><span class="lineno"> 834</span> <span class="keyword">const</span> int64_t before_visit =</div>
|
|
<div class="line"><a id="l00835" name="l00835"></a><span class="lineno"> 835</span> (i == 0) ? 0 : travel_bounds_.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a19ace84f03aa7a436d6e91c16caf6618">post_travels</a>[i - 1];</div>
|
|
<div class="line"><a id="l00836" name="l00836"></a><span class="lineno"> 836</span> <span class="keyword">const</span> int64_t after_visit =</div>
|
|
<div class="line"><a id="l00837" name="l00837"></a><span class="lineno"> 837</span> (i == num_nodes - 1) ? 0 : travel_bounds_.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a9f757b787c617299a0beb531625a734f">pre_travels</a>[i];</div>
|
|
<div class="line"><a id="l00838" name="l00838"></a><span class="lineno"> 838</span> task_translators_.emplace_back(dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a3a71e48b4ed287752b9d9d9f7086ec7d">CumulVar</a>(path_[i]), before_visit,</div>
|
|
<div class="line"><a id="l00839" name="l00839"></a><span class="lineno"> 839</span> after_visit);</div>
|
|
<div class="line"><a id="l00840" name="l00840"></a><span class="lineno"> 840</span> <span class="keywordflow">if</span> (i == num_nodes - 1) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00841" name="l00841"></a><span class="lineno"> 841</span> task_translators_.emplace_back(); <span class="comment">// Dummy translator for travel tasks.</span></div>
|
|
<div class="line"><a id="l00842" name="l00842"></a><span class="lineno"> 842</span> }</div>
|
|
<div class="line"><a id="l00843" name="l00843"></a><span class="lineno"> 843</span> <span class="keywordflow">for</span> (IntervalVar* <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> :</div>
|
|
<div class="line"><a id="l00844" name="l00844"></a><span class="lineno"> 844</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="l00845" name="l00845"></a><span class="lineno"> 845</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MustBePerformed()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00846" name="l00846"></a><span class="lineno"> 846</span> task_translators_.emplace_back(<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>);</div>
|
|
<div class="line"><a id="l00847" name="l00847"></a><span class="lineno"> 847</span> }</div>
|
|
<div class="line"><a id="l00848" name="l00848"></a><span class="lineno"> 848</span> </div>
|
|
<div class="line"><a id="l00849" name="l00849"></a><span class="lineno"> 849</span> <span class="comment">// Push new bounds to CP variables.</span></div>
|
|
<div class="line"><a id="l00850" name="l00850"></a><span class="lineno"> 850</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = tasks_.<a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>.size();</div>
|
|
<div class="line"><a id="l00851" name="l00851"></a><span class="lineno"> 851</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> task = 0; task < num_tasks; ++task) {</div>
|
|
<div class="line"><a id="l00852" name="l00852"></a><span class="lineno"> 852</span> task_translators_[task].SetStartMin(tasks_.<a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">start_min</a>[task]);</div>
|
|
<div class="line"><a id="l00853" name="l00853"></a><span class="lineno"> 853</span> task_translators_[task].SetStartMax(tasks_.<a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">start_max</a>[task]);</div>
|
|
<div class="line"><a id="l00854" name="l00854"></a><span class="lineno"> 854</span> task_translators_[task].SetDurationMin(tasks_.<a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">duration_min</a>[task]);</div>
|
|
<div class="line"><a id="l00855" name="l00855"></a><span class="lineno"> 855</span> task_translators_[task].SetEndMin(tasks_.<a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">end_min</a>[task]);</div>
|
|
<div class="line"><a id="l00856" name="l00856"></a><span class="lineno"> 856</span> task_translators_[task].SetEndMax(tasks_.<a class="code hl_variable" href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">end_max</a>[task]);</div>
|
|
<div class="line"><a id="l00857" name="l00857"></a><span class="lineno"> 857</span> }</div>
|
|
<div class="line"><a id="l00858" name="l00858"></a><span class="lineno"> 858</span> </div>
|
|
<div class="line"><a id="l00859" name="l00859"></a><span class="lineno"> 859</span> <span class="comment">// Reasoning on slack variables: when intervals must be inside an arc,</span></div>
|
|
<div class="line"><a id="l00860" name="l00860"></a><span class="lineno"> 860</span> <span class="comment">// that arc's slack must be large enough to accommodate for those.</span></div>
|
|
<div class="line"><a id="l00861" name="l00861"></a><span class="lineno"> 861</span> <span class="comment">// TODO(user): Make a version more efficient than O(n^2).</span></div>
|
|
<div class="line"><a id="l00862" name="l00862"></a><span class="lineno"> 862</span> <span class="keywordflow">if</span> (dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle).empty()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00863" name="l00863"></a><span class="lineno"> 863</span> <span class="comment">// If the last arc of the path was not bound, do not change slack.</span></div>
|
|
<div class="line"><a id="l00864" name="l00864"></a><span class="lineno"> 864</span> <span class="keyword">const</span> int64_t last_bound_arc =</div>
|
|
<div class="line"><a id="l00865" name="l00865"></a><span class="lineno"> 865</span> num_nodes - 2 - (model_-><a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a5e7fe0d056275b47eccc1b6bfce0b482">NextVar</a>(path_[num_nodes - 2])-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#a1d04569b37cb7fe6ed0956ab71e08bc9">Bound</a>() ? 0 : 1);</div>
|
|
<div class="line"><a id="l00866" name="l00866"></a><span class="lineno"> 866</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i <= last_bound_arc; ++i) {</div>
|
|
<div class="line"><a id="l00867" name="l00867"></a><span class="lineno"> 867</span> <span class="keyword">const</span> int64_t arc_start_max =</div>
|
|
<div class="line"><a id="l00868" name="l00868"></a><span class="lineno"> 868</span> <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#a3a71e48b4ed287752b9d9d9f7086ec7d">CumulVar</a>(path_[i])-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#ac84c250d67f30c89e845cd460eeaaad8">Max</a>(),</div>
|
|
<div class="line"><a id="l00869" name="l00869"></a><span class="lineno"> 869</span> i > 0 ? travel_bounds_.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a19ace84f03aa7a436d6e91c16caf6618">post_travels</a>[i - 1] : 0);</div>
|
|
<div class="line"><a id="l00870" name="l00870"></a><span class="lineno"> 870</span> <span class="keyword">const</span> int64_t arc_end_min =</div>
|
|
<div class="line"><a id="l00871" name="l00871"></a><span class="lineno"> 871</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a3a71e48b4ed287752b9d9d9f7086ec7d">CumulVar</a>(path_[i + 1])-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#a62b340f6d1dde6a36560bd88a382ada7">Min</a>(),</div>
|
|
<div class="line"><a id="l00872" name="l00872"></a><span class="lineno"> 872</span> i < num_nodes - 2 ? travel_bounds_.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a9f757b787c617299a0beb531625a734f">pre_travels</a>[i + 1] : 0);</div>
|
|
<div class="line"><a id="l00873" name="l00873"></a><span class="lineno"> 873</span> int64_t total_break_inside_arc = 0;</div>
|
|
<div class="line"><a id="l00874" name="l00874"></a><span class="lineno"> 874</span> <span class="keywordflow">for</span> (IntervalVar* <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> :</div>
|
|
<div class="line"><a id="l00875" name="l00875"></a><span class="lineno"> 875</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="l00876" name="l00876"></a><span class="lineno"> 876</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MustBePerformed()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00877" name="l00877"></a><span class="lineno"> 877</span> <span class="keyword">const</span> int64_t interval_start_max = <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMax();</div>
|
|
<div class="line"><a id="l00878" name="l00878"></a><span class="lineno"> 878</span> <span class="keyword">const</span> int64_t interval_end_min = <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->EndMin();</div>
|
|
<div class="line"><a id="l00879" name="l00879"></a><span class="lineno"> 879</span> <span class="keyword">const</span> int64_t interval_duration_min = <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->DurationMin();</div>
|
|
<div class="line"><a id="l00880" name="l00880"></a><span class="lineno"> 880</span> <span class="comment">// If interval cannot end before the arc's from node and</span></div>
|
|
<div class="line"><a id="l00881" name="l00881"></a><span class="lineno"> 881</span> <span class="comment">// cannot start after the 'to' node, then it must be inside the arc.</span></div>
|
|
<div class="line"><a id="l00882" name="l00882"></a><span class="lineno"> 882</span> <span class="keywordflow">if</span> (arc_start_max < interval_end_min &&</div>
|
|
<div class="line"><a id="l00883" name="l00883"></a><span class="lineno"> 883</span> interval_start_max < arc_end_min) {</div>
|
|
<div class="line"><a id="l00884" name="l00884"></a><span class="lineno"> 884</span> total_break_inside_arc += interval_duration_min;</div>
|
|
<div class="line"><a id="l00885" name="l00885"></a><span class="lineno"> 885</span> }</div>
|
|
<div class="line"><a id="l00886" name="l00886"></a><span class="lineno"> 886</span> }</div>
|
|
<div class="line"><a id="l00887" name="l00887"></a><span class="lineno"> 887</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a4232c22ddc9e65e726ee87cf27778072">SlackVar</a>(path_[i])-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#aac7dfcb9ef06cc889474d5043b580a45">SetMin</a>(total_break_inside_arc);</div>
|
|
<div class="line"><a id="l00888" name="l00888"></a><span class="lineno"> 888</span> }</div>
|
|
<div class="line"><a id="l00889" name="l00889"></a><span class="lineno"> 889</span> <span class="comment">// Reasoning on optional intervals.</span></div>
|
|
<div class="line"><a id="l00890" name="l00890"></a><span class="lineno"> 890</span> <span class="comment">// TODO(user): merge this with energy-based reasoning.</span></div>
|
|
<div class="line"><a id="l00891" name="l00891"></a><span class="lineno"> 891</span> <span class="comment">// If there is no optional interval, skip the rest of this function.</span></div>
|
|
<div class="line"><a id="l00892" name="l00892"></a><span class="lineno"> 892</span> {</div>
|
|
<div class="line"><a id="l00893" name="l00893"></a><span class="lineno"> 893</span> <span class="keywordtype">bool</span> has_optional = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00894" name="l00894"></a><span class="lineno"> 894</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="l00895" name="l00895"></a><span class="lineno"> 895</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="l00896" name="l00896"></a><span class="lineno"> 896</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MayBePerformed() && !<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MustBePerformed()) {</div>
|
|
<div class="line"><a id="l00897" name="l00897"></a><span class="lineno"> 897</span> has_optional = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00898" name="l00898"></a><span class="lineno"> 898</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00899" name="l00899"></a><span class="lineno"> 899</span> }</div>
|
|
<div class="line"><a id="l00900" name="l00900"></a><span class="lineno"> 900</span> }</div>
|
|
<div class="line"><a id="l00901" name="l00901"></a><span class="lineno"> 901</span> <span class="keywordflow">if</span> (!has_optional) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00902" name="l00902"></a><span class="lineno"> 902</span> }</div>
|
|
<div class="line"><a id="l00903" name="l00903"></a><span class="lineno"> 903</span> <span class="keyword">const</span> std::vector<IntervalVar*>& break_intervals =</div>
|
|
<div class="line"><a id="l00904" name="l00904"></a><span class="lineno"> 904</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="l00905" name="l00905"></a><span class="lineno"> 905</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> pos = 0; pos < num_nodes - 1; ++pos) {</div>
|
|
<div class="line"><a id="l00906" name="l00906"></a><span class="lineno"> 906</span> <span class="keyword">const</span> int64_t current_slack_max = 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="l00907" name="l00907"></a><span class="lineno"> 907</span> <span class="keyword">const</span> int64_t visit_start_offset =</div>
|
|
<div class="line"><a id="l00908" name="l00908"></a><span class="lineno"> 908</span> pos > 0 ? travel_bounds_.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a19ace84f03aa7a436d6e91c16caf6618">post_travels</a>[pos - 1] : 0;</div>
|
|
<div class="line"><a id="l00909" name="l00909"></a><span class="lineno"> 909</span> <span class="keyword">const</span> int64_t visit_start_max =</div>
|
|
<div class="line"><a id="l00910" name="l00910"></a><span class="lineno"> 910</span> <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#a3a71e48b4ed287752b9d9d9f7086ec7d">CumulVar</a>(path_[pos])-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#ac84c250d67f30c89e845cd460eeaaad8">Max</a>(), visit_start_offset);</div>
|
|
<div class="line"><a id="l00911" name="l00911"></a><span class="lineno"> 911</span> <span class="keyword">const</span> int64_t visit_end_offset =</div>
|
|
<div class="line"><a id="l00912" name="l00912"></a><span class="lineno"> 912</span> (pos < num_nodes - 1) ? travel_bounds_.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a9f757b787c617299a0beb531625a734f">pre_travels</a>[pos] : 0;</div>
|
|
<div class="line"><a id="l00913" name="l00913"></a><span class="lineno"> 913</span> <span class="keyword">const</span> int64_t visit_end_min =</div>
|
|
<div class="line"><a id="l00914" name="l00914"></a><span class="lineno"> 914</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a3a71e48b4ed287752b9d9d9f7086ec7d">CumulVar</a>(path_[pos])-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#a62b340f6d1dde6a36560bd88a382ada7">Min</a>(), visit_end_offset);</div>
|
|
<div class="line"><a id="l00915" name="l00915"></a><span class="lineno"> 915</span> </div>
|
|
<div class="line"><a id="l00916" name="l00916"></a><span class="lineno"> 916</span> <span class="keywordflow">for</span> (IntervalVar* <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> : break_intervals) {</div>
|
|
<div class="line"><a id="l00917" name="l00917"></a><span class="lineno"> 917</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MayBePerformed()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a id="l00918" name="l00918"></a><span class="lineno"> 918</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> interval_is_performed = <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MustBePerformed();</div>
|
|
<div class="line"><a id="l00919" name="l00919"></a><span class="lineno"> 919</span> <span class="keyword">const</span> int64_t interval_start_max = <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMax();</div>
|
|
<div class="line"><a id="l00920" name="l00920"></a><span class="lineno"> 920</span> <span class="keyword">const</span> int64_t interval_end_min = <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->EndMin();</div>
|
|
<div class="line"><a id="l00921" name="l00921"></a><span class="lineno"> 921</span> <span class="keyword">const</span> int64_t interval_duration_min = <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->DurationMin();</div>
|
|
<div class="line"><a id="l00922" name="l00922"></a><span class="lineno"> 922</span> <span class="comment">// When interval cannot fit inside current arc,</span></div>
|
|
<div class="line"><a id="l00923" name="l00923"></a><span class="lineno"> 923</span> <span class="comment">// do disjunctive reasoning on full arc.</span></div>
|
|
<div class="line"><a id="l00924" name="l00924"></a><span class="lineno"> 924</span> <span class="keywordflow">if</span> (pos < num_nodes - 1 && interval_duration_min > current_slack_max) {</div>
|
|
<div class="line"><a id="l00925" name="l00925"></a><span class="lineno"> 925</span> <span class="comment">// The arc lasts from CumulVar(path_[pos]) - post_travel_[pos] to</span></div>
|
|
<div class="line"><a id="l00926" name="l00926"></a><span class="lineno"> 926</span> <span class="comment">// CumulVar(path_[pos+1]) + pre_travel_[pos+1].</span></div>
|
|
<div class="line"><a id="l00927" name="l00927"></a><span class="lineno"> 927</span> <span class="keyword">const</span> int64_t arc_start_offset =</div>
|
|
<div class="line"><a id="l00928" name="l00928"></a><span class="lineno"> 928</span> pos > 0 ? travel_bounds_.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a19ace84f03aa7a436d6e91c16caf6618">post_travels</a>[pos - 1] : 0;</div>
|
|
<div class="line"><a id="l00929" name="l00929"></a><span class="lineno"> 929</span> <span class="keyword">const</span> int64_t arc_start_max = visit_start_max;</div>
|
|
<div class="line"><a id="l00930" name="l00930"></a><span class="lineno"> 930</span> <span class="keyword">const</span> int64_t arc_end_offset =</div>
|
|
<div class="line"><a id="l00931" name="l00931"></a><span class="lineno"> 931</span> (pos < num_nodes - 2) ? travel_bounds_.<a class="code hl_variable" href="structoperations__research_1_1_travel_bounds.html#a9f757b787c617299a0beb531625a734f">pre_travels</a>[pos + 1] : 0;</div>
|
|
<div class="line"><a id="l00932" name="l00932"></a><span class="lineno"> 932</span> <span class="keyword">const</span> int64_t arc_end_min =</div>
|
|
<div class="line"><a id="l00933" name="l00933"></a><span class="lineno"> 933</span> <a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a3a71e48b4ed287752b9d9d9f7086ec7d">CumulVar</a>(path_[pos + 1])-><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#a62b340f6d1dde6a36560bd88a382ada7">Min</a>(), arc_end_offset);</div>
|
|
<div class="line"><a id="l00934" name="l00934"></a><span class="lineno"> 934</span> <span class="comment">// Interval not before.</span></div>
|
|
<div class="line"><a id="l00935" name="l00935"></a><span class="lineno"> 935</span> <span class="keywordflow">if</span> (arc_start_max < interval_end_min) {</div>
|
|
<div class="line"><a id="l00936" name="l00936"></a><span class="lineno"> 936</span> <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->SetStartMin(arc_end_min);</div>
|
|
<div class="line"><a id="l00937" name="l00937"></a><span class="lineno"> 937</span> <span class="keywordflow">if</span> (interval_is_performed) {</div>
|
|
<div class="line"><a id="l00938" name="l00938"></a><span class="lineno"> 938</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a3a71e48b4ed287752b9d9d9f7086ec7d">CumulVar</a>(path_[pos + 1])</div>
|
|
<div class="line"><a id="l00939" name="l00939"></a><span class="lineno"> 939</span> -><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#a67b97db6268b823e295b9d5284e5a03e">SetMax</a>(<a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(interval_start_max, arc_end_offset));</div>
|
|
<div class="line"><a id="l00940" name="l00940"></a><span class="lineno"> 940</span> }</div>
|
|
<div class="line"><a id="l00941" name="l00941"></a><span class="lineno"> 941</span> }</div>
|
|
<div class="line"><a id="l00942" name="l00942"></a><span class="lineno"> 942</span> <span class="comment">// Interval not after.</span></div>
|
|
<div class="line"><a id="l00943" name="l00943"></a><span class="lineno"> 943</span> <span class="keywordflow">if</span> (interval_start_max < arc_end_min) {</div>
|
|
<div class="line"><a id="l00944" name="l00944"></a><span class="lineno"> 944</span> <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->SetEndMax(arc_start_max);</div>
|
|
<div class="line"><a id="l00945" name="l00945"></a><span class="lineno"> 945</span> <span class="keywordflow">if</span> (interval_is_performed) {</div>
|
|
<div class="line"><a id="l00946" name="l00946"></a><span class="lineno"> 946</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a3a71e48b4ed287752b9d9d9f7086ec7d">CumulVar</a>(path_[pos])</div>
|
|
<div class="line"><a id="l00947" name="l00947"></a><span class="lineno"> 947</span> -><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#aac7dfcb9ef06cc889474d5043b580a45">SetMin</a>(<a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(interval_end_min, arc_start_offset));</div>
|
|
<div class="line"><a id="l00948" name="l00948"></a><span class="lineno"> 948</span> }</div>
|
|
<div class="line"><a id="l00949" name="l00949"></a><span class="lineno"> 949</span> }</div>
|
|
<div class="line"><a id="l00950" name="l00950"></a><span class="lineno"> 950</span> <span class="keywordflow">continue</span>;</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">// Interval could fit inside arc: do disjunctive reasoning between</span></div>
|
|
<div class="line"><a id="l00953" name="l00953"></a><span class="lineno"> 953</span> <span class="comment">// interval and visit.</span></div>
|
|
<div class="line"><a id="l00954" name="l00954"></a><span class="lineno"> 954</span> <span class="comment">// Interval not before.</span></div>
|
|
<div class="line"><a id="l00955" name="l00955"></a><span class="lineno"> 955</span> <span class="keywordflow">if</span> (visit_start_max < interval_end_min) {</div>
|
|
<div class="line"><a id="l00956" name="l00956"></a><span class="lineno"> 956</span> <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->SetStartMin(visit_end_min);</div>
|
|
<div class="line"><a id="l00957" name="l00957"></a><span class="lineno"> 957</span> <span class="keywordflow">if</span> (interval_is_performed) {</div>
|
|
<div class="line"><a id="l00958" name="l00958"></a><span class="lineno"> 958</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a3a71e48b4ed287752b9d9d9f7086ec7d">CumulVar</a>(path_[pos])</div>
|
|
<div class="line"><a id="l00959" name="l00959"></a><span class="lineno"> 959</span> -><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#a67b97db6268b823e295b9d5284e5a03e">SetMax</a>(<a class="code hl_function" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(interval_start_max, visit_end_offset));</div>
|
|
<div class="line"><a id="l00960" name="l00960"></a><span class="lineno"> 960</span> }</div>
|
|
<div class="line"><a id="l00961" name="l00961"></a><span class="lineno"> 961</span> }</div>
|
|
<div class="line"><a id="l00962" name="l00962"></a><span class="lineno"> 962</span> <span class="comment">// Interval not after.</span></div>
|
|
<div class="line"><a id="l00963" name="l00963"></a><span class="lineno"> 963</span> <span class="keywordflow">if</span> (interval_start_max < visit_end_min) {</div>
|
|
<div class="line"><a id="l00964" name="l00964"></a><span class="lineno"> 964</span> <a class="code hl_variable" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->SetEndMax(visit_start_max);</div>
|
|
<div class="line"><a id="l00965" name="l00965"></a><span class="lineno"> 965</span> <span class="keywordflow">if</span> (interval_is_performed) {</div>
|
|
<div class="line"><a id="l00966" name="l00966"></a><span class="lineno"> 966</span> dimension_-><a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a3a71e48b4ed287752b9d9d9f7086ec7d">CumulVar</a>(path_[pos])</div>
|
|
<div class="line"><a id="l00967" name="l00967"></a><span class="lineno"> 967</span> -><a class="code hl_function" href="classoperations__research_1_1_int_expr.html#aac7dfcb9ef06cc889474d5043b580a45">SetMin</a>(<a class="code hl_function" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(interval_end_min, visit_start_offset));</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> }</div>
|
|
<div class="line"><a id="l00970" name="l00970"></a><span class="lineno"> 970</span> }</div>
|
|
<div class="line"><a id="l00971" name="l00971"></a><span class="lineno"> 971</span> }</div>
|
|
<div class="line"><a id="l00972" name="l00972"></a><span class="lineno"> 972</span>}</div>
|
|
<div class="line"><a id="l00973" name="l00973"></a><span class="lineno"> 973</span> </div>
|
|
<div class="line"><a id="l00974" name="l00974"></a><span class="lineno"> 974</span><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l00975" name="l00975"></a><span class="lineno"> 975</span><span class="keyword">class </span>VehicleBreaksFilter : <span class="keyword">public</span> BasePathFilter {</div>
|
|
<div class="line"><a id="l00976" name="l00976"></a><span class="lineno"> 976</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00977" name="l00977"></a><span class="lineno"> 977</span> VehicleBreaksFilter(<span class="keyword">const</span> RoutingModel& routing_model,</div>
|
|
<div class="line"><a id="l00978" name="l00978"></a><span class="lineno"> 978</span> <span class="keyword">const</span> RoutingDimension& dimension);</div>
|
|
<div class="line"><a id="l00979" name="l00979"></a><span class="lineno"> 979</span> std::string DebugString()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> <span class="stringliteral">"VehicleBreaksFilter"</span>; }</div>
|
|
<div class="line"><a id="l00980" name="l00980"></a><span class="lineno"> 980</span> <span class="keywordtype">bool</span> AcceptPath(int64_t path_start, int64_t chain_start,</div>
|
|
<div class="line"><a id="l00981" name="l00981"></a><span class="lineno"> 981</span> int64_t chain_end) <span class="keyword">override</span>;</div>
|
|
<div class="line"><a id="l00982" name="l00982"></a><span class="lineno"> 982</span> </div>
|
|
<div class="line"><a id="l00983" name="l00983"></a><span class="lineno"> 983</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00984" name="l00984"></a><span class="lineno"> 984</span> <span class="comment">// Fills path_ with the path of vehicle, start to end.</span></div>
|
|
<div class="line"><a id="l00985" name="l00985"></a><span class="lineno"> 985</span> <span class="keywordtype">void</span> FillPathOfVehicle(int64_t vehicle);</div>
|
|
<div class="line"><a id="l00986" name="l00986"></a><span class="lineno"> 986</span> std::vector<int64_t> path_;</div>
|
|
<div class="line"><a id="l00987" name="l00987"></a><span class="lineno"> 987</span> <span class="comment">// Handles to model.</span></div>
|
|
<div class="line"><a id="l00988" name="l00988"></a><span class="lineno"> 988</span> <span class="keyword">const</span> RoutingModel& model_;</div>
|
|
<div class="line"><a id="l00989" name="l00989"></a><span class="lineno"> 989</span> <span class="keyword">const</span> RoutingDimension& dimension_;</div>
|
|
<div class="line"><a id="l00990" name="l00990"></a><span class="lineno"> 990</span> <span class="comment">// Strong energy-based filtering algorithm.</span></div>
|
|
<div class="line"><a id="l00991" name="l00991"></a><span class="lineno"> 991</span> DisjunctivePropagator disjunctive_propagator_;</div>
|
|
<div class="line"><a id="l00992" name="l00992"></a><span class="lineno"> 992</span> DisjunctivePropagator::Tasks tasks_;</div>
|
|
<div class="line"><a id="l00993" name="l00993"></a><span class="lineno"> 993</span> <span class="comment">// Used to check whether propagation changed a vector.</span></div>
|
|
<div class="line"><a id="l00994" name="l00994"></a><span class="lineno"> 994</span> std::vector<int64_t> old_start_min_;</div>
|
|
<div class="line"><a id="l00995" name="l00995"></a><span class="lineno"> 995</span> std::vector<int64_t> old_start_max_;</div>
|
|
<div class="line"><a id="l00996" name="l00996"></a><span class="lineno"> 996</span> std::vector<int64_t> old_end_min_;</div>
|
|
<div class="line"><a id="l00997" name="l00997"></a><span class="lineno"> 997</span> std::vector<int64_t> old_end_max_;</div>
|
|
<div class="line"><a id="l00998" name="l00998"></a><span class="lineno"> 998</span> </div>
|
|
<div class="line"><a id="l00999" name="l00999"></a><span class="lineno"> 999</span> std::vector<int> start_to_vehicle_;</div>
|
|
<div class="line"><a id="l01000" name="l01000"></a><span class="lineno"> 1000</span> TravelBounds travel_bounds_;</div>
|
|
<div class="line"><a id="l01001" name="l01001"></a><span class="lineno"> 1001</span>};</div>
|
|
<div class="line"><a id="l01002" name="l01002"></a><span class="lineno"> 1002</span> </div>
|
|
<div class="line"><a id="l01003" name="l01003"></a><span class="lineno"> 1003</span>VehicleBreaksFilter::VehicleBreaksFilter(<span class="keyword">const</span> RoutingModel& routing_model,</div>
|
|
<div class="line"><a id="l01004" name="l01004"></a><span class="lineno"> 1004</span> <span class="keyword">const</span> RoutingDimension& dimension)</div>
|
|
<div class="line"><a id="l01005" name="l01005"></a><span class="lineno"> 1005</span> : BasePathFilter(routing_model.Nexts(),</div>
|
|
<div class="line"><a id="l01006" name="l01006"></a><span class="lineno"> 1006</span> routing_model.Size() + routing_model.vehicles()),</div>
|
|
<div class="line"><a id="l01007" name="l01007"></a><span class="lineno"> 1007</span> model_(routing_model),</div>
|
|
<div class="line"><a id="l01008" name="l01008"></a><span class="lineno"> 1008</span> dimension_(dimension) {</div>
|
|
<div class="line"><a id="l01009" name="l01009"></a><span class="lineno"> 1009</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(dimension_.<a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a6debc638c02bfb2b4afe0afccdd98ca5">HasBreakConstraints</a>());</div>
|
|
<div class="line"><a id="l01010" name="l01010"></a><span class="lineno"> 1010</span> start_to_vehicle_.resize(Size(), -1);</div>
|
|
<div class="line"><a id="l01011" name="l01011"></a><span class="lineno"> 1011</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < routing_model.vehicles(); ++i) {</div>
|
|
<div class="line"><a id="l01012" name="l01012"></a><span class="lineno"> 1012</span> start_to_vehicle_[routing_model.Start(i)] = i;</div>
|
|
<div class="line"><a id="l01013" name="l01013"></a><span class="lineno"> 1013</span> }</div>
|
|
<div class="line"><a id="l01014" name="l01014"></a><span class="lineno"> 1014</span>}</div>
|
|
<div class="line"><a id="l01015" name="l01015"></a><span class="lineno"> 1015</span> </div>
|
|
<div class="line"><a id="l01016" name="l01016"></a><span class="lineno"> 1016</span><span class="keywordtype">void</span> VehicleBreaksFilter::FillPathOfVehicle(int64_t vehicle) {</div>
|
|
<div class="line"><a id="l01017" name="l01017"></a><span class="lineno"> 1017</span> path_.clear();</div>
|
|
<div class="line"><a id="l01018" name="l01018"></a><span class="lineno"> 1018</span> <span class="keywordtype">int</span> current = model_.<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">Start</a>(vehicle);</div>
|
|
<div class="line"><a id="l01019" name="l01019"></a><span class="lineno"> 1019</span> <span class="keywordflow">while</span> (!model_.<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#acf67dc202e247ce193038850f71306d3">IsEnd</a>(current)) {</div>
|
|
<div class="line"><a id="l01020" name="l01020"></a><span class="lineno"> 1020</span> path_.push_back(current);</div>
|
|
<div class="line"><a id="l01021" name="l01021"></a><span class="lineno"> 1021</span> current = GetNext(current);</div>
|
|
<div class="line"><a id="l01022" name="l01022"></a><span class="lineno"> 1022</span> }</div>
|
|
<div class="line"><a id="l01023" name="l01023"></a><span class="lineno"> 1023</span> path_.push_back(current);</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> </div>
|
|
<div class="line"><a id="l01026" name="l01026"></a><span class="lineno"> 1026</span><span class="keywordtype">bool</span> VehicleBreaksFilter::AcceptPath(int64_t path_start, int64_t chain_start,</div>
|
|
<div class="line"><a id="l01027" name="l01027"></a><span class="lineno"> 1027</span> int64_t chain_end) {</div>
|
|
<div class="line"><a id="l01028" name="l01028"></a><span class="lineno"> 1028</span> <span class="keyword">const</span> <span class="keywordtype">int</span> vehicle = start_to_vehicle_[path_start];</div>
|
|
<div class="line"><a id="l01029" name="l01029"></a><span class="lineno"> 1029</span> <span class="keywordflow">if</span> (dimension_.<a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle).empty() &&</div>
|
|
<div class="line"><a id="l01030" name="l01030"></a><span class="lineno"> 1030</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="l01031" name="l01031"></a><span class="lineno"> 1031</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01032" name="l01032"></a><span class="lineno"> 1032</span> }</div>
|
|
<div class="line"><a id="l01033" name="l01033"></a><span class="lineno"> 1033</span> <span class="comment">// Fill path and pre/post travel information.</span></div>
|
|
<div class="line"><a id="l01034" name="l01034"></a><span class="lineno"> 1034</span> FillPathOfVehicle(vehicle);</div>
|
|
<div class="line"><a id="l01035" name="l01035"></a><span class="lineno"> 1035</span> <a class="code hl_function" href="namespaceoperations__research.html#ac694e4749fb4e5c7739d20b84de6c5ec">FillTravelBoundsOfVehicle</a>(vehicle, path_, dimension_, &travel_bounds_);</div>
|
|
<div class="line"><a id="l01036" name="l01036"></a><span class="lineno"> 1036</span> <span class="comment">// Fill tasks from path, forbidden intervals, breaks and break constraints.</span></div>
|
|
<div class="line"><a id="l01037" name="l01037"></a><span class="lineno"> 1037</span> tasks_.Clear();</div>
|
|
<div class="line"><a id="l01038" name="l01038"></a><span class="lineno"> 1038</span> <a class="code hl_function" href="namespaceoperations__research.html#aa3db12120fcb6529cf2860fac7ef37bd">AppendTasksFromPath</a>(path_, travel_bounds_, dimension_, &tasks_);</div>
|
|
<div class="line"><a id="l01039" name="l01039"></a><span class="lineno"> 1039</span> tasks_.num_chain_tasks = tasks_.start_min.size();</div>
|
|
<div class="line"><a id="l01040" name="l01040"></a><span class="lineno"> 1040</span> <a class="code hl_function" href="namespaceoperations__research.html#a6a8bc2370087a30d5a122524bafa867b">AppendTasksFromIntervals</a>(dimension_.<a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a91b8a6eb7cf5ab0ebc74ddced140d700">GetBreakIntervalsOfVehicle</a>(vehicle),</div>
|
|
<div class="line"><a id="l01041" name="l01041"></a><span class="lineno"> 1041</span> &tasks_);</div>
|
|
<div class="line"><a id="l01042" name="l01042"></a><span class="lineno"> 1042</span> <span class="comment">// Add forbidden intervals only if a node has some.</span></div>
|
|
<div class="line"><a id="l01043" name="l01043"></a><span class="lineno"> 1043</span> tasks_.forbidden_intervals.clear();</div>
|
|
<div class="line"><a id="l01044" name="l01044"></a><span class="lineno"> 1044</span> <span class="keywordflow">if</span> (std::any_of(path_.begin(), path_.end(), [<span class="keyword">this</span>](int64_t node) {</div>
|
|
<div class="line"><a id="l01045" name="l01045"></a><span class="lineno"> 1045</span> return dimension_.forbidden_intervals()[node].NumIntervals() > 0;</div>
|
|
<div class="line"><a id="l01046" name="l01046"></a><span class="lineno"> 1046</span> })) {</div>
|
|
<div class="line"><a id="l01047" name="l01047"></a><span class="lineno"> 1047</span> tasks_.forbidden_intervals.assign(tasks_.start_min.size(), <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l01048" name="l01048"></a><span class="lineno"> 1048</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < path_.size(); ++i) {</div>
|
|
<div class="line"><a id="l01049" name="l01049"></a><span class="lineno"> 1049</span> tasks_.forbidden_intervals[2 * i] =</div>
|
|
<div class="line"><a id="l01050" name="l01050"></a><span class="lineno"> 1050</span> &(dimension_.<a class="code hl_function" href="classoperations__research_1_1_routing_dimension.html#a9958465c1ff256b5cbcdc684ada03e60">forbidden_intervals</a>()[path_[i]]);</div>
|
|
<div class="line"><a id="l01051" name="l01051"></a><span class="lineno"> 1051</span> }</div>
|
|
<div class="line"><a id="l01052" name="l01052"></a><span class="lineno"> 1052</span> }</div>
|
|
<div class="line"><a id="l01053" name="l01053"></a><span class="lineno"> 1053</span> <span class="comment">// Max distance duration constraint.</span></div>
|
|
<div class="line"><a id="l01054" name="l01054"></a><span class="lineno"> 1054</span> tasks_.distance_duration =</div>
|
|
<div class="line"><a id="l01055" name="l01055"></a><span class="lineno"> 1055</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="l01056" name="l01056"></a><span class="lineno"> 1056</span> </div>
|
|
<div class="line"><a id="l01057" name="l01057"></a><span class="lineno"> 1057</span> <span class="comment">// Reduce bounds until failure or fixed point is reached.</span></div>
|
|
<div class="line"><a id="l01058" name="l01058"></a><span class="lineno"> 1058</span> <span class="comment">// We set a maximum amount of iterations to avoid slow propagation.</span></div>
|
|
<div class="line"><a id="l01059" name="l01059"></a><span class="lineno"> 1059</span> <span class="keywordtype">bool</span> is_feasible = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l01060" name="l01060"></a><span class="lineno"> 1060</span> <span class="keywordtype">int</span> maximum_num_iterations = 8;</div>
|
|
<div class="line"><a id="l01061" name="l01061"></a><span class="lineno"> 1061</span> <span class="keywordflow">while</span> (--maximum_num_iterations >= 0) {</div>
|
|
<div class="line"><a id="l01062" name="l01062"></a><span class="lineno"> 1062</span> old_start_min_ = tasks_.start_min;</div>
|
|
<div class="line"><a id="l01063" name="l01063"></a><span class="lineno"> 1063</span> old_start_max_ = tasks_.start_max;</div>
|
|
<div class="line"><a id="l01064" name="l01064"></a><span class="lineno"> 1064</span> old_end_min_ = tasks_.end_min;</div>
|
|
<div class="line"><a id="l01065" name="l01065"></a><span class="lineno"> 1065</span> old_end_max_ = tasks_.end_max;</div>
|
|
<div class="line"><a id="l01066" name="l01066"></a><span class="lineno"> 1066</span> is_feasible = disjunctive_propagator_.<a class="code hl_function" href="classoperations__research_1_1_disjunctive_propagator.html#a8a31c563d28e1ebe7c9e140f15fea586">Propagate</a>(&tasks_);</div>
|
|
<div class="line"><a id="l01067" name="l01067"></a><span class="lineno"> 1067</span> <span class="keywordflow">if</span> (!is_feasible) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l01068" name="l01068"></a><span class="lineno"> 1068</span> <span class="comment">// If fixed point reached, stop.</span></div>
|
|
<div class="line"><a id="l01069" name="l01069"></a><span class="lineno"> 1069</span> <span class="keywordflow">if</span> ((old_start_min_ == tasks_.start_min) &&</div>
|
|
<div class="line"><a id="l01070" name="l01070"></a><span class="lineno"> 1070</span> (old_start_max_ == tasks_.start_max) &&</div>
|
|
<div class="line"><a id="l01071" name="l01071"></a><span class="lineno"> 1071</span> (old_end_min_ == tasks_.end_min) && (old_end_max_ == tasks_.end_max)) {</div>
|
|
<div class="line"><a id="l01072" name="l01072"></a><span class="lineno"> 1072</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l01073" name="l01073"></a><span class="lineno"> 1073</span> }</div>
|
|
<div class="line"><a id="l01074" name="l01074"></a><span class="lineno"> 1074</span> }</div>
|
|
<div class="line"><a id="l01075" name="l01075"></a><span class="lineno"> 1075</span> <span class="keywordflow">return</span> is_feasible;</div>
|
|
<div class="line"><a id="l01076" name="l01076"></a><span class="lineno"> 1076</span>}</div>
|
|
<div class="line"><a id="l01077" name="l01077"></a><span class="lineno"> 1077</span> </div>
|
|
<div class="line"><a id="l01078" name="l01078"></a><span class="lineno"> 1078</span>} <span class="comment">// namespace</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"><a class="line" href="namespaceoperations__research.html#a447588dfd4d5f539ec22f403e21ca668"> 1080</a></span><a class="code hl_class" href="classoperations__research_1_1_int_var_local_search_filter.html">IntVarLocalSearchFilter</a>* <a class="code hl_function" href="namespaceoperations__research.html#a447588dfd4d5f539ec22f403e21ca668">MakeVehicleBreaksFilter</a>(</div>
|
|
<div class="line"><a id="l01081" name="l01081"></a><span class="lineno"> 1081</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1_routing_model.html">RoutingModel</a>& routing_model, <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="l01082" name="l01082"></a><span class="lineno"> 1082</span> <span class="keywordflow">return</span> routing_model.<a class="code hl_function" href="classoperations__research_1_1_routing_model.html#a0b526d33739114e9255ffbe8343efe1a">solver</a>()-><a class="code hl_function" href="classoperations__research_1_1_solver.html#af5a1f8b1ea0ab0796c8667b9e2ef0ce7">RevAlloc</a>(</div>
|
|
<div class="line"><a id="l01083" name="l01083"></a><span class="lineno"> 1083</span> <span class="keyword">new</span> VehicleBreaksFilter(routing_model, dimension));</div>
|
|
<div class="line"><a id="l01084" name="l01084"></a><span class="lineno"> 1084</span>}</div>
|
|
<div class="line"><a id="l01085" name="l01085"></a><span class="lineno"> 1085</span> </div>
|
|
<div class="line"><a id="l01086" name="l01086"></a><span class="lineno"> 1086</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_a4395e95bab44e222cb2e77251017a0e2"><div class="ttname"><a href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a></div><div class="ttdeci">#define DCHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00893">base/logging.h:893</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00890">base/logging.h:890</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae89df3243bbb8341130c7b3f44145ea0"><div class="ttname"><a href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a></div><div class="ttdeci">#define DCHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00891">base/logging.h:891</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_constraint_html"><div class="ttname"><a href="classoperations__research_1_1_constraint.html">operations_research::Constraint</a></div><div class="ttdoc">A constraint is the main modeling object.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03626">constraint_solver.h:3626</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_demon_html"><div class="ttname"><a href="classoperations__research_1_1_demon.html">operations_research::Demon</a></div><div class="ttdoc">A Demon is the base element of a propagation queue.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03342">constraint_solver.h:3342</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disjunctive_propagator_html_a08f43a826695abdbdad1c608cb90b25a"><div class="ttname"><a href="classoperations__research_1_1_disjunctive_propagator.html#a08f43a826695abdbdad1c608cb90b25a">operations_research::DisjunctivePropagator::EdgeFinding</a></div><div class="ttdeci">bool EdgeFinding(Tasks *tasks)</div><div class="ttdoc">Does edge-finding deductions on all tasks.</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00152">routing_breaks.cc:152</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disjunctive_propagator_html_a0d1ed47f6804807e925b489b24fb8d04"><div class="ttname"><a href="classoperations__research_1_1_disjunctive_propagator.html#a0d1ed47f6804807e925b489b24fb8d04">operations_research::DisjunctivePropagator::Precedences</a></div><div class="ttdeci">bool Precedences(Tasks *tasks)</div><div class="ttdoc">Propagates the deductions from the chain of precedences, if there is one.</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00067">routing_breaks.cc:67</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disjunctive_propagator_html_a13e93a8cd8587377e1b8f88096e0efd0"><div class="ttname"><a href="classoperations__research_1_1_disjunctive_propagator.html#a13e93a8cd8587377e1b8f88096e0efd0">operations_research::DisjunctivePropagator::DistanceDuration</a></div><div class="ttdeci">bool DistanceDuration(Tasks *tasks)</div><div class="ttdoc">Propagates distance_duration constraints, if any.</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00302">routing_breaks.cc:302</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disjunctive_propagator_html_a29620476a22fde70929c77dc6342be0e"><div class="ttname"><a href="classoperations__research_1_1_disjunctive_propagator.html#a29620476a22fde70929c77dc6342be0e">operations_research::DisjunctivePropagator::MirrorTasks</a></div><div class="ttdeci">bool MirrorTasks(Tasks *tasks)</div><div class="ttdoc">Transforms the problem with a time symmetry centered in 0.</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00122">routing_breaks.cc:122</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disjunctive_propagator_html_a7b0f3a8550bd73014e2b61899524a2ad"><div class="ttname"><a href="classoperations__research_1_1_disjunctive_propagator.html#a7b0f3a8550bd73014e2b61899524a2ad">operations_research::DisjunctivePropagator::ForbiddenIntervals</a></div><div class="ttdeci">bool ForbiddenIntervals(Tasks *tasks)</div><div class="ttdoc">Tasks might have holes in their domain, this enforces such holes.</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00266">routing_breaks.cc:266</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disjunctive_propagator_html_a8a31c563d28e1ebe7c9e140f15fea586"><div class="ttname"><a href="classoperations__research_1_1_disjunctive_propagator.html#a8a31c563d28e1ebe7c9e140f15fea586">operations_research::DisjunctivePropagator::Propagate</a></div><div class="ttdeci">bool Propagate(Tasks *tasks)</div><div class="ttdoc">Computes new bounds for all tasks, returns false if infeasible.</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00036">routing_breaks.cc:36</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disjunctive_propagator_html_aa9b624e65cb55b3d74ad35a3a675f9ea"><div class="ttname"><a href="classoperations__research_1_1_disjunctive_propagator.html#aa9b624e65cb55b3d74ad35a3a675f9ea">operations_research::DisjunctivePropagator::DetectablePrecedencesWithChain</a></div><div class="ttdeci">bool DetectablePrecedencesWithChain(Tasks *tasks)</div><div class="ttdoc">Does detectable precedences deductions on tasks in the chain precedence, taking the time windows of n...</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00213">routing_breaks.cc:213</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disjunctive_propagator_html_acf2f8cdb2a89ceee2b652aee8fa86b21"><div class="ttname"><a href="classoperations__research_1_1_disjunctive_propagator.html#acf2f8cdb2a89ceee2b652aee8fa86b21">operations_research::DisjunctivePropagator::ChainSpanMinDynamic</a></div><div class="ttdeci">bool ChainSpanMinDynamic(Tasks *tasks)</div><div class="ttdoc">Computes a lower bound of the span of the chain, taking into account only the first nonchain task.</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00488">routing_breaks.cc:488</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disjunctive_propagator_html_ad84e0e4ee59eab8a1004906628692ccb"><div class="ttname"><a href="classoperations__research_1_1_disjunctive_propagator.html#ad84e0e4ee59eab8a1004906628692ccb">operations_research::DisjunctivePropagator::ChainSpanMin</a></div><div class="ttdeci">bool ChainSpanMin(Tasks *tasks)</div><div class="ttdoc">Propagates a lower bound of the chain span, end[num_chain_tasks] - start[0], to span_min.</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00448">routing_breaks.cc:448</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_vehicle_breaks_constraint_html_a19d94d32f3bde30deeebb883c6f71f84"><div class="ttname"><a href="classoperations__research_1_1_global_vehicle_breaks_constraint.html#a19d94d32f3bde30deeebb883c6f71f84">operations_research::GlobalVehicleBreaksConstraint::Post</a></div><div class="ttdeci">void Post() override</div><div class="ttdoc">This method is called when the constraint is processed by the solver.</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00715">routing_breaks.cc:715</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_vehicle_breaks_constraint_html_a36d844f2722273b190ed9a069dd25938"><div class="ttname"><a href="classoperations__research_1_1_global_vehicle_breaks_constraint.html#a36d844f2722273b190ed9a069dd25938">operations_research::GlobalVehicleBreaksConstraint::InitialPropagate</a></div><div class="ttdeci">void InitialPropagate() override</div><div class="ttdoc">This method performs the initial propagation of the constraint.</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00744">routing_breaks.cc:744</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_global_vehicle_breaks_constraint_html_acb1ca5666c8795f29fc71c28d7bb0386"><div class="ttname"><a href="classoperations__research_1_1_global_vehicle_breaks_constraint.html#acb1ca5666c8795f29fc71c28d7bb0386">operations_research::GlobalVehicleBreaksConstraint::GlobalVehicleBreaksConstraint</a></div><div class="ttdeci">GlobalVehicleBreaksConstraint(const RoutingDimension *dimension)</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00707">routing_breaks.cc:707</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_expr_html_a1d04569b37cb7fe6ed0956ab71e08bc9"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#a1d04569b37cb7fe6ed0956ab71e08bc9">operations_research::IntExpr::Bound</a></div><div class="ttdeci">virtual bool Bound() const</div><div class="ttdoc">Returns true if the min and the max of the expression are equal.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03904">constraint_solver.h:3904</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_a67b97db6268b823e295b9d5284e5a03e"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#a67b97db6268b823e295b9d5284e5a03e">operations_research::IntExpr::SetMax</a></div><div class="ttdeci">virtual void SetMax(int64_t m)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_expr_html_aac7dfcb9ef06cc889474d5043b580a45"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#aac7dfcb9ef06cc889474d5043b580a45">operations_research::IntExpr::SetMin</a></div><div class="ttdeci">virtual void SetMin(int64_t m)=0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_expr_html_ac84c250d67f30c89e845cd460eeaaad8"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#ac84c250d67f30c89e845cd460eeaaad8">operations_research::IntExpr::Max</a></div><div class="ttdeci">virtual int64_t Max() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_expr_html_af13b2ea301c6800bb6d43bd70716bf6d"><div class="ttname"><a href="classoperations__research_1_1_int_expr.html#af13b2ea301c6800bb6d43bd70716bf6d">operations_research::IntExpr::WhenRange</a></div><div class="ttdeci">virtual void WhenRange(Demon *d)=0</div><div class="ttdoc">Attach a demon that will watch the min or the max of the expression.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_html_a6e33a313eaf507bae0eb7068455a5bdc"><div class="ttname"><a href="classoperations__research_1_1_int_var.html#a6e33a313eaf507bae0eb7068455a5bdc">operations_research::IntVar::WhenBound</a></div><div class="ttdeci">virtual void WhenBound(Demon *d)=0</div><div class="ttdoc">This method attaches a demon that will be awakened when the variable is bound.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_local_search_filter_html"><div class="ttname"><a href="classoperations__research_1_1_int_var_local_search_filter.html">operations_research::IntVarLocalSearchFilter</a></div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l01822">constraint_solveri.h:1822</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_interval_var_html"><div class="ttname"><a href="classoperations__research_1_1_interval_var.html">operations_research::IntervalVar</a></div><div class="ttdoc">Interval variables are often used in scheduling.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l04437">constraint_solver.h:4437</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_interval_var_html_a2e69397c7c1e71a796afa6a632ee8296"><div class="ttname"><a href="classoperations__research_1_1_interval_var.html#a2e69397c7c1e71a796afa6a632ee8296">operations_research::IntervalVar::DurationMax</a></div><div class="ttdeci">virtual int64_t DurationMax() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_interval_var_html_a4488d66b163b204a15eadeafcf4872f8"><div class="ttname"><a href="classoperations__research_1_1_interval_var.html#a4488d66b163b204a15eadeafcf4872f8">operations_research::IntervalVar::DurationMin</a></div><div class="ttdeci">virtual int64_t DurationMin() const =0</div><div class="ttdoc">These methods query, set, and watch the duration of the interval var.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_interval_var_html_a7f7f661e9b94f25f706732924e0f01e9"><div class="ttname"><a href="classoperations__research_1_1_interval_var.html#a7f7f661e9b94f25f706732924e0f01e9">operations_research::IntervalVar::MustBePerformed</a></div><div class="ttdeci">virtual bool MustBePerformed() const =0</div><div class="ttdoc">These methods query, set, and watch the performed status of the interval var.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_interval_var_html_a9ae4b46f1aa6c51c0a5833d3531cd82c"><div class="ttname"><a href="classoperations__research_1_1_interval_var.html#a9ae4b46f1aa6c51c0a5833d3531cd82c">operations_research::IntervalVar::EndMin</a></div><div class="ttdeci">virtual int64_t EndMin() const =0</div><div class="ttdoc">These methods query, set, and watch the end position of the interval var.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_interval_var_html_aa93a06dc97f33ccaefc7df90fb9b89d1"><div class="ttname"><a href="classoperations__research_1_1_interval_var.html#aa93a06dc97f33ccaefc7df90fb9b89d1">operations_research::IntervalVar::StartMin</a></div><div class="ttdeci">virtual int64_t StartMin() const =0</div><div class="ttdoc">These methods query, set, and watch the start position of the interval var.</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_interval_var_html_ae05142dd885524b06032bed1cbc63af0"><div class="ttname"><a href="classoperations__research_1_1_interval_var.html#ae05142dd885524b06032bed1cbc63af0">operations_research::IntervalVar::EndMax</a></div><div class="ttdeci">virtual int64_t EndMax() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_interval_var_html_af9f22c28d624c6efb78156365d35a690"><div class="ttname"><a href="classoperations__research_1_1_interval_var.html#af9f22c28d624c6efb78156365d35a690">operations_research::IntervalVar::StartMax</a></div><div class="ttdeci">virtual int64_t StartMax() const =0</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_propagation_base_object_html_a0b526d33739114e9255ffbe8343efe1a"><div class="ttname"><a href="classoperations__research_1_1_propagation_base_object.html#a0b526d33739114e9255ffbe8343efe1a">operations_research::PropagationBaseObject::solver</a></div><div class="ttdeci">Solver * solver() const</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03196">constraint_solver.h:3196</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_propagation_base_object_html_a173cbf153462b14f9b57362d2c45638a"><div class="ttname"><a href="classoperations__research_1_1_propagation_base_object.html#a173cbf153462b14f9b57362d2c45638a">operations_research::PropagationBaseObject::EnqueueDelayedDemon</a></div><div class="ttdeci">void EnqueueDelayedDemon(Demon *const d)</div><div class="ttdoc">This method pushes the demon onto the propagation queue.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03209">constraint_solver.h:3209</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#l02590">routing.h:2590</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#l02619">routing.h:2619</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a3a71e48b4ed287752b9d9d9f7086ec7d"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a3a71e48b4ed287752b9d9d9f7086ec7d">operations_research::RoutingDimension::CumulVar</a></div><div class="ttdeci">IntVar * CumulVar(int64_t index) const</div><div class="ttdoc">Get the cumul, transit and slack variables for the given node (given as int64_t var index).</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02609">routing.h:2609</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_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#l02614">routing.h:2614</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#l02673">routing.h:2673</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_dimension_html_a6b1c8b4920c3a49c761c652343d66501"><div class="ttname"><a href="classoperations__research_1_1_routing_dimension.html#a6b1c8b4920c3a49c761c652343d66501">operations_research::RoutingDimension::FixedTransitVar</a></div><div class="ttdeci">IntVar * FixedTransitVar(int64_t index) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02611">routing.h:2611</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#l07136">routing.cc:7136</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#l07147">routing.cc:7147</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#l02594">routing.h:2594</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#l07140">routing.cc:7140</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#l02625">routing.h:2625</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#l07175">routing.cc:7175</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#l07153">routing.cc:7153</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html">operations_research::RoutingModel</a></div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00210">routing.h:210</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a0b526d33739114e9255ffbe8343efe1a"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a0b526d33739114e9255ffbe8343efe1a">operations_research::RoutingModel::solver</a></div><div class="ttdeci">Solver * solver() const</div><div class="ttdoc">Returns the underlying constraint solver.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01511">routing.h:1511</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a0ceffe3b4741e0075a7be69d5d539ec4"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a0ceffe3b4741e0075a7be69d5d539ec4">operations_research::RoutingModel::TransitCallback</a></div><div class="ttdeci">const TransitCallback2 & TransitCallback(int callback_index) const</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l00509">routing.h:509</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a43c00b1c44d7f5bec9287ce60fadef52"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a43c00b1c44d7f5bec9287ce60fadef52">operations_research::RoutingModel::VehicleVar</a></div><div class="ttdeci">IntVar * VehicleVar(int64_t index) const</div><div class="ttdoc">Returns the vehicle variable of the node corresponding to index.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01382">routing.h:1382</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a5e7fe0d056275b47eccc1b6bfce0b482"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a5e7fe0d056275b47eccc1b6bfce0b482">operations_research::RoutingModel::NextVar</a></div><div class="ttdeci">IntVar * NextVar(int64_t index) const</div><div class="ttdoc">!defined(SWIGPYTHON)</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01366">routing.h:1366</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_a911482cb7495f22638a02066adf13c8b"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#a911482cb7495f22638a02066adf13c8b">operations_research::RoutingModel::Nexts</a></div><div class="ttdeci">const std::vector< IntVar * > & Nexts() const</div><div class="ttdoc">Returns all next variables of the model, such that Nexts(i) is the next variable of the node correspo...</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01353">routing.h:1353</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_aa650ea2c539fab98337ae2f6ca553f3d"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#aa650ea2c539fab98337ae2f6ca553f3d">operations_research::RoutingModel::Start</a></div><div class="ttdeci">int64_t Start(int vehicle) const</div><div class="ttdoc">Model inspection.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01333">routing.h:1333</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_aa9e7ba89833775f29889744fe9480d29"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#aa9e7ba89833775f29889744fe9480d29">operations_research::RoutingModel::vehicles</a></div><div class="ttdeci">int vehicles() const</div><div class="ttdoc">Returns the number of vehicle routes in the model.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01529">routing.h:1529</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_acf67dc202e247ce193038850f71306d3"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#acf67dc202e247ce193038850f71306d3">operations_research::RoutingModel::IsEnd</a></div><div class="ttdeci">bool IsEnd(int64_t index) const</div><div class="ttdoc">Returns true if 'index' represents the last node of a route.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01339">routing.h:1339</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_routing_model_html_afb80fd36c1fb57d2db049403483e2074"><div class="ttname"><a href="classoperations__research_1_1_routing_model.html#afb80fd36c1fb57d2db049403483e2074">operations_research::RoutingModel::End</a></div><div class="ttdeci">int64_t End(int vehicle) const</div><div class="ttdoc">Returns the variable index of the ending node of a vehicle route.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l01335">routing.h:1335</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_aeb92d4addb41255c9732cacfcb54f795"><div class="ttname"><a href="classoperations__research_1_1_solver.html#aeb92d4addb41255c9732cacfcb54f795">operations_research::Solver::Fail</a></div><div class="ttdeci">void Fail()</div><div class="ttdoc">Abandon the current branch in the search tree. A backtrack will follow.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l02422">constraint_solver.cc:2422</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_af5a1f8b1ea0ab0796c8667b9e2ef0ce7"><div class="ttname"><a href="classoperations__research_1_1_solver.html#af5a1f8b1ea0ab0796c8667b9e2ef0ce7">operations_research::Solver::RevAlloc</a></div><div class="ttdeci">T * RevAlloc(T *object)</div><div class="ttdoc">Registers the given object as being reversible.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00791">constraint_solver.h:791</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a0cd86cea355b2b1f70e5494fdce82979"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a0cd86cea355b2b1f70e5494fdce82979">operations_research::sat::ThetaLambdaTree::GetEventsWithOptionalEnvelopeGreaterThan</a></div><div class="ttdeci">void GetEventsWithOptionalEnvelopeGreaterThan(IntegerType target_envelope, int *critical_event, int *optional_event, IntegerType *available_energy) const</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00190">theta_tree.cc:190</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a1c2fe501274ef60430486bba0842cd35"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1c2fe501274ef60430486bba0842cd35">operations_research::sat::ThetaLambdaTree::GetOptionalEnvelope</a></div><div class="ttdeci">IntegerType GetOptionalEnvelope() const</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00174">theta_tree.cc:174</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a1d04b14711a8d3bba829f1b0eb4dd4a8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1d04b14711a8d3bba829f1b0eb4dd4a8">operations_research::sat::ThetaLambdaTree::RemoveEvent</a></div><div class="ttdeci">void RemoveEvent(int event)</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00148">theta_tree.cc:148</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a7b4553842be2a65d82b3f40eed71744d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a7b4553842be2a65d82b3f40eed71744d">operations_research::sat::ThetaLambdaTree::Reset</a></div><div class="ttdeci">void Reset(int num_events)</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00041">theta_tree.cc:41</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a9045183839ce6286d80eb699209c1557"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a9045183839ce6286d80eb699209c1557">operations_research::sat::ThetaLambdaTree::AddOrUpdateOptionalEvent</a></div><div class="ttdeci">void AddOrUpdateOptionalEvent(int event, IntegerType initial_envelope_opt, IntegerType energy_max)</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00125">theta_tree.cc:125</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_ad812cddd43d03a817341c9875f4f6f4f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ad812cddd43d03a817341c9875f4f6f4f">operations_research::sat::ThetaLambdaTree::AddOrUpdateEvent</a></div><div class="ttdeci">void AddOrUpdateEvent(int event, IntegerType initial_envelope, IntegerType energy_min, IntegerType energy_max)</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00112">theta_tree.cc:112</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_add1a42315d03f68191df32a019d82093"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#add1a42315d03f68191df32a019d82093">operations_research::sat::ThetaLambdaTree::GetEnvelope</a></div><div class="ttdeci">IntegerType GetEnvelope() const</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00169">theta_tree.cc:169</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_8h_html"><div class="ttname"><a href="constraint__solver_8h.html">constraint_solver.h</a></div></div>
|
|
<div class="ttc" id="aconstraint__solveri_8h_html"><div class="ttname"><a href="constraint__solveri_8h.html">constraint_solveri.h</a></div></div>
|
|
<div class="ttc" id="agurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00274">gurobi_interface.cc:274</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="alocal__search_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="local__search_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="local__search_8cc_source.html#l02750">local_search.cc:2750</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_a447588dfd4d5f539ec22f403e21ca668"><div class="ttname"><a href="namespaceoperations__research.html#a447588dfd4d5f539ec22f403e21ca668">operations_research::MakeVehicleBreaksFilter</a></div><div class="ttdeci">IntVarLocalSearchFilter * MakeVehicleBreaksFilter(const RoutingModel &routing_model, const RoutingDimension &dimension)</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l01080">routing_breaks.cc:1080</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a4a43d435871f16c321861fa5de32df82"><div class="ttname"><a href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">operations_research::CapSub</a></div><div class="ttdeci">int64_t CapSub(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00158">saturated_arithmetic.h:158</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a6a8bc2370087a30d5a122524bafa867b"><div class="ttname"><a href="namespaceoperations__research.html#a6a8bc2370087a30d5a122524bafa867b">operations_research::AppendTasksFromIntervals</a></div><div class="ttdeci">void AppendTasksFromIntervals(const std::vector< IntervalVar * > &intervals, DisjunctivePropagator::Tasks *tasks)</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00693">routing_breaks.cc:693</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_aa3db12120fcb6529cf2860fac7ef37bd"><div class="ttname"><a href="namespaceoperations__research.html#aa3db12120fcb6529cf2860fac7ef37bd">operations_research::AppendTasksFromPath</a></div><div class="ttdeci">void AppendTasksFromPath(const std::vector< int64_t > &path, const TravelBounds &travel_bounds, const RoutingDimension &dimension, DisjunctivePropagator::Tasks *tasks)</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00609">routing_breaks.cc:609</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#l06452">routing.cc:6452</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ac316c82f31293db18e25c809592908dd"><div class="ttname"><a href="namespaceoperations__research.html#ac316c82f31293db18e25c809592908dd">operations_research::MakeDelayedConstraintDemon1</a></div><div class="ttdeci">Demon * MakeDelayedConstraintDemon1(Solver *const s, T *const ct, void(T::*method)(P), const std::string &name, P param1)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00718">constraint_solveri.h:718</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ac694e4749fb4e5c7739d20b84de6c5ec"><div class="ttname"><a href="namespaceoperations__research.html#ac694e4749fb4e5c7739d20b84de6c5ec">operations_research::FillTravelBoundsOfVehicle</a></div><div class="ttdeci">void FillTravelBoundsOfVehicle(int vehicle, const std::vector< int64_t > &path, const RoutingDimension &dimension, TravelBounds *travel_bounds)</div><div class="ttdef"><b>Definition:</b> <a href="routing__breaks_8cc_source.html#l00664">routing_breaks.cc:664</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ae0190f4a9c848c207d0bff97f625fcd1"><div class="ttname"><a href="namespaceoperations__research.html#ae0190f4a9c848c207d0bff97f625fcd1">operations_research::MakeConstraintDemon1</a></div><div class="ttdeci">Demon * MakeConstraintDemon1(Solver *const s, T *const ct, void(T::*method)(P), const std::string &name, P param1)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00560">constraint_solveri.h:560</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_aee52de7b225665566aa47246b9d6b8fa"><div class="ttname"><a href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a></div><div class="ttdeci">int64_t time</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l01693">resource.cc:1693</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_8h_html"><div class="ttname"><a href="routing__filters_8h.html">routing_filters.h</a></div></div>
|
|
<div class="ttc" id="asaturated__arithmetic_8h_html"><div class="ttname"><a href="saturated__arithmetic_8h.html">saturated_arithmetic.h</a></div></div>
|
|
<div class="ttc" id="asched__constraints_8cc_html_a0d94a083ebe1975ac196611f87a4e0a2"><div class="ttname"><a href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a></div><div class="ttdeci">Rev< int64_t > start_max</div><div class="ttdef"><b>Definition:</b> <a href="sched__constraints_8cc_source.html#l00244">sched_constraints.cc:244</a></div></div>
|
|
<div class="ttc" id="asched__constraints_8cc_html_a826c744af066625acb241b17ae3e2be9"><div class="ttname"><a href="sched__constraints_8cc.html#a826c744af066625acb241b17ae3e2be9">start_min</a></div><div class="ttdeci">Rev< int64_t > start_min</div><div class="ttdef"><b>Definition:</b> <a href="sched__constraints_8cc_source.html#l00243">sched_constraints.cc:243</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 class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html">operations_research::DisjunctivePropagator::Tasks</a></div><div class="ttdoc">A structure to hold tasks described by their features.</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02183">routing.h:2183</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_a10679034cef02c42959f43b6d3db9aba"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a10679034cef02c42959f43b6d3db9aba">operations_research::DisjunctivePropagator::Tasks::distance_duration</a></div><div class="ttdeci">std::vector< std::pair< int64_t, int64_t > > distance_duration</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02193">routing.h:2193</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_a252dd9da028d9c85c4b16db92770b623"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a252dd9da028d9c85c4b16db92770b623">operations_research::DisjunctivePropagator::Tasks::span_max</a></div><div class="ttdeci">int64_t span_max</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02195">routing.h:2195</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_a283e17231ec4398bb14b047498785c7c"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a283e17231ec4398bb14b047498785c7c">operations_research::DisjunctivePropagator::Tasks::end_min</a></div><div class="ttdeci">std::vector< int64_t > end_min</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02189">routing.h:2189</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_a376fe24726178042b5c4d042c742fc41"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a376fe24726178042b5c4d042c742fc41">operations_research::DisjunctivePropagator::Tasks::start_min</a></div><div class="ttdeci">std::vector< int64_t > start_min</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02185">routing.h:2185</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_a403871ce706f58918d0fe7f580f2b174"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a403871ce706f58918d0fe7f580f2b174">operations_research::DisjunctivePropagator::Tasks::span_min</a></div><div class="ttdeci">int64_t span_min</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02194">routing.h:2194</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_a425fd06d315549fdc6e6c482e3cdf774"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a425fd06d315549fdc6e6c482e3cdf774">operations_research::DisjunctivePropagator::Tasks::forbidden_intervals</a></div><div class="ttdeci">std::vector< const SortedDisjointIntervalList * > forbidden_intervals</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02192">routing.h:2192</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_a450130fc232b9ab24cc44a7c215850b6"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#a450130fc232b9ab24cc44a7c215850b6">operations_research::DisjunctivePropagator::Tasks::is_preemptible</a></div><div class="ttdeci">std::vector< bool > is_preemptible</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02191">routing.h:2191</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa71d36872f416feaa853788a7a7a7ef8">operations_research::DisjunctivePropagator::Tasks::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02197">routing.h:2197</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_aa7b2fcbf13d5be0c8c9cadfa34424538"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#aa7b2fcbf13d5be0c8c9cadfa34424538">operations_research::DisjunctivePropagator::Tasks::end_max</a></div><div class="ttdeci">std::vector< int64_t > end_max</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02190">routing.h:2190</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_abd7699021e5652feb514e0d68c973df2"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#abd7699021e5652feb514e0d68c973df2">operations_research::DisjunctivePropagator::Tasks::duration_max</a></div><div class="ttdeci">std::vector< int64_t > duration_max</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02188">routing.h:2188</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_ac4172ac79975a3a6ff834c634f6779d8"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ac4172ac79975a3a6ff834c634f6779d8">operations_research::DisjunctivePropagator::Tasks::start_max</a></div><div class="ttdeci">std::vector< int64_t > start_max</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02186">routing.h:2186</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_ad5082bc7cd5927cc9fcc9278fac7184a"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5082bc7cd5927cc9fcc9278fac7184a">operations_research::DisjunctivePropagator::Tasks::duration_min</a></div><div class="ttdeci">std::vector< int64_t > duration_min</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02187">routing.h:2187</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_disjunctive_propagator_1_1_tasks_html_ad5e547ae9d4f7380beae49908c7cdc48"><div class="ttname"><a href="structoperations__research_1_1_disjunctive_propagator_1_1_tasks.html#ad5e547ae9d4f7380beae49908c7cdc48">operations_research::DisjunctivePropagator::Tasks::num_chain_tasks</a></div><div class="ttdeci">int num_chain_tasks</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02184">routing.h:2184</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_travel_bounds_html"><div class="ttname"><a href="structoperations__research_1_1_travel_bounds.html">operations_research::TravelBounds</a></div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02253">routing.h:2253</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_travel_bounds_html_a19ace84f03aa7a436d6e91c16caf6618"><div class="ttname"><a href="structoperations__research_1_1_travel_bounds.html#a19ace84f03aa7a436d6e91c16caf6618">operations_research::TravelBounds::post_travels</a></div><div class="ttdeci">std::vector< int64_t > post_travels</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02257">routing.h:2257</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_travel_bounds_html_a6fcbfd1ef4117ac735024d0835b48468"><div class="ttname"><a href="structoperations__research_1_1_travel_bounds.html#a6fcbfd1ef4117ac735024d0835b48468">operations_research::TravelBounds::max_travels</a></div><div class="ttdeci">std::vector< int64_t > max_travels</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02255">routing.h:2255</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_travel_bounds_html_a9f757b787c617299a0beb531625a734f"><div class="ttname"><a href="structoperations__research_1_1_travel_bounds.html#a9f757b787c617299a0beb531625a734f">operations_research::TravelBounds::pre_travels</a></div><div class="ttdeci">std::vector< int64_t > pre_travels</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02256">routing.h:2256</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1_travel_bounds_html_aca8610bd0ccad69ab8284f40a468c7f0"><div class="ttname"><a href="structoperations__research_1_1_travel_bounds.html#aca8610bd0ccad69ab8284f40a468c7f0">operations_research::TravelBounds::min_travels</a></div><div class="ttdeci">std::vector< int64_t > min_travels</div><div class="ttdef"><b>Definition:</b> <a href="routing_8h_source.html#l02254">routing.h:2254</a></div></div>
|
|
<div class="ttc" id="atheta__tree_8h_html"><div class="ttname"><a href="theta__tree_8h.html">theta_tree.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__breaks_8cc.html">routing_breaks.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.3 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|