Skip to content

Armand394/set-covering-problem-optimization

View on GitHub ↗Related repositories →

This paper solves a bus scheduling problem with four locations and a depot for petrol- and electric buses. The problem is solved using the Single-Commodity Flow formulation and the Set Covering formulation. The main findings are that replacing regular buses with electric buses will come at a great cost.

active 2024-12-052024-12-05 (UTC)

Complete coverage26,669 / 26,669 hourly files (100%) · 2 absent upstream2023-08-152026-08-30 (UTC)
Events
4
Pushes
1
Pull requests
0
Issues
0
Stars
0
Forks
0

Activity over time

Daily event counts in the loaded window

Line chart, 1 days from 2024-12-05 to 2024-12-05. Pushes: 1 total, peak 1 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 0 total, peak 0 in a day.

  • Pushes
  • Pull requests
  • Issues
  • Comments
  • Stars

Top contributors

Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity

ContributorContributionsPushesPRsComments
Armand3941100

Recent activity

Latest issues, pull requests and releases

No issue or PR events — this repo's activity is pushes only.

Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 0 stars here means stars gained during the window, not the repo's star count.