Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    THE MAXIMUM CAPTURE PROBLEM IN A WEIGHTED NETWORK (1989)
    Oxford, UK : Blackwell Publishing Ltd
    Journal of regional science 29 (1989), S. 0 
    Details
    ISSN: 1467-9787
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Geography , Economics
    Notes: . In this paper, a conditional location problem on a weighted network is examined. Attraction functions are defined and the problem is formulated as a mixed integer program. A method which simultaneously locates an additional facility on the given network and optimizes its weight is then described. A numerical example is provided.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-9787.1989.tb01388.x
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A Covering Tour Model for Planning Mobile Health Care Facilities in SuhumDistrict, Ghama (1998)
    Boston, USA and Oxford, UK : Blackwell Publishers Inc
    Journal of regional science 38 (1998), S. 0 
    Details
    ISSN: 1467-9787
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Geography , Economics
    Notes: The provision of adequate primary health care in developing countries is often troublesome. The problem is to provide a sufficient number of facilities to be geographically accessible, yet few enough to be properly stocked and staffed. In many less developed countries accessibility problems are exacerbated by extensive rainy seasons in which travel is only possible on paved roads. Using the covering tour model we investigate the use of mobile facilities to resolve this dilemma in Suhum District, Ghana. The model minimizes a mobile facility's travel while serving all population centers within range of a feasible stop. Computational results show that in the rainy season the model cannot provide full coverage; over six percent of the population is beyond a covering distance of eight kilometers. In the dry season, 99 percent of the population can be served by a tour at a covering distance of seven kilometers.Beyond a distance of four kilometers, the dry season problem becomes a trade-off between the distance traveled by healthcare patrons and mobile facilities. These results illustrate the importance of flexibility of mobile systems: if accessibility cannot be provided in all seasons it may still be provided at favorable times of the year.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/0022-4146.00113
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Location and Pricing Decisions of a MultiStore Monopoly in a Spatial Market (2004)
    Oxford, UK; Malden, USA : Blackwell Publishing Ltd/Inc.
    Journal of regional science 44 (2004), S. 0 
    Details
    ISSN: 1467-9787
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Geography , Economics
    Notes: Abstract.  This article presents an analysis of location and pricing decisions of a monopolist about to open several stores in a compact geographical space. The number of stores is made endogenous by the introduction of fixed costs. A novel methodology is developed, by which the firm's location and price decisions are represented as continuous functions defined over the geographical space. This modeling artifact generates a negligible error but simplifies the solution considerably and allows the derivation of several intuitive results. Although the focus is on one-dimensional markets, it is shown that the method can easily be adapted to two-dimensional markets.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.0022-4146.2004.00346.x
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Foreword (1995)
    Springer
    Annals of operations research 61 (1995), S. v 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02098278
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Routing problems: A bibliography (1995)
    Springer
    Annals of operations research 61 (1995), S. 227-262 
    Details
    ISSN: 1572-9338
    Keywords: Bibliography ; traveling salesman ; vehicle routing ; Chinese postman ; rural postman ; node routing ; arc routing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This bibliography contains 500 references on four classical routing problems: the Traveling Salesman Problem, the Vehicle Routing Problem, the Chinese Postman Problem, and the Rural Postman Problem. References are presented alphabetically under a number of subheadings.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02098290
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Scheduling tasks and vehicles in a flexible manufacturing system (1991)
    Springer
    International journal of flexible manufacturing systems 4 (1991), S. 5-16 
    Details
    ISSN: 1572-9370
    Keywords: flexible manufacturing systems ; production scheduling ; vehicle scheduling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract Due to their increasing applicability in modern industry, flexible manufacturing systems (FMSs), their design, and their control have been studied extensively in the recent literature. One of the most important issues that has arisen in this context is the FMS scheduling problem. This article is concerned with a new model of an FMS system, motivated by the practical application that takes into account both machine and vehicle scheduling. For the case of a given machine schedule, a simple polynomial-time algorithm is presented that checks the feasibility of a vehicle schedule and constructs it whenever one exists. Then a dynamic programming approach to construct optimal machine and vehicle schedules is proposed. This technique results in a pseudopolynomialtime algorithm for a fixed number of machines.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01325094
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Metaheuristics: A bibliography (1996)
    Springer
    Annals of operations research 63 (1996), S. 511-623 
    Details
    ISSN: 1572-9338
    Keywords: Artificial intelligence ; bibliography ; combinatorial optimization ; constraint logic programming ; evolutionary computation ; genetic algorithms ; greedy random adaptive search procedure ; heuristics ; hybrids ; local search ; metaheuristics ; neural networks ; non-monotonic search strategies ; problem-space method ; simulated annealing ; tabu search ; threshold algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Metaheuristics are the most exciting development in approximate optimization techniques of the last two decades. They have had widespread successes in attacking a variety of difficult combinatorial optimization problems that arise in many practical areas. This bibliography provides a classification of a comprehensive list of 1380 references on the theory and application of metaheuristics. Metaheuristics include but are not limited to constraint logic programming; greedy random adaptive search procedures; natural evolutionary computation; neural networks; non-monotonic search strategies; space-search methods; simulated annealing; tabu search; threshold algorithms and their hybrids. References are presented in alphabetical order under a number of subheadings.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02125421
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    A tabu search heuristic using genetic diversification for the clustered traveling salesman problem (1997)
    Springer
    Journal of heuristics 2 (1997), S. 187-200 
    Details
    ISSN: 1572-9397
    Keywords: clustered traveling salesman problem ; tabu search ; diversification ; genetic algorithms ; crossover
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The clustered traveling salesman problem is an extension of the classical traveling salesman problem where the set of vertices is partitioned into clusters. The objective is to find a least cost Hamiltonian cycle such that the vertices of each cluster are visited contiguously and the clusters are visited in a prespecified order. A tabu search heuristic is proposed to solve this problem. This algorithm periodically restarts its search by merging two elite solutions to form a new starting solution (in a manner reminiscent of genetic algorithms). Computational results are reported on sets of Euclidean problems with different characteristics.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00127356
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Efficient heuristics for the design of ring networks (1995)
    Springer
    Telecommunication systems 4 (1995), S. 177-188 
    Details
    ISSN: 1572-9451
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract In telecommunications, the Ring Design Problem (RDP) lies at the heart ofmetropolitan area network design. We propose an integer programming formulation for the RDP, as well as several ring construction and post-optimization heuristics. These heuristics are tested and compared on a series of test problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02110085
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Optimal Sequencing Rules for Some Large-Scale Flexible Manufacturing Problems Under the Manhattan and Chebychev Metrics (1998)
    Springer
    International journal of flexible manufacturing systems 10 (1998), S. 27-42 
    Details
    ISSN: 1572-9370
    Keywords: flexible manufacturing ; strip sequencing strategies ; tool partitioning ; Manhattan and Chebychev metrics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract The purpose of this paper is to develop optimal tool partitioning policies and strip sequencing strategies for a class of flexible manufacturing problems. The problems under consideration involve a large number of operations to be performed by a series of tools on a two-dimensional object. For example, these operations could consist of drilling holes in a metallic sheet. Tools are arranged in a carousel or along a toolbar according to a predetermined sequence. Operations are performed by repeatedly moving the sheet to bring the hole locations under the tool. During each pass, as all operations involving a series of consecutive tools are executed, two main problems are to be solved: (1) how to move the sheet during each pass, (2) how to partition the tools into blocks of consecutive tools. A strip strategy is used to move the sheet. Given this policy, optimal strip widths and tool partitioning policies are determined jointly. Analytical solutions are derived under two metrics corresponding to different operating modes. A numerical example is provided.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1007965500674
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...