Equity and Strength in Stochastic Integer Programming Models for the Dynamic Single Airport Ground-Holding Problem

2020 ◽  
Vol 54 (4) ◽  
pp. 944-955 ◽  
Author(s):  
Alexander S. Estes ◽  
Michael O. Ball
Keyword(s):  
Integer Programming ◽  
Network Flow ◽  
Programming Model ◽  
Programming Models ◽  
Stochastic Integer Programming ◽  
Flow Problems ◽  
Proposed Model ◽  
Equity Property ◽  
Strong Formulation ◽  
Size Scales

We study stochastic integer programming models for assigning delays to flights that are destined for an airport whose capacity has been impacted by poor weather or some other exogenous factor. In the existing literature, empirical evidence seemed to suggest that a proposed integer programming model had a strong formulation, but no existing theoretical results explained the observation. We apply recent results concerning the polyhedra of stochastic network flow problems to explain the strength of the existing model, and we propose a model whose size scales better with the number of flights in the problem and that preserves the strength of the existing model. Computational results are provided that demonstrate the benefits of the proposed model. Finally, we define a type of equity property that is satisfied by both models.

scholarly journals The unit train make-up scheme for loaded direction in the heavy haul railway

2019 ◽  
Vol 1 (1) ◽  
pp. 30-44 ◽  
Author(s):  
Yuqiang Wang ◽  
Yuguang Wei ◽  
Hua Shi ◽  
Xinyu Liu ◽  
Liyuan Feng ◽  
...  
Keyword(s):  
Integer Programming ◽  
Design Methodology ◽  
Arrival Time ◽  
Programming Model ◽  
Nonlinear Integer Programming ◽  
Content Type ◽  
Proposed Model ◽  
Heavy Haul ◽  
Heavy Haul Railway

Purpose The purpose of this paper is to study the unit train make-up scheme for loaded direction in the heavy haul railway. Design/methodology/approach A 0-1 nonlinear integer programming model with the aim of minimizing the idling period between actual train arrival time and expected train arrival time for all loaded unit trains are proposed. Findings The proposed model is applied into a case study based on Daqin heavy haul railway. Results show that the proposed model can offer operators an optimal unit train make-up scheme for loaded direction in heavy haul railway. Originality/value The proposed model can offer operators an optimal unit train make-up scheme for loaded direction in heavy haul railway.

scholarly journals Solution Strategies for a Multiport Container Ship Stowage Problem

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Consuelo Parreño-Torres ◽  
Ramon Alvarez-Valdes ◽  
Francisco Parreño
Keyword(s):  
Integer Programming ◽  
Computational Analysis ◽  
Programming Model ◽  
Programming Models ◽  
Container Ship ◽  
Computational Results ◽  
Solution Strategies ◽  
Large Size ◽  
Loading And Unloading ◽  
First Time

The multiport container ship stowage problem consists in determining the position of the containers on board a ship along its route with the objective of minimizing the number of unproductive moves required in the loading and unloading operations at each port. This paper presents an integer programming model for the problem and proposes several sets of valid constraints that bring its LP-relaxation closer to an integer solution. Moreover, it presents a GRASP algorithm that generates stowage plans with a minimal number of unproductive moves in a high percentage of medium and large-size instances. An extended computational analysis has been performed in which, to the best of the authors’ knowledge, the efficiency of integer programming models for the problem is tested for the first time. With respect to GRASP, the computational results show that it performs well on different sized datasets.

scholarly journals Transfer Coordination for Metro Networks during the Start- or End-of-Service Period

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Liqiao Ning ◽  
Peng Zhao ◽  
Wenkai Xu ◽  
Ke Qiao
Keyword(s):  
Integer Programming ◽  
Adverse Effects ◽  
Waiting Time ◽  
Programming Model ◽  
Mixed Integer ◽  
Service Period ◽  
Proposed Model ◽  
Transfer Success ◽  
Metro Networks

When travelling via metro networks during the start- or end-of-service period, transferring passengers may suffer a transfer failure. Accordingly, the synchronization timetabling problem necessitates consideration of transfer waiting time and transfer availability with respect to the first or last train. Hence, transfer train index (TTI) is formulated to identify the transfer train and calculate the transfer waiting time. Furthermore, two types of connection indexes, the last connection train index (LCTI) and the first connection train index (FCTI), are devised to distinguish transfer failure from transfer success, and the penalty constraints are implemented together to reflect the adverse effects of transfer failure. Then, a mixed integer programming model is developed to concurrently reduce transfer waiting time and improve transfer availability, which can be solved by CPLEX. Finally, a case study on Beijing metro network is made to verify the method. Experimental results show that our proposed model can yield synchronization solutions with significant reductions in both the average transfer waiting time and the proportion of transfer failure passengers.

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.

Temporal and spatial harvesting of irregular systems of parcels

1996 ◽  
Vol 26 (6) ◽  
pp. 1079-1088 ◽  
Author(s):  
Stephanie Snyder ◽  
Charles ReVelle
Keyword(s):  
Integer Programming ◽  
Spatial Data ◽  
Programming Model ◽  
The United States ◽  
Simplex Algorithm ◽  
Programming Models ◽  
Mixed Integer ◽  
Central Position ◽  
Private Lands ◽  
Heuristic Solution

Spatial management issues have assumed a central position in planning for forest ecosystems in the United States on both public and private lands. The arrangement of management activities, especially harvesting activities, can often have adverse impacts on other neighboring areas of the forest. Thus, spatially explicit programming models, which can account for or prevent certain arrangements of activities or land allocations through the use of harvest adjacency constraints, have received considerable attention in the literature. The need for spatial specificity in programming models has led to the development of integer programming or mixed integer programming models. Given that integer programming problems are often viewed as a difficult class of problems to solve, heuristic solution methods have most often been used to solve spatially constrained forest management models. In this paper, a discrete (0–1) integer programming model that maximizes harvested timber volume over a multiperiod time horizon subject to harvest adjacency constraints is developed and tested for irregular, realistic systems of parcels. This model performed well computationally for many example configurations and was solved exactly using the simplex algorithm and limited branching and bounding. Certain spatial configurations with long time horizons did, however, require a nontrivial amount of branching and bounding. The model was tested using both contrived and real spatial data sets.

Sign in / Sign up

Export Citation Format

Share Document