A bus trip planner application for windows desktops coded in C++11, capable of finding the optimal trip between two locations through the Nottingham City bus network in less than 2 milliseconds.
- User inputs an unlimited number of bus timetables.
- User inputs walking times between bus stations.
- User request timetable and walking times to be read from input files, OR from database constructed from input files entered on previous run of application.
- User inputs real time deviations from timetables, indicating current route departures which are running early, late or have been cancelled.
- User inputs trip specification: start time, start location, destination location.
- User chooses interactive mode. In the default batch mode, program reads timetables and calculates one trip. In interactive mode the timetables are read once and the user can enter multiple trip planning requests.
- Application calculates shortest trip from start to destination, including necessary transfers between routes and walks between stations, taking into account any real time deviations using the Dijkstra shortest path algorithm.
- Display shows total trip time.
- Display shows wait at start station
- Display shows each station stop on trip
- Route number
- Station location
- Display shows, when necessary to transfer to another route
- Wait time
- Display shows, when necessary to walk between stations
- Walk time.
- Wait time.
Download complete documentation
Vase is an extensible process simulator that can handle both individual and continuous tasks. Examples of individual tasks are customers at a bank, cars on an assembly line, or documents in an office. Examples of continuous tasks are oil in a refinery or water in a river.
A source generates a task. The task moves through the process until it reaches a sink. The path of the task through the process depends on the nature of the task, the modifications which may occur to the task and the connections in the process.
The name Vase is based on an image of the process as a network of pipes and flowers. The pipes allow tasks to flow between flowers. The flowers are event handlers which modify the tasks and control their movement. The arrangement of flowers that define a process is called a vase.
Vase is designed to make it easy as possible to add specialized flowers ( event handlers ) with their own appearance and behaviour. Here are screenshots of two models using specialized flowers.
Sample Model: Pellet Dryer
This shows a model of a wood pellet drying plant. It has custom designed flowers which are not available in the open source code.
Sample Model: Fermenter
This shows the simulation of a fermentation process with Ex situ Butanol Recovery (ESBR) for biobutanol production. The simulation is based on this paper .
The screenshot shows the VASE process model: essentially a fermenter and an adsorber connected with a circulating flow. In the bottom right is a pop up where the user can enter starting conditions and parameters. In the background is a graph showing the results of a simulation run, with the sugar, ethanol and butanol concentrations in the fermenter plotted against time.
The ESBR model is under development, currently ( March 2016 ) the adsorber is being implemented. All the code is open source and is available in the VASE repository.
Raven’s Point contributed to the development of a calculation engine to perform Finite Element Analysis ( FEA ) of conveyor belt pulley designs. The FEA code was optimized and parallelized so that it ran in a few seconds, numerous consistency and design checks added, and a Bill of Materials and Operations implemented. The engine is currently in use here.
Added code timing profiler report in a string, so GUI applications can be profiled. cRunwatch
Today I reached 10,000 reputation points on stackoverflow.
A GUI for the boost graph library.
– Add named vertices.
– Specify pinned, fixed location for vertices
– Add edges connecting vertices
– Arrange vertices in a circle
– Arrange vertices according to their connections. This uses a modified implementation of the Kamada & Kawai algorithm that can handle pinned vertices and disconnected graphs.
– Arrange vertices manually by dragging with mouse
– Color vertices so no two connected vertices have same color
Complete Feature List