Given the importance of the Maritime transportation to move goods between continent, optimizing t... more Given the importance of the Maritime transportation to move goods between continent, optimizing their processes becomes the objective of many types of research. In this paper, we present a new model of the yard optimization problem which contains three important components: unloading/loading, transfer and storage process. Our proposed method called Adapted Bin Packing Algorithm for the yard optimization problem (ABPAYOP) focus on using the approach of the Bin packing algorithm to build Bins (free positions in the yard, subgroup of containers) this will be a generalization of the container stacking problem as it will include the use of yard cranes, quay cranes and internal trucks. the ABPAYOP solutions can be represented as a set of disjoint clusters satisfying of given number of constraints (yard bays, subgroup of containers). In this work, we present the new formulation of the yard optimization problem, then we will apply our heuristic ABPAYOP to solve it. Computational results are presented at the end using instances created and adapted to the ones existing in the literature. Our results illustrate the performance of the applied method for the medium and big instances.
2020 5th International Conference on Logistics Operations Management (GOL), 2020
International maritime transport has becoming an important and interesting way comparing to the l... more International maritime transport has becoming an important and interesting way comparing to the land and the rail transport. This improvement have mainly reduced the travel time and the expected delivery time, except sometimes in difficult weather conditions where actual times may be slightly longer than expected. Containers terminals are considered as an interface between different maritime actors: ship owner, freight forwarder, consignee, containers terminal and port authority. In this paper, we focus our work on a part of the marine transportation, which is the transfer of containers by internal trucks inside a containers terminal. We solve this problem by proposing a new mathematical model and new resolution methods, the obtained results prove the effectiveness of the proposed approach, which help to improve the port efficiency.
2016 3rd International Conference on Logistics Operations Management (GOL), 2016
Containers shipment has grown very fast during the last ten years, in Tanger Med port for example... more Containers shipment has grown very fast during the last ten years, in Tanger Med port for example, 3Millions containers (80% in transshipment) TEUs (Twenty feet equivalent unit) has been changed during 2015 (Tanger Med Port authority “TMPA” study March'2016 [1]), which correspond to an increase of 40% comparing with the last study made in 2012. Thus, our study will deal with the port management and the improvement of the operations processes. The aim of this paper is to define a new strategies to solve the container stacking problem (CSP) using an approach of optimization. Thus we define a new MIP (Mathematical Integer Program) to deal with the operational tasks in a containers terminal. In which we optimize the number of the stacks used to store a given number of inbound containers and also we minimize the related cost of the traveling distance for inbound containers between the sea side and the yard side. This paper is organized as follow: we introduce and locate first our problem, then we present the literature review of the CSP. The problem definition and the MIP introduction will be the subject of the next section, and we finish by presenting the findings and the future perspectives. As a proposed resolution approach for our MIP, we propose a developed genetic algorithm strategy (DGAS) as a metaheuristic and the Branch & Cut (B&C) as an exact method. Our main objective is to avoid reshuffles and to find out the best yard configuration to store inbound containers. The DGAS will be applied to an existing instances in the literature, and the obtained numerical results is compared with the Cplex results (B&C). The main inputs for our proposed framework are the height, weight, destination, type containers & yard bays, and the expected departure time (EDT). Our objective at the end is to have an optimized guide to the planners to easily define the unloading plan and the storage position for each container, giving an initial stacking state and a container demand.
Given the importance of the Maritime transportation to move goods between continent, optimizing t... more Given the importance of the Maritime transportation to move goods between continent, optimizing their processes becomes the objective of many types of research. In this paper, we present a new model of the yard optimization problem which contains three important components: unloading/loading, transfer and storage process. Our proposed method called Adapted Bin Packing Algorithm for the yard optimization problem (ABPAYOP) focus on using the approach of the Bin packing algorithm to build Bins (free positions in the yard, subgroup of containers) this will be a generalization of the container stacking problem as it will include the use of yard cranes, quay cranes and internal trucks. the ABPAYOP solutions can be represented as a set of disjoint clusters satisfying of given number of constraints (yard bays, subgroup of containers). In this work, we present the new formulation of the yard optimization problem, then we will apply our heuristic ABPAYOP to solve it. Computational results are presented at the end using instances created and adapted to the ones existing in the literature. Our results illustrate the performance of the applied method for the medium and big instances.
2020 5th International Conference on Logistics Operations Management (GOL), 2020
International maritime transport has becoming an important and interesting way comparing to the l... more International maritime transport has becoming an important and interesting way comparing to the land and the rail transport. This improvement have mainly reduced the travel time and the expected delivery time, except sometimes in difficult weather conditions where actual times may be slightly longer than expected. Containers terminals are considered as an interface between different maritime actors: ship owner, freight forwarder, consignee, containers terminal and port authority. In this paper, we focus our work on a part of the marine transportation, which is the transfer of containers by internal trucks inside a containers terminal. We solve this problem by proposing a new mathematical model and new resolution methods, the obtained results prove the effectiveness of the proposed approach, which help to improve the port efficiency.
2016 3rd International Conference on Logistics Operations Management (GOL), 2016
Containers shipment has grown very fast during the last ten years, in Tanger Med port for example... more Containers shipment has grown very fast during the last ten years, in Tanger Med port for example, 3Millions containers (80% in transshipment) TEUs (Twenty feet equivalent unit) has been changed during 2015 (Tanger Med Port authority “TMPA” study March'2016 [1]), which correspond to an increase of 40% comparing with the last study made in 2012. Thus, our study will deal with the port management and the improvement of the operations processes. The aim of this paper is to define a new strategies to solve the container stacking problem (CSP) using an approach of optimization. Thus we define a new MIP (Mathematical Integer Program) to deal with the operational tasks in a containers terminal. In which we optimize the number of the stacks used to store a given number of inbound containers and also we minimize the related cost of the traveling distance for inbound containers between the sea side and the yard side. This paper is organized as follow: we introduce and locate first our problem, then we present the literature review of the CSP. The problem definition and the MIP introduction will be the subject of the next section, and we finish by presenting the findings and the future perspectives. As a proposed resolution approach for our MIP, we propose a developed genetic algorithm strategy (DGAS) as a metaheuristic and the Branch & Cut (B&C) as an exact method. Our main objective is to avoid reshuffles and to find out the best yard configuration to store inbound containers. The DGAS will be applied to an existing instances in the literature, and the obtained numerical results is compared with the Cplex results (B&C). The main inputs for our proposed framework are the height, weight, destination, type containers & yard bays, and the expected departure time (EDT). Our objective at the end is to have an optimized guide to the planners to easily define the unloading plan and the storage position for each container, giving an initial stacking state and a container demand.
Uploads
Papers by chafik razouk