Optimisation of the exploitation period of individual vehicles in freight transportation companies

The individual vehicle replacement problem typical for freight transportation companies is discussed in the paper. Two characteristic features of such problem are that transportation companies utilise vehicles with intensity decreasing with an age of vehicles and that managers of such companies first of all take into account economical criteria when planning vehicle replacements. The paper presents a single criterion, nonlinear, deterministic and discrete mathematical model of such a problem that minimises a total exploitation and ownership costs calculated per kilometre. The exact solution procedure is proposed here. The problem is solved as a real life case study. As a result, an average, economically optimal 5-year exploitation period of vehicles has been determined.     

A heuristic algorithm for yard truck scheduling and storage allocation problems

The yard truck scheduling and the storage allocation are two important decision problems affecting the efficiency of container terminal operations. This paper proposes a novel approach that integrates these two problems into a whole. The objective is to minimize the weighted sum of total delay of requests and the total travel time of yard trucks. Due to the intractability of the proposed problem, a hybrid insertion algorithm is designed for effective problem solutions. Computational experiments are conducted to examine the key factors of the problem and the performance of the proposed heuristic algorithm.     

Patterns of maritime supply chains: slot capacity analysis

This paper offers a tool for analysing patterns of maritime supply chains. The study uses empirical data on slot capacity deployed by container shipping lines for analysing ports (as nodes) and routes and shipping lines (as links) that are embedded within the maritime supply chain. The ports of Singapore and Hong Kong are chosen to illustrate the respective transhipment and gateway perspectives. Findings reveal that geographical location and changes in the constitution of players can have reverberations on the maritime supply chain dynamics that traverse the port. Furthermore, evidence from trade route data also shows that maritime supply chain dynamics associated with transhipment and gateway ports could be governed by different levels of scope economies, demand complementarity and market power. The paper illustrates the abundant potential of slot capacity analysis for academic and industry/market research. Thus, future research can be pursued in various contexts and for different applications.     

An optimization approach to aircraft dispatching strategy with maintenance cost – A case study

This paper presents an optimization approach to identify aircraft dispatching strategy at a flight training school. The strategy adopted by the school was to dispatch the aircraft which is closest to its scheduled maintenance. This strategy was examined and compared with other potential dispatching strategies. The paper presents a mixed integer linear programming model to identify the strategy that minimizes the total cost of scheduled maintenance. The analysis shows that the optimization approach can save 2%–5% on annual maintenance cost compared with other strategies. The model can equally be applied to rental cars or trucking companies.     

Container storage and transshipment marine terminals

This study addresses the storage arrangement of transshipment containers on a container yard, in order to carry out efficiently the ship handling operations at a terminal where mega-containerships call. An optimization model is specified to investigate the flow of containers from the mega-containership to feeder ships using intermediate storage at the yard. A heuristic based on the lagrangian relaxation is formulated. The quality of the heuristic approach is tested in a number of experiments. In the experiments, various situations are analyzed with respect to mega-containership arrival rates, some strategies for stack arrangements and terminal layouts.     

Multi-port vs. Hub-and-Spoke port calls by containerships

This paper addresses the design of container liner shipping networks taking into consideration container management issues including empty container repositioning. We examine two typical service networks with different ship sizes: multi-port calling by conventional ship size and hub-and-spoke by mega-ship. The entire solution process is performed in two phases: the service network design and container distribution. A wide variety of numerical experiments are conducted for the Asia–Europe and Asia–North America trade lanes. In most scenarios the multi-port calling is superior in terms of total cost, while the hub-and-spoke is more advantageous in the European trade for a costly shipping company.     

Shelter location and transportation planning under hurricane conditions

This paper develops a scenario-based bilevel programming model to optimize the selection of shelter locations with explicit consideration of a range of possible hurricane events and the evacuation needs under each of those events. A realistic case study for the state of North Carolina is presented. Through the case study, we demonstrate (i) the criticality of considering multiple hurricane scenarios in the location of shelters, and; (ii) the importance of considering the transportation demands of all evacuees when selecting locations for public shelters.     

Optimization approach to depot location and trip selection in one-way carsharing systems

In this paper, we present an optimization approach to depot location in one-way carsharing systems where vehicle stock imbalance issues are addressed under three trip selection schemes. The approach is based on mixed-integer programming models whose objective is to maximize the profits of a carsharing organization considering all the revenues and costs involved. The practical usefulness of the approach is illustrated with a case study involving the municipality of Lisbon, Portugal. The results we have obtained from this study provided a clear insight into the impact of depot location and trip selection schemes on the profitability of such systems.     

The simultaneous berth and quay crane allocation problem

This paper addresses efficient berth and crane allocation scheduling at a multi-user container terminal. First, we introduce a formulation for the simultaneous berth and crane allocation problem. Next, by employing genetic algorithm we develop a heuristic to find an approximate solution for the problem. The fitness value of a chromosome is obtained by crane transfer scheduling across berths, which is determined by a maximum flow problem-based algorithm based on a berth allocation problem solution defined by the chromosome. The results of numerical experiments show that the proposed heuristic is applicable to solve this difficult but essential terminal operation problem.