the aim of this study is to propose a new mixed integer linear programming (milp) model to find the minimum required number of yard cranes, rubber tyred gantry cranes (rtgcs), for completion the total amount of works at the end of planning horizon. in other word, we find the optimal number of yard cranes in a container terminal which completes the total amount of works. the paper supports the p...

We consider a variant of the vehicle routing problems with time windows, where the objective includes the inconvenience cost modeled by a convex function on each node. We formulate this mixed integer convex program using a novel set partitioning formulation, by considering all combinations of routes and block structures over the routes. We apply a branch-and-price framework to solve this formul...

We describe a stochastic network interdiction model for locating sensors that detect nuclear material. A nuclear material smuggler selects a path through a transportation network that maximizes the probability of avoiding detection. An interdictor installs sensors to minimize that maximum probability. We formulate this problem as a bi-level stochastic mixed-integer program, and then focus on a ...

We propose a game theoretic model for the spatial distribution of inspectors on a transportation network. The problem is to spread out the controls so as to enforce the payment of a transit toll. We formulate a linear program to find the control distribution which maximizes the expected toll revenue, and a mixed integer program for the problem of minimizing the number of evaders. Furthermore, w...

In this paper we consider the synthesis of process networks with time-varying uncertain yields in which investment in pilot plants can be considered to reduce uncertainty of the yields. We formulate this problem as a multistage stochastic program with decision dependent elements where investment strategies are considered to reduce uncertainty, and time-varying distributions are used to describe...

In this paper, we consider an Airport Gate Assignment Problem that dynamically assigns airport gates to scheduled ights based on passengers' daily origin and destination ow data. The objective of the problem is to minimize the overall connection times that passengers walk to catch their connection ights. We formulate this problem as a mixed 0-1 quadratic integer programming problem and then ref...

A variety of hybrids of Constraint Programming, Artificial Intelligence and Operations Research techniques have given impressive results. Three recent approaches are (i) the use of relaxations in constraint systems, (ii) non-systematic backtracking to boost the scalability of constraint solvers, and (iii) non-systematic backtracking to boost the scalability of branch-and-bound search. This pape...