scholarly journals Allocation and Scheduling of Handling Resources in the Railway Container Terminal Based on Crossing Crane Area

2021 ◽  
Vol 13 (3) ◽  
pp. 1190
Author(s):  
Gang Ren ◽  
Xiaohan Wang ◽  
Jiaxin Cai ◽  
Shujuan Guo
Keyword(s):  
Programming Model ◽  
Container Terminal ◽  
Simultaneous Optimization ◽  
Mixed Integer ◽  
Gantry Crane ◽  
Optimization Scheme ◽  
Long Distance ◽  
Proposed Model ◽  
Hybrid Heuristic Algorithm ◽  
Searching Ability

The integrated allocation and scheduling of handling resources are crucial problems in the railway container terminal (RCT). We investigate the integrated optimization problem for handling resources of the crane area, dual-gantry crane (GC), and internal trucks (ITs). A creative handling scheme is proposed to reduce the long-distance, full-loaded movement of GCs by making use of the advantages of ITs. Based on this scheme, we propose a flexible crossing crane area to balance the workload of dual-GC. Decomposing the integrated problem into four sub-problems, a multi-objective mixed-integer programming model (MIP) is developed. By analyzing the characteristic of the integrated problem, a three-layer hybrid heuristic algorithm (TLHHA) incorporating heuristic rule (HR), elite co-evolution genetic algorithm (ECEGA), greedy rule (GR), and simulated annealing (SA) is designed for solving the problem. Numerical experiments were conducted to verify the effectiveness of the proposed model and algorithm. The results show that the proposed algorithm has excellent searching ability, and the simultaneous optimization scheme could ensure the requirements for efficiency, effectiveness, and energy-saving, as well as the balance rate of dual-GC.

Joint Deployment of Quay Cranes and Yard Cranes in Container Terminals at a Tactical Level

2018 ◽  
Vol 2672 (9) ◽  
pp. 35-46
Author(s):  
Lingxiao Wu ◽  
Shuaian Wang
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Programming Model ◽  
Container Terminal ◽  
Turnaround Time ◽  
Container Terminals ◽  
Mixed Integer ◽  
Sequential Method ◽  
Quay Cranes ◽  
Proposed Model

This paper discusses tactical joint quay crane (QC) and yard crane (YC) deployment in container terminals. The deployments of QCs and YCs are critical for the efficiency of container terminals. Although they are closely intertwined, the deployments of QCs and YCs are usually sequential. This paper proposes a mixed-integer programming model for the joint deployment of QCs and YCs in container terminals. The objective of the model is to minimize the weighted vessel turnaround time and the weighted delayed workload for external truck service in yard blocks, both of great importance for a container terminal but rarely considered together in the literature. This paper proves that the studied problem is NP-hard in the strong sense. Case studies demonstrate that the proposed model can obtain better solutions than the sequential method. This paper also investigates the most effective combinations of QCs and YCs for a container terminal at various demand levels.

scholarly journals Rescheduling Strategy for Berth Planning in Container Terminals: An Empirical Study from Korea

2021 ◽  
Vol 9 (5) ◽  
pp. 527
Author(s):  
Armi Kim ◽  
Hyun-Ji Park ◽  
Jin-Hyoung Park ◽  
Sung-Won Cho
Keyword(s):  
Mixed Integer Linear Programming ◽  
Arrival Time ◽  
Programming Model ◽  
Container Terminal ◽  
Container Terminals ◽  
Mixed Integer ◽  
Berth Allocation ◽  
Trade Volume ◽  
Penalty Costs ◽  
Proposed Model

The rapid increase in international trade volume has caused frequent fluctuation of the vessels’ arrival time in container terminals. In order to solve this problem, this study proposes a methodology for rescheduling berth and quay cranes caused by updated information on the arrival time of vessels. A mixed-integer linear programming model was formulated for the berth allocation and crane assignment problem, and we solved the problem using a rolling-horizon approach. Numerical experiments were conducted under three scenarios with empirical data from a container terminal located in Busan, Korea. The experiments revealed that the proposed model reduces penalty costs and overall delayed departure time compared to the results of the terminal planner.

Quay crane scheduling for multiple hatches vessel considering double-cycling strategy

2019 ◽  
Vol 120 (2) ◽  
pp. 253-264 ◽  
Author(s):  
Junliang He ◽  
Hang Yu ◽  
Caimao Tan ◽  
Wei Yan ◽  
Chao Jiang
Keyword(s):  
Programming Model ◽  
Container Terminal ◽  
Mixed Integer ◽  
Quay Crane Scheduling ◽  
Crane Scheduling ◽  
Content Type ◽  
Operation Efficiency ◽  
Double Cycling ◽  
Proposed Model ◽  
Operational Constraints

Purpose The development of mega container ships and operational pressures puts forward higher requirements on the operational ability of the container terminal. Accordingly, the purpose of this paper is to propose an effective method for quay crane (QC) scheduling of multiple hatches vessel considering double-cycling strategy to improve the operation efficiency and reduce the risk of delay. Design/methodology/approach A mixed integer programming model, which covers the main operational constraints in a container terminal, is formulated to solve the quay crane scheduling problem (QCSP) with a novel objective. Findings A case study is presented and a number of numerical experiments are conducted to validate the effectiveness of the proposed model. Meanwhile, management insights are proposed. The results demonstrate that the proposed method can efficiently solve QCSP in a container terminal, and an interesting finding is that reducing the stack layers on the vessel can improve the operation efficiency of QC. Originality/value A new mathematical model is proposed for QC scheduling at the operational level, which considers the constraints of double-cycling strategy, multiple hatches and hatch covers. The proposed model also provides methods to research the QC double-cycling problem considering the balance between energy cost and operation efficiency.

A Multi-Period Evacuation Vehicle Routing Problem Model

2014 ◽  
Vol 931-932 ◽  
pp. 578-582
Author(s):  
Sunarin Chanta ◽  
Ornurai Sangsawang
Keyword(s):  
Vehicle Routing ◽  
Public Transportation ◽  
Vehicle Routing Problem ◽  
Programming Model ◽  
High Water ◽  
Mixed Integer ◽  
Routing Problem ◽  
Problem Model ◽  
Proposed Model ◽  
Evacuation Routing

In this paper, we proposed an optimization model that addresses the evacuation routing problem for flood disaster when evacuees trying to move from affected areas to safe places using public transportation. A focus is on the situation of evacuating during high water level when special high vehicles are needed. The objective is to minimize the total traveled distance through evacuation periods where a limited number of vehicles is given. We formulated the problem as a mixed integer programming model based on the capacitated vehicle routing problem with multiple evcuation periods where demand changing by the time. The proposed model has been tested on a real-world case study affected by the severe flooding in Thailand, 2011.

scholarly journals A Synchronous Optimization Model for Multiship Shuttle Tanker Fleet Design and Scheduling Considering Hard Time Window Constraint

2018 ◽  
Vol 2018 ◽  
pp. 1-8
Author(s):  
Zhenfeng Jiang ◽  
Dongxu Chen ◽  
Zhongzhen Yang
Keyword(s):  
Time Window ◽  
Programming Model ◽  
Transportation Cost ◽  
Exact Algorithm ◽  
Mixed Integer ◽  
Routing Problem ◽  
Hard Time ◽  
Proposed Model ◽  
Total Transportation Cost ◽  
Time Window Constraints

A Synchronous Optimization for Multiship Shuttle Tanker Fleet Design and Scheduling is solved in the context of development of floating production storage and offloading device (FPSO). In this paper, the shuttle tanker fleet scheduling problem is considered as a vehicle routing problem with hard time window constraints. A mixed integer programming model aiming at minimizing total transportation cost is proposed to model this problem. To solve this model, we propose an exact algorithm based on the column generation and perform numerical experiments. The experiment results show that the proposed model and algorithm can effectively solve the problem.

scholarly journals Stop Plan of Express and Local Train for Regional Rail Transit Line

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Qin Luo ◽  
Yufei Hou ◽  
Wei Li ◽  
Xiongfei Zhang
Keyword(s):  
Energy Consumption ◽  
Travel Time ◽  
Programming Model ◽  
Urban Rail Transit ◽  
Rail Transit ◽  
Long Distance ◽  
Passenger Travel ◽  
Urban Rail ◽  
Proposed Model ◽  
Rail Line

The urban rail transit line operating in the express and local train mode can solve the problem of disequilibrium passenger flow and space and meet the rapid arrival demand of long-distance passengers. In this paper, the Logit model is used to analyze the behavior of passengers choosing trains by considering the sensitivity of travel time and travel distance. Then, based on the composition of passenger travel time, an integer programming model for train stop scheme, aimed at minimizing the total passenger travel time, is proposed. Finally, combined with a certain regional rail line in Shenzhen, the plan is solved by genetic algorithm and evaluated through the time benefit, carrying capacity, and energy consumption efficiency. The simulation result shows that although the capacity is reduced by 6 trains, the optimized travel time per person is 10.34 min, and the energy consumption is saved by about 16%, which proves that the proposed model is efficient and feasible.

scholarly journals Soft Computing Methodology to Optimize the Integrated Dynamic Models of Cellular Manufacturing Systems in a Robust Environment

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Amir-Mohammad Golmohammadi ◽  
Hasan Rasay ◽  
Zaynab Akhoundpour Amiri ◽  
Maryam Solgi ◽  
Negar Balajeh
Keyword(s):  
Machine Learning ◽  
Programming Model ◽  
Facility Layout ◽  
Cell Formation ◽  
Layout Design ◽  
Metaheuristic Algorithms ◽  
Sensitivity Analyses ◽  
Mixed Integer ◽  
Facility Layout Design ◽  
Proposed Model

Machine learning, neural networks, and metaheuristic algorithms are relatively new subjects, closely related to each other: learning is somehow an intrinsic part of all of them. On the other hand, cell formation (CF) and facility layout design are the two fundamental steps in the CMS implementation. To get a successful CMS design, addressing the interrelated decisions simultaneously is important. In this article, a new nonlinear mixed-integer programming model is presented which comprehensively considers solving the integrated dynamic cell formation and inter/intracell layouts in continuous space. In the proposed model, cells are configured in flexible shapes during the planning horizon considering cell capacity in each period. This study considers the exact information about facility layout design and material handling cost. The proposed model is an NP-hard mixed-integer nonlinear programming model. To optimize the proposed problem, first, three metaheuristic algorithms, that is, Genetic Algorithm (GA), Keshtel Algorithm (KA), and Red Deer Algorithm (RDA), are employed. Then, to further improve the quality of the solutions, using machine learning approaches and combining the results of the aforementioned algorithms, a new metaheuristic algorithm is proposed. Numerical examples, sensitivity analyses, and comparisons of the performances of the algorithms are conducted.

scholarly journals Local Blood Supply Chain Optimization: A Case Study

2020 ◽  
Vol 18 (4) ◽  
Author(s):  
Reza Babazadeh ◽  
Ali Sabbaghnia ◽  
Fatemeh Shafipour
Keyword(s):  
Supply Chain ◽  
Blood Supply ◽  
Blood Donation ◽  
Programming Model ◽  
Human Life ◽  
Mixed Integer ◽  
Model Parameters ◽  
Supply Chain Optimization ◽  
Blood Supply Chain ◽  
Proposed Model

: Blood and its products play an undeniable role in human life. In recent years, although both academics and practitioners have investigated blood-related problems, further enhancement is still warranted. In this study, a mixed-integer linear programming model was proposed for local blood supply chain management. A supply network, including temporary and fixed blood donation facilities, blood banks, and blood processing centers, was designed regarding the deteriorating nature of blood. The proposed model was applied in a real case in Urmia, Iran. The numerical results and sensitivity analysis of the key model parameters ensured the applicability of the proposed model.

scholarly journals Drone-Based Parcel Delivery Using the Rooftops of City Buildings: Model and Solution

2020 ◽  
Vol 10 (12) ◽  
pp. 4362 ◽  
Author(s):  
Junsu Kim ◽  
Hongbin Moon ◽  
Hosang Jung
Keyword(s):  
Urban Areas ◽  
Programming Model ◽  
Computation Time ◽  
Intelligent Transportation ◽  
Mixed Integer ◽  
Operation Planning ◽  
Logistics System ◽  
Proposed Model ◽  
Optimality Gap ◽  
Good Operation

In general, the demand for delivery cannot be fulfilled efficiently due to the excessive traffic in dense urban areas. Therefore, many innovative concepts for intelligent transportation of freight have recently been developed. One of these concepts relies on drone-based parcel delivery using rooftops of city buildings. To apply drone logistics system in cities, the operation design should be adequately prepared. In this regard, a mixed integer programming model for drone operation planning and a heuristic based on block stacking are newly proposed to provide solutions. Additionally, numerical experiments with three different problem sizes are conducted to check the feasibility of the proposed model and to assess the performance of the proposed heuristic. The experimental results show that the proposed model seems to be viable and that the developed heuristic provides very good operation plans in terms of the optimality gap and the computation time.

Network Design for Shipping Service of Large-Scale Intermodal Liners

2012 ◽  
Vol 2269 (1) ◽  
pp. 42-50 ◽  
Author(s):  
Qiang Meng ◽  
Shuaian Wang ◽  
Zhiyuan Liu
Keyword(s):  
Network Design ◽  
Large Scale ◽  
Programming Model ◽  
Transportation Network ◽  
Liner Shipping ◽  
Maritime Transportation ◽  
Mixed Integer ◽  
Hub And Spoke ◽  
Shipping Company ◽  
Proposed Model

A model was developed for network design of a shipping service for large-scale intermodal liners that captured essential practical issues, including consistency with current services, slot purchasing, inland and maritime transportation, multiple-type containers, and origin-to-destination transit time. The model used a liner shipping hub-and-spoke network to facilitate laden container routing from one port to another. Laden container routing in the inland transportation network was combined with the maritime network by defining a set of candidate export and import ports. Empty container flow is described on the basis of path flow and leg flow in the inland and maritime networks, respectively. The problem of network design for shipping service of an intermodal liner was formulated as a mixed-integer linear programming model. The proposed model was used to design the shipping services for a global liner shipping company.

Sign in / Sign up

Export Citation Format

Share Document