The integration of constraint solvers into proof planning has pushed the problem solving horizon. Proof planning beneets from the general functionalities of a constraint solver such as consistency checks, constraint inference, as well as the search for instantiations. However, oo-the-shelf constraint solvers are usually geared towards their typical applications. Since proof planning diiers from...

The paper examines within a uni…ed methodology expectational coordination in a series of economic models. The methodology views the predictions associated with the Rational Expectations Hypothesis as reasonable whenever they can be derived from more basic Common Knowledge hypothesis. The paper successively considers a simple non noisy N-dimensional model, standard models with " intrinsic " unce...

This paper explores French assets returns predictability within a VAR setup. Using quarterly data from 1970Q4 to 2006Q4, it turns out that bonds, equities and bills returns are actually predictable. This feature implies that the investment horizon does indeed matter in the asset allocation. The VAR parameters estimates are then used to compute real returns conditional volatility across investme...

Partially observable Markov decision processes (POMDP) can be used as a model for planning in stochastic domains. This paper considers the problem of computing optimal policies for nite horizon POMDPs. In deciding on an action to take, an agent is not only concerned with how the action would a ect the current time point, but also its impacts on the rest of the planning horizon. In a POMDP, the ...

This paper aims to model and investigate the discrete urban road network design problem, using a multi-objective time-dependent decision making approach. Given a base network made up with two-way links, candidate link expansion projects, and candidate link construction projects, the problem determines the optimal combination of one-way and two-way links, the optimal selection of capacity expans...

To the best of our knowledge, research in the Dynamic Plant Layout Problem (DPLP) assumes that the planning horizon is fixed and that material flows are known with certainty. But in practice, many companies use rolling planning horizons. Further, they have to deal with the effect of uncertainty in material flow forecasts. This paper investigates the performance of algorithms under fixed and rol...

In this paper, we address a logistics problem that a manufacturer of auto parts in the north of Spain described to the authors. The manufacturer stores products in its warehouse until customers retrieve them. The customers and the manufacturer agree upon an order pickup frequency. The problem is to find the best pickup schedule, which consists of the days and times during the day that each cust...

This paper considers a new variant of the maritime inventory routing problem which considers multiple time windows. The typical time windows that this problem considers that it may exist for certain ports which only permit a ship entering and leaving the ports within daytime due to both natural conditions and their facilities. A mathematical model formulated as mixed integer programming is deve...

This paper presents a production-inventory model for deteriorating items with stock-dependent demand under inflation in a random planning horizon. The supplier offers the retailer fully permissible delay in payment. It is assumed that the time horizon of the business period is random in nature and follows exponential distribution with a known mean. Here learning effect is also introduced for th...

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...