A large number of manufacturing operation planning problems can be formulated as state space search problems In case of sheet metal bending operation planning processing a search node involves extensive geometric reasoning Such computation intensive node processing limits the number of search nodes that can be expanded in a reasonable amount of time making it di cult to solve real life operatio...

The increasing consumption of electricity over time forces different countries to establishnew power plants and transmission lines. There are various crisp single-objective mathematicalmodels in the literature for the long-term power generation and transmission expansion planning tohelp the decision makers to make more reasonable decisions. But, in practice, most of the parametersassociated wit...

We discuss the energy generation expansion planning with environmental constraints, formulated as a nonsmooth convex constrained optimization problem. To solve such problems, methods suitable for constrained nonsmooth optimization need to be employed. We describe a recently developed approach, which applies the usual unconstrained bundle techniques to a dynamically changing “improvement functio...

Story generators typically adopt a pipelined model of generation wherein fabula structure is decided independently and prior to discourse structure. In this paper, we propose a novel story generator, PLOTSHOT, capable of reasoning over discourse materials during fabula generation such that these materials meaningfully constrain the development of a causally and intentionally coherent story. PLO...

Power generation expansion planning needs to deal with future uncertainties carefully, given that the invested generation assets will be in operation for a long time. Many stochastic programming models have been proposed to tackle this challenge. However, most previous works assume predetermined future uncertainties (i.e., fixed random outcomes with given probabilities). In several recent studi...

We present a branch-and-price-and-cut algorithm for solving large-scale instances of the multicommodity capacitated fixed-charge network design problem. The restricted master problem solved at each column generation iteration is obtained directly from the compact arc-based model by considering only a subset of the commodity flow variables. The pricing subproblem corresponds to a Lagrangian rela...

Introduction In the last years, the field of fully-automated plan generation has significantly advanced. However, in a real-world application it is likely that the plans synthesized by planning systems are not directly executable without an inspection of the user, who might require that some changes be performed in order to make the plan more suitable, robust or more preferable, or to update th...

The fixed charge capacitated multicommodity network design problem is a well-known problem, of both practical and theoretical significance. This paper presents an efficient procedure to determine tight upper bounds on the optimal solution of realistically sized problem instances. Feasible solutions are obtained by using a tabu search framework that explores the space of the continuous flow vari...

In a natural language generation module, we often distinguish two components. On the one hand it needs to be decided what should be said. This task is delegated to a planning component. Such a component might produce an expression representing the content of the proposed utterance. On the basis of this representation the syntactic generation component produces the actual output sentence(s). Alt...