Vehicle Sequencing at Transshipment Terminals with Handover Relations

2020 ◽  
Author(s):  
Dirk Briskorn ◽  
Malte Fliedner ◽  
Martin Tschöke
Keyword(s):  
Exact Solution ◽  
Computational Study ◽  
Solution Algorithm ◽  
Comprehensive Analysis ◽  
Container Terminals ◽  
Decision Problems ◽  
Operational Planning ◽  
Vast Number ◽  
Synchronization Problem ◽  
Structural Connections

Operational planning at transshipment nodes is a wide and challenging field of research that covers a vast number of distinct relevant applications, spanning from seaport container terminals to rail terminals to cross-docks. In this work, we study the feasibility version of a fundamental synchronization problem that assigns incoming vehicles to docking resources subject to handover relations. We carry out a comprehensive analysis of computational complexity of various problem variants and establish structural connections to famous decision problems in graph theory. We further propose an exact solution algorithm for finding feasible dock assignments, if vehicles can visit the node only once and evaluate its performance in a comprehensive computational study.

A Rule-Based Recourse for the Vehicle Routing Problem with Stochastic Demands

2019 ◽  
Vol 53 (5) ◽  
pp. 1334-1353
Author(s):  
Majid Salavati-Khoshghalb ◽  
Michel Gendreau ◽  
Ola Jabali ◽  
Walter Rei
Keyword(s):  
Exact Solution ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Computational Study ◽  
Solution Algorithm ◽  
Routing Problem ◽  
Rule Based ◽  
Stochastic Demands ◽  
Dynamic Setting ◽  
Residual Capacity

In this paper we consider the vehicle routing problem with stochastic demands (VRPSD). We consider that customer demands are only revealed when a vehicle arrives at customer locations. Failures occur whenever the residual capacity of the vehicle is insufficient to serve the observed demand of a customer. Such failures entail that recourse actions be taken to recover route feasibility. These recourse actions usually take the form of return trips to the depot, which can be either done in a reactive or proactive fashion. Over the years, there have been various policies defined to perform these recourse actions in either a static or a dynamic setting. In the present paper, we propose policies that better reflect the fixed operational rules that can be observed in practice and that also enable implementing preventive recourse actions. We define the considered operational rules and show how, for a planned route, these operational rules can be implemented using a fixed threshold-based policy to govern the recourse actions. An exact solution algorithm is developed to solve the VRPSD under the considered policies. Finally, we conduct an extensive computational study, which shows that significantly better solutions can be obtained when using the proposed policies compared with solving the problem under the classic recourse definition.

Benchmarking Performance Indicators of Indian Rail Freight by DEA Approach

2019 ◽  
pp. 173-190
Author(s):  
Neeraj Bhanot ◽  
Harwinder Singh
Keyword(s):  
Performance Evaluation ◽  
Performance Indicators ◽  
Secondary Data ◽  
Container Terminals ◽  
Operational Planning ◽  
Data Envelopment ◽  
Business Operations ◽  
Benchmarking Performance ◽  
Ccr Model

The overall development of business operations logistics activities becomes more important for firms with the globalization of economy, and therefore performance measurement, being equally important. In order to break monopolistic control of Container Corporation of India (CONCOR), Indian Railways entered competition in the container segment in January 2006 through private-public participation for customer-centric competitiveness. The purpose of this chapter is to benchmark the performance indicators in CONCOR. A case study has been conducted employing super-efficiency models of data envelopment analysis (DEA) on secondary data of CONCOR container terminals from 1994-95 to 2015-16 for performance evaluation within CONCOR. The exercise identified efficiency trends fluctuating between 75.83% to 109.51% (CCR model) and 93.52% to 100% (BCC model) within CONCOR, owing to lack of operational planning and lack of efficient staff.

scholarly journals A new solution algorithm for solving rule-sets based bilevel decision problems

2012 ◽  
Vol 27 (4) ◽  
pp. 830-854 ◽  
Author(s):  
Jie Lu ◽  
Zheng Zheng ◽  
Guangquan Zhang ◽  
Qing He ◽  
Zhongzhi Shi
Keyword(s):  
Solution Algorithm ◽  
Decision Problems ◽  
Rule Sets

scholarly journals Storage Space Allocation of Inbound Container in Railway Container Terminal

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Li Wang ◽  
Xiaoning Zhu ◽  
Zhengyu Xie
Keyword(s):  
Container Terminal ◽  
Solution Algorithm ◽  
Allocation Problem ◽  
Container Terminals ◽  
Optimization Models ◽  
Rolling Horizon ◽  
Storage Space ◽  
Space Allocation ◽  
Storage Space Allocation ◽  
Efficient Storage

Efficient storage strategy of railway container terminals is important in balancing resource utilization, reducing waiting time, and improving handling efficiency. In this paper, we consider the formulation and solution algorithm for storage space allocation problem of inbound containers in railway container terminal. The problem is formulated as two-stage optimization models, whose objectives are balancing the workload of inbound containers and reducing the overlapping amounts. An algorithm implement process based on rolling horizon approach is designed to solve the proposed models. Computational experiments on an actual railway container terminal show that the proposed approach is effective to solve space allocation problem of inbound container and is significant for the operation and organization of railway container terminals.

Sign in / Sign up

Export Citation Format

Share Document