{"id":{"repo_id":"utahstate","oai_identifier":"oai:digitalcommons.usu.edu:etd-10012"},"canonical_url":"https://search.ndltd.org/etd/utahstate/oai:digitalcommons.usu.edu:etd-10012","repository":{"repo_id":"utahstate","name":"Utah State University","base_url":"https://digitalcommons.usu.edu/do/oai/"},"display":{"title":"A Scalable, Cost-Oriented Approach for Computing Charge Plans for Electric Bus Fleets","abstract":"Recent attention for reduced carbon emissions has pushed transit authorities to adopt battery electric buses (BEBs). One challenge experienced by BEB users is extended charge times, which create logistical challenges and may force BEBs to charge when energy is more expensive. Furthermore, BEB charging leads to high power demands, which can significantly increase monthly power costs and may push electrical infrastructure beyond its present capacity, requiring expensive upgrades. This work presents a novel method for minimizing the monthly cost of BEB charging while meeting bus route constraints. This method extends previous work by incorporating a more novel cost model, effects from uncontrolled loads, differences between daytime and overnight charging, and variable rate charging. We propose using mixed integer linear programs, to encode the charging action space, physical bus constraints, and battery state of charge dynamics. We also consider results for three scenarios: uncontested charging, which uses equal numbers of buses and chargers, contested charging, which has more buses than chargers, and variable charge rates. We desire to show that BEBs can be added to the fleet so that both the runtime of the planning framework and monthly cost increase linearly with the number of buses so that the charge planning framework is scalable.","abstract_html":"Recent attention for reduced carbon emissions has pushed transit authorities to adopt battery electric buses (BEBs). One challenge experienced by BEB users is extended charge times, which create logistical challenges and may force BEBs to charge when energy is more expensive. Furthermore, BEB charging leads to high power demands, which can significantly increase monthly power costs and may push electrical infrastructure beyond its present capacity, requiring expensive upgrades. This work presents a novel method for minimizing the monthly cost of BEB charging while meeting bus route constraints. This method extends previous work by incorporating a more novel cost model, effects from uncontrolled loads, differences between daytime and overnight charging, and variable rate charging. We propose using mixed integer linear programs, to encode the charging action space, physical bus constraints, and battery state of charge dynamics. We also consider results for three scenarios: uncontested charging, which uses equal numbers of buses and chargers, contested charging, which has more buses than chargers, and variable charge rates. We desire to show that BEBs can be added to the fleet so that both the runtime of the planning framework and monthly cost increase linearly with the number of buses so that the charge planning framework is scalable.","abstract_has_math":false,"creators":["Mortensen, Daniel T."],"institution":"Hosted by Utah State University Libraries","degree_name":"Doctor of Philosophy (PhD)","degree_level":"Dissertation","degree_discipline":"Electrical and Computer Engineering","degree_department":null,"school":null,"contributors":["Jacob Gunther","Todd Moon","Greg Droge"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:58:14Z","subjects":["Battery Electric Buses","Cost Minimization","Bin Packing","Mixed Integer Linear Program","Scalable","Electrical and Computer Engineering"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/bdb2-f743"],"render_values":[{"text":"https://doi.org/10.26076/bdb2-f743","href":"https://doi.org/10.26076/bdb2-f743","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usu.edu/etd/8861","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usu.edu/etd/8861","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.usu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usu.edu%3Aetd-10012","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Jacob Gunther","Todd Moon","Greg Droge"]},{"key":"dc:creator","label":"Author","values":["Mortensen, Daniel T."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2010-01-01T08:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2023-08-01T07:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["Hosted by Utah State University Libraries"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical and Computer Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy (PhD)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Battery Electric Buses","Cost Minimization","Bin Packing","Mixed Integer Linear Program","Scalable","Electrical and Computer Engineering"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usu.edu/etd/8861"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/bdb2-f743"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Recent attention for reduced carbon emissions has pushed transit authorities to adopt battery electric buses (BEBs). One challenge experienced by BEB users is extended charge times, which create logistical challenges and may force BEBs to charge when energy is more expensive. Furthermore, BEB charging leads to high power demands, which can significantly increase monthly power costs and may push electrical infrastructure beyond its present capacity, requiring expensive upgrades. This work presents a novel method for minimizing the monthly cost of BEB charging while meeting bus route constraints. This method extends previous work by incorporating a more novel cost model, effects from uncontrolled loads, differences between daytime and overnight charging, and variable rate charging. We propose using mixed integer linear programs, to encode the charging action space, physical bus constraints, and battery state of charge dynamics. We also consider results for three scenarios: uncontested charging, which uses equal numbers of buses and chargers, contested charging, which has more buses than chargers, and variable charge rates. We desire to show that BEBs can be added to the fleet so that both the runtime of the planning framework and monthly cost increase linearly with the number of buses so that the charge planning framework is scalable."]},{"key":"dc:title","label":"Title","values":["A Scalable, Cost-Oriented Approach for Computing Charge Plans for Electric Bus Fleets"]}]}],"canonical_facts":{"dc:contributor":["Jacob Gunther","Todd Moon","Greg Droge"],"dc:creator":["Mortensen, Daniel T."],"dc:date.available":["2010-01-01T08:00:00Z"],"dc:date.created":["2023-08-01T07:00:00Z"],"dc:description.abstract":["Recent attention for reduced carbon emissions has pushed transit authorities to adopt battery electric buses (BEBs). One challenge experienced by BEB users is extended charge times, which create logistical challenges and may force BEBs to charge when energy is more expensive. Furthermore, BEB charging leads to high power demands, which can significantly increase monthly power costs and may push electrical infrastructure beyond its present capacity, requiring expensive upgrades. This work presents a novel method for minimizing the monthly cost of BEB charging while meeting bus route constraints. This method extends previous work by incorporating a more novel cost model, effects from uncontrolled loads, differences between daytime and overnight charging, and variable rate charging. We propose using mixed integer linear programs, to encode the charging action space, physical bus constraints, and battery state of charge dynamics. We also consider results for three scenarios: uncontested charging, which uses equal numbers of buses and chargers, contested charging, which has more buses than chargers, and variable charge rates. We desire to show that BEBs can be added to the fleet so that both the runtime of the planning framework and monthly cost increase linearly with the number of buses so that the charge planning framework is scalable."],"dc:identifier":["https://digitalcommons.usu.edu/etd/8861"],"dc:identifier.doi":["https://doi.org/10.26076/bdb2-f743"],"dc:publisher":["Hosted by Utah State University Libraries"],"dc:subject":["Battery Electric Buses","Cost Minimization","Bin Packing","Mixed Integer Linear Program","Scalable","Electrical and Computer Engineering"],"dc:title":["A Scalable, Cost-Oriented Approach for Computing Charge Plans for Electric Bus Fleets"],"thesis:degree_discipline":["Electrical and Computer Engineering"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Doctor of Philosophy (PhD)"]},"updated_at":"2026-11-19T08:58:14Z"}