Search results

This study fills a gap in previous research by investigating differences between the short- and long-run aftermarket performances in a sample of emerging v. nonemerging industries.

This paper aims to propose two solution approaches to determine the number of ground transport vehicles that are required to ensure the on-time delivery of military equipment between origin and destination node pairs in some geographic region, which is an important logistics problem at the US Transportation Command.

The author uses a mathematical program and a traditional heuristic to provide optimal and near-optimal solutions, respectively. The author also compares the approaches for random, small-scale problems to assess the quality and computational efficiency of the heuristic solution, and also uses the heuristic to solve a notional, large-scale problem typical of real problems.

This work helps analysts identify how many ground transport vehicles are needed to meet cargo delivery requirements in any military theater of operation.

This research assumes all problem data is deterministic, so it does not capture variations in requirements or transit times between nodes.

This work provides prescriptive details to military analysts and decision-makers in a timely manner. Prior to this work, insights for this type of problem were generated using time-consuming simulation taking about a week and often involving trial-and-error.

This research provides new methods to solve an important logistics problem. The heuristic presented in this paper was recently used to provide operational insights about ground vehicle requirements to support a geographic combatant command and to inform decisions for railcar recapitalization within the US Army.

The volumes of international containerized trade substantially increased over the past years. In the meantime, marine container terminal (MCT) operators are facing congestion issues at their terminals because of the increasing number of large-size vessels, the lack of innovative technologies and advanced handling equipment and the inability of proper scheduling of the available resources. This study aims to propose a novel memetic algorithm with a deterministic parameter control to facilitate the berth scheduling at MCTs and minimize the total vessel service cost.

A local search heuristic, which is based on the first-come-first-served policy, is applied at the chromosomes and population initialization stage within the developed memetic algorithm (MA). The deterministic parameter control strategy is implemented for a custom mutation operator, which alters the mutation rate values based on the piecewise function throughout the evolution of the algorithm. Performance of the proposed MA is compared with that of the alternative solution algorithms widely used in the berth scheduling literature, including a MA that does not apply the deterministic parameter control strategy, typical evolutionary algorithm, simulated annealing and variable neighborhood search.

Results demonstrate that the developed MA with a deterministic parameter control can obtain superior berth schedules in terms of the total vessel service cost within a reasonable computational time. Furthermore, greater cost savings are observed for the cases with high demand and low berthing capacity at the terminal. A comprehensive analysis of the convergence patterns indicates that introduction of the custom mutation operator with a deterministic control for the mutation rate value would provide more efficient exploration and exploitation of the search space.

This study does not account for uncertainty in vessel arrivals. Furthermore, potential changes in the vessel handling times owing to terminal disruptions are not captured.

The developed solution algorithm can serve as an efficient planning tool for MCT operators and assist with efficient berth scheduling for both discrete and continuous berthing layout cases.

The majority of studies on berth scheduling rely on the stochastic search algorithms without considering the specific problem properties and applying the guided search heuristics. Unlike canonical evolutionary algorithms, the developed algorithm uses a local search heuristic for the chromosomes and population initialization and adjusts the mutation rate values based on a deterministic parameter control strategy for more efficient exploration and exploitation of the search space.

The purpose of this paper is to improve the tactical planning of the stakeholders of the midstream liquefied natural gas (LNG) supply chain, using an optimisation approach. The results can contribute to enhance the proactivity on significant investment decisions.

A decision support tool (DST) is proposed to minimise the operational cost of a fleet of vessels. Mixed integer linear programming (MILP) used to perform contract assignment combined with a genetic algorithm solution are the foundations of the DST. The aforementioned methods present a formulation of the maritime transportation problem from the scope of tramp shipping companies.

The validation of the DST through a realistic case study illustrates its potential in generating quantitative data about the cost of the midstream LNG supply chain and the annual operations schedule for a fleet of LNG vessels.

The LNG transportation scenarios included assumptions, which were required for resource reasons, such as omission of stochasticity. Notwithstanding the assumptions made, it is to the authors’ belief that the paper meets its objectives as described above.

Potential practitioners may exploit the results to make informed decisions on the operation of LNG vessels, charter rate quotes and/or redeployment of existing fleet.

The research has a novel approach as it combines the creation of practical management tool, with a comprehensive mathematical modelling, for the midstream LNG supply chain. Quantifying future fleet costs is an alternative approach, which may improve the planning procedure of a tramp shipping company.

Marine transportation has been faced with an increasing demand for containerized cargo during the past decade. Marine container terminals (MCTs), as the facilities for connecting seaborne and inland transportation, are expected to handle the increasing amount of containers, delivered by vessels. Berth scheduling plays an important role for the total throughput of MCTs as well as the overall effectiveness of the MCT operations. This study aims to propose a novel island-based metaheuristic algorithm to solve the berth scheduling problem and minimize the total cost of serving the arriving vessels at the MCT.

A universal island-based metaheuristic algorithm (UIMA) was proposed in this study, aiming to solve the spatially constrained berth scheduling problem. The UIMA population was divided into four sub-populations (i.e. islands). Unlike the canonical island-based algorithms that execute the same metaheuristic on each island, four different population-based metaheuristics are adopted within the developed algorithm to search the islands, including the following: evolutionary algorithm (EA), particle swarm optimization (PSO), estimation of distribution algorithm (EDA) and differential evolution (DE). The adopted population-based metaheuristic algorithms rely on different operators, which facilitate the search process for superior solutions on the UIMA islands.

The conducted numerical experiments demonstrated that the developed UIMA algorithm returned near-optimal solutions for the small-size problem instances. As for the large-size problem instances, UIMA was found to be superior to the EA, PSO, EDA and DE algorithms, which were executed in isolation, in terms of the obtained objective function values at termination. Furthermore, the developed UIMA algorithm outperformed various single-solution-based metaheuristic algorithms (including variable neighborhood search, tabu search and simulated annealing) in terms of the solution quality. The maximum UIMA computational time did not exceed 306 s.

Some of the previous berth scheduling studies modeled uncertain vessel arrival times and/or handling times, while this study assumed the vessel arrival and handling times to be deterministic.

The developed UIMA algorithm can be used by the MCT operators as an efficient decision support tool and assist with a cost-effective design of berth schedules within an acceptable computational time.

A novel island-based metaheuristic algorithm is designed to solve the spatially constrained berth scheduling problem. The proposed island-based algorithm adopts several types of metaheuristic algorithms to cover different areas of the search space. The considered metaheuristic algorithms rely on different operators. Such feature is expected to facilitate the search process for superior solutions.

This paper recommends new criteria for selecting seaports of embarkation during military deployments. Most importantly, this research compares the current port selection criterion, which is to select the seaport with the shortest inland transport time from the deploying installation, to the proposed port selection criteria, which are to select the seaport based on the shortest combined inland and oceanic transit time to the destination theater.

The authors construct an original integer program to select seaports that minimize the expected delivery timeline for a set of notional, but realistic, deployment requirements. The integer program is solved considering the current as well as the proposed port selection criteria. The solutions are then compared using paired-samples t-tests to assess the statistical significance of the port selection criteria.

This work suggests that the current port selection criterion results in a 10–13% slower delivery of deploying forces as compared to the proposed port selection criteria.

This work assumes deterministic inland transit times, oceanic transit times, and seaport processing rates. Operational fluctuations in transit times and processing rates are not expected to change the findings from this research.

This research provides evidence that the current port selection criterion for selecting seaports for military units deploying from the Continental United States is suboptimal. More importantly, logistics planners could use these recommended port selection criteria to reduce the expected delivery timelines during military deployments.

Several military doctrinal references suggest that planners select seaports based on habitual installation-to-port pairings, especially for early deployers. This work recommends a change to the military's current port selection process based on empirical analyses that show improvements to deployment timelines.

This paper aims to introduce a new mixed integer programming formulation and associated heuristic algorithm to solve the Military Nodal Capacity Problem, which is a type of supply chain network design problem that involves determining the amount of capacity expansion required at theater nodes to ensure the on-time delivery of military cargo.

Supply chain network design, mixed integer programs, heuristics and regression are used in this paper.

This work helps analysts at the United States Transportation Command identify what levels of throughput capacities, such as daily processing rates of trucks and railcars, are needed at theater distribution nodes to meet warfighter cargo delivery requirements.

This research assumes all problem data are deterministic, and so it does not capture the variations in cargo requirements, transit times or asset payloads.

This work gives military analysts and decision makers prescriptive details about nodal capacities needed to meet demands. Prior to this work, insights for this type of problem were generated using multiple time-consuming simulations often involving trial-and-error to explore the trade space.

This work merges research of supply chain network design with military theater distribution problems to prescribe the optimal, or near-optimal, throughput capacities at theater nodes. The capacity levels must meet delivery requirements while adhering to constraints on the proportion of cargo transported by mode and the expected payloads for assets.

This paper aims to examine containership routing and speed optimization for maritime liner services. It focuses on a realistic case in which the transport demand, and consequently the collected revenue from the visited ports depend on the sailing speed.

The authors present an integer non-linear programming model for the containership routing and fleet sizing problem, in which the sailing speed of every leg, the ports to be included in the service and their sequence are optimized based on the net line's profit. The authors present a heuristic approach that is based on speed discretization and a genetic algorithm to solve the problem for large size instances. They present an application on a line provided by COSCO in 2017 between Asia and Europe.

The numerical results show that the proposed heuristic approach provides good quality solutions after a reasonable computation time. In addition, the demand sensitivity has a great impact on the selected route and therefore the profit function. Moreover, the more the demand is sensitive to the sailing speed, the higher the sailing speed value.

The vessel carrying capacity is not considered in an explicit way.

This paper focuses on an important aspect in liner shipping, i.e. demand sensitivity to sailing speed. It brings a novel approach that is important in a context in which sailing speed strategies and market volatility are to be considered together in network design. This perspective has not been addressed previously.

The purpose of this study is to propose a mathematical optimization model to solve the yacht mooring area re-allocation problem (YMARP). The objective of the problem is to allow the maximum number of yachts to be moored at their ideal mooring areas.

In this paper, the YMARP is introduced, formally defined and discussed. The authors develop a 0-1 integer programing optimization model for the problem, which can be solved efficiently using off-shelf solvers. The performance of the model is tested on extensive numerical experiments.

The results of the numerical experiments demonstrate that the proposed model can solve the YMARP very efficiently using off-shelf solvers like CPLEX. In particular, problems with up to 30,000 yachts and 400 mooring areas can be solved to optimum within 30 s.

This study is one of the preliminary studies to consider problems arising in yacht management in a quantitative manner. The proposed model has three main merits. First, it enables the government to better manage yachts and mooring areas. Second, with more yacht owners assigned with ideal mooring areas, the model helps reduce the traveling time of the yacht owners to yacht mooring areas. Third, by reducing the traveling time of the yacht owners, the model contributes to lessening the traffic burden in cities.

This paper aims to identify the interplay of standard Capesize optimal speeds for time charter equivalent (TCE) maximization in the Australia–China iron ore route and the optimal speeds as an operational tool for compliance with the International Maritime Organization (IMO) carbon intensity indicator (CII).

The TCE at different speeds have been calculated for four standard Capesize specifications: (1) standard Capesize with ecoelectronic engine; (2) standard Capesize with non-eco engine (3) standard Capesize vessel with an eco-electronic engine fitted with scrubber and (4) standard Capesize with non-eco engine and no scrubber fitted.

Calculations imply that in a highly inflationary bunker price context, the dollar per ton freight rates equilibrates at levels that may push optimal speeds below the speeds required for minimum CII compliance (C Rating) in the Australia–China trade. The highest deviation of optimal speeds from those required for minimum CII compliance is observed for non-eco standard Capesize vessels without scrubbers. Increased non-eco Capesize deployment would see optimal speeds structurally lower at levels that could offer CII ratings improvements.

While most of the studies have covered the use of speed as a tool to improve efficiency and emissions in the maritime sector, few have been identified in the literature to have examined the interplay between the commercial and operational performance in the dry bulk sector stemming from the freight market equilibrium. The originality of this paper lies in examining the above relation and the resulting optimal speed selection in the Capesize sector against mandatory environmental targets.