AI planning research typically assumes that complete action models are given. On the other hand, popular approaches in reinforcement learning such as Q-learning completely eschew models and planning. Neither of these approaches is satisfactory to achieve robust human-level AI that includes planning and learning in rich structured domains. In this paper, we introduce the idea of planning with pa...

Many problems in transportation can be represented as flow problems, and can be optimally solved using efficient linear programming techniques [BIIM77] [BGAB83]. But in some cases this approach is seriously oversimplified. If the problem includes dependencies between different operations, planning is necessary. If the system parameters change dynamically, the assumptions on which flow models ar...

In this work a discrete and a dynamic model for evaluating the reliability of telecommunication networks, are defined, in the case where the set of terminals K is arbitrary. Three methods are presented. The first one is exact type called generalized method of Ahmad, while the two others are approximate and simulation-based type. The three methods are compared by an application to the Bejaia di...

Volumetric modulated arc therapy (VMAT) has found widespread clinical application in recent years. A large number of treatment planning studies have evaluated the potential for VMAT for different disease sites based on the currently available commercial implementations of VMAT planning. In contrast, literature on the underlying mathematical optimization methods used in treatment planning is sca...

This paper refers to a hierarchical production planning system in a make-to-order environment. A challenging task in this context is to determine good production parameter settings in order to benefit from established planning methods. We present a framework for hierarchical production planning which we use to identify good settings for three planning parameters, namely planned leadtimes, safet...

In this paper we propose a dynamic Stackelberg game-theoretic model for urban freight transportation planning which is able to characterize the interaction between freight and personal transportation in an urban area. The problem is formulated as a bi-level dynamic mathematical program with equilibrium constraints (MPEC) which belongs to a class of computationally challenging problems. The lowe...

The determination of the Ultimate Pit Limit (UPL) is the first step in the open pit mine planning process. In this stage that parts of the mineral deposit that are economic to mine are determined. There are several mathematical, heuristic and meta-heuristic algorithms to determine UPL. The optimization criterion in these algorithms is maximization of the total profit whilst satisfying...

We propose a mathematical model which considers the series-type product structure with n−1 predecessors. Our objective is to obtain the optimal production functions, in the planning horizon [0,T ], based on the assumptions (1) that the cost of production unit is a linear function of production quantity in a time unit, (2) that sales of finished goods occur at the end of planning horizon, and (3...