scholarly journals Effect of prior probabilities on the classificatory performance of parametric and mathematical programming approaches to the two-group discriminant problem

1997 ◽  
Vol 1 (1) ◽  
pp. 45-51 ◽  
Author(s):  
Constantine Loucopoulos
Keyword(s):  
Integer Programming ◽  
Mathematical Programming ◽  
Group Membership ◽  
Programming Model ◽  
Simulated Data ◽  
Parametric Models ◽  
Mixed Integer ◽  
Prior Probabilities ◽  
Normal Populations ◽  
Proposed Model

A mixed-integer programming model (MIP) incorporating prior probabilities for the two-group discriminant problem is presented. Its classificatory performance is compared against that of Fisher's linear discrimininant function (LDF) and Smith's quadradic discriminant function (QDF) for simulated data from normal and nonnormal populations for different settings of the prior probabilities of group membership. The proposed model is shown to outperform both LDF and QDF for most settings of the prior probabilities when the data are generated from nonnormal populations but underperforms the parametric models for data generated from normal populations.

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.

A new mixed-integer programming model for spatial forest planning

2019 ◽  
Vol 49 (12) ◽  
pp. 1493-1503
Author(s):  
Chourouk Gharbi ◽  
Mikael Rönnqvist ◽  
Daniel Beaudoin ◽  
Marc-André Carle
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Programming Model ◽  
Specific Model ◽  
Mixed Integer ◽  
Forest Planning ◽  
Proposed Model ◽  
Modeling Software ◽  
Points Of View ◽  
Spatial Forest Planning

The unit restriction model and the area restriction model are the two main approaches to dealing with adjacency in forest harvest planning. In this paper, we present a new mixed-integer programming (MIP) formulation that can be classified as both a unit restriction approach and an area restriction approach. We need to generate a feasible cluster to formulate the model. However, unlike other approaches, there is no need to generate specific model constraints representing computationally burdensome clusters for large cases. We describe and analyze our approach by comparing it with the most efficient approaches presented in the literature. Comparisons are made from modeling and computational points of view. Results showed that the proposed model was competitive with regard to modeling complexity and size of formulation. Furthermore, it is easy to implement in standard modeling software.

scholarly journals Allocation and Scheduling of Handling Resources in the Railway Container Terminal Based on Crossing Crane Area

2021 ◽  
Vol 13 (3) ◽  
pp. 1190
Author(s):  
Gang Ren ◽  
Xiaohan Wang ◽  
Jiaxin Cai ◽  
Shujuan Guo
Keyword(s):  
Programming Model ◽  
Container Terminal ◽  
Simultaneous Optimization ◽  
Mixed Integer ◽  
Gantry Crane ◽  
Optimization Scheme ◽  
Long Distance ◽  
Proposed Model ◽  
Hybrid Heuristic Algorithm ◽  
Searching Ability

The integrated allocation and scheduling of handling resources are crucial problems in the railway container terminal (RCT). We investigate the integrated optimization problem for handling resources of the crane area, dual-gantry crane (GC), and internal trucks (ITs). A creative handling scheme is proposed to reduce the long-distance, full-loaded movement of GCs by making use of the advantages of ITs. Based on this scheme, we propose a flexible crossing crane area to balance the workload of dual-GC. Decomposing the integrated problem into four sub-problems, a multi-objective mixed-integer programming model (MIP) is developed. By analyzing the characteristic of the integrated problem, a three-layer hybrid heuristic algorithm (TLHHA) incorporating heuristic rule (HR), elite co-evolution genetic algorithm (ECEGA), greedy rule (GR), and simulated annealing (SA) is designed for solving the problem. Numerical experiments were conducted to verify the effectiveness of the proposed model and algorithm. The results show that the proposed algorithm has excellent searching ability, and the simultaneous optimization scheme could ensure the requirements for efficiency, effectiveness, and energy-saving, as well as the balance rate of dual-GC.

Research on the Freight Station Layout

2013 ◽  
Vol 380-384 ◽  
pp. 4506-4510
Author(s):  
Miao Du ◽  
Yong Qin ◽  
Zi Yang Wang ◽  
Zhong Xin Zhao ◽  
Hong Fei Yu ◽  
...  
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Programming Model ◽  
Rapid Expansion ◽  
Mixed Integer ◽  
Railway Stations ◽  
Integer Programming Model ◽  
Rail Freight ◽  
Mixed Integer Programming Model ◽  
Train Operation

At present, there are many problems existing in railway stations, such as excessive numbers and over-crowded layout, which seriously affect the scale benefit generation and rapid expansion of rail freight capacity. Aimed at these problems, a Mixed Integer programming model is proposed. Taking Lanzhou train operation depot for example, applying lingo software, the layout of freight station is obtained.

A Multi-Period Evacuation Vehicle Routing Problem Model

2014 ◽  
Vol 931-932 ◽  
pp. 578-582
Author(s):  
Sunarin Chanta ◽  
Ornurai Sangsawang
Keyword(s):  
Vehicle Routing ◽  
Public Transportation ◽  
Vehicle Routing Problem ◽  
Programming Model ◽  
High Water ◽  
Mixed Integer ◽  
Routing Problem ◽  
Problem Model ◽  
Proposed Model ◽  
Evacuation Routing

In this paper, we proposed an optimization model that addresses the evacuation routing problem for flood disaster when evacuees trying to move from affected areas to safe places using public transportation. A focus is on the situation of evacuating during high water level when special high vehicles are needed. The objective is to minimize the total traveled distance through evacuation periods where a limited number of vehicles is given. We formulated the problem as a mixed integer programming model based on the capacitated vehicle routing problem with multiple evcuation periods where demand changing by the time. The proposed model has been tested on a real-world case study affected by the severe flooding in Thailand, 2011.

scholarly journals A Synchronous Optimization Model for Multiship Shuttle Tanker Fleet Design and Scheduling Considering Hard Time Window Constraint

2018 ◽  
Vol 2018 ◽  
pp. 1-8
Author(s):  
Zhenfeng Jiang ◽  
Dongxu Chen ◽  
Zhongzhen Yang
Keyword(s):  
Time Window ◽  
Programming Model ◽  
Transportation Cost ◽  
Exact Algorithm ◽  
Mixed Integer ◽  
Routing Problem ◽  
Hard Time ◽  
Proposed Model ◽  
Total Transportation Cost ◽  
Time Window Constraints

A Synchronous Optimization for Multiship Shuttle Tanker Fleet Design and Scheduling is solved in the context of development of floating production storage and offloading device (FPSO). In this paper, the shuttle tanker fleet scheduling problem is considered as a vehicle routing problem with hard time window constraints. A mixed integer programming model aiming at minimizing total transportation cost is proposed to model this problem. To solve this model, we propose an exact algorithm based on the column generation and perform numerical experiments. The experiment results show that the proposed model and algorithm can effectively solve the problem.

Sign in / Sign up

Export Citation Format

Share Document