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

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.

Author(s):  
Lingxiao Wu ◽  
Shuaian Wang

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.


2013 ◽  
Vol 380-384 ◽  
pp. 4506-4510
Author(s):  
Miao Du ◽  
Yong Qin ◽  
Zi Yang Wang ◽  
Zhong Xin Zhao ◽  
Hong Fei Yu ◽  
...  

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.


2009 ◽  
Vol 9 (1) ◽  
Author(s):  
Javier Sánchez Alejo ◽  
Modoaldo Garrido Martín ◽  
Miguel Ortega-Mier ◽  
Álvaro García-Sánchez

2012 ◽  
Vol 424-425 ◽  
pp. 994-998 ◽  
Author(s):  
Xiao Chuan Luo ◽  
Chong Zheng Na

In steelmaking plant, the process times of machines change frequently and randomly for the reason of metallurgical principle. When those change happen, the plant scheduling and caster operation must respond to keep the optimal performance profile of plant. Therefore, the integration of plant scheduling and caster operation is a crucial task. This paper presents a mixed-integer programming model and a hybrid optimized algorithm for caster operation and plant scheduling, which combine the genetic algorithm optimization and CDFM process status verification. Data experiments illustrate the efficiency of our model and algorithm.


Sign in / Sign up

Export Citation Format

Share Document