Truck Arrivals Scheduling with Vessel Dependent Time Windows to Reduce Carbon Emissions

Ma, Ming; Fan, Houming; Jiang, Xiaodan; Guo, Zhen

doi:10.3390/su11226410

Cited by 16 publications

(10 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, Chen et al [5] proposed a method called "time window dependent on ships" to control the arrival of external trucks. Ma et al [6] established a two-stage queuing model describing the queuing process of vehicles at gates and yards and established a reservation system based on ship-related time windows. To solve the congestion problem at the gate of the terminal, Yi et al [7] proposed an appointment scheduling method, which considered the truck cost, the number of appointments allowed in each time window, and the number of trucks available in each time window.…”

Section: Related Research On Container Terminal Congestionmentioning

confidence: 99%

Optimization of Port Emergency Materials Dispatch with Time Windows Constraints under Uncertainties

Wang

2021

Discrete Dynamics in Nature and Society

View full text Add to dashboard Cite

Uncertainties exist and affect the actual port production. For example, at the beginning of 2020, the sudden outbreak of COVID-19 seriously affected terminal production and increased the short-term pressure of handling at container terminals. Consequently, a large number of containers were stacked at terminals, and the problem of terminal congestion became more serious. To solve the congestion problem of container terminals and ensure the priority dispatch of emergency materials, this study uses the optimized arrival patterns of external trucks and a priority dispatch strategy for emergency materials to establish a bilevel optimization model for container terminals and proposes a chaotic genetic algorithm based on logistic mapping as a solution. Through numerical experiments, the algorithm proposed in this study was compared with the genetic algorithm and adaptive genetic algorithm. The experimental results show that the model and algorithm proposed in this study can effectively reduce the total cost of containers in a terminal while ensuring the priority dispatch of emergency materials, reducing the overlapping part of the time window, optimizing the arrival mode of external trucks, and reducing the waiting time of external trucks, effectively alleviating the terminal congestion problem.

show abstract

Section: Related Research On Container Terminal Congestionmentioning

confidence: 99%

Optimization of Port Emergency Materials Dispatch with Time Windows Constraints under Uncertainties

Wang

2021

Discrete Dynamics in Nature and Society

View full text Add to dashboard Cite

show abstract

“…Example 1. Suppose that there are three machines and seven jobs where (p j , s j ) for all j where 1 ≤ j ≤ 7 are given as (14,5), (12,4), (11,4), (15,3), (7, 3), (10, 2), (5,2). Figure 2 shows three Gantt charts for production schedules in identical or uniform parallel machines with one setup operator.…”

Section: Problem Description and Analysismentioning

confidence: 99%

“…An example of Step 4 in Algorithm 1. Suppose that there are three machines and eight jobs in which v 1 , v 2 , and v 3 are 0.8, 1.0, and 1.2, respectively, and (p j , s j ) = (7, 2), (8, 1), (9, 4), (5, 1), (4, 1),(7,4), (2, 1),(6,3) for 1 ≤ j ≤ 8. Assume that J 1 = {1, 2, 3, 4, 6, 8}, J 2 = {2, 5, 7, 8}, and J 3 = {1, 3, 4, 5}.…”

mentioning

confidence: 99%

Uniform Parallel Machine Scheduling with Dedicated Machines, Job Splitting and Setup Resources

Kim

Lee

2018

2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)

View full text Add to dashboard Cite

We examine a uniform parallel machine scheduling problem with dedicated machines, job splitting, and limited setup resources for makespan minimization. In this problem, machines have different processing speeds, and each job can only be processed at several designated machines. A job can be split into multiple sections and those sections can be processed on multiple machines simultaneously. Sequence-independent setup times are assumed, and setup operations between jobs require setup operators that are limited. For the problem, we first develop a mathematical optimization model and for large-sized problems a constructive heuristic algorithm is proposed. Finally, we show that the algorithm developed is efficient and provides good solutions by experiments with various scenarios.

show abstract

“…Container transportation, as an economic and environmental friendly transport mode, is playing an increasingly important role in international trade [1] . Container terminals, as key nodes in the global container transportation, can be defined as a crucial interface between sea and land transportation [2][3][4] .…”

Section: Introductionmentioning

confidence: 99%

Multi-Period Coordinated Optimization on Berth Allocation and Yard Assignment in Container Terminals Based on Truck Route

Guo

Zhu

2021

IEEE Access

View full text Add to dashboard Cite

Berths and yards are the most critical parts of container terminals. Their efficiency directly influences the terminal operation efficiency. The multi-period coordinated optimization on berth allocation and yard assignment has been studied considering a multi-period interaction between the berth and yard. The coordinated optimization problem is formulated as an integer programming, aimed at minimizing the total truck travel distance, where the decision variables are the berthing positions for visiting vessels and the storage positions for export containers. In this work, the complexity of this problem is theoretically demonstrated. A tabu genetic algorithm is designed to solve the problem to obtain the optimal berthing and export container stacking positions. With this algorithm, the rule is applied to generate the initial feasible solutions, and crossover and mutation operations are simultaneously applied to optimize the initial solutions. Finally, two different scenarios, the determinate berth allocation scenario and the determinate yard assignment scenario, are presented to compare the influence of berth allocation and yard assignment on truck travel distance. The numerical experiments demonstrate that the berthing positions, stacking positions and the period segments directly affect the truck travel distance. And the multi-period coordinated optimization problem can effectively shorten the truck travel distance and improve the efficiency of the terminal operation, which supports the decisions of terminal operators and maintains the efficient development of the terminal.INDEX TERMS export container, berth allocation, yard assignment, multi-period optimization, coordinated allocation, tabu genetic algorithm.

show abstract

Truck Arrivals Scheduling with Vessel Dependent Time Windows to Reduce Carbon Emissions

Cited by 16 publications

References 41 publications

Optimization of Port Emergency Materials Dispatch with Time Windows Constraints under Uncertainties

Optimization of Port Emergency Materials Dispatch with Time Windows Constraints under Uncertainties

Uniform Parallel Machine Scheduling with Dedicated Machines, Job Splitting and Setup Resources

Multi-Period Coordinated Optimization on Berth Allocation and Yard Assignment in Container Terminals Based on Truck Route

Contact Info

Product

Resources

About