Bradley Casey

Alternative algorithms for the optimization of a simulation model of a multimodal container terminal

Multimodal container terminals (MMCTs) are very complex and consequently require synchronization and balancing of container transfers at each node. The problem being investigated is the minimization of ship delays at the port by considering handling and travelling time of containers from the time the ship arrives at port until all the containers from that ship leave the port. When dealing with export containers, the problem would be that of the handling and travelling time of the containers from when they first arrive at the port until the ship carrying the containers departs from the port. Owing to the dynamic nature of the environment, a large number of timely decisions have been reviewed in accordance with the changing conditions of the MMCTs. The model has been run and tested with a small-size problem using CPLEX. A more realistic model is extremely difficult to solve and is in fact proven to be computationally intractable (NP-hard). Metaheuristics have been developed to deal with the intractability so that near-optimal solutions could be obtained in reasonable time.

Critical Review of Time-Dependent Shortest Path Algorithms: A Multimodal Trip Planner Perspective

Abstract A multimodal trip planner that produces optimal journeys involving both public transport and private vehicle legs has to solve a number of shortest path problems, both on the road network and the public transport network. The algorithms that are used to solve these shortest path problems have been researched since the late 1950s. However, in order to provide accurate journey plans that can be trusted by the user, the variability of travel times caused by traffic congestion must be taken into consideration. This requires the use of more sophisticated time-dependent shortest path algorithms, which have only been researched in depth over the last two decades, from the mid-1990s. This paper will review and compare nine algorithms that have been proposed in the literature, discussing the advantages and disadvantages of each algorithm on the basis of five important criteria that must be considered when choosing one or more of them to implement in a multimodal trip planner.

An innovative framework for customised intermodal and multiobjective trip planner

Efficient and reliable tools that help us to manage and plan our daily activities are an essential part of our busy life. Trip planner is one of the tools that not only helps to plan an unfamiliar journey but also is important for reliable planning of the dynamic daily travel. Numerous trip planners from bike apps to sophisticated airline based intercontinental travel are developed and implemented. Availability of a “truly intermodal” trip planner with real time information is the need of the hour, and is something which is currently not “truly” available. This paper presents the key architecture requirements for the development of the intermodal trip planners. It also discuss about the challenges in the development and implementation of a truly multimodal trip planner.