Data

Tools

Indexes

Applications

Experiments

Open Source Science

tsa_basismerging

https://github.com/beltran99/tsa_basismerging

Science Score: 44.0%

This score indicates how likely this project is to be science-related based on various indicators:

  • ✓
    CITATION.cff file
    Found CITATION.cff file
  • ✓
    codemeta.json file
    Found codemeta.json file
  • ✓
    .zenodo.json file
    Found .zenodo.json file
  • ○
    DOI references
  • ○
    Academic publication links
  • ○
    Academic email domains
  • ○
    Institutional organization owner
  • ○
    JOSS paper metadata
  • ○
    Scientific vocabulary similarity
    Low similarity (8.1%) to scientific vocabulary
Last synced: 10 months ago · JSON representation ·

Repository

Basic Info
  • Host: GitHub
  • Owner: beltran99
  • License: mit
  • Language: Jupyter Notebook
  • Default Branch: main
  • Size: 1.57 MB
Statistics
  • Stars: 0
  • Watchers: 1
  • Forks: 0
  • Open Issues: 0
  • Releases: 0
Created over 1 year ago · Last pushed about 1 year ago
Metadata Files
Readme License Citation

README.md

TSA_BasisMerging

This repository contains the code and data for the case study of the paper "Towards time series aggregation with exact error quantification for optimization of energy systems".

Installation

  1. Clone the repository bash git clone https://github.com/beltran99/TSA_BasisMerging
  2. Create a conda environment bash conda env create -f environment.yml
  3. Once created, you can activate the environment as follows: bash conda activate bases_merging

Tutorial

The jupyter notebook example.ipynb contains a basic tutorial where one can learn to: 1. Solve a full model of the optimal transport problem case study. 2. Identify the set of unique bases from the solution of the full model. 3. Create and solve an aggregated model. 4. Create and solve bases mergers.

Experiments

  • The python script exhaustive_enumeration.py executes the exhaustive enumeration of all 4140 possible bases mergers given by the 8 bases found in the optimal transport problem case study and saves the results to the output file merger_enumeration.csv.
  • The python script com.py computes the CoM of all 4140 possible bases mergers given by the 8 bases found in the optimal transport problem case study and prints the results to the standard console output.
  • The python script exhaustive_strategy.py implements and executes the Exhaustive strategy for merging bases.
  • The python script greedy_strategy.py implements and executes the Greedy strategy for merging bases.
  • The python script greedyadjstrategy.py implements and executes the Greedy & Adjacent strategy for merging bases.

Owner

  • Login: beltran99
  • Kind: user

Citation (CITATION.cff) 

cff-version: 1.2.0
message: "If you use this software, please cite it as below."
authors:
  - family-names: Castro Gomez
    given-names: Beltran
    orcid: https://orcid.org/0009-0009-2045-4820
title: "TSA: Basis Merging Methodology"
date-released: 2025-02-11

GitHub Events

Total
  • Push event: 5
  • Create event: 2
Last Year
  • Push event: 5
  • Create event: 2