The document summarizes a proposed hybrid approach to solve the environmental multi-modal journey planning problem. It combines Dijkstra's algorithm to find the closest public transportation nodes to the start and end points, with a mixed integer linear program (MILP) to compute the optimal journey between those nodes that minimizes both travel time and environmental cost. The MILP uses constraints and an objective function involving costs, times, and decision variables to model potential journeys as an optimization problem and select the best option. Future work aims to improve the model and algorithm.