| dc.description.abstract | A pilot project in Norway is currently being examined to give electric energy to construction sites in places where connection to the power grid is not available. This thesis proposes a generic mobile battery charging scheduling problem that entails charging batteries in a location where the grid has adequate capacity and then moving the batteries from the charging station to relevant construction sites that use battery-powered construction machines. The fundamental principle behind vehicle routing problems with a time window and battery electric transit vehicle scheduling problem has been useful for problem formulation. To address these formulations, mixed-integer linear programming, and large neighborhood search algorithms are being investigated. The optimization model is formulated as mixed-integer linear programming, with objective functions, constraints, and other important parameters, and then solved with the Microsoft Excel solver using a large neighborhood search algorithm. Two study cases are formulated: a simple optimization problem to help understand the notion of vehicle routing problem and a more complex scheduling problem based on a real-world scenario. | |
