scholarly journals Lane Allocation Optimization in Container Seaport Gate System Considering Carbon Emissions

2021 ◽  
Vol 13 (7) ◽  
pp. 3628
Author(s):  
Zhihong Jin ◽  
Xin Lin ◽  
Linlin Zang ◽  
Weiwei Liu ◽  
Xisheng Xiao
Keyword(s):  
Branch And Bound ◽  
Carbon Emissions ◽  
Integer Program ◽  
Arrival Times ◽  
Proposed Model ◽  
Gate System ◽  
Appointment System ◽  
Truck Appointment System ◽  
Gate Congestion ◽  
Allocation Decisions

Long queues of arrival trucks are a common problem in seaports, and thus, carbon emissions generated from trucks in the queue cause environmental pollution. In order to relieve gate congestion and reduce carbon emissions, this paper proposes a lane allocation framework combining the truck appointment system (TAS) for four types of trucks. Based on the distribution of arrival times obtained from the TAS, lane allocation decisions in each appointment period are determined in order to minimize the total cost, including the operation cost and carbon emissions cost. The resultant optimization model is a non-linear fractional integer program. This model was firstly transformed to an equivalent integer program with bilinear constraints. Then, an improved branch-and-bound algorithm was designed, which includes further transforming the program into a linear program using the McCormick approximation method and iteratively generating a tighter outer approximation along the branch-and-bound procedure. Numerical studies confirmed the validity of the proposed model and algorithm, while demonstrating that the lane allocation decisions could significantly reduce carbon emissions and operation costs.

scholarly journals Agent-based Truck Appointment System for Containers Pick-up Time Negotiation

2020 ◽  
Vol 14 (1) ◽  
pp. 81
Author(s):  
Fakhri Ihsan Ramadhan ◽  
Meditya Wasesa
Keyword(s):  
Container Terminal ◽  
Time Estimation ◽  
Arrival Rate ◽  
Turnaround Time ◽  
Arrival Times ◽  
Agent Based ◽  
Appointment System ◽  
Truck Appointment System ◽  
Trucking Companies ◽  
Truck Arrival

Congestion in the seaports area is a common issue in many parts of the world. Fluctuating truck arrival has been identified as one of the significant determinants of congestion. In response, a truck appointment system (TAS) is introduced to manage truck arrival, particularly at peak times. In the existing TAS mechanism, the scheduling decision is centralized and disregards the concerns of trucking companies. Moreover, TAS may complicate the business operation of trucking companies that already have a constrained truck schedule. This study proposes a decentralized negotiation mechanism in TAS that allows trucking companies to adjust arrival times by utilizing the waiting time estimation provided by the terminal operator. We develop an agent-based model of a TAS in the container terminal pick-up procedure. The simulation results indicate that compared to the existing TAS mechanism, the negotiation TAS mechanism generates a shorter average truck turnaround time regardless of truck arrival rates. In terms of average net time cost, the negotiation TAS mechanism provides better value under high truck arrival rate conditions. The incentive for trucking companies to participate in the negotiations is even higher at peak times.

scholarly journals Truck Scheduling Problem Considering Carbon Emissions under Truck Appointment System

2019 ◽  
Vol 11 (22) ◽  
pp. 6256 ◽  
Author(s):  
Fan ◽  
Ren ◽  
Guo ◽  
Li
Keyword(s):  
Carbon Emissions ◽  
Hybrid Genetic Algorithm ◽  
Operation Time ◽  
Neighborhood Search ◽  
Scheduling Problem ◽  
Low Carbon ◽  
Scheduling Scheme ◽  
Truck Scheduling ◽  
Appointment System ◽  
Truck Appointment System

Aiming at the truck scheduling problem between the outer yard and multi-terminals, the appointment optimization model of truck is established. In this model, the queue time and the operation time of truck during the appointment period of different terminals are different. Under the restriction of given appointment quotas of each appointment period, determine the arrival amount of trucks in each appointment period. The goal is to reduce carbon emissions and total costs, improve the efficiency of truck scheduling. To solve this model, hybrid genetic algorithm with variable neighborhood search was designed. Firstly, generate chromosomes, and the front part of the chromosome represents the demand for 40 ft containers and the back part represents the demand for 20 ft containers. Then, the route is generated according to the time constraint and appointment quotas of each appointment period. Finally, the neighborhood search strategy is adopted to improve the solution quality. The validity of the model and algorithm were verified by an example. A low-carbon scheduling scheme was obtained under truck appointment system. The results show that the scheduling scheme under truck appointment system uses fewer trucks, improves the efficiency of delivery, reduces the total costs, and it takes into account the requirements of low carbon.

scholarly journals Truck Appointment System for Cooperation between the Transport Companies and the Terminal Operator at Container Terminals

2020 ◽  
Vol 11 (1) ◽  
pp. 168
Author(s):  
Hyeonu Im ◽  
Jiwon Yu ◽  
Chulung Lee
Keyword(s):  
Large Scale ◽  
Container Terminal ◽  
Container Terminals ◽  
The Past ◽  
Cooperation Model ◽  
Appointment System ◽  
New Form ◽  
Truck Appointment System ◽  
Import Container ◽  
Very High

Despite the number of sailings canceled in the past few months, as demand has increased, the utilization of ships has become very high, resulting in sudden peaks of activity at the import container terminals. Ship-to-ship operations and yard activity at the container terminals are at their peak and starting to affect land operations on truck arrivals and departures. In response, a Truck Appointment System (TAS) has been developed to mitigate truck congestion that occurs between the gate and the yard of the container terminal. The vehicle booking system is developed and operated in-house at large-scale container terminals, but efficiency is low due to frequent truck schedule changes by the transport companies (forwarders). In this paper, we propose a new form of TAS in which the transport companies and the terminal operator cooperate. Numerical experiments show that the efficiency of the cooperation model is better by comparing the case where the transport company (forwarder) and the terminal operator make their own decision and the case where they cooperate. The cooperation model shows higher efficiency as there are more competing transport companies (forwarders) and more segmented tasks a truck can reserve.

scholarly journals The Integrated Networks Model: Explaining Resource Allocations in Network Markets

2003 ◽  
Vol 67 (1) ◽  
pp. 29-45 ◽  
Author(s):  
Judy K. Frels ◽  
Tasadduq Shervani ◽  
Rajendra K. Srivastava
Keyword(s):  
Resource Allocation ◽  
Value Added ◽  
Information Technology Professionals ◽  
Integrated Networks ◽  
Windows Nt ◽  
Proposed Model ◽  
Network Markets ◽  
Business Customers ◽  
The Relationship ◽  
Allocation Decisions

The last decade has witnessed a shift from a focus on the value created by a single firm and product to an examination of the value created by networks of firms (or product ecosystems) in which assets are comingled with external entities. The authors examine these market-based assets in the context of network markets and propose an Integrated Networks model in which three types of networks—user, complements, and producer—add value or enhance the attractiveness of the associated focal product. The authors empirically test the proposed model by surveying information technology professionals on their resource allocation decisions regarding the Unix and Windows NT operating systems. The findings suggest that the value added by these three networks is significantly and positively associated with resources allocated by business customers to competing products. The results also show that the three networks mediate the relationship between stand-alone product performance and resource allocation.

scholarly journals A Transient Queuing Model for Analyzing and Optimizing Gate Congestion of Railway Container Terminals

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Ming Zeng ◽  
Wenming Cheng ◽  
Peng Guo
Keyword(s):  
Container Terminal ◽  
System Optimization ◽  
Optimal Operation ◽  
Optimal Number ◽  
Time Interval ◽  
Sensitivity Testing ◽  
Queuing Model ◽  
Gate System ◽  
Gate Congestion ◽  
Service Channels

As the significant connection between the external and internal of the railway container terminal, the operation performance of the gate system plays an important role in the entire system. So the gate congestion will bring many losses to the railway container terminal, even the entire railway container freight system. In this paper, the queue length and the average waiting time of the railway container terminal gate system, as well as the optimal number of service channels during the different time period, are investigated. AnM/Ek/ntransient queuing model is developed based on the distribution of the arrival time interval and the service time; besides the transient solutions are acquired by the equally likely combinations (ELC) heuristic method. Then the model is integrated into an optimization framework to obtain the optimal operation schemes. Finally, some computational experiments are conducted for model validation, sensitivity testing, and system optimization. Experimental results indicate that the model can provide the accurate reflection to the operation situation of the railway container terminal gate system, and the approach can yield the optimal number of service channels within the reasonable computation time.

Feeder Bus Timetable Design and Vehicle Size Setting in Peak Hour Demand Conditions

2019 ◽  
Vol 2673 (10) ◽  
pp. 321-332 ◽  
Author(s):  
Xueping Dou ◽  
Qiang Meng
Keyword(s):  
Mixed Integer ◽  
Arrival Times ◽  
Non Linear Programming ◽  
Bee Colony ◽  
Proposed Model ◽  
Feeder Bus ◽  
Minlp Model ◽  
Failure Cost ◽  
Set Up ◽  
The Given

This study proposes a solution to the feeder bus timetabling problem, in which the terminal departure times and vehicle sizes are simultaneously determined based on the given transfer passengers and their arrival times at a bus terminal. The problem is formulated as a mixed integer non-linear programming (MINLP) model with the objective of minimizing the transfer waiting time of served passengers, the transfer failure cost of non-served passengers, and the operating costs of bus companies. In addition to train passengers who plan to transfer to buses, local passengers who intend to board buses are considered and treated as passengers from virtual trains in the proposed model. Passenger attitudes and behaviors toward the waiting queue caused by bus capacity constraints in peak hour demand conditions are explicitly embedded in the MINLP model. A hybrid artificial bee colony (ABC) algorithm is developed to solve the MINLP model. Various experiments are set up to account for the performance of the proposed model and solution algorithm.

scholarly journals Optimising truck arrival management and number of service gates at container terminals

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Chu Cong Minh ◽  
Nguyen Van Noi
Keyword(s):  
Time Slot ◽  
The United States ◽  
Container Terminals ◽  
Queuing Model ◽  
Content Type ◽  
Total Cost ◽  
Container Ports ◽  
Appointment System ◽  
Optimisation Model ◽  
Truck Appointment System

PurposeTruck appointment systems have been applied in critical container ports in the United States due to their potential to improve handling operations. This paper aims to develop a truck appointment system to optimise the total cost experiencing at the entrance of container terminals by managing truck arrivals and the number of service gates satisfying a given level of service.Design/methodology/approachThe approximation of Mt/G/nt queuing model is applied and integrated into a cost optimisation model to identify (1) the number of arrival trucks allowed at each time slot and (2) the number of service gates operating at each time slot that ensure the average waiting time is less than a designated time threshold. The optimisation model is solved by the Genetic Algorithm and tested with a case study. Its effectiveness is identified by comparing the model's outcomes with observed data and other recent studies.FindingsThe results indicate that the developed truck appointment system can provide more than threefold and twofold reductions of the total cost experiencing at the terminal entrance compared to the actual data and results from previous research, respectively.Originality/valueThe proposed approach provides applicably coordinated truck plans and operating service gates efficiently to decrease congestion, emission and expenses.

scholarly journals A Model for Sustainable Courier Services: Vehicle Routing with Exclusive Lanes

2020 ◽  
Vol 12 (3) ◽  
pp. 1077
Author(s):  
Keyju Lee ◽  
Junjae Chae ◽  
Bomi Song ◽  
Donghyun Choi
Keyword(s):  
Vehicle Routing ◽  
Carbon Emissions ◽  
Vehicle Routing Problem ◽  
Traffic Congestion ◽  
Urban Areas ◽  
Southeast Asian ◽  
Routing Problem ◽  
Heterogeneous Fleet ◽  
Proposed Model ◽  
Asian Cities

In Southeast Asian cities, it is common for logistic companies to operate a heterogeneous fleet of delivery vehicles with motorcycles being the preferred vehicle to handle the final phase of delivery. In such scenarios, heterogeneous fleet vehicle routing problem (HFVRP) is generally applied to plan an optimal delivery. However, in many downtown cores of large and rapidly developing Southeast Asian cities, HFVRP is neither viable nor reliable because of road usage restrictions. The purpose of this article is to develop and test a different approach that accurately takes these restrictions into account and provides viable and more sustainable results. Restrictions in this paper refer to situations of urban areas in Vietnam where (i) certain vehicle types are prohibited in specified areas or where narrow alleyways limit the utilization of vehicles that exceed the road capacity and (ii) certain roads are exclusive to certain vehicle types. In networks, limited access and exclusive lanes are represented as links, or arcs, exclusive to one or another. Taking these limitations into consideration, we have developed a unique model, which we have termed Vehicle Routing Problem with Exclusive Links (VRP-EL). The model was validated and tested for its performance on scenarios with varying ratios of exclusive links. Scenarios up to 500 customers were tested on a meta-heuristic algorithm, simulated annealing. VRP-EL produces realistic outcomes. Limiting certain links to be selected according to vehicle types increases overall travel distance. However, this increase outweighs the cost of re-planning and rerouting had they not been constrained initially. The reduction in traveling distance leads to fossil fuel reduction for the overall system. The estimation of reduced carbon emissions through applying the proposed model is presented. Considering the severe traffic congestion and carbon emissions caused by motorcycles in Vietnam, the proposed model leads to a sustainable road environment.

Sign in / Sign up

Export Citation Format

Share Document