A Method for Determining Optimal Charging Infrastructures in Public Ferry Transportation Networks

Saved in:
Bibliographic Details
Title: A Method for Determining Optimal Charging Infrastructures in Public Ferry Transportation Networks
Authors: Kristensen, Joachim
Contributors: Dalmo, Rune, Pedersen, Aleksander
Publisher Information: UiT Norges arktiske universitet, 2023.
Publication Year: 2023
Subject Terms: VDP::Mathematics and natural science: 400::Mathematics: 410::Applied mathematics: 413, VDP::Matematikk og Naturvitenskap: 400::Informasjons- og kommunikasjonsvitenskap: 420::Teoretisk databehandling, programmeringsspråk og -teori: 421, VDP::Mathematics and natural science: 400::Information and communication science: 420::Theoretical computer science, programming languages and programming theory: 421, VDP::Mathematics and natural science: 400::Information and communication science: 420::Algorithms and computability theory: 422, VDP::Matematikk og Naturvitenskap: 400::Informasjons- og kommunikasjonsvitenskap: 420::Algoritmer og beregnbarhetsteori: 422, VDP::Matematikk og Naturvitenskap: 400::Matematikk: 410::Anvendt matematikk: 413
Description: In this thesis, we establish the theoretical foundation for determining the minimum requirements for charging infrastructures in networks where electric ferries operate on a fixed schedule. The problem - named the Multiple-Trip Electric Charging Station Placement (MT-ECSP) - is formulated as a 0-1 Integer Program, and is subsequently proven to be NP-hard. We construct several instances of the MT-ECSP, and solve them using Google OR-Tools CP-SAT solver in a simple application. The results show that the MT-ECSP is solveable both for theoretical and practical purposes.
Document Type: Master thesis
Language: English
Access URL: https://hdl.handle.net/10037/32872
Accession Number: edsair.nora.uio..no..a0e13ee4ba69c3b2667f138924c70811
Database: OpenAIRE
Description
Abstract:In this thesis, we establish the theoretical foundation for determining the minimum requirements for charging infrastructures in networks where electric ferries operate on a fixed schedule. The problem - named the Multiple-Trip Electric Charging Station Placement (MT-ECSP) - is formulated as a 0-1 Integer Program, and is subsequently proven to be NP-hard. We construct several instances of the MT-ECSP, and solve them using Google OR-Tools CP-SAT solver in a simple application. The results show that the MT-ECSP is solveable both for theoretical and practical purposes.