No label defined (Q3751312)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3989031
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3989031

      Statements

      1986
      0 references
      Urban services
      0 references
      Management science
      0 references
      Operations research
      0 references
      urban service delivery systems
      0 references
      bus system
      0 references
      routing
      0 references
      space-time heuristic
      0 references
      swapper algorithm
      0 references
      emergency services
      0 references
      set covering
      0 references
      deterministic location
      0 references
      hypercube queueing model
      0 references
      service networks
      0 references
      negotiation process
      0 references
      manpower planning
      0 references
      two-stage stochastic program with recourse
      0 references
      The book consists of eleven papers, devoted to some ''urban service delivery systems which are concerned with the allocation of resources to meet demand that varies over time and space... Except for sanitation and housing, each of the major areas has at least one paper'' (from A. J. Swersey's ''Introduction''). The first one, ''Alternative structural models for delivering urban services'' by E. S. Savas presents a conceptual model for defining and analyzing the role of government and/or private-sector institutions and institutional structures in delivering services in urban areas. There's no mathematical formulation of such a model but the problem structure (relations between institutional arrangements and functional areas) is informally presented in graphic and tabular form. The next three articles are concerned with the transportation area. G. Kocur's ''An extended optimization model of an urban bus system with demand variation'' contains an optimization model of a bus system. The system is represented as a continuous geometric representation of the bus network in polar coordinates consisting of route segments radially focused on the ''central business district''. The goal is to find best route spacing, route length, headway and fare in an equilibrium framework with demand sensitive to service levels. The author proposes a linear model of this sensitivity, including - besides these four - still such variables as wait time, walk time, in-vehicle travel time, auto time and cost. All variables in the problem are treated as continuous quantities, so that calculus and Lagrange multipliers technique may be used to solve the optimization problem. Three objective functions (minimize deficit, maximize the difference of ridership minus deficit, maximize ridership subject to a deficit constraint) are included into the model. The analytic derivation of results for a particular case of the first of these optimization problems is presented. Some case examples are also examined for the third one. ''TRANSCOL: a multi-period school bus routing and scheduling system'' by J. Desrosiers, J.-A. Ferland, J.-M. Rousseau, G. Lapalme and L. Chapleau contains description of a modular system (implemented on the CYBER 173 at the University of Montreal) for plannig and organizing transportation of students in a large regional school system. The TRASCOL builds also the frame-school-timetables (more precisely: a schedule of the school starting and ending times in such a way that the same bus can be used on as many routes as possible). The objective is to minimize the number of run combinations taking place during a period. This problem can be formulated as a min-max 0-1 program (the authors present its formulation). After this problem has been solved the route scheduling may be done using a heuristic approach which involves solving a series of transportation problems. The idea of this iterative process is described sketchily. Results of the application of the system in practice are also presented. In ''The multi-vehicle subscriber dial-a-ride problem'' L. D. Bodin and T. R. Sexton develops an algorithm for the problem named in the title. This problem is formulated as a nonlinear 0-1 mixed integer programming problem. The authors developed two algorithms to solve them. The paper contains a description of the second of these, called ''space-time heuristic'' together with the ''swapper algorithm'' to reassign customers to improve the solution of the initial problem. These algorithms were implemented on the UNIVAC 1108 and tested on a set of data from Project Mobility in Baltimore, MD. Results of the test are presented. The next three articles are concerned with emergency services. ''The deployment of urban emergency units: a survey'' by P. Kolesar and A. J. Swersey describes in sections 1-5 the characteristics of police, fire and ambulance systems and surveys the methods which have been applied to deployment problems in these areas. The section 6 analyses two ordinary linear programming formulations related to the average travel time model and set covering model as examples of deterministic location models applied to the fire company allocation problem. M. L. Brandeau and R. C. Larsen in ''Extending and applying the hypercube queueing model to deploy ambulances in Boston'' present an overview of the hypercube model used as a planning tool to aid in long-term deployment of emergency service vehicles. The model is informally described in the exact and approximate versions; the former in improved variant includes varying service times option, mean service time calibration option and an improved travel time estimation procedure (''Barriers algorithm''). The implementation of the model in Boston is described in detail. N. Ahitur and O. Berman (''Negotiating a coordination agreement between two adjacent service networks'') consider a problem that arises when adjacent communities provide mutual aid to one another. The used queue model is an extension of the hypercube model. The managers of two service networks exchange information about probabilities of demand and supply of services. This develops into a negotiation process, considered as a cooperative game. Requests for service form queues (two cases are analysed: zero capacity queue and FIFO queue). The authors compare two approaches to the problem: the ''overall view point'' and its approximation, the ''local view point''; the first one is more complex than the second and has no practical meaning. Some considerations about negotiating a service price are also presented. J. W. Male and S. L. Fram in ''Allocating funds for repair of leaky water distribution systems'' present several linear programming formulations in allocation problems named in the title. Three different objective functions are discussed: maximize water saved, maximize net benefits, maximize the equity involved in the distribution of funds (with respect to three different definitions of such an equity). These linear programs were tested on a synthetic data set, based on information from several sources, demonstrating the usefulness of the approach proposed. A manpower planning model with various skill levels and random demands is considered in ''Aggregation in a two-stage stochastic program for manpower planning in the service sector'' of E. P. C. Kao and M. Queyranne. The authors formulate the problem as a two-stage stochastic program with recourse. The first stage decisions determine the size and mix of regular-time work force for the entire planning horizon. The authors prove a theorem on the existence of an optimal solution of this (nonlinear) optimization problem. The second-stage decisions determine the overtime and external help needed to supplement the regular-time work force. The respective optimization problem is stated as a linear program having always a feasible solutions and a bounded optimal solution. Next, the authors propose an approach for aggregating the decision variables in both optimization problems, proving several lemmas and two theorems. The aggregation in the first-stage problem leads to a simple-variable convex minimization problem which may be solved by conventional one-dimensional methods. For the second-stage problem a bound on the aggregation error is provided and a case with no aggregation error is specified. The authors prove also two theorems concerning ''a posteriori lower bounds'' on the optimal value of the two-stage problem. The final two papers consider criminal practice problems. H. Corman in ''The cost and benefits of mandatory sentencing: crime aversion through incarceration'' examines the effects of mandatory sentencing on crime rates. No mathematical problems are formulated explicitly nor solved. In ''On the optimal allocation of prison space'', A. Barnett and A. J. Lofaso consider, how prison space should be appartioned among the members of a heterogeneous criminal class, taking as the objective the minimization of crime rates. Two stochastic models of criminal behavior are considered with empirical estimations of their key parameters: the Poisson- exponential model of crimininality (due to Avi-Itzhak, Shinnar and others) with modifications allowing correlation between the time spent in prison and the overall length of a criminal carreer, and an age-dependent model of Baland and Wilson.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references