Emissions from commercial shipping are currently the subject of intense scrutiny. Among the top fuel-consuming categories of ships and hence air polluters are container vessels. The main reason is their high service speed. Lately, speed reduction has become a very popular operational measure to...

In this paper we examine computational complexity issues and develop algorithms for a class of "shoreline" single-vehicle routing and scheduling problems with release time constraints. Problems in this class are interesting for both practical and theoretical reasons. From a practical...

We explore dynamic programming solutions for a multi-commodity, capacitated pickup and delivery problem. Cargo flows are given by an origin/destination matrix which is not necessarily symmetric. This problem is a generalization of several known pickup and delivery problems, as regards both...

This paper examines the recent concession of the Port of Piraeus (OLP) container terminal to Cosco Pacific. Serious discussions on how to transform the terminal to landlord status started in 2004 and, after an aborted tender, a concession award was approved by the Greek parliament in 2009. The...

We develop an O(N2) heuristic to solve the single vehicle many-to-many Euclidean Dial-A-Ride problem. The heuristic is based on the Minimum Spanning Tree of the modes of the problem. The algorithm's worst case performance is four times the length of the optimal Dial-A-Ride tour. An analysis of...

A heuristic algorithm is described for a time-constrained version of the advance-request, multi-vehicle, many-to-many Dial-A-Ride Problem (DARP). The time constraints consist of upper bounds on: (1) the amount of time by which the pick-up or delivery of a customer can deviate from the desired...