Location models in the public sector

The past four decades have witnessed an explosive growth in the field of networkbased facilitylocation modeling. This is not at all surprising since location policy is one of the mostprofitable areas of applied systems analysis in regional science and ample theoretical andapplied challenges are offered. Location-allocation models seek the location of facilitiesand/or services (e.g., schools, hospitals, and warehouses) so as to optimize one or severalobjectives generally related to the efficiency of the system or to the allocation of resources.This paper concerns the location of facilities or services in discrete space or networks, thatare related to the public sector, such as emergency services (ambulances, fire stations, andpolice units), school systems and postal facilities. The paper is structured as follows: first,we will focus on public facility location models that use some type of coverage criterion,with special emphasis in emergency services. The second section will examine models based onthe P-Median problem and some of the issues faced by planners when implementing thisformulation in real world locational decisions. Finally, the last section will examine newtrends in public sector facility location modeling.

The struggle against creative accounting: Is "true and fair view" part of the problem or part of the solution?

Creative accounting is a growing issue of interest in Spain. In this article we argue that the concept true and fair view can limit or promote the use of creative accounting depending upon its interpretation. We review the range of meanings that true and fair view can take at an international level and compare the experience of the United Kingdom with the Australian one by analysing the use of true and fair view to limit creative accounting. Finally, we suggest lines of action to be considered by the Spanish accounting standards-setting institutions.

A new chance-constrained maximum capture location problem

The paper presents a new model based on the basic Maximum Capture model,MAXCAP. The New Chance Constrained Maximum Capture modelintroduces astochastic threshold constraint, which recognises the fact that a facilitycan be open only if a minimum level of demand is captured. A metaheuristicbased on MAX MIN ANT system and TABU search procedure is presented tosolve the model. This is the first time that the MAX MIN ANT system isadapted to solve a location problem. Computational experience and anapplication to 55 node network are also presented.

Inventory-routing model, for a multi-period problem with stochastic and deterministic demand

The need for integration in the supply chain management leads us to considerthe coordination of two logistic planning functions: transportation andinventory. The coordination of these activities can be an extremely importantsource of competitive advantage in the supply chain management. The battle forcost reduction can pass through the equilibrium of transportation versusinventory managing costs. In this work, we study the specific case of aninventory-routing problem for a week planning period with different types ofdemand. A heuristic methodology, based on the Iterated Local Search, isproposed to solve the Multi-Period Inventory Routing Problem with stochasticand deterministic demand.

The donor problem

Donors often rely on local intermediaries to deliver benefits to target beneficiaries. Each selected recipient observes if the intermediary under-delivers to them, so they serve as natural monitors. However, they may withhold complaints when feeling unentitled or grateful to the intermediary for selecting them. Furthermore, the intermediary may distort selection (e.g. by picking richer recipients who feel less entitled) to reduce complaints. We design an experimental game representing the donor s problem. In one treatment, the intermediary selects recipients. In the other, selection is random - as by an uninformed donor. In our data, random selection dominates delegation of the selection task to the intermediary. Selection distortions are similar, but intermediaries embezzle more when they have selection power and (correctly) expect fewer complaints.

Variance reduction methods for simulation of densities on Wiener space

We develop a general error analysis framework for the Monte Carlo simulationof densities for functionals in Wiener space. We also study variancereduction methods with the help of Malliavin derivatives. For this, wegive some general heuristic principles which are applied to diffusionprocesses. A comparison with kernel density estimates is made.

A simple optimised search heuristic for the job-shop scheduling problem

This paper presents a simple Optimised Search Heuristic for the Job Shop Scheduling problem that combines a GRASP heuristic with a branch-and-bound algorithm. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times.

Metaheuristics for the bus-driver scheduling problem

We present new metaheuristics for solving real crew scheduling problemsin a public transportation bus company. Since the crews of thesecompanies are drivers, we will designate the problem by the bus-driverscheduling problem. Crew scheduling problems are well known and severalmathematical programming based techniques have been proposed to solvethem, in particular using the set-covering formulation. However, inpractice, there exists the need for improvement in terms of computationalefficiency and capacity of solving large-scale instances. Moreover, thereal bus-driver scheduling problems that we consider can present variantaspects of the set covering, as for example a different objectivefunction, implying that alternative solutions methods have to bedeveloped. We propose metaheuristics based on the following approaches:GRASP (greedy randomized adaptive search procedure), tabu search andgenetic algorithms. These metaheuristics also present some innovationfeatures based on and genetic algorithms. These metaheuristics alsopresent some innovation features based on the structure of the crewscheduling problem, that guide the search efficiently and able them tofind good solutions. Some of these new features can also be applied inthe development of heuristics to other combinatorial optimizationproblems. A summary of computational results with real-data problems ispresented.

Adaptive dynamics and the implementation problem with complete information

This paper studies the equilibrating process of several implementationmechanisms using naive adaptive dynamics. We show that the dynamics convergeand are stable, for the canonical mechanism of implementation in Nash equilibrium.In this way we cast some doubt on the criticism of ``complexity'' commonlyused against this mechanism. For mechanisms that use more refined equilibrium concepts,the dynamics converge but are not stable. Some papers in the literatureon implementation with refined equilibrium concepts have claimed that themechanisms they propose are ``simple'' and implement ``everything'' (incontrast with the canonical mechanism). The fact that some of these ``simple''mechanisms have unstable equilibria suggests that these statements shouldbe interpreted with some caution.

Dispersal probability distributions and the wave-front speed problem

The speed and width of front solutions to reaction-dispersal models are analyzed both analytically and numerically. We perform our analysis for Laplace and Gaussian distribution kernels, both for delayed and nondelayed models. The results are discussed in terms of the characteristic parameters of the models

Note on the blocking flow shop problem

We present some results attained with different algorithms for the Fm|block|Cmax problem using as experimental data the well-known Taillard instances.

Bayesian image reconstruction with space-variant noise suppression

In this paper we present a Bayesian image reconstruction algorithm with entropy prior (FMAPE) that uses a space-variant hyperparameter. The spatial variation of the hyperparameter allows different degrees of resolution in areas of different statistical characteristics, thus avoiding the large residuals resulting from algorithms that use a constant hyperparameter. In the first implementation of the algorithm, we begin by segmenting a Maximum Likelihood Estimator (MLE) reconstruction. The segmentation method is based on using a wavelet decomposition and a self-organizing neural network. The result is a predetermined number of extended regions plus a small region for each star or bright object. To assign a different value of the hyperparameter to each extended region and star, we use either feasibility tests or cross-validation methods. Once the set of hyperparameters is obtained, we carried out the final Bayesian reconstruction, leading to a reconstruction with decreased bias and excellent visual characteristics. The method has been applied to data from the non-refurbished Hubble Space Telescope. The method can be also applied to ground-based images.

Potencialidad de la modelización state-space y el filtro de Kalman para el anàlisis regional : una aplicación para el índice de actividad industrial

El déficit existente a nuestro país con respecto a la disponibilidad de indicadores cuantitativos con los que llevar a término un análisis coyuntural de la actividad industrial regional ha abierto un debate centrado en el estudio de cuál es la metodología más adecuada para elaborar indicadores de estas características. Dentro de este marco, en este trabajo se presentan las principales conclusiones obtenidas en anteriores estudios (Clar, et. al., 1997a, 1997b y 1998) sobre la idoneidad de extender las metodologías que actualmente se están aplicando a las regiones españolas para elaborar indicadores de la actividad industrial mediante métodos indirectos. Estas conclusiones llevan a plantear una estrategia distinta a las que actualmente se vienen aplicando. En concreto, se propone (siguiendo a Israilevich y Kuttner, 1993) un modelo de variables latentes para estimar el indicador de la producción industrial regional. Este tipo de modelo puede especificarse en términos de un modelo statespace y estimarse mediante el filtro de Kalman. Para validar la metodología propuesta se estiman unos indicadores de acuerdo con ella para tres de las cuatro regiones españolas que disponen d¿un Índice de Producción Industrial (IPI) elaborado mediante el método directo (Andalucía, Asturias y el País Vasco) y se comparan con los IPIs publicados (oficiales). Los resultados obtenidos muestran el buen comportamiento de l¿estrategia propuesta, abriendo así una línea de trabajo con la que subsanar el déficit al que se hacía referencia anteriormente

Potencialidad de la modelización state-space y el filtro de Kalman para el anàlisis regional : una aplicación para el índice de actividad industrial

El déficit existente a nuestro país con respecto a la disponibilidad de indicadores cuantitativos con los que llevar a término un análisis coyuntural de la actividad industrial regional ha abierto un debate centrado en el estudio de cuál es la metodología más adecuada para elaborar indicadores de estas características. Dentro de este marco, en este trabajo se presentan las principales conclusiones obtenidas en anteriores estudios (Clar, et. al., 1997a, 1997b y 1998) sobre la idoneidad de extender las metodologías que actualmente se están aplicando a las regiones españolas para elaborar indicadores de la actividad industrial mediante métodos indirectos. Estas conclusiones llevan a plantear una estrategia distinta a las que actualmente se vienen aplicando. En concreto, se propone (siguiendo a Israilevich y Kuttner, 1993) un modelo de variables latentes para estimar el indicador de la producción industrial regional. Este tipo de modelo puede especificarse en términos de un modelo statespace y estimarse mediante el filtro de Kalman. Para validar la metodología propuesta se estiman unos indicadores de acuerdo con ella para tres de las cuatro regiones españolas que disponen d¿un Índice de Producción Industrial (IPI) elaborado mediante el método directo (Andalucía, Asturias y el País Vasco) y se comparan con los IPIs publicados (oficiales). Los resultados obtenidos muestran el buen comportamiento de l¿estrategia propuesta, abriendo así una línea de trabajo con la que subsanar el déficit al que se hacía referencia anteriormente