Amir Gharehgozli

Prof. Amir Gharehgozli


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2015 in Transportation Science
Verified
Journal Article
Closed access
AGAmir Gharehgozli
Amir Gharehgozli
GLGilbert Laporte
Gilbert Laporte
YYYugang Yu
Yugang Yu
RKRené de Koster
René de Koster
Annually, millions of containers enter and exit the stacking area of a terminal. If the stacking operations are not efficient, long ship, train, and truck delays will result. To improve the stacking operations, new container terminals, especially in Europe, decouple the landside and seaside by deploying twin automated stacking cranes. The cranes cannot pass each other and must be separated by a safety distance. We study how to schedule twin automated cranes to carry out a set of container storage and retrieval requests in a single block of a yard. Storage containers are initially located at the seaside and landside input/output (I/O) points of the block. Each must be stacked in a specific location of the block, selected from a set of open locations suitable for stacking the storage container. Retrieval containers are initially located in the block and must be delivered to the I/O points. Based on the importance and acceptable waiting times of different modes of transport, requests have different priorities. The problem is modeled as a multiple asymmetric generalized traveling salesman problem with precedence constraints. The objective is to minimize the makespan. We have developed an adaptive large neighborhood search heuristic to quickly compute near-optimal solutions. We have performed extensive computational experiments to assess the performance of the heuristic including validation at a real terminal. It obtains near-optimal solutions for small instances. For large instances, it is shown to yield better solutions than CPLEX truncated after four hours, and it outperforms other heuristics from practice by more than 24% in terms of makespan. The average gaps between our heuristic and optimal solutions for relaxed problems are less than 3%.

1 August 2017 in European Journal of Operational Research
Verified
Journal Article
Open access
AGAmir Gharehgozli
Amir Gharehgozli
FVFloris Gerardus Vernooij
Floris Gerardus Vernooij
NZNima Zaerpour
Nima Zaerpour

1 June 2014 in European Journal of Operational Research
Verified
Journal Article
Closed access
AGAmir Gharehgozli
Amir Gharehgozli
YYYugang Yu
Yugang Yu
RKRené de Koster
René de Koster
JUJan Tijmen Udding
Jan Tijmen Udding

15 October 2019 in Maritime Economics & Logistics
Verified
Journal Article
Closed access
PDF file
AGAmir Gharehgozli
Amir Gharehgozli
NZNima Zaerpour
Nima Zaerpour
RKRene de Koster
Rene de Koster

1 December 2014 in Interfaces
Verified
Journal Article
Closed access
MGMichael F. Gorman
Michael F. Gorman
JCJohn-Paul Clarke
John-Paul Clarke
AGAmir Gharehgozli
Amir Gharehgozli
MHMichael Hewitt
Michael Hewitt
RKRené de Koster
René de Koster
DRDebjit Roy
Debjit Roy
Freight transportation is an important part of the global supply chain. As distances shipped grow and supply chains become more complex and fragile, operations research (OR) can play an important role in improving the efficiency and robustness of supply networks. This article describes the state of the practice in OR and freight transportation, highlighting recent successful and widely used analytical techniques in oceanic transportation and port operations, and barge, freight rail, intermodal, truckload, less than truckload, and air freight transportation, as well as the use of OR techniques in third-party logistics.

31 October 2013 in International Journal of Production Research
Verified
Journal Article
Closed access
AGAmir Gharehgozli
Amir Gharehgozli
YYYugang Yu
Yugang Yu
RKRené de Koster
René de Koster
JUJan Tijmen Udding
Jan Tijmen Udding
Reshuffling containers, one of the daily operations at a container terminal, is time consuming and increases a ship’s berthing time. We propose a decision-tree heuristic to minimise the expected number of reshuffles when arriving containers should be stacked in a block of containers with an arbitrary number of piles. The heuristic algorithm uses the optimal solutions of a stochastic dynamic programming model. Since the total number of states of the dynamic programming model increases exponentially, the model can only solve small-scale problems in a reasonable time. To solve large-scale problems, the heuristic uses the results of the exact model for small-scale problems to generate generalised decision trees. These trees can be used to solve problems with a realistic number of piles. The numerical experiments show the effectiveness of the algorithm. For small-scale problems, the trees can quickly make optimal decisions. For large-scale problems, the decision-tree heuristic significantly outperforms stacking policies commonly used in practice. Using the decision trees, we can compare the performance of a shared-stacking policy, which allows containers of multiple ships to be stacked on top of each other, with a dedicated-stacking policy. Shared-stacking appears to outperform dedicated-stacking.