scholarly journals Optimization Approach for Yard Crane Scheduling Problem with Uncertain Parameters in Container Terminals

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Wenqian Liu ◽  
Xiaoning Zhu ◽  
Li Wang ◽  
Baicheng Yan ◽  
Xuewei Zhang
Keyword(s):  
Large Scale ◽  
Programming Model ◽  
Container Terminals ◽  
Small Scale ◽  
Optimization Approach ◽  
Basic Solution ◽  
Scheduling Problem ◽  
Crane Scheduling ◽  
Operation Efficiency ◽  
Yard Crane Scheduling

As the core operational issue in container terminals, yard crane scheduling problem directly affects the overall operation efficiency of port connecting highway or railway transportation and sea transportation. In practice, the scheduling of yard cranes is subject to many uncertain factors, so the scheme may be inapplicable and needs to be adjusted. From the perspective of proactive strategy, considering fluctuations in arrival time of external trucks as well as varied handling volume of yard cranes, a stochastic programming model is established in this paper to obtain a fixed scheme with the minimum expected value of yard crane makespan and total task waiting time over all the scenarios. The scheme does not require rescheduling when facing different situations. Subsequently, two algorithms based on certain rules are proposed to obtain the yard crane operation scheme in the deterministic environment, which are taken as the basic solution in the uncertain conditions, and then a tailored genetic algorithm is adopted to find the optimal solution with good adaptability to the uncertain scenarios. Finally, we use small-scale examples to compare the performance of algorithms in the deterministic and uncertain environment and then analyze the relationship between different yard crane configurations and the number of tasks. Large-scale experiments are performed to study the operation efficiency of the storage yard with different handling volumes assigned to each yard crane.

The Integrated Berth and Quay Crane Scheduling Problem in Container Terminals

2014 ◽  
Vol 587-589 ◽  
pp. 1793-1796
Author(s):  
Chun Ji Wu ◽  
Li Hua Chen ◽  
Qing Yu Zhao ◽  
Jin Xin Cao
Keyword(s):  
Programming Model ◽  
Container Terminals ◽  
Utilization Rate ◽  
Scheduling Problem ◽  
Current Development ◽  
Quay Crane Scheduling ◽  
Crane Scheduling ◽  
Operation Efficiency ◽  
Quay Cranes ◽  
Practical Operation

With the current development of the berth and quay crane in China, minimizing the total time of all ships stopping at the port, and maximizing the utilization rate of quay cranes to reduce the waiting time in the queue at the anchorage are the key to success in the field of container terminals. The objective of this paper is to minimize the total time of all stopped ships at the port and to maximize the operation efficiency of quay cranes. Compared with single berth and quay crane allocation, this paper analyzes the berth-quay crane as a whole, and an integer programming model with some constraints is built for this problem. Then the heuristic algorithm is used in this paper to optimize the problem and gain the solution. This paper provides a guide for practical operation.

The Integrated Yard Truck and Yard Crane Scheduling and Storage Allocation Problem at Container Terminals

2014 ◽  
Vol 587-589 ◽  
pp. 1797-1800
Author(s):  
Li Hua Chen ◽  
Zhi Jun Gao ◽  
Chun Ji Wu ◽  
Jin Xin Cao
Keyword(s):  
Integer Programming ◽  
Programming Model ◽  
Allocation Problem ◽  
Container Terminals ◽  
Storage Allocation ◽  
Crane Scheduling ◽  
Integer Programming Model ◽  
Local Sequence ◽  
Yard Crane Scheduling ◽  
And Storage

The storage block allocation, the yard truck and yard crane scheduling are three separate sub-problems in container terminals, playing an important role in the efficiency of port discharging operations. This paper proposes an integer programming model considering these three problems as a whole. The objective is to minimize the time when all the unloading operations have been completed and all containers have been stacked at storage block. A Local Sequence-Cut (LSC) method is developed to solve the problem.

scholarly journals Berth Scheduling Problem Considering Traffic Limitations in the Navigation Channel

2018 ◽  
Vol 10 (12) ◽  
pp. 4795 ◽  
Author(s):  
Ya Xu ◽  
Kelei Xue ◽  
Yuquan Du
Keyword(s):  
Large Scale ◽  
Simulated Annealing Algorithm ◽  
Programming Model ◽  
Container Terminals ◽  
Mixed Integer ◽  
Computational Time ◽  
Scheduling Problem ◽  
Navigation Channel ◽  
Temporary Closure ◽  
Berth Scheduling

In view of the trend of upsizing ships, the physical limitations of natural waterways, huge expenses, and unsustainable environmental impact of channel widening, this paper aims to provide a cost-efficient but applicable solution to improve the operational performance of container terminals that are enduring inefficiency caused by channel traffic limitations. We propose a novel berth scheduling problem considering the traffic limitations in the navigation channel, which appears in many cases including insufficient channel width, bad weather, poor visibility, channel accidents, maintenance dredging of the navigation channel, large vessels passing through the channel, and so on. To optimally utilize the berth and improve the service quality for customers, we propose a mixed-integer linear programming model to formulate the berth scheduling problem under the one-way ship traffic rule in the navigation channel. Furthermore, we develop a more generalized model which can cope with hybrid traffic in the navigation channel including one-way traffic, two-way traffic, and temporary closure of the navigation channel. For large-scale problems, a hybrid simulated annealing algorithm, which employs a problem-specific heuristic, is presented to reduce the computational time. Computational experiments are performed to evaluate the effectiveness and practicability of the proposed method.

scholarly journals Research on the Scheduling Problem of Movie Scenes

2019 ◽  
Vol 2019 ◽  
pp. 1-8
Author(s):  
Yulian Liu ◽  
Qiuji Sun ◽  
Xiaotian Zhang ◽  
Yiwei Wu
Keyword(s):  
Numerical Experiments ◽  
Large Scale ◽  
Programming Model ◽  
Small Scale ◽  
Scheduling Problem ◽  
Swarm Optimization ◽  
Integer Linear Programming Model ◽  
Factors Affecting ◽  
Total Cost ◽  
The Cost

The scheduling problem of movie scenes refers to the reasonable ordering of the shooting sequence of the scene, thereby minimizing the total cost of the movie scenes. This paper considers the factors affecting the cost of movie scenes shooting in the real world and constructs an integer linear programming model. A tabu search based method (TSBM) and a particle swarm optimization based method (PSOBM) are designed to solve larger-scale problems. Numerical experiments show that both TSBM and PSOBM are suitable for solving small-scale movie scenes scheduling problem. Moreover, through the comparison experiments between TSBM and PSOBM, it is verified that the TSBM can effectively solve the large-scale movie scenes scheduling problem.

scholarly journals A robust-heuristic optimization approach to a green supply chain design with consideration of assorted vehicle types and carbon policies under uncertainty

2021 ◽  
Author(s):  
Zahra Homayouni ◽  
Mir Saman Pishvaee ◽  
Hamed Jahani ◽  
Dmitry Ivanov
Keyword(s):  
Supply Chains ◽  
Large Scale ◽  
Programming Model ◽  
Supply Chain Design ◽  
Heuristic Optimization ◽  
Optimization Approach ◽  
Economic Uncertainty ◽  
Cap And Trade ◽  
Sustainable Logistics ◽  
Goal Programming Model

AbstractAdoption of carbon regulation mechanisms facilitates an evolution toward green and sustainable supply chains followed by an increased complexity. Through the development and usage of a multi-choice goal programming model solved by an improved algorithm, this article investigates sustainability strategies for carbon regulations mechanisms. We first propose a sustainable logistics model that considers assorted vehicle types and gas emissions involved with product transportation. We then construct a bi-objective model that minimizes total cost as the first objective function and follows environmental considerations in the second one. With our novel robust-heuristic optimization approach, we seek to support the decision-makers in comparison and selection of carbon emission policies in supply chains in complex settings with assorted vehicle types, demand and economic uncertainty. We deploy our model in a case-study to evaluate and analyse two carbon reduction policies, i.e., carbon-tax and cap-and-trade policies. The results demonstrate that our robust-heuristic methodology can efficiently deal with demand and economic uncertainty, especially in large-scale problems. Our findings suggest that governmental incentives for a cap-and-trade policy would be more effective for supply chains in lowering pollution by investing in cleaner technologies and adopting greener practices.

Curvature Variability Study for Small- and Large-Scale Linear Fresnel Solar Fields: A Step Toward Optimization

2017 ◽  
Vol 139 (5) ◽  
Author(s):  
Sara Benyakhlef ◽  
Ahmed Al Mers ◽  
Ossama Merroun ◽  
Abdelfattah Bouatem ◽  
Hamid Ajdad ◽  
...  
Keyword(s):  
Cost Reduction ◽  
Large Scale ◽  
Small Scale ◽  
Optimization Approach ◽  
Market Penetration ◽  
Concentrated Solar Power ◽  
Sustainable Technologies ◽  
Low Efficiency ◽  
New Research ◽  
Variability Study

Reducing levelized electricity costs of concentrated solar power (CSP) plants can be of great potential in accelerating the market penetration of these sustainable technologies. Linear Fresnel reflectors (LFRs) are one of these CSP technologies that may potentially contribute to such cost reduction. However, due to very little previous research, LFRs are considered as a low efficiency technology. In this type of solar collectors, there is a variety of design approaches when it comes to optimizing such systems. The present paper aims to tackle a new research axis based on variability study of heliostat curvature as an approach for optimizing small and large-scale LFRs. Numerical investigations based on a ray tracing model have demonstrated that LFR constructors should adopt a uniform curvature for small-scale LFRs and a variable curvature per row for large-scale LFRs. Better optical performances were obtained for LFRs regarding these adopted curvature types. An optimization approach based on the use of uniform heliostat curvature for small-scale LFRs has led to a system cost reduction by means of reducing its receiver surface and height.

scholarly journals Multidepot Heterogeneous Vehicle Routing Problem for a Variety of Hazardous Materials with Risk Analysis

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Bochen Wang ◽  
Qiyuan Qian ◽  
Zheyi Tan ◽  
Peng Zhang ◽  
Aizhi Wu ◽  
...  
Keyword(s):  
Risk Analysis ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Large Scale ◽  
Programming Model ◽  
Hazardous Materials ◽  
Mixed Integer ◽  
Small Scale ◽  
Routing Problem ◽  
Heterogeneous Vehicle Routing Problem

This study investigates a multidepot heterogeneous vehicle routing problem for a variety of hazardous materials with risk analysis, which is a practical problem in the actual industrial field. The objective of the problem is to design a series of routes that minimize the total cost composed of transportation cost, risk cost, and overtime work cost. Comprehensive consideration of factors such as transportation costs, multiple depots, heterogeneous vehicles, risks, and multiple accident scenarios is involved in our study. The problem is defined as a mixed integer programming model. A bidirectional tuning heuristic algorithm and particle swarm optimization algorithm are developed to solve the problem of different scales of instances. Computational results are competitive such that our algorithm can obtain effective results in small-scale instances and show great efficiency in large-scale instances with 70 customers, 30 vehicles, and 3 types of hazardous materials.

Sign in / Sign up

Export Citation Format

Share Document