OilfieldToolsNet/opm-common
4
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Allow for multiple WELSEGS keywords for the same well

Browse Source
This commit is contained in:
Joakim Hove 2021-07-22 10:00:37 +02:00
parent 106cc727c8
commit 597c7017e1
6 changed files with 2607 additions and 62 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
CMakeLists_files.cmake
View File

@ -502,6 +502,7 @@ if(ENABLE_ECL_OUTPUT)
tests/TEST_WLIST.DATA
tests/act1.py
tests/MSW.DATA
tests/MSW_2WELSEGS.DATA
tests/EXIT_TEST.DATA
tests/action_syntax_error.py
tests/action_missing_run.py

12
opm/parser/eclipse/EclipseState/Schedule/MSW/WellSegments.hpp
View File

@ -69,6 +69,7 @@ namespace Opm {
WellSegments(CompPressureDrop compDrop,
const std::vector<Segment>& segments);
explicit WellSegments(const DeckKeyword& keyword);
void loadWELSEGS( const DeckKeyword& welsegsKeyword);
static WellSegments serializeObject();
@ -119,7 +120,16 @@ namespace Opm {
void processINC(double depth_top, double length_top);
void process(LengthDepth length_depth, double depth_top, double length_top);
void addSegment(const Segment& new_segment);
void loadWELSEGS( const DeckKeyword& welsegsKeyword);
void addSegment(int segment_number,
int branch,
int outlet_segment,
double length,
double depth,
double internal_diameter,
double roughness,
double cross_area,
double volume,
bool data_ready);
const Segment& topSegment() const;
// components of the pressure drop to be included

116
src/opm/parser/eclipse/EclipseState/Schedule/MSW/WellSegments.cpp
View File

@ -115,17 +115,36 @@ namespace Opm {
void WellSegments::addSegment( const Segment& new_segment ) {
// decide whether to push_back or insert
const int segment_number = new_segment.segmentNumber();
const int segment_index = segmentNumberToIndex(segment_number);
if (segment_index < 0) { // it is a new segment
segment_number_to_index[segment_number] = size();
segment_number_to_index[segment_number] = this->size();
m_segments.push_back(new_segment);
} else { // the segment already exists
} else
m_segments[segment_index] = new_segment;
}
}
void WellSegments::addSegment(int segment_number,
int branch,
int outlet_segment,
double length,
double depth,
double internal_diameter,
double roughness,
double cross_area,
double volume,
bool data_ready) {
Segment segment(segment_number, branch, outlet_segment, length, depth, internal_diameter, roughness, cross_area, volume, data_ready);
const int segment_index = this->segmentNumberToIndex(segment_number);
if (segment_index < 0) {
segment_number_to_index[segment_number] = this->size();
this->m_segments.push_back( std::move(segment) );
} else
this->m_segments[segment_index] = std::move(segment);
}
void WellSegments::loadWELSEGS( const DeckKeyword& welsegsKeyword ) {
// for the first record, which provides the information for the top segment
@ -141,40 +160,34 @@ namespace Opm {
// the main branch is 1 instead of 0
// the segment number for top segment is also 1
if (length_depth_type == LengthDepth::INC) {
m_segments.emplace_back( 1, 1, 0, 0., 0.,
invalid_value, invalid_value, invalid_value,
volume_top, false);
if (length_depth_type == LengthDepth::INC)
this->addSegment( 1, 1, 0, 0., 0.,
invalid_value, invalid_value, invalid_value,
volume_top, false);
} else if (length_depth_type == LengthDepth::ABS) {
m_segments.emplace_back( 1, 1, 0, length_top, depth_top,
invalid_value, invalid_value, invalid_value,
volume_top, true);
}
else if (length_depth_type == LengthDepth::ABS)
this->addSegment( 1, 1, 0, length_top, depth_top,
invalid_value, invalid_value, invalid_value,
volume_top, true);
// read all the information out from the DECK first then process to get all the required information
for (size_t recordIndex = 1; recordIndex < welsegsKeyword.size(); ++recordIndex) {
const auto& record = welsegsKeyword.getRecord(recordIndex);
const int segment1 = record.getItem("SEGMENT1").get< int >(0);
const int segment2 = record.getItem("SEGMENT2").get< int >(0);
if ((segment1 < 2) || (segment2 < segment1)) {
if ((segment1 < 2) || (segment2 < segment1))
throw std::logic_error("illegal segment number input is found in WELSEGS!\n");
}
// how to handle the logical relations between lateral branches and parent branches.
// so far, the branch number has not been used.
const int branch = record.getItem("BRANCH").get< int >(0);
if ((branch < 1)) {
if ((branch < 1))
throw std::logic_error("illegal branch number input is found in WELSEGS!\n");
}
const int outlet_segment_readin = record.getItem("JOIN_SEGMENT").get< int >(0);
double diameter = record.getItem("DIAMETER").getSIDouble(0);
const auto& itemArea = record.getItem("AREA");
double area;
if (itemArea.hasValue(0)) {
area = itemArea.getSIDouble(0);
} else {
area = M_PI * diameter * diameter / 4.0;
const double diameter = record.getItem("DIAMETER").getSIDouble(0);
double area = M_PI * diameter * diameter / 4.0;
{
const auto& itemArea = record.getItem("AREA");
if (itemArea.hasValue(0))
area = itemArea.getSIDouble(0);
}
// if the values are incremental values, then we can just use the values
@ -185,50 +198,39 @@ namespace Opm {
// naming following the definition from the current keyword for the moment
const double depth_change = record.getItem("DEPTH_CHANGE").getSIDouble(0);
const auto& itemVolume = record.getItem("VOLUME");
double volume;
if (itemVolume.hasValue(0)) {
volume = itemVolume.getSIDouble(0);
} else if (length_depth_type == LengthDepth::INC) {
volume = area * segment_length;
} else {
volume = invalid_value; // A * L, while L is not determined yet
double volume = invalid_value;
{
const auto& itemVolume = record.getItem("VOLUME");
if (itemVolume.hasValue(0))
volume = itemVolume.getSIDouble(0);
else if (length_depth_type == LengthDepth::INC)
volume = area * segment_length;
}
const double roughness = record.getItem("ROUGHNESS").getSIDouble(0);
for (int i = segment1; i <= segment2; ++i) {
for (int segment_number = segment1; segment_number <= segment2; ++segment_number) {
// for the first or the only segment in the range is the one specified in the WELSEGS
// from the second segment in the range, the outlet segment is the previous segment in the range
int outlet_segment;
if (i == segment1) {
outlet_segment = outlet_segment_readin;
} else {
outlet_segment = i - 1;
}
if (segment_number == segment1)
outlet_segment = record.getItem("JOIN_SEGMENT").get< int >(0);
else
outlet_segment = segment_number - 1;
if (length_depth_type == LengthDepth::INC) {
m_segments.emplace_back( i, branch, outlet_segment, segment_length, depth_change,
diameter, roughness, area, volume, false);
} else if (i == segment2) {
m_segments.emplace_back( i, branch, outlet_segment, segment_length, depth_change,
diameter, roughness, area, volume, true);
this->addSegment( segment_number, branch, outlet_segment, segment_length, depth_change,
diameter, roughness, area, volume, false);
} else if (segment_number == segment2) {
this->addSegment( segment_number, branch, outlet_segment, segment_length, depth_change,
diameter, roughness, area, volume, true);
} else {
m_segments.emplace_back( i, branch, outlet_segment, invalid_value, invalid_value,
diameter, roughness, area, volume, false);
this->addSegment( segment_number, branch, outlet_segment, invalid_value, invalid_value,
diameter, roughness, area, volume, false);
}
}
}
for (size_t i_segment = 0; i_segment < m_segments.size(); ++i_segment) {
const int segment_number = m_segments[i_segment].segmentNumber();
const int index = segmentNumberToIndex(segment_number);
if (index >= 0) { // found in the existing m_segments already
throw std::logic_error("Segments with same segment number are found!\n");
}
segment_number_to_index[segment_number] = i_segment;
}
for (size_t i_segment = 0; i_segment < m_segments.size(); ++i_segment) {
const int segment_number = m_segments[i_segment].segmentNumber();
const int outlet_segment = m_segments[i_segment].outletSegment();

10
src/opm/parser/eclipse/EclipseState/Schedule/Well/Well.cpp
View File

@ -1089,10 +1089,12 @@ void Well::updateSegments(std::shared_ptr<WellSegments> segments_arg) {
bool Well::handleWELSEGS(const DeckKeyword& keyword) {
if( this->segments )
throw std::logic_error("re-entering WELSEGS for a well is not supported yet!!.");
this->updateSegments( std::make_shared<WellSegments>(keyword) );
if (this->segments) {
auto new_segments = std::make_shared<WellSegments>( *this->segments );
new_segments->loadWELSEGS(keyword);
this->updateSegments(std::move(new_segments));
} else
this->updateSegments( std::make_shared<WellSegments>(keyword) );
return true;
}

2518
tests/MSW_2WELSEGS.DATA Normal file
View File

File diff suppressed because it is too large Load Diff

12
tests/parser/MultisegmentWellTests.cpp
View File

@ -651,3 +651,15 @@ BOOST_AUTO_TEST_CASE(Branches) {
std::set<int> expected = {1,2,3,4,5};
BOOST_CHECK( expected == segments.branches() );
}
BOOST_AUTO_TEST_CASE(MULTIPLE_WELSEGS) {
const auto& sched1 = make_schedule("MSW.DATA");
const auto& sched2 = make_schedule("MSW_2WELSEGS.DATA");
const auto& well1 = sched1.getWell("PROD01", 0);
const auto& segments1 = well1.getSegments();
const auto& well2 = sched2.getWell("PROD01", 0);
const auto& segments2 = well2.getSegments();
BOOST_CHECK(segments1 == segments2);
}