596 lines
87 KiB
HTML
596 lines
87 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.1"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: facility_lp_benders.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.0</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('facility__lp__benders_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">facility_lp_benders.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="facility__lp__benders_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// Simple linear programming example</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>  </div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <iostream></span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <limits></span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <utility></span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>  </div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "absl/flags/parse.h"</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "absl/flags/usage.h"</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "absl/container/flat_hash_map.h"</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "absl/flags/flag.h"</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "absl/random/random.h"</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "absl/random/uniform_int_distribution.h"</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "absl/status/statusor.h"</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "absl/strings/str_format.h"</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "absl/strings/string_view.h"</span></div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#include "absl/time/clock.h"</span></div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include "absl/time/time.h"</span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include "<a class="code" href="math__opt_8h.html">ortools/math_opt/cpp/math_opt.h</a>"</span></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  </div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"><a class="line" href="facility__lp__benders_8cc.html#ab408ded47ed4632487b6f538ae4df9d0"> 36</a></span> <a class="code" href="facility__lp__benders_8cc.html#ab408ded47ed4632487b6f538ae4df9d0">ABSL_FLAG</a>(<span class="keywordtype">int</span>, num_facilities, 3000, <span class="stringliteral">"Number of facilities."</span>);</div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"><a class="line" href="facility__lp__benders_8cc.html#a187b2452ce7ffbf3dc80a9c6ccc8b4d4"> 37</a></span> <a class="code" href="facility__lp__benders_8cc.html#ab408ded47ed4632487b6f538ae4df9d0">ABSL_FLAG</a>(<span class="keywordtype">int</span>, num_locations, 50, <span class="stringliteral">"Number of locations."</span>);</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"><a class="line" href="facility__lp__benders_8cc.html#a589d83de6bdfda324029266b63574e44"> 38</a></span> <a class="code" href="facility__lp__benders_8cc.html#ab408ded47ed4632487b6f538ae4df9d0">ABSL_FLAG</a>(<span class="keywordtype">double</span>, edge_probability, 0.99, <span class="stringliteral">"Edge probability."</span>);</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"><a class="line" href="facility__lp__benders_8cc.html#ab26c80732ec6702942ce6b3d16027861"> 39</a></span> <a class="code" href="facility__lp__benders_8cc.html#ab408ded47ed4632487b6f538ae4df9d0">ABSL_FLAG</a>(<span class="keywordtype">double</span>, benders_precission, 1e-9, <span class="stringliteral">"Benders target precission."</span>);</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"><a class="line" href="facility__lp__benders_8cc.html#a3d6782a997bb7c460159f23717a3a622"> 40</a></span> <a class="code" href="facility__lp__benders_8cc.html#ab408ded47ed4632487b6f538ae4df9d0">ABSL_FLAG</a>(<span class="keywordtype">double</span>, location_demand, 1, <span class="stringliteral">"Client demands."</span>);</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"><a class="line" href="facility__lp__benders_8cc.html#a70ca27183ea1caa3da0c437d9124d7b2"> 41</a></span> <a class="code" href="facility__lp__benders_8cc.html#ab408ded47ed4632487b6f538ae4df9d0">ABSL_FLAG</a>(<span class="keywordtype">double</span>, facility_cost, 100, <span class="stringliteral">"Facility capacity cost."</span>);</div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"><a class="line" href="facility__lp__benders_8cc.html#a36423080607ac8d3b16d220c1f4d0c62"> 42</a></span> <a class="code" href="facility__lp__benders_8cc.html#ab408ded47ed4632487b6f538ae4df9d0">ABSL_FLAG</a>(</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keywordtype">double</span>, location_fraction, 0.001,</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="stringliteral">"Fraction of a facility's capacity that can be used by each location."</span>);</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  </div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> using ::operations_research::math_opt::GurobiParametersProto;</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> using ::operations_research::math_opt::LinearConstraint;</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> using ::operations_research::math_opt::LinearExpression;</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> using ::operations_research::math_opt::MathOpt;</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> using ::operations_research::math_opt::Objective;</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> using ::operations_research::math_opt::Result;</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> using ::operations_research::math_opt::SolveParametersProto;</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> using ::operations_research::math_opt::SolveResultProto;</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <a class="code" href="namespaceoperations__research_1_1math__opt.html#a2d3e7a73de1ae32066be431b5e68f613">using ::operations_research::math_opt::Sum</a>;</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span> using ::operations_research::math_opt::Variable;</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  </div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment">// First element is a facility and second is a location.</span></div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="keyword">using</span> Edge = std::pair<int, int>;</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  </div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment">// A simple randomly-generated facility-location network.</span></div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="keyword">class </span>Network {</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  Network(<span class="keywordtype">int</span> num_facilities, <span class="keywordtype">int</span> num_locations, <span class="keywordtype">double</span> edge_probability);</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  </div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordtype">int</span> num_facilities()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> num_facilities_; }</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordtype">int</span> num_locations()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> num_locations_; }</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  </div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keyword">const</span> std::vector<Edge>& edges()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> edges_; }</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  </div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keyword">const</span> std::vector<Edge>& edges_incident_to_facility(</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> facility)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">return</span> facility_edge_incidence_[facility];</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  }</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  </div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keyword">const</span> std::vector<Edge>& edges_incident_to_location(</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> location)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">return</span> location_edge_incidence_[location];</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  }</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  </div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordtype">double</span> edge_cost(<span class="keyword">const</span> Edge& edge)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> edge_costs_.at(edge); }</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  </div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordtype">int</span> num_facilities_;</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordtype">int</span> num_locations_;</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">// No order is assumed for the following lists of edges.</span></div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  std::vector<Edge> edges_;</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  absl::flat_hash_map<Edge, double> edge_costs_;</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  std::vector<std::vector<Edge>> facility_edge_incidence_;</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  std::vector<std::vector<Edge>> location_edge_incidence_;</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span> };</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  </div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> Network::Network(<span class="keyword">const</span> <span class="keywordtype">int</span> num_facilities, <span class="keyword">const</span> <span class="keywordtype">int</span> num_locations,</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> edge_probability) {</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  absl::BitGen bitgen;</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  </div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  num_facilities_ = num_facilities;</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  num_locations_ = num_locations;</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  facility_edge_incidence_ =</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  std::vector<std::vector<std::pair<int, int>>>(num_facilities);</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  location_edge_incidence_ = std::vector<std::vector<std::pair<int, int>>>(</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  num_locations, std::vector<std::pair<int, int>>());</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> facility = 0; facility < num_facilities_; ++facility) {</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> location = 0; location < num_locations_; ++location) {</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">if</span> (absl::Bernoulli(bitgen, edge_probability)) {</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keyword">const</span> std::pair<int, int> edge({facility, location});</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  facility_edge_incidence_[facility].push_back(edge);</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  location_edge_incidence_[location].push_back(edge);</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  edges_.push_back(edge);</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  edge_costs_.insert({edge, absl::Uniform(bitgen, 0, 1.0)});</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  }</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  }</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  }</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="comment">// Ensure every facility is connected to at least one location and every</span></div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="comment">// location is connected to at least one facility.</span></div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> facility = 0; facility < num_facilities; ++facility) {</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keyword">auto</span>& locations = facility_edge_incidence_[facility];</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">if</span> (locations.empty()) {</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> location =</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  absl::uniform_int_distribution<int>(0, num_locations - 1)(bitgen);</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keyword">const</span> std::pair<int, int> edge({facility, location});</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  locations.push_back(edge);</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  location_edge_incidence_[location].push_back(edge);</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  edges_.push_back(edge);</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  edge_costs_.insert({edge, absl::Uniform(bitgen, 0, 1.0)});</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  }</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  }</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> location = 0; location < num_locations; ++location) {</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keyword">auto</span>& facilities = location_edge_incidence_[location];</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordflow">if</span> (facilities.empty()) {</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> facility =</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  absl::uniform_int_distribution<int>(0, num_facilities - 1)(bitgen);</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keyword">const</span> std::pair<int, int> edge({facility, location});</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  facilities.push_back(edge);</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  facility_edge_incidence_[facility].push_back(edge);</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  edges_.push_back(edge);</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  edge_costs_.insert({edge, absl::Uniform(bitgen, 0, 1.0)});</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  }</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  }</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span> }</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  </div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> constexpr <span class="keywordtype">double</span> <a class="code" href="namespaceoperations__research_1_1math__opt.html#ad9f50c9313b35cc1e8887057dc4d9645">kInf</a> = std::numeric_limits<double>::infinity();</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  </div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="comment">// We consider a network design problem where each location has a demand that</span></div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="comment">// must be met by its neighboring facilities, and each facility can control</span></div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment">// its total capacity. In this version we also require that locations cannot</span></div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment">// use more that a specified fraction of a facilities capacity.</span></div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment">// Problem data:</span></div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="comment">// * F: set of facilities.</span></div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="comment">// * L: set of locations.</span></div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="comment">// * E: subset of {(f,l) : f in F, l in L} that describes the network between</span></div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="comment">// facilities and locations.</span></div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="comment">// * d: demand at location (all demands are equal for simplicity).</span></div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="comment">// * c: cost per unit of capacity at a facility (all facilities are have the</span></div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="comment">// same cost for simplicity).</span></div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment">// * h: cost per unit transported through an edge.</span></div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment">// * a: fraction of a facility's capacity that can be used by each location.</span></div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="comment">// Decision variables:</span></div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment">// * z_f: capacity at facility f in F.</span></div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="comment">// * x_(f,l): flow from facility f to location l for all (f,l) in E.</span></div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment">// Formulation:</span></div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment">// min c * sum(z_f : f in F) + sum(h_e * x_e : e in E)</span></div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="comment">// s.t.</span></div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="comment">// x_(f,l) <= a * z_f for all (f,l) in E</span></div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="comment">// sum(x_(f,l) : l such that (f,l) in E) <= z_f for all f in F</span></div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span> <span class="comment">// sum(x_(f,l) : f such that (f,l) in E) >= d for all l in L</span></div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="comment">// x_e >= 0 for all e in E</span></div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="comment">// z_f >= 0 for all f in F</span></div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="keywordtype">void</span> FullProblem(<span class="keyword">const</span> Network& network, <span class="keyword">const</span> <span class="keywordtype">double</span> location_demand,</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> facility_cost, <span class="keyword">const</span> <span class="keywordtype">double</span> location_fraction) {</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_facilities = network.num_facilities();</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_locations = network.num_locations();</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  </div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  MathOpt <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>(operations_research::math_opt::SOLVER_TYPE_GUROBI,</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="stringliteral">"Full network design problem"</span>);</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keyword">const</span> Objective objective = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.objective();</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  objective.set_minimize();</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  </div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="comment">// Capacity variables</span></div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  std::vector<Variable> z;</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < num_facilities; j++) {</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keyword">const</span> Variable z_j = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.AddContinuousVariable(0.0, <a class="code" href="namespaceoperations__research_1_1math__opt.html#ad9f50c9313b35cc1e8887057dc4d9645">kInf</a>);</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  z.push_back(z_j);</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  objective.set_linear_coefficient(z_j, facility_cost);</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  }</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  </div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="comment">// Flow variables</span></div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  absl::flat_hash_map<Edge, Variable> x;</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& edge : network.edges()) {</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keyword">const</span> Variable x_edge = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.AddContinuousVariable(0.0, <a class="code" href="namespaceoperations__research_1_1math__opt.html#ad9f50c9313b35cc1e8887057dc4d9645">kInf</a>);</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  x.insert({edge, x_edge});</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  objective.set_linear_coefficient(x_edge, network.edge_cost(edge));</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  }</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  </div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="comment">// Demand constraints</span></div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> location = 0; location < num_locations; ++location) {</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  LinearExpression linear_expression;</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& edge : network.edges_incident_to_location(location)) {</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  linear_expression += x.at(edge);</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  }</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.AddLinearConstraint(linear_expression >= location_demand);</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  }</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  </div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="comment">// Supply constraints</span></div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> facility = 0; facility < num_facilities; ++facility) {</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  LinearExpression linear_expression;</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& edge : network.edges_incident_to_facility(facility)) {</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  linear_expression += x.at(edge);</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  }</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.AddLinearConstraint(linear_expression <= z[facility]);</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  }</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  </div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="comment">// Arc constraints</span></div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> facility = 0; facility < num_facilities; ++facility) {</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& edge : network.edges_incident_to_facility(facility)) {</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.AddLinearConstraint(x.at(edge) <= location_fraction * z[facility]);</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  }</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  }</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keyword">const</span> Result result = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>.Solve(SolveParametersProto()).value();</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& warning : result.warnings) {</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#a50e5762f38854b37ee3e2851bc1bb0e7">WARNING</a>) << <span class="stringliteral">"Solver warning: "</span> << warning << std::endl;</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  }</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <a class="code" href="base_2logging_8h.html#acdd435d10e595c91b6861a233b8e8432">QCHECK_EQ</a>(result.termination_reason, <a class="code" href="namespaceoperations__research_1_1data_1_1vbp.html#a4604191fbd84a43686f44c25d7bd0161a2579881e7c83261bc21bafb5a5c92cad">SolveResultProto::OPTIMAL</a>)</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  << <span class="stringliteral">"Failed to find an optimal solution: "</span> << result.termination_detail;</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  std::cout << <span class="stringliteral">"Full problem optimal objective: "</span></div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  << absl::StrFormat(<span class="stringliteral">"%.9f"</span>, result.objective_value()) << std::endl;</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span> }</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  </div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span> <span class="keywordtype">void</span> Benders(<span class="keyword">const</span> Network network, <span class="keyword">const</span> <span class="keywordtype">double</span> location_demand,</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> facility_cost, <span class="keyword">const</span> <span class="keywordtype">double</span> location_fraction,</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> target_precission,</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> maximum_iterations = 30000) {</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_facilities = network.num_facilities();</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_locations = network.num_locations();</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  </div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="comment">// Setup first stage model.</span></div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="comment">// min c * sum(z_f : f in F) + w</span></div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="comment">// s.t.</span></div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="comment">// z_f >= 0 for all f in F</span></div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="comment">// sum(fcut_f^i z_f) + fcut_const^i <= 0 for i = 1,...</span></div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="comment">// sum(ocut_f^j z_f) + ocut_const^j <= w for j = 1,...</span></div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  MathOpt first_stage_model(operations_research::math_opt::SOLVER_TYPE_GUROBI,</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="stringliteral">"First stage problem"</span>);</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  std::vector<Variable> z;</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < num_facilities; j++) {</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  z.push_back(first_stage_model.AddContinuousVariable(0.0, <a class="code" href="namespaceoperations__research_1_1math__opt.html#ad9f50c9313b35cc1e8887057dc4d9645">kInf</a>));</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  }</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  </div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keyword">const</span> Variable w = first_stage_model.AddContinuousVariable(0.0, <a class="code" href="namespaceoperations__research_1_1math__opt.html#ad9f50c9313b35cc1e8887057dc4d9645">kInf</a>);</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  </div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  first_stage_model.objective().Minimize(facility_cost * <a class="code" href="namespaceoperations__research_1_1math__opt.html#a2d3e7a73de1ae32066be431b5e68f613">Sum</a>(z) + w);</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  </div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  SolveParametersProto first_stage_params;</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  first_stage_params.mutable_common_parameters()->set_enable_output(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  </div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="comment">// Setup second stage model.</span></div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="comment">// min sum(h_e * x_e : e in E)</span></div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="comment">// s.t.</span></div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="comment">// x_(f,l) <= a * zz_f for all (f,l) in E</span></div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="comment">// sum(x_(f,l) : l such that (f,l) in E) <= zz_f for all f in F</span></div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="comment">// sum(x_(f,l) : f such that (f,l) in E) >= d for all l in L</span></div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="comment">// x_e >= 0 for all e in E</span></div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="comment">// where zz_f are fixed values for z_f from the first stage model.</span></div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  MathOpt second_stage_model(operations_research::math_opt::SOLVER_TYPE_GUROBI,</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="stringliteral">"Second stage model"</span>);</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keyword">const</span> Objective second_stage_objective = second_stage_model.objective();</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  second_stage_objective.set_minimize();</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  absl::flat_hash_map<Edge, Variable> x;</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& edge : network.edges()) {</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keyword">const</span> Variable x_edge = second_stage_model.AddContinuousVariable(0.0, <a class="code" href="namespaceoperations__research_1_1math__opt.html#ad9f50c9313b35cc1e8887057dc4d9645">kInf</a>);</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  x.insert({edge, x_edge});</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  second_stage_objective.set_linear_coefficient(x_edge,</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  network.edge_cost(edge));</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  }</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  std::vector<LinearConstraint> demand_constraints;</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  </div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> location = 0; location < num_locations; ++location) {</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  LinearExpression linear_expression;</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& edge : network.edges_incident_to_location(location)) {</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  linear_expression += x.at(edge);</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  }</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  demand_constraints.push_back(second_stage_model.AddLinearConstraint(</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  linear_expression >= location_demand));</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  }</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  std::vector<LinearConstraint> supply_constraints;</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> facility = 0; facility < num_facilities; ++facility) {</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  LinearExpression linear_expression;</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& edge : network.edges_incident_to_facility(facility)) {</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  linear_expression += x.at(edge);</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  }</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  supply_constraints.push_back(</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  second_stage_model.AddLinearConstraint(linear_expression <= <a class="code" href="namespaceoperations__research_1_1math__opt.html#ad9f50c9313b35cc1e8887057dc4d9645">kInf</a>));</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  }</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  </div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  SolveParametersProto second_stage_params;</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  second_stage_params.mutable_common_parameters()->set_enable_output(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  GurobiParametersProto::Parameter* param1 =</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  second_stage_params.mutable_gurobi_parameters()->add_parameters();</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  param1->set_name(<span class="stringliteral">"InfUnbdInfo"</span>);</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  param1->set_value(<span class="stringliteral">"1"</span>);</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  </div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="comment">// Start Benders</span></div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordtype">int</span> iteration = 0;</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordtype">double</span> best_upper_bound = <a class="code" href="namespaceoperations__research_1_1math__opt.html#ad9f50c9313b35cc1e8887057dc4d9645">kInf</a>;</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << <span class="stringliteral">"Iteration: "</span> << iteration;</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="comment">// Solve and process first stage.</span></div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keyword">const</span> Result first_stage_result =</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  first_stage_model.Solve(first_stage_params).value();</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& warning : first_stage_result.warnings) {</div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#a50e5762f38854b37ee3e2851bc1bb0e7">WARNING</a>) << <span class="stringliteral">"Solver warning: "</span> << warning << std::endl;</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  }</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <a class="code" href="base_2logging_8h.html#acdd435d10e595c91b6861a233b8e8432">QCHECK_EQ</a>(first_stage_result.termination_reason, <a class="code" href="namespaceoperations__research_1_1data_1_1vbp.html#a4604191fbd84a43686f44c25d7bd0161a2579881e7c83261bc21bafb5a5c92cad">SolveResultProto::OPTIMAL</a>);</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a> = first_stage_result.objective_value();</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << <span class="stringliteral">"LB = "</span> << <a class="code" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>;</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  </div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="comment">// Setup second stage.</span></div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> facility = 0; facility < num_facilities; ++facility) {</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> capacity_value =</div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  first_stage_result.variable_values().at(z[facility]);</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& edge : network.edges_incident_to_facility(facility)) {</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  x.at(edge).set_upper_bound(location_fraction * capacity_value);</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  }</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  supply_constraints[facility].set_upper_bound(capacity_value);</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  }</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  </div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="comment">// Solve and process second stage.</span></div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keyword">const</span> Result second_stage_result =</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  second_stage_model.Solve(second_stage_params).value();</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& warning : second_stage_result.warnings) {</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#a50e5762f38854b37ee3e2851bc1bb0e7">WARNING</a>) << <span class="stringliteral">"Solver warning: "</span> << warning << std::endl;</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  }</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">if</span> (second_stage_result.termination_reason ==</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <a class="code" href="namespaceoperations__research_1_1data_1_1vbp.html#a4604191fbd84a43686f44c25d7bd0161a2884fa43446c0cbc9c7a9b74d41d7483">SolveResultProto::INFEASIBLE</a>) {</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="comment">// If the second stage problem is infeasible we will get a dual ray</span></div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="comment">// (r, y) such that</span></div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="comment">// sum(r_(f,l)*a*zz_f : (f,l) in E, r_(f,l) < 0)</span></div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="comment">// + sum(y_f*zz_f : f in F, y_f < 0)</span></div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="comment">// + sum(y_l*d : l in L, y_l > 0) > 0.</span></div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="comment">// Then we get the feasibility cut (go/mathopt-advanced-dual-use#benders)</span></div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="comment">// sum(fcut_f*z_f) + fcut_const <= 0,</span></div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="comment">// where</span></div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="comment">// fcut_f = sum(r_(f,l)*a : (f,l) in E, r_(f,l) < 0)</span></div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="comment">// + min{y_f, 0}</span></div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="comment">// fcut_const = sum*(y_l*d : l in L, y_l > 0)</span></div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << <span class="stringliteral">"Adding feasibility cut..."</span>;</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  LinearExpression feasibility_cut_expression;</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> facility = 0; facility < num_facilities; ++facility) {</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keywordtype">double</span> <a class="code" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a> = 0.0;</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& edge : network.edges_incident_to_facility(facility)) {</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> reduced_cost =</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  second_stage_result.ray_reduced_costs().at(x.at(edge));</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keywordflow">if</span> (reduced_cost < 0) {</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <a class="code" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a> += location_fraction * reduced_cost;</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  }</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  }</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keywordtype">double</span> dual_value = second_stage_result.ray_dual_values().at(</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  supply_constraints[facility]);</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <a class="code" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a> += <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(dual_value, 0.0);</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  feasibility_cut_expression += <a class="code" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a> * z[facility];</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  }</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keywordtype">double</span> constant = 0.0;</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& constraint : demand_constraints) {</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keywordtype">double</span> dual_value =</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  second_stage_result.ray_dual_values().at(constraint);</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keywordflow">if</span> (dual_value > 0) {</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  constant += dual_value;</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  }</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  }</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  first_stage_model.AddLinearConstraint(</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  feasibility_cut_expression + constant <= 0.0);</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="comment">// If the second stage problem is optimal we will get a dual solution</span></div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="comment">// (r, y) such that the optimal objective value is equal to</span></div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="comment">// sum(r_(f,l)*a*zz_f : (f,l) in E, r_(f,l) < 0)</span></div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="comment">// + sum(y_f*zz_f : f in F, y_f < 0)</span></div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="comment">// + sum*(y_l*d : l in L, y_l > 0) > 0.</span></div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="comment">// Then we get the optimality cut (go/mathopt-advanced-dual-use#benders)</span></div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="comment">// sum(ocut_f*z_f) + ocut_const <= w,</span></div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="comment">// where</span></div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="comment">// ocut_f = sum(r_(f,l)*a : (f,l) in E, r_(f,l) < 0)</span></div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="comment">// + min{y_f, 0}</span></div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="comment">// ocut_const = sum*(y_l*d : l in L, y_l > 0)</span></div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <a class="code" href="base_2logging_8h.html#acdd435d10e595c91b6861a233b8e8432">QCHECK_EQ</a>(second_stage_result.termination_reason,</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <a class="code" href="namespaceoperations__research_1_1data_1_1vbp.html#a4604191fbd84a43686f44c25d7bd0161a2579881e7c83261bc21bafb5a5c92cad">SolveResultProto::OPTIMAL</a>);</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << <span class="stringliteral">"Adding optimality cut..."</span>;</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  LinearExpression optimality_cut_expression;</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keywordtype">double</span> <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> = 0.0;</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> facility = 0; facility < num_facilities; ++facility) {</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keywordtype">double</span> <a class="code" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a> = 0.0;</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& edge : network.edges_incident_to_facility(facility)) {</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> += network.edge_cost(edge) *</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  second_stage_result.variable_values().at(x.at(edge));</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> reduced_cost =</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  second_stage_result.reduced_costs().at(x.at(edge));</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keywordflow">if</span> (reduced_cost < 0) {</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <a class="code" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a> += location_fraction * reduced_cost;</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  }</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  }</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keywordtype">double</span> dual_value =</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  second_stage_result.dual_values().at(supply_constraints[facility]);</div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <a class="code" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a> += <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(dual_value, 0.0);</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  optimality_cut_expression += <a class="code" href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a> * z[facility];</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  }</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keywordtype">double</span> constant = 0.0;</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& constraint : demand_constraints) {</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keywordtype">double</span> dual_value = second_stage_result.dual_values().at(constraint);</div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keywordflow">if</span> (dual_value > 0) {</div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  constant += dual_value;</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  }</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  }</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="comment">// Add first stage contribution to upper bound = facility_cost * Sum(z)</span></div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> += first_stage_result.objective_value() -</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  first_stage_result.variable_values().at(w);</div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  best_upper_bound = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(best_upper_bound, <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>);</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  </div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  first_stage_model.AddLinearConstraint(</div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  optimality_cut_expression + constant <= w);</div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  }</div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a>) << <span class="stringliteral">"UB = "</span> << best_upper_bound;</div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  ++iteration;</div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keywordflow">if</span> (best_upper_bound - <a class="code" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a> < target_precission) {</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  std::cout << <span class="stringliteral">"Total iterations = "</span> << iteration << std::endl;</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  std::cout << <span class="stringliteral">"Final LB = "</span> << absl::StrFormat(<span class="stringliteral">"%.9f"</span>, <a class="code" href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a>)</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  << std::endl;</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  std::cout << <span class="stringliteral">"Final UB = "</span> << absl::StrFormat(<span class="stringliteral">"%.9f"</span>, best_upper_bound)</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  << std::endl;</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  }</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keywordflow">if</span> (iteration > maximum_iterations) {</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  }</div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  }</div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span> }</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  </div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  </div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"><a class="line" href="facility__lp__benders_8cc.html#a3c04138a5bfe5d72780bb7e82a18e627"> 454</a></span> <span class="keywordtype">int</span> <a class="code" href="facility__lp__benders_8cc.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span>** argv) {</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <a class="code" href="namespacegoogle.html#a1749056ff206ebc4f581e6bc0bae841d">google::InitGoogleLogging</a>(argv[0]);</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span> absl::ParseCommandLine(argc, argv);</div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="keyword">const</span> Network network(absl::GetFlag(FLAGS_num_facilities),</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  absl::GetFlag(FLAGS_num_locations),</div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  absl::GetFlag(FLAGS_edge_probability));</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  absl::Time start = absl::Now();</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  FullProblem(network, absl::GetFlag(FLAGS_location_demand),</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  absl::GetFlag(FLAGS_facility_cost),</div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  absl::GetFlag(FLAGS_location_fraction));</div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  std::cout << <span class="stringliteral">"Full solve time : "</span> << absl::Now() - start << std::endl;</div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  start = absl::Now();</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  Benders(network, absl::GetFlag(FLAGS_location_demand),</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  absl::GetFlag(FLAGS_facility_cost),</div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  absl::GetFlag(FLAGS_location_fraction),</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  absl::GetFlag(FLAGS_benders_precission));</div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  std::cout << <span class="stringliteral">"Benders solve time : "</span> << absl::Now() - start << std::endl;</div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span> }</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_accad43a85d781d53381cd53a9894b6ae"><div class="ttname"><a href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a></div><div class="ttdeci">#define LOG(severity)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00423">base/logging.h:423</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_acdd435d10e595c91b6861a233b8e8432"><div class="ttname"><a href="base_2logging_8h.html#acdd435d10e595c91b6861a233b8e8432">QCHECK_EQ</a></div><div class="ttdeci">#define QCHECK_EQ</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00040">base/logging.h:40</a></div></div>
|
|
<div class="ttc" id="afacility__lp__benders_8cc_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="facility__lp__benders_8cc.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> <a href="facility__lp__benders_8cc_source.html#l00454">facility_lp_benders.cc:454</a></div></div>
|
|
<div class="ttc" id="afacility__lp__benders_8cc_html_ab408ded47ed4632487b6f538ae4df9d0"><div class="ttname"><a href="facility__lp__benders_8cc.html#ab408ded47ed4632487b6f538ae4df9d0">ABSL_FLAG</a></div><div class="ttdeci">ABSL_FLAG(int, num_facilities, 3000, "Number of facilities.")</div></div>
|
|
<div class="ttc" id="agscip__solver_8cc_html_a1ba5ca0f61f2fa13bd23bf0f89004f35"><div class="ttname"><a href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a></div><div class="ttdeci">double upper_bound</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00126">gscip_solver.cc:126</a></div></div>
|
|
<div class="ttc" id="agscip__solver_8cc_html_a1e2f9a2352c1d9a6cada9544898fceec"><div class="ttname"><a href="gscip__solver_8cc.html#a1e2f9a2352c1d9a6cada9544898fceec">lower_bound</a></div><div class="ttdeci">double lower_bound</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00125">gscip_solver.cc:125</a></div></div>
|
|
<div class="ttc" id="agurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00273">gurobi_interface.cc:273</a></div></div>
|
|
<div class="ttc" id="alog__severity_8h_html_a50e5762f38854b37ee3e2851bc1bb0e7"><div class="ttname"><a href="log__severity_8h.html#a50e5762f38854b37ee3e2851bc1bb0e7">WARNING</a></div><div class="ttdeci">const int WARNING</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00031">log_severity.h:31</a></div></div>
|
|
<div class="ttc" id="alog__severity_8h_html_ab4a2cbab234914b320b7fae11b6e8cb9"><div class="ttname"><a href="log__severity_8h.html#ab4a2cbab234914b320b7fae11b6e8cb9">INFO</a></div><div class="ttdeci">const int INFO</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00031">log_severity.h:31</a></div></div>
|
|
<div class="ttc" id="amath__opt_8h_html"><div class="ttname"><a href="math__opt_8h.html">math_opt.h</a></div></div>
|
|
<div class="ttc" id="anamespacegoogle_html_a1749056ff206ebc4f581e6bc0bae841d"><div class="ttname"><a href="namespacegoogle.html#a1749056ff206ebc4f581e6bc0bae841d">google::InitGoogleLogging</a></div><div class="ttdeci">void InitGoogleLogging(const char *argv0)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8cc_source.html#l01873">base/logging.cc:1873</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1data_1_1vbp_html_a4604191fbd84a43686f44c25d7bd0161a2579881e7c83261bc21bafb5a5c92cad"><div class="ttname"><a href="namespaceoperations__research_1_1data_1_1vbp.html#a4604191fbd84a43686f44c25d7bd0161a2579881e7c83261bc21bafb5a5c92cad">operations_research::data::vbp::OPTIMAL</a></div><div class="ttdeci">@ OPTIMAL</div><div class="ttdef"><b>Definition:</b> <a href="vector__bin__packing_8pb_8h_source.html#l00088">vector_bin_packing.pb.h:88</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1data_1_1vbp_html_a4604191fbd84a43686f44c25d7bd0161a2884fa43446c0cbc9c7a9b74d41d7483"><div class="ttname"><a href="namespaceoperations__research_1_1data_1_1vbp.html#a4604191fbd84a43686f44c25d7bd0161a2884fa43446c0cbc9c7a9b74d41d7483">operations_research::data::vbp::INFEASIBLE</a></div><div class="ttdeci">@ INFEASIBLE</div><div class="ttdef"><b>Definition:</b> <a href="vector__bin__packing_8pb_8h_source.html#l00090">vector_bin_packing.pb.h:90</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a2d3e7a73de1ae32066be431b5e68f613"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a2d3e7a73de1ae32066be431b5e68f613">operations_research::math_opt::Sum</a></div><div class="ttdeci">LinearExpression Sum(const Iterable &items)</div><div class="ttdef"><b>Definition:</b> <a href="variable__and__expressions_8h_source.html#l00929">variable_and_expressions.h:929</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_ad9f50c9313b35cc1e8887057dc4d9645"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#ad9f50c9313b35cc1e8887057dc4d9645">operations_research::math_opt::kInf</a></div><div class="ttdeci">constexpr double kInf</div><div class="ttdef"><b>Definition:</b> <a href="ids__validator_8cc_source.html#l00035">ids_validator.cc:35</a></div></div>
|
|
<div class="ttc" id="arouting__filters_8cc_html_a8e4ee19dee0e00541dbe9bbc83d806ba"><div class="ttname"><a href="routing__filters_8cc.html#a8e4ee19dee0e00541dbe9bbc83d806ba">coefficient</a></div><div class="ttdeci">int64_t coefficient</div><div class="ttdef"><b>Definition:</b> <a href="routing__filters_8cc_source.html#l00985">routing_filters.cc:985</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_1defc00030ff81d309105e053121082f.html">math_opt</a></li><li class="navelem"><a class="el" href="dir_3bd02ac87f5b0db9cb39c07cebf04b13.html">examples</a></li><li class="navelem"><a class="el" href="facility__lp__benders_8cc.html">facility_lp_benders.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.1 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|